{"meta":{"query_hash":"b418dfbd2b2b","filters":{"venue":"Theoretical Computer Science"},"cohort_total":797,"direct_labels_cover":0,"predictions_cover":797,"exported":797,"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/b418dfbd2b2b","api":"https://metacan.xera.ac/api/v1/cohort?venue=Theoretical+Computer+Science"},"results":[{"id":"W1051752637","doi":"10.1016/j.tcs.2015.07.033","title":"Efficient operations on discrete paths","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear space; Intersection (aeronautics); Time complexity; Convex hull; Discrete geometry; Quadtree; Jordan curve theorem; Combinatorics; Intersection graph; Graph; Data structure; Discrete mathematics; Regular polygon; Algorithm; Computer science; Geometry; Line graph","score_opus":0.018063704667419335,"score_gpt":0.2739309740895367,"score_spread":0.25586726942211735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1051752637","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.045757893,0.00019683546,0.93518037,0.00024834328,0.00014391962,0.00011587659,0.00032086085,0.0013731001,0.016662847],"genre_scores_gemma":[0.38505322,0.0004919021,0.588257,0.000102627775,0.00009671045,0.0002122461,0.001053659,0.0010265533,0.02370612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904853,0.00010916423,0.000045450342,0.00016789524,0.00049393246,0.0001350326],"domain_scores_gemma":[0.9988539,0.00048243543,0.00006516447,0.00036561402,0.0001578939,0.00007500292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048015465,0.0009537671,0.000981085,0.0014227871,0.0008679173,0.0018857394,0.0013525371,0.0006416016,0.015716597],"category_scores_gemma":[0.0029470187,0.0004568075,0.0007231302,0.0019087429,0.0012306941,0.0029910535,0.0031988292,0.0021238208,0.0024176305],"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.00035618694,0.00013989807,0.0004241673,0.00026363504,0.000029477938,0.00010936111,0.00035263738,0.041189376,0.016718814,0.52358973,0.009644374,0.40718234],"study_design_scores_gemma":[0.00009196457,0.00014441839,0.00035819376,0.000046170513,0.00002914794,0.00016377815,0.00022523341,0.22437367,0.017337529,0.72716546,0.03003567,0.000028690049],"about_ca_topic_score_codex":0.0010873983,"about_ca_topic_score_gemma":0.0016926482,"teacher_disagreement_score":0.015716597,"about_ca_system_score_codex":0.000741953,"about_ca_system_score_gemma":0.00074104394,"threshold_uncertainty_score":0.052577198},"labels":[],"label_agreement":null},{"id":"W1093958314","doi":"10.1016/j.tcs.2015.07.009","title":"Improved algorithms for computing minmax regret sinks on dynamic path and tree networks","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Regret; Minimax; Sink (geography); Vertex (graph theory); Computer science; Algorithm; Path (computing); Time complexity; Mathematical optimization; Mathematics; Graph; Combinatorics; Theoretical computer science; Computer network","score_opus":0.023975796748059622,"score_gpt":0.25654134736209067,"score_spread":0.23256555061403106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1093958314","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.026617374,0.00047301047,0.96711993,0.00048035377,0.00013839405,0.00019741965,0.0004361901,0.0015978026,0.0029395379],"genre_scores_gemma":[0.247636,0.00035811245,0.7434168,0.00027014955,0.0001914566,0.00048112727,0.0012380356,0.0006038499,0.0058044796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799937,0.00064473506,0.00011100429,0.00047486587,0.00042374228,0.00034628468],"domain_scores_gemma":[0.9881706,0.009028407,0.000563802,0.0008228673,0.0009698826,0.00044445772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050022393,0.0026046738,0.0034134977,0.0029174222,0.001601629,0.0031515441,0.005642326,0.0031248678,0.010564277],"category_scores_gemma":[0.020729532,0.0015990104,0.0019342841,0.0034898259,0.0022031981,0.0055116625,0.0038151138,0.00397068,0.001618263],"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.00021709455,0.00009824754,0.00049000344,0.00009406261,0.00004172586,0.000027132099,0.00007382186,0.94628304,0.00038861472,0.013890191,0.0025090314,0.035887],"study_design_scores_gemma":[0.000018899593,0.000016334161,0.00005232108,0.0000064224546,0.000007610215,0.000005749402,0.000011402472,0.98959774,0.00012730117,0.009982021,0.00016984428,0.0000042702504],"about_ca_topic_score_codex":0.012881719,"about_ca_topic_score_gemma":0.017414004,"teacher_disagreement_score":0.012881719,"about_ca_system_score_codex":0.004709535,"about_ca_system_score_gemma":0.0041552573,"threshold_uncertainty_score":0.035341024},"labels":[],"label_agreement":null},{"id":"W1201605537","doi":"10.1016/j.tcs.2015.08.008","title":"FM-index of alignment: A compressed index for similar strings","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Information and Communications Technology Promotion; Ministry of Education, Science and Technology; Ministère des Affaires Etrangères; Providence Health Care; Ministry of Science, ICT and Future Planning; National Research Foundation of Korea","keywords":"Suffix; Index (typography); Suffix array; Computer science; Compressed suffix array; Inverted index; Suffix tree; Algorithm; Search engine indexing; Mathematics; Artificial intelligence; Data structure","score_opus":0.02091421018035305,"score_gpt":0.2700424881084069,"score_spread":0.24912827792805387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1201605537","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.068787076,0.0036898972,0.890504,0.0015436535,0.0012475258,0.00053011,0.010146149,0.011362443,0.012189238],"genre_scores_gemma":[0.22010046,0.0014077895,0.7468106,0.0008026382,0.0011574391,0.0008296287,0.017189054,0.0017065433,0.009995821],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841905,0.0002408252,0.00016171878,0.00023518325,0.0007811031,0.00016207204],"domain_scores_gemma":[0.99513173,0.00125516,0.00031599047,0.0020660525,0.0009611616,0.00026995302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010746052,0.0010454147,0.0015723843,0.0059004757,0.0011935914,0.0019610808,0.001967459,0.0017086009,0.011049816],"category_scores_gemma":[0.013004641,0.00047740835,0.00060567353,0.008002302,0.0009446137,0.0051706787,0.002890503,0.0016975874,0.0042603584],"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.0021587273,0.00026721956,0.0016844561,0.00048290542,0.00008401223,0.0004170956,0.00033319314,0.01133116,0.041816052,0.057357512,0.055311985,0.8287557],"study_design_scores_gemma":[0.0005814429,0.0014690724,0.0040171575,0.0004229803,0.00025506262,0.0041088425,0.0005280274,0.45694515,0.11091165,0.28424305,0.13624203,0.00027555288],"about_ca_topic_score_codex":0.0011802887,"about_ca_topic_score_gemma":0.0014775933,"teacher_disagreement_score":0.011049816,"about_ca_system_score_codex":0.0009334921,"about_ca_system_score_gemma":0.0017886695,"threshold_uncertainty_score":0.03696531},"labels":[],"label_agreement":null},{"id":"W1484474385","doi":"10.1016/j.tcs.2015.08.010","title":"Limit behaviour of μ-equicontinuous cellular automata","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Equicontinuity; Ergodic theory; Limit (mathematics); Mathematics; Measure (data warehouse); Cellular automaton; Bernoulli's principle; Sequence (biology); Discrete mathematics; Uniform limit theorem; Pure mathematics; Mathematical analysis; Computer science; Algorithm; Physics; Data mining","score_opus":0.017775764243146655,"score_gpt":0.25038534269210844,"score_spread":0.2326095784489618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484474385","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.83254343,0.0009859584,0.11983908,0.0006756601,0.00006136494,0.00003282011,0.00012470238,0.00042542003,0.045311566],"genre_scores_gemma":[0.991293,0.00022110497,0.003770388,0.00005259838,0.000014245914,0.000028174996,0.000045743353,0.000030897,0.0045438614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943894,0.00017839194,0.000035167206,0.000086365384,0.0001616592,0.00009940234],"domain_scores_gemma":[0.9954184,0.0025579662,0.0003865208,0.00024791286,0.00087708863,0.00051217515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009517976,0.0005014022,0.0007933419,0.0014820345,0.0010880941,0.0029715057,0.0012346185,0.00096156046,0.003813925],"category_scores_gemma":[0.007572208,0.0004019287,0.0005086559,0.00067366415,0.0021025655,0.0017115705,0.0011844086,0.0011689244,0.00038629625],"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.00014805187,0.000088254514,0.0015965413,0.00010755359,0.000035104247,0.000331097,0.0006899871,0.059376933,0.007114664,0.9221754,0.00095645693,0.007379932],"study_design_scores_gemma":[0.000027512531,0.0000580309,0.00060492946,0.00004029443,0.000016999353,0.0002073799,0.00022493384,0.56172264,0.0025929955,0.43359166,0.00088381936,0.000028780467],"about_ca_topic_score_codex":0.0033526595,"about_ca_topic_score_gemma":0.0016529465,"teacher_disagreement_score":0.003813925,"about_ca_system_score_codex":0.0017915511,"about_ca_system_score_gemma":0.0006924516,"threshold_uncertainty_score":0.0129987},"labels":[],"label_agreement":null},{"id":"W1484691446","doi":"10.1016/j.tcs.2016.08.016","title":"The complexity of dominating set reconfiguration","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Dominating set; Mathematics; Discrete mathematics; Bipartite graph; Vertex (graph theory); Bounded function; Time complexity; Sequence (biology); Existential quantification; Maximal independent set; Split graph; Pathwidth; Graph; Line graph","score_opus":0.04426428454903826,"score_gpt":0.31935977987283914,"score_spread":0.2750954953238009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484691446","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.6405066,0.0041017267,0.24787806,0.01917026,0.0007042566,0.0003781202,0.00400861,0.0013195332,0.081932835],"genre_scores_gemma":[0.96526515,0.0013617333,0.023231171,0.0005498246,0.0005055264,0.0001806399,0.0013274855,0.00029270767,0.0072858515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942846,0.0019293934,0.00031311368,0.0010304326,0.0014620087,0.0009803731],"domain_scores_gemma":[0.9545282,0.03545572,0.0026705542,0.0041213436,0.0013050417,0.0019191306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032099537,0.0009397984,0.002387399,0.00158994,0.0021302782,0.008031608,0.0036672922,0.0028712035,0.011213007],"category_scores_gemma":[0.03262896,0.0012706709,0.0018841568,0.0034761124,0.003358086,0.013640236,0.003994332,0.0040558013,0.0009141838],"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.0015879559,0.00033739765,0.005013144,0.0008463711,0.00024813547,0.0005163668,0.0008695406,0.35686886,0.0059504434,0.5313458,0.022254733,0.07416118],"study_design_scores_gemma":[0.00015173915,0.00008455097,0.001165823,0.00003955982,0.00009695713,0.00035815084,0.00025624255,0.3119733,0.0012699997,0.68094826,0.0036127635,0.000042627562],"about_ca_topic_score_codex":0.0024635624,"about_ca_topic_score_gemma":0.0023628958,"teacher_disagreement_score":0.011213007,"about_ca_system_score_codex":0.0050672027,"about_ca_system_score_gemma":0.0028141502,"threshold_uncertainty_score":0.03751123},"labels":[],"label_agreement":null},{"id":"W1521364747","doi":"10.1016/j.tcs.2005.03.055","title":"Resource bounded immunity and simplicity","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Immune Systems Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Simplicity; Immunity; Bounded function; Simple (philosophy); Computer science; Mathematics; Immune system; Biology; Immunology; Epistemology; Philosophy; Mathematical analysis","score_opus":0.007459870606219056,"score_gpt":0.22743826371698556,"score_spread":0.2199783931107665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521364747","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.3445071,0.0030766756,0.40722114,0.014027223,0.00048402065,0.00008250486,0.00019252894,0.00039124867,0.23001747],"genre_scores_gemma":[0.9800286,0.00034933275,0.007971398,0.0005495016,0.00026328565,0.0000443519,0.000038701164,0.000030571027,0.0107241105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988176,0.00040343194,0.00004573102,0.00022429971,0.00032921255,0.0001796514],"domain_scores_gemma":[0.9892547,0.0073410175,0.000691382,0.0016729148,0.00057935313,0.00046050348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016476379,0.000282932,0.0008337839,0.00066926464,0.0009454425,0.0018869261,0.0007952576,0.001073895,0.0065701758],"category_scores_gemma":[0.011209176,0.00022520452,0.000565103,0.00045769144,0.0039671077,0.004000113,0.002251812,0.0023968632,0.0006231243],"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.00001338793,0.0000071693175,0.00013580856,0.000013430834,0.0000051731763,0.00003884755,0.00008496438,0.0014383235,0.00032302752,0.9942708,0.0007916991,0.0028774522],"study_design_scores_gemma":[0.000005832245,0.000007589928,0.00012550339,0.0000030860592,0.0000037284171,0.00006182221,0.000016061611,0.004825959,0.00013578059,0.9935495,0.0012616736,0.0000034669017],"about_ca_topic_score_codex":0.0004101682,"about_ca_topic_score_gemma":0.00028679473,"teacher_disagreement_score":0.0065701758,"about_ca_system_score_codex":0.0007929651,"about_ca_system_score_gemma":0.00045090402,"threshold_uncertainty_score":0.021979451},"labels":[],"label_agreement":null},{"id":"W1532642937","doi":"10.1016/j.tcs.2009.07.049","title":"On NFAs where all states are final, initial, or both","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Automaton; Nondeterministic finite automaton; Finite-state machine; Regular language; Computer science; Discrete mathematics; Theoretical computer science; Combinatorics; Mathematics; Programming language; Automata theory","score_opus":0.024796216736811667,"score_gpt":0.2909578726236236,"score_spread":0.26616165588681195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532642937","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.22074679,0.0013204851,0.71266234,0.0020856499,0.00048790788,0.00021713309,0.001194321,0.0021370715,0.0591483],"genre_scores_gemma":[0.8267475,0.0013868161,0.13148752,0.0007610882,0.00069047656,0.0006073644,0.0015876682,0.00072971504,0.03600189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951041,0.0012242445,0.00041500127,0.0011306435,0.0012007658,0.0009253843],"domain_scores_gemma":[0.98174715,0.011556686,0.0013919831,0.0033190604,0.001269526,0.0007155656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003295212,0.0012616351,0.0017571127,0.002351476,0.0033149552,0.0052014417,0.0017720019,0.0029815217,0.0085806],"category_scores_gemma":[0.013572322,0.000957538,0.0026655444,0.0022487734,0.0060569276,0.01758866,0.0042450647,0.002806266,0.0017037044],"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.00020791114,0.000084022526,0.00106289,0.00018919696,0.00005652659,0.0004342801,0.0012123488,0.008211572,0.003915029,0.96298337,0.001558516,0.020084256],"study_design_scores_gemma":[0.000028491257,0.000032298893,0.0002134095,0.000081656486,0.000037286973,0.00025050092,0.00016753259,0.01310734,0.0011197107,0.9815523,0.0033749596,0.000034579425],"about_ca_topic_score_codex":0.0035461143,"about_ca_topic_score_gemma":0.004285273,"teacher_disagreement_score":0.0085806,"about_ca_system_score_codex":0.002485845,"about_ca_system_score_gemma":0.0016816766,"threshold_uncertainty_score":0.028704941},"labels":[],"label_agreement":null},{"id":"W1541587921","doi":"10.1016/j.tcs.2015.06.056","title":"Indeterminate strings, prefix arrays &amp; undirected graphs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); String (physics); Prefix; Indeterminate; Alphabet; Discrete mathematics; Graph; Upper and lower bounds; Computer science","score_opus":0.025247949617459544,"score_gpt":0.26912634536172153,"score_spread":0.24387839574426198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541587921","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.068775624,0.009918264,0.8495553,0.0061457558,0.00089797593,0.00009440406,0.0014407247,0.0010677135,0.062104203],"genre_scores_gemma":[0.6256497,0.011771301,0.31642175,0.0015323535,0.0012671055,0.00026595965,0.0015615164,0.0004976071,0.041032758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989698,0.00043278368,0.000053840024,0.00023422664,0.00024204583,0.00006725082],"domain_scores_gemma":[0.9941274,0.0041395216,0.0005007154,0.0007105062,0.00038536955,0.00013647666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009051395,0.0005132273,0.00058903306,0.001992193,0.00087038445,0.0028481677,0.0009895429,0.001361048,0.005307146],"category_scores_gemma":[0.009265632,0.0004115518,0.0002968113,0.0051901164,0.0025813105,0.004412358,0.001082903,0.0018305707,0.0013432014],"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.000063161984,0.000023127492,0.00031792105,0.00013837841,0.000009373449,0.0001162537,0.00014459716,0.016203854,0.00076340855,0.902028,0.008395742,0.07179625],"study_design_scores_gemma":[0.000004387886,0.000008809888,0.00007459281,0.000029880252,0.0000065535555,0.00013241597,0.00005423219,0.025458554,0.00033685178,0.96264976,0.011233625,0.000010336446],"about_ca_topic_score_codex":0.0010752298,"about_ca_topic_score_gemma":0.0012202029,"teacher_disagreement_score":0.005307146,"about_ca_system_score_codex":0.00088238734,"about_ca_system_score_gemma":0.0006717402,"threshold_uncertainty_score":0.017754138},"labels":[],"label_agreement":null},{"id":"W1580076017","doi":"10.1016/s0304-3975(01)00395-4","title":"Sense of direction in distributed computing","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"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":"Computability; Computer science; Property (philosophy); Theoretical computer science; Graph; Object (grammar); Data science; Epistemology; Artificial intelligence","score_opus":0.010645526194863385,"score_gpt":0.23267844186754535,"score_spread":0.22203291567268196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580076017","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.114224434,0.008549692,0.6905624,0.020883376,0.0020590092,0.00012971427,0.00032270627,0.0005053517,0.16276328],"genre_scores_gemma":[0.9309105,0.0017793247,0.056253683,0.0008019096,0.00071553286,0.0001913736,0.0001505087,0.000093366034,0.009103672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747294,0.0010338828,0.00020619448,0.00046712992,0.00064874085,0.000171034],"domain_scores_gemma":[0.9927751,0.0035926686,0.00065796595,0.0012513632,0.0011072749,0.000615567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035231388,0.00037158767,0.00058812683,0.0016091649,0.0017482267,0.005326472,0.0011618254,0.002424701,0.002961018],"category_scores_gemma":[0.014711131,0.00047646815,0.00049729407,0.0015937999,0.008091812,0.012535414,0.002992391,0.002886368,0.0005101288],"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.000030401876,0.000012096666,0.00035441466,0.000030023339,0.0000050822,0.000024300101,0.0005986657,0.000581457,0.00018850413,0.9886227,0.00068561797,0.008866782],"study_design_scores_gemma":[0.00001791086,0.000010836469,0.00010225764,0.000007617452,0.0000057062966,0.000035502926,0.0001955917,0.0016115202,0.000075164426,0.9931855,0.0047460664,0.0000062358354],"about_ca_topic_score_codex":0.00093422976,"about_ca_topic_score_gemma":0.00073779194,"teacher_disagreement_score":0.005326472,"about_ca_system_score_codex":0.00074010494,"about_ca_system_score_gemma":0.0010665008,"threshold_uncertainty_score":0.018632352},"labels":[],"label_agreement":null},{"id":"W1584364430","doi":"10.1016/j.tcs.2015.04.037","title":"The interval constrained 3-coloring problem","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundacja na rzecz Nauki Polskiej","keywords":"Interval (graph theory); Mathematics; Combinatorics; Time complexity; Discrete mathematics","score_opus":0.031286921797765155,"score_gpt":0.30748014581150407,"score_spread":0.2761932240137389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584364430","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.20852089,0.0020136074,0.6748746,0.006672159,0.0009083988,0.0005097998,0.007479939,0.0016655894,0.09735501],"genre_scores_gemma":[0.6255412,0.002198127,0.33486968,0.001829702,0.0006619983,0.0005711404,0.006865784,0.0009985995,0.026463805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989567,0.00031425362,0.000045765228,0.0002893276,0.00017956592,0.00021436327],"domain_scores_gemma":[0.99660337,0.0020331808,0.00026885045,0.00042111013,0.00025411125,0.00041936617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019421,0.0011112569,0.0014975978,0.00078418385,0.0012425297,0.0030220423,0.0030001411,0.002249439,0.018978242],"category_scores_gemma":[0.005496242,0.0007567245,0.0010846588,0.0028114268,0.0011129179,0.0039734077,0.0020188976,0.0034631174,0.0016161276],"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.0014275034,0.0006955228,0.001759422,0.0013436993,0.00018204357,0.0006250981,0.000579951,0.16941996,0.0072836564,0.535863,0.081755556,0.19906458],"study_design_scores_gemma":[0.00029318358,0.00013622976,0.0010136919,0.00015648757,0.000079694495,0.00054134865,0.00034148846,0.21973473,0.002960795,0.7472668,0.027416341,0.000059278846],"about_ca_topic_score_codex":0.0038189557,"about_ca_topic_score_gemma":0.0028379397,"teacher_disagreement_score":0.018978242,"about_ca_system_score_codex":0.0014684113,"about_ca_system_score_gemma":0.0016701277,"threshold_uncertainty_score":0.06348854},"labels":[],"label_agreement":null},{"id":"W1592957478","doi":"10.1016/j.tcs.2009.02.006","title":"Periodicity, repetitions, and orbits of an automatic sequence","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Decidability; Sequence (biology); Mathematics; Lexicographical order; Simple (philosophy); Quotient; Closure (psychology); Combinatorics; Discrete mathematics","score_opus":0.010897308510883006,"score_gpt":0.2616924037423216,"score_spread":0.2507950952314386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592957478","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.86085814,0.00035982934,0.119750105,0.00035341017,0.00014544341,0.000030482,0.00022355972,0.00029219984,0.017986823],"genre_scores_gemma":[0.97687733,0.00012852496,0.017738422,0.00003840944,0.00012468167,0.000048418362,0.00016714828,0.000053688163,0.0048233964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992557,0.0001617213,0.00007731183,0.00018372602,0.0002095841,0.00011201231],"domain_scores_gemma":[0.99489945,0.0029544623,0.0006689494,0.0007659828,0.00036022812,0.0003509623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077720825,0.00026505865,0.00047845067,0.0012066483,0.0013982593,0.0014630626,0.00060533674,0.0008813474,0.0031756717],"category_scores_gemma":[0.004324805,0.00035961252,0.00059288397,0.0006326875,0.0024423536,0.0028093155,0.0009839723,0.0008719192,0.0003461485],"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.00031426814,0.000043922697,0.0020355645,0.00006243662,0.000016755635,0.0005773235,0.0011442512,0.0026748711,0.012328733,0.96218216,0.00064594176,0.017973749],"study_design_scores_gemma":[0.000028856544,0.00010570234,0.001538057,0.000019042296,0.000018255552,0.00060654763,0.00019789294,0.022611909,0.0039229863,0.9689098,0.0020070865,0.000033821052],"about_ca_topic_score_codex":0.00046583207,"about_ca_topic_score_gemma":0.0004713435,"teacher_disagreement_score":0.0031756717,"about_ca_system_score_codex":0.00043648272,"about_ca_system_score_gemma":0.00044451217,"threshold_uncertainty_score":0.0106236935},"labels":[],"label_agreement":null},{"id":"W1603144785","doi":"10.1016/j.tcs.2009.09.008","title":"A new linear time algorithm to compute the genomic distance via the double cut and join distance","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"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":"Bundesministerium für Bildung und Forschung; Alexander von Humboldt-Stiftung","keywords":"Join (topology); Algorithm; Edit distance; Simple (philosophy); Computer science; Time complexity; Genome; Tree (set theory); Mathematics; Combinatorics; Biology; Genetics","score_opus":0.005246742315466484,"score_gpt":0.2288864844595042,"score_spread":0.22363974214403773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603144785","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.006274716,0.0002332008,0.9895594,0.0001963388,0.00009730457,0.00010203833,0.00020659658,0.0017698888,0.0015605239],"genre_scores_gemma":[0.03632014,0.000099558994,0.9594067,0.0000797276,0.000074091804,0.00019130272,0.0008399783,0.0003384846,0.0026500614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765646,0.00029384054,0.0001376709,0.0007274135,0.0009670801,0.00021741536],"domain_scores_gemma":[0.996507,0.0016617494,0.00019052622,0.0007439539,0.00061762996,0.00027912486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014258933,0.0016169801,0.002426494,0.0026153987,0.0013547183,0.0031902727,0.004036628,0.0018734478,0.012428115],"category_scores_gemma":[0.0065164026,0.0009680123,0.0014639567,0.0035649661,0.0012075205,0.005494267,0.004513793,0.00358213,0.0037911385],"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.0007387693,0.00032840393,0.0012011583,0.0004812176,0.00016352999,0.00018137078,0.00031979408,0.06341115,0.01992285,0.07332149,0.018084856,0.8218454],"study_design_scores_gemma":[0.00050842843,0.0003120217,0.000872475,0.00004819549,0.00012693777,0.00050984236,0.00021466483,0.8084107,0.0155879315,0.1504939,0.022813182,0.00010176358],"about_ca_topic_score_codex":0.0034563772,"about_ca_topic_score_gemma":0.005003827,"teacher_disagreement_score":0.012428115,"about_ca_system_score_codex":0.0015775611,"about_ca_system_score_gemma":0.0023597942,"threshold_uncertainty_score":0.041576147},"labels":[],"label_agreement":null},{"id":"W1607134907","doi":"10.1016/s0304-3975(02)00364-x","title":"A new logic for electronic commerce protocols","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":39,"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é Laval; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Atomicity; Programming language; Modal logic; Theoretical computer science; Anonymity; TRACE (psycholinguistics); Secrecy; Modular design; Protocol (science); Semantics (computer science); Modal; Computer security; Database transaction","score_opus":0.030027469508678534,"score_gpt":0.32201351239564024,"score_spread":0.2919860428869617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607134907","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.008752753,0.001296717,0.9145249,0.00787397,0.001379769,0.00017586048,0.00050558127,0.001127037,0.064363346],"genre_scores_gemma":[0.38869998,0.0026296782,0.52457345,0.007437624,0.0041487115,0.0007438748,0.001232342,0.0009550713,0.069579296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958274,0.0012947477,0.00043056245,0.0008208847,0.0011591791,0.00046724008],"domain_scores_gemma":[0.995887,0.0019199946,0.00025259127,0.00078010804,0.00076374883,0.00039658754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00400165,0.0013729838,0.0014158261,0.0039296043,0.0052045737,0.0101043135,0.003494944,0.0036333639,0.013919614],"category_scores_gemma":[0.0067660618,0.0015104782,0.0030437922,0.0037428413,0.009217832,0.028662974,0.00606977,0.010196227,0.0038275898],"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.000014205992,0.000010543103,0.000033814587,0.000022920412,0.0000036910512,0.000039334394,0.000111881556,0.00017560246,0.00022566991,0.9936957,0.0016176007,0.004048972],"study_design_scores_gemma":[0.000017039729,0.000013394114,0.00002217196,0.000018153336,0.000017525117,0.00008853885,0.000051633222,0.0038348755,0.0003500781,0.979679,0.015889464,0.00001812227],"about_ca_topic_score_codex":0.0016480326,"about_ca_topic_score_gemma":0.0015084321,"teacher_disagreement_score":0.013919614,"about_ca_system_score_codex":0.0037768863,"about_ca_system_score_gemma":0.0018205824,"threshold_uncertainty_score":0.04656577},"labels":[],"label_agreement":null},{"id":"W1625693084","doi":"10.1016/j.tcs.2016.05.005","title":"Correlation bounds and #SAT algorithms for small linear-size circuits","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Mathematics; Correlation; Electronic circuit; Computer science","score_opus":0.013558984464381517,"score_gpt":0.24609904038473077,"score_spread":0.23254005592034924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625693084","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.09905228,0.007399209,0.79025716,0.019966094,0.00078670366,0.00037704862,0.0014359494,0.0025721975,0.07815331],"genre_scores_gemma":[0.8129293,0.004425905,0.14524569,0.0044606654,0.0020352865,0.0012703314,0.0020193688,0.0020649259,0.025548633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9888574,0.004474085,0.00035749932,0.0016360919,0.0030315814,0.0016433445],"domain_scores_gemma":[0.8702973,0.10938422,0.0037524656,0.010293731,0.003800216,0.0024721476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0131568285,0.0032818255,0.004058507,0.0037148301,0.004165334,0.008497781,0.009869403,0.005435005,0.018156562],"category_scores_gemma":[0.07893843,0.00282248,0.00359222,0.0060513807,0.009495364,0.022011567,0.009853838,0.01783815,0.0031604446],"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.0010194526,0.00031144934,0.0017029607,0.00041919586,0.0001434386,0.00009017601,0.00028924565,0.071406566,0.0023675894,0.8732395,0.016145004,0.03286532],"study_design_scores_gemma":[0.00011925226,0.000054412198,0.00061894197,0.00011137211,0.000077282755,0.00006099284,0.000054714626,0.26824868,0.0018812963,0.72646505,0.0022603788,0.00004770347],"about_ca_topic_score_codex":0.0043017403,"about_ca_topic_score_gemma":0.0065310393,"teacher_disagreement_score":0.018156562,"about_ca_system_score_codex":0.010884751,"about_ca_system_score_gemma":0.007929808,"threshold_uncertainty_score":0.078974724},"labels":[],"label_agreement":null},{"id":"W1644292110","doi":"10.1016/j.tcs.2008.11.001","title":"A new characteristic property of rich words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":37,"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":"Palindrome; Suffix; Property (philosophy); Prefix; Class (philosophy); Combinatorics; Mathematics; Pure mathematics; Computer science; Linguistics; Philosophy; Artificial intelligence; Biology","score_opus":0.01267596089827406,"score_gpt":0.22429627106657327,"score_spread":0.2116203101682992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644292110","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.5883242,0.0009778106,0.35073537,0.001955075,0.00029840798,0.00008590455,0.00093966635,0.0009878264,0.05569579],"genre_scores_gemma":[0.96356225,0.00029238782,0.025159067,0.00028538267,0.00025186685,0.00007215088,0.00031560528,0.0002128248,0.009848462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991516,0.00013341948,0.00006838925,0.0002866642,0.00020368153,0.00015629917],"domain_scores_gemma":[0.9950362,0.0024799202,0.0006245695,0.00078143255,0.0005885776,0.0004892821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007240339,0.0002621566,0.00067424646,0.0015667172,0.0012863929,0.0026433582,0.0007291103,0.0008411065,0.0049814847],"category_scores_gemma":[0.0051698643,0.00041809643,0.0006116332,0.0017477967,0.0024724666,0.0087446235,0.001987758,0.0016662095,0.0007388664],"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.000110992296,0.0000148203135,0.0014885636,0.00007675582,0.000010845441,0.00020333545,0.0006386188,0.0004730433,0.0056551793,0.97892857,0.0013264241,0.011072853],"study_design_scores_gemma":[0.000030050618,0.00005401683,0.001109566,0.00002068552,0.000023702272,0.00092598406,0.00032135317,0.0050157188,0.003707182,0.97873634,0.010021212,0.000034278128],"about_ca_topic_score_codex":0.00028692628,"about_ca_topic_score_gemma":0.00029379997,"teacher_disagreement_score":0.0049814847,"about_ca_system_score_codex":0.0008491688,"about_ca_system_score_gemma":0.0005596088,"threshold_uncertainty_score":0.016664743},"labels":[],"label_agreement":null},{"id":"W1749523692","doi":"10.1016/j.tcs.2015.02.037","title":"Classic Nintendo games are (computationally) hard","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Games and Media","field":"Social Sciences","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Science Foundation","keywords":"Donkey; Legend; Computer science; Combinatorics; Video game; Advertising; Mathematical economics; Mathematics; Art; Computer graphics (images); Art history; History; Multimedia; Business; Archaeology","score_opus":0.03732331860853443,"score_gpt":0.30301576651067835,"score_spread":0.2656924479021439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1749523692","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.3062137,0.0011227789,0.2979849,0.00855973,0.0007755549,0.00048817147,0.0015429937,0.0007613616,0.3825508],"genre_scores_gemma":[0.90017843,0.0008087347,0.03664018,0.0011208713,0.00027247344,0.00053315767,0.00069813227,0.00017513281,0.059572984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805284,0.0004929341,0.00011452075,0.00040122087,0.0005027484,0.00043571243],"domain_scores_gemma":[0.99246407,0.00549026,0.00045547617,0.00067269895,0.00039999958,0.00051745976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014604242,0.0016642839,0.0015470168,0.0011960235,0.0022248873,0.006422568,0.0019009075,0.0025590714,0.025908485],"category_scores_gemma":[0.012090472,0.00092334073,0.0013230698,0.0010793257,0.0046755606,0.010497667,0.0036947392,0.004689005,0.0017747139],"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.00008891682,0.00006138898,0.0002927998,0.00012699414,0.00002181142,0.00004969431,0.00016424582,0.0044484967,0.000349133,0.9821813,0.004092398,0.008123],"study_design_scores_gemma":[0.000027104907,0.0000135005375,0.00012806169,0.000013181486,0.0000066111297,0.00003275018,0.000077393845,0.011693559,0.00015848095,0.98562187,0.0022187468,0.000008711566],"about_ca_topic_score_codex":0.0023160009,"about_ca_topic_score_gemma":0.0037098376,"teacher_disagreement_score":0.025908485,"about_ca_system_score_codex":0.0023923544,"about_ca_system_score_gemma":0.0021176643,"threshold_uncertainty_score":0.086672544},"labels":[],"label_agreement":null},{"id":"W1768118166","doi":"10.1016/j.tcs.2014.04.016","title":"Theory of átomata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Regional Development Fund; Haridus- ja Teadusministeerium; Natural Sciences and Engineering Research Council of Canada; Eesti Teadusfondi","keywords":"Nondeterministic finite automaton; Deterministic finite automaton; Regular language; Deterministic automaton; Büchi automaton; Nondeterministic algorithm; Finite-state machine; Mathematics; Discrete mathematics; DFA minimization; Quotient; Automaton; Regular expression; Combinatorics; Two-way deterministic finite automaton; Computer science; Algorithm; Automata theory; Theoretical computer science; Programming language","score_opus":0.008109070715470214,"score_gpt":0.22572407714878318,"score_spread":0.21761500643331297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768118166","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.034442306,0.0068937996,0.5524624,0.007958856,0.0014848738,0.00017515103,0.0020801001,0.0018995911,0.392603],"genre_scores_gemma":[0.721853,0.004239105,0.15336868,0.0026032133,0.0015328939,0.00048699728,0.0026839087,0.00089077745,0.1123414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810636,0.0005593454,0.00013560076,0.00049022544,0.0004785334,0.00022981226],"domain_scores_gemma":[0.99808806,0.00079798646,0.000106366744,0.000447242,0.00045567178,0.00010466436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014700132,0.00086758414,0.0011672871,0.0025382265,0.0038023498,0.0064418153,0.0020314772,0.001893068,0.021142824],"category_scores_gemma":[0.004149072,0.0011137198,0.00198848,0.0025275203,0.0064455094,0.014174778,0.003932702,0.004408286,0.0045372406],"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.000005662326,0.0000034992738,0.000041023235,0.00001823893,0.0000026384675,0.000011571808,0.000096160504,0.00011017583,0.00007021626,0.9965431,0.0011892914,0.0019085003],"study_design_scores_gemma":[0.000006318178,0.0000028097184,0.000031451913,0.000010846742,0.0000056364747,0.000028836508,0.00003657136,0.00068121566,0.00014120272,0.9882089,0.010841898,0.0000043315713],"about_ca_topic_score_codex":0.0025360978,"about_ca_topic_score_gemma":0.0017921858,"teacher_disagreement_score":0.021142824,"about_ca_system_score_codex":0.0029644927,"about_ca_system_score_gemma":0.0015988088,"threshold_uncertainty_score":0.07072973},"labels":[],"label_agreement":null},{"id":"W1784462007","doi":"10.1016/j.tcs.2015.09.009","title":"Games on interval and permutation graph representations","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Combinatorics; Interval graph; Graph; Mathematics; Permutation graph; Discrete mathematics; Combinatorial game theory; PSPACE; Permutation (music); Time complexity; Representation (politics); Computer science; Theoretical computer science; Pathwidth; Computational complexity theory; Line graph; Algorithm; Sequential game; Game theory; Mathematical economics","score_opus":0.034296970045577184,"score_gpt":0.3413963523780636,"score_spread":0.3070993823324864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1784462007","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.2301994,0.00061554566,0.5888323,0.0039150314,0.00045283764,0.00027903134,0.0008652587,0.00043959563,0.17440094],"genre_scores_gemma":[0.8723337,0.000670989,0.08604612,0.000501041,0.00030770365,0.00039561288,0.0007037472,0.00016785493,0.038873196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832386,0.00074680237,0.00008937282,0.00024001401,0.00036016354,0.00023986574],"domain_scores_gemma":[0.99644476,0.0020489576,0.0003370793,0.00043711593,0.0002615321,0.00047053338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014074101,0.00077382836,0.00097596913,0.0012253352,0.0013089883,0.004574557,0.0021469072,0.0022036184,0.015824888],"category_scores_gemma":[0.007582184,0.00047591372,0.0010479005,0.0017564746,0.0021907745,0.009075208,0.002118387,0.0028560478,0.0009597812],"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.00003893292,0.00003137111,0.00005268277,0.000019373036,0.0000049339487,0.000027826705,0.00009571513,0.0030484155,0.00018450418,0.99084026,0.0013087206,0.0043471023],"study_design_scores_gemma":[0.000019785188,0.000015351721,0.00004727117,0.0000079737465,0.000005502171,0.000029647626,0.000057118585,0.017675987,0.000070270326,0.98055446,0.0015098286,0.0000067958945],"about_ca_topic_score_codex":0.0016502937,"about_ca_topic_score_gemma":0.0014086572,"teacher_disagreement_score":0.015824888,"about_ca_system_score_codex":0.0015090563,"about_ca_system_score_gemma":0.0008788192,"threshold_uncertainty_score":0.052939534},"labels":[],"label_agreement":null},{"id":"W1800138911","doi":"10.1016/j.tcs.2015.01.053","title":"Excuse me! or the courteous theatregoers' problem","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Courtesy; Set (abstract data type); Excuse; Mathematics; Row; Mathematical proof; Combinatorics; Space (punctuation); Computer science; Law; Philosophy; Geometry; Programming language; Linguistics","score_opus":0.022670644685306603,"score_gpt":0.2678674716029356,"score_spread":0.245196826917629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800138911","genre_codex":"commentary","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.0019496342,0.0025733162,0.013014181,0.7091244,0.0361679,0.000036507776,0.0002458838,0.0004862604,0.23640198],"genre_scores_gemma":[0.07609355,0.002745411,0.011250842,0.28009182,0.01641626,0.00017714703,0.0002520411,0.0012801478,0.61169267],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997198,0.00088566035,0.000109930006,0.00046724797,0.0009182102,0.00042097698],"domain_scores_gemma":[0.992679,0.0030992886,0.00032827002,0.0013425495,0.0017139467,0.0008369153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037597462,0.00072512357,0.00077239354,0.0011438357,0.0075946944,0.0059253112,0.002051498,0.010408938,0.10835916],"category_scores_gemma":[0.03555221,0.00041168183,0.0007672525,0.0008857412,0.009534938,0.010869914,0.00619375,0.014409,0.033372138],"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.00003812405,0.000014455334,0.00012270802,0.000031697316,0.0000056085364,0.00025501812,0.00044323492,0.000083194536,0.000086261236,0.26033044,0.72119284,0.017396437],"study_design_scores_gemma":[0.00001990467,0.000008457168,0.00007495749,0.00006885535,0.0000038686007,0.0005517126,0.0008661966,0.00018429758,0.00009687268,0.1637946,0.8343116,0.00001862595],"about_ca_topic_score_codex":0.0048251837,"about_ca_topic_score_gemma":0.006227728,"teacher_disagreement_score":0.10835916,"about_ca_system_score_codex":0.0019958634,"about_ca_system_score_gemma":0.002061572,"threshold_uncertainty_score":0.3624975},"labels":[],"label_agreement":null},{"id":"W1802748673","doi":"10.1016/j.tcs.2015.09.018","title":"Autonomous mobile robots with lights","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"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; Ministero dell’Istruzione, dell’Università e della Ricerca; Ministry of Education, Culture, Sports, Science and Technology; Agence Nationale de la Recherche","keywords":"Asynchronous communication; Robot; Computer science; Mobile robot; Distributed computing; Artificial intelligence","score_opus":0.016159626412135412,"score_gpt":0.2576801945142401,"score_spread":0.2415205681021047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802748673","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.13336013,0.0012926873,0.80979306,0.0010095721,0.0004949393,0.00007541559,0.00013969086,0.0011859238,0.05264858],"genre_scores_gemma":[0.8973924,0.0006000262,0.07558684,0.00023047367,0.00010799086,0.000087102664,0.000085854794,0.00011679224,0.025792621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998355,0.000035377245,0.0000041525177,0.00004177484,0.00005677375,0.000026369635],"domain_scores_gemma":[0.9997743,0.000087951514,0.000026829937,0.000035494704,0.00003383371,0.000041600222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014606188,0.00033565,0.00040458867,0.00033042353,0.000653077,0.0008827308,0.00057817216,0.0007018155,0.004169195],"category_scores_gemma":[0.0007058558,0.00031808688,0.00039464128,0.00030643205,0.0008744968,0.001177617,0.0019289955,0.0008138038,0.000848605],"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.0007468097,0.00016630125,0.0018415168,0.0003963845,0.000083493636,0.00045581526,0.0004342249,0.26743641,0.07333029,0.4053531,0.01098801,0.23876765],"study_design_scores_gemma":[0.00008610415,0.0002557535,0.0007175678,0.000032410822,0.000033164968,0.00019527298,0.00017449007,0.72738576,0.0100647425,0.23594378,0.025063112,0.00004783067],"about_ca_topic_score_codex":0.00082126143,"about_ca_topic_score_gemma":0.0008590385,"teacher_disagreement_score":0.004169195,"about_ca_system_score_codex":0.00032076184,"about_ca_system_score_gemma":0.0003035557,"threshold_uncertainty_score":0.013947368},"labels":[],"label_agreement":null},{"id":"W1829289780","doi":"10.1016/j.tcs.2016.05.031","title":"A 13k-kernel for planar feedback vertex set via region decomposition","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Narodowe Centrum Nauki; Agence Nationale de la Recherche","keywords":"Vertex (graph theory); Kernel (algebra); Mathematics; Set (abstract data type); Planar; Feedback vertex set; Algorithm; Combinatorics; Computer science; Graph","score_opus":0.021215364685179622,"score_gpt":0.3082908469589348,"score_spread":0.28707548227375523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829289780","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.1559764,0.0002557904,0.8140901,0.0004472316,0.00012801423,0.00014477002,0.0006556939,0.0010936181,0.02720845],"genre_scores_gemma":[0.79319763,0.00031081098,0.1773018,0.0002524072,0.00011124875,0.00025049693,0.0007919787,0.0005392832,0.027244326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993901,0.000092439564,0.000024965406,0.00015292743,0.00021045719,0.00012898725],"domain_scores_gemma":[0.9990513,0.0002529964,0.000109434404,0.0001770228,0.00020416513,0.00020508505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045963874,0.0005776379,0.0010785701,0.00088404136,0.0008811531,0.0015959227,0.0015402472,0.0009505389,0.006800053],"category_scores_gemma":[0.0023857923,0.0003851657,0.00086318044,0.00069294905,0.0012174654,0.0019074804,0.0028288336,0.0018689896,0.0017919085],"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.0002724665,0.00012878733,0.0004301997,0.00018557263,0.000037408936,0.00014229161,0.00034778795,0.034664147,0.010182195,0.90396404,0.008106724,0.041538432],"study_design_scores_gemma":[0.000043373646,0.000070103226,0.00034992167,0.000025302184,0.000022333825,0.00017280073,0.00010826904,0.2195006,0.002750947,0.7711468,0.0057700113,0.000039475886],"about_ca_topic_score_codex":0.0016259584,"about_ca_topic_score_gemma":0.0010936231,"teacher_disagreement_score":0.006800053,"about_ca_system_score_codex":0.0011581122,"about_ca_system_score_gemma":0.000886594,"threshold_uncertainty_score":0.02274847},"labels":[],"label_agreement":null},{"id":"W1834492313","doi":"10.1016/j.tcs.2009.03.040","title":"Hierarchy and equivalence of multi-letter quantum finite automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"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":"Equivalence (formal languages); Quantum finite automata; Mathematics; Regular language; Discrete mathematics; Nondeterministic finite automaton; Hierarchy; Automata theory; Computer science; Combinatorics; Algebra over a field; Automaton; Pure mathematics; Theoretical computer science; Law","score_opus":0.011783895480650222,"score_gpt":0.2564132395831067,"score_spread":0.24462934410245646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834492313","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.45251173,0.002223693,0.3156858,0.005358883,0.00067156914,0.00018526967,0.000971643,0.0011892664,0.2212022],"genre_scores_gemma":[0.95485896,0.00040357513,0.031635247,0.0005963515,0.00030194313,0.00012107797,0.0003714375,0.00013065718,0.011580754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670535,0.00081665185,0.0002683037,0.0006574663,0.0008783239,0.0006739978],"domain_scores_gemma":[0.99208516,0.0044894214,0.00040615472,0.0013146864,0.001060441,0.0006440913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001804273,0.0004891383,0.0016648871,0.002325343,0.0048268144,0.005500936,0.0025984133,0.0024496277,0.0100629935],"category_scores_gemma":[0.007698634,0.0008211304,0.0017808321,0.0015179955,0.005186806,0.009333875,0.0037965707,0.0044448483,0.0012020923],"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.000026595466,0.000023042463,0.0000914934,0.000021292999,0.0000037864124,0.000040917563,0.00029149285,0.00049596187,0.00041522406,0.9956772,0.0003566653,0.0025563007],"study_design_scores_gemma":[0.000007559993,0.000004817234,0.000065451844,0.000006313412,0.0000027121791,0.00001590686,0.000032828182,0.0024194883,0.00015241756,0.99660635,0.0006799061,0.0000061164383],"about_ca_topic_score_codex":0.0026215182,"about_ca_topic_score_gemma":0.0022338172,"teacher_disagreement_score":0.0100629935,"about_ca_system_score_codex":0.0034890664,"about_ca_system_score_gemma":0.0013625395,"threshold_uncertainty_score":0.033664048},"labels":[],"label_agreement":null},{"id":"W1863587147","doi":"10.1016/j.tcs.2015.12.017","title":"Towards tight bounds on theta-graphs: More is not always better","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Carleton University","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Discrete mathematics; Disjoint sets; Indifference graph; Matching (statistics); Graph","score_opus":0.027910979404374602,"score_gpt":0.27928977332233107,"score_spread":0.2513787939179565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863587147","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.05055131,0.031342234,0.7545923,0.08230911,0.0038901814,0.00010189729,0.0015290185,0.0024300746,0.07325385],"genre_scores_gemma":[0.62108505,0.025957858,0.27642807,0.024901252,0.008596698,0.0006042423,0.0026508307,0.004893859,0.03488218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99228466,0.0026749556,0.00028168198,0.001496198,0.0021725479,0.0010899517],"domain_scores_gemma":[0.90062225,0.06893673,0.0029632272,0.017324243,0.006033467,0.004120092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011436196,0.0031699121,0.0038840282,0.0037744183,0.0029651173,0.008750706,0.006195972,0.0057567656,0.026795296],"category_scores_gemma":[0.074672,0.0021854963,0.0023067873,0.0045210584,0.01009516,0.05030024,0.01225183,0.022879811,0.0064363857],"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.0003880429,0.000128861,0.0010710733,0.0007159903,0.00010392279,0.00006193121,0.00040112922,0.022483794,0.001051085,0.8781023,0.041444063,0.05404772],"study_design_scores_gemma":[0.000019671586,0.000024944551,0.0001269038,0.000116114235,0.00002779339,0.000033949895,0.00009895292,0.01296762,0.00029644332,0.97867006,0.0076021,0.000015385902],"about_ca_topic_score_codex":0.0023125329,"about_ca_topic_score_gemma":0.0025760124,"teacher_disagreement_score":0.026795296,"about_ca_system_score_codex":0.0037247052,"about_ca_system_score_gemma":0.0018798565,"threshold_uncertainty_score":0.08963919},"labels":[],"label_agreement":null},{"id":"W1886146870","doi":"10.1016/j.tcs.2015.09.007","title":"Successor rules for flipping pancakes and burnt pancakes","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Successor cardinal; Sequence (biology); Stack (abstract data type); Combinatorics; Mathematics; Minification; Simple (philosophy); Discrete mathematics; Algorithm; Computer science; Mathematical optimization; Mathematical analysis","score_opus":0.018123366519930503,"score_gpt":0.2678905162861136,"score_spread":0.24976714976618308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886146870","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.24235822,0.00040790506,0.7138421,0.00071116444,0.0003252568,0.00019539236,0.00052593986,0.00067132286,0.04096271],"genre_scores_gemma":[0.70778155,0.00039345401,0.26016393,0.00032011542,0.00010036842,0.00023132573,0.0009685954,0.0005748082,0.029465852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993481,0.00013691367,0.00005883969,0.0001649517,0.00017809494,0.00011310765],"domain_scores_gemma":[0.99508685,0.003038915,0.00025203978,0.0007367716,0.0005103064,0.00037503353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014978831,0.00040009225,0.00088068476,0.0012214239,0.0015934578,0.0024705434,0.0021903797,0.0018840851,0.012514607],"category_scores_gemma":[0.010277082,0.0005730065,0.001483632,0.0011819899,0.0023188253,0.004022478,0.0020814468,0.002917944,0.0011889085],"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.00016725984,0.00008237973,0.0010625317,0.00013332561,0.000027130744,0.00027715985,0.00033443372,0.06245102,0.0021043264,0.8837164,0.004282154,0.045361843],"study_design_scores_gemma":[0.00003637658,0.000034318356,0.00020790704,0.000034438188,0.000019418001,0.00010547054,0.000083995874,0.196446,0.0014883961,0.7987878,0.0027327589,0.000023099152],"about_ca_topic_score_codex":0.0020502624,"about_ca_topic_score_gemma":0.003959311,"teacher_disagreement_score":0.012514607,"about_ca_system_score_codex":0.0007676917,"about_ca_system_score_gemma":0.0010117283,"threshold_uncertainty_score":0.041865587},"labels":[],"label_agreement":null},{"id":"W1896187825","doi":"10.1016/j.tcs.2015.11.004","title":"Growth rate of binary words avoiding xxx","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Binary number; Mathematics; Combinatorics; Computer science; Arithmetic","score_opus":0.01801672403630301,"score_gpt":0.25971368786202886,"score_spread":0.24169696382572586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1896187825","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.8876752,0.00054383534,0.083910406,0.0015066382,0.00018535774,0.00007054629,0.0006797326,0.0006642615,0.024763966],"genre_scores_gemma":[0.96296215,0.00043542718,0.015537476,0.00017871172,0.00011211002,0.0001381997,0.0008552624,0.00043648196,0.019344121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943644,0.00012680954,0.000030064431,0.00009646029,0.00014630055,0.00016399876],"domain_scores_gemma":[0.9810688,0.013420659,0.0013290597,0.00070805417,0.0022652426,0.0012082556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009383533,0.0005637825,0.00075190014,0.0017710051,0.001433526,0.002356902,0.0013585169,0.0015187619,0.009764248],"category_scores_gemma":[0.017423103,0.0005086091,0.0005932921,0.0009274005,0.0010358015,0.0024142116,0.001213837,0.0012980347,0.0015850842],"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.0010830885,0.00019393406,0.00677676,0.000686487,0.00007580854,0.0006722638,0.0011901935,0.091724634,0.07711064,0.77020216,0.010283979,0.040000096],"study_design_scores_gemma":[0.000094187824,0.00022282024,0.0037251457,0.00012822583,0.000058784273,0.00088854606,0.00045924124,0.6313024,0.038367074,0.3211518,0.003505523,0.000096212454],"about_ca_topic_score_codex":0.0016660288,"about_ca_topic_score_gemma":0.0010070787,"teacher_disagreement_score":0.009764248,"about_ca_system_score_codex":0.0012928686,"about_ca_system_score_gemma":0.0013684285,"threshold_uncertainty_score":0.032664657},"labels":[],"label_agreement":null},{"id":"W1903527885","doi":"10.1016/j.tcs.2016.05.015","title":"A dichotomy theorem for circular colouring reconfiguration","year":2016,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Thompson Rivers University; McGill University","keywords":"Control reconfiguration; Vertex (graph theory); Combinatorics; Mathematics; Graph; PSPACE; Discrete mathematics; Computational complexity theory; Computer science; Algorithm","score_opus":0.010654360260838465,"score_gpt":0.22518936423400743,"score_spread":0.21453500397316896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903527885","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.21665181,0.001968045,0.5285586,0.016102886,0.0009252083,0.00016300431,0.0010152941,0.0012169031,0.23339827],"genre_scores_gemma":[0.9439621,0.0006619688,0.03140001,0.0027922653,0.00065640465,0.00027136743,0.0004776313,0.00021516162,0.019563071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794847,0.00042817972,0.00008771742,0.0005671031,0.00046207322,0.00050648634],"domain_scores_gemma":[0.99434537,0.0038318646,0.00028735393,0.00063879025,0.000462191,0.00043450663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018676539,0.0005958717,0.001233916,0.0015855816,0.002357752,0.004930456,0.0016186552,0.0023604971,0.014253184],"category_scores_gemma":[0.006689067,0.0005847048,0.0011949856,0.0014513811,0.004474587,0.006868528,0.0042757634,0.0057822634,0.0012209017],"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.00008039513,0.000028781504,0.00015597613,0.000055749988,0.000010664555,0.00004743856,0.00011336407,0.001582023,0.00097633665,0.9872198,0.003635323,0.006094027],"study_design_scores_gemma":[0.00002571643,0.000014936866,0.00009697082,0.000012381798,0.000008488147,0.00005566267,0.000034842775,0.008328406,0.00043101594,0.98927945,0.0017043126,0.000007830677],"about_ca_topic_score_codex":0.00075396296,"about_ca_topic_score_gemma":0.00050751027,"teacher_disagreement_score":0.014253184,"about_ca_system_score_codex":0.0026668021,"about_ca_system_score_gemma":0.0010042976,"threshold_uncertainty_score":0.04768163},"labels":[],"label_agreement":null},{"id":"W1963604719","doi":"10.1016/j.tcs.2004.12.020","title":"Uniformity of quantum circuit families for error-free algorithms","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ottawa","keywords":"Algorithm; Computer science; Quantum; Quantum circuit; Quantum computer; Mathematics; Quantum error correction; Physics; Quantum mechanics","score_opus":0.014477741345417574,"score_gpt":0.2552957478506123,"score_spread":0.24081800650519475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963604719","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.39105335,0.00084778806,0.53155965,0.0033618482,0.00023338043,0.00021915062,0.0012140565,0.0010748027,0.07043603],"genre_scores_gemma":[0.9485058,0.00050739234,0.036512837,0.0007421566,0.00045797392,0.00037801557,0.0006863604,0.00045260167,0.011756854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995827,0.0012872875,0.00022619145,0.0009853676,0.0010204621,0.0006536714],"domain_scores_gemma":[0.9758354,0.017476719,0.00097624987,0.002580102,0.0018657028,0.0012658841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040490483,0.0007472481,0.0020697184,0.0020622066,0.0038432209,0.0038244256,0.0029204837,0.00206146,0.009067715],"category_scores_gemma":[0.020076277,0.0011607552,0.0018520922,0.0017392294,0.005469692,0.010043025,0.004783351,0.0053375717,0.00091244065],"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.000105738705,0.000035459598,0.0003382288,0.000029151417,0.000013439782,0.000030113662,0.00019939359,0.002443689,0.0005352756,0.9913511,0.0010482467,0.0038701002],"study_design_scores_gemma":[0.000034633864,0.000026089067,0.0002536889,0.000009835808,0.000015129261,0.00006565024,0.00003941605,0.013079963,0.00080476055,0.9845293,0.0011240437,0.000017526349],"about_ca_topic_score_codex":0.0011500634,"about_ca_topic_score_gemma":0.00084618543,"teacher_disagreement_score":0.009067715,"about_ca_system_score_codex":0.0026366727,"about_ca_system_score_gemma":0.0014165235,"threshold_uncertainty_score":0.030334532},"labels":[],"label_agreement":null},{"id":"W1963717362","doi":"10.1016/j.tcs.2005.08.035","title":"On the power of non-local boxes","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Qubit; Computer science; Bipartite graph; Quantum nonlocality; Quantum; Alice and Bob; Physics; Mathematics; Discrete mathematics; Quantum mechanics; Theoretical computer science; Quantum entanglement","score_opus":0.005879393768026078,"score_gpt":0.24234067306318863,"score_spread":0.23646127929516256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963717362","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.3275231,0.008731409,0.41971585,0.015178378,0.0013770319,0.00011311585,0.00047923747,0.0006738059,0.22620808],"genre_scores_gemma":[0.9384117,0.0019734558,0.0373515,0.0011055334,0.0008067798,0.00018097396,0.00016073302,0.00029825215,0.01971102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738544,0.0011416124,0.00010103477,0.0003842867,0.00059912587,0.0003884659],"domain_scores_gemma":[0.97305423,0.020296935,0.0008080904,0.003798619,0.0011644183,0.00087783654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005910548,0.00074612536,0.002270136,0.0016682413,0.0034581611,0.0046309903,0.00321614,0.0023125338,0.011191041],"category_scores_gemma":[0.020314908,0.0010249624,0.0011857303,0.001543284,0.010287248,0.01760396,0.006110117,0.0056292056,0.0010217918],"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.00002500071,0.000007236952,0.00006118919,0.000018587616,0.0000038785925,0.00001872742,0.000077437995,0.0009446943,0.0000878204,0.9971745,0.0004891311,0.0010916775],"study_design_scores_gemma":[0.000014631614,0.000004189929,0.00002669273,0.000011167073,0.000003943788,0.000013205572,0.000018002394,0.0063942163,0.00006945584,0.9926393,0.0007996243,0.000005594364],"about_ca_topic_score_codex":0.0020725962,"about_ca_topic_score_gemma":0.0020669547,"teacher_disagreement_score":0.011191041,"about_ca_system_score_codex":0.0014398895,"about_ca_system_score_gemma":0.0013214634,"threshold_uncertainty_score":0.037437737},"labels":[],"label_agreement":null},{"id":"W1963731267","doi":"10.1016/j.tcs.2009.09.037","title":"On a special class of primitive words","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Class (philosophy); Mathematics; Algebra over a field; Computer science; Linguistics; Combinatorics; Pure mathematics; Artificial intelligence; Philosophy","score_opus":0.007007482571960792,"score_gpt":0.2378683292514425,"score_spread":0.2308608466794817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963731267","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.6152295,0.0021620085,0.23810633,0.0025394338,0.0007913334,0.00010910261,0.00066970533,0.0006875149,0.13970506],"genre_scores_gemma":[0.9517167,0.0008529005,0.020318016,0.00036709214,0.000835041,0.00013037398,0.00055735064,0.00018064815,0.02504186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991836,0.00013754045,0.000043587155,0.00024284013,0.00019147719,0.0002009224],"domain_scores_gemma":[0.99636143,0.002181092,0.00027258944,0.00049926987,0.00030197398,0.00038371317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007211311,0.0006985269,0.0014306887,0.0017075009,0.0031581572,0.0034847918,0.0012489989,0.0018178758,0.009284815],"category_scores_gemma":[0.0038277332,0.00066527165,0.0012893043,0.0019090954,0.003590933,0.0074109933,0.002548556,0.0023637388,0.0010821898],"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.00004121069,0.000012056607,0.00021309018,0.000033714605,0.0000058116857,0.00016202855,0.00024878196,0.00026476846,0.0008793371,0.9934976,0.0008311735,0.003810374],"study_design_scores_gemma":[0.000016596592,0.000016558712,0.00021640908,0.000012864026,0.00000935552,0.00029636567,0.00007523156,0.0027749594,0.00044218617,0.99306446,0.0030644932,0.000010622476],"about_ca_topic_score_codex":0.00058839424,"about_ca_topic_score_gemma":0.0004945721,"teacher_disagreement_score":0.009284815,"about_ca_system_score_codex":0.0010619619,"about_ca_system_score_gemma":0.0006845536,"threshold_uncertainty_score":0.031060815},"labels":[],"label_agreement":null},{"id":"W1963743620","doi":"10.1016/j.tcs.2013.01.024","title":"Correctness of concurrent executions of closed nested transactions in transactional memory systems","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Nested transaction; Software transactional memory; Correctness; Database transaction; Transactional memory; Consistency (knowledge bases); Class (philosophy); Serialization; Transaction processing; Distributed transaction; Programming language; Theoretical computer science; Distributed computing; Artificial intelligence","score_opus":0.00876243527131157,"score_gpt":0.2329234691236317,"score_spread":0.22416103385232014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963743620","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.5673805,0.0008021979,0.42300755,0.00091591425,0.00020051544,0.00015376692,0.0002174087,0.0015025943,0.005819494],"genre_scores_gemma":[0.9767596,0.00011422524,0.021591151,0.00008026318,0.00007164104,0.000066071065,0.00016865788,0.00015713027,0.0009912889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.982656,0.00506914,0.001437292,0.0016123424,0.0071339253,0.0020912255],"domain_scores_gemma":[0.91301876,0.0555475,0.0054762806,0.011162166,0.012945647,0.0018496589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009076585,0.000611003,0.0013254711,0.0009568763,0.0021233007,0.005910374,0.0029523335,0.002211294,0.0015060045],"category_scores_gemma":[0.057800833,0.0011642533,0.0011974889,0.0009675191,0.006771207,0.0061300052,0.0027337123,0.002949951,0.00032481065],"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.0058872076,0.0007761582,0.03730364,0.00074596354,0.00040013043,0.0024921717,0.009562873,0.19671568,0.04569337,0.6274675,0.0031929077,0.06976243],"study_design_scores_gemma":[0.0004400778,0.00033557526,0.0028537759,0.00007668826,0.00014369098,0.0003748069,0.00057178724,0.375924,0.021251285,0.5956017,0.002348773,0.00007787453],"about_ca_topic_score_codex":0.0053809476,"about_ca_topic_score_gemma":0.0031526664,"teacher_disagreement_score":0.009076585,"about_ca_system_score_codex":0.0017420067,"about_ca_system_score_gemma":0.0041288026,"threshold_uncertainty_score":0.048002124},"labels":[],"label_agreement":null},{"id":"W1964432965","doi":"10.1016/j.tcs.2014.09.003","title":"Less space: Indexing for queries with wildcards","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Substring; Search engine indexing; Combinatorics; String (physics); Mathematics; Character (mathematics); Set (abstract data type); Space (punctuation); Alphabet; Upper and lower bounds; Computer science; Discrete mathematics; Information retrieval","score_opus":0.008467994323228173,"score_gpt":0.23809036300949935,"score_spread":0.22962236868627117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964432965","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.12661934,0.0064177383,0.805507,0.0050973417,0.0023268727,0.0007949222,0.0052477876,0.028217886,0.019771071],"genre_scores_gemma":[0.42889354,0.0019101204,0.53314626,0.0025007247,0.0020173169,0.0006084167,0.010929433,0.00502998,0.014964281],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919235,0.0014387873,0.00095580466,0.0012938471,0.003392973,0.0009950486],"domain_scores_gemma":[0.9676614,0.008947948,0.001081909,0.01887639,0.002500875,0.000931519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038941456,0.001642023,0.0041983905,0.005840512,0.0025483111,0.0063709733,0.005175206,0.003465618,0.016452745],"category_scores_gemma":[0.032654405,0.0012403287,0.0016850083,0.011352377,0.003528334,0.02236094,0.0076304735,0.0029907224,0.004784236],"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.0031735394,0.0009878566,0.0041737575,0.0009416877,0.00014150224,0.00041350786,0.001016201,0.018405898,0.025257736,0.18062416,0.103627466,0.66123676],"study_design_scores_gemma":[0.0005772143,0.0006494138,0.0010048064,0.00020025262,0.00022980699,0.001377998,0.0006574064,0.25081152,0.026974084,0.6691281,0.048178643,0.00021076614],"about_ca_topic_score_codex":0.0023511515,"about_ca_topic_score_gemma":0.0025377062,"teacher_disagreement_score":0.016452745,"about_ca_system_score_codex":0.002148615,"about_ca_system_score_gemma":0.0032512548,"threshold_uncertainty_score":0.055039942},"labels":[],"label_agreement":null},{"id":"W1964758092","doi":"10.1016/s0304-3975(99)00085-7","title":"Semantic distance between specifications","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Software Engineering Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université Laval","funders":"","keywords":"Computer science; Reuse; Programming language; Semantic similarity; Semantic computing; Software; Software engineering; Theoretical computer science; Information retrieval; Semantic Web; Engineering","score_opus":0.023179762486844023,"score_gpt":0.2687739268575994,"score_spread":0.24559416437075535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964758092","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.12266399,0.00074051763,0.8267023,0.0023125513,0.00027615746,0.00016160482,0.0019043422,0.0014615406,0.043776963],"genre_scores_gemma":[0.7605579,0.0006096805,0.21797357,0.00056342117,0.00016748131,0.00018191806,0.0055714324,0.0006336311,0.01374104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920853,0.001787549,0.0009410137,0.0015006647,0.0031995333,0.00048586313],"domain_scores_gemma":[0.98776245,0.005744881,0.0007434978,0.0025174236,0.0027585148,0.00047321653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031126002,0.000720495,0.0008392004,0.0045423973,0.0018001753,0.0051015317,0.0017285501,0.0022034757,0.0088589825],"category_scores_gemma":[0.015249002,0.0011207616,0.0018817658,0.003707973,0.0025692119,0.01407294,0.0046324898,0.0038281223,0.0023768672],"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.0001626038,0.00006775401,0.0012162804,0.00016823562,0.000044013723,0.00019818106,0.0010276636,0.0024293454,0.0028763697,0.94862527,0.0013880976,0.041796297],"study_design_scores_gemma":[0.000027844897,0.000057951453,0.0005879827,0.00006552915,0.00006973048,0.00026321204,0.0005566003,0.011786967,0.005056643,0.9625809,0.018919349,0.000027217306],"about_ca_topic_score_codex":0.001196322,"about_ca_topic_score_gemma":0.0010014881,"teacher_disagreement_score":0.0088589825,"about_ca_system_score_codex":0.0018440306,"about_ca_system_score_gemma":0.001604898,"threshold_uncertainty_score":0.029636264},"labels":[],"label_agreement":null},{"id":"W1964943343","doi":"10.1016/j.tcs.2004.12.024","title":"The Thue–Morse word contains circular <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>5</mml:mn><mml:mo>/</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msup></mml:math> power free words of every length","year":2005,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Word (group theory); Morse code; Mathematics; Scroll; Computer science; Geometry; Theology; Philosophy","score_opus":0.012849458332719037,"score_gpt":0.23156772215589969,"score_spread":0.21871826382318066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964943343","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.037940897,0.0019957235,0.18312244,0.009175359,0.015713131,0.00024838667,0.007929038,0.008464362,0.73541063],"genre_scores_gemma":[0.33088067,0.001421346,0.06296286,0.0019358012,0.0025252374,0.00025098346,0.0077648424,0.008218423,0.58403987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996531,0.000065967186,0.00004054593,0.000093086855,0.00008919956,0.000058059315],"domain_scores_gemma":[0.9987276,0.00046756252,0.00007685574,0.00019432478,0.0004080499,0.00012561635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046109266,0.000809167,0.0006153293,0.0010132142,0.0018915938,0.0021600565,0.0005673776,0.0010049231,0.1335784],"category_scores_gemma":[0.0027130316,0.00041457452,0.00051186694,0.00095842965,0.0012320393,0.004000869,0.0012967563,0.0016114679,0.073163666],"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.0002997336,0.00003269738,0.00037430308,0.00029128534,0.000015671028,0.00044798618,0.0015081551,0.00019490611,0.0076861535,0.70696104,0.21273668,0.06945135],"study_design_scores_gemma":[0.00001588161,0.000062753235,0.00037474543,0.00007981309,0.000008249201,0.00044104035,0.00039499276,0.0005501912,0.0047017355,0.10248138,0.8908553,0.000033945027],"about_ca_topic_score_codex":0.001154136,"about_ca_topic_score_gemma":0.0012418063,"teacher_disagreement_score":0.1335784,"about_ca_system_score_codex":0.00086115504,"about_ca_system_score_gemma":0.0005174665,"threshold_uncertainty_score":0.4468643},"labels":[],"label_agreement":null},{"id":"W1965935527","doi":"10.1016/j.tcs.2005.09.042","title":"Solving <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>7</mml:mn><mml:mo>×</mml:mo><mml:mn>7</mml:mn></mml:math> Hex with domination, fill-in, and virtual connections","year":2005,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Scroll; Algorithm; Computer science; Artificial intelligence; Theology; Philosophy","score_opus":0.01570695631548021,"score_gpt":0.25018469921805636,"score_spread":0.23447774290257614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965935527","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.019564275,0.00014994739,0.5410327,0.0018967115,0.00039072437,0.00022587505,0.0019175912,0.0026118937,0.43221027],"genre_scores_gemma":[0.238422,0.00033857324,0.48216403,0.00048833305,0.000103591796,0.0003602851,0.0037598538,0.0021751565,0.2721881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996233,0.000095552954,0.000020413469,0.00009555988,0.00009362949,0.000071533446],"domain_scores_gemma":[0.9995889,0.00016887898,0.000022019953,0.00008644138,0.000077952274,0.000055806227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037279064,0.0008715225,0.0005986622,0.00040833867,0.0014924578,0.0024999613,0.0014874976,0.0010116801,0.12858258],"category_scores_gemma":[0.0019768162,0.00036630884,0.00101084,0.0005882487,0.00083088304,0.003340166,0.0032456196,0.001511307,0.020360744],"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.00017709253,0.00014050583,0.0007069195,0.0003874089,0.000041008014,0.00026838612,0.00086116896,0.014555063,0.0028053906,0.7343045,0.115810856,0.12994161],"study_design_scores_gemma":[0.00011090097,0.000060121773,0.0003538895,0.00009151132,0.000028782577,0.00020257669,0.0008663478,0.06517383,0.0052116974,0.67120993,0.2566546,0.000035804682],"about_ca_topic_score_codex":0.0028702687,"about_ca_topic_score_gemma":0.0073198327,"teacher_disagreement_score":0.12858258,"about_ca_system_score_codex":0.00076098164,"about_ca_system_score_gemma":0.0010579565,"threshold_uncertainty_score":0.43015158},"labels":[],"label_agreement":null},{"id":"W1966045745","doi":"10.1016/j.tcs.2005.11.044","title":"On linear complexity of sequences over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mtext>GF</mml:mtext><mml:mo stretchy=\"false\">(</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2006,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Concordia University","funders":"","keywords":"Scroll; Mathematics; Algorithm; Computer science; Theology; Philosophy","score_opus":0.019594513761659143,"score_gpt":0.24566742363757352,"score_spread":0.22607290987591439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966045745","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.34489563,0.007946135,0.36259177,0.029376639,0.00077000755,0.00022349143,0.0045366734,0.0010684793,0.24859113],"genre_scores_gemma":[0.9151179,0.0041760756,0.037457563,0.0015066094,0.0017577216,0.00042377293,0.0035419492,0.00042083894,0.035597593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744606,0.000693207,0.0001519717,0.0004223337,0.0008056633,0.00048070194],"domain_scores_gemma":[0.9712205,0.023011168,0.0018409663,0.0015185633,0.0015437516,0.0008649873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023934427,0.001115579,0.0010940431,0.003045493,0.0016433375,0.005446536,0.0013686422,0.0016683803,0.012286433],"category_scores_gemma":[0.019855043,0.0006177653,0.00089741155,0.0029658093,0.0031289998,0.012232054,0.0029972387,0.005712788,0.003020875],"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.00026055373,0.000066833905,0.0018061753,0.0002179187,0.00004383037,0.00015367789,0.000579537,0.011921968,0.0014312495,0.9419109,0.014120183,0.027487103],"study_design_scores_gemma":[0.000024331124,0.000043909193,0.000900548,0.00006230764,0.000017632074,0.00013714434,0.00006957206,0.036333684,0.0009453958,0.95789057,0.0035466882,0.000028216095],"about_ca_topic_score_codex":0.0030664473,"about_ca_topic_score_gemma":0.0030477815,"teacher_disagreement_score":0.012286433,"about_ca_system_score_codex":0.0045368206,"about_ca_system_score_gemma":0.0017082804,"threshold_uncertainty_score":0.04110217},"labels":[],"label_agreement":null},{"id":"W1967306786","doi":"10.1016/j.tcs.2005.01.007","title":"Generalised fine and Wilf's theorem for arbitrary number of periods","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"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":"Mathematics; Word (group theory); Divisor (algebraic geometry); Combinatorics; Upper and lower bounds; Word length; Greatest common divisor; Discrete mathematics; Computer science; Geometry","score_opus":0.008713460936695415,"score_gpt":0.25609400636327656,"score_spread":0.24738054542658114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967306786","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.12336539,0.004839568,0.67736214,0.005463757,0.0014284428,0.00012587433,0.0007660252,0.0012764293,0.1853724],"genre_scores_gemma":[0.84659415,0.002162673,0.063119896,0.001630186,0.0013741256,0.00022385246,0.00041900674,0.0006411099,0.08383492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987112,0.00018987176,0.000072932686,0.00044941696,0.00029578133,0.00028071986],"domain_scores_gemma":[0.996581,0.0017683139,0.0001598728,0.00090520916,0.0003204317,0.0002651635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019168922,0.0010202928,0.002112021,0.0023273781,0.00240793,0.003152816,0.0019282335,0.0022499315,0.011730674],"category_scores_gemma":[0.007962612,0.0009880748,0.0025731202,0.0017164391,0.0045819017,0.012532981,0.0039365324,0.0043195663,0.001510248],"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.00005663284,0.000011939066,0.00013389629,0.00007605962,0.000016042926,0.00009405879,0.0002096072,0.0009639908,0.0009327864,0.987525,0.0023372537,0.0076427334],"study_design_scores_gemma":[0.000013314805,0.00000727386,0.00013260043,0.000008663241,0.000010717414,0.000086454675,0.000022010176,0.002018127,0.000413544,0.9929289,0.004343899,0.000014509402],"about_ca_topic_score_codex":0.0010373594,"about_ca_topic_score_gemma":0.00083554635,"teacher_disagreement_score":0.011730674,"about_ca_system_score_codex":0.0017846964,"about_ca_system_score_gemma":0.0006904174,"threshold_uncertainty_score":0.039242983},"labels":[],"label_agreement":null},{"id":"W1967372194","doi":"10.1016/j.tcs.2007.01.020","title":"On critical exponents in fixed points of non-erasing morphisms","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Morphism; Alphabet; Exponent; Eigenvalues and eigenvectors; Fixed point; Finite field; Degree (music); Combinatorics; Algebraic number; Discrete mathematics; Field (mathematics); Matrix (chemical analysis); Critical exponent; Pure mathematics; Mathematical analysis; Geometry; Scaling","score_opus":0.00930701070768034,"score_gpt":0.27711712124310667,"score_spread":0.2678101105354263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967372194","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.8271224,0.0037883588,0.120511495,0.0023157399,0.00043980338,0.00014329316,0.00020569829,0.00043335214,0.045039892],"genre_scores_gemma":[0.97993934,0.0010463056,0.0101304855,0.00018740076,0.00032721038,0.00009753333,0.00012485581,0.00014382444,0.008003078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988601,0.00032026158,0.00008180127,0.00019700773,0.00024025724,0.0003005568],"domain_scores_gemma":[0.98305166,0.012402279,0.0011887144,0.0008306545,0.0010860664,0.0014404894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032343687,0.0014256964,0.0022618135,0.0061901323,0.003701903,0.005674456,0.0016161704,0.0025904484,0.0068797134],"category_scores_gemma":[0.01922332,0.0011275988,0.0013867174,0.0022391032,0.007674327,0.009977567,0.0045657107,0.0045616664,0.0005980215],"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.000118488395,0.000031319236,0.00076095434,0.00007198442,0.000016103857,0.00040177334,0.0010772253,0.0018849075,0.0014611327,0.99106675,0.00047107635,0.0026382445],"study_design_scores_gemma":[0.00006655852,0.00003321909,0.00042962568,0.000050362654,0.000019524528,0.00015382838,0.0003152476,0.0077389847,0.0007472838,0.9893028,0.0011185962,0.00002398738],"about_ca_topic_score_codex":0.0011686172,"about_ca_topic_score_gemma":0.001073632,"teacher_disagreement_score":0.0068797134,"about_ca_system_score_codex":0.0028358973,"about_ca_system_score_gemma":0.00087420153,"threshold_uncertainty_score":0.023014963},"labels":[],"label_agreement":null},{"id":"W1967410222","doi":"10.1016/j.tcs.2009.12.006","title":"Algorithmic properties of ciliate sequence alignment","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Protist diversity and phylogeny","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Ciliate; Sequence (biology); Mathematics; Algorithm; Computer science; Combinatorics; Biology; Genetics","score_opus":0.015454636341603344,"score_gpt":0.23388028509365982,"score_spread":0.21842564875205647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967410222","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.4722217,0.0005744888,0.50962776,0.0026578282,0.00007737011,0.00014975005,0.001482409,0.0012616161,0.011947097],"genre_scores_gemma":[0.85614336,0.00030214776,0.13731626,0.00034414436,0.0001702644,0.00022692494,0.0029302724,0.00038072316,0.0021859976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946679,0.0015458011,0.0006044336,0.0010595147,0.0016918618,0.0004305211],"domain_scores_gemma":[0.94233227,0.04331817,0.0044116755,0.005888214,0.0028957096,0.0011538622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048410404,0.00042845937,0.0011931225,0.0034419633,0.002499835,0.0068644937,0.0027851225,0.0025310235,0.004887567],"category_scores_gemma":[0.04929566,0.0009535018,0.0010557878,0.005029304,0.0025568947,0.009596101,0.003314777,0.0020771725,0.00093452306],"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.0013229676,0.00030590448,0.019717198,0.00042776405,0.00016377767,0.00045836158,0.0012551803,0.12195,0.013364494,0.7353905,0.008115709,0.09752816],"study_design_scores_gemma":[0.00007117552,0.000073871975,0.0018484188,0.000045627585,0.000055386787,0.0004414546,0.00019815261,0.39526558,0.0030684185,0.5970208,0.0018782614,0.000032844768],"about_ca_topic_score_codex":0.0009440392,"about_ca_topic_score_gemma":0.0017544549,"teacher_disagreement_score":0.0068644937,"about_ca_system_score_codex":0.0019754365,"about_ca_system_score_gemma":0.0023638378,"threshold_uncertainty_score":0.025602221},"labels":[],"label_agreement":null},{"id":"W1967439097","doi":"10.1016/j.tcs.2015.03.022","title":"The complexity of zero-visibility cops and robber","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Memorial University of Newfoundland","funders":"Narodowe Centrum Nauki","keywords":"Visibility; Zero (linguistics); Class (philosophy); Tree (set theory); Mathematics; Zero-sum game; Discrete mathematics; Computational complexity theory; Combinatorics; Theoretical computer science; Complexity class; Computer science; Time complexity; Algorithm; Game theory; Artificial intelligence; Mathematical economics; Geography","score_opus":0.07225129867103225,"score_gpt":0.31593751795210256,"score_spread":0.24368621928107032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967439097","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.6122937,0.0019098518,0.2245168,0.008584139,0.00032204014,0.0001687929,0.0017913033,0.0007104071,0.1497029],"genre_scores_gemma":[0.966724,0.00056036183,0.015979402,0.00025009565,0.00018265449,0.000073985895,0.000759008,0.00016153582,0.015309081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977196,0.00051142724,0.00011243355,0.0004643786,0.0006785533,0.0005136993],"domain_scores_gemma":[0.9915071,0.0057144547,0.0007102065,0.00095747993,0.00039590403,0.0007147324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011069382,0.0007738966,0.0017256292,0.0011134057,0.0021960647,0.005868192,0.003179372,0.0028730526,0.020166434],"category_scores_gemma":[0.01571957,0.001069514,0.0013972983,0.0015443364,0.0036609594,0.013226058,0.00399386,0.0034631866,0.0012412516],"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.00022838975,0.00007972615,0.0010936899,0.00016820533,0.000043035496,0.00017035274,0.0004706403,0.03199382,0.0005583547,0.94612724,0.00648537,0.012581177],"study_design_scores_gemma":[0.000031044798,0.00001453131,0.00041464364,0.0000140657585,0.000015260768,0.00009301293,0.000119035714,0.038230658,0.00020179855,0.95899904,0.0018494084,0.000017458005],"about_ca_topic_score_codex":0.005012871,"about_ca_topic_score_gemma":0.0037760127,"teacher_disagreement_score":0.020166434,"about_ca_system_score_codex":0.0022345462,"about_ca_system_score_gemma":0.0019183834,"threshold_uncertainty_score":0.0674634},"labels":[],"label_agreement":null},{"id":"W1968405302","doi":"10.1016/j.tcs.2008.03.017","title":"On stabilizers of infinite words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Word (group theory); Monoid; Mathematics; Alphabet; Invertible matrix; Combinatorics on words; Free monoid; Characterization (materials science); Discrete mathematics; Pure mathematics; Linguistics","score_opus":0.012084624867511811,"score_gpt":0.2342318309442782,"score_spread":0.2221472060767664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968405302","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.6823422,0.0025805873,0.19193907,0.0025615394,0.000713149,0.00007398274,0.00035837234,0.0007615819,0.11866954],"genre_scores_gemma":[0.9661709,0.00068813044,0.0070453603,0.00021594943,0.000705839,0.00008052075,0.000246854,0.00016160267,0.02468482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912924,0.00022006208,0.000050218143,0.00019775871,0.000215384,0.00018739137],"domain_scores_gemma":[0.9959943,0.0025375395,0.00033100534,0.00030619092,0.00044481957,0.00038612404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000867394,0.0009191139,0.0009966228,0.0024178973,0.002251783,0.0036290868,0.000877225,0.0011708004,0.0075220703],"category_scores_gemma":[0.0042905947,0.00058635615,0.00091995153,0.001315496,0.0035288201,0.005419685,0.0024069347,0.002036841,0.0009713188],"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.00005111538,0.000014069164,0.00019977549,0.000023995162,0.000005940964,0.00011424494,0.000577892,0.0010814714,0.0014048993,0.9931219,0.0006022787,0.002802284],"study_design_scores_gemma":[0.000016345986,0.000022872062,0.00016026395,0.00001168886,0.000008640387,0.00004184373,0.00012245201,0.0041299877,0.0005744421,0.99344146,0.001459094,0.000011013736],"about_ca_topic_score_codex":0.0012211307,"about_ca_topic_score_gemma":0.001215094,"teacher_disagreement_score":0.0075220703,"about_ca_system_score_codex":0.0013764828,"about_ca_system_score_gemma":0.0005189691,"threshold_uncertainty_score":0.02516383},"labels":[],"label_agreement":null},{"id":"W1968885544","doi":"10.1016/s0304-3975(03)00141-5","title":"On polynomial-time approximation algorithms for the variable length scheduling problem","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Approximation algorithm; Mathematics; Algorithm; Extension (predicate logic); Approximation error; Scheduling (production processes); Polynomial-time approximation scheme; Variable (mathematics); Discrete mathematics; Combinatorics; Computer science; Mathematical optimization; Mathematical analysis","score_opus":0.016075939359333716,"score_gpt":0.2594672765588951,"score_spread":0.2433913371995614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968885544","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.030166674,0.003369949,0.9452551,0.0029396384,0.00048211977,0.00020487861,0.00033918273,0.0018181567,0.015424302],"genre_scores_gemma":[0.2760889,0.0031196682,0.70487404,0.0011904286,0.00072168343,0.0004683659,0.0014131682,0.00093258556,0.011191172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960743,0.0014442095,0.00017373415,0.00063913193,0.00087971205,0.0007889494],"domain_scores_gemma":[0.98527527,0.011432782,0.0006765597,0.0014551989,0.0006945104,0.00046573402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054848143,0.0025448643,0.0027919621,0.0019315805,0.0021634847,0.0042780074,0.0049348585,0.0029169868,0.00954586],"category_scores_gemma":[0.023218166,0.0011432066,0.001775401,0.0050404854,0.00239573,0.009245046,0.003081579,0.0055457707,0.0021706312],"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.0018962801,0.0008122934,0.001219858,0.00051092036,0.00018570482,0.00009707245,0.0004318003,0.5750553,0.0025321343,0.13881119,0.027711933,0.25073555],"study_design_scores_gemma":[0.00029755506,0.000089759495,0.000184026,0.00003947473,0.000059414204,0.000042411193,0.000090522866,0.859037,0.0005990236,0.13613752,0.0034024057,0.000020987976],"about_ca_topic_score_codex":0.014345834,"about_ca_topic_score_gemma":0.014672704,"teacher_disagreement_score":0.014345834,"about_ca_system_score_codex":0.0051281108,"about_ca_system_score_gemma":0.0054321242,"threshold_uncertainty_score":0.037207246},"labels":[],"label_agreement":null},{"id":"W1969276875","doi":"10.1016/j.tcs.2014.09.029","title":"Near-optimal PAC bounds for discounted MDPs","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Upper and lower bounds; Markov decision process; Logarithm; Sample complexity; Mathematics; Reinforcement learning; State space; Stochastic matrix; Markov chain; Matrix (chemical analysis); Space (punctuation); Markov process; Mathematical optimization; Applied mathematics; Combinatorics; Computer science; Statistics; Mathematical analysis","score_opus":0.04680964409173786,"score_gpt":0.418173190851378,"score_spread":0.3713635467596401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969276875","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.045028202,0.007226659,0.8873165,0.0063357092,0.00051983265,0.0003280487,0.0016208381,0.0011646614,0.05045956],"genre_scores_gemma":[0.7585099,0.0068838866,0.20517865,0.00250922,0.0012957379,0.0011919447,0.0018725761,0.0010212702,0.021536862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934277,0.0020987585,0.00029918572,0.00095371273,0.0018010491,0.0014196353],"domain_scores_gemma":[0.9427331,0.049183797,0.0014394098,0.0025205119,0.0020557707,0.0020674246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008327335,0.003738836,0.0053035473,0.0034624543,0.002481854,0.009079892,0.004883167,0.0047282414,0.014474662],"category_scores_gemma":[0.05770148,0.002196721,0.0022118895,0.0039134347,0.0038783613,0.013914649,0.0071413456,0.011026454,0.0017568733],"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.0006423899,0.0003353945,0.0007585368,0.00069078605,0.00013578912,0.00011156667,0.00024015944,0.6149774,0.00093090895,0.33009556,0.010561384,0.040520158],"study_design_scores_gemma":[0.000039809038,0.0000644892,0.00012586577,0.00013244241,0.000039262748,0.000058858466,0.00005098038,0.69099057,0.0005458053,0.30625242,0.0016750109,0.000024520958],"about_ca_topic_score_codex":0.004809622,"about_ca_topic_score_gemma":0.0068391766,"teacher_disagreement_score":0.014474662,"about_ca_system_score_codex":0.008643851,"about_ca_system_score_gemma":0.008258153,"threshold_uncertainty_score":0.06271583},"labels":[],"label_agreement":null},{"id":"W1969389934","doi":"10.1016/j.tcs.2014.11.030","title":"Interactive proofs with quantum finite automata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Quantum; Automaton; Bounded function; Probabilistic logic; Computer science; Theoretical computer science; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics; Artificial intelligence; Quantum mechanics","score_opus":0.0047482486649775306,"score_gpt":0.22477091848971115,"score_spread":0.22002266982473362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969389934","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.063695855,0.0012239357,0.8760989,0.0040942915,0.00038396925,0.00013958276,0.0002962159,0.0016186673,0.05244865],"genre_scores_gemma":[0.8668363,0.0006667159,0.1184884,0.0006339674,0.00043984724,0.00024908507,0.00023314086,0.0004515898,0.012000921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921411,0.0037672904,0.000358509,0.00090607716,0.0020603111,0.00076669303],"domain_scores_gemma":[0.9604683,0.032244567,0.0008937461,0.004006413,0.0014405154,0.0009464909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049574887,0.0011045166,0.0016153904,0.0022045549,0.0034596007,0.0058388263,0.0032514143,0.0029524555,0.015083646],"category_scores_gemma":[0.029859807,0.0015374382,0.0024186277,0.0020937298,0.0065948563,0.016006917,0.0070906556,0.00655376,0.0016532872],"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.000059018552,0.0000329685,0.00011616894,0.00005434338,0.00001612956,0.000054279517,0.00021707334,0.0032775707,0.00043292678,0.99097145,0.0008349694,0.003933122],"study_design_scores_gemma":[0.000021742217,0.0000062759987,0.000029043653,0.000010837915,0.000009342761,0.000020031168,0.000016081964,0.014881876,0.0005000993,0.9832758,0.0012170003,0.000011779333],"about_ca_topic_score_codex":0.0013220067,"about_ca_topic_score_gemma":0.0013328817,"teacher_disagreement_score":0.015083646,"about_ca_system_score_codex":0.0034581083,"about_ca_system_score_gemma":0.0018200107,"threshold_uncertainty_score":0.050459802},"labels":[],"label_agreement":null},{"id":"W1969770235","doi":"10.1016/j.tcs.2005.01.004","title":"Pattern avoidance: themes and variations","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Mathematics; Psychology; Artificial intelligence","score_opus":0.00609221224695569,"score_gpt":0.22810185740351413,"score_spread":0.22200964515655844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969770235","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.2054491,0.047522657,0.45730588,0.0332859,0.0014197279,0.00011289815,0.00043366704,0.0005730271,0.253897],"genre_scores_gemma":[0.9119684,0.012376632,0.052393112,0.0014333762,0.0015391805,0.00019363068,0.00022526529,0.00022994692,0.019640494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845195,0.00042917102,0.0001064914,0.000444767,0.00040586235,0.00016173554],"domain_scores_gemma":[0.99688953,0.0016540785,0.00021928271,0.00059873826,0.00042197446,0.0002163567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019534465,0.0004545661,0.00086215336,0.0020049603,0.002541463,0.0062346794,0.0020960376,0.0019916915,0.0052127372],"category_scores_gemma":[0.0060873,0.00044550732,0.0007108465,0.0030203434,0.010869601,0.011914786,0.0034809671,0.003261338,0.00057737145],"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.000009564759,0.000009621334,0.00015879828,0.000032798616,0.00000414814,0.000027906339,0.0005072041,0.00035316404,0.00018408035,0.99062717,0.00089465355,0.0071909856],"study_design_scores_gemma":[0.000004265978,0.000005192261,0.00012900573,0.00001180483,0.0000030076735,0.000077904166,0.00023557302,0.000944102,0.00009227794,0.9924379,0.006053087,0.000005932158],"about_ca_topic_score_codex":0.00089866004,"about_ca_topic_score_gemma":0.00080771407,"teacher_disagreement_score":0.0062346794,"about_ca_system_score_codex":0.0019648296,"about_ca_system_score_gemma":0.0008028915,"threshold_uncertainty_score":0.017438293},"labels":[],"label_agreement":null},{"id":"W1970322539","doi":"10.1016/j.tcs.2008.10.005","title":"Gathering few fat mobile robots in the plane","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":141,"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 en Outaouais","funders":"Engineering and Physical Sciences Research Council","keywords":"Robot; Asynchronous communication; Mobile robot; Computer science; Plane (geometry); Artificial intelligence; Combinatorics; Mathematics; Geometry; Telecommunications","score_opus":0.020414413547268855,"score_gpt":0.260438264394177,"score_spread":0.24002385084690814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970322539","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.4746212,0.00072110957,0.51526785,0.0010591586,0.00008363174,0.000068990106,0.00018307436,0.00023388896,0.0077611543],"genre_scores_gemma":[0.82957584,0.0005757834,0.16229546,0.00014518159,0.000059090835,0.00008996598,0.00022588173,0.000057407047,0.0069753523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978656,0.000047261972,0.0000099838135,0.000059987953,0.00004318809,0.000053077743],"domain_scores_gemma":[0.9989104,0.00065108464,0.00016208811,0.00009148665,0.000083904764,0.00010103014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047005262,0.00063743815,0.0011230535,0.0007466933,0.0011781489,0.0010700964,0.0010523369,0.0013857399,0.0028667348],"category_scores_gemma":[0.003019142,0.0006287172,0.0005384134,0.0008049204,0.0010893184,0.0019780707,0.002350956,0.0009019708,0.0006192573],"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.0027708234,0.0001916875,0.0062249335,0.0006548898,0.00034859034,0.0016325306,0.0010708736,0.74311614,0.04455502,0.11201854,0.0043067005,0.08310929],"study_design_scores_gemma":[0.00015895591,0.0002909328,0.0010597436,0.000049968352,0.000059294707,0.00039209222,0.0005772076,0.9208407,0.004455372,0.069778755,0.0023112867,0.000025615826],"about_ca_topic_score_codex":0.0011076138,"about_ca_topic_score_gemma":0.00095914863,"teacher_disagreement_score":0.0028667348,"about_ca_system_score_codex":0.0003704657,"about_ca_system_score_gemma":0.0002699976,"threshold_uncertainty_score":0.0095902085},"labels":[],"label_agreement":null},{"id":"W1970529854","doi":"10.1016/s0304-3975(02)00135-4","title":"Strand design for biomolecular computation","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":101,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"DNA computing; DNA; Computation; Computer science; Theoretical computer science; Computational biology; Algorithm; Biology; Genetics","score_opus":0.01792685408095541,"score_gpt":0.28421216132173666,"score_spread":0.26628530724078125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970529854","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.030989353,0.0013577458,0.9368671,0.00054572,0.00040469738,0.00011218081,0.00017420098,0.0017654132,0.027783526],"genre_scores_gemma":[0.46250182,0.0015060215,0.49844772,0.0005611511,0.00014124844,0.0005652336,0.000469846,0.00080967933,0.034997236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976176,0.00009467421,0.00001375478,0.000048958216,0.00005182378,0.000029024162],"domain_scores_gemma":[0.9995809,0.00017029924,0.000024514055,0.00012408986,0.000069780515,0.000030320683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053945085,0.0005447078,0.00044597127,0.00038974782,0.00060823915,0.0007803381,0.00082183763,0.0007456445,0.011628708],"category_scores_gemma":[0.00146286,0.00032108586,0.00032088815,0.00044033313,0.0005348664,0.0012249653,0.00090058486,0.00068219757,0.0030615022],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069208205,0.000097103024,0.00035676602,0.0006196112,0.0000564376,0.00011410639,0.00022558037,0.06306222,0.064297184,0.6164868,0.010257277,0.24373485],"study_design_scores_gemma":[0.000096628515,0.00021319721,0.00006510232,0.00008803985,0.00003993045,0.000085557025,0.000060539496,0.18779597,0.0556281,0.6776496,0.07824631,0.000031027597],"about_ca_topic_score_codex":0.00018537151,"about_ca_topic_score_gemma":0.00033327463,"teacher_disagreement_score":0.011628708,"about_ca_system_score_codex":0.0004126423,"about_ca_system_score_gemma":0.00043573463,"threshold_uncertainty_score":0.038901925},"labels":[],"label_agreement":null},{"id":"W1970607503","doi":"10.1016/j.tcs.2013.02.032","title":"Impartial coloring games","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Greedy coloring; Graph coloring; Complete coloring; Fractional coloring; List coloring; Combinatorics; Edge coloring; Mathematics; Graph; Discrete mathematics; Combinatorial game theory; Computer science; Graph power; Sequential game; Game theory; Mathematical economics; Line graph","score_opus":0.017884919955491116,"score_gpt":0.27568016414118746,"score_spread":0.2577952441856963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970607503","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.10915582,0.00075879693,0.513207,0.004498522,0.00060920825,0.00034391857,0.0008067782,0.000706248,0.3699137],"genre_scores_gemma":[0.8255883,0.0007018442,0.08285059,0.0012268171,0.00034833487,0.00041431526,0.0007153515,0.0003624504,0.08779197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973105,0.0011808656,0.00009685512,0.00034611678,0.00059362024,0.00047204067],"domain_scores_gemma":[0.9907358,0.0052280123,0.00034971943,0.001538883,0.0007954178,0.0013520555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001986733,0.0014307267,0.0015220772,0.0013403377,0.0031836017,0.0048128255,0.0034439855,0.0024877647,0.020091133],"category_scores_gemma":[0.009729923,0.0007956351,0.0012702262,0.0022083751,0.003178284,0.0063467836,0.0035263295,0.0058169616,0.0019100633],"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.00007104438,0.000044588025,0.000072645555,0.000042447424,0.000013696624,0.000029428758,0.00010000821,0.004762658,0.00026517475,0.9853308,0.004169702,0.005097686],"study_design_scores_gemma":[0.000035219742,0.000014397869,0.000045875924,0.000009983333,0.000011703532,0.000037540416,0.000032261894,0.02212019,0.00017214839,0.97386,0.0036516925,0.00000906842],"about_ca_topic_score_codex":0.0021535533,"about_ca_topic_score_gemma":0.0031198629,"teacher_disagreement_score":0.020091133,"about_ca_system_score_codex":0.0022173019,"about_ca_system_score_gemma":0.0018054396,"threshold_uncertainty_score":0.06721157},"labels":[],"label_agreement":null},{"id":"W1972308905","doi":"10.1016/s0304-3975(02)00044-0","title":"Optimal three-dimensional orthogonal graph drawing in the general position model","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Grid; Graph drawing; Mathematics; Lattice graph; Position (finance); General position; Enhanced Data Rates for GSM Evolution; Graph; Upper and lower bounds; Geometry; Computer science; Line graph; Artificial intelligence; Mathematical analysis; Voltage graph","score_opus":0.013384602360184827,"score_gpt":0.2546917651174501,"score_spread":0.2413071627572653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972308905","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.050214715,0.00015489616,0.9416386,0.00023139517,0.000044667227,0.00004907808,0.00017597388,0.00080668327,0.0066839154],"genre_scores_gemma":[0.47140697,0.00033297949,0.518598,0.00013353652,0.00003443305,0.00009300507,0.00054241956,0.00048075695,0.008377801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996537,0.00009358993,0.000013552392,0.00008271509,0.00010623137,0.000050240575],"domain_scores_gemma":[0.9993992,0.00026861147,0.00006842936,0.00014958894,0.00005656171,0.000057585446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048815648,0.0007159881,0.0011980606,0.00076973,0.00051425124,0.0011971918,0.0014917927,0.0014445446,0.0068503898],"category_scores_gemma":[0.001954063,0.0006423597,0.0007107411,0.0012745581,0.00080557104,0.0020543183,0.0015302496,0.001222553,0.00078622915],"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.0002429549,0.00010886048,0.0006398916,0.0001552144,0.000038380862,0.00012366865,0.00015081084,0.6496206,0.00467323,0.1737684,0.0063561588,0.16412184],"study_design_scores_gemma":[0.000018262319,0.000015660336,0.000057434005,0.000005518259,0.00000602964,0.00001924255,0.000017888624,0.96312106,0.00059986574,0.035218153,0.00091406517,0.0000067484607],"about_ca_topic_score_codex":0.0049715326,"about_ca_topic_score_gemma":0.00762258,"teacher_disagreement_score":0.0068503898,"about_ca_system_score_codex":0.00084566517,"about_ca_system_score_gemma":0.0007642672,"threshold_uncertainty_score":0.022916853},"labels":[],"label_agreement":null},{"id":"W1972483293","doi":"10.1016/s0304-3975(01)00092-5","title":"On two-sided infinite fixed points of morphisms","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Fixed point; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.014840616386578827,"score_gpt":0.24063132006135882,"score_spread":0.22579070367478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972483293","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.61217695,0.0016367772,0.2765257,0.0013906232,0.00036480254,0.000084950196,0.00023374388,0.00044874562,0.107137755],"genre_scores_gemma":[0.922906,0.00082151906,0.04208043,0.00029007622,0.00023433428,0.00018038471,0.00029449761,0.00022016502,0.03297265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998089,0.00046601883,0.00013313328,0.0003808624,0.0004936572,0.0004372968],"domain_scores_gemma":[0.9948427,0.003102073,0.00040900335,0.00049206143,0.00053712045,0.00061698817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021363534,0.0011666158,0.0017778152,0.0040155384,0.0038878175,0.004630283,0.0019408284,0.003360101,0.006064177],"category_scores_gemma":[0.0068796393,0.0011901888,0.0022716322,0.0023930282,0.0067852675,0.006871274,0.0062920395,0.004865667,0.0009854706],"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.00004398201,0.0000174598,0.00016031237,0.000020961672,0.000007957876,0.0001597564,0.0003809558,0.0011164197,0.00059288274,0.9944944,0.00016618469,0.002838693],"study_design_scores_gemma":[0.00002340552,0.00001869872,0.000111352994,0.00001804722,0.000007818923,0.00008748369,0.00010015726,0.0038107955,0.00038941865,0.9944564,0.00096164,0.000014680516],"about_ca_topic_score_codex":0.0017605418,"about_ca_topic_score_gemma":0.0012723064,"teacher_disagreement_score":0.006064177,"about_ca_system_score_codex":0.0025907885,"about_ca_system_score_gemma":0.00085117744,"threshold_uncertainty_score":0.02028668},"labels":[],"label_agreement":null},{"id":"W1972876322","doi":"10.1016/s0304-3975(00)00080-3","title":"Sokoban: improving the search with relevance cuts","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Relevance (law); Computer science; Context (archaeology); Reduction (mathematics); Sequence (biology); Current (fluid); Measure (data warehouse); Incremental heuristic search; State (computer science); Artificial intelligence; Algorithm; Search algorithm; Theoretical computer science; Mathematics; Machine learning; Beam search; Data mining","score_opus":0.011189001344637992,"score_gpt":0.2382632445281641,"score_spread":0.22707424318352612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972876322","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.05426351,0.008058981,0.89893895,0.003170159,0.0012248632,0.0004874498,0.0017196656,0.011659117,0.020477286],"genre_scores_gemma":[0.29043785,0.0016069473,0.6858249,0.0014010712,0.0006444589,0.00050122064,0.0041064788,0.0024696907,0.013007389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521506,0.0022284272,0.00024424485,0.00064432196,0.0013328367,0.00033511312],"domain_scores_gemma":[0.9929913,0.0035617757,0.00033400676,0.0016651857,0.001133606,0.00031406656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032709234,0.0018305978,0.0036701108,0.0046944898,0.0017857357,0.0034478828,0.0032171002,0.0034951246,0.015770352],"category_scores_gemma":[0.021728119,0.0011374679,0.0016423701,0.005222402,0.0014419085,0.0074722623,0.0041431203,0.0037050066,0.0048299255],"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.0060289195,0.0008961363,0.0016729773,0.0013067699,0.00040308796,0.00022959485,0.00039396677,0.072877645,0.011639153,0.0895101,0.08860991,0.72643185],"study_design_scores_gemma":[0.0012101711,0.0005738437,0.00077710464,0.00017597881,0.00028260058,0.00041308414,0.00021784368,0.7212631,0.009411044,0.2392192,0.026357768,0.00009826459],"about_ca_topic_score_codex":0.0027388597,"about_ca_topic_score_gemma":0.0039922344,"teacher_disagreement_score":0.015770352,"about_ca_system_score_codex":0.0011063152,"about_ca_system_score_gemma":0.00282534,"threshold_uncertainty_score":0.052757084},"labels":[],"label_agreement":null},{"id":"W1973037646","doi":"10.1016/j.tcs.2003.05.004","title":"Space-efficient planar convex hull algorithms","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Convex hull; Algorithm; Orthogonal convex hull; Planar; Output-sensitive algorithm; Convex set; Convex polytope; Hull; Space (punctuation); Point (geometry); Regular polygon; Convex combination; Mathematics; Set (abstract data type); Computer science; Combinatorics; Convex body; Convex optimization; Geometry; Engineering","score_opus":0.009997889783895464,"score_gpt":0.24463024862667818,"score_spread":0.23463235884278272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973037646","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.010513535,0.0002998801,0.9787481,0.00028389966,0.00007667188,0.000103864746,0.00022557867,0.0018098336,0.007938693],"genre_scores_gemma":[0.16932492,0.0005029238,0.8159925,0.00017468518,0.00008888119,0.00020945536,0.0012784301,0.0008286794,0.011599603],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877936,0.00017024596,0.000053619387,0.00017345995,0.0006676163,0.00015576335],"domain_scores_gemma":[0.99824595,0.00069717166,0.00009598424,0.0004898874,0.00038687902,0.000084149746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000630649,0.0013272004,0.0014513755,0.0018265975,0.0009970855,0.0019275106,0.0024010283,0.0013911189,0.01655786],"category_scores_gemma":[0.0047935676,0.0008706577,0.0012586328,0.0030709067,0.0008899168,0.003186169,0.0040704836,0.0025952465,0.0040830094],"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.00043858908,0.0002572885,0.00060739263,0.0002743894,0.00006644411,0.00009542428,0.00017570738,0.23712882,0.008818447,0.076964304,0.02151154,0.6536617],"study_design_scores_gemma":[0.0000817446,0.00007092962,0.00017743224,0.000019157602,0.000019170066,0.00006882699,0.00007388566,0.9344301,0.0060355933,0.05242997,0.0065774587,0.000015671689],"about_ca_topic_score_codex":0.0043242653,"about_ca_topic_score_gemma":0.006577045,"teacher_disagreement_score":0.01655786,"about_ca_system_score_codex":0.0010689971,"about_ca_system_score_gemma":0.0013075679,"threshold_uncertainty_score":0.05539161},"labels":[],"label_agreement":null},{"id":"W1973204071","doi":"10.1016/j.tcs.2014.04.019","title":"Locating a backtracking robber on a tree","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Vertex (graph theory); Backtracking; Combinatorics; Graph; Mathematics; Game tree; Computer science; Algorithm; Mathematical economics; Game theory; Sequential game","score_opus":0.009239208138844948,"score_gpt":0.23010799290770806,"score_spread":0.22086878476886312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973204071","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.39221787,0.0006168437,0.5663566,0.0025090906,0.00033792207,0.00044189655,0.00111707,0.002218658,0.03418398],"genre_scores_gemma":[0.53845227,0.00029832346,0.43189955,0.00033381535,0.00005138985,0.00017479958,0.0012497838,0.0006970139,0.02684298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869835,0.00024134328,0.00006365717,0.00041181943,0.00022409353,0.00036071293],"domain_scores_gemma":[0.9967604,0.001875498,0.00024589954,0.00050815917,0.0002695131,0.00034060568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097569154,0.0011337132,0.0022660915,0.0017289658,0.0034597572,0.0023233085,0.0025841075,0.0056412616,0.015580363],"category_scores_gemma":[0.006370382,0.0011796127,0.001318005,0.0016150582,0.0021944644,0.005928832,0.004604982,0.0021851894,0.0032667674],"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.0029694897,0.0009766504,0.009519205,0.0015117095,0.0002982993,0.0068872967,0.0032355422,0.3308837,0.037352197,0.38775945,0.032232963,0.1863735],"study_design_scores_gemma":[0.00015154187,0.00042380474,0.0012945009,0.00028292855,0.00011668422,0.0011591897,0.0018760464,0.66746354,0.015706953,0.295301,0.016134787,0.00008900424],"about_ca_topic_score_codex":0.00423638,"about_ca_topic_score_gemma":0.006798855,"teacher_disagreement_score":0.015580363,"about_ca_system_score_codex":0.0012444525,"about_ca_system_score_gemma":0.0015020367,"threshold_uncertainty_score":0.05212146},"labels":[],"label_agreement":null},{"id":"W1973245383","doi":"10.1016/j.tcs.2012.04.005","title":"Choosing the best among peers","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 en Outaouais","funders":"","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.027247813925103392,"score_gpt":0.2297254077473563,"score_spread":0.20247759382225292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973245383","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.67765296,0.0017452663,0.20456077,0.014847823,0.00055852113,0.00035459467,0.00049915526,0.00039903334,0.09938189],"genre_scores_gemma":[0.96311206,0.00027831036,0.022887327,0.00031241568,0.00012836244,0.000069148344,0.00015090818,0.00007216209,0.012989258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968154,0.0016827282,0.000120015924,0.0005691638,0.00042381758,0.00038880526],"domain_scores_gemma":[0.99264175,0.0046485392,0.00040062744,0.0009642621,0.00062402716,0.0007206317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00211696,0.0004186911,0.0012419269,0.000971137,0.0014395851,0.0031280038,0.0014935269,0.002015652,0.016032923],"category_scores_gemma":[0.018409086,0.00035100314,0.0005871492,0.0007663632,0.00080178404,0.003870132,0.0012546297,0.0015837664,0.0023558931],"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.002721512,0.0014294946,0.04196722,0.0007655158,0.0010200649,0.0014508328,0.0028195076,0.05036445,0.019242154,0.4379635,0.038615145,0.40164077],"study_design_scores_gemma":[0.0004038223,0.0006707186,0.005803186,0.000117967415,0.00054115814,0.001312986,0.0040895804,0.32645288,0.011066146,0.61531943,0.03408689,0.00013524308],"about_ca_topic_score_codex":0.0007149063,"about_ca_topic_score_gemma":0.0013593911,"teacher_disagreement_score":0.016032923,"about_ca_system_score_codex":0.00040909825,"about_ca_system_score_gemma":0.0007759209,"threshold_uncertainty_score":0.053635538},"labels":[],"label_agreement":null},{"id":"W1973736970","doi":"10.1016/j.tcs.2013.08.014","title":"Generation of Combinatorial Structures","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Design Education and Practice","field":"Engineering","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":"Computer science; Mathematics; Combinatorics","score_opus":0.018945886962782123,"score_gpt":0.25999069165725186,"score_spread":0.24104480469446973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973736970","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.19057257,0.0003874065,0.6381546,0.00090457697,0.00062091084,0.0003783572,0.0011294576,0.0013328681,0.16651925],"genre_scores_gemma":[0.6857168,0.00032461516,0.2669545,0.00034463446,0.0001226694,0.0003133456,0.0028409497,0.00089169067,0.042490732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950314,0.00013357823,0.000023350516,0.00012081777,0.00015600264,0.000063084284],"domain_scores_gemma":[0.99901664,0.00038664084,0.000059190443,0.00028869562,0.00017708117,0.000071775794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036693658,0.0004965535,0.0003805894,0.0013315488,0.00089947507,0.0017061139,0.0008899485,0.00073687296,0.018126665],"category_scores_gemma":[0.0022700473,0.0004299851,0.0012101099,0.0007412713,0.0008852172,0.0012390671,0.0016058956,0.0012445824,0.0031805963],"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.00008660435,0.00009605225,0.00066923647,0.00020498222,0.000026514163,0.00029884995,0.0002689091,0.016300736,0.013514154,0.8901752,0.009725834,0.06863297],"study_design_scores_gemma":[0.000047376507,0.00008125803,0.00050943345,0.000055333952,0.00003011463,0.000396078,0.0001558247,0.08733148,0.013373084,0.86667186,0.03131933,0.000028729442],"about_ca_topic_score_codex":0.0002997458,"about_ca_topic_score_gemma":0.0005303035,"teacher_disagreement_score":0.018126665,"about_ca_system_score_codex":0.0006166521,"about_ca_system_score_gemma":0.00047741248,"threshold_uncertainty_score":0.06063974},"labels":[],"label_agreement":null},{"id":"W1973769779","doi":"10.1016/j.tcs.2009.01.026","title":"Dejean’s conjecture holds for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi><mml:mo>≥</mml:mo><mml:mn>30</mml:mn></mml:math>","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Meromorphic and Entire Functions","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Conjecture; Scroll; Mathematics; Combinatorics; Computer science; Algorithm; Theology; Philosophy","score_opus":0.022104437405474686,"score_gpt":0.2592753729149596,"score_spread":0.23717093550948493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973769779","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.108113855,0.0018240949,0.052218936,0.03307701,0.0025342896,0.000042575055,0.0010297162,0.00052718056,0.8006323],"genre_scores_gemma":[0.8296307,0.0014539689,0.018309675,0.0055376263,0.0011581714,0.000093037284,0.0014139453,0.0003326951,0.14207023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909985,0.000117925985,0.000028882168,0.00029556616,0.00014201613,0.00031590305],"domain_scores_gemma":[0.9974578,0.0010460331,0.00013709183,0.00047653206,0.00063690695,0.00024568095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010743539,0.0008220103,0.0009596628,0.0015182145,0.003319702,0.0021968912,0.0011483129,0.0016177192,0.024516044],"category_scores_gemma":[0.004676821,0.00037350497,0.001268997,0.0009306729,0.0030635523,0.0061419564,0.0025307743,0.003263034,0.0037760737],"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.00008299883,0.00003217617,0.0006870199,0.000071093615,0.000015712008,0.00011159418,0.00018487805,0.00049304054,0.00039455754,0.96989685,0.019439315,0.008590792],"study_design_scores_gemma":[0.00002116765,0.000018324736,0.00093755743,0.000026869297,0.000014180623,0.00023506874,0.00015568719,0.0024661627,0.00073054375,0.95650476,0.038875308,0.000014210678],"about_ca_topic_score_codex":0.0038905886,"about_ca_topic_score_gemma":0.007681175,"teacher_disagreement_score":0.024516044,"about_ca_system_score_codex":0.0022563676,"about_ca_system_score_gemma":0.0010128596,"threshold_uncertainty_score":0.08201432},"labels":[],"label_agreement":null},{"id":"W1973843421","doi":"10.1016/j.tcs.2004.04.017","title":"Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"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 en Outaouais","funders":"","keywords":"Broadcasting (networking); Upper and lower bounds; Computer science; Constant (computer programming); Network topology; Time complexity; Randomized algorithm; Matching (statistics); Node (physics); Algorithm; Mathematics; Discrete mathematics; Combinatorics; Theoretical computer science; Topology (electrical circuits); Computer network","score_opus":0.028965389273668086,"score_gpt":0.26659885829739577,"score_spread":0.23763346902372767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973843421","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.4736305,0.0030470334,0.4630956,0.016262712,0.0003712404,0.00018755738,0.001363625,0.0008207747,0.041220956],"genre_scores_gemma":[0.9775095,0.0007464444,0.015707562,0.0003890242,0.00037797686,0.00011844524,0.0002798685,0.00017598458,0.004695115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955924,0.0019441037,0.00017750465,0.0005666885,0.0009909195,0.00072832586],"domain_scores_gemma":[0.91864914,0.07003151,0.002897031,0.0052287513,0.0019261054,0.0012674714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004873024,0.00051779556,0.0012169523,0.0012356279,0.00088326936,0.0035895086,0.001921301,0.0017447842,0.005679753],"category_scores_gemma":[0.03663193,0.0005189001,0.0010392506,0.0014059365,0.002581313,0.008569326,0.0018455891,0.0027703743,0.00046589403],"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.0014566485,0.00014667862,0.0022546398,0.00035677408,0.00012834341,0.00012512952,0.00046750734,0.22957487,0.0050116507,0.71511173,0.007629392,0.037736658],"study_design_scores_gemma":[0.00012638068,0.00010335528,0.0009027998,0.000027351578,0.000060115803,0.000116078205,0.0000883742,0.3927218,0.0018645675,0.6026644,0.0012895635,0.000035108736],"about_ca_topic_score_codex":0.0016653594,"about_ca_topic_score_gemma":0.0013272573,"teacher_disagreement_score":0.005679753,"about_ca_system_score_codex":0.0031928108,"about_ca_system_score_gemma":0.0029489347,"threshold_uncertainty_score":0.02577132},"labels":[],"label_agreement":null},{"id":"W1974431732","doi":"10.1016/j.tcs.2006.12.025","title":"A fibrational framework for possible-world semantics of Algol-like languages","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":3,"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":"Programming language; Semantics (computer science); Computer science","score_opus":0.010800591204830524,"score_gpt":0.27910980784303674,"score_spread":0.2683092166382062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974431732","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.014455402,0.0009441346,0.93959916,0.002921978,0.000390083,0.00011116622,0.00038415528,0.0009930562,0.040200908],"genre_scores_gemma":[0.4899127,0.001380959,0.49173215,0.001215976,0.0007602521,0.000576037,0.0008111262,0.00063017436,0.012980651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729913,0.0010363115,0.0003813748,0.00045893033,0.00048037223,0.00034388262],"domain_scores_gemma":[0.9967602,0.0013438639,0.00022801684,0.0005959494,0.00068824267,0.00038373936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005140262,0.0012418086,0.0010904262,0.0036348917,0.004723715,0.008077274,0.0025862593,0.0025529114,0.007983047],"category_scores_gemma":[0.0053853337,0.0010470588,0.0029408406,0.0029157293,0.009101682,0.018724592,0.0060841767,0.0050888313,0.0018121102],"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.0000046243754,0.000006096357,0.000033898683,0.000014152896,0.000003401765,0.00003810754,0.00022715535,0.00018689566,0.000106206164,0.9978461,0.00029027715,0.0012431678],"study_design_scores_gemma":[0.00000549132,0.000006389585,0.000029226145,0.000012045177,0.00000777025,0.00005089533,0.00008589116,0.0015358444,0.00015572559,0.9922965,0.005804453,0.000009709932],"about_ca_topic_score_codex":0.0021046505,"about_ca_topic_score_gemma":0.0018088408,"teacher_disagreement_score":0.008077274,"about_ca_system_score_codex":0.0024015664,"about_ca_system_score_gemma":0.0014258369,"threshold_uncertainty_score":0.027184606},"labels":[],"label_agreement":null},{"id":"W1974556260","doi":"10.1016/j.tcs.2007.07.030","title":"Regulated RNA rewriting: Modelling RNA editing with guided insertion","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA regulation and disease","field":"Biochemistry, Genetics and Molecular Biology","cited_by":33,"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":"Rewriting; RNA editing; String (physics); Computer science; RNA; Hierarchy; Expressive power; Programming language; Computational biology; Theoretical computer science; Biology; Genetics; Mathematics; Gene","score_opus":0.01282860748196446,"score_gpt":0.2558930196954486,"score_spread":0.24306441221348413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974556260","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.39431638,0.00095569657,0.5566744,0.0011051628,0.00025031492,0.000107096195,0.00029322103,0.00096655724,0.045331135],"genre_scores_gemma":[0.9547242,0.00031660934,0.03494444,0.00009421435,0.000046059777,0.000107130094,0.00009823265,0.00021917842,0.009449786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995809,0.00020062175,0.000012718208,0.00006865616,0.000075531934,0.000061506194],"domain_scores_gemma":[0.99857724,0.0010367854,0.00011790172,0.00009309981,0.000079239915,0.00009575284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007041338,0.0006879843,0.0009960425,0.00054486596,0.000626679,0.0015157141,0.0021786855,0.0031256522,0.0041867904],"category_scores_gemma":[0.0029007224,0.00064899086,0.0012267114,0.00062992395,0.0019039885,0.0011890637,0.0007868018,0.0011448751,0.000613295],"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.000047837682,0.000028659435,0.00011072598,0.000032601318,0.000010863712,0.00011845034,0.00004816637,0.9533588,0.0017590371,0.04261273,0.00022367008,0.0016484755],"study_design_scores_gemma":[0.000014219701,0.000010494914,0.000023372864,0.0000016083072,0.0000037299415,0.000016029548,0.00000623137,0.99072015,0.00028704476,0.008710416,0.00020106258,0.0000055714527],"about_ca_topic_score_codex":0.0050093858,"about_ca_topic_score_gemma":0.0026456018,"teacher_disagreement_score":0.0050093858,"about_ca_system_score_codex":0.0011933129,"about_ca_system_score_gemma":0.0008369101,"threshold_uncertainty_score":0.014006197},"labels":[],"label_agreement":null},{"id":"W1975186848","doi":"10.1016/s0304-3975(99)00184-x","title":"New applications of the incompressibility method: Part II","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum chaos and dynamical systems","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elegance; Mathematical proof; Simple (philosophy); Calculus (dental); Mathematics; Computer science; Algebra over a field; Pure mathematics; Philosophy; Epistemology; Geometry","score_opus":0.0059439218548182834,"score_gpt":0.2633709874255664,"score_spread":0.2574270655707481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975186848","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.045107476,0.053897027,0.74273074,0.0067083384,0.007360042,0.00012777338,0.0001573031,0.0005196102,0.14339167],"genre_scores_gemma":[0.50838757,0.046299726,0.3367831,0.0019605814,0.015647667,0.00043048649,0.0002857966,0.0009324909,0.08927253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992879,0.00023076971,0.0000402591,0.00013206231,0.0002388987,0.0000701848],"domain_scores_gemma":[0.9986545,0.00071855437,0.00010335653,0.00028462094,0.00013672042,0.00010227979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087778,0.0010780616,0.0010492752,0.0023860354,0.0009549537,0.0021142089,0.0016733492,0.0016773752,0.0069574444],"category_scores_gemma":[0.0038641323,0.0005908571,0.001132735,0.0013766511,0.0029803654,0.0051431963,0.0032224152,0.0025783917,0.0012297427],"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.000049317776,0.00006299609,0.00031818787,0.00034452364,0.000031393818,0.0001672442,0.0001463928,0.004056451,0.004031702,0.90678585,0.0063140625,0.07769192],"study_design_scores_gemma":[0.000017277105,0.000039480834,0.00040903292,0.00007313978,0.000014845693,0.00045954893,0.000042784046,0.045360498,0.0026700278,0.9071389,0.043734398,0.0000400347],"about_ca_topic_score_codex":0.0003172661,"about_ca_topic_score_gemma":0.00023420034,"teacher_disagreement_score":0.0069574444,"about_ca_system_score_codex":0.0005907977,"about_ca_system_score_gemma":0.00055151084,"threshold_uncertainty_score":0.023274958},"labels":[],"label_agreement":null},{"id":"W1975387410","doi":"10.1016/j.tcs.2003.09.012","title":"Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Game theory; Mathematical economics; Mathematics","score_opus":0.05169847140430342,"score_gpt":0.3529689354392122,"score_spread":0.30127046403490876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975387410","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.007909936,0.0077937115,0.092096515,0.08718584,0.027979027,0.0020444593,0.1145897,0.0016729316,0.6587278],"genre_scores_gemma":[0.116381265,0.010292084,0.08041077,0.012742948,0.01984431,0.0045546857,0.118368834,0.002183913,0.6352212],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99738616,0.0006717483,0.00022398849,0.00032162687,0.0011447138,0.0002516858],"domain_scores_gemma":[0.9759186,0.014546635,0.0009681876,0.0017981584,0.0052870777,0.0014812781],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00217002,0.0016208984,0.002195838,0.0029821908,0.0019027883,0.0031062313,0.002622462,0.003986259,0.3724834],"category_scores_gemma":[0.033472206,0.0008172289,0.0017233193,0.004865189,0.00081691984,0.0048786737,0.0022680536,0.003531801,0.13800806],"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.000076334814,0.00012623746,0.0002069975,0.00028256048,0.000014467254,0.000081805534,0.000041748997,0.00094663876,0.000122007456,0.033313192,0.94279003,0.021997992],"study_design_scores_gemma":[0.00024234089,0.00006971784,0.0029101367,0.000517533,0.00003552989,0.00033012795,0.00019895738,0.0030131855,0.00078290276,0.29505786,0.69676507,0.000076700155],"about_ca_topic_score_codex":0.003736561,"about_ca_topic_score_gemma":0.0033786045,"teacher_disagreement_score":0.3724834,"about_ca_system_score_codex":0.003326528,"about_ca_system_score_gemma":0.0032206576,"threshold_uncertainty_score":0.8950763},"labels":[],"label_agreement":null},{"id":"W1975531816","doi":"10.1016/j.tcs.2008.07.026","title":"Arbitrary pattern formation by asynchronous, anonymous, oblivious robots","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":224,"is_retracted":false,"has_abstract":false,"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":"Robot; Task (project management); Asynchronous communication; Set (abstract data type); Computer science; Mobile robot; Compass; Point (geometry); Artificial intelligence; Mathematics; Engineering; Geography; Geometry; Programming language","score_opus":0.011354233580310269,"score_gpt":0.22968399274611032,"score_spread":0.21832975916580005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975531816","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.20880981,0.000116498806,0.77938783,0.000470522,0.00007969046,0.00011600412,0.00009944763,0.000623357,0.01029684],"genre_scores_gemma":[0.9206671,0.00008738089,0.07088132,0.0000800151,0.00002542027,0.0001398035,0.00007945278,0.00007702561,0.007962399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990056,0.0003081476,0.000055791163,0.0002113711,0.00025640693,0.0001627301],"domain_scores_gemma":[0.9964223,0.0015275222,0.0005377168,0.0009343752,0.00026626428,0.00031182336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011569986,0.00037385587,0.0006703352,0.0004687843,0.00080780685,0.0009565131,0.0018279299,0.0009046169,0.0023095312],"category_scores_gemma":[0.006495263,0.0004439388,0.0005124789,0.0006595819,0.0014564721,0.0020051007,0.0024176892,0.00086173695,0.00047166483],"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.0010577441,0.00019403324,0.002547722,0.00020251003,0.000099882476,0.00046780903,0.00055504474,0.5667864,0.02004783,0.31660393,0.0035680623,0.087869115],"study_design_scores_gemma":[0.00011127653,0.00012639585,0.00034379066,0.0000090078,0.000022322687,0.00012661435,0.000088157874,0.827382,0.0052520875,0.16445686,0.0020635074,0.000017955079],"about_ca_topic_score_codex":0.00072322745,"about_ca_topic_score_gemma":0.00090881134,"teacher_disagreement_score":0.0023095312,"about_ca_system_score_codex":0.0004936854,"about_ca_system_score_gemma":0.00083132816,"threshold_uncertainty_score":0.007726133},"labels":[],"label_agreement":null},{"id":"W1975687894","doi":"10.1016/j.tcs.2012.11.024","title":"Generating bracelets with fixed content","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amortized analysis; Mathematics; Combinatorics; Constant (computer programming); Content (measure theory); Fixed point; Discrete mathematics; Computer science; Algorithm; Data structure; Programming language","score_opus":0.02246921449861843,"score_gpt":0.24451280825694888,"score_spread":0.22204359375833044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975687894","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.10464867,0.00031923817,0.864875,0.0005752349,0.0004273452,0.00031607866,0.0009270205,0.0033951986,0.024516212],"genre_scores_gemma":[0.5745846,0.00035987367,0.38468426,0.0004360302,0.00016866843,0.00046356782,0.0032239663,0.0022003476,0.033878755],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913484,0.00013906286,0.000047690486,0.00015528164,0.0003619601,0.00016123454],"domain_scores_gemma":[0.99713206,0.0013668773,0.00013395002,0.00081594486,0.0004301825,0.0001209758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005905379,0.00091440155,0.0010396463,0.0017110198,0.00078702485,0.0012938307,0.0017493266,0.0014290777,0.01519973],"category_scores_gemma":[0.005416353,0.0006701883,0.00072684383,0.0020437439,0.0011554438,0.0024796852,0.002620415,0.0015194756,0.0043430543],"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.0013155958,0.00040328168,0.001318501,0.0005746404,0.00009244433,0.0008594817,0.0004138346,0.095940635,0.03954856,0.36260307,0.03857047,0.45835948],"study_design_scores_gemma":[0.00029641917,0.00030774518,0.00041193774,0.000118651995,0.000062735206,0.0004732439,0.00023191774,0.52790785,0.040770896,0.40673304,0.022623524,0.000062021354],"about_ca_topic_score_codex":0.0006829258,"about_ca_topic_score_gemma":0.001099655,"teacher_disagreement_score":0.01519973,"about_ca_system_score_codex":0.0005827456,"about_ca_system_score_gemma":0.00062002655,"threshold_uncertainty_score":0.050848126},"labels":[],"label_agreement":null},{"id":"W1976525036","doi":"10.1016/j.tcs.2012.12.025","title":"Weak near-unanimity functions and digraph homomorphism problems","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Digraph; Unanimity; Homomorphism; Mathematics; Combinatorics; Conjecture; Algebraic number; Context (archaeology); Discrete mathematics; Constraint satisfaction problem; Measure (data warehouse); Computer science","score_opus":0.013713714101190025,"score_gpt":0.24758432885136222,"score_spread":0.2338706147501722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976525036","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.47372147,0.0028632733,0.45735523,0.008974731,0.00031041892,0.00010124027,0.0003855118,0.0004383942,0.055849653],"genre_scores_gemma":[0.9455189,0.0017860768,0.033285473,0.00086190103,0.0004219958,0.00019220401,0.00038889164,0.00011824994,0.017426226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983505,0.0006829217,0.00009392274,0.0003665615,0.00024411966,0.00026207702],"domain_scores_gemma":[0.9888521,0.008513639,0.0005514326,0.0007972978,0.00047424485,0.00081133767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003105254,0.00087964017,0.0015538416,0.0026512798,0.0039062835,0.0046098107,0.0023557823,0.0027141941,0.006271248],"category_scores_gemma":[0.013756313,0.0010401654,0.001356066,0.0034949088,0.005069292,0.018481705,0.004805988,0.0061414936,0.0006443752],"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.000059679667,0.000043466935,0.00026085682,0.000056312547,0.000010664848,0.000045555214,0.0003067162,0.0013580847,0.00025134755,0.98986316,0.0006841094,0.007060045],"study_design_scores_gemma":[0.000009025911,0.000006545657,0.0000480326,0.0000070360065,0.000006088668,0.00003316556,0.00006629245,0.0021640765,0.0001525143,0.99703825,0.0004638734,0.0000051480793],"about_ca_topic_score_codex":0.0008727554,"about_ca_topic_score_gemma":0.0007033491,"teacher_disagreement_score":0.006271248,"about_ca_system_score_codex":0.0021228883,"about_ca_system_score_gemma":0.0011198892,"threshold_uncertainty_score":0.020979404},"labels":[],"label_agreement":null},{"id":"W1976939532","doi":"10.1016/j.tcs.2015.03.042","title":"Finding median in read-only memory on integer input","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Integer (computer science); Logarithm; Algorithm; Binary number; Mathematics; Combinatorics; Selection (genetic algorithm); Simple (philosophy); Upper and lower bounds; Space (punctuation); Time complexity; Binary logarithm; Computer science; Discrete mathematics; Arithmetic; Artificial intelligence","score_opus":0.035885963671493847,"score_gpt":0.2864995203129722,"score_spread":0.2506135566414784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976939532","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.5410644,0.0037485473,0.3473351,0.006854683,0.0007032679,0.0005051153,0.011587332,0.026776543,0.061424978],"genre_scores_gemma":[0.7526166,0.0006072658,0.22286485,0.0009182982,0.00032292746,0.00028856075,0.005642498,0.0017385983,0.015000419],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787176,0.0003316622,0.00018294617,0.0007350682,0.00034044686,0.0005381515],"domain_scores_gemma":[0.99182546,0.0048853997,0.0006779347,0.0018620603,0.00047976404,0.00026928404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010471512,0.0018633566,0.002164569,0.0012605469,0.0013531762,0.0043148315,0.0025803912,0.0019496462,0.022736493],"category_scores_gemma":[0.008125463,0.0008355865,0.0011634573,0.0032860318,0.0009840572,0.010433318,0.0025193887,0.0017088368,0.005041535],"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.010061832,0.0012586974,0.010050272,0.002727758,0.00048500413,0.00086487056,0.0010181292,0.12164833,0.0588413,0.036679167,0.09280462,0.66356003],"study_design_scores_gemma":[0.0014335562,0.0011811139,0.003466579,0.0003456851,0.00050382584,0.000830727,0.001866932,0.51956457,0.09289171,0.357021,0.020733105,0.00016112473],"about_ca_topic_score_codex":0.0023273947,"about_ca_topic_score_gemma":0.006435861,"teacher_disagreement_score":0.022736493,"about_ca_system_score_codex":0.002070403,"about_ca_system_score_gemma":0.0034684087,"threshold_uncertainty_score":0.07606113},"labels":[],"label_agreement":null},{"id":"W1976985540","doi":"10.1016/j.tcs.2012.01.001","title":"Monoidal indeterminates and categories of possible worlds","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":16,"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":"Enriched category; Symmetric monoidal category; Mathematics; Functor; Closed monoidal category; Monoidal category; Higher category theory; Monad (category theory); Pure mathematics; Closed category; Algebra over a field","score_opus":0.012543163790986496,"score_gpt":0.24814296194040109,"score_spread":0.2355997981494146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976985540","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.20416118,0.020969065,0.59266114,0.010880546,0.000797405,0.00017493608,0.0016518566,0.00068088813,0.16802295],"genre_scores_gemma":[0.9329143,0.002984302,0.052688044,0.0005828323,0.0004934984,0.00013683674,0.0005371128,0.00009987978,0.009563117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952638,0.001974404,0.0005147364,0.000893343,0.0009651206,0.0003886012],"domain_scores_gemma":[0.99076396,0.005796069,0.0007030966,0.0013418124,0.00078349595,0.00061157614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046349443,0.0008339933,0.0012167738,0.004388883,0.0037701211,0.010313079,0.0024055075,0.002364208,0.0067292843],"category_scores_gemma":[0.011613136,0.0012653527,0.0018046853,0.00430966,0.010750315,0.023299303,0.005353545,0.0042939577,0.0007121351],"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.000008866603,0.000004229663,0.00013415824,0.00001951024,0.00000389482,0.000025333436,0.00023905573,0.00013885913,0.000049659906,0.997398,0.00021447259,0.0017639082],"study_design_scores_gemma":[0.000004931657,0.0000031189145,0.00007171048,0.00001082528,0.0000056211497,0.000043744487,0.000092337934,0.00040581485,0.000052350755,0.99702305,0.0022808732,0.000005630346],"about_ca_topic_score_codex":0.0020109678,"about_ca_topic_score_gemma":0.0018474347,"teacher_disagreement_score":0.010313079,"about_ca_system_score_codex":0.0023378993,"about_ca_system_score_gemma":0.0010674802,"threshold_uncertainty_score":0.024512231},"labels":[],"label_agreement":null},{"id":"W1977603728","doi":"10.1016/j.tcs.2008.04.034","title":"Memoryless search algorithms in a network with faulty advice","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Advice (programming); Node (physics); Shortest path problem; Computer science; Network topology; Graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Path (computing); Discrete mathematics; Mathematics; Randomized algorithm; Algorithm; Theoretical computer science; Computer network; Artificial intelligence","score_opus":0.01864963886820921,"score_gpt":0.2649793731140586,"score_spread":0.24632973424584942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977603728","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.4333864,0.0012227194,0.55168635,0.0044968743,0.00023320456,0.00011000151,0.00036717733,0.0018509177,0.006646406],"genre_scores_gemma":[0.89577353,0.00028933433,0.09632033,0.00029158275,0.00013149007,0.00009485664,0.0001508627,0.00016145263,0.00678668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984554,0.0004921557,0.000097366246,0.00032349795,0.00034245392,0.0002891546],"domain_scores_gemma":[0.96706665,0.025821049,0.0014673232,0.0030143603,0.001808548,0.0008220425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027933419,0.00075496413,0.0017158402,0.0016452185,0.0019155756,0.0022320345,0.003398106,0.0033259904,0.0030837727],"category_scores_gemma":[0.032289308,0.0008101314,0.00060386164,0.0015482891,0.002327602,0.0045038112,0.002439727,0.0026114874,0.00042528013],"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.0024871742,0.00022266858,0.0042113364,0.00031678326,0.00014893223,0.0006279,0.00072739867,0.76030535,0.0037256612,0.14371586,0.008159156,0.075351775],"study_design_scores_gemma":[0.00009698999,0.0000514149,0.00014000498,0.000014622855,0.0000313165,0.000063268555,0.000041877265,0.89470935,0.0012562048,0.10309635,0.00048918114,0.0000094277375],"about_ca_topic_score_codex":0.0055959057,"about_ca_topic_score_gemma":0.005580949,"teacher_disagreement_score":0.0055959057,"about_ca_system_score_codex":0.0018614802,"about_ca_system_score_gemma":0.0016891918,"threshold_uncertainty_score":0.014772773},"labels":[],"label_agreement":null},{"id":"W1977833242","doi":"10.1016/s0304-3975(01)00345-0","title":"On the non-termination of MDG-based abstract state enumeration","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enumeration; Formalism (music); Class (philosophy); Computer science; Mathematics; Theoretical computer science; Set (abstract data type); Algorithm; Discrete mathematics; Artificial intelligence; Programming language","score_opus":0.015227341185832211,"score_gpt":0.2818545029618386,"score_spread":0.2666271617760064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977833242","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.0717787,0.00047915414,0.91090274,0.0015544313,0.00011232709,0.00015292283,0.00010711796,0.0010636939,0.0138489995],"genre_scores_gemma":[0.8001617,0.0004600144,0.19036056,0.0004576877,0.00008332997,0.00039045862,0.00030211738,0.00044698472,0.0073371907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923626,0.003846774,0.00038115913,0.0005887588,0.0019625807,0.0008581251],"domain_scores_gemma":[0.92848897,0.060424708,0.0014349186,0.0059506195,0.0029238048,0.00077691197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009855806,0.00061940576,0.0017626254,0.0011847075,0.0013692525,0.002204948,0.0021063967,0.001837926,0.0044405204],"category_scores_gemma":[0.052861862,0.0006625758,0.0013472589,0.0011048906,0.004326185,0.00498988,0.005044208,0.0044121407,0.00059902866],"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.0009828476,0.00018166483,0.0027597272,0.00030918856,0.00007987351,0.00030267125,0.0008114426,0.21521874,0.005610898,0.6788709,0.0023869798,0.092485085],"study_design_scores_gemma":[0.00006741264,0.0000833312,0.00021781334,0.00004768525,0.00003151024,0.000053575433,0.000050399827,0.61771315,0.0028050698,0.3775956,0.0013196566,0.000014824858],"about_ca_topic_score_codex":0.002157073,"about_ca_topic_score_gemma":0.0023985272,"teacher_disagreement_score":0.009855806,"about_ca_system_score_codex":0.0015186794,"about_ca_system_score_gemma":0.0025553133,"threshold_uncertainty_score":0.05212313},"labels":[],"label_agreement":null},{"id":"W1977986119","doi":"10.1016/j.tcs.2007.07.041","title":"Optimal lower bounds for rank and select indexes","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Eidgenössische Technische Hochschule Zürich","keywords":"Rank (graph theory); Data structure; Upper and lower bounds; Computer science; Word (group theory); Combinatorics; Binary logarithm; Space (punctuation); Index (typography); Order (exchange); Algorithm; Mathematics; Discrete mathematics","score_opus":0.007316668029087797,"score_gpt":0.2601985053427479,"score_spread":0.2528818373136601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977986119","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.032021616,0.018362364,0.87545013,0.009395971,0.0010744487,0.00042515557,0.0034887183,0.0033022393,0.056479283],"genre_scores_gemma":[0.39988336,0.014745601,0.5270165,0.0035953883,0.0053080632,0.0017707165,0.0057595046,0.0035545041,0.03836636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97543997,0.0064198687,0.0011446294,0.0020927028,0.010584428,0.0043184236],"domain_scores_gemma":[0.89107674,0.0842495,0.0037037286,0.011787602,0.0062861596,0.002896284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016314158,0.006812792,0.0072968034,0.0108717345,0.0039616437,0.018260175,0.0090005025,0.006094439,0.025740823],"category_scores_gemma":[0.1021297,0.0030714471,0.0025464115,0.013822645,0.006767613,0.022953432,0.011350997,0.010811603,0.0077690408],"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.0027058537,0.00074094476,0.001755313,0.001510445,0.00025358004,0.00019100124,0.00069868483,0.14268738,0.0059253965,0.5695769,0.04872957,0.22522497],"study_design_scores_gemma":[0.00024190672,0.00031841735,0.0007097223,0.00032014123,0.00021292511,0.00036761348,0.00029953223,0.37233904,0.006349754,0.60647535,0.012245378,0.00012017523],"about_ca_topic_score_codex":0.0022940212,"about_ca_topic_score_gemma":0.0052439906,"teacher_disagreement_score":0.025740823,"about_ca_system_score_codex":0.009002999,"about_ca_system_score_gemma":0.00962744,"threshold_uncertainty_score":0.08627856},"labels":[],"label_agreement":null},{"id":"W1978012637","doi":"10.1016/s0304-3975(00)00081-5","title":"Multi-cut αβ-pruning in game-tree search","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Tree (set theory); Search tree; Computer science; Mathematics; Artificial intelligence; Algorithm; Theoretical computer science; Machine learning; Combinatorics; Search algorithm; Horticulture","score_opus":0.04424988244330528,"score_gpt":0.32716459449050206,"score_spread":0.28291471204719676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978012637","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.07988883,0.0009430322,0.90242803,0.00067496643,0.00013769821,0.0003140239,0.00019002949,0.00057409995,0.014849348],"genre_scores_gemma":[0.43329367,0.0003181715,0.555346,0.00038126766,0.000074074334,0.0003119009,0.0005161927,0.00022052131,0.009538103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978307,0.0010938585,0.000107080785,0.00020962721,0.0004993451,0.0002594373],"domain_scores_gemma":[0.9932214,0.005259153,0.00022831226,0.00048976997,0.00053051906,0.0002708151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003428524,0.0006147739,0.0017842437,0.0019263267,0.0011733074,0.0014720802,0.002725917,0.0022331157,0.005823625],"category_scores_gemma":[0.015442397,0.0007761114,0.000912013,0.0017190875,0.001299594,0.0024718517,0.0021677755,0.002347957,0.0006911887],"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.00073216885,0.00050678116,0.0036144347,0.00041486695,0.00015007141,0.00027008305,0.0005385397,0.4465395,0.0020490834,0.22070323,0.01198289,0.31249836],"study_design_scores_gemma":[0.00006761316,0.0000912042,0.0003645153,0.000059584523,0.00005285849,0.00009143264,0.00006263885,0.8874922,0.00067927106,0.10873112,0.0022960932,0.00001150949],"about_ca_topic_score_codex":0.004544347,"about_ca_topic_score_gemma":0.0074226726,"teacher_disagreement_score":0.005823625,"about_ca_system_score_codex":0.0011979726,"about_ca_system_score_gemma":0.0014654708,"threshold_uncertainty_score":0.019481897},"labels":[],"label_agreement":null},{"id":"W1978312982","doi":"10.1016/j.tcs.2003.08.013","title":"Periodicity and arithmetic-periodicity in hexadecimal games","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Arithmetic; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.01535544461742095,"score_gpt":0.26707115867993225,"score_spread":0.2517157140625113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978312982","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.53979474,0.00080247317,0.30636135,0.0023830694,0.00064334716,0.00015563983,0.00034384793,0.00029587816,0.14921969],"genre_scores_gemma":[0.9640601,0.0002616501,0.023776373,0.00022998809,0.00014897827,0.00010499049,0.00014536711,0.000044061002,0.011228566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989505,0.00035232885,0.00009600592,0.000181932,0.00020416827,0.00021513834],"domain_scores_gemma":[0.99716717,0.001641233,0.00034766097,0.0002934671,0.0002630023,0.00028743353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011402989,0.00041124213,0.00077207194,0.00080215896,0.0014692359,0.0023272487,0.00075281423,0.0008007205,0.005358661],"category_scores_gemma":[0.006099325,0.0003013343,0.00079214154,0.00091498025,0.0032866956,0.004214347,0.0013638729,0.0018554025,0.00047922778],"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.00006642621,0.000014967631,0.00015840653,0.00002066268,0.000003989007,0.000054231532,0.00018964185,0.0011914098,0.0003622742,0.993491,0.0004451275,0.0040018423],"study_design_scores_gemma":[0.000018960927,0.000015706275,0.000101828744,0.0000048623483,0.000003344869,0.00003370912,0.0000572725,0.0042698337,0.00018432668,0.9945511,0.0007522823,0.00000687387],"about_ca_topic_score_codex":0.0009959841,"about_ca_topic_score_gemma":0.0009770017,"teacher_disagreement_score":0.005358661,"about_ca_system_score_codex":0.0009358115,"about_ca_system_score_gemma":0.0010967896,"threshold_uncertainty_score":0.017926514},"labels":[],"label_agreement":null},{"id":"W1978562199","doi":"10.1016/j.tcs.2007.10.003","title":"Change of order for regular chains in positive dimension","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":29,"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":"Dimension (graph theory); Mathematics; Modular design; Subroutine; Algebraic number; Variable (mathematics); Order (exchange); Zero (linguistics); Chain (unit); Computation; Symbolic computation; Algebra over a field; Applied mathematics; Pure mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.013504122682615272,"score_gpt":0.26307325647754887,"score_spread":0.2495691337949336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978562199","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.8524874,0.0003987847,0.08692396,0.0016480333,0.00050998776,0.000087813416,0.00039403894,0.0006101351,0.0569399],"genre_scores_gemma":[0.96454996,0.00028519856,0.013181275,0.000322273,0.00030887383,0.000059450318,0.00032521348,0.00029777506,0.020669993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990683,0.0001272501,0.00004240386,0.00020656858,0.00026626955,0.00028923718],"domain_scores_gemma":[0.99372804,0.0023661165,0.0007780131,0.00092940446,0.0006774238,0.0015209031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013116815,0.0004547726,0.0009600167,0.0031762333,0.003225724,0.0035297796,0.0011079373,0.0013516054,0.009001744],"category_scores_gemma":[0.0061493567,0.00047137897,0.0009192344,0.0013442233,0.0051336433,0.006370506,0.0019612405,0.0029396873,0.0007601311],"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.0001118529,0.000037964324,0.00047316763,0.00002131121,0.00000414607,0.00009783731,0.0003665089,0.00065713,0.001226374,0.993032,0.000769013,0.0032027147],"study_design_scores_gemma":[0.000022295077,0.000022713375,0.00034130146,0.0000072171215,0.000005770422,0.00009239739,0.00012269463,0.0030592852,0.0007008526,0.9940078,0.0016020981,0.000015477555],"about_ca_topic_score_codex":0.0020255542,"about_ca_topic_score_gemma":0.0024586057,"teacher_disagreement_score":0.009001744,"about_ca_system_score_codex":0.0021127427,"about_ca_system_score_gemma":0.0008465233,"threshold_uncertainty_score":0.030113816},"labels":[],"label_agreement":null},{"id":"W1978592724","doi":"10.1016/s0304-3975(02)00574-1","title":"Weak repetitions in Sturmian strings","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; String (physics); Quadratic equation; Combinatorics; Encoding (memory); Discrete mathematics; Algorithm; Computer science","score_opus":0.007899106622770134,"score_gpt":0.23426777702779686,"score_spread":0.22636867040502673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978592724","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.71463454,0.00095557683,0.21828894,0.0016129188,0.00042862713,0.000074333184,0.0002459953,0.0011540083,0.06260512],"genre_scores_gemma":[0.96302396,0.00021799548,0.019784225,0.00032467974,0.00030057106,0.00009702307,0.0001666303,0.00018711801,0.015897853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809545,0.00066131103,0.0001731619,0.00032900774,0.00049354363,0.00024756795],"domain_scores_gemma":[0.9920324,0.0056753834,0.000529895,0.0008230995,0.0005520735,0.0003871183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018739741,0.000568513,0.0010485706,0.0020410176,0.0025477489,0.0029711158,0.0010833034,0.0020088062,0.0067561283],"category_scores_gemma":[0.00875916,0.0008817649,0.0010933751,0.0017638474,0.0036436026,0.006115638,0.002472596,0.0024472508,0.001306865],"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.00009440097,0.000019753448,0.0004038184,0.000057028257,0.000009190054,0.00028434512,0.000855231,0.00073052855,0.002747047,0.98806274,0.0005540296,0.006181835],"study_design_scores_gemma":[0.00001967334,0.00004010132,0.00024122828,0.000016623684,0.000016249749,0.00026820158,0.00012384538,0.0038116078,0.0017742036,0.9920935,0.001575049,0.000019753203],"about_ca_topic_score_codex":0.00029227426,"about_ca_topic_score_gemma":0.00039003755,"teacher_disagreement_score":0.0067561283,"about_ca_system_score_codex":0.00075691094,"about_ca_system_score_gemma":0.00042903973,"threshold_uncertainty_score":0.022601485},"labels":[],"label_agreement":null},{"id":"W1978707564","doi":"10.1016/j.tcs.2012.04.011","title":"Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Suffix; Prefix; Regular language; Cardinality (data modeling); Mathematics; Combinatorics; Discrete mathematics; Conjecture; Upper and lower bounds; Computer science; Linguistics; Artificial intelligence; Automaton","score_opus":0.020163731806501314,"score_gpt":0.2615775143125849,"score_spread":0.24141378250608359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978707564","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.94087607,0.00039152088,0.038503245,0.0018417687,0.000033472894,0.00003379271,0.0008094703,0.000310158,0.017200572],"genre_scores_gemma":[0.9916865,0.00014396376,0.005039089,0.00010089875,0.00006714028,0.00003506028,0.00067520415,0.00008533491,0.002166667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778855,0.00045674652,0.00019013771,0.00035823652,0.0007665035,0.00043981054],"domain_scores_gemma":[0.98032206,0.015509022,0.0012420375,0.0010158095,0.0012125394,0.00069846393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001717566,0.00037719807,0.001100134,0.00168082,0.0019440859,0.005394017,0.0017070506,0.0014398127,0.008089474],"category_scores_gemma":[0.010783702,0.0006556845,0.0013588914,0.0017865602,0.0030693598,0.010041627,0.0018997497,0.0022409149,0.0005443663],"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.00061506574,0.00015844249,0.006446753,0.00021474097,0.000056614033,0.0004996891,0.0021846825,0.019462937,0.0059473305,0.9465096,0.002444142,0.015460025],"study_design_scores_gemma":[0.000044826607,0.000034734323,0.0016951099,0.000015691458,0.000042745673,0.00021295644,0.00034067425,0.040860012,0.0021238613,0.95356363,0.0010218119,0.000044011053],"about_ca_topic_score_codex":0.002276805,"about_ca_topic_score_gemma":0.0021062384,"teacher_disagreement_score":0.008089474,"about_ca_system_score_codex":0.002218106,"about_ca_system_score_gemma":0.0016307265,"threshold_uncertainty_score":0.027061999},"labels":[],"label_agreement":null},{"id":"W1979205601","doi":"10.1016/s0304-3975(00)00365-0","title":"Approximate periods of strings","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Variety (cybernetics); Mathematics; Time complexity; Algorithm; Data compression; Computer science; Theoretical computer science; Combinatorics; Discrete mathematics; Artificial intelligence","score_opus":0.009637200902656283,"score_gpt":0.2481852492509679,"score_spread":0.23854804834831161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979205601","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.285337,0.0025701174,0.66798633,0.001104558,0.00048560873,0.00010554679,0.0010108179,0.0013147998,0.040085126],"genre_scores_gemma":[0.8729491,0.0014440761,0.105108485,0.00031301327,0.00050039706,0.0001523917,0.0013529275,0.0005557102,0.017623877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895895,0.0002883848,0.00006159197,0.00021914652,0.00032713107,0.00014479949],"domain_scores_gemma":[0.99625313,0.0019257086,0.0003412552,0.0010874294,0.00022557355,0.0001669992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078808115,0.0005951392,0.00077159464,0.001961459,0.00059103285,0.0022397488,0.0010461435,0.0010308017,0.008417848],"category_scores_gemma":[0.009688893,0.0005291407,0.00052454456,0.0022979719,0.0011076697,0.0045959987,0.0019842007,0.0016125467,0.0016330804],"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.0010862221,0.00010815401,0.0027313286,0.0002738206,0.00006837835,0.00026260642,0.0004888051,0.06303256,0.011474495,0.67422986,0.01156771,0.23467606],"study_design_scores_gemma":[0.000052862506,0.00011191332,0.0010180786,0.000051358442,0.000036017685,0.00036220293,0.00017821573,0.2764552,0.0054251514,0.7043688,0.011917414,0.000022765971],"about_ca_topic_score_codex":0.00034960435,"about_ca_topic_score_gemma":0.0003693547,"teacher_disagreement_score":0.008417848,"about_ca_system_score_codex":0.00090789306,"about_ca_system_score_gemma":0.00036818438,"threshold_uncertainty_score":0.028160512},"labels":[],"label_agreement":null},{"id":"W1979358057","doi":"10.1016/j.tcs.2008.06.009","title":"Rich, Sturmian, and trapezoidal words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics","score_opus":0.010044828997486724,"score_gpt":0.2248701033556216,"score_spread":0.21482527435813487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979358057","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.51443845,0.0047538313,0.26638463,0.0039401255,0.0005888283,0.000088635396,0.00063358364,0.0006583947,0.2085135],"genre_scores_gemma":[0.9524329,0.00058897276,0.023955993,0.000330423,0.00014275363,0.000055612578,0.00020970563,0.0000739646,0.022209639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952745,0.00013319057,0.000038721537,0.00010859559,0.00010407306,0.00008806247],"domain_scores_gemma":[0.9984144,0.00078893173,0.00014990775,0.00024049933,0.0002705882,0.00013565889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008416878,0.00034119238,0.0006373388,0.0014790398,0.0018930555,0.0020730884,0.00049864856,0.0007945547,0.008960636],"category_scores_gemma":[0.004007076,0.0003075014,0.0006538573,0.0012241296,0.0031207323,0.004036563,0.0013902693,0.0010982413,0.0010392601],"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.000023808947,0.000002788898,0.00008781702,0.0000134083675,0.0000022769052,0.00003615246,0.00019329651,0.00027201086,0.00030106358,0.99594903,0.00057077286,0.00254749],"study_design_scores_gemma":[0.0000063007983,0.000008993771,0.00007700006,0.0000069263197,0.0000054680822,0.00007743794,0.00011268228,0.0014742409,0.00019984948,0.9951427,0.0028810538,0.000007237161],"about_ca_topic_score_codex":0.0012473988,"about_ca_topic_score_gemma":0.0014779043,"teacher_disagreement_score":0.008960636,"about_ca_system_score_codex":0.00088354707,"about_ca_system_score_gemma":0.0005187495,"threshold_uncertainty_score":0.029976308},"labels":[],"label_agreement":null},{"id":"W1979524717","doi":"10.1016/j.tcs.2003.10.019","title":"Realizability models for BLL-like languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Realizability; Programming language; Syntax; Linear logic; Computer science; Algebra over a field; Bounded function; Theoretical computer science; Discrete mathematics; Calculus (dental); Mathematics; Pure mathematics; Artificial intelligence","score_opus":0.02178323658350501,"score_gpt":0.2772463831187192,"score_spread":0.2554631465352142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979524717","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.07719446,0.0006090835,0.8468116,0.003707201,0.00018779899,0.00017070795,0.0018001033,0.0026924089,0.0668266],"genre_scores_gemma":[0.8572105,0.00047971623,0.118666016,0.0006872925,0.00024230168,0.0002853874,0.0024000455,0.0005901054,0.019438654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982097,0.00050403684,0.00018628531,0.00031718495,0.0004480633,0.00033479815],"domain_scores_gemma":[0.99548435,0.002281651,0.00058973423,0.0006995451,0.0005836925,0.00036104678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020184068,0.0008084283,0.00065447635,0.0015176971,0.002170428,0.007137492,0.0025806967,0.0021560192,0.014815842],"category_scores_gemma":[0.005542161,0.0011113785,0.0021363501,0.0015571225,0.0033005176,0.012579546,0.002825324,0.0046833516,0.0019841215],"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.000031960113,0.000031882366,0.0002095355,0.00003987839,0.0000061785267,0.00006707351,0.0002964108,0.002169757,0.00053695135,0.9929402,0.00086169987,0.0028083948],"study_design_scores_gemma":[0.00002039555,0.000007167613,0.00005617306,0.0000144218275,0.000008796679,0.000038060974,0.000104629704,0.010762341,0.00048792787,0.9858343,0.0026539173,0.00001191366],"about_ca_topic_score_codex":0.0031745804,"about_ca_topic_score_gemma":0.0045452593,"teacher_disagreement_score":0.014815842,"about_ca_system_score_codex":0.0038220738,"about_ca_system_score_gemma":0.0013129583,"threshold_uncertainty_score":0.049563885},"labels":[],"label_agreement":null},{"id":"W1979831715","doi":"10.1016/j.tcs.2005.02.004","title":"Computing unsatisfiable<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-SAT instances with few occurrences per variable","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; Mathematics; Function (biology); Combinatorics; Variable (mathematics); Discrete mathematics; Exponential function; Exponential time hypothesis; Time complexity; Mathematical analysis","score_opus":0.011480185867683814,"score_gpt":0.2327873710725958,"score_spread":0.221307185204912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979831715","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.47768784,0.0012885797,0.44872278,0.0040610447,0.00029522914,0.00041872676,0.020393506,0.0070776115,0.04005467],"genre_scores_gemma":[0.6097418,0.0004261039,0.33800554,0.0005007643,0.00017491022,0.00016139582,0.037985727,0.0014090525,0.011594636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987018,0.00033499452,0.00009804625,0.00038014774,0.00025040135,0.00023457529],"domain_scores_gemma":[0.9907222,0.0074867867,0.0003446793,0.0005678643,0.00061237445,0.0002661666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012465157,0.0011600975,0.0010274452,0.0015009107,0.0011348315,0.0028166827,0.0024739571,0.0018853659,0.030571435],"category_scores_gemma":[0.013156209,0.0008065627,0.001354937,0.0026599106,0.00091674906,0.003961013,0.0013587995,0.0018477663,0.0029237056],"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.0023871108,0.0009841317,0.01442115,0.00291465,0.00046046768,0.0012686086,0.00052053295,0.46478057,0.009112928,0.12129791,0.08904548,0.2928064],"study_design_scores_gemma":[0.00027773596,0.00017902438,0.0026523888,0.00007478798,0.00010226889,0.00027412642,0.0004456165,0.82764614,0.007558046,0.15454683,0.006208852,0.000034244127],"about_ca_topic_score_codex":0.0066242856,"about_ca_topic_score_gemma":0.017611805,"teacher_disagreement_score":0.030571435,"about_ca_system_score_codex":0.0014280989,"about_ca_system_score_gemma":0.0020093208,"threshold_uncertainty_score":0.10227162},"labels":[],"label_agreement":null},{"id":"W1980155648","doi":"10.1016/j.tcs.2004.07.031","title":"Optimal graph exploration without good maps","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":66,"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 en Outaouais","funders":"","keywords":"Graph; Computer science; Mathematics; Theoretical computer science","score_opus":0.018372535556696407,"score_gpt":0.2655600713819139,"score_spread":0.2471875358252175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980155648","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.27043986,0.002718221,0.67383534,0.0034280866,0.00026401674,0.00017772235,0.00068812806,0.0021640733,0.046284545],"genre_scores_gemma":[0.8183689,0.00064363825,0.167105,0.00035076315,0.00007684183,0.00017183356,0.00035962462,0.00038944161,0.012533957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993705,0.0002989564,0.00002002923,0.000115475035,0.00010360221,0.000091367954],"domain_scores_gemma":[0.9962872,0.002833652,0.00011193226,0.00048076984,0.00012540196,0.00016102222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007855304,0.0008761737,0.0014357748,0.0011085522,0.0009116104,0.0013571377,0.001106535,0.0019234867,0.007158639],"category_scores_gemma":[0.008353266,0.0008537308,0.00092971924,0.0011877521,0.0013230634,0.0043126806,0.002896153,0.0017545994,0.00068403385],"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.001419179,0.0002370657,0.0012680008,0.000714373,0.00016074565,0.0002441759,0.00045563388,0.5891887,0.005097709,0.25709802,0.016396588,0.12771975],"study_design_scores_gemma":[0.00011075407,0.00010264835,0.00029308337,0.000043914442,0.000049059297,0.00010128551,0.00009332078,0.63634396,0.001638354,0.35817206,0.0030349323,0.000016655616],"about_ca_topic_score_codex":0.0017121377,"about_ca_topic_score_gemma":0.0023949607,"teacher_disagreement_score":0.007158639,"about_ca_system_score_codex":0.0007378873,"about_ca_system_score_gemma":0.000985596,"threshold_uncertainty_score":0.023948014},"labels":[],"label_agreement":null},{"id":"W1980595063","doi":"10.1016/j.tcs.2010.07.003","title":"Cops and Robbers from a distance","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Upper and lower bounds; Graph; Zigzag; Function (biology); Discrete mathematics; Geometry","score_opus":0.0074750399545815875,"score_gpt":0.26657268459215955,"score_spread":0.25909764463757795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980595063","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.3048199,0.002099139,0.48431394,0.006329482,0.00067455706,0.00016163837,0.0005620087,0.0005786202,0.20046076],"genre_scores_gemma":[0.81604975,0.0011582979,0.075135745,0.00085890014,0.0006153727,0.00024543097,0.00060948456,0.0005221385,0.104804866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980902,0.0004528922,0.00008817089,0.00046134513,0.00057667674,0.00033062114],"domain_scores_gemma":[0.99616677,0.0019329665,0.00032846123,0.0005576625,0.0004407575,0.0005732893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083212304,0.0010358365,0.0020871577,0.0029087851,0.0036834371,0.0038166384,0.0023955568,0.0028709238,0.021015998],"category_scores_gemma":[0.008977373,0.0010100405,0.0014745375,0.002296373,0.0048209904,0.008156121,0.0064912857,0.004158107,0.0026594554],"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.000049966464,0.000020029624,0.00017799187,0.00006508669,0.000018501527,0.00012196297,0.00040281905,0.002793613,0.00044889204,0.98508644,0.0029260288,0.007888683],"study_design_scores_gemma":[0.00001363974,0.000019273786,0.00017316097,0.000017949424,0.0000112237785,0.00013467448,0.00016555942,0.0073577687,0.00025474216,0.98577166,0.006068525,0.0000119168235],"about_ca_topic_score_codex":0.0017579969,"about_ca_topic_score_gemma":0.0014316174,"teacher_disagreement_score":0.021015998,"about_ca_system_score_codex":0.0010686961,"about_ca_system_score_gemma":0.000605006,"threshold_uncertainty_score":0.070305526},"labels":[],"label_agreement":null},{"id":"W1980615207","doi":"10.1016/j.tcs.2008.09.018","title":"Gravitational wave signal templates, pattern recognition, and reciprocal Eulerian gamma functions","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Pulsars and Gravitational Waves Research","field":"Physics and Astronomy","cited_by":3,"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":"LIGO; Gravitational wave; Eulerian path; Noise (video); SIGNAL (programming language); Physics; Computer science; Algorithm; Computation; Detector; Astrophysics; Optics; Theoretical physics; Artificial intelligence","score_opus":0.03050457431170279,"score_gpt":0.2845907923559332,"score_spread":0.2540862180442304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980615207","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.04527256,0.0014756097,0.9478018,0.0002962266,0.00009168221,0.000025110987,0.00017364112,0.00050816254,0.0043551684],"genre_scores_gemma":[0.6694704,0.0032517335,0.31395277,0.0002552361,0.0003222025,0.00009779988,0.0010947497,0.00021643683,0.011338625],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996458,0.000073909294,0.000027403094,0.000114590475,0.00009892817,0.000039323782],"domain_scores_gemma":[0.9982753,0.00074412033,0.00029644472,0.0003808808,0.00022337081,0.00007990062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006299231,0.0004846545,0.0004891945,0.0013912527,0.00024997193,0.002037048,0.0008380238,0.0009804603,0.0023799627],"category_scores_gemma":[0.006545073,0.00032005375,0.00039268305,0.0017324713,0.0010021094,0.0028362493,0.00070911774,0.0007903306,0.0015046312],"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.0003679583,0.00006911065,0.0036065795,0.00016340753,0.00004627562,0.00023946026,0.00015833153,0.074218385,0.02415572,0.39973766,0.0033250204,0.4939121],"study_design_scores_gemma":[0.0000363731,0.00007347422,0.0022739947,0.000059934064,0.000037545717,0.00079858606,0.00007072641,0.5660921,0.0137818875,0.41088957,0.0058366023,0.00004919174],"about_ca_topic_score_codex":0.0009024178,"about_ca_topic_score_gemma":0.0006171074,"teacher_disagreement_score":0.0023799627,"about_ca_system_score_codex":0.00038185573,"about_ca_system_score_gemma":0.00041968972,"threshold_uncertainty_score":0.00796175},"labels":[],"label_agreement":null},{"id":"W1981314990","doi":"10.1016/s0304-3975(00)00197-3","title":"Loop checks for logic programs with functions","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Key (lock); Computer science; Loop (graph theory); Series (stratigraphy); Arithmetic; Algorithm; Theoretical computer science; Programming language; Mathematics; Operating system; Combinatorics","score_opus":0.026606039594996866,"score_gpt":0.25761974298176854,"score_spread":0.23101370338677168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981314990","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.25354806,0.0010951704,0.7159139,0.0017296323,0.0003510595,0.00028868142,0.0010381569,0.011937217,0.014098174],"genre_scores_gemma":[0.8988279,0.00030621566,0.09202756,0.00048525614,0.00025467985,0.000116506795,0.00072420784,0.000912923,0.0063448003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995598,0.0013020112,0.00032515422,0.00070638896,0.001310214,0.0007582883],"domain_scores_gemma":[0.9587892,0.032001395,0.0025616852,0.0036042582,0.0023336068,0.00070976146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050197896,0.0008398955,0.0011932219,0.0026195904,0.0021347578,0.0047084256,0.0024671273,0.002156324,0.0062866453],"category_scores_gemma":[0.03610743,0.00083642657,0.0017908256,0.0019488577,0.0044786474,0.009678499,0.0029992354,0.0027031281,0.00086685154],"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.0026849175,0.00035785843,0.012113089,0.00089715153,0.00020817468,0.0006776895,0.0012969861,0.02249121,0.011114658,0.7756727,0.01659073,0.15589492],"study_design_scores_gemma":[0.00016402468,0.00012262582,0.0010456273,0.00012009333,0.00017819046,0.00023490006,0.00016119429,0.070277475,0.0152408285,0.9070848,0.0052752206,0.000095086674],"about_ca_topic_score_codex":0.0017447767,"about_ca_topic_score_gemma":0.002016978,"teacher_disagreement_score":0.0062866453,"about_ca_system_score_codex":0.0022012168,"about_ca_system_score_gemma":0.0018907866,"threshold_uncertainty_score":0.026547492},"labels":[],"label_agreement":null},{"id":"W1981403153","doi":"10.1016/j.tcs.2008.02.021","title":"Learning recursive functions: A survey","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Learnability; Randomness; Algorithmic learning theory; Computer science; Set (abstract data type); Limit (mathematics); Focus (optics); Function (biology); Field (mathematics); Artificial intelligence; Mathematics; Theoretical computer science; Active learning (machine learning); Pure mathematics; Statistics","score_opus":0.014483351408562984,"score_gpt":0.2498447219833575,"score_spread":0.2353613705747945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981403153","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008431903,0.4651053,0.51041347,0.0022224567,0.0003831068,0.00007957675,0.00020795809,0.0006757956,0.012480432],"genre_scores_gemma":[0.1278394,0.57236385,0.28446597,0.0014702609,0.0035469327,0.00021026918,0.0012715302,0.0003873828,0.00844442],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982235,0.00044246326,0.00017684474,0.0005541833,0.0004986437,0.000104476705],"domain_scores_gemma":[0.9920294,0.0059601474,0.0001865425,0.0008623072,0.0008411069,0.00012058743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003943026,0.0011945689,0.0025897436,0.0025919606,0.0007620528,0.0031026716,0.0023976066,0.0019563735,0.003591375],"category_scores_gemma":[0.010824477,0.0010670801,0.0011879151,0.00487794,0.0013466259,0.007674208,0.0020207365,0.0027382828,0.0026679833],"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.000056275476,0.00014289925,0.0029733225,0.0015561876,0.000079684825,0.00004174384,0.00017210675,0.0070454394,0.00071514625,0.06641752,0.007431623,0.91336817],"study_design_scores_gemma":[0.000079203775,0.0005243714,0.00648793,0.0018011263,0.00033573376,0.0017360101,0.00046267602,0.15434675,0.0068258033,0.4323143,0.3949212,0.00016484264],"about_ca_topic_score_codex":0.0016237498,"about_ca_topic_score_gemma":0.0014875443,"teacher_disagreement_score":0.003943026,"about_ca_system_score_codex":0.00096998713,"about_ca_system_score_gemma":0.0014545082,"threshold_uncertainty_score":0.020852983},"labels":[],"label_agreement":null},{"id":"W1981629634","doi":"10.1016/s0304-3975(02)00073-7","title":"Deterministic broadcasting time with partial knowledge of the network","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Computer network; Theoretical computer science","score_opus":0.008588091882672011,"score_gpt":0.22306216494164066,"score_spread":0.21447407305896865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981629634","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.28050518,0.0018688206,0.68515927,0.008970541,0.00023449084,0.00021633829,0.0020218568,0.0015531575,0.019470366],"genre_scores_gemma":[0.9528305,0.0006586073,0.035559043,0.000490987,0.0002663313,0.00020048906,0.0006367225,0.0002400563,0.009117346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586475,0.0012446082,0.00020943978,0.0010431177,0.00078267115,0.00085542095],"domain_scores_gemma":[0.9098694,0.07747782,0.0033456548,0.0051144087,0.0019007724,0.0022920074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057279463,0.0011255436,0.0030165883,0.0016508091,0.0019568624,0.004589165,0.0048243543,0.0045644757,0.008420881],"category_scores_gemma":[0.04624277,0.002317298,0.0012403694,0.00267391,0.004040128,0.009814292,0.0039709248,0.0038866708,0.0007428094],"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.0027449473,0.00016287495,0.0022001178,0.0007065896,0.00022923829,0.0004186916,0.000648601,0.5636168,0.0039044332,0.3893537,0.0077066887,0.028307192],"study_design_scores_gemma":[0.00026686047,0.00008196299,0.0004482274,0.000033279946,0.00008498608,0.00014805039,0.00005494486,0.73687786,0.0012801908,0.2598063,0.00087012333,0.000047198417],"about_ca_topic_score_codex":0.005471625,"about_ca_topic_score_gemma":0.0054565514,"teacher_disagreement_score":0.008420881,"about_ca_system_score_codex":0.004783746,"about_ca_system_score_gemma":0.0042149816,"threshold_uncertainty_score":0.03470868},"labels":[],"label_agreement":null},{"id":"W1981776739","doi":"10.1016/j.tcs.2005.10.032","title":"Syntactic control of concurrency","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Finitary; Concurrency; Decidability; Undecidable problem; Observational equivalence; Game semantics; Computer science; Equivalence (formal languages); Recursion (computer science); Mathematics; Semaphore; Programming language; Discrete mathematics; Semantics (computer science); Operational semantics; Theoretical computer science; Denotational semantics","score_opus":0.011667922731239233,"score_gpt":0.2516900121329037,"score_spread":0.24002208940166447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981776739","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.08702204,0.0024179784,0.7342356,0.009323453,0.001074407,0.00008470266,0.0004963793,0.0029921602,0.16235334],"genre_scores_gemma":[0.9296958,0.0008349581,0.051612806,0.0008292643,0.000802473,0.00012531364,0.00031963852,0.00090664445,0.014873107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947802,0.0018645253,0.00034679633,0.0008566405,0.0015377222,0.0006142146],"domain_scores_gemma":[0.987542,0.006408294,0.0006936661,0.003420494,0.0015333765,0.00040223423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044558593,0.00066144054,0.0010507961,0.001830224,0.0038042373,0.009466351,0.0023713196,0.0018167201,0.00910835],"category_scores_gemma":[0.014717241,0.0011439262,0.0015174695,0.0017550765,0.009333021,0.017439313,0.005490847,0.005742093,0.0013506815],"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.000016153734,0.000009334978,0.00011443854,0.000014604444,0.0000036636502,0.00001856491,0.00022476818,0.00028672005,0.00031348012,0.99563533,0.0006509592,0.0027119978],"study_design_scores_gemma":[0.000013292174,0.0000057612037,0.00007121893,0.000015059809,0.000015926471,0.000039267263,0.000059238617,0.0033947339,0.0010331773,0.99009436,0.0052464716,0.000011494032],"about_ca_topic_score_codex":0.002025847,"about_ca_topic_score_gemma":0.0020296248,"teacher_disagreement_score":0.009466351,"about_ca_system_score_codex":0.0027712225,"about_ca_system_score_gemma":0.0023488554,"threshold_uncertainty_score":0.03047043},"labels":[],"label_agreement":null},{"id":"W1981971424","doi":"10.1016/j.tcs.2006.04.003","title":"Weighted multirecombination evolution strategies","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.005149068878092617,"score_gpt":0.23049791992071902,"score_spread":0.22534885104262642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981971424","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.06649877,0.00054295216,0.9137015,0.00020853207,0.000114273455,0.000115334486,0.000039094863,0.00020351853,0.018576039],"genre_scores_gemma":[0.49577,0.00046714573,0.4634584,0.0002654446,0.000059979066,0.0003382574,0.00013149549,0.00021660516,0.039292727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994735,0.00021408775,0.000027294598,0.00008623002,0.00014549062,0.000053426775],"domain_scores_gemma":[0.99901724,0.00050809904,0.00007767245,0.00015023346,0.00019362739,0.00005312661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094051595,0.00076757505,0.0007569578,0.000845127,0.0004742474,0.0008232049,0.0016753162,0.0010095354,0.006521625],"category_scores_gemma":[0.0032215915,0.00028259985,0.0005145204,0.00081219483,0.00047301603,0.0010720678,0.0012036104,0.00074008876,0.0009094684],"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.00028076532,0.0002393967,0.0009909119,0.00025652623,0.00019016945,0.00029603273,0.00022061283,0.30040246,0.027490243,0.27542123,0.004038776,0.39017287],"study_design_scores_gemma":[0.00007157265,0.00023394475,0.00039737317,0.00003432705,0.00009783735,0.0003190411,0.000043966138,0.90862495,0.0058117528,0.0765724,0.0077621574,0.000030690677],"about_ca_topic_score_codex":0.00029977778,"about_ca_topic_score_gemma":0.00051014486,"teacher_disagreement_score":0.006521625,"about_ca_system_score_codex":0.00037754685,"about_ca_system_score_gemma":0.0003670711,"threshold_uncertainty_score":0.021816969},"labels":[],"label_agreement":null},{"id":"W1982015000","doi":"10.1016/j.tcs.2009.02.015","title":"Matrix columns allocation problems","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"David and Lucile Packard Foundation","keywords":"Orthogonal frequency-division multiple access; Matrix (chemical analysis); Combinatorics; Mathematical proof; Transmission (telecommunications); Mathematics; Computer science; Element (criminal law); Mathematical optimization; Discrete mathematics; Orthogonal frequency-division multiplexing; Algorithm; Telecommunications; Channel (broadcasting)","score_opus":0.004906022925432091,"score_gpt":0.21023301304130262,"score_spread":0.20532699011587052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982015000","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.030633718,0.003284078,0.8448086,0.0043814383,0.0007490011,0.00032507812,0.0014233795,0.0007897004,0.113605],"genre_scores_gemma":[0.4461809,0.0050953534,0.36045608,0.0023961216,0.0021665578,0.0010683115,0.0028602453,0.0010310855,0.1787453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864846,0.00053403014,0.000046996647,0.0003056776,0.000260451,0.00020430832],"domain_scores_gemma":[0.997426,0.0016217951,0.00016917085,0.00029722054,0.00030662172,0.00017914001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010023874,0.0015978987,0.0014669404,0.0010489953,0.0011472098,0.0040854984,0.0016767053,0.0023052031,0.029605422],"category_scores_gemma":[0.0060818903,0.00081642333,0.0007312051,0.0029630782,0.0011711663,0.0033682368,0.0017323418,0.002723972,0.0046853656],"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.00045104153,0.00033328758,0.00040039426,0.0005498396,0.00013399613,0.0001561069,0.00016752009,0.11677147,0.003128779,0.6038534,0.079430506,0.19462365],"study_design_scores_gemma":[0.00017620955,0.00012341783,0.0002733903,0.000081640675,0.00006904316,0.00022334512,0.0001198455,0.26395488,0.0028861058,0.7045382,0.027520066,0.000033988104],"about_ca_topic_score_codex":0.0011264869,"about_ca_topic_score_gemma":0.00113361,"teacher_disagreement_score":0.029605422,"about_ca_system_score_codex":0.0011758299,"about_ca_system_score_gemma":0.0012760194,"threshold_uncertainty_score":0.09903997},"labels":[],"label_agreement":null},{"id":"W1982358125","doi":"10.1016/j.tcs.2015.03.026","title":"On hardness of several string indexing problems","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Danmarks Grundforskningsfond","keywords":"String (physics); Search engine indexing; Computer science; Mathematics; Combinatorics; Information retrieval","score_opus":0.023988290326781455,"score_gpt":0.2594345300040363,"score_spread":0.23544623967725486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982358125","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.27947667,0.015731007,0.405996,0.105984986,0.002353281,0.0006094665,0.0069356537,0.002742215,0.18017076],"genre_scores_gemma":[0.83273387,0.008570186,0.09902175,0.008332612,0.0072137304,0.00086591963,0.00830647,0.0016391763,0.03331626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98885196,0.0034279202,0.00074504694,0.0021364894,0.0030719007,0.0017668592],"domain_scores_gemma":[0.8521386,0.13192174,0.0035399685,0.0074133384,0.0022698406,0.002716519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008236885,0.0025789102,0.0060278,0.0048844735,0.0067439736,0.011636585,0.008370584,0.008013817,0.026527211],"category_scores_gemma":[0.061119154,0.002235814,0.005191471,0.010842703,0.011694602,0.038745806,0.009056694,0.01940761,0.0022929092],"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.0016161433,0.0008205246,0.0024816315,0.0015181601,0.00023959948,0.00041628125,0.0012089506,0.038281593,0.0015683443,0.83742297,0.052898213,0.06152772],"study_design_scores_gemma":[0.00015371206,0.0000457397,0.00040244512,0.00006133316,0.000055753695,0.00015176268,0.00017148962,0.0297026,0.0004166578,0.9660886,0.002716124,0.000033893262],"about_ca_topic_score_codex":0.0030482768,"about_ca_topic_score_gemma":0.0025517922,"teacher_disagreement_score":0.026527211,"about_ca_system_score_codex":0.0070838938,"about_ca_system_score_gemma":0.004016898,"threshold_uncertainty_score":0.088742316},"labels":[],"label_agreement":null},{"id":"W1982912460","doi":"10.1016/s0304-3975(99)00300-x","title":"Algebraic characterizations of trace and decorated trace equivalences over tree-like structures","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Homomorphism; TRACE (psycholinguistics); Bisimulation; Mathematics; Algebraic number; Equivalence (formal languages); Bounded function; Tree (set theory); Transition system; Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Algorithm","score_opus":0.018357430765140563,"score_gpt":0.29063311651850593,"score_spread":0.27227568575336536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982912460","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.24544962,0.00029010704,0.71287227,0.0009315547,0.00016971312,0.00018022314,0.0005182312,0.0011428667,0.038445495],"genre_scores_gemma":[0.94054353,0.00025743165,0.049478017,0.0002577053,0.00022919364,0.00016132416,0.0007087843,0.00037505396,0.007988997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950303,0.00072948175,0.0004570713,0.0010255936,0.0019764819,0.0007810188],"domain_scores_gemma":[0.9887227,0.005117361,0.001403424,0.00188792,0.0021059592,0.000762582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002219093,0.00065125455,0.0010157073,0.0027438055,0.0018028892,0.0056890724,0.0021880777,0.0019426385,0.0071525956],"category_scores_gemma":[0.013546148,0.0008586498,0.0017060505,0.00266646,0.004824208,0.01399074,0.0047337892,0.004596302,0.00064118596],"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.000066516215,0.000057771384,0.000491016,0.000041334897,0.000012633968,0.00014054596,0.00049142004,0.0021170059,0.0015444221,0.9877335,0.00030804693,0.0069958335],"study_design_scores_gemma":[0.000020437397,0.000042719355,0.00027988892,0.000019489527,0.000025591544,0.00019523638,0.0002233564,0.014270524,0.0019533893,0.98053795,0.002409581,0.000021858503],"about_ca_topic_score_codex":0.0009016383,"about_ca_topic_score_gemma":0.00082007935,"teacher_disagreement_score":0.0071525956,"about_ca_system_score_codex":0.0016278187,"about_ca_system_score_gemma":0.0012243645,"threshold_uncertainty_score":0.023927808},"labels":[],"label_agreement":null},{"id":"W1983239548","doi":"10.1016/j.tcs.2004.12.032","title":"On properties of bond-free DNA languages","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"DNA; DNA computing; Construct (python library); Property (philosophy); Characterization (materials science); Formal language; Computer science; Discrete mathematics; Mathematics; Algorithm; Theoretical computer science; Programming language; Genetics; Biology; Physics","score_opus":0.009223273731269854,"score_gpt":0.23893363602633283,"score_spread":0.22971036229506298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983239548","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.4802723,0.002778989,0.41223344,0.007910666,0.0003522767,0.00016770726,0.0010172623,0.0010706995,0.09419669],"genre_scores_gemma":[0.956813,0.0012535258,0.029040825,0.0009192619,0.00044481776,0.00033008985,0.0007129533,0.00053064787,0.009954922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977849,0.00074469345,0.00017937922,0.0003605573,0.00058466155,0.0003458463],"domain_scores_gemma":[0.9561208,0.036822543,0.0016834665,0.002654106,0.0015108576,0.0012082561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004060988,0.00096761854,0.0012782539,0.002792752,0.0028365043,0.005012572,0.0025661197,0.0020294548,0.008774363],"category_scores_gemma":[0.027483128,0.00092303986,0.0014081569,0.0031081913,0.005988147,0.016216064,0.0034350108,0.0048708296,0.0009180725],"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.00007309649,0.000031499,0.00033923524,0.00005730606,0.000009561481,0.00005763244,0.00038412336,0.0040137274,0.0007022601,0.98910975,0.00095099927,0.0042708204],"study_design_scores_gemma":[0.0000123485415,0.00001221349,0.00006257987,0.000014006801,0.000005829384,0.00004215268,0.000055440574,0.007636902,0.00029766595,0.9911084,0.0007431646,0.000009284438],"about_ca_topic_score_codex":0.0012581839,"about_ca_topic_score_gemma":0.00092987524,"teacher_disagreement_score":0.008774363,"about_ca_system_score_codex":0.0024270886,"about_ca_system_score_gemma":0.0012331229,"threshold_uncertainty_score":0.029353201},"labels":[],"label_agreement":null},{"id":"W1983244685","doi":"10.1016/s0304-3975(00)00382-0","title":"Restriction categories I: categories of partial maps","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":165,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Coproduct; Mathematics; Closed category; Limit (mathematics); 2-category; Context (archaeology); Distributive property; Concrete category; Enriched category; Category theory; Derived category; Triangulated category; Dual (grammatical number); Pure mathematics; Algebra over a field; Linguistics; Functor","score_opus":0.028297649230790367,"score_gpt":0.28077438400242166,"score_spread":0.2524767347716313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983244685","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.18750824,0.009649508,0.5535073,0.004432333,0.001139273,0.00028092455,0.0037431372,0.0024497218,0.23728955],"genre_scores_gemma":[0.8681155,0.0046858387,0.07059744,0.0013484549,0.0012592076,0.00048675475,0.0034208745,0.00044227773,0.049643528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989963,0.00022753932,0.00006362456,0.00030343482,0.00027770994,0.00013140288],"domain_scores_gemma":[0.9986872,0.00047905534,0.00015349146,0.00027837348,0.00019556661,0.00020625972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008827594,0.0007299366,0.0007395582,0.0024177984,0.0014749806,0.0047899317,0.0014613257,0.0011805007,0.011858031],"category_scores_gemma":[0.002374635,0.0005281367,0.0006923124,0.0025987704,0.003752641,0.008230569,0.0033484432,0.002766104,0.002253709],"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.000012975911,0.000010264565,0.000281569,0.00006905814,0.000007324101,0.00004594318,0.00034466296,0.00012589458,0.00081116235,0.99005413,0.002252884,0.0059841974],"study_design_scores_gemma":[0.000008752309,0.000026390499,0.00067939167,0.000026074185,0.000014340221,0.0003597008,0.0002727122,0.0011564746,0.001334213,0.96633863,0.029768927,0.0000145027025],"about_ca_topic_score_codex":0.00063946046,"about_ca_topic_score_gemma":0.00026935764,"teacher_disagreement_score":0.011858031,"about_ca_system_score_codex":0.0008427776,"about_ca_system_score_gemma":0.00051862246,"threshold_uncertainty_score":0.039669037},"labels":[],"label_agreement":null},{"id":"W1983278039","doi":"10.1016/j.tcs.2004.03.002","title":"On the number of nonterminals in linear conjunctive grammars","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"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":"Terminal and nonterminal symbols; Indexed grammar; Mathematics; Context-sensitive grammar; Disjoint sets; Discrete mathematics; Combinatorics; Rule-based machine translation; Context-free grammar; Computer science; Natural language processing","score_opus":0.00953662867562726,"score_gpt":0.262570027593138,"score_spread":0.25303339891751075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983278039","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.5145016,0.0034981146,0.40355238,0.013334417,0.0006960816,0.00018383602,0.0013600467,0.0011428394,0.061730668],"genre_scores_gemma":[0.9090303,0.0013664325,0.072725244,0.0008294462,0.00086655887,0.00034305852,0.0007886874,0.00071525754,0.013334929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9892209,0.004876843,0.00084170327,0.0017549681,0.0022117211,0.0010939034],"domain_scores_gemma":[0.6763392,0.30108488,0.006458285,0.008604023,0.003332574,0.004181043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011161062,0.0012926698,0.0035462673,0.0031913223,0.0038609602,0.008338503,0.005717877,0.0045295283,0.012224116],"category_scores_gemma":[0.07426928,0.002872875,0.0022375986,0.0032537468,0.010598543,0.034174856,0.005441917,0.0068453043,0.0012709778],"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.0011270259,0.00023548775,0.005465884,0.0004127452,0.000083803585,0.0005411667,0.0012909363,0.045234002,0.0032578735,0.9109809,0.0041915462,0.027178757],"study_design_scores_gemma":[0.00007556637,0.000056532514,0.0006343683,0.00006366295,0.00005686826,0.00028771523,0.00016700933,0.07675021,0.0012299152,0.91928905,0.0013486941,0.00004046902],"about_ca_topic_score_codex":0.0013068564,"about_ca_topic_score_gemma":0.0018605331,"teacher_disagreement_score":0.012224116,"about_ca_system_score_codex":0.0033035495,"about_ca_system_score_gemma":0.0017905573,"threshold_uncertainty_score":0.059026003},"labels":[],"label_agreement":null},{"id":"W1983693678","doi":"10.1016/j.tcs.2010.01.004","title":"Fast radio broadcasting with advice","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":53,"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 en Outaouais","funders":"Engineering and Physical Sciences Research Council; Agence Nationale de la Recherche","keywords":"Broadcasting (networking); Advice (programming); Computer science; Constant (computer programming); Radio broadcasting; Radio networks; Computer network; Broadcast communication network; Theoretical computer science; Telecommunications; Wireless network; Wireless","score_opus":0.006882577268605463,"score_gpt":0.23766120430507173,"score_spread":0.23077862703646626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983693678","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.059586935,0.002003742,0.88616437,0.0022724965,0.00085867575,0.0002561554,0.00044395553,0.006277131,0.042136487],"genre_scores_gemma":[0.7335624,0.00076449005,0.23263536,0.00081289874,0.00076825183,0.0002791459,0.00042939783,0.0004945224,0.03025359],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798703,0.00066251424,0.000071594404,0.00029551893,0.0006314711,0.00035185297],"domain_scores_gemma":[0.9895459,0.0071274405,0.00029328582,0.001840755,0.0009346818,0.00025796602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015920738,0.0009650909,0.0016699226,0.0015861893,0.001394549,0.001574658,0.0014442275,0.001954065,0.010555607],"category_scores_gemma":[0.017158462,0.00060861284,0.0006513722,0.001526987,0.0012743608,0.0017080276,0.0020688185,0.0017568258,0.0026409482],"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.004362962,0.000295591,0.0024614932,0.00073543197,0.00024723026,0.0005862908,0.0007962119,0.17069292,0.02975047,0.1602986,0.05279078,0.576982],"study_design_scores_gemma":[0.0007233426,0.0003256153,0.0007039821,0.00008306877,0.00018510534,0.00061637553,0.00015281148,0.8053223,0.010334671,0.16166191,0.019832512,0.00005830327],"about_ca_topic_score_codex":0.0036678135,"about_ca_topic_score_gemma":0.0053754277,"teacher_disagreement_score":0.010555607,"about_ca_system_score_codex":0.0009598859,"about_ca_system_score_gemma":0.001927139,"threshold_uncertainty_score":0.035311997},"labels":[],"label_agreement":null},{"id":"W1984264511","doi":"10.1016/j.tcs.2005.09.028","title":"H-Coloring dichotomy revisited","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Greedy coloring; Complete coloring; Combinatorics; Discrete mathematics; Complexity of constraint satisfaction; Computational complexity theory; Automaton; Constraint (computer-aided design); Fractional coloring; List coloring; Constraint satisfaction; Graph coloring; Time complexity; Computer science; Local consistency; Theoretical computer science; Algorithm; Graph","score_opus":0.015057328051587939,"score_gpt":0.29933949641029667,"score_spread":0.28428216835870873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984264511","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.220037,0.0038393962,0.12394076,0.07611137,0.0034327458,0.000098103585,0.00086112146,0.00074375916,0.5709359],"genre_scores_gemma":[0.9428965,0.0014037503,0.01605689,0.009131542,0.0018587705,0.000105705876,0.00029148636,0.00014618257,0.028109083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999206,0.00028768578,0.000019426801,0.00017931772,0.00012902808,0.00017862034],"domain_scores_gemma":[0.9969285,0.0019020162,0.00014168587,0.00043107718,0.00023720835,0.0003595216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013899952,0.00033333473,0.0008916006,0.0011762657,0.0031866478,0.0037642315,0.0014444869,0.002599878,0.019030102],"category_scores_gemma":[0.00391567,0.00044089006,0.0006167561,0.0015566169,0.0043519316,0.0067953337,0.0022458052,0.0055333404,0.0013916284],"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.000015588397,0.000012279495,0.00008604467,0.000020440615,0.0000028687107,0.000022294473,0.00006392608,0.00016430348,0.00010750836,0.99098045,0.005635703,0.0028884627],"study_design_scores_gemma":[0.0000133541635,0.0000038032658,0.000084523665,0.000007949367,0.000002299755,0.000036928013,0.000073041374,0.00079785514,0.00005999276,0.9966241,0.002293525,0.000002502651],"about_ca_topic_score_codex":0.0008113076,"about_ca_topic_score_gemma":0.00079379947,"teacher_disagreement_score":0.019030102,"about_ca_system_score_codex":0.001471828,"about_ca_system_score_gemma":0.0010286954,"threshold_uncertainty_score":0.06366199},"labels":[],"label_agreement":null},{"id":"W1984779023","doi":"10.1016/j.tcs.2010.09.018","title":"The three column Bandpass problem is solvable in linear time","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Band-pass filter; Column (typography); Mathematics; Stacking; Time complexity; Combinatorics; Algorithm; Physics; Geometry; Engineering; Electronic engineering","score_opus":0.0035244790066319394,"score_gpt":0.18918575694195033,"score_spread":0.1856612779353184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984779023","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.30497462,0.00046961106,0.61848813,0.0042264718,0.0003438639,0.0003211366,0.0022640997,0.0015261713,0.06738598],"genre_scores_gemma":[0.81767386,0.0005035267,0.14749569,0.00075504166,0.00023821194,0.00028238932,0.002339993,0.00046220314,0.030249057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931693,0.0001655577,0.000026941736,0.00014948337,0.00010895629,0.00023213172],"domain_scores_gemma":[0.996518,0.0024519947,0.00028676252,0.00035299547,0.00022529252,0.00016498353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005081122,0.0008374869,0.0011058769,0.00042275485,0.0009394841,0.0031898075,0.0010396695,0.0018896708,0.021391883],"category_scores_gemma":[0.003713692,0.00046625815,0.000661888,0.00089295884,0.00083647564,0.003140757,0.000980549,0.002047101,0.0030589506],"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.0027484056,0.0014292086,0.004321477,0.0017597371,0.00035823975,0.0013788152,0.0006806249,0.19329382,0.030489417,0.38078827,0.09221436,0.2905376],"study_design_scores_gemma":[0.00042210362,0.00018377088,0.0015093711,0.000055455195,0.00008030637,0.0004353903,0.00077028084,0.46316794,0.0110052265,0.5125404,0.009770454,0.000059229962],"about_ca_topic_score_codex":0.002217574,"about_ca_topic_score_gemma":0.0025830618,"teacher_disagreement_score":0.021391883,"about_ca_system_score_codex":0.00065280625,"about_ca_system_score_gemma":0.0010457485,"threshold_uncertainty_score":0.071563005},"labels":[],"label_agreement":null},{"id":"W1984900662","doi":"10.1016/j.tcs.2012.03.045","title":"A study of Jacobi–Perron boundary words for the generation of discrete planes","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Mathematics; Generalization; Simple (philosophy); Dimension (graph theory); Boundary (topology); Focus (optics); Social connectedness; Fraction (chemistry); Plane (geometry); Line (geometry); Complex plane; Duality (order theory); Combinatorics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.028766549078336763,"score_gpt":0.28509171070294637,"score_spread":0.2563251616246096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984900662","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.62607354,0.0021977401,0.25072625,0.0023131275,0.00047111424,0.00012120059,0.00018213305,0.0003264156,0.11758846],"genre_scores_gemma":[0.9543571,0.00043587995,0.02687446,0.00021060878,0.00016494683,0.00008095984,0.00014831213,0.00015162378,0.01757605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952495,0.00015985267,0.00003518312,0.00008470367,0.0001078339,0.00008753801],"domain_scores_gemma":[0.99815947,0.0010502958,0.00016100587,0.00019680122,0.00020915484,0.0002232663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087823486,0.0004695692,0.0007619874,0.001433266,0.0016701159,0.0025314328,0.0014944297,0.0018424382,0.01251304],"category_scores_gemma":[0.0046878858,0.00044416563,0.0009927418,0.00080973154,0.0027188626,0.0042330283,0.0015310037,0.0017362301,0.0010983167],"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.000014407386,0.000010595383,0.00009444346,0.000025776202,0.0000022312497,0.00006633486,0.00017647626,0.0014490862,0.000613649,0.9952585,0.00031298367,0.0019755904],"study_design_scores_gemma":[0.00001910723,0.000022929484,0.00014817703,0.000021381846,0.000005049661,0.00013667693,0.00020200215,0.020887379,0.00087481993,0.97577876,0.0018883816,0.000015370671],"about_ca_topic_score_codex":0.0005346047,"about_ca_topic_score_gemma":0.0004075799,"teacher_disagreement_score":0.01251304,"about_ca_system_score_codex":0.0012167443,"about_ca_system_score_gemma":0.0006099514,"threshold_uncertainty_score":0.041860282},"labels":[],"label_agreement":null},{"id":"W1984969896","doi":"10.1016/j.tcs.2008.02.037","title":"Cleaning a network with brushes","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Brush; Vertex (graph theory); Graph; Enhanced Data Rates for GSM Evolution; Computer science; Combinatorics; Traverse; Mathematics; Artificial intelligence; Engineering; Electrical engineering","score_opus":0.00811646038885474,"score_gpt":0.22615958601625125,"score_spread":0.2180431256273965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984969896","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.012406673,0.00033093125,0.97746915,0.0004935236,0.00035039175,0.00014994068,0.00020968252,0.003601742,0.0049880785],"genre_scores_gemma":[0.121911615,0.00053183036,0.85144585,0.000380086,0.00019304726,0.00027202643,0.0004892657,0.0019479854,0.022828408],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989002,0.00015905876,0.000077832105,0.00034599553,0.00041662986,0.00010027608],"domain_scores_gemma":[0.99447495,0.0021281443,0.00022094003,0.0021487917,0.0007143078,0.00031287628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017183463,0.0011823784,0.0018809115,0.0020706828,0.0021139265,0.0018667653,0.0019408967,0.0017289593,0.023724366],"category_scores_gemma":[0.0124599235,0.0011048622,0.0015587511,0.0015627407,0.0013070905,0.0048822886,0.0041465056,0.0029315352,0.0048141917],"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.0004956472,0.00023334651,0.002051639,0.00083947135,0.00015549344,0.00042701428,0.00078857184,0.062563695,0.0523659,0.08813859,0.026943859,0.7649968],"study_design_scores_gemma":[0.000083911684,0.00024252129,0.0010976979,0.00022738017,0.00011435924,0.0006049023,0.000521308,0.6080877,0.041753072,0.26546782,0.081720315,0.00007887646],"about_ca_topic_score_codex":0.0018179787,"about_ca_topic_score_gemma":0.0034652096,"teacher_disagreement_score":0.023724366,"about_ca_system_score_codex":0.0005983998,"about_ca_system_score_gemma":0.0006959514,"threshold_uncertainty_score":0.07936597},"labels":[],"label_agreement":null},{"id":"W1985300487","doi":"10.1016/j.tcs.2014.06.026","title":"Following a curve with the discrete Fréchet distance","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Geometry","score_opus":0.005718607776081057,"score_gpt":0.2320523624921879,"score_spread":0.22633375471610687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985300487","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.17136177,0.0006305744,0.8007366,0.0010930495,0.0004354714,0.00009786177,0.00017185156,0.00032312484,0.025149718],"genre_scores_gemma":[0.7684058,0.00097069505,0.1823636,0.00025704943,0.0003361952,0.00012575205,0.0003154684,0.00039631518,0.046829037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929595,0.00015141601,0.000035222994,0.00015168544,0.00028664657,0.00007907296],"domain_scores_gemma":[0.99819654,0.00068741676,0.00023894431,0.00019893653,0.000398963,0.00027918056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008620958,0.0007240143,0.00085291895,0.002278874,0.0010926136,0.0021492857,0.0014925665,0.002562764,0.007622844],"category_scores_gemma":[0.005565466,0.0004445136,0.0007018921,0.001125005,0.0021390296,0.00340686,0.0030063016,0.002198422,0.0012199914],"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.00010126172,0.000047890437,0.0005299565,0.00008813702,0.00001979507,0.00012677624,0.00025024664,0.03857456,0.003939448,0.9172199,0.002180677,0.03692144],"study_design_scores_gemma":[0.000032525837,0.00017315289,0.00031002413,0.00004496059,0.000012512425,0.00021149481,0.00013729378,0.31088692,0.0021852097,0.6745035,0.011451934,0.000050507657],"about_ca_topic_score_codex":0.00175887,"about_ca_topic_score_gemma":0.0009673486,"teacher_disagreement_score":0.007622844,"about_ca_system_score_codex":0.0012980872,"about_ca_system_score_gemma":0.0006491471,"threshold_uncertainty_score":0.025500953},"labels":[],"label_agreement":null},{"id":"W1985614194","doi":"10.1016/j.tcs.2005.09.016","title":"Simple permutations mix well","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Random permutation; Mathematics; Combinatorics; Permutation (music); Simple (philosophy); Independence (probability theory); Closeness; Mixing (physics); Random graph; Discrete mathematics; Derangement; Graph; Symmetric group; Statistics","score_opus":0.008061903686414422,"score_gpt":0.2620267867829475,"score_spread":0.2539648830965331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985614194","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.20086436,0.0017685607,0.3137888,0.0056013498,0.0015177039,0.00035292064,0.0009164163,0.002706139,0.47248375],"genre_scores_gemma":[0.81290877,0.0011591081,0.044219464,0.0022378762,0.0007990439,0.0004568873,0.00071452913,0.0013653697,0.13613884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971938,0.00075933896,0.00012535493,0.0005359161,0.0008152315,0.00057019846],"domain_scores_gemma":[0.9959441,0.0016153113,0.00029987263,0.0010782507,0.00052926096,0.00053316285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015303297,0.001565923,0.0017752099,0.0032914865,0.0038431752,0.005722474,0.0010545071,0.0030893188,0.025074968],"category_scores_gemma":[0.007706684,0.001027707,0.001501055,0.0024331142,0.004131462,0.010372659,0.0047405562,0.004057437,0.0071564736],"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.00005044211,0.000022999635,0.00014063304,0.00002815841,0.000014081629,0.00005926762,0.00010782206,0.00039416357,0.0009638455,0.98639166,0.002882279,0.00894463],"study_design_scores_gemma":[0.000011448359,0.000012067686,0.00008900067,0.000009034263,0.000009628761,0.0000921653,0.0000408896,0.0016491833,0.0006626182,0.99176437,0.005646415,0.0000131112465],"about_ca_topic_score_codex":0.00043737632,"about_ca_topic_score_gemma":0.0009629109,"teacher_disagreement_score":0.025074968,"about_ca_system_score_codex":0.0010985532,"about_ca_system_score_gemma":0.000865993,"threshold_uncertainty_score":0.08388412},"labels":[],"label_agreement":null},{"id":"W1985734068","doi":"10.1016/j.tcs.2014.02.026","title":"The Covering Canadian Traveller Problem","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Travelling salesman problem; Shortest path problem; Routing (electronic design automation); Competitive analysis; Computer science; Mathematical optimization; A priori and a posteriori; Set (abstract data type); Path (computing); Variation (astronomy); Operations research; Mathematics; Upper and lower bounds; Theoretical computer science; Computer network","score_opus":0.006748960221634481,"score_gpt":0.21944515269249248,"score_spread":0.212696192470858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985734068","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.22209284,0.004720232,0.21807402,0.017486067,0.00079290726,0.0005723504,0.0106861135,0.00096790533,0.5246076],"genre_scores_gemma":[0.7864528,0.003470665,0.0551734,0.0010554257,0.00028421357,0.00030219255,0.005674022,0.0004125231,0.14717478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989814,0.00027676165,0.000026378639,0.00019463869,0.00019624234,0.00032447686],"domain_scores_gemma":[0.9985298,0.00062236097,0.00008657572,0.0001592016,0.000243907,0.00035816876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008928372,0.0010730072,0.0015962473,0.0012851721,0.0034299889,0.003894301,0.002810904,0.0038304743,0.043243814],"category_scores_gemma":[0.0059073265,0.00056249887,0.0007967117,0.0041499212,0.0021331648,0.004502657,0.001851595,0.0025714124,0.002219794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044816744,0.00013022666,0.0009283996,0.00031174946,0.00008160039,0.00025366852,0.00035099,0.089176066,0.00038268554,0.71634215,0.13359438,0.05799989],"study_design_scores_gemma":[0.00020350498,0.00008853331,0.0010934516,0.00014832919,0.00008012358,0.00033129353,0.0010905092,0.27355775,0.00064408954,0.60296404,0.11969545,0.00010287267],"about_ca_topic_score_codex":0.2961692,"about_ca_topic_score_gemma":0.24544813,"teacher_disagreement_score":0.70383084,"about_ca_system_score_codex":0.008870214,"about_ca_system_score_gemma":0.009082076,"threshold_uncertainty_score":0.58889055},"labels":[],"label_agreement":null},{"id":"W1985933202","doi":"10.1016/j.tcs.2008.09.011","title":"A palindromization map for the free group","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":16,"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":"Group (periodic table); Chemistry","score_opus":0.0340092894968032,"score_gpt":0.28234975369344556,"score_spread":0.24834046419664235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985933202","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.55090076,0.0017055466,0.18237537,0.004628911,0.0011638867,0.000092770126,0.00038060354,0.00065627624,0.25809583],"genre_scores_gemma":[0.9400685,0.00054753514,0.014994996,0.00048024958,0.00051683304,0.00006480329,0.00018626137,0.00015826728,0.04298261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971277,0.000053541382,0.0000139212525,0.00009164233,0.00006503318,0.00006305077],"domain_scores_gemma":[0.9996222,0.0001417934,0.000043352233,0.00005346337,0.00004763164,0.00009148079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038468486,0.000554263,0.00048994937,0.0012689475,0.0018018279,0.0019426357,0.00064335443,0.00093317556,0.009456985],"category_scores_gemma":[0.000886504,0.00027955347,0.0006494054,0.0008443547,0.002278783,0.00404742,0.0024061128,0.0022149172,0.0014080134],"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.00004193789,0.000015967833,0.000101945865,0.000020619582,0.0000040232253,0.0001088584,0.00034680506,0.0001959457,0.0013357851,0.98975044,0.0008555463,0.007222202],"study_design_scores_gemma":[0.000021931992,0.00003901338,0.00016309692,0.000004997619,0.000005870674,0.00018600142,0.00011213849,0.0007641352,0.00077694404,0.9904536,0.007463053,0.000009302075],"about_ca_topic_score_codex":0.00041361587,"about_ca_topic_score_gemma":0.00025866774,"teacher_disagreement_score":0.009456985,"about_ca_system_score_codex":0.00076489453,"about_ca_system_score_gemma":0.00042534457,"threshold_uncertainty_score":0.031636775},"labels":[],"label_agreement":null},{"id":"W1986197414","doi":"10.1016/s0304-3975(03)00099-9","title":"Lyndon words, permutations and trees","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":65,"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":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.007157902298393804,"score_gpt":0.23160806403191803,"score_spread":0.22445016173352422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986197414","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.36433947,0.05897049,0.33598018,0.01243189,0.0021052188,0.000111398986,0.00097521575,0.00077149924,0.2243146],"genre_scores_gemma":[0.90439665,0.010898222,0.032088403,0.00090059347,0.0014989473,0.00014653284,0.00064252684,0.00009884659,0.049329404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992312,0.00027050136,0.000053014126,0.00017813609,0.00016526495,0.00010192676],"domain_scores_gemma":[0.9984919,0.0009892004,0.00017723763,0.00013398708,0.00010062395,0.00010711783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009162906,0.00060575636,0.00083253626,0.0018523602,0.0019879483,0.0040728003,0.0007616252,0.0018799173,0.007358905],"category_scores_gemma":[0.0036892584,0.00052005955,0.00056128955,0.0037356792,0.0056341216,0.007898853,0.0016513051,0.0018607146,0.0010830696],"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.000035055822,0.000009497719,0.00019285965,0.000055190852,0.000003588727,0.000067944464,0.00055230694,0.0005088541,0.0004198963,0.9868663,0.0015645636,0.009723861],"study_design_scores_gemma":[0.000005838652,0.000006470705,0.000080294914,0.000010206931,0.0000039182783,0.00006639754,0.00010530096,0.0005767794,0.000088977424,0.9937536,0.0052957945,0.0000064291116],"about_ca_topic_score_codex":0.0017265191,"about_ca_topic_score_gemma":0.0022076124,"teacher_disagreement_score":0.007358905,"about_ca_system_score_codex":0.0012792508,"about_ca_system_score_gemma":0.0007799296,"threshold_uncertainty_score":0.02461803},"labels":[],"label_agreement":null},{"id":"W1986510459","doi":"10.1016/j.tcs.2011.05.044","title":"Nature-inspired framework for measuring visual image resemblance: A near rough set approach","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Disjoint sets; Metric (unit); Artificial intelligence; Fuzzy set; Object (grammar); Set (abstract data type); Representation (politics); Mathematics; Computer science; Fuzzy logic; Visualization; Pattern recognition (psychology); Similarity (geometry); Image (mathematics); Computer vision; Theoretical computer science; Discrete mathematics","score_opus":0.0417213330136382,"score_gpt":0.2970657582240786,"score_spread":0.25534442521044043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986510459","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.025727883,0.00059584994,0.97184914,0.0001004294,0.000036998663,0.000056324454,0.000051615392,0.000115041796,0.0014667227],"genre_scores_gemma":[0.59467,0.0006534423,0.4031511,0.00007411691,0.000081052916,0.0001348513,0.000104994346,0.00003390001,0.0010964604],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846303,0.0003783196,0.00009473544,0.00022419186,0.000768127,0.00007170708],"domain_scores_gemma":[0.99880314,0.00039500257,0.00024362408,0.00022178671,0.00026087943,0.000075599375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014975222,0.00056621287,0.0013212966,0.0040378324,0.0006063316,0.0021932463,0.0013893374,0.0010822043,0.00071437104],"category_scores_gemma":[0.0041570156,0.00042001472,0.0016114471,0.0018933447,0.0012830745,0.002973828,0.0015334119,0.00090151804,0.00018413013],"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.00042962044,0.0003668544,0.008554561,0.00088433747,0.00083754986,0.0007163923,0.001108022,0.27526298,0.07237565,0.22886884,0.0023972234,0.40819803],"study_design_scores_gemma":[0.000019322872,0.00028460548,0.0063658725,0.000053828222,0.00017652541,0.0007238639,0.000233088,0.8602449,0.010425176,0.11855394,0.0027873325,0.00013143037],"about_ca_topic_score_codex":0.0010927931,"about_ca_topic_score_gemma":0.0008871766,"teacher_disagreement_score":0.0040378324,"about_ca_system_score_codex":0.000802714,"about_ca_system_score_gemma":0.00055491744,"threshold_uncertainty_score":0.007919729},"labels":[],"label_agreement":null},{"id":"W1986652500","doi":"10.1016/j.tcs.2004.01.002","title":"Representing recursively enumerable languages by iterated deletion","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Recursively enumerable language; Iterated function; Decidability; Closure (psychology); Recursively enumerable set; Characterization (materials science); Mathematics; Maximal set; Discrete mathematics; Combinatorics; Algorithm; Computer science; Programming language; Set (abstract data type); Physics","score_opus":0.004844094767187674,"score_gpt":0.23947911913918926,"score_spread":0.2346350243720016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986652500","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.07271541,0.0003895904,0.91163695,0.00032980207,0.00014602354,0.000054423756,0.00021874995,0.0035482775,0.010960752],"genre_scores_gemma":[0.64567167,0.00047374994,0.33789754,0.00021775607,0.00008535293,0.00017436408,0.00062273344,0.00078592345,0.014071005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911946,0.000304719,0.00007464868,0.00018322542,0.00019089968,0.00012695066],"domain_scores_gemma":[0.9976942,0.0014068116,0.0001583067,0.0004715675,0.00019589474,0.000073223346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011498184,0.0009020134,0.00083058147,0.0009475545,0.0009911971,0.0032179796,0.0024248403,0.0012543328,0.0059096124],"category_scores_gemma":[0.0039315624,0.000703681,0.0010669464,0.0011454953,0.0023762735,0.0064314473,0.002840787,0.0022925145,0.0017474438],"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.0003783088,0.00008509493,0.00054993125,0.00019667417,0.000024810108,0.0005384488,0.0016170186,0.047639206,0.013175909,0.8678844,0.0021784687,0.06573187],"study_design_scores_gemma":[0.000065711945,0.000045085697,0.00007852474,0.000049055012,0.000052731837,0.00028254176,0.00021634779,0.116027676,0.013538091,0.856004,0.01359034,0.000049791313],"about_ca_topic_score_codex":0.0007353377,"about_ca_topic_score_gemma":0.0013421312,"teacher_disagreement_score":0.0059096124,"about_ca_system_score_codex":0.0008801713,"about_ca_system_score_gemma":0.0007364517,"threshold_uncertainty_score":0.019769669},"labels":[],"label_agreement":null},{"id":"W1987108302","doi":"10.1016/s0304-3975(00)00067-0","title":"Repetitive perhaps, but certainly not boring","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Work (physics); Mathematical economics; Theoretical computer science; Mathematics; Calculus (dental); Algebra over a field; Engineering; Pure mathematics; Mechanical engineering","score_opus":0.008705978987782583,"score_gpt":0.23941056217111675,"score_spread":0.23070458318333417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987108302","genre_codex":"commentary","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.004913241,0.030362567,0.06006058,0.7135668,0.10419378,0.000097727214,0.00072009006,0.0017243949,0.08436086],"genre_scores_gemma":[0.07950596,0.023231408,0.08779674,0.4302195,0.09363136,0.00026305672,0.0010900024,0.0023988688,0.28186324],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99452704,0.0017189971,0.00025378505,0.0011411885,0.0020973342,0.00026151165],"domain_scores_gemma":[0.9738482,0.009226417,0.0012617611,0.005253571,0.008831938,0.0015780823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062012095,0.0012808564,0.0010495366,0.0014971165,0.0042160302,0.006112575,0.0023279495,0.0043820743,0.02408208],"category_scores_gemma":[0.04436229,0.0004623545,0.0008120764,0.0012373468,0.012539417,0.014130151,0.0034116602,0.011825969,0.01690995],"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.00017860022,0.00006842331,0.0006819979,0.0005868163,0.0000836954,0.00028785388,0.0013183072,0.00036326333,0.002744673,0.25785208,0.6781475,0.05768681],"study_design_scores_gemma":[0.000035250418,0.00006567419,0.00067922403,0.00041484158,0.000025193467,0.00064181426,0.0018572133,0.0004254659,0.0009923044,0.3490834,0.64570063,0.0000790159],"about_ca_topic_score_codex":0.0019361656,"about_ca_topic_score_gemma":0.0030314168,"teacher_disagreement_score":0.02408208,"about_ca_system_score_codex":0.0021213302,"about_ca_system_score_gemma":0.0019593737,"threshold_uncertainty_score":0.08056265},"labels":[],"label_agreement":null},{"id":"W1987374824","doi":"10.1016/j.tcs.2005.03.036","title":"Palindromic factors of billiard words","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"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":"Dynamical billiards; Palindrome; Dimension (graph theory); Mathematics; Prefix; Fourth Dimension; Combinatorics; Pure mathematics; Physics; Geometry; Linguistics; Philosophy; Spacetime","score_opus":0.009619744018541267,"score_gpt":0.23842521909478898,"score_spread":0.2288054750762477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987374824","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.67247564,0.0016413813,0.16935961,0.0013854757,0.00072776765,0.00013379563,0.00032032255,0.0008616684,0.1530944],"genre_scores_gemma":[0.94759154,0.00037862468,0.01591934,0.00023109661,0.00031891587,0.00007776883,0.00022016028,0.0002452171,0.0350173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992748,0.000113669426,0.00005533116,0.0001668794,0.00017689413,0.00021244306],"domain_scores_gemma":[0.99889886,0.0004464849,0.00013990694,0.00015198838,0.00016893019,0.00019376089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062442356,0.0007701203,0.00095277664,0.0016424466,0.0020106416,0.0028531447,0.0007333684,0.0009908652,0.011615218],"category_scores_gemma":[0.0027497737,0.0006739631,0.0009229388,0.0012156623,0.0023113263,0.0039843833,0.0014236614,0.0016672679,0.002618914],"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.000078189114,0.00002023044,0.00016297612,0.000021066002,0.000004576125,0.00016791446,0.00042899032,0.00026332264,0.002159091,0.99209386,0.0006554866,0.0039442102],"study_design_scores_gemma":[0.00003515859,0.000036153804,0.00023294849,0.000013850244,0.000011494976,0.00021879541,0.00019218591,0.0016114702,0.0020045377,0.9882569,0.007365465,0.000021051876],"about_ca_topic_score_codex":0.00088079675,"about_ca_topic_score_gemma":0.000879124,"teacher_disagreement_score":0.011615218,"about_ca_system_score_codex":0.0009521808,"about_ca_system_score_gemma":0.0004883843,"threshold_uncertainty_score":0.038856745},"labels":[],"label_agreement":null},{"id":"W1987608226","doi":"10.1016/j.tcs.2006.07.020","title":"Incremental construction of minimal deterministic finite cover automata","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Deterministic finite automaton; Cover (algebra); DFA minimization; Deterministic automaton; Nondeterministic finite automaton; Automaton; Finite-state machine; Quantum finite automata; Regular language; ω-automaton; Büchi automaton; Two-way deterministic finite automaton; Computer science; Nested word; Algorithm; Mathematics; Discrete mathematics; Automata theory; Theoretical computer science","score_opus":0.005976703962465163,"score_gpt":0.2199071007742895,"score_spread":0.21393039681182432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987608226","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.19628641,0.00030835994,0.7773628,0.0005303638,0.00010726039,0.00021904857,0.000819237,0.0035782564,0.020788291],"genre_scores_gemma":[0.6638375,0.00018579059,0.32779765,0.000096725016,0.00003984633,0.00028342733,0.0015679753,0.00042813868,0.005762884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919516,0.00015307093,0.00005445943,0.00015713427,0.0003059091,0.00013432898],"domain_scores_gemma":[0.9971577,0.0016817279,0.00008232102,0.00057924964,0.00034926095,0.00014975789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051574304,0.00038485264,0.00067161885,0.0008155622,0.00088843034,0.0012682317,0.0016542122,0.0006690615,0.005288744],"category_scores_gemma":[0.003046844,0.00062726194,0.0011024567,0.00061929156,0.00093942013,0.002133382,0.0028741865,0.0012318181,0.00086891727],"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.000609514,0.00039997086,0.0027187357,0.0006753149,0.00010376862,0.0007204108,0.0014105295,0.039076887,0.06970028,0.67466456,0.008653372,0.20126659],"study_design_scores_gemma":[0.00010269427,0.00014815415,0.0013069817,0.00010624454,0.00019033243,0.00045066854,0.00031607455,0.30671644,0.07141004,0.5891588,0.030021792,0.00007177589],"about_ca_topic_score_codex":0.0008433954,"about_ca_topic_score_gemma":0.0019616324,"teacher_disagreement_score":0.005288744,"about_ca_system_score_codex":0.0008816931,"about_ca_system_score_gemma":0.00075099245,"threshold_uncertainty_score":0.017692626},"labels":[],"label_agreement":null},{"id":"W1987699222","doi":"10.1016/j.tcs.2012.03.005","title":"Succinct representations of permutations and functions","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Royal Society","keywords":"Combinatorics; Upper and lower bounds; Integer (computer science); Permutation (music); Mathematics; Constant (computer programming); Redundancy (engineering); Discrete mathematics; Binary logarithm; Time complexity; Function (biology); Computer science","score_opus":0.011512410575846524,"score_gpt":0.27473259320581783,"score_spread":0.2632201826299713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987699222","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.034106012,0.0011856853,0.94005394,0.0016415064,0.00034890612,0.00012688347,0.0022723284,0.0012509928,0.019013764],"genre_scores_gemma":[0.5185086,0.002609609,0.4456094,0.001035515,0.0005125237,0.0007039282,0.007764855,0.0008696656,0.022385813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975085,0.00077897427,0.00021730395,0.00030118955,0.00094528473,0.00024878595],"domain_scores_gemma":[0.99524236,0.0019372968,0.0003215599,0.0018529969,0.0005175181,0.00012831675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013205745,0.001106984,0.00082750374,0.002126097,0.0007933438,0.0040474026,0.0016657376,0.0017743153,0.0107418895],"category_scores_gemma":[0.009300206,0.00060816837,0.0007517622,0.0033640857,0.0016095096,0.0070954203,0.0026081908,0.0033866756,0.002768171],"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.00021907336,0.00007003755,0.00025773083,0.00014341145,0.000015476346,0.00013089081,0.00033033855,0.022604218,0.001742043,0.8672768,0.0077765724,0.0994335],"study_design_scores_gemma":[0.000026009864,0.00003180122,0.00007821432,0.00007301509,0.000014788335,0.00013767999,0.00007805174,0.040106054,0.002158177,0.9447866,0.01249156,0.000018169296],"about_ca_topic_score_codex":0.00075106946,"about_ca_topic_score_gemma":0.0014178711,"teacher_disagreement_score":0.0107418895,"about_ca_system_score_codex":0.0010414798,"about_ca_system_score_gemma":0.0012778449,"threshold_uncertainty_score":0.035935223},"labels":[],"label_agreement":null},{"id":"W1987818736","doi":"10.1016/j.tcs.2011.10.010","title":"Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Polynomial-time approximation scheme; Approximation algorithm; Mathematics; Combinatorics; Shortest path problem; Routing (electronic design automation); Time complexity; Wireless sensor network; Discrete mathematics; Constant (computer programming); Scheme (mathematics); Constraint (computer-aided design); Wireless network; Polynomial; Path (computing); Graph; Wireless; Computer science; Computer network; Telecommunications","score_opus":0.02154726848785673,"score_gpt":0.24917111550351476,"score_spread":0.22762384701565802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987818736","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.06183627,0.0013603006,0.92824763,0.0011404455,0.00026308684,0.00038971682,0.0006923771,0.0014004112,0.00466971],"genre_scores_gemma":[0.6149799,0.00078232225,0.37846154,0.0003367357,0.0001630956,0.0004800433,0.0011977426,0.00019513065,0.0034034345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979736,0.00051499816,0.000112691814,0.00046591606,0.0005546145,0.0003781201],"domain_scores_gemma":[0.99656916,0.0020815264,0.0002547613,0.0005318323,0.00034850813,0.00021421835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020026364,0.0014081213,0.003197005,0.0010211198,0.0011783353,0.0022202071,0.0042638816,0.0015115745,0.0035932595],"category_scores_gemma":[0.0062140557,0.00066078996,0.0011104405,0.002828082,0.00074039976,0.0037919364,0.0020741127,0.0019214391,0.00045049138],"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.0012996716,0.0004470191,0.0009202948,0.0008613442,0.00017301872,0.00017585134,0.00033028255,0.78720635,0.006841787,0.03919378,0.01366817,0.14888245],"study_design_scores_gemma":[0.00008453406,0.00007429746,0.00010025829,0.000012093497,0.000032311764,0.0000566246,0.000050796945,0.9848092,0.00088961766,0.013130718,0.0007495863,0.000009835132],"about_ca_topic_score_codex":0.0054885377,"about_ca_topic_score_gemma":0.0074113435,"teacher_disagreement_score":0.0054885377,"about_ca_system_score_codex":0.0029319113,"about_ca_system_score_gemma":0.0034258564,"threshold_uncertainty_score":0.0212726},"labels":[],"label_agreement":null},{"id":"W1988245022","doi":"10.1016/s0304-3975(99)00127-9","title":"Extended capabilities for visual cryptography","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":436,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Set (abstract data type); Visual cryptography; Contrast (vision); Pixel; TRACE (psycholinguistics); Transparency (behavior); Scheme (mathematics); Image (mathematics); Computer science; Mathematics; Cryptography; ENCODE; Construct (python library); Theoretical computer science; Computer vision; Combinatorics; Algorithm; Secret sharing; Biology; Computer network; Linguistics","score_opus":0.009916927238760042,"score_gpt":0.27717266765448195,"score_spread":0.2672557404157219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988245022","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.03909801,0.012530743,0.6792307,0.0035877912,0.0013277292,0.00013158905,0.00055838743,0.0023898077,0.26114526],"genre_scores_gemma":[0.76149553,0.008221183,0.12021191,0.0009298295,0.0016325847,0.00024639908,0.00058651273,0.00047718943,0.10619896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933213,0.00013147124,0.00004241635,0.00010310295,0.00027442776,0.00011643375],"domain_scores_gemma":[0.9988612,0.00041870296,0.00008961592,0.00037974239,0.00017166091,0.000079018064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004964441,0.0008620392,0.00047213808,0.0011080365,0.0006745842,0.0023750914,0.0007413893,0.00088845275,0.0134289935],"category_scores_gemma":[0.0023640199,0.00029457433,0.00047897385,0.000898149,0.0015928843,0.006253307,0.0031672823,0.0024277072,0.0042114165],"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.0000890212,0.000015277066,0.000066568646,0.000092087,0.00000842342,0.00008855988,0.00009346725,0.0012978432,0.0040169014,0.93559307,0.0047696945,0.05386902],"study_design_scores_gemma":[0.000021779866,0.000040571616,0.000088898174,0.00007518029,0.000013050005,0.0002629551,0.000023936114,0.0056413803,0.004478598,0.9231228,0.06621048,0.00002034452],"about_ca_topic_score_codex":0.0002561075,"about_ca_topic_score_gemma":0.00016508922,"teacher_disagreement_score":0.0134289935,"about_ca_system_score_codex":0.0005373737,"about_ca_system_score_gemma":0.0003952461,"threshold_uncertainty_score":0.044924438},"labels":[],"label_agreement":null},{"id":"W1989290453","doi":"10.1016/j.tcs.2010.12.012","title":"Optimization techniques for small matrix multiplication","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Mitacs; Canada Research Chairs","keywords":"Strassen algorithm; Matrix multiplication; Multiplication (music); Mathematics; Multiplication algorithm; Matrix (chemical analysis); Base (topology); Arithmetic; Algebra over a field; Algorithm; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.009235530333444139,"score_gpt":0.2618025722920485,"score_spread":0.25256704195860435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989290453","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.005896274,0.00093953504,0.98095316,0.00049633783,0.0001587598,0.00004938646,0.00006252024,0.00032347394,0.011120595],"genre_scores_gemma":[0.26264197,0.0024603468,0.69786227,0.0005743762,0.0007639745,0.00052373717,0.00027728648,0.00083928026,0.034056805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990872,0.00030482074,0.000040446146,0.000105146806,0.00038076547,0.00008158744],"domain_scores_gemma":[0.99856156,0.0009117755,0.000103562386,0.00022373229,0.00014826,0.00005121637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085867266,0.0012249226,0.0009523433,0.0010297569,0.0006555976,0.0010089716,0.0012262751,0.00075023103,0.008909682],"category_scores_gemma":[0.004743511,0.00058087375,0.00068778265,0.0017722186,0.0012358503,0.002257002,0.00158764,0.0023949735,0.0023875001],"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.00030897264,0.00014202436,0.0002914512,0.00035410613,0.0000660059,0.00009345764,0.00017278768,0.10730152,0.0142612,0.56323624,0.016830936,0.29694128],"study_design_scores_gemma":[0.000066748245,0.00008954222,0.00020417309,0.000045047207,0.000029922205,0.0001077869,0.000026214131,0.49998432,0.0055906605,0.48130825,0.012518545,0.000028719838],"about_ca_topic_score_codex":0.00081823335,"about_ca_topic_score_gemma":0.001536024,"teacher_disagreement_score":0.008909682,"about_ca_system_score_codex":0.000771298,"about_ca_system_score_gemma":0.0007372943,"threshold_uncertainty_score":0.029805839},"labels":[],"label_agreement":null},{"id":"W1990424408","doi":"10.1016/j.tcs.2011.05.047","title":"Rewriting of visibly pushdown languages for XML data integration","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Programming language; XML validation; Document Structure Description; XML Schema Editor; XPath; XML Schema (W3C); Streaming XML; Efficient XML Interchange; RELAX NG; XML; XML Encryption; World Wide Web","score_opus":0.04928169162103819,"score_gpt":0.3136043105700699,"score_spread":0.2643226189490317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990424408","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.033647068,0.00033501236,0.9532768,0.00033456838,0.00018592991,0.00013306136,0.00036089544,0.0041742157,0.0075523965],"genre_scores_gemma":[0.47887507,0.0004629534,0.49910983,0.00046453802,0.00017139081,0.00025375315,0.0015889002,0.0032275543,0.015845947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967771,0.0009860608,0.00042486316,0.0005015913,0.0009904664,0.0003199734],"domain_scores_gemma":[0.99492115,0.0021912854,0.00031715768,0.001548352,0.0008295908,0.00019247118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027187774,0.00065326714,0.0007805538,0.0008154736,0.0011437743,0.003355891,0.0017006918,0.0011089451,0.0045650844],"category_scores_gemma":[0.006916489,0.0009845213,0.0017245132,0.0010673307,0.0019396029,0.0046637566,0.0029602267,0.0027118202,0.0012236987],"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.00043401358,0.00021208567,0.0010664059,0.00045743017,0.000113589515,0.0010992694,0.0026343893,0.032105677,0.046071514,0.7897888,0.007941583,0.118075155],"study_design_scores_gemma":[0.00010417426,0.00015993211,0.00033376928,0.000106581654,0.0001564766,0.00042783687,0.00038747926,0.15993552,0.056816995,0.7389628,0.042466223,0.00014213807],"about_ca_topic_score_codex":0.00212522,"about_ca_topic_score_gemma":0.0027807187,"teacher_disagreement_score":0.0045650844,"about_ca_system_score_codex":0.0010364737,"about_ca_system_score_gemma":0.00094909273,"threshold_uncertainty_score":0.015271723},"labels":[],"label_agreement":null},{"id":"W1990785823","doi":"10.1016/s0304-3975(02)00086-5","title":"Approximation algorithms for NMR spectral peak assignment","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Bipartite graph; Matching (statistics); Disjoint sets; Combinatorics; Approximation algorithm; Mathematics; Algorithm; Set (abstract data type); Blossom algorithm; Computer science; Graph","score_opus":0.012902715873872492,"score_gpt":0.2668682977720276,"score_spread":0.2539655818981551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990785823","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.00408347,0.0006241286,0.9923563,0.00034234996,0.00008342828,0.00005689021,0.00015178524,0.0009714685,0.0013301253],"genre_scores_gemma":[0.11616093,0.0011309788,0.8742429,0.00034841913,0.00027950536,0.0005280835,0.0014766726,0.0005845499,0.005248001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974649,0.0009368236,0.00015291403,0.00047256332,0.00067442295,0.00029839575],"domain_scores_gemma":[0.9882714,0.00795028,0.00061414,0.0017817619,0.0010142796,0.00036808554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040147905,0.0022646247,0.0031181166,0.0024821998,0.0013934518,0.00335672,0.0056118453,0.00323487,0.010575347],"category_scores_gemma":[0.024255548,0.0013546481,0.0017334875,0.0047501996,0.0019380335,0.005221582,0.0037401149,0.004871766,0.0039723264],"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.0007871964,0.00034023347,0.00094622624,0.00046332707,0.00012529179,0.000083726125,0.00021127258,0.46521,0.0016379363,0.08183164,0.01821834,0.4301448],"study_design_scores_gemma":[0.000079596844,0.000033574812,0.000112793496,0.000025489859,0.000026306016,0.000044460314,0.00003748514,0.89219695,0.0005338844,0.10509065,0.0018057727,0.000013011944],"about_ca_topic_score_codex":0.006232948,"about_ca_topic_score_gemma":0.00554351,"teacher_disagreement_score":0.010575347,"about_ca_system_score_codex":0.0030102131,"about_ca_system_score_gemma":0.00312006,"threshold_uncertainty_score":0.0353781},"labels":[],"label_agreement":null},{"id":"W1991183719","doi":"10.1016/j.tcs.2011.05.045","title":"Information systems in modeling interactive computations on granules","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Theoretical computer science; Computation; Perception; Artificial intelligence; Complex system; Machine learning; Algorithm","score_opus":0.025797941309510755,"score_gpt":0.24830519826924,"score_spread":0.22250725695972923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991183719","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.024769964,0.0011972241,0.9657408,0.00084729126,0.00010822303,0.00004073233,0.000115988165,0.00013732907,0.007042496],"genre_scores_gemma":[0.7168727,0.0021078005,0.27432722,0.00017008431,0.00039519864,0.00026751115,0.0002951321,0.00010824999,0.005456119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906427,0.00045066426,0.00008225102,0.0001336555,0.00019773773,0.00007143871],"domain_scores_gemma":[0.99755836,0.0017699813,0.00015330773,0.00031193544,0.00012481077,0.000081569095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001561921,0.00069812627,0.0012540503,0.0010990012,0.0007273167,0.0035925952,0.0012733999,0.0013076072,0.0036601105],"category_scores_gemma":[0.00494727,0.0005582186,0.0013220544,0.002130269,0.002840013,0.0077255922,0.0017839676,0.0021197845,0.00038191216],"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.000018208777,0.000011021192,0.0001635101,0.000049701353,0.000022580121,0.00007140108,0.00015225129,0.063207306,0.00023511125,0.9317096,0.00036179012,0.0039976],"study_design_scores_gemma":[0.000009462416,0.000010627563,0.000061244835,0.0000150941705,0.000018109256,0.000017315475,0.000038255417,0.2632118,0.00018572071,0.73482746,0.0015972969,0.0000076379965],"about_ca_topic_score_codex":0.0024851144,"about_ca_topic_score_gemma":0.0012969336,"teacher_disagreement_score":0.0036601105,"about_ca_system_score_codex":0.0011933396,"about_ca_system_score_gemma":0.00068598415,"threshold_uncertainty_score":0.012244284},"labels":[],"label_agreement":null},{"id":"W1991224384","doi":"10.1016/s0304-3975(00)00403-5","title":"An introduction to metric semantics: operational and denotational models for programming and specification languages","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Denotational semantics; Denotational semantics of the Actor model; Computer science; Programming language; Operational semantics; Nondeterministic algorithm; Normalisation by evaluation; Action semantics; Domain theory; Semantics (computer science); Programming language theory; Theoretical computer science; Fifth-generation programming language; Programming paradigm; Mathematics; Discrete mathematics","score_opus":0.019522302318894902,"score_gpt":0.28291543733863267,"score_spread":0.26339313501973777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991224384","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.0015696362,0.038357552,0.92191786,0.008426974,0.0021356028,0.00010190733,0.0006377499,0.0008420073,0.026010692],"genre_scores_gemma":[0.07274995,0.05025908,0.837189,0.0063695745,0.0075154854,0.00079182116,0.0012173959,0.0010231041,0.022884645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972453,0.00069150346,0.00044899425,0.0005143561,0.00091716676,0.00018272657],"domain_scores_gemma":[0.9961288,0.0026586351,0.0002134285,0.0003898707,0.00042978354,0.00017957507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033742301,0.0018615944,0.002038725,0.0029737516,0.001573614,0.006899599,0.0034914282,0.004141661,0.008975367],"category_scores_gemma":[0.008479152,0.001588222,0.0025919715,0.0065781167,0.008064169,0.018567637,0.00409622,0.009788668,0.0034754022],"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.000011598411,0.000022567374,0.00008344336,0.00019544658,0.000013978405,0.00004965071,0.00030858637,0.0010154791,0.00038640233,0.9676482,0.009611293,0.020653354],"study_design_scores_gemma":[0.0000063574885,0.000016851718,0.000086835724,0.00008756445,0.000010565135,0.00015297209,0.00005143752,0.002749929,0.0001761682,0.9084898,0.08814475,0.000026741915],"about_ca_topic_score_codex":0.0018316497,"about_ca_topic_score_gemma":0.0017590683,"teacher_disagreement_score":0.008975367,"about_ca_system_score_codex":0.0024777446,"about_ca_system_score_gemma":0.0016855749,"threshold_uncertainty_score":0.030025542},"labels":[],"label_agreement":null},{"id":"W1991263747","doi":"10.1016/j.tcs.2014.09.005","title":"Brushing with additional cleaning restrictions","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowym Centrum Nauki; Ryerson University","keywords":"Brush; Traverse; Graph; Vertex (graph theory); Computer science; Combinatorics; Mathematics; Theoretical computer science; Engineering; Cartography; Mechanical engineering; Geography","score_opus":0.00951835568800899,"score_gpt":0.2215320800433167,"score_spread":0.21201372435530771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991263747","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.038207658,0.00044545397,0.9136978,0.00063485,0.0007682964,0.00018921314,0.0005711988,0.0050844555,0.040401183],"genre_scores_gemma":[0.39369303,0.0006052743,0.52294517,0.0007881387,0.0003442191,0.000377486,0.0018778183,0.005182262,0.07418665],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836284,0.00018049055,0.00013591995,0.0004596727,0.00060326164,0.00025775345],"domain_scores_gemma":[0.99210864,0.0015973072,0.00020910721,0.004966298,0.00069483515,0.00042381964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012095338,0.0011366664,0.0021151952,0.0016653158,0.0019309408,0.0027954439,0.0025176827,0.0024230015,0.048686836],"category_scores_gemma":[0.010714517,0.0010508758,0.0019158873,0.0017396458,0.001662659,0.005865825,0.0045465194,0.0039057564,0.0074755414],"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.0009460297,0.0007181718,0.0017173683,0.0009656531,0.00013665853,0.0006887779,0.0006294547,0.04022776,0.076624036,0.33050412,0.036027547,0.5108145],"study_design_scores_gemma":[0.00015753997,0.00026243905,0.0014259131,0.00021661115,0.00012982968,0.0008468615,0.0003814251,0.31175023,0.049268935,0.5388453,0.096590586,0.00012430103],"about_ca_topic_score_codex":0.0012663195,"about_ca_topic_score_gemma":0.0024053599,"teacher_disagreement_score":0.048686836,"about_ca_system_score_codex":0.0004477529,"about_ca_system_score_gemma":0.0007899612,"threshold_uncertainty_score":0.16287369},"labels":[],"label_agreement":null},{"id":"W1991356098","doi":"10.1016/j.tcs.2013.04.015","title":"Fast–mixed searching and related problems on graphs","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Mixed graph; Combinatorics; Search algorithm; Graph; Degree (music); Search problem; Planar graph; Computer science; Discrete mathematics; Algorithm; Line graph","score_opus":0.01041735476262332,"score_gpt":0.23739648023326881,"score_spread":0.2269791254706455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991356098","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.12267096,0.004466676,0.8446998,0.004812536,0.00026258256,0.00019720107,0.00085408916,0.00058825826,0.021447867],"genre_scores_gemma":[0.5310046,0.0021818408,0.4293758,0.0010246093,0.0005416881,0.0004529687,0.0012681236,0.0007258244,0.033424597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770314,0.0012576331,0.00009091833,0.00042399604,0.00032031038,0.00020413828],"domain_scores_gemma":[0.98131025,0.014965718,0.0010744492,0.0013079556,0.0007317644,0.0006098933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034011914,0.0014983311,0.0025211496,0.0024617421,0.0019983249,0.0040245536,0.0038871637,0.0038044127,0.012342917],"category_scores_gemma":[0.021722605,0.0014840149,0.0015453236,0.0039778203,0.0030528377,0.011554125,0.0034269027,0.0037148776,0.0009120518],"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.0005900042,0.00024000158,0.00093016255,0.00077106134,0.0001340567,0.00013202253,0.00030981583,0.20642997,0.0014006273,0.704616,0.014265317,0.07018093],"study_design_scores_gemma":[0.000076260134,0.000057441495,0.00019031564,0.00004366311,0.000030253439,0.000105933585,0.00008797803,0.2831273,0.0006224465,0.71278256,0.0028541957,0.0000216331],"about_ca_topic_score_codex":0.0024184748,"about_ca_topic_score_gemma":0.0026838852,"teacher_disagreement_score":0.012342917,"about_ca_system_score_codex":0.0021909862,"about_ca_system_score_gemma":0.0013163496,"threshold_uncertainty_score":0.041291237},"labels":[],"label_agreement":null},{"id":"W1991566967","doi":"10.1016/j.tcs.2014.09.045","title":"Primal–dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Beijing University of Technology; Beijing Municipal Commission of Education; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Facility location problem; Approximation algorithm; Dual (grammatical number); Oracle; Mathematical optimization; Greedy algorithm; Computer science; Algorithm; Stochastic approximation; Mathematics; Key (lock)","score_opus":0.0283460097376509,"score_gpt":0.24316872452961064,"score_spread":0.21482271479195975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991566967","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.0100246845,0.00033694113,0.98466486,0.0004659058,0.00010820553,0.00009299645,0.00011698268,0.000265485,0.003923846],"genre_scores_gemma":[0.26855445,0.00034500464,0.7233692,0.0004343038,0.00015820247,0.00045751172,0.0005082664,0.00020609146,0.0059670014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875665,0.0005637291,0.000042757507,0.00017833342,0.00025380007,0.00020471],"domain_scores_gemma":[0.9982949,0.001087911,0.00011153022,0.00012644782,0.00021740205,0.00016182981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002498561,0.0012408344,0.0025455712,0.0011341523,0.000734841,0.0021661413,0.0028217754,0.00247305,0.007043283],"category_scores_gemma":[0.0038638648,0.0010892043,0.0012105746,0.0015642062,0.0010264864,0.0017958089,0.002420954,0.002953732,0.0010883373],"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.0003677429,0.0003983939,0.00065028516,0.0002705736,0.00010365505,0.00012849235,0.000081414575,0.87217426,0.001181729,0.053228647,0.009274467,0.062140305],"study_design_scores_gemma":[0.000044098022,0.000028160546,0.000055019955,0.000009350382,0.000008775239,0.00002360915,0.000010814189,0.99172896,0.00011062141,0.0074742413,0.000501427,0.0000049565965],"about_ca_topic_score_codex":0.004774579,"about_ca_topic_score_gemma":0.004415151,"teacher_disagreement_score":0.007043283,"about_ca_system_score_codex":0.001933293,"about_ca_system_score_gemma":0.0031119566,"threshold_uncertainty_score":0.023562074},"labels":[],"label_agreement":null},{"id":"W1991636160","doi":"10.1016/s0304-3975(02)00070-1","title":"McNaughton families of languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Chomsky hierarchy; Rewriting; Abstract family of languages; Formal language; String (physics); Closure (psychology); Hierarchy; Recursively enumerable language; Class (philosophy); Cone (formal languages); Complexity class; Confluence; Computer science; Mathematics; Turing machine; Regular language; Language family; Context (archaeology); Automaton; Linguistics; Discrete mathematics; Theoretical computer science; Programming language; Artificial intelligence; Time complexity; Second-generation programming language","score_opus":0.005738167963395646,"score_gpt":0.23805565448284552,"score_spread":0.23231748651944986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991636160","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.25482905,0.005842888,0.34347394,0.011781748,0.0006421947,0.00015615828,0.0011950039,0.0010154477,0.3810636],"genre_scores_gemma":[0.86654544,0.0017011603,0.04297402,0.0014129279,0.0007073906,0.00022269745,0.00049635407,0.00021716802,0.08572277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868566,0.0002662054,0.000071680806,0.00037741716,0.0004072447,0.00019180548],"domain_scores_gemma":[0.99428684,0.003752438,0.00028269485,0.00067156926,0.00055796717,0.00044859713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015769461,0.00065643975,0.0010834334,0.0033837284,0.005080114,0.0043728617,0.0014371393,0.0015431402,0.018786892],"category_scores_gemma":[0.007107511,0.00085267756,0.0011991863,0.002400671,0.0040685744,0.010850644,0.002417758,0.002086971,0.0014709431],"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.000018414612,0.0000043270747,0.00010705565,0.0000133396725,0.000003532215,0.000058026075,0.00021127492,0.00017487933,0.00015805046,0.9958047,0.0010773623,0.0023690492],"study_design_scores_gemma":[0.00001701905,0.0000068551944,0.00012474728,0.0000116166575,0.000009077415,0.00025997483,0.00008958847,0.0014504706,0.00027543868,0.98752534,0.01021631,0.0000137075185],"about_ca_topic_score_codex":0.0020857835,"about_ca_topic_score_gemma":0.0024315964,"teacher_disagreement_score":0.018786892,"about_ca_system_score_codex":0.0029863124,"about_ca_system_score_gemma":0.0011555733,"threshold_uncertainty_score":0.06284839},"labels":[],"label_agreement":null},{"id":"W1991824730","doi":"10.1016/j.tcs.2012.10.021","title":"Pseudospectra of exponential matrix polynomials","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; University of Otago; Curtin University of Technology; University of Canberra; University of New South Wales; Australian National University","keywords":"Matrix exponential; Mathematics; Exponential polynomial; Computation; Exponential function; Matrix (chemical analysis); Polynomial matrix; Nonlinear system; Applied mathematics; Polynomial; Matrix polynomial; Mathematical analysis; Algorithm; Differential equation","score_opus":0.008775717508541392,"score_gpt":0.26133501721195834,"score_spread":0.25255929970341695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991824730","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.3973186,0.001497736,0.4882658,0.0028774098,0.0010324158,0.00009109512,0.0005601113,0.0007144906,0.10764236],"genre_scores_gemma":[0.9330542,0.0011291456,0.028599765,0.0009074511,0.0013805731,0.00009131834,0.00037155318,0.00031568002,0.0341503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998256,0.00046296208,0.00006208037,0.0002897068,0.00066750066,0.00026164544],"domain_scores_gemma":[0.9931676,0.003658596,0.0006944778,0.00071865466,0.0011272391,0.0006334664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011483064,0.0012065443,0.00060411345,0.0024764119,0.0012806992,0.0026887294,0.0011631731,0.001184012,0.011751797],"category_scores_gemma":[0.010461797,0.00060598704,0.0006698926,0.0016329025,0.002999301,0.00569981,0.0024297498,0.0031367242,0.001819626],"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.00004909928,0.000032862874,0.00027882104,0.000028199485,0.0000061746923,0.000110137174,0.00018092484,0.0013862514,0.0011933708,0.9870243,0.0013631055,0.008346877],"study_design_scores_gemma":[0.000011841626,0.000028774808,0.00027278112,0.000014731661,0.0000050806107,0.00022837406,0.000046844452,0.0110981595,0.000789822,0.9853791,0.0021012365,0.000023212764],"about_ca_topic_score_codex":0.00037111927,"about_ca_topic_score_gemma":0.00044329598,"teacher_disagreement_score":0.011751797,"about_ca_system_score_codex":0.0008589281,"about_ca_system_score_gemma":0.0007431329,"threshold_uncertainty_score":0.039313674},"labels":[],"label_agreement":null},{"id":"W1992110345","doi":"10.1016/j.tcs.2011.04.048","title":"Advances in discrete geometry","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","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":"Université du Québec à Montréal","funders":"","keywords":"Geometry; Discrete geometry; Mathematics; Computer science","score_opus":0.012261837496204514,"score_gpt":0.25486463940089926,"score_spread":0.24260280190469474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992110345","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.015859563,0.13556872,0.47052357,0.021982493,0.021927113,0.00010317253,0.00078831194,0.00082249765,0.3324246],"genre_scores_gemma":[0.31338662,0.1532912,0.2448141,0.0036772145,0.021900557,0.00021818276,0.0012507979,0.00091813353,0.2605432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923563,0.00015940775,0.00003989198,0.0001580371,0.00035522017,0.000051808514],"domain_scores_gemma":[0.9988675,0.00039492577,0.000040200775,0.00030263912,0.00027842054,0.00011627467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010384322,0.0008335968,0.0012255528,0.0023106346,0.00086707005,0.0025590628,0.0010372541,0.0010387815,0.014348988],"category_scores_gemma":[0.002429521,0.0004571298,0.00070860767,0.0025096785,0.0024064826,0.0029053534,0.0024976055,0.003550484,0.0053029456],"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.00001632632,0.000022548806,0.00013722747,0.00019018073,0.00001377097,0.000025582622,0.000098213655,0.0023445182,0.00088293466,0.8854726,0.022439316,0.0883568],"study_design_scores_gemma":[0.000014676246,0.000028198996,0.00040338244,0.0001131142,0.000016078126,0.00016128182,0.000061511615,0.0122242095,0.0011468296,0.54342145,0.44239357,0.00001573497],"about_ca_topic_score_codex":0.00107272,"about_ca_topic_score_gemma":0.0009830296,"teacher_disagreement_score":0.014348988,"about_ca_system_score_codex":0.0018365487,"about_ca_system_score_gemma":0.0011977599,"threshold_uncertainty_score":0.048002124},"labels":[],"label_agreement":null},{"id":"W1992151876","doi":"10.1016/j.tcs.2009.08.024","title":"Repetitions in strings: Algorithms and combinatorics","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Substring; Conjecture; Mathematics; Combinatorics on words; Combinatorics; String (physics); Compression (physics); Algorithm; Discrete mathematics; Computer science; Data structure; Word (group theory)","score_opus":0.007594207663506966,"score_gpt":0.2477842159550935,"score_spread":0.24019000829158654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992151876","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.071354285,0.017620178,0.86335886,0.0060987887,0.00075713434,0.00013595473,0.0006908457,0.0015000149,0.03848395],"genre_scores_gemma":[0.5472813,0.016619448,0.39785066,0.0016509197,0.003048581,0.0005103862,0.0016434307,0.0010319873,0.030363353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947733,0.0019822586,0.00046449283,0.0010362354,0.0014631585,0.00028054861],"domain_scores_gemma":[0.97504824,0.020066282,0.0011563416,0.0027190144,0.00072418,0.00028604135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030479957,0.0011070342,0.0018962881,0.0040693204,0.0021964556,0.0075235446,0.0027140845,0.003330255,0.00851416],"category_scores_gemma":[0.020909183,0.0013230754,0.0016750155,0.008522545,0.006007518,0.016244737,0.0028869307,0.0049522817,0.0023893008],"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.00008104601,0.000046054338,0.0005927471,0.00024913793,0.00002920376,0.00009955083,0.0003589527,0.00679243,0.00061551365,0.92492354,0.004155209,0.06205646],"study_design_scores_gemma":[0.000011696373,0.000010920554,0.00008677458,0.000038319635,0.0000148336485,0.00016801748,0.000043076365,0.011608745,0.0005562518,0.98231125,0.005134972,0.000015107071],"about_ca_topic_score_codex":0.00060957327,"about_ca_topic_score_gemma":0.0007655031,"teacher_disagreement_score":0.00851416,"about_ca_system_score_codex":0.0019895516,"about_ca_system_score_gemma":0.0012265794,"threshold_uncertainty_score":0.028482735},"labels":[],"label_agreement":null},{"id":"W1992381397","doi":"10.1016/j.tcs.2007.03.025","title":"A note on the number of squares in a word","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":65,"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":"Centre National de la Recherche Scientifique","keywords":"Mathematics; Word (group theory); Combinatorics; Bounded function; String (physics); Upper and lower bounds; Word length; Least-squares function approximation; Discrete mathematics; Statistics; Computer science","score_opus":0.011050063721280442,"score_gpt":0.28660153913440206,"score_spread":0.27555147541312164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992381397","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.016506758,0.0364929,0.7071929,0.052683763,0.05767852,0.00009679758,0.0009824262,0.0015141746,0.12685187],"genre_scores_gemma":[0.253312,0.02505446,0.55895334,0.013801996,0.057974953,0.00045868987,0.0010238035,0.0031048283,0.08631586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918132,0.0024146563,0.0008783144,0.0019745005,0.0025185265,0.00040082328],"domain_scores_gemma":[0.9381707,0.04923726,0.0009428525,0.007304595,0.0034658394,0.0008787502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047700927,0.002216392,0.0027570417,0.0036276681,0.0032090382,0.004545402,0.004924653,0.0040999292,0.013812605],"category_scores_gemma":[0.044357818,0.0013401174,0.0022255946,0.005922333,0.013987631,0.02239667,0.0054302565,0.014244965,0.005619144],"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.00033256583,0.00003475908,0.0006408528,0.00049030804,0.00003996215,0.0003635933,0.00037801324,0.0043213903,0.0020325475,0.8338708,0.058918048,0.09857699],"study_design_scores_gemma":[0.000015625403,0.000042618656,0.00024545586,0.00008713047,0.00003434628,0.00044828668,0.00008214429,0.009510547,0.0017851922,0.9238437,0.063846596,0.000058338363],"about_ca_topic_score_codex":0.001655211,"about_ca_topic_score_gemma":0.0021932037,"teacher_disagreement_score":0.013812605,"about_ca_system_score_codex":0.0020237167,"about_ca_system_score_gemma":0.0010962485,"threshold_uncertainty_score":0.046207726},"labels":[],"label_agreement":null},{"id":"W1992540913","doi":"10.1016/j.tcs.2009.11.015","title":"Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Niche; Mathematical economics; Bayesian probability; Economics; Equilibrium selection; Bayesian game; Computer science; Routing (electronic design automation); Mathematics; Mathematical optimization; Evolutionary biology; Theoretical computer science; Game theory; Artificial intelligence; Biology; Ecology; Repeated game","score_opus":0.03453562216005108,"score_gpt":0.3365466295953586,"score_spread":0.3020110074353075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992540913","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.50034773,0.0004884172,0.46038088,0.00325552,0.000044303873,0.0001238748,0.00014685685,0.00011938,0.035093155],"genre_scores_gemma":[0.9683271,0.00035207017,0.024332538,0.00017461544,0.000051407056,0.000089298555,0.00005515014,0.00003046348,0.0065874145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852103,0.0008290635,0.000047410675,0.00019545744,0.00014835199,0.0002587349],"domain_scores_gemma":[0.9937298,0.00433625,0.00068231276,0.00030402764,0.00033548998,0.0006120384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028705988,0.0005075316,0.0016996242,0.0009848609,0.0010257981,0.0024283552,0.0015361147,0.0028449246,0.004938902],"category_scores_gemma":[0.014945204,0.00062744453,0.00096691184,0.0008771586,0.0025080803,0.0044797594,0.0019960077,0.001488841,0.0004404137],"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.00017556979,0.00013515534,0.0030476928,0.00016088434,0.000092592396,0.0003581569,0.0007733544,0.11168879,0.0025081967,0.86136067,0.0025063877,0.017192584],"study_design_scores_gemma":[0.00007337543,0.000055933255,0.0015224984,0.000021522586,0.000032628504,0.00029855274,0.00026144797,0.31818607,0.00026258576,0.67797476,0.0012791553,0.00003149581],"about_ca_topic_score_codex":0.0029069162,"about_ca_topic_score_gemma":0.0031810785,"teacher_disagreement_score":0.004938902,"about_ca_system_score_codex":0.0015024322,"about_ca_system_score_gemma":0.0012233101,"threshold_uncertainty_score":0.016522288},"labels":[],"label_agreement":null},{"id":"W1993035157","doi":"10.1016/s0304-3975(02)00412-7","title":"On the equational definition of the least prefixed point","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Monotonic function; Modal; Normal modal logic; Property (philosophy); Modal μ-calculus; Function (biology); Extension (predicate logic); Term (time); Calculus (dental); Modal logic; Pure mathematics; Algebra over a field; Mathematical analysis; Computer science","score_opus":0.029883401479813165,"score_gpt":0.23467898251600472,"score_spread":0.20479558103619155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993035157","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.017216692,0.002626406,0.9115337,0.007948243,0.00094215147,0.00007358874,0.00039631553,0.0003112853,0.05895159],"genre_scores_gemma":[0.47534016,0.0048895045,0.4837452,0.006555797,0.0029324582,0.00047240872,0.0012596947,0.0008921616,0.023912683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946852,0.001951668,0.0006304584,0.001194974,0.0011219956,0.00041569624],"domain_scores_gemma":[0.9922376,0.0043592383,0.00032304926,0.0013429178,0.0014689226,0.00026818248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007934916,0.0010214589,0.0016414688,0.0028841756,0.0030439296,0.0061422675,0.003939671,0.0038897586,0.0077208243],"category_scores_gemma":[0.014226571,0.0016588459,0.0027874715,0.004034238,0.017040996,0.035806146,0.007458829,0.014249768,0.0021891764],"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.000010862518,0.000004693454,0.000043140528,0.000017622866,0.0000032921255,0.000016087293,0.00015125614,0.00019541636,0.00013459325,0.99686605,0.0005871679,0.0019698117],"study_design_scores_gemma":[0.000008481283,0.000008316971,0.00004134687,0.000020976946,0.000008626263,0.000045742945,0.000045577042,0.0012525914,0.00018990507,0.99344385,0.0049229423,0.000011682334],"about_ca_topic_score_codex":0.0018468695,"about_ca_topic_score_gemma":0.0014106662,"teacher_disagreement_score":0.007934916,"about_ca_system_score_codex":0.0026286705,"about_ca_system_score_gemma":0.0015845394,"threshold_uncertainty_score":0.041964352},"labels":[],"label_agreement":null},{"id":"W1993294649","doi":"10.1016/j.tcs.2013.09.031","title":"Succinct encoding of arbitrary graphs","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Constant (computer programming); Vertex (graph theory); Discrete mathematics; Multiplicative function; Graph; Computer science","score_opus":0.007668647300515955,"score_gpt":0.227461928451841,"score_spread":0.21979328115132504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993294649","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.14191024,0.0018556596,0.80035144,0.006337172,0.0006253127,0.0002532426,0.006450955,0.004318175,0.037897926],"genre_scores_gemma":[0.73228115,0.0015206657,0.2398749,0.0012317199,0.00027715784,0.00037305336,0.008138641,0.0010135374,0.015289122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871945,0.0003725681,0.000094867006,0.00018148255,0.000467499,0.00016413152],"domain_scores_gemma":[0.994163,0.0026865085,0.0002685763,0.0021190187,0.00061123696,0.00015159546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008481931,0.0007056547,0.0006849882,0.0009860233,0.0006372131,0.002060495,0.0015570429,0.0010741027,0.0056060427],"category_scores_gemma":[0.0063541676,0.00043496373,0.0005192358,0.002075113,0.0011739128,0.0049177944,0.0024029477,0.0025144778,0.0010139665],"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.0009182695,0.00026461246,0.0006035267,0.00038525902,0.000036227975,0.00040084962,0.00055596465,0.06865688,0.0091003105,0.7017086,0.025409073,0.19196042],"study_design_scores_gemma":[0.000097736156,0.00005927348,0.00019038208,0.00011108797,0.0000363563,0.00018601835,0.00011910239,0.12885801,0.010382502,0.84321135,0.016719958,0.000028125603],"about_ca_topic_score_codex":0.0013793455,"about_ca_topic_score_gemma":0.0027505804,"teacher_disagreement_score":0.0056060427,"about_ca_system_score_codex":0.001374887,"about_ca_system_score_gemma":0.0015019965,"threshold_uncertainty_score":0.018754125},"labels":[],"label_agreement":null},{"id":"W1993886628","doi":"10.1016/j.tcs.2008.12.049","title":"Affine systems of equations and counting infinitary logic","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Unary operation; Discrete mathematics; Constraint satisfaction problem; Affine transformation; Counting problem; Abelian group; Datalog; Algebra over a field; Pure mathematics; Computer science; Theoretical computer science","score_opus":0.012769188734151954,"score_gpt":0.24341795040036762,"score_spread":0.23064876166621567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993886628","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.13208124,0.0027348618,0.7881167,0.0034411976,0.0003947101,0.00008405562,0.0004892545,0.00058161945,0.07207637],"genre_scores_gemma":[0.8458491,0.0013909457,0.12571928,0.0006491707,0.0005800841,0.0001363258,0.0007620943,0.00016914487,0.024743788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784124,0.0007934657,0.0002020841,0.00036923485,0.000546118,0.00024780084],"domain_scores_gemma":[0.9950051,0.003409301,0.00041315344,0.00043002723,0.0005496006,0.00019280634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039905,0.00088106876,0.0011333654,0.0019128888,0.0018322068,0.0041075647,0.0023588615,0.0011577455,0.0084380675],"category_scores_gemma":[0.009257187,0.0009706828,0.0017608847,0.0030535723,0.0050595063,0.00669776,0.002557627,0.004855818,0.00071581855],"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.000008165184,0.000009310947,0.0001398678,0.00001893795,0.0000065872546,0.000020761041,0.00007687166,0.0016898193,0.00009583699,0.99488837,0.00045916226,0.0025862977],"study_design_scores_gemma":[0.0000042931474,0.00000215269,0.00004296275,0.000004225049,0.0000051981333,0.000011187533,0.000013037271,0.0057036756,0.00009415795,0.99339736,0.00071687496,0.0000049104524],"about_ca_topic_score_codex":0.005451149,"about_ca_topic_score_gemma":0.0075741797,"teacher_disagreement_score":0.0084380675,"about_ca_system_score_codex":0.0028636914,"about_ca_system_score_gemma":0.0012738428,"threshold_uncertainty_score":0.028228164},"labels":[],"label_agreement":null},{"id":"W1994077047","doi":"10.1016/j.tcs.2008.05.014","title":"Solving structured linear systems with large displacement rank","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"CHIST-ERA; Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA); Microsoft Research","keywords":"Vandermonde matrix; Mathematics; Toeplitz matrix; Rank (graph theory); Logarithm; Interpolation (computer graphics); Exponent; Matrix (chemical analysis); Displacement (psychology); Multiplication (music); Cauchy distribution; Applied mathematics; Combinatorics; Pure mathematics; Mathematical analysis; Computer science; Motion (physics)","score_opus":0.008182856888058834,"score_gpt":0.2243535310446579,"score_spread":0.21617067415659907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994077047","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.09626761,0.00023693203,0.8884631,0.0009934597,0.00015561501,0.000099500656,0.00030505733,0.0010041312,0.012474712],"genre_scores_gemma":[0.7227593,0.00018065283,0.2606223,0.00027961467,0.00013823196,0.00016034654,0.0005845476,0.00024568645,0.015029328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995585,0.000108297376,0.000016923232,0.00007841539,0.00018060349,0.000057239093],"domain_scores_gemma":[0.9982218,0.0012668563,0.000095512216,0.00019301084,0.00015606022,0.00006670321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003902414,0.0006345529,0.0006812708,0.00033622005,0.0004508955,0.00078652886,0.0007342978,0.0010951526,0.0118374545],"category_scores_gemma":[0.0039370917,0.000557824,0.00041492342,0.0005608711,0.0008107654,0.0017333514,0.0016541784,0.0016175229,0.0011914445],"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.00028077388,0.00014694722,0.00095851877,0.0005418193,0.00008177784,0.00034275974,0.0002491396,0.7461213,0.010502981,0.084295794,0.014176619,0.14230168],"study_design_scores_gemma":[0.00007034342,0.00007934496,0.00009783574,0.000008227849,0.000008181855,0.000046312187,0.00009782044,0.9444661,0.0029311897,0.050549027,0.0016373119,0.000008277133],"about_ca_topic_score_codex":0.0016219667,"about_ca_topic_score_gemma":0.004376303,"teacher_disagreement_score":0.0118374545,"about_ca_system_score_codex":0.00035151266,"about_ca_system_score_gemma":0.00095816766,"threshold_uncertainty_score":0.039600253},"labels":[],"label_agreement":null},{"id":"W1994084299","doi":"10.1016/j.tcs.2004.11.003","title":"The generative capacity of block-synchronized context-free grammars","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Language family; Tree-adjoining grammar; Rule-based machine translation; Nesting (process); Computer science; Mathematics; Block (permutation group theory); Context (archaeology); Generative grammar; Context-free language; Programming language; Discrete mathematics; Context-free grammar; Combinatorics; Artificial intelligence; Linguistics; Geography","score_opus":0.010678476020316978,"score_gpt":0.22125262563059822,"score_spread":0.21057414961028123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994084299","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.62985337,0.00064787944,0.32007942,0.0018461252,0.00007819454,0.00006832045,0.000887859,0.00084852945,0.04569035],"genre_scores_gemma":[0.98796785,0.00023074789,0.007419219,0.00010536506,0.000087548535,0.00007102274,0.00027625257,0.00013883502,0.0037031656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977188,0.0009785563,0.0001314331,0.00034330986,0.00045879168,0.00036913392],"domain_scores_gemma":[0.96115017,0.033196773,0.0011351699,0.002326813,0.0012405136,0.0009505862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029940212,0.0004488959,0.0011644019,0.0011667991,0.0009179434,0.002896194,0.0016848752,0.0013551462,0.01055504],"category_scores_gemma":[0.018156841,0.000898137,0.0007967857,0.0011122789,0.0041172,0.0062471176,0.0027111215,0.0014972292,0.0011245811],"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.00019623143,0.000037187732,0.0005828638,0.00007878591,0.000021049998,0.0001422907,0.00074269285,0.027539654,0.0044339234,0.95940965,0.0007178039,0.0060978835],"study_design_scores_gemma":[0.000032676424,0.000021033318,0.0001766383,0.00001004683,0.000014138553,0.000046674424,0.00005191503,0.07253375,0.0011729379,0.92523855,0.0006816046,0.000019981251],"about_ca_topic_score_codex":0.0016238218,"about_ca_topic_score_gemma":0.0010144317,"teacher_disagreement_score":0.01055504,"about_ca_system_score_codex":0.0010582735,"about_ca_system_score_gemma":0.0014862472,"threshold_uncertainty_score":0.03531009},"labels":[],"label_agreement":null},{"id":"W1994325523","doi":"10.1016/j.tcs.2012.05.014","title":"polish—Let us play the cleaning game","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Graph; Vertex (graph theory); Mathematics; Complete bipartite graph; Discrete mathematics; Computer science","score_opus":0.021243932082185567,"score_gpt":0.28496814932973086,"score_spread":0.2637242172475453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994325523","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.28484708,0.0007939978,0.3221418,0.028489215,0.002367122,0.000927934,0.0016143511,0.004461925,0.35435665],"genre_scores_gemma":[0.7506116,0.0004966486,0.06517378,0.0028321203,0.000080643134,0.00033341759,0.00081922184,0.0007066462,0.17894587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976224,0.000035298995,0.000013627665,0.00005411452,0.00006198021,0.00007273402],"domain_scores_gemma":[0.9997787,0.00004418305,0.000015703385,0.000045268145,0.0000379733,0.00007813195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003542178,0.00087676034,0.0006869828,0.00022442002,0.0015604909,0.0020325186,0.0009237684,0.0016284528,0.03794448],"category_scores_gemma":[0.002176459,0.0004107125,0.0005738788,0.00020182804,0.0013763391,0.0038698502,0.0022046922,0.002856473,0.0075901933],"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.0033313902,0.00065024407,0.003791817,0.00061742176,0.0002665394,0.0013825635,0.008610774,0.0075517264,0.03299715,0.7110719,0.093681574,0.1360469],"study_design_scores_gemma":[0.00034323338,0.0010090664,0.004565582,0.00017688135,0.00012018593,0.0006653883,0.009639638,0.02943763,0.014778392,0.44496882,0.4941037,0.00019150603],"about_ca_topic_score_codex":0.0046663005,"about_ca_topic_score_gemma":0.004638188,"teacher_disagreement_score":0.03794448,"about_ca_system_score_codex":0.0004227101,"about_ca_system_score_gemma":0.00054296176,"threshold_uncertainty_score":0.12693691},"labels":[],"label_agreement":null},{"id":"W1994512037","doi":"10.1016/s0304-3975(01)00263-8","title":"Density via duality","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Homomorphism; Mathematics; Duality (order theory); Partially ordered set; Directed graph; Combinatorics; Discrete mathematics","score_opus":0.024775744892119242,"score_gpt":0.28839810292029566,"score_spread":0.2636223580281764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994512037","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.10858604,0.003311875,0.32578608,0.015918951,0.0016261132,0.00016839681,0.00093078957,0.00079316174,0.5428785],"genre_scores_gemma":[0.84755564,0.0029274705,0.036044415,0.0033450192,0.00254868,0.00040236465,0.00072163506,0.00072957214,0.10572518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881244,0.0003398594,0.000042862986,0.0002676669,0.000338223,0.00019886253],"domain_scores_gemma":[0.9978629,0.0010634792,0.00014377612,0.00028118014,0.00032412747,0.0003244692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011285308,0.0009564201,0.0018512656,0.0038546752,0.0033283764,0.004897115,0.0016587828,0.0020573696,0.01906773],"category_scores_gemma":[0.0059917187,0.00092817476,0.0014554323,0.0026972357,0.004486683,0.010043527,0.0065151495,0.0065568592,0.0025980994],"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.000005177973,0.0000061311707,0.000022342821,0.000010700552,0.000001959819,0.000005703293,0.000038812435,0.00009617857,0.000053924334,0.9972914,0.0011027165,0.0013648928],"study_design_scores_gemma":[0.0000034530801,0.0000020070538,0.000028938628,0.000004475911,0.0000026936148,0.00002978168,0.00001606235,0.00087722886,0.000053192438,0.9973908,0.0015886683,0.0000028256475],"about_ca_topic_score_codex":0.0010155559,"about_ca_topic_score_gemma":0.00053365086,"teacher_disagreement_score":0.01906773,"about_ca_system_score_codex":0.0023697228,"about_ca_system_score_gemma":0.0009443869,"threshold_uncertainty_score":0.06378794},"labels":[],"label_agreement":null},{"id":"W1995186768","doi":"10.1016/j.tcs.2010.10.030","title":"Succinct representation of dynamic trees","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Node (physics); Tree (set theory); Computer science; Constant (computer programming); Binary tree; Combinatorics; Enhanced Data Rates for GSM Evolution; Logarithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.006760893345757082,"score_gpt":0.2726541615227393,"score_spread":0.2658932681769822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995186768","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.044336777,0.0008943327,0.934008,0.0010740142,0.0002276512,0.00012229693,0.0040910034,0.0021347327,0.013111203],"genre_scores_gemma":[0.54674965,0.0015682462,0.42465052,0.00047591413,0.00023262142,0.00038936367,0.010583298,0.0008573361,0.014492963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903023,0.00018253029,0.00009039146,0.00014391604,0.00044074564,0.00011213933],"domain_scores_gemma":[0.9972806,0.0009995556,0.00019648002,0.00092532515,0.0004976378,0.000100376776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005714148,0.00056445977,0.0006747845,0.0015738913,0.00051903987,0.00248941,0.0014929092,0.0011288008,0.008175014],"category_scores_gemma":[0.005117015,0.00043288415,0.00043802222,0.0029205699,0.0007985876,0.004754559,0.001946054,0.0019411203,0.0017758919],"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.00047104066,0.00016005516,0.00057068205,0.00035488143,0.000027559154,0.00039074075,0.00054019963,0.08332079,0.009984559,0.6435267,0.018831184,0.24182172],"study_design_scores_gemma":[0.00005881873,0.000064007465,0.00022513703,0.0001262767,0.000028247869,0.00032948676,0.00015094904,0.29116318,0.0077139777,0.6707683,0.02933673,0.000034870387],"about_ca_topic_score_codex":0.0010791112,"about_ca_topic_score_gemma":0.0020328483,"teacher_disagreement_score":0.008175014,"about_ca_system_score_codex":0.00091519376,"about_ca_system_score_gemma":0.00086734485,"threshold_uncertainty_score":0.02734816},"labels":[],"label_agreement":null},{"id":"W1995730325","doi":"10.1016/j.tcs.2011.04.012","title":"Continuity of operators on continuous and discrete time streams","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Swansea University","keywords":"Hadamard transform; Metric space; Computer science; Theoretical computer science; Discrete space; Spacetime; Metric (unit); Range (aeronautics); STREAMS; Discrete time and continuous time; Semantics (computer science); Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Programming language; Mathematical analysis","score_opus":0.009724069923910086,"score_gpt":0.22600280106757506,"score_spread":0.21627873114366497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995730325","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.15063944,0.0019393588,0.8290048,0.0018117009,0.00025357332,0.00006516372,0.000307761,0.00022043801,0.015757699],"genre_scores_gemma":[0.8483759,0.0020714828,0.13311623,0.00042500056,0.0006710987,0.00018892068,0.00045034318,0.00017954737,0.014521495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966904,0.0008273761,0.00028918622,0.00075558806,0.001097321,0.00034005323],"domain_scores_gemma":[0.97440004,0.018852396,0.001468079,0.0015098279,0.002128952,0.0016406565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050877547,0.00076284073,0.0011111214,0.002779151,0.0014034376,0.0051304055,0.0019388517,0.0016101418,0.004122463],"category_scores_gemma":[0.027387576,0.00093430316,0.001430549,0.0025913196,0.005783431,0.014774381,0.0034886026,0.0042420686,0.00030649954],"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.00007985601,0.00002136926,0.0004147194,0.00003844131,0.000013724512,0.00012709651,0.00039801537,0.0029827333,0.0005716129,0.99035954,0.0002159584,0.0047767675],"study_design_scores_gemma":[0.00003172875,0.000034222685,0.00036918672,0.000020729909,0.000017002008,0.00015372456,0.00016013508,0.037966646,0.00052340043,0.9590681,0.0016397903,0.000015268302],"about_ca_topic_score_codex":0.002063914,"about_ca_topic_score_gemma":0.0010764832,"teacher_disagreement_score":0.0051304055,"about_ca_system_score_codex":0.0021533403,"about_ca_system_score_gemma":0.0013763562,"threshold_uncertainty_score":0.026906908},"labels":[],"label_agreement":null},{"id":"W1995777777","doi":"10.1016/j.tcs.2007.07.034","title":"Transition complexity of language operations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transition (genetics); Computer science; Programming language; Theoretical computer science; Linguistics; Chemistry; Philosophy","score_opus":0.015023758854855974,"score_gpt":0.26985739425449723,"score_spread":0.25483363539964127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995777777","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.65214944,0.0012126112,0.29834488,0.0041177347,0.00013373962,0.00009641029,0.0011012874,0.00050175877,0.04234213],"genre_scores_gemma":[0.9855517,0.00035034295,0.009274881,0.00012572046,0.00017456319,0.00008384889,0.00045827377,0.0000701006,0.00391061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678147,0.00079807895,0.0002088599,0.00070771377,0.00096113957,0.0005426377],"domain_scores_gemma":[0.968765,0.026171006,0.00108214,0.0016418678,0.0012751995,0.0010648576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019713421,0.0005160423,0.0012254496,0.0026711253,0.0014541633,0.0068402844,0.0015153945,0.001595622,0.008665583],"category_scores_gemma":[0.016137263,0.0006115705,0.0015139824,0.0027615288,0.0037586086,0.01605074,0.0026880698,0.004227828,0.00063797424],"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.00011466624,0.000035887067,0.00080650894,0.00005111283,0.000014972572,0.00006916285,0.0005004334,0.005806909,0.00082535093,0.9845308,0.00075335667,0.006490764],"study_design_scores_gemma":[0.000012083592,0.000012051207,0.00033605043,0.000006076359,0.00001141301,0.00004889927,0.00006669551,0.019412208,0.00047033236,0.9790508,0.00056203065,0.000011439936],"about_ca_topic_score_codex":0.0014295997,"about_ca_topic_score_gemma":0.0008953515,"teacher_disagreement_score":0.008665583,"about_ca_system_score_codex":0.0026349425,"about_ca_system_score_gemma":0.0013122695,"threshold_uncertainty_score":0.028989315},"labels":[],"label_agreement":null},{"id":"W1996328142","doi":"10.1016/j.tcs.2009.03.018","title":"Efficient enumeration of words in regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Enumeration; Lexicographical order; Mathematics; Computation; Domain (mathematical analysis); Algorithm; Combinatorics; Computer science; Discrete mathematics","score_opus":0.006969939814450132,"score_gpt":0.25593533423711606,"score_spread":0.24896539442266594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996328142","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.28954223,0.00089716463,0.6697902,0.002916518,0.00019385492,0.00025140817,0.002095501,0.0033902482,0.030922908],"genre_scores_gemma":[0.6081366,0.0007130155,0.35965455,0.0007355263,0.00017341007,0.0003558422,0.0048126644,0.0012345101,0.024184002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774384,0.0007040697,0.00021759975,0.00042741353,0.0004898575,0.00041728758],"domain_scores_gemma":[0.989641,0.0069179805,0.00063558377,0.00165703,0.000846389,0.00030207232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009360135,0.0007084936,0.001229293,0.0012929647,0.0013913917,0.003973896,0.0021986126,0.0013745446,0.0061522597],"category_scores_gemma":[0.008950838,0.0009686854,0.0011885896,0.0030796197,0.0014870182,0.008665682,0.0032717101,0.0025245838,0.002178161],"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.00091813225,0.000512511,0.0032395339,0.0009701719,0.00010257652,0.0003572838,0.0018623011,0.042577986,0.02001184,0.6313822,0.024947736,0.27311772],"study_design_scores_gemma":[0.00007166776,0.000045669378,0.0002812848,0.000052228537,0.000054300282,0.00016789796,0.00027276584,0.08503492,0.0060693906,0.9004872,0.007435831,0.000026942802],"about_ca_topic_score_codex":0.0012167784,"about_ca_topic_score_gemma":0.0035535034,"teacher_disagreement_score":0.0061522597,"about_ca_system_score_codex":0.0012485363,"about_ca_system_score_gemma":0.0018014095,"threshold_uncertainty_score":0.020581424},"labels":[],"label_agreement":null},{"id":"W1996579752","doi":"10.1016/j.tcs.2014.11.005","title":"A family of sand automata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Surjective function; Mathematics; Equicontinuity; Deterministic automaton; Automaton; Two-way deterministic finite automaton; Stochastic cellular automaton; Continuous automaton; Simple (philosophy); Discrete mathematics; Cellular automaton; Mobile automaton; Theoretical computer science; Algorithm; Automata theory; Computer science; Quantum finite automata; Finite-state machine","score_opus":0.007572707418624368,"score_gpt":0.23374007002613253,"score_spread":0.22616736260750817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996579752","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.2262765,0.0033831666,0.5358855,0.0016281914,0.000637639,0.00024796618,0.0010937374,0.0022951984,0.22855219],"genre_scores_gemma":[0.8478988,0.0018629787,0.07052388,0.00053676765,0.00020633638,0.00036479405,0.0008554477,0.00029697595,0.07745396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995215,0.00008876016,0.00003080356,0.00014055213,0.00012716731,0.00009119771],"domain_scores_gemma":[0.99870884,0.00043738837,0.00011579357,0.00026570784,0.0003066719,0.00016549233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225475,0.0007631421,0.0009442375,0.0015995434,0.0026197473,0.0028227887,0.0011146793,0.0016544177,0.009354547],"category_scores_gemma":[0.0033093512,0.0005497718,0.0012679296,0.0012575903,0.0017444396,0.002382678,0.00145249,0.0015398191,0.0017111273],"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.00003618121,0.000017428842,0.0004408278,0.000045424873,0.000019227773,0.00016419047,0.0001749937,0.0059911655,0.0013004942,0.97721523,0.0026169408,0.01197792],"study_design_scores_gemma":[0.00002404666,0.000016669506,0.00030098815,0.000028177385,0.00001969056,0.000320574,0.00012256156,0.059029747,0.0009581115,0.9213635,0.01779306,0.00002276907],"about_ca_topic_score_codex":0.003620529,"about_ca_topic_score_gemma":0.0027644918,"teacher_disagreement_score":0.009354547,"about_ca_system_score_codex":0.0013486075,"about_ca_system_score_gemma":0.0011902862,"threshold_uncertainty_score":0.031294107},"labels":[],"label_agreement":null},{"id":"W1996612506","doi":"10.1016/s0304-3975(03)00315-3","title":"The regular-language semantics of second-order idealized ALGOL","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":58,"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":"Decidability; Equivalence (formal languages); Computer science; Programming language; Fragment (logic); Operational semantics; Semantics (computer science); Game semantics; Formal semantics (linguistics); Denotational semantics; Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.009277252131278366,"score_gpt":0.24989362450288827,"score_spread":0.2406163723716099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996612506","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.13600057,0.0014352553,0.6907025,0.0061343354,0.0009467601,0.00011442274,0.0010234077,0.0043294667,0.15931337],"genre_scores_gemma":[0.92346275,0.00035764382,0.059309322,0.00077510055,0.00030040013,0.00008413147,0.0003684829,0.0006556579,0.014686537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985025,0.0004088424,0.00011039792,0.00023289496,0.00046487243,0.00028063788],"domain_scores_gemma":[0.9984018,0.00048755918,0.00013251267,0.00034251407,0.00045963103,0.00017597081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019278436,0.0005667218,0.00062913407,0.0013461924,0.0018558857,0.0064724465,0.0017226846,0.0011919695,0.005119402],"category_scores_gemma":[0.0029037776,0.0006055754,0.0011177672,0.0010719753,0.005188054,0.011009168,0.002749048,0.0031103874,0.0011827],"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.000029619121,0.000008646643,0.00007167653,0.00002003272,0.0000041297412,0.000024600728,0.00025623987,0.00025080226,0.00042622138,0.9960855,0.00058639405,0.00223605],"study_design_scores_gemma":[0.000015764072,0.000013165472,0.000072561845,0.00001305633,0.000010318059,0.00009894957,0.00016103292,0.003182941,0.001294258,0.9856128,0.009508776,0.000016442471],"about_ca_topic_score_codex":0.001257516,"about_ca_topic_score_gemma":0.0011030944,"teacher_disagreement_score":0.0064724465,"about_ca_system_score_codex":0.0021459677,"about_ca_system_score_gemma":0.0014929874,"threshold_uncertainty_score":0.017126143},"labels":[],"label_agreement":null},{"id":"W1996644214","doi":"10.1016/j.tcs.2009.05.002","title":"Operational state complexity of nested word automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"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":"Concatenation (mathematics); Finite-state machine; Nested word; Quantum finite automata; Discrete mathematics; Mathematics; Automaton; Upper and lower bounds; Word (group theory); Constant (computer programming); Deterministic finite automaton; Combinatorics; State (computer science); Automata theory; Computer science; Theoretical computer science; Algorithm","score_opus":0.019453934358182844,"score_gpt":0.2631941083867752,"score_spread":0.24374017402859235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996644214","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.7710022,0.00046375146,0.20454404,0.0018064168,0.00007540739,0.00007951926,0.00079005735,0.00034392902,0.020894647],"genre_scores_gemma":[0.9866216,0.00015900825,0.009344747,0.00007255476,0.000074519776,0.000073967014,0.00040565245,0.00007170893,0.0031762826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644214,0.0008001403,0.00028851433,0.00065556704,0.0012411597,0.00057246804],"domain_scores_gemma":[0.9733611,0.020872176,0.0012653633,0.0018487789,0.0016457798,0.0010068263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019321404,0.00049311284,0.0013498688,0.0014145378,0.0013651528,0.006104557,0.0018227163,0.0013583765,0.008040627],"category_scores_gemma":[0.014761471,0.0006173339,0.0013211884,0.0014449656,0.0034794323,0.013022243,0.002817536,0.003141959,0.00049813685],"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.00017719356,0.00008560581,0.0013307716,0.000073547126,0.000024100631,0.00013853371,0.00084364385,0.018147346,0.0022011313,0.96891874,0.000752442,0.007307054],"study_design_scores_gemma":[0.000017190712,0.000019649979,0.00034707604,0.000007960006,0.0000142527815,0.000046663114,0.00010619791,0.07488458,0.0008383927,0.923249,0.0004488451,0.000020132085],"about_ca_topic_score_codex":0.0022948158,"about_ca_topic_score_gemma":0.0018359544,"teacher_disagreement_score":0.008040627,"about_ca_system_score_codex":0.0023870685,"about_ca_system_score_gemma":0.0015749009,"threshold_uncertainty_score":0.026898623},"labels":[],"label_agreement":null},{"id":"W1997006459","doi":"10.1016/j.tcs.2012.01.011","title":"Effectively approximating measurable sets by open sets","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computer science; Algorithm; Discrete mathematics; Combinatorics","score_opus":0.022850413530175428,"score_gpt":0.28853472834075244,"score_spread":0.265684314810577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997006459","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.14258638,0.0010213057,0.8398922,0.0011036115,0.00015338216,0.000047238253,0.00015168806,0.00069704873,0.014347102],"genre_scores_gemma":[0.8637423,0.00065929076,0.1278815,0.00028325876,0.00015202753,0.00010250962,0.00035162675,0.00019935294,0.006628183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99511576,0.0016455799,0.000300917,0.0006239428,0.0018302731,0.00048342926],"domain_scores_gemma":[0.9843092,0.01067949,0.00075170305,0.002457475,0.0010811958,0.0007210093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031102307,0.0011066815,0.0016708244,0.0017796668,0.0012125197,0.005526169,0.0026182027,0.0017673848,0.004208226],"category_scores_gemma":[0.025435213,0.000929916,0.0014116915,0.002205284,0.0036632281,0.010064875,0.0065117055,0.0038663854,0.0005601179],"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.00017953533,0.000102652855,0.0010662229,0.00015191421,0.00004324075,0.00009597955,0.00046994427,0.050928373,0.0020656846,0.9130894,0.0009040265,0.030903088],"study_design_scores_gemma":[0.000025102187,0.000054972617,0.00018015289,0.000032762222,0.00002282254,0.00006399214,0.000132935,0.17585142,0.0016233991,0.82005817,0.0019406283,0.000013720394],"about_ca_topic_score_codex":0.0019200232,"about_ca_topic_score_gemma":0.0020107946,"teacher_disagreement_score":0.005526169,"about_ca_system_score_codex":0.0025424445,"about_ca_system_score_gemma":0.0009875665,"threshold_uncertainty_score":0.018446863},"labels":[],"label_agreement":null},{"id":"W1997048861","doi":"10.1016/j.tcs.2010.12.005","title":"On the complexity of reconfiguration problems","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":258,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control reconfiguration; Mathematics; Time complexity; Transformation (genetics); PSPACE; NP-complete; Computer science; Computational complexity theory; Combinatorics; Theoretical computer science; Algorithm","score_opus":0.04184605298491346,"score_gpt":0.2974343397464628,"score_spread":0.2555882867615493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997048861","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.36881235,0.009878537,0.35704586,0.044967704,0.0011059025,0.00039286452,0.0029135789,0.0012271833,0.21365596],"genre_scores_gemma":[0.9109624,0.0049728365,0.054351185,0.0019649097,0.0018565409,0.00046383744,0.0026433286,0.0005967304,0.02218812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99388134,0.0022615963,0.00029839348,0.0009184551,0.0017196138,0.0009205737],"domain_scores_gemma":[0.91510737,0.075222805,0.0026553702,0.003563008,0.0016540192,0.0017974923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004062533,0.0016422637,0.0029628035,0.002851429,0.0027641605,0.007450954,0.004152395,0.004008743,0.022622252],"category_scores_gemma":[0.045203015,0.0014345783,0.0026881017,0.004500631,0.0059840474,0.021468904,0.005302838,0.009148328,0.0015048455],"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.000501069,0.00024713724,0.001857828,0.0005782003,0.00011979395,0.00026727564,0.0005620129,0.07956664,0.0009215256,0.8589684,0.01901561,0.037394516],"study_design_scores_gemma":[0.000060898776,0.000022908675,0.00032597154,0.000029084851,0.000027285898,0.00008306509,0.00009457588,0.056417666,0.00016657017,0.9409225,0.0018334519,0.000016089609],"about_ca_topic_score_codex":0.0024863228,"about_ca_topic_score_gemma":0.00216789,"teacher_disagreement_score":0.022622252,"about_ca_system_score_codex":0.0043009007,"about_ca_system_score_gemma":0.0022053774,"threshold_uncertainty_score":0.075679004},"labels":[],"label_agreement":null},{"id":"W1997427041","doi":"10.1016/j.tcs.2005.11.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mtext>CTL</mml:mtext></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:math> model checking for time Petri nets","year":2005,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Petri net; CTL*; Computer science; Algorithm; Model checking; Bounded function; State space; Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.023671791092370376,"score_gpt":0.26775318335223874,"score_spread":0.24408139225986836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997427041","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015181799,0.0003269234,0.30257815,0.004536621,0.0012389611,0.0004936782,0.13804479,0.21299094,0.3382719],"genre_scores_gemma":[0.021792568,0.0011609768,0.19270475,0.0023828764,0.0006108474,0.0009486168,0.22893037,0.120061934,0.43140712],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924904,0.00015389462,0.000087217144,0.000098033284,0.00033694075,0.00007481288],"domain_scores_gemma":[0.9975108,0.00068725966,0.00017070938,0.0006725371,0.0007494276,0.00020925405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011804692,0.0014950495,0.0009478241,0.0023358124,0.00095728436,0.005406967,0.0028745732,0.0022524954,0.50413173],"category_scores_gemma":[0.0044731554,0.0012785424,0.0009026083,0.0029674075,0.0006951579,0.004576957,0.001973717,0.0026928,0.42707],"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.00010258401,0.00004736834,0.0001509077,0.0002533208,0.000012627986,0.00006749898,0.00009682522,0.00077046466,0.002284096,0.03225199,0.9082212,0.055741116],"study_design_scores_gemma":[0.000046043257,0.000016547727,0.00037185778,0.00006630412,0.000007896177,0.00010931858,0.00003919595,0.0035047545,0.0069783637,0.01160311,0.9772174,0.000039186718],"about_ca_topic_score_codex":0.010524283,"about_ca_topic_score_gemma":0.011351873,"teacher_disagreement_score":0.50413173,"about_ca_system_score_codex":0.0021966624,"about_ca_system_score_gemma":0.0016884361,"threshold_uncertainty_score":0.7072959},"labels":[],"label_agreement":null},{"id":"W1998068293","doi":"10.1016/j.tcs.2009.04.008","title":"Two non-holonomic lattice walks in the quarter plane","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":115,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Random walk; Iterated function; Conjecture; Lattice (music); Combinatorics; Plane (geometry); Discrete mathematics; Mathematical analysis; Geometry; Statistics; Physics","score_opus":0.016902911305059446,"score_gpt":0.3131132280734893,"score_spread":0.29621031676842985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998068293","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.9106589,0.00025992672,0.027680678,0.0010694972,0.00049913995,0.00006628463,0.00018285897,0.00017435451,0.05940837],"genre_scores_gemma":[0.963805,0.00012558833,0.0144935865,0.00015963348,0.000038674945,0.000037948066,0.00012958508,0.000056469926,0.021153476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996712,0.00008036789,0.000015265763,0.00005248289,0.00009766068,0.00008296508],"domain_scores_gemma":[0.9994659,0.00008978346,0.00006790959,0.00004560504,0.00005665105,0.0002742175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002641074,0.00048051018,0.00071237265,0.0010125064,0.0022679856,0.0031669496,0.0009562046,0.0023414441,0.0073866304],"category_scores_gemma":[0.0009848526,0.00043895724,0.0004904638,0.00075230614,0.0017025928,0.0019124838,0.0014376786,0.0015434494,0.0011697855],"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.0007987908,0.00030183347,0.0011985553,0.000076276374,0.000026184473,0.0018245206,0.0005529385,0.0070431386,0.008686236,0.9683025,0.002100405,0.009088694],"study_design_scores_gemma":[0.0005088524,0.0003930907,0.0023898282,0.000080897364,0.00003293481,0.0014720939,0.0021535035,0.08883292,0.0057263677,0.8862684,0.012045835,0.000095320305],"about_ca_topic_score_codex":0.0009662745,"about_ca_topic_score_gemma":0.00092241087,"teacher_disagreement_score":0.0073866304,"about_ca_system_score_codex":0.0007137596,"about_ca_system_score_gemma":0.000664415,"threshold_uncertainty_score":0.024710715},"labels":[],"label_agreement":null},{"id":"W1998427290","doi":"10.1016/s0304-3975(03)00221-4","title":"Generating and characterizing the perfect elimination orderings of a chordal graph","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Amortized analysis; Oracle; Initialization; Clique; Treewidth; Discrete mathematics; Constant (computer programming); Graph; Algorithm; Computer science; Data structure; Pathwidth; Line graph","score_opus":0.01231511195538729,"score_gpt":0.26704502216468384,"score_spread":0.25472991020929653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998427290","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.85259414,0.00011576902,0.12834273,0.0003235605,0.000034262794,0.00012394573,0.0011145849,0.0003183923,0.017032685],"genre_scores_gemma":[0.9499236,0.00009710379,0.042644132,0.00006236645,0.00003441359,0.000040332143,0.0018178393,0.00009304448,0.005287155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992982,0.00010940436,0.00004719526,0.00017055498,0.00020822909,0.00016641559],"domain_scores_gemma":[0.99594146,0.0020556408,0.0005736189,0.0006424368,0.00045133705,0.00033552936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052089896,0.0003287616,0.00037678028,0.001240256,0.0011255002,0.0022949893,0.00095371023,0.00047954242,0.0025214206],"category_scores_gemma":[0.0042817323,0.00038854085,0.00049173663,0.0011785412,0.0011271181,0.002076789,0.00079624954,0.0009002974,0.00037998578],"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.00051170675,0.00026797724,0.0143435635,0.0003036169,0.000046052992,0.0004976381,0.002186978,0.020534078,0.031171348,0.846962,0.0042701424,0.07890497],"study_design_scores_gemma":[0.00007255489,0.00013311394,0.003869799,0.000034060417,0.000045388108,0.00046664444,0.00087673584,0.050845712,0.017256742,0.91865325,0.007708212,0.00003768096],"about_ca_topic_score_codex":0.0021612379,"about_ca_topic_score_gemma":0.004173501,"teacher_disagreement_score":0.0025214206,"about_ca_system_score_codex":0.0008729309,"about_ca_system_score_gemma":0.0010870638,"threshold_uncertainty_score":0.008435011},"labels":[],"label_agreement":null},{"id":"W1998674287","doi":"10.1016/j.tcs.2008.04.020","title":"How many runs can a string contain?","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Substring; Combinatorics; Conjecture; String (physics); Mathematics; Upper and lower bounds; Repetition (rhetorical device); Discrete mathematics; Data structure; Computer science; Mathematical analysis; Philosophy; Mathematical physics","score_opus":0.013842654129992698,"score_gpt":0.22579789981122944,"score_spread":0.21195524568123675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998674287","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.5531233,0.008518019,0.35870466,0.018196499,0.0015509432,0.00019720334,0.0052770884,0.007866168,0.04656611],"genre_scores_gemma":[0.8709159,0.0028600285,0.10191161,0.00090825267,0.0008592843,0.00016057778,0.004641952,0.0018146199,0.015927749],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621236,0.0006225216,0.00043313077,0.0009706903,0.0013302262,0.00043117025],"domain_scores_gemma":[0.9723164,0.015981387,0.0014483884,0.0065608383,0.0028151665,0.00087777845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002682886,0.00081349566,0.0016940718,0.0022102662,0.0017120145,0.0043691387,0.0017810591,0.002983297,0.007565281],"category_scores_gemma":[0.038018275,0.0008577409,0.0010214526,0.002716662,0.0021158794,0.017259067,0.0018831454,0.002009226,0.004066509],"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.0031572294,0.0004536033,0.04759991,0.0010627948,0.00043567517,0.001280291,0.0014910816,0.040551033,0.023882845,0.14362563,0.030569736,0.7058902],"study_design_scores_gemma":[0.00009386181,0.00032569005,0.009323772,0.000494472,0.0004588789,0.0036872346,0.002342713,0.20933914,0.052052733,0.6644328,0.057181392,0.00026725972],"about_ca_topic_score_codex":0.0009259926,"about_ca_topic_score_gemma":0.001046472,"teacher_disagreement_score":0.007565281,"about_ca_system_score_codex":0.000886045,"about_ca_system_score_gemma":0.0011801848,"threshold_uncertainty_score":0.02530843},"labels":[],"label_agreement":null},{"id":"W1998843748","doi":"10.1016/s0304-3975(98)00116-9","title":"Competitive analysis of randomized paging algorithms","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Paging; Competitive analysis; Computer science; Online algorithm; Cache; Algorithm; Randomized algorithm; CPU cache; Demand paging; Page fault; Cache algorithms; Deterministic algorithm; Virtual memory; Memory management; Parallel computing; Upper and lower bounds; Mathematics; Operating system","score_opus":0.008541897466011434,"score_gpt":0.26329504070959364,"score_spread":0.2547531432435822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998843748","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.2553874,0.007309391,0.61261785,0.00976996,0.0007297846,0.0008840784,0.0018252247,0.0022295956,0.10924674],"genre_scores_gemma":[0.9041083,0.0023802363,0.069457375,0.0011529538,0.0013179571,0.00071475666,0.0012982116,0.0008247545,0.018745486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9885252,0.005698818,0.00032210557,0.000980611,0.0025096256,0.0019636569],"domain_scores_gemma":[0.9249324,0.06067259,0.0027469087,0.0052654385,0.0037085745,0.0026739691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008456368,0.0024069736,0.0047649904,0.003563574,0.0027339375,0.0074238456,0.009463843,0.0044947406,0.022261057],"category_scores_gemma":[0.066458076,0.0017081586,0.0020904327,0.0061168154,0.0041917195,0.010814791,0.0041071414,0.0051012025,0.0022776967],"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.0024075462,0.0011231715,0.0022363777,0.0006929151,0.0001835694,0.00013595277,0.00035543257,0.3282477,0.0022181766,0.57334495,0.03212961,0.056924574],"study_design_scores_gemma":[0.00023101088,0.00018021195,0.00044807,0.000038162678,0.00006339152,0.00007469674,0.000070504204,0.81814414,0.00044762282,0.17795132,0.0023179373,0.000032826203],"about_ca_topic_score_codex":0.0067073,"about_ca_topic_score_gemma":0.004054929,"teacher_disagreement_score":0.022261057,"about_ca_system_score_codex":0.006764665,"about_ca_system_score_gemma":0.0062129637,"threshold_uncertainty_score":0.07447064},"labels":[],"label_agreement":null},{"id":"W1998896855","doi":"10.1016/j.tcs.2014.10.015","title":"Dealing with undependable workers in decentralized network supercomputing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Computer science; Binary logarithm; Bounded function; Set (abstract data type); Logarithm; Time complexity; Supercomputer; Adversary; Parallel computing; Upper and lower bounds; Computational complexity theory; Discrete mathematics; Theoretical computer science; Combinatorics; Algorithm; Mathematics","score_opus":0.005534214958432437,"score_gpt":0.21928154366739452,"score_spread":0.2137473287089621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998896855","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.5551553,0.00089779653,0.42634943,0.004513173,0.0004989794,0.00012648384,0.000113872644,0.00061133417,0.011733586],"genre_scores_gemma":[0.962766,0.00019792179,0.03121606,0.00015374745,0.00018702955,0.00007250031,0.000054114636,0.00008804589,0.005264545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973206,0.0009953597,0.000126603,0.0004071367,0.0005848938,0.0005653447],"domain_scores_gemma":[0.9877281,0.0064465627,0.0009849798,0.0029985562,0.0009761103,0.00086567114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048730443,0.00037363422,0.0011142843,0.00058209884,0.0032418869,0.0025885147,0.0030916682,0.0020504927,0.0031005458],"category_scores_gemma":[0.019081997,0.0008027863,0.0003755739,0.0011190604,0.0027348956,0.0036338575,0.0037974867,0.002058577,0.00041301205],"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.0015818429,0.00046353423,0.013225837,0.00031859626,0.00013034196,0.001655986,0.0023491916,0.63339716,0.008022042,0.2458083,0.010900709,0.08214649],"study_design_scores_gemma":[0.0000853017,0.000077741366,0.00091078936,0.000018658371,0.00003354138,0.00016868327,0.0005445111,0.8339136,0.0029186422,0.15750317,0.0037988378,0.000026561236],"about_ca_topic_score_codex":0.0019146841,"about_ca_topic_score_gemma":0.0029060303,"teacher_disagreement_score":0.0048730443,"about_ca_system_score_codex":0.0009132622,"about_ca_system_score_gemma":0.0017604177,"threshold_uncertainty_score":0.02577138},"labels":[],"label_agreement":null},{"id":"W1999376700","doi":"10.1016/j.tcs.2012.10.013","title":"Tighter PAC-Bayes bounds through distribution-dependent priors","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":75,"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é Laval","funders":"","keywords":"Prior probability; Bayes' theorem; Mathematics; Reproducing kernel Hilbert space; Regularization (linguistics); Mathematical optimization; Applied mathematics; Exponential family; Algorithm; Class (philosophy); Function (biology); Distribution (mathematics); Computer science; Hilbert space; Artificial intelligence; Bayesian probability; Statistics; Mathematical analysis","score_opus":0.0075164416669550324,"score_gpt":0.2596614497271334,"score_spread":0.25214500806017837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999376700","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.008352932,0.005144183,0.9587742,0.0047191097,0.0005491191,0.00008820871,0.0004673567,0.000852181,0.021052675],"genre_scores_gemma":[0.42637476,0.008062733,0.5233052,0.00744865,0.0035548077,0.0009455394,0.002078983,0.0026565855,0.02557284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9804388,0.008498205,0.00070617435,0.0028438426,0.0058399434,0.0016730241],"domain_scores_gemma":[0.88854456,0.094004236,0.0021465956,0.009916694,0.0037879748,0.0015998201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024428647,0.004749354,0.0058899214,0.003936542,0.0030810605,0.008727347,0.006537524,0.0057068327,0.015901884],"category_scores_gemma":[0.13431431,0.004338477,0.0028482976,0.0047369264,0.007082033,0.023961946,0.011117729,0.01905622,0.004234355],"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.00058633665,0.00023290412,0.0012488193,0.00048728095,0.00020280342,0.00020791194,0.00037030788,0.14784627,0.0012673808,0.7673877,0.017876763,0.06228544],"study_design_scores_gemma":[0.000048212914,0.000025582887,0.00017641002,0.00010319535,0.000045384586,0.00008545606,0.000030641786,0.20869029,0.00055221346,0.7875804,0.0026323763,0.00002997053],"about_ca_topic_score_codex":0.0042838734,"about_ca_topic_score_gemma":0.007330006,"teacher_disagreement_score":0.024428647,"about_ca_system_score_codex":0.0062134876,"about_ca_system_score_gemma":0.0059629283,"threshold_uncertainty_score":0.12919259},"labels":[],"label_agreement":null},{"id":"W1999499351","doi":"10.1016/s0304-3975(00)00333-9","title":"Polymorphic lambda calculus and subtyping","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","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":"Memorial University of Newfoundland","funders":"","keywords":"Subtyping; Soundness; Lambda calculus; Computer science; Extension (predicate logic); Programming language; Calculus (dental); Algebra over a field; Discrete mathematics; Mathematics; Pure mathematics","score_opus":0.018575696554049077,"score_gpt":0.22882835018092254,"score_spread":0.21025265362687345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999499351","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.09976119,0.03776279,0.6460353,0.023795236,0.0016923991,0.0000674514,0.00039672302,0.0010848447,0.18940406],"genre_scores_gemma":[0.8592289,0.0154739665,0.07112409,0.0017361576,0.0029006246,0.000104964834,0.00031033243,0.000329941,0.048790924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793637,0.00061390304,0.00009237088,0.00034038807,0.00071813114,0.00029887407],"domain_scores_gemma":[0.9972849,0.0015910087,0.00020094625,0.0005383974,0.00024523737,0.00013947417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019831029,0.00064687803,0.0013101427,0.0015968463,0.0028511593,0.004774554,0.0013791333,0.002145934,0.0046490296],"category_scores_gemma":[0.006024221,0.00070335483,0.0010467023,0.0031164389,0.008903301,0.009517431,0.0031752037,0.005539689,0.0010335861],"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.0000102992735,0.000008101551,0.00012186826,0.000020692276,0.0000032193093,0.000048447,0.00020053032,0.0005636964,0.00013016516,0.9915931,0.0011991771,0.006100556],"study_design_scores_gemma":[0.0000031815794,0.000001946074,0.00004637197,0.0000064827013,0.0000037894813,0.000035559235,0.000020348916,0.0008187926,0.00007718957,0.9952048,0.0037776735,0.000003857083],"about_ca_topic_score_codex":0.003646472,"about_ca_topic_score_gemma":0.0022869392,"teacher_disagreement_score":0.004774554,"about_ca_system_score_codex":0.0022086515,"about_ca_system_score_gemma":0.0018690928,"threshold_uncertainty_score":0.016024947},"labels":[],"label_agreement":null},{"id":"W1999518031","doi":"10.1016/j.tcs.2005.10.045","title":"Hierarchies for classes of priority algorithms for Job Scheduling","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Algorithm","score_opus":0.015456930125900416,"score_gpt":0.27097839790631356,"score_spread":0.2555214677804131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999518031","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.021402262,0.003604254,0.9341871,0.0022404392,0.00076373,0.00027529488,0.0006413235,0.0015017259,0.035383847],"genre_scores_gemma":[0.32652906,0.0041125338,0.63588595,0.0023984695,0.0021482822,0.0012100908,0.0022516835,0.0013700291,0.024093961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964161,0.0010223426,0.0002463781,0.0004331863,0.0011680035,0.0007139787],"domain_scores_gemma":[0.9929381,0.004073051,0.00043483346,0.0010727462,0.00085018936,0.0006309915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003251391,0.0012015622,0.0015394841,0.002197068,0.002533742,0.0047910134,0.0032382065,0.0016125836,0.012076968],"category_scores_gemma":[0.016838258,0.0010762602,0.0016711035,0.0028207279,0.0015875516,0.00672829,0.0029360363,0.0052898927,0.0026882566],"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.00019346869,0.00012360251,0.00041236336,0.00023617722,0.000028983115,0.000053378364,0.0002858006,0.0071217045,0.0011717596,0.90489596,0.018554658,0.06692215],"study_design_scores_gemma":[0.000074371565,0.000054039378,0.00033933588,0.0000612691,0.00003237013,0.00009288276,0.00007663445,0.057288267,0.00043604057,0.91912705,0.022392444,0.000025265987],"about_ca_topic_score_codex":0.003846225,"about_ca_topic_score_gemma":0.005137337,"teacher_disagreement_score":0.012076968,"about_ca_system_score_codex":0.0033076638,"about_ca_system_score_gemma":0.0020150468,"threshold_uncertainty_score":0.04040152},"labels":[],"label_agreement":null},{"id":"W1999696434","doi":"10.1016/j.tcs.2005.07.016","title":"A generalization of repetition threshold","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Repetition (rhetorical device); Generalization; Alphabet; Mathematics; Word (group theory); Combinatorics on words; Combinatorics; Discrete mathematics; Existential quantification; Arithmetic; Linguistics; Geometry; Mathematical analysis","score_opus":0.00790752423281006,"score_gpt":0.23576885501357725,"score_spread":0.2278613307807672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999696434","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.06327041,0.0017212257,0.82442623,0.0041314284,0.0011213963,0.00015506122,0.00040145728,0.001793898,0.1029789],"genre_scores_gemma":[0.82368845,0.0012401807,0.12606785,0.0028137516,0.0022615457,0.00033182706,0.00033559802,0.0010006195,0.042260177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99608374,0.0008206733,0.00025019958,0.0013567389,0.0010143872,0.00047417587],"domain_scores_gemma":[0.9857654,0.007703645,0.00080242596,0.0036942656,0.0012322735,0.00080214744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025828604,0.00078121864,0.0018914883,0.002269488,0.0019137028,0.0037026098,0.0031440419,0.0028834338,0.013052983],"category_scores_gemma":[0.016192727,0.00082428375,0.0019537478,0.0020315305,0.0052220006,0.011161241,0.0049039093,0.0051225866,0.0025971085],"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.000029085119,0.000014733353,0.0001622346,0.000048645274,0.000011312776,0.00008349935,0.00017325144,0.0014403706,0.0025441116,0.98838556,0.0012868448,0.0058203754],"study_design_scores_gemma":[0.000012083389,0.000022914766,0.00011472329,0.000011794678,0.000014998276,0.00020428383,0.000032975462,0.014093804,0.0011239309,0.9805088,0.0038405217,0.000019059633],"about_ca_topic_score_codex":0.00092188147,"about_ca_topic_score_gemma":0.00053222757,"teacher_disagreement_score":0.013052983,"about_ca_system_score_codex":0.0018134157,"about_ca_system_score_gemma":0.0014514931,"threshold_uncertainty_score":0.04366654},"labels":[],"label_agreement":null},{"id":"W2000192178","doi":"10.1016/s0304-3975(03)00224-x","title":"A classification of plane and planar 2-trees","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Molecular Sensors and Ion Detection","field":"Chemistry","cited_by":14,"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":"Planar; Plane (geometry); Mathematics; Planar graph; Combinatorics; Geometry; Computer science; Computer graphics (images); Graph","score_opus":0.009354177187862299,"score_gpt":0.22355881421962975,"score_spread":0.21420463703176745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000192178","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.4201952,0.016488286,0.49031013,0.0052167433,0.0006442497,0.00041457987,0.007624211,0.0011056622,0.058000877],"genre_scores_gemma":[0.72136825,0.010060988,0.2301843,0.0011185737,0.0010408898,0.00034341632,0.01798324,0.00052294816,0.017377485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986469,0.00020669127,0.00011927481,0.00028040988,0.0004403562,0.0003063723],"domain_scores_gemma":[0.9948966,0.0025908689,0.0006941348,0.00050278695,0.00083260954,0.00048304768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009541847,0.0007328804,0.0012544971,0.003976096,0.0017139358,0.0054944158,0.0017968323,0.0027001463,0.006871893],"category_scores_gemma":[0.007594299,0.0005973849,0.001281037,0.0053845574,0.001731289,0.0058977855,0.0016679801,0.0022449305,0.0017864922],"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.0006668566,0.00017428442,0.011903592,0.0006203206,0.00006632013,0.00030861713,0.0010536005,0.019932332,0.0036688377,0.7006199,0.029470755,0.23151456],"study_design_scores_gemma":[0.00011865225,0.00023661781,0.0088546565,0.0003254625,0.00009983157,0.0020617153,0.00071642257,0.104030944,0.0013691615,0.8299948,0.052116778,0.000075108226],"about_ca_topic_score_codex":0.001898797,"about_ca_topic_score_gemma":0.0018407502,"teacher_disagreement_score":0.006871893,"about_ca_system_score_codex":0.0012246042,"about_ca_system_score_gemma":0.0008801419,"threshold_uncertainty_score":0.022988737},"labels":[],"label_agreement":null},{"id":"W2000194783","doi":"10.1016/j.tcs.2013.07.005","title":"Linear circuits, two-variable logic and weakly blocked monoids","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Predicate (mathematical logic); Closure (psychology); Discrete mathematics; Class (philosophy); Algebraic number; Predicate logic; First-order logic; Variable (mathematics); Expressive power; Predicate variable; Electronic circuit; Algorithm; Arithmetic; Computer science; Zeroth-order logic; Theoretical computer science; Multimodal logic; Programming language","score_opus":0.00827689966408616,"score_gpt":0.2272841832801425,"score_spread":0.21900728361605634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000194783","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.278761,0.0065061017,0.6553374,0.004602439,0.00033935104,0.00011738142,0.000692527,0.00087513897,0.052768588],"genre_scores_gemma":[0.9122042,0.0020823604,0.054740373,0.0006866457,0.0002580759,0.00016542188,0.00050292065,0.00013165698,0.029228311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892396,0.00034117035,0.0000777433,0.00023702488,0.00022531068,0.00019476599],"domain_scores_gemma":[0.99682355,0.0022599727,0.00023060293,0.0002616128,0.0002563664,0.00016796203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012992121,0.000593838,0.0007452023,0.0011816105,0.0011874654,0.00394217,0.0015538054,0.0013576192,0.005772735],"category_scores_gemma":[0.0031644881,0.0006547091,0.0009771413,0.0017264993,0.003220942,0.00757308,0.0019911227,0.002750123,0.000936866],"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.00009410046,0.000036410845,0.00020224613,0.0000713306,0.000009893864,0.00007340477,0.00025901617,0.002320585,0.0017585623,0.987711,0.0006831626,0.006780327],"study_design_scores_gemma":[0.000023676044,0.000019044477,0.00008492856,0.000016607119,0.000015253885,0.000059678332,0.00006156879,0.007387044,0.001243865,0.988526,0.0025450652,0.000017240762],"about_ca_topic_score_codex":0.0019114728,"about_ca_topic_score_gemma":0.0017743779,"teacher_disagreement_score":0.005772735,"about_ca_system_score_codex":0.0020788666,"about_ca_system_score_gemma":0.001085977,"threshold_uncertainty_score":0.019311726},"labels":[],"label_agreement":null},{"id":"W2000480185","doi":"10.1016/j.tcs.2007.06.004","title":"Fibrations and universal view updatability","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Computer science; Mathematics; Theoretical computer science; Programming language; Algebra over a field; Pure mathematics","score_opus":0.007948658562605852,"score_gpt":0.25337003983349854,"score_spread":0.2454213812708927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000480185","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.2249213,0.0012114536,0.73722196,0.0026224933,0.00027787857,0.00010954579,0.0004904719,0.0031666977,0.029978154],"genre_scores_gemma":[0.9045833,0.0007341921,0.08185142,0.00045609157,0.00032991255,0.00012879581,0.0005693082,0.0011215654,0.010225378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99284583,0.0014251572,0.00092525786,0.0023760537,0.0013459239,0.001081685],"domain_scores_gemma":[0.96923894,0.015918883,0.0022328098,0.008433551,0.0026655262,0.0015101486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006179074,0.00086957036,0.001635282,0.0029205934,0.0038241895,0.0061629754,0.001829318,0.0021673949,0.008109905],"category_scores_gemma":[0.019710746,0.0022341202,0.0025528471,0.0026468567,0.010317401,0.03283239,0.010034727,0.0045856987,0.0010099909],"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.000116377996,0.000038455757,0.0015038323,0.00006109759,0.000030573876,0.00044009316,0.0023461173,0.0007165859,0.0014086526,0.97990215,0.00097294926,0.01246319],"study_design_scores_gemma":[0.00003533961,0.000024115845,0.00044060138,0.000029408362,0.000057698006,0.00053619465,0.00033663728,0.0039699953,0.0022301532,0.98644316,0.00586313,0.000033586366],"about_ca_topic_score_codex":0.0016028084,"about_ca_topic_score_gemma":0.0010685088,"teacher_disagreement_score":0.008109905,"about_ca_system_score_codex":0.0012795836,"about_ca_system_score_gemma":0.0008487493,"threshold_uncertainty_score":0.032678485},"labels":[],"label_agreement":null},{"id":"W2000645132","doi":"10.1016/j.tcs.2012.02.008","title":"Efficient generation of the ideals of a poset in gray code order, part II","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Squire; Partially ordered set; Gray code; Mathematics; Ideal (ethics); Code (set theory); Combinatorics; Order (exchange); Discrete mathematics; Amortized analysis; Algorithm; Computer science; Data structure; Set (abstract data type)","score_opus":0.049737963823437606,"score_gpt":0.326781192961203,"score_spread":0.2770432291377654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000645132","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.27543625,0.0004338667,0.6772981,0.0007059313,0.0002810459,0.00051110046,0.0007526129,0.0026510197,0.041930087],"genre_scores_gemma":[0.7944002,0.00017435242,0.18711583,0.00019654595,0.00010600404,0.00017984818,0.0013635529,0.0005371339,0.015926523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993794,0.000109522975,0.000033254502,0.00010190144,0.00020456512,0.00017141305],"domain_scores_gemma":[0.9990415,0.0003205896,0.000063973224,0.00029281576,0.00018049114,0.00010054587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048390028,0.00043636496,0.00065056107,0.0008063283,0.0007886742,0.0017086847,0.0006892785,0.00037573953,0.008008576],"category_scores_gemma":[0.001648669,0.00030838719,0.0010033891,0.0005302886,0.0010236416,0.0018212013,0.0017622957,0.0009330515,0.0014471882],"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.00046879982,0.00028178436,0.0020277381,0.00041540092,0.000049778777,0.0005216614,0.0011344603,0.031733118,0.043408208,0.72626907,0.015403679,0.17828634],"study_design_scores_gemma":[0.00012951577,0.0002889918,0.00079452177,0.00007180432,0.00006259749,0.000431103,0.0003675871,0.17775962,0.068962775,0.7310382,0.020033214,0.000060069182],"about_ca_topic_score_codex":0.00088517007,"about_ca_topic_score_gemma":0.0016702907,"teacher_disagreement_score":0.008008576,"about_ca_system_score_codex":0.000766192,"about_ca_system_score_gemma":0.001069192,"threshold_uncertainty_score":0.026791334},"labels":[],"label_agreement":null},{"id":"W2000777414","doi":"10.1016/s0304-3975(99)00020-1","title":"Efficient implementation of regular languages using reversed alternating finite automata","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Deterministic finite automaton; Finite-state machine; Nondeterministic finite automaton; Automaton; Computer science; Representation (politics); Regular language; Theoretical computer science; Quantum finite automata; Mathematics; Algorithm; Automata theory","score_opus":0.00972641191193077,"score_gpt":0.2902834371344849,"score_spread":0.28055702522255416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000777414","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.100394726,0.0001550233,0.874931,0.00027267987,0.00020004726,0.00020456579,0.0002127178,0.0153020695,0.00832729],"genre_scores_gemma":[0.6188557,0.000121176905,0.3722105,0.00017623034,0.000048071754,0.00028280067,0.00060883275,0.0009453675,0.006751274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978284,0.0007059341,0.00021751506,0.00034586038,0.0005256769,0.00037660374],"domain_scores_gemma":[0.9946596,0.002344672,0.00024075339,0.0017869779,0.0008128985,0.00015509025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013893653,0.0006612593,0.00086520496,0.0005538936,0.0007031377,0.0020828082,0.0026489897,0.00084429525,0.0069171246],"category_scores_gemma":[0.0050373753,0.0006176417,0.001070868,0.0005342061,0.00094794953,0.0034508167,0.0016864825,0.0014904687,0.0018448647],"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.0028504315,0.0012670727,0.0021698312,0.0008621708,0.00017986739,0.0009386409,0.0013115541,0.065990224,0.18272808,0.36169067,0.013944079,0.36606744],"study_design_scores_gemma":[0.0004188308,0.0004742997,0.00034620022,0.0000692209,0.0001715403,0.00027629736,0.0002728341,0.63162404,0.17386883,0.1694605,0.022880415,0.00013702888],"about_ca_topic_score_codex":0.0011746091,"about_ca_topic_score_gemma":0.0022542719,"teacher_disagreement_score":0.0069171246,"about_ca_system_score_codex":0.00069341774,"about_ca_system_score_gemma":0.0014275652,"threshold_uncertainty_score":0.023140073},"labels":[],"label_agreement":null},{"id":"W2001156795","doi":"10.1016/j.tcs.2009.07.007","title":"Optimal movement of mobile sensors for barrier coverage of a planar region","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Fence (mathematics); Polygon (computer graphics); Computer science; Wireless sensor network; Planar; Intrusion; Perimeter; Simple (philosophy); Simple polygon; Intrusion detection system; Computer network; Computer security; Mathematics; Regular polygon; Computer graphics (images)","score_opus":0.007139911694959688,"score_gpt":0.23106669296675808,"score_spread":0.22392678127179838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001156795","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.22498134,0.00043686194,0.7688559,0.00046303816,0.000040132294,0.000087881475,0.00013577305,0.00019946405,0.0047996445],"genre_scores_gemma":[0.92290485,0.00025136245,0.074068144,0.000041429124,0.000014148721,0.000110198394,0.00009252753,0.000039160655,0.0024780184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977297,0.00006900935,0.000007973616,0.000041672676,0.00004877687,0.00005957915],"domain_scores_gemma":[0.999292,0.00042287365,0.00010563789,0.000048395275,0.000056580997,0.00007447156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043342134,0.00063385145,0.00075003837,0.0006451243,0.0003625816,0.00052372826,0.000961736,0.0008814441,0.0012270649],"category_scores_gemma":[0.003426527,0.00040840506,0.0004724406,0.00048659643,0.00065944274,0.0006775916,0.0011793701,0.00056350563,0.00019027013],"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.00066177215,0.000085451924,0.0010365387,0.00012702658,0.000035480887,0.00018662511,0.00015155175,0.9272837,0.01793843,0.02871992,0.0010804855,0.022693023],"study_design_scores_gemma":[0.000040581832,0.000076466444,0.00025305562,0.0000072399494,0.000008749969,0.00003636192,0.00003381784,0.9931753,0.001260941,0.0047875973,0.00031170074,0.000008206598],"about_ca_topic_score_codex":0.0027015295,"about_ca_topic_score_gemma":0.0020964216,"teacher_disagreement_score":0.0027015295,"about_ca_system_score_codex":0.00060378533,"about_ca_system_score_gemma":0.0005664223,"threshold_uncertainty_score":0.0053715706},"labels":[],"label_agreement":null},{"id":"W2001279658","doi":"10.1016/j.tcs.2006.02.003","title":"Synchronizing groups and automata","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Synchronizing; Mathematics; Combinatorics; Property (philosophy); Word (group theory); Permutation group; Discrete mathematics; Character (mathematics); Prime (order theory); Automaton; Cyclic permutation; Symmetric group; Computer science; Theoretical computer science; Topology (electrical circuits)","score_opus":0.004610918180651434,"score_gpt":0.20743109213955863,"score_spread":0.2028201739589072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001279658","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.21187954,0.017358204,0.5005787,0.013493066,0.0029107176,0.00016718193,0.00053144037,0.0011458833,0.25193524],"genre_scores_gemma":[0.9168092,0.004089545,0.029298225,0.00093600614,0.0019810053,0.00022166656,0.0004024584,0.00018391687,0.046077937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892235,0.00036552717,0.000067219284,0.00032452453,0.00020345737,0.000116963274],"domain_scores_gemma":[0.99779105,0.0013623956,0.00016810131,0.00033828497,0.00018082932,0.00015943102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010402228,0.0007159966,0.0011005014,0.0019036797,0.0018432487,0.0031635736,0.0007773219,0.0014580528,0.010533409],"category_scores_gemma":[0.00278532,0.000489029,0.00081497565,0.0025441428,0.005522648,0.0071568433,0.0026745675,0.0027001759,0.0014318464],"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.000008535042,0.000006361211,0.000043720403,0.000017394075,0.0000024484016,0.000021093994,0.00021170586,0.00028413878,0.00018965648,0.99585754,0.00064268353,0.002714659],"study_design_scores_gemma":[0.000005224056,0.0000055259657,0.000023945191,0.0000046749115,0.0000031522538,0.000024061088,0.00004575635,0.00074249564,0.00012220068,0.99546885,0.0035511255,0.000002914524],"about_ca_topic_score_codex":0.0005253214,"about_ca_topic_score_gemma":0.00036911728,"teacher_disagreement_score":0.010533409,"about_ca_system_score_codex":0.0011014643,"about_ca_system_score_gemma":0.00069609995,"threshold_uncertainty_score":0.03523779},"labels":[],"label_agreement":null},{"id":"W2001527002","doi":"10.1016/j.tcs.2014.09.018","title":"Using quantum key distribution for cryptographic purposes: A survey","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":218,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Quantum key distribution; Computer science; Cryptography; Key (lock); Cryptographic primitive; Computer security; Key exchange; Quantum cryptography; Context (archaeology); Cipher; Key distribution; Key management; Cryptographic protocol; Public-key cryptography; Encryption; Quantum; Quantum information; Physics","score_opus":0.020723023151779523,"score_gpt":0.27366366658569335,"score_spread":0.2529406434339138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001527002","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098373145,0.7236854,0.23094748,0.0040097963,0.0007302287,0.00018861714,0.00016658996,0.00026426231,0.030170351],"genre_scores_gemma":[0.13452367,0.7648021,0.089318655,0.001576986,0.0021825966,0.00023433067,0.00033800557,0.00017493922,0.00684873],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967314,0.001044398,0.0002812328,0.000490722,0.0012397974,0.00021243998],"domain_scores_gemma":[0.99281454,0.0049805217,0.00033450476,0.0011496651,0.0005884946,0.00013230035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004435401,0.001082358,0.002148932,0.0034936387,0.0011587098,0.0041551706,0.0027708865,0.0027937216,0.006049626],"category_scores_gemma":[0.007571657,0.0014623299,0.0010098336,0.007369062,0.003148802,0.011543032,0.003638214,0.0035671077,0.002218719],"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.00021589879,0.00027085817,0.0021829952,0.0068884515,0.00010785528,0.000116215786,0.00026881415,0.004605217,0.0032828664,0.27794918,0.007919328,0.6961922],"study_design_scores_gemma":[0.00013543444,0.000704672,0.0027589828,0.0028985192,0.00020804009,0.0037276223,0.00061216194,0.03718134,0.016814515,0.36872768,0.56600404,0.00022705847],"about_ca_topic_score_codex":0.0004324179,"about_ca_topic_score_gemma":0.00035364332,"teacher_disagreement_score":0.006049626,"about_ca_system_score_codex":0.00133036,"about_ca_system_score_gemma":0.001510336,"threshold_uncertainty_score":0.023456931},"labels":[],"label_agreement":null},{"id":"W2002077709","doi":"10.1016/j.tcs.2014.10.029","title":"Data gathering and personalized broadcasting in radio grids with interference","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Communication source; Broadcasting (networking); Computer network; Base station; Graph; Job shop scheduling; Schedule; Node (physics); Scheduling (production processes); Unicast; Distributed computing; Theoretical computer science; Mathematical optimization; Multicast; Mathematics; Routing (electronic design automation)","score_opus":0.018518143503911323,"score_gpt":0.2468621790266305,"score_spread":0.22834403552271917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002077709","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.16113245,0.0005615079,0.82941395,0.00051767175,0.00008878458,0.000059863618,0.00008080028,0.00047472032,0.0076702973],"genre_scores_gemma":[0.97168565,0.00019281011,0.02549663,0.000047502173,0.000056177767,0.000028397217,0.0000428851,0.000040088296,0.0024098335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992562,0.00023741485,0.000028995655,0.00016145002,0.0001609493,0.00015500013],"domain_scores_gemma":[0.99661773,0.0022724199,0.00032274154,0.00037124337,0.0002724724,0.00014335915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082178746,0.00036118383,0.00080323126,0.0006228179,0.0012001228,0.0012924352,0.0010757692,0.0006958519,0.0016082918],"category_scores_gemma":[0.005675675,0.0004925731,0.00038129117,0.0012373597,0.0010558219,0.0014091905,0.0012659457,0.00072412635,0.0002675343],"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.00086835015,0.00015475592,0.0054435474,0.00019841231,0.00009427887,0.00083968317,0.0008003046,0.7924411,0.014835883,0.10551737,0.0032597417,0.0755465],"study_design_scores_gemma":[0.00002448691,0.00005480256,0.0005434096,0.000005388235,0.000021828617,0.00021096185,0.00015437051,0.96608615,0.002175616,0.029788785,0.00092202285,0.0000121883795],"about_ca_topic_score_codex":0.0031808456,"about_ca_topic_score_gemma":0.0029117535,"teacher_disagreement_score":0.0031808456,"about_ca_system_score_codex":0.0008473041,"about_ca_system_score_gemma":0.00061996304,"threshold_uncertainty_score":0.006324649},"labels":[],"label_agreement":null},{"id":"W2002992445","doi":"10.1016/s0304-3975(02)00830-7","title":"On the complexity of intersecting finite state automata and NL versus NP","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Mathematics; Complexity class; Deterministic finite automaton; DFA minimization; Intersection (aeronautics); Finite-state machine; Class (philosophy); Time complexity; Computational complexity theory; Discrete mathematics; Combinatorics; Algorithm; State (computer science); Automaton; Quantum finite automata; Automata theory; Computer science; Theoretical computer science","score_opus":0.035858908373254124,"score_gpt":0.26059878692361255,"score_spread":0.22473987855035843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002992445","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.51437956,0.01349984,0.27301356,0.042733286,0.0006362151,0.00020604995,0.0024124708,0.0008451867,0.15227373],"genre_scores_gemma":[0.96417356,0.0028885673,0.023111617,0.0008298843,0.00093901186,0.00012856128,0.0010218616,0.00023129405,0.0066755046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99244505,0.0031155827,0.00048499173,0.0010822547,0.0019929814,0.00087911694],"domain_scores_gemma":[0.80092436,0.18441373,0.00393524,0.00609304,0.0026656045,0.001967988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061819125,0.0007846241,0.0021437928,0.0024014441,0.0031498575,0.009043321,0.0029214823,0.0036306235,0.012544578],"category_scores_gemma":[0.06979717,0.0010702019,0.0020699834,0.0040548407,0.0075029,0.038862135,0.0064123827,0.0069758845,0.000743101],"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.0005070958,0.00012308333,0.0031465134,0.00036604423,0.000059556638,0.00018267569,0.0012045592,0.033155873,0.0005681468,0.9275469,0.0054653077,0.027674291],"study_design_scores_gemma":[0.000018037234,0.000014313356,0.000404748,0.000028689148,0.0000166589,0.00008680062,0.00018944195,0.025837757,0.00019606578,0.9718846,0.0013078415,0.000014999883],"about_ca_topic_score_codex":0.0035314318,"about_ca_topic_score_gemma":0.0027177448,"teacher_disagreement_score":0.012544578,"about_ca_system_score_codex":0.00435252,"about_ca_system_score_gemma":0.0024311198,"threshold_uncertainty_score":0.041965783},"labels":[],"label_agreement":null},{"id":"W2003402352","doi":"10.1016/s0304-3975(01)00216-x","title":"On a valuation of rational subsets of Zk Dédié à Jean Berstel","year":2003,"lang":"fr","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Valuation (finance); Polyhedron; Rational function; Mathematics; Generalization; Rational number; Mathematical economics; Discrete mathematics; Combinatorics; Pure mathematics; Economics; Mathematical analysis","score_opus":0.038948698092421186,"score_gpt":0.3125357313273392,"score_spread":0.273587033234918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003402352","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.6403749,0.010159937,0.061793555,0.010526918,0.0016861358,0.00007950432,0.00075948937,0.00024004656,0.27437958],"genre_scores_gemma":[0.96479034,0.0029380247,0.0049935943,0.00033396375,0.00067804183,0.000044015807,0.0003321825,0.00008319486,0.025806706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990188,0.00025473806,0.000048969257,0.00016236128,0.00028913267,0.0002260238],"domain_scores_gemma":[0.9986205,0.0008374173,0.00009542725,0.000083905696,0.0001600146,0.00020270786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009083205,0.001055386,0.0015093259,0.0024085233,0.0027742418,0.005417714,0.000961048,0.0009733596,0.004846371],"category_scores_gemma":[0.0032461148,0.0007711727,0.0009878945,0.0023573604,0.0037316196,0.0063618673,0.0029295832,0.0029212115,0.0008072762],"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.00009227968,0.000026114385,0.00042588424,0.00006004158,0.000018039826,0.00015272087,0.00029247714,0.0009556683,0.0008663386,0.9906844,0.0019967295,0.004429374],"study_design_scores_gemma":[0.000055051827,0.000025359255,0.00090654084,0.000045390934,0.000021298703,0.00017635664,0.00020634741,0.0021521691,0.00047095507,0.9833754,0.01254268,0.000022526314],"about_ca_topic_score_codex":0.0024014486,"about_ca_topic_score_gemma":0.0013036006,"teacher_disagreement_score":0.005417714,"about_ca_system_score_codex":0.0038386744,"about_ca_system_score_gemma":0.00064279244,"threshold_uncertainty_score":0.027851641},"labels":[],"label_agreement":null},{"id":"W2003635579","doi":"10.1016/j.tcs.2008.04.021","title":"Analysis of set-up time models: A metric perspective","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Academy of Finland","keywords":"Set (abstract data type); Perspective (graphical); Metric (unit); Mathematics; Algorithm; Computer science; Programming language; Operations management; Economics; Geometry","score_opus":0.019206459615165435,"score_gpt":0.2516292936870263,"score_spread":0.23242283407186087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003635579","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.023661802,0.00084204646,0.9696904,0.00069925946,0.00005842737,0.000050263512,0.00019596015,0.00016973952,0.004632102],"genre_scores_gemma":[0.80587584,0.002762082,0.17993206,0.0002365097,0.00041701618,0.00044298737,0.0007208239,0.0003975608,0.009215092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99361116,0.0028709741,0.00033675236,0.00061483,0.0019599088,0.00060628576],"domain_scores_gemma":[0.9815579,0.0118478155,0.0024126177,0.0014685637,0.0016227514,0.0010903253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069015273,0.0023411268,0.0023940816,0.0027728623,0.0009933998,0.004548678,0.005004103,0.001848068,0.0050698384],"category_scores_gemma":[0.02355896,0.0011451816,0.0026106765,0.0034622634,0.0023444323,0.009718576,0.0034515695,0.0031834687,0.00043094903],"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.00005331264,0.000043933105,0.0006107118,0.00010898579,0.00008835017,0.00005465629,0.00013274649,0.39783865,0.0006937992,0.58884114,0.0007642676,0.010769435],"study_design_scores_gemma":[0.0000061939068,0.00006248309,0.0002229411,0.000020326866,0.000024896684,0.000032187378,0.00003608716,0.7981055,0.00029531,0.2001427,0.001036261,0.0000151335735],"about_ca_topic_score_codex":0.002268713,"about_ca_topic_score_gemma":0.001324077,"teacher_disagreement_score":0.0069015273,"about_ca_system_score_codex":0.004238819,"about_ca_system_score_gemma":0.00222735,"threshold_uncertainty_score":0.036499202},"labels":[],"label_agreement":null},{"id":"W2003815520","doi":"10.1016/j.tcs.2010.11.021","title":"On the size of inverse semigroups given by generators","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Injective function; Mathematics; Semigroup; Permutation (music); Discrete mathematics; Generator (circuit theory); Regular semigroup; Inverse; Property (philosophy); Domain (mathematical analysis); Combinatorics; Cancellative semigroup; Set (abstract data type); Pure mathematics; Special classes of semigroups; Mathematical analysis; Computer science; Geometry","score_opus":0.004691432277483324,"score_gpt":0.20709051736514558,"score_spread":0.20239908508766224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003815520","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.7389752,0.0019441375,0.20568027,0.007656435,0.00035432127,0.00008430608,0.0010764434,0.0007871568,0.043441776],"genre_scores_gemma":[0.9774778,0.0004933245,0.015594886,0.00032708084,0.0004960976,0.00014927372,0.00048033794,0.00027580632,0.004705349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661475,0.001402286,0.00020612183,0.0005715756,0.0008636812,0.00034157187],"domain_scores_gemma":[0.864823,0.123598106,0.0031804012,0.004065011,0.0020119136,0.0023216489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004571904,0.0007986706,0.0017853982,0.0017116724,0.0010400758,0.005079273,0.0020080798,0.0020922062,0.008863058],"category_scores_gemma":[0.037357997,0.0010614172,0.0010274457,0.0011278362,0.004503886,0.013691204,0.0029057816,0.0029983018,0.0005891639],"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.0007991075,0.00008820526,0.0024165236,0.00016772565,0.00004000257,0.0001415682,0.0008342307,0.013060028,0.0057125157,0.9628535,0.0022864777,0.011600187],"study_design_scores_gemma":[0.000092885144,0.00008775774,0.000917095,0.000034623146,0.000032204774,0.00018410018,0.00014703651,0.041271023,0.00280029,0.95321125,0.0011873977,0.00003438311],"about_ca_topic_score_codex":0.0004768671,"about_ca_topic_score_gemma":0.00046839795,"teacher_disagreement_score":0.008863058,"about_ca_system_score_codex":0.0014504637,"about_ca_system_score_gemma":0.0009007431,"threshold_uncertainty_score":0.029649913},"labels":[],"label_agreement":null},{"id":"W2003841667","doi":"10.1016/j.tcs.2014.04.018","title":"Approximating the maximum multiple RNA interaction problem","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Zhejiang Normal University; Alberta Innovates - Technology Futures","keywords":"Pseudoknot; RNA; Maximization; Pairwise comparison; Time complexity; Mathematics; Constant (computer programming); Order (exchange); Computer science; Combinatorics; Mathematical optimization; Biology; Genetics; Gene","score_opus":0.00843803895061503,"score_gpt":0.23313491176058718,"score_spread":0.22469687280997214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003841667","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.11810438,0.0013048921,0.85909456,0.0025659944,0.00016354243,0.0000943905,0.00050025276,0.000829194,0.017342811],"genre_scores_gemma":[0.7592479,0.00068564725,0.22457202,0.0005033657,0.00032404842,0.00036705143,0.0012460874,0.0005862731,0.012467613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975091,0.0012321,0.00005970075,0.00048342993,0.0004027563,0.00031282599],"domain_scores_gemma":[0.97951895,0.01785786,0.00068721053,0.00086318783,0.0004726515,0.00060012925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003457808,0.0016974257,0.0032248455,0.0014475101,0.001175854,0.0024934274,0.0048829955,0.003638769,0.008920915],"category_scores_gemma":[0.019934233,0.0012966797,0.0015299851,0.0021393744,0.0019484885,0.0049896147,0.003294855,0.00394244,0.0011251293],"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.0003865416,0.00021754,0.00096730137,0.00030473128,0.00008769115,0.00013947557,0.00012067738,0.8670244,0.0010664478,0.094672345,0.006368346,0.028644415],"study_design_scores_gemma":[0.000028973453,0.000023201583,0.00009689922,0.000008360587,0.0000092772225,0.000025958114,0.000020702186,0.93694854,0.00023236293,0.062145606,0.00045496755,0.000005198256],"about_ca_topic_score_codex":0.0020162554,"about_ca_topic_score_gemma":0.0022674063,"teacher_disagreement_score":0.008920915,"about_ca_system_score_codex":0.0024248427,"about_ca_system_score_gemma":0.0014841732,"threshold_uncertainty_score":0.02984339},"labels":[],"label_agreement":null},{"id":"W2004373556","doi":"10.1016/s0304-3975(02)00648-5","title":"Rank inequalities and separation algorithms for packing designs and sparse triple systems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Division of Mathematical Sciences; University of Toronto","keywords":"Polytope; Mathematics; Combinatorics; Algorithm; Rank (graph theory); Discrete mathematics","score_opus":0.034358244664242595,"score_gpt":0.26517106086767717,"score_spread":0.23081281620343458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004373556","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.01708951,0.0006779726,0.9674152,0.0008222588,0.00011340902,0.00011089532,0.00024741955,0.000271326,0.013252133],"genre_scores_gemma":[0.32408524,0.0019626264,0.64552927,0.00096857315,0.0006899901,0.0007464572,0.0014143111,0.00063416496,0.02396934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99570686,0.0016190462,0.00018844876,0.0005340596,0.0013247366,0.00062676345],"domain_scores_gemma":[0.98086655,0.013978725,0.0012622909,0.0019071224,0.0014943245,0.00049097533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044730427,0.0025896514,0.0022493578,0.0023506326,0.0017581108,0.0055341227,0.003242206,0.002647369,0.016367758],"category_scores_gemma":[0.026402073,0.0015689124,0.0016222425,0.0045673447,0.0026435016,0.009261146,0.0038986336,0.008019895,0.0028764668],"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.00046569385,0.0003493675,0.00073017704,0.0003956094,0.00008782667,0.000097455864,0.00036214184,0.12350809,0.0036898735,0.6907349,0.015822457,0.16375633],"study_design_scores_gemma":[0.00007008733,0.00011952141,0.00020291333,0.00006504764,0.00004241091,0.00008514888,0.00010592121,0.3525852,0.002128445,0.64143336,0.0031206852,0.000041185012],"about_ca_topic_score_codex":0.00171837,"about_ca_topic_score_gemma":0.0030656704,"teacher_disagreement_score":0.016367758,"about_ca_system_score_codex":0.0022668745,"about_ca_system_score_gemma":0.0026021085,"threshold_uncertainty_score":0.054755628},"labels":[],"label_agreement":null},{"id":"W2005606079","doi":"10.1016/j.tcs.2013.03.014","title":"Fast balanced partitioning is hard even on grids and trees","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Grid; Partition (number theory); Time complexity; Limit (mathematics); Reduction (mathematics); Approximation algorithm; Maximum cut; Graph partition; Discrete mathematics; Running time; Graph; Mathematical optimization","score_opus":0.012910397604447118,"score_gpt":0.23486422708311516,"score_spread":0.22195382947866804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005606079","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.6718516,0.0038424374,0.25984845,0.020735994,0.00084297307,0.000302758,0.006018068,0.0027494465,0.03380834],"genre_scores_gemma":[0.842642,0.0023439098,0.12278534,0.0018861678,0.0013250429,0.00036674496,0.007863024,0.001423486,0.01936434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975969,0.00040202343,0.00017447713,0.00078703056,0.0004599377,0.0005796059],"domain_scores_gemma":[0.9612544,0.030034179,0.0022817664,0.00379438,0.0012008358,0.0014345167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017622547,0.0021908258,0.0042471737,0.0013968693,0.0034165632,0.0068033678,0.0034629297,0.004152918,0.012268404],"category_scores_gemma":[0.020746868,0.0022656184,0.0020249016,0.0039453637,0.0033697565,0.019287268,0.0047151656,0.004992113,0.0023896112],"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.0076845116,0.0010310601,0.01069733,0.0034297798,0.0006250481,0.0015747787,0.0018511346,0.41465136,0.025487999,0.29488716,0.09253469,0.14554517],"study_design_scores_gemma":[0.0003731965,0.00010721113,0.001307715,0.00007638032,0.00007732283,0.00036761284,0.00049764727,0.22724701,0.002655786,0.7632121,0.004036059,0.000042019412],"about_ca_topic_score_codex":0.0037474763,"about_ca_topic_score_gemma":0.004438109,"teacher_disagreement_score":0.012268404,"about_ca_system_score_codex":0.0019314435,"about_ca_system_score_gemma":0.0020743941,"threshold_uncertainty_score":0.04104185},"labels":[],"label_agreement":null},{"id":"W2005705791","doi":"10.1016/j.tcs.2011.08.030","title":"Minimizing total completion time for re-entrant flow shop scheduling problems","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flow shop scheduling; Scheduling (production processes); Computer science; Completion (oil and gas wells); Mathematical optimization; Job shop scheduling; Mathematics; Schedule; Engineering; Mechanical engineering","score_opus":0.020333485618543153,"score_gpt":0.21991779575088086,"score_spread":0.1995843101323377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005705791","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.21933533,0.0013252611,0.7718836,0.0004978146,0.00018104119,0.00039053336,0.00046133422,0.00060335326,0.005321663],"genre_scores_gemma":[0.7594614,0.000918373,0.22980215,0.00012036992,0.00016240143,0.00034919227,0.0007093909,0.0005853905,0.007891366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980301,0.0009726785,0.00008132596,0.00025488553,0.0003183035,0.00034260738],"domain_scores_gemma":[0.9958903,0.0025035588,0.00048652478,0.00022569257,0.0004564401,0.0004374347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00435879,0.002496134,0.0033223568,0.0013462488,0.00080541254,0.0016318067,0.0024999315,0.0017012641,0.0030496393],"category_scores_gemma":[0.005845035,0.0011660113,0.001597177,0.0016815477,0.0009083949,0.0021572043,0.0010338151,0.0020145627,0.0003857331],"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.00040979983,0.0001768974,0.0003122337,0.00033660655,0.00009169644,0.00009757414,0.00007911356,0.9704705,0.004100549,0.005030841,0.0010448674,0.017849391],"study_design_scores_gemma":[0.000035929483,0.00025068916,0.00029519256,0.000012147597,0.000036858917,0.000033149387,0.000025583147,0.9921302,0.0015882333,0.0051816604,0.00039702764,0.000013236552],"about_ca_topic_score_codex":0.0041094436,"about_ca_topic_score_gemma":0.0036179004,"teacher_disagreement_score":0.00435879,"about_ca_system_score_codex":0.0016615427,"about_ca_system_score_gemma":0.0021294379,"threshold_uncertainty_score":0.023051739},"labels":[],"label_agreement":null},{"id":"W2005868985","doi":"10.1016/j.tcs.2010.10.007","title":"On the superimposition of Christoffel words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":29,"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":"Christoffel symbols; Superimposition; Mathematics; Conjecture; Root (linguistics); Existential quantification; Pure mathematics; Combinatorics; Arithmetic; Algebra over a field; Linguistics; Computer science; Artificial intelligence; Philosophy","score_opus":0.005362706332115055,"score_gpt":0.22263935071596114,"score_spread":0.21727664438384608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005868985","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.27629763,0.0020780626,0.47961855,0.0022952773,0.0022450814,0.00009530932,0.00021997801,0.0010236813,0.23612645],"genre_scores_gemma":[0.8857213,0.0008397239,0.06403614,0.00063336926,0.00082036405,0.00009221889,0.00027383267,0.0006019636,0.046981107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718934,0.0008735349,0.00017506856,0.0005967308,0.0006992882,0.0004659679],"domain_scores_gemma":[0.9936885,0.0036166527,0.00046092778,0.0008816803,0.0008874639,0.00046477816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019742167,0.00073301455,0.0010379016,0.0025823186,0.0036997858,0.0046116053,0.0017910328,0.0021518234,0.014279409],"category_scores_gemma":[0.012692783,0.0008901508,0.0010783564,0.0021122561,0.0059203417,0.008827828,0.004733596,0.003030914,0.0023746497],"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.000057390986,0.000009240652,0.00010283138,0.00001547447,0.0000049860982,0.00016795464,0.000497256,0.00036964266,0.0007686793,0.9899456,0.0005671874,0.00749386],"study_design_scores_gemma":[0.0000120930845,0.000024093266,0.00009426205,0.000017407998,0.000007980131,0.00016299142,0.0002102241,0.0032227368,0.0010388033,0.9886657,0.006525174,0.00001858661],"about_ca_topic_score_codex":0.0010291085,"about_ca_topic_score_gemma":0.00084594556,"teacher_disagreement_score":0.014279409,"about_ca_system_score_codex":0.0012381515,"about_ca_system_score_gemma":0.00077338866,"threshold_uncertainty_score":0.047769308},"labels":[],"label_agreement":null},{"id":"W2005930353","doi":"10.1016/j.tcs.2011.12.025","title":"Language theoretical properties of hairpin formations","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"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":"Variety (cybernetics); Class (philosophy); Regular language; Concatenation (mathematics); Closure (psychology); Aperiodic graph; Iterated function; Mathematics; Property (philosophy); Pumping lemma for regular languages; Discrete mathematics; Computer science; Combinatorics; Programming language; Second-generation programming language; Artificial intelligence; Fifth-generation programming language","score_opus":0.017979340750517714,"score_gpt":0.2343071813241843,"score_spread":0.21632784057366658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005930353","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.45866573,0.0011414608,0.39877796,0.0063581024,0.00028299613,0.00010700491,0.0005812089,0.0010209434,0.13306461],"genre_scores_gemma":[0.97769713,0.00026470545,0.013534373,0.0004765326,0.00023923934,0.000117094925,0.00025245777,0.00021056614,0.0072078276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983942,0.0005888966,0.000080581754,0.00023799429,0.00039623803,0.0003021506],"domain_scores_gemma":[0.9873733,0.009754777,0.0006002103,0.00084086217,0.0009221555,0.00050872524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021250977,0.00045639664,0.00086331903,0.0021291098,0.0027966641,0.0042444905,0.0018309446,0.0018239503,0.010284524],"category_scores_gemma":[0.013381513,0.000635454,0.0012426251,0.001401593,0.004449142,0.007604819,0.002319975,0.0033991265,0.0009937533],"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.000014566034,0.000012323929,0.00010594212,0.000015132794,0.0000027617746,0.00004258311,0.00027352932,0.0013202161,0.00035561458,0.99601763,0.0004260247,0.0014135878],"study_design_scores_gemma":[0.000008989926,0.000006651591,0.000045245524,0.000005446024,0.0000029662312,0.000035505356,0.000055431326,0.010221102,0.0002436498,0.98890954,0.00045819487,0.000007386833],"about_ca_topic_score_codex":0.0012790296,"about_ca_topic_score_gemma":0.00076653744,"teacher_disagreement_score":0.010284524,"about_ca_system_score_codex":0.0016669488,"about_ca_system_score_gemma":0.0011124685,"threshold_uncertainty_score":0.034405112},"labels":[],"label_agreement":null},{"id":"W2006059832","doi":"10.1016/j.tcs.2005.10.041","title":"The binomial transform and the analysis of skip lists","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Forming Technologies (Canada); University of Waterloo","funders":"","keywords":"Binomial (polynomial); Mathematics; Statistics; Computer science","score_opus":0.011181619839523616,"score_gpt":0.2941506066586219,"score_spread":0.2829689868190983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006059832","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.39921844,0.0052162465,0.4768541,0.005144538,0.00059244083,0.000056835026,0.0004283492,0.00049615174,0.1119929],"genre_scores_gemma":[0.9260958,0.0029519002,0.028133832,0.00060690485,0.0013410117,0.00008353023,0.00048253284,0.0002557505,0.040048786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912804,0.00029847142,0.000033133525,0.00008537814,0.00029706687,0.00015795998],"domain_scores_gemma":[0.995372,0.0029742199,0.0005109835,0.00026926657,0.00057612045,0.00029751417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019753764,0.0005319942,0.000847903,0.004235576,0.0019112725,0.002740955,0.0016375327,0.0011736546,0.009636141],"category_scores_gemma":[0.013423088,0.0005008493,0.00089389307,0.0033753596,0.0031743043,0.0069854637,0.0017794,0.002194548,0.0012090621],"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.000030585983,0.000012278592,0.00026424148,0.00002663049,0.0000047740104,0.00005682694,0.00009622741,0.0017541421,0.000310165,0.9905854,0.0011056104,0.005753207],"study_design_scores_gemma":[0.000006012976,0.000007614159,0.00017525797,0.000015863761,0.0000060070493,0.00008548799,0.000041409723,0.013528882,0.0002000837,0.98457205,0.0013512628,0.000010112954],"about_ca_topic_score_codex":0.0012686392,"about_ca_topic_score_gemma":0.0010989504,"teacher_disagreement_score":0.009636141,"about_ca_system_score_codex":0.0012362183,"about_ca_system_score_gemma":0.00091769284,"threshold_uncertainty_score":0.0322361},"labels":[],"label_agreement":null},{"id":"W2006144017","doi":"10.1016/j.tcs.2015.02.032","title":"Spread of influence in weighted networks under time and budget constraints","year":2015,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Bounded function; Time complexity; Set (abstract data type); Simple (philosophy); Combinatorics; Graph; Mathematics; Polynomial; Computer science; Discrete mathematics","score_opus":0.008156097673453464,"score_gpt":0.26168961917936084,"score_spread":0.25353352150590736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006144017","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.3335477,0.0016975394,0.6489337,0.0034545735,0.000111148314,0.00014610116,0.0010735093,0.00029156514,0.01074403],"genre_scores_gemma":[0.94673884,0.002540908,0.03591289,0.0002933661,0.00047682138,0.00034389188,0.0005068796,0.00028801555,0.012898425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675673,0.0015880908,0.0001447724,0.0006321689,0.0004720423,0.0004062022],"domain_scores_gemma":[0.88076997,0.1029702,0.007403222,0.0030395298,0.002879766,0.0029373346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008550073,0.0016756824,0.0030643912,0.004254581,0.0012715366,0.003960496,0.004354515,0.0036459195,0.006788302],"category_scores_gemma":[0.07773208,0.002320271,0.0013733617,0.003858366,0.0035049703,0.009811956,0.003007191,0.003030103,0.0005504836],"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.000368934,0.00009564352,0.0030006152,0.00025429402,0.00017056252,0.00030284826,0.0005027999,0.55736476,0.0016612675,0.41821635,0.0031267712,0.01493518],"study_design_scores_gemma":[0.000041502266,0.00003154773,0.00075208786,0.000031181204,0.000051000337,0.00008494007,0.00008289967,0.7358639,0.0003008307,0.26211885,0.0006157412,0.00002549697],"about_ca_topic_score_codex":0.0066256975,"about_ca_topic_score_gemma":0.0052124476,"teacher_disagreement_score":0.008550073,"about_ca_system_score_codex":0.0030126686,"about_ca_system_score_gemma":0.0012469527,"threshold_uncertainty_score":0.045217693},"labels":[],"label_agreement":null},{"id":"W2006186391","doi":"10.1016/j.tcs.2015.01.028","title":"Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Mathematics; Combinatorics; Injective function; Bijection; Treewidth; Homomorphism; Bounded function; Surjective function; Discrete mathematics; Algebra homomorphism; Graph; Tree-depth; 1-planar graph; Pathwidth; Chordal graph; Line graph","score_opus":0.04165431843452008,"score_gpt":0.29213325162119763,"score_spread":0.2504789331866776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006186391","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.6674292,0.0005214927,0.3144975,0.00077432767,0.000067013716,0.00009912744,0.00043340636,0.0008634724,0.015314522],"genre_scores_gemma":[0.948377,0.00028013482,0.04164994,0.0002601636,0.00010017753,0.0001725951,0.00040507762,0.00034634976,0.0084086545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871826,0.00038624034,0.000063371444,0.0003681379,0.00023551613,0.00022853015],"domain_scores_gemma":[0.990617,0.005240397,0.0011194695,0.0012365559,0.00049003673,0.0012965273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001122106,0.0005759798,0.00094996847,0.001595998,0.0016815596,0.0023975028,0.0020580834,0.0011516886,0.0063291825],"category_scores_gemma":[0.0076540657,0.00088662776,0.00065581605,0.0017778507,0.002016506,0.008713353,0.0033907355,0.0026990857,0.0007412017],"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.00033168547,0.00013966377,0.0011242541,0.00015451972,0.000032648728,0.000282897,0.0011506926,0.009493007,0.00964148,0.9573382,0.0013800255,0.018930824],"study_design_scores_gemma":[0.00003981552,0.000043873704,0.0005218117,0.000020026097,0.000021625185,0.00017603808,0.00028103427,0.025220364,0.0027244922,0.9692347,0.0016880253,0.000028184282],"about_ca_topic_score_codex":0.0011347564,"about_ca_topic_score_gemma":0.0014915862,"teacher_disagreement_score":0.0063291825,"about_ca_system_score_codex":0.001134203,"about_ca_system_score_gemma":0.0006215581,"threshold_uncertainty_score":0.021173239},"labels":[],"label_agreement":null},{"id":"W2007240595","doi":"10.1016/j.tcs.2012.08.011","title":"Compressed indexes for text with wildcards","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed suffix array; Search engine indexing; Computer science; Suffix array; Theoretical computer science; Suffix; Word (group theory); Algorithm; Combinatorics; Data structure; Mathematics; Pattern matching; String searching algorithm; Information retrieval; Artificial intelligence","score_opus":0.010163152623136596,"score_gpt":0.25236240226923884,"score_spread":0.24219924964610223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007240595","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.11356419,0.0051245643,0.83306324,0.002863272,0.0033587802,0.0006043397,0.009963763,0.0110430205,0.020414887],"genre_scores_gemma":[0.3482382,0.0025894959,0.6000324,0.0007942699,0.0022245885,0.0005489797,0.016535744,0.002024268,0.027012039],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978248,0.00024532684,0.00026942676,0.00025983443,0.0011913816,0.00020919979],"domain_scores_gemma":[0.992332,0.0022050713,0.00043666223,0.0030777673,0.0017132389,0.00023523383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009287255,0.0008508227,0.0012209662,0.004606519,0.0012183163,0.0029379434,0.0012798986,0.0010650103,0.013192818],"category_scores_gemma":[0.014863412,0.0004626845,0.0005335161,0.0067204204,0.00105106,0.0053831204,0.0022666254,0.0013409435,0.005221703],"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.001374702,0.0002536032,0.0011687735,0.00056554505,0.00007883178,0.0008394077,0.0004462819,0.013503952,0.04239162,0.14011961,0.0636119,0.7356458],"study_design_scores_gemma":[0.00030028322,0.00053283275,0.0021292244,0.00031870563,0.00020565584,0.0024697643,0.00045035183,0.29201284,0.12421518,0.4198508,0.15737137,0.00014299552],"about_ca_topic_score_codex":0.0015475508,"about_ca_topic_score_gemma":0.0020433296,"teacher_disagreement_score":0.013192818,"about_ca_system_score_codex":0.00100031,"about_ca_system_score_gemma":0.0017779099,"threshold_uncertainty_score":0.04413432},"labels":[],"label_agreement":null},{"id":"W2007245320","doi":"10.1016/j.tcs.2009.02.022","title":"On the intersection of regex languages with regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Regular language; Computer science; Regular expression; Intersection (aeronautics); Closure (psychology); Programming language; Pushdown automaton; Automaton; Language family; Semantics (computer science); Formal language; Nondeterministic finite automaton; Theoretical computer science; Class (philosophy); Discrete mathematics; Mathematics; Automata theory; Artificial intelligence; Linguistics","score_opus":0.004291568309149471,"score_gpt":0.2292128165166391,"score_spread":0.22492124820748963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007245320","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.5206114,0.002244387,0.33290002,0.0035378516,0.0003422174,0.000104441344,0.0005195549,0.0010505697,0.13868964],"genre_scores_gemma":[0.93512666,0.0009517636,0.041365504,0.00053195615,0.0005089868,0.0001666951,0.0007735474,0.00045787045,0.020116994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963586,0.0012679059,0.0002615873,0.0007116969,0.0007718924,0.0006283292],"domain_scores_gemma":[0.9834125,0.011806936,0.001401154,0.0010600155,0.0012775848,0.0010417533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040257364,0.00078424625,0.0017105067,0.0026807676,0.0033712413,0.0067881728,0.0019769536,0.0018509924,0.008797784],"category_scores_gemma":[0.01199203,0.00155032,0.001952543,0.002196601,0.0061014327,0.016680855,0.0061599184,0.0045674904,0.0011925873],"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.00015219224,0.00002648814,0.00039694872,0.000032246196,0.00001144233,0.00017717591,0.0007318121,0.0008453847,0.0006370494,0.9927643,0.0005220781,0.0037028862],"study_design_scores_gemma":[0.000021523809,0.000034612414,0.00022788427,0.000030936397,0.00001910014,0.00023155219,0.00034896532,0.0071398057,0.0008298734,0.9883293,0.0027651102,0.00002130919],"about_ca_topic_score_codex":0.00085049844,"about_ca_topic_score_gemma":0.00058065954,"teacher_disagreement_score":0.008797784,"about_ca_system_score_codex":0.0016373886,"about_ca_system_score_gemma":0.00092644093,"threshold_uncertainty_score":0.029431581},"labels":[],"label_agreement":null},{"id":"W2007361403","doi":"10.1016/j.tcs.2007.04.037","title":"Every real number greater than 1 is a critical exponent","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponent; Mathematics; Combinatorics; Critical exponent; Discrete mathematics; Geometry; Scaling; Philosophy","score_opus":0.012511110645053121,"score_gpt":0.2786504745501137,"score_spread":0.2661393639050606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007361403","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.77058524,0.0057223644,0.08842201,0.0058100563,0.0035388935,0.00033054748,0.00079621986,0.0009799418,0.123814695],"genre_scores_gemma":[0.9695044,0.0013051418,0.014068084,0.00046712172,0.00081543525,0.00017475424,0.00018537375,0.00014496689,0.013334626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951255,0.000067356246,0.000043281136,0.00015510335,0.000088372275,0.00013330397],"domain_scores_gemma":[0.9936598,0.003960516,0.0006991439,0.00047393973,0.00063633797,0.0005702821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008687832,0.0010710352,0.0011122042,0.0021964847,0.0016046392,0.0025347339,0.0006470019,0.001150678,0.009293872],"category_scores_gemma":[0.006053191,0.00035420497,0.0004199298,0.001071398,0.0032813998,0.0039289207,0.0018368781,0.0019044518,0.0016672258],"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.0012040643,0.00012581506,0.00388646,0.00072088355,0.00007369572,0.0026334885,0.0012284226,0.00064329297,0.05143366,0.8756044,0.010118944,0.05232692],"study_design_scores_gemma":[0.00029142573,0.0003314705,0.0034068504,0.00030650853,0.00015293875,0.004927373,0.0009094098,0.003538718,0.029118456,0.87235516,0.08455544,0.00010632827],"about_ca_topic_score_codex":0.000071295166,"about_ca_topic_score_gemma":0.00008239118,"teacher_disagreement_score":0.009293872,"about_ca_system_score_codex":0.0005994739,"about_ca_system_score_gemma":0.0004085631,"threshold_uncertainty_score":0.031091154},"labels":[],"label_agreement":null},{"id":"W2007370828","doi":"10.1016/s0304-3975(02)00326-2","title":"Alternating and empty alternating auxiliary stack automata","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Stack (abstract data type); PSPACE; Automaton; Polynomial hierarchy; Bounded function; Hierarchy; Constant (computer programming); Mathematics; Combinatorics; Discrete mathematics; Time complexity; Computer science; Theoretical computer science; Computational complexity theory; Algorithm; Programming language","score_opus":0.00864102512398008,"score_gpt":0.24640921420933193,"score_spread":0.23776818908535186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007370828","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.41668695,0.00064877974,0.5020107,0.0015484339,0.000562473,0.00011529161,0.00076493365,0.0014350552,0.07622731],"genre_scores_gemma":[0.9195094,0.00029746615,0.049632248,0.00027082174,0.00019402585,0.00015674006,0.0005553172,0.00038446757,0.028999517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981912,0.00042802983,0.0002042954,0.00035032982,0.0004077086,0.00041843887],"domain_scores_gemma":[0.99138874,0.0044266493,0.00052720506,0.0015780784,0.0013071157,0.00077222486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020884601,0.0007657876,0.00082749315,0.0011396908,0.0027513115,0.004823849,0.001840299,0.0018151436,0.011737646],"category_scores_gemma":[0.009943795,0.00077743194,0.0013747234,0.001207827,0.0045437687,0.016124245,0.004218632,0.0036630959,0.001666899],"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.0001789695,0.00003933013,0.0003285521,0.000036462923,0.00000664551,0.000119959106,0.0005756085,0.00076996913,0.0018451303,0.9892067,0.0008633074,0.006029427],"study_design_scores_gemma":[0.0000208341,0.000028907136,0.00016970915,0.000011905355,0.00002734934,0.00017361956,0.00019505556,0.008922322,0.0029336622,0.98382044,0.0036741265,0.000022087317],"about_ca_topic_score_codex":0.00053122075,"about_ca_topic_score_gemma":0.0006449165,"teacher_disagreement_score":0.011737646,"about_ca_system_score_codex":0.00076529046,"about_ca_system_score_gemma":0.0011247644,"threshold_uncertainty_score":0.039266348},"labels":[],"label_agreement":null},{"id":"W2007760711","doi":"10.1016/j.tcs.2012.03.039","title":"Computing majority with triple queries","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Combinatorics; Theoretical computer science; Mathematics; Algebra over a field; Programming language; Pure mathematics","score_opus":0.009783002692198995,"score_gpt":0.23614565000176804,"score_spread":0.22636264730956904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007760711","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.24587663,0.002909726,0.67672235,0.011834107,0.0015695574,0.00035233158,0.0024785136,0.010422415,0.047834344],"genre_scores_gemma":[0.8458516,0.0005546679,0.1300106,0.002057597,0.0010648282,0.00027272353,0.0016776065,0.0011565097,0.017353974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992653,0.0020724938,0.00053939165,0.0014765481,0.001980897,0.0012776357],"domain_scores_gemma":[0.981862,0.009477708,0.00058495166,0.005308123,0.0017870992,0.0009800717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047749733,0.0011073997,0.0027195455,0.0013141987,0.0025511526,0.0061673927,0.0025858115,0.0021499381,0.014491813],"category_scores_gemma":[0.024160886,0.0007432785,0.0014234573,0.0026884098,0.002530217,0.01377023,0.007448563,0.0036063434,0.004787552],"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.006027947,0.0005278703,0.0044567925,0.0009028062,0.0003385633,0.0005772418,0.0010403154,0.049799602,0.01209111,0.5016593,0.08682543,0.33575308],"study_design_scores_gemma":[0.00020631251,0.00016132153,0.00018008718,0.000044137225,0.00010279922,0.00023421654,0.00025099193,0.13520774,0.0075402134,0.8469869,0.0090459185,0.000039257473],"about_ca_topic_score_codex":0.001210785,"about_ca_topic_score_gemma":0.002209262,"teacher_disagreement_score":0.014491813,"about_ca_system_score_codex":0.0016001969,"about_ca_system_score_gemma":0.0023261253,"threshold_uncertainty_score":0.048479974},"labels":[],"label_agreement":null},{"id":"W2009450360","doi":"10.1016/j.tcs.2010.07.004","title":"Parameterized pursuit-evasion games","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Pursuit-evasion; Computer science; Evasion (ethics); Mathematics; Theoretical computer science; Artificial intelligence; Algorithm; Biology; Genetics","score_opus":0.018033996881260575,"score_gpt":0.2857333243694043,"score_spread":0.26769932748814373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009450360","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.27710283,0.00046878698,0.67980343,0.0015779289,0.00008021507,0.00018204922,0.00044796686,0.0006375673,0.039699167],"genre_scores_gemma":[0.9651932,0.0002066278,0.025030732,0.00009439067,0.000027694017,0.00012673702,0.00019789182,0.000061758445,0.009060934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988244,0.0005330831,0.000053072505,0.00017484264,0.00021608992,0.00019838453],"domain_scores_gemma":[0.995697,0.0029445502,0.0003652966,0.0004470032,0.00020888411,0.00033711756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013040875,0.0012325653,0.001351832,0.00041978352,0.00057881756,0.0022220227,0.0019339675,0.002117739,0.005987364],"category_scores_gemma":[0.009567447,0.0005479228,0.00069323205,0.00064553635,0.0013415318,0.0034934862,0.002164019,0.0022109349,0.0005447787],"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.0007306167,0.00020917242,0.0010929962,0.00016945922,0.00009821068,0.00019987572,0.00021745668,0.48052233,0.0035059333,0.48029724,0.00423277,0.028724054],"study_design_scores_gemma":[0.0001454924,0.00007719744,0.00020464249,0.000012011312,0.000018396882,0.000052957286,0.000031898137,0.7793347,0.00052122213,0.21846017,0.0011261803,0.0000151420745],"about_ca_topic_score_codex":0.0010025492,"about_ca_topic_score_gemma":0.0009984928,"teacher_disagreement_score":0.005987364,"about_ca_system_score_codex":0.001848433,"about_ca_system_score_gemma":0.0012325852,"threshold_uncertainty_score":0.020029783},"labels":[],"label_agreement":null},{"id":"W2009536531","doi":"10.1016/j.tcs.2005.09.021","title":"LA, permutations, and the Hajós Calculus","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Calculus (dental); Mathematics; Combinatorics; Computer science; Discrete mathematics; Medicine","score_opus":0.008720736149654174,"score_gpt":0.28047096780701675,"score_spread":0.27175023165736256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009536531","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.29264903,0.0072963405,0.44168133,0.008810922,0.00086626556,0.00013653937,0.0004893112,0.0014840799,0.24658619],"genre_scores_gemma":[0.93800145,0.0014338888,0.031034341,0.0005530153,0.000422106,0.00011641617,0.00014267635,0.00012690635,0.02816918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985114,0.00059755635,0.00007538085,0.000205142,0.00029588857,0.00031463342],"domain_scores_gemma":[0.99796546,0.001122682,0.00017673091,0.0003712625,0.00018519918,0.00017864646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021994412,0.0004499796,0.0007924711,0.001336509,0.0031074747,0.004142809,0.0009775884,0.0013937332,0.0051032063],"category_scores_gemma":[0.003928712,0.000497603,0.0010805221,0.0011794925,0.0066911047,0.0075245844,0.0022327248,0.0026030317,0.0008288157],"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.000025227804,0.000007739128,0.00007920952,0.000008890223,0.0000030352617,0.00002394286,0.00009428529,0.0004752986,0.00018232205,0.995895,0.00036351223,0.0028415597],"study_design_scores_gemma":[0.0000059851823,0.0000058143523,0.00003824583,0.00000422839,0.000004718181,0.000018996741,0.000028327178,0.0014532625,0.00015511218,0.9952833,0.0029954354,0.0000066047933],"about_ca_topic_score_codex":0.0038198396,"about_ca_topic_score_gemma":0.0029232036,"teacher_disagreement_score":0.0051032063,"about_ca_system_score_codex":0.0016984992,"about_ca_system_score_gemma":0.0017903033,"threshold_uncertainty_score":0.017071903},"labels":[],"label_agreement":null},{"id":"W2009538436","doi":"10.1016/j.tcs.2008.12.046","title":"Parallelizing quantum circuits","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Engineering and Physical Sciences Research Council","keywords":"Rewriting; Computer science; Logarithm; Qubit; Electronic circuit; Polynomial; Quantum circuit; Quantum; Quantum computer; Constant (computer programming); Quantum algorithm; Algorithm; Translation (biology); Theoretical computer science; Mathematics; Quantum error correction; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.009636575686006338,"score_gpt":0.24534133830624205,"score_spread":0.2357047626202357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009538436","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.17793876,0.0015883134,0.5144306,0.005336177,0.0018547353,0.00026619478,0.00024706454,0.0021991734,0.29613897],"genre_scores_gemma":[0.8499258,0.0010663521,0.09644703,0.0007818268,0.0007210636,0.00020309303,0.00024141042,0.00056367466,0.050049685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951315,0.00013309534,0.000015176636,0.00008399431,0.00017787446,0.00007677445],"domain_scores_gemma":[0.9990269,0.0004750321,0.000040207728,0.00029159346,0.000112080685,0.000054160035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051607203,0.0006334661,0.0008416028,0.0005792975,0.0011152634,0.0013950061,0.0010084147,0.0010901599,0.016893651],"category_scores_gemma":[0.0027139555,0.000433623,0.0006607374,0.000805342,0.0015694832,0.0026194372,0.0018119308,0.0022309928,0.001456792],"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.00010247567,0.000059325786,0.00013372283,0.00008370268,0.000021200522,0.000040548257,0.000084903964,0.018571403,0.004410565,0.9476494,0.0041463836,0.02469642],"study_design_scores_gemma":[0.00004147442,0.000035521298,0.00012340702,0.000016005879,0.000016129245,0.0000455127,0.000029821014,0.08843332,0.0045843557,0.8976171,0.009046104,0.000011181122],"about_ca_topic_score_codex":0.0006159481,"about_ca_topic_score_gemma":0.00079516176,"teacher_disagreement_score":0.016893651,"about_ca_system_score_codex":0.00097155717,"about_ca_system_score_gemma":0.0006733346,"threshold_uncertainty_score":0.05651492},"labels":[],"label_agreement":null},{"id":"W2009831508","doi":"10.1016/j.tcs.2013.03.016","title":"Complexity of Canadian traveler problem variants","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Israel Science Foundation","keywords":"PSPACE; Combinatorics; Mathematics; Time complexity; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics; Path (computing); Travelling salesman problem; Computational complexity theory; Computer science; Algorithm","score_opus":0.03185590816938742,"score_gpt":0.24652722804301677,"score_spread":0.21467131987362936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009831508","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.6163009,0.0029390613,0.12968165,0.007598728,0.0005001548,0.000523728,0.006892658,0.0005964079,0.23496674],"genre_scores_gemma":[0.90822977,0.0010989526,0.040836092,0.00044163706,0.00020427431,0.00023186106,0.0050344416,0.00036540514,0.04355757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971156,0.000695882,0.00010209706,0.00046401826,0.0008312533,0.0007911394],"domain_scores_gemma":[0.99384034,0.0039781877,0.00029597414,0.0005446208,0.0007497568,0.0005911927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018934484,0.0012188625,0.0017529908,0.0019847467,0.0030146497,0.0063514975,0.003783354,0.0025664372,0.02134353],"category_scores_gemma":[0.014645684,0.00070195226,0.001748315,0.003647964,0.0024647554,0.0048752166,0.0021436643,0.003797532,0.00091784063],"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.0009026198,0.00033238542,0.0030909025,0.00026300168,0.00010146419,0.00024101067,0.00054113095,0.20986886,0.00082553824,0.6964036,0.047480255,0.03994911],"study_design_scores_gemma":[0.000249317,0.00009039744,0.0022370766,0.00006650974,0.00009410503,0.00022694403,0.000623275,0.45906088,0.00068609376,0.5190466,0.01753201,0.00008675705],"about_ca_topic_score_codex":0.2072077,"about_ca_topic_score_gemma":0.19406295,"teacher_disagreement_score":0.2072077,"about_ca_system_score_codex":0.012238029,"about_ca_system_score_gemma":0.010143134,"threshold_uncertainty_score":0.41200322},"labels":[],"label_agreement":null},{"id":"W2010017329","doi":"10.1016/j.tcs.2005.01.001","title":"Gathering of asynchronous robots with limited visibility","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":396,"is_retracted":false,"has_abstract":false,"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":"Visibility; Asynchronous communication; Robot; Computer science; Orientation (vector space); Mobile robot; Convergence (economics); Computation; Protocol (science); Point (geometry); Artificial intelligence; Distributed computing; Computer vision; Theoretical computer science; Algorithm; Mathematics; Telecommunications; Geography; Geometry","score_opus":0.01010129519343213,"score_gpt":0.24813068238141042,"score_spread":0.23802938718797828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010017329","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.41336673,0.00038825773,0.5761545,0.00044563046,0.000093911345,0.00009278255,0.00012524684,0.00027519415,0.009057682],"genre_scores_gemma":[0.9575259,0.00023103664,0.03553186,0.000046470403,0.00007049714,0.00009972924,0.00012190866,0.00006429185,0.0063083195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994592,0.00014293616,0.000028873854,0.00013220971,0.00011641868,0.00012045916],"domain_scores_gemma":[0.99365956,0.003969991,0.0008669955,0.00043220652,0.00039695916,0.0006743584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010417352,0.00094783574,0.0014558004,0.0013336565,0.0015240757,0.0016067482,0.0019993105,0.0015280626,0.0033241825],"category_scores_gemma":[0.008131398,0.0009887179,0.00087479356,0.0010193528,0.001377421,0.0027491644,0.003015001,0.0010430317,0.00041623233],"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.0014088457,0.00021194556,0.0024074102,0.000364104,0.0001172489,0.00071841985,0.0005417521,0.83880055,0.012477862,0.110369325,0.0019883045,0.030594153],"study_design_scores_gemma":[0.0000849385,0.00012727562,0.0003204925,0.000010715969,0.000024694078,0.00005283003,0.000072068775,0.95481735,0.00097413134,0.042982668,0.00051862525,0.000014170518],"about_ca_topic_score_codex":0.0018704319,"about_ca_topic_score_gemma":0.0017057193,"teacher_disagreement_score":0.0033241825,"about_ca_system_score_codex":0.0007348095,"about_ca_system_score_gemma":0.00067228585,"threshold_uncertainty_score":0.011120498},"labels":[],"label_agreement":null},{"id":"W2010156088","doi":"10.1016/j.tcs.2012.02.032","title":"Exhaustive generation of gominoes","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Université du Québec à Montréal","funders":"","keywords":"Polyomino; Inscribed figure; Rectangle; Combinatorics; Mathematics; Variation (astronomy); Perimeter; Discrete mathematics; Algorithm; Geometry","score_opus":0.065314358300083,"score_gpt":0.33972747087065164,"score_spread":0.27441311257056866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010156088","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.5872564,0.00062285067,0.2775564,0.001030799,0.00046953827,0.0004604423,0.002710408,0.0020403245,0.12785286],"genre_scores_gemma":[0.8795824,0.00024797494,0.08821504,0.00028528838,0.000042904183,0.00020645627,0.003365806,0.0006013245,0.02745276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995097,0.00009779698,0.000019319434,0.00009716353,0.00012987023,0.00014616136],"domain_scores_gemma":[0.99916637,0.00032325782,0.000042579035,0.00021944907,0.00017604344,0.00007240452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037577195,0.00042073842,0.00053475634,0.0009722377,0.0010944929,0.0009103973,0.00071259204,0.00074906554,0.017345404],"category_scores_gemma":[0.0024434263,0.00025460607,0.0006629239,0.0007328497,0.00070582685,0.0010036587,0.0022769016,0.0006332814,0.002042927],"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.000925609,0.00028478753,0.005232939,0.0008622685,0.00012422807,0.0016569021,0.0012701051,0.034691196,0.082037054,0.60591424,0.032257557,0.23474318],"study_design_scores_gemma":[0.0002291214,0.00031789253,0.0029711106,0.00022023698,0.00015415998,0.0007151129,0.0008205842,0.1286986,0.048199132,0.7337178,0.08387612,0.00008018242],"about_ca_topic_score_codex":0.00076700107,"about_ca_topic_score_gemma":0.0018388596,"teacher_disagreement_score":0.017345404,"about_ca_system_score_codex":0.00048379716,"about_ca_system_score_gemma":0.000642192,"threshold_uncertainty_score":0.058026135},"labels":[],"label_agreement":null},{"id":"W2010285287","doi":"10.1016/j.tcs.2007.10.039","title":"Words avoiding repetitions in arithmetic progressions","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arithmetic; Mathematics; Computer science","score_opus":0.009246700703768323,"score_gpt":0.2716644404241367,"score_spread":0.26241773972036836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010285287","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.65613014,0.00091026246,0.26748446,0.0011437006,0.0005293365,0.00014142474,0.00029031886,0.0016333521,0.071737],"genre_scores_gemma":[0.922271,0.00030382088,0.04751918,0.00024078785,0.0002582732,0.0001851889,0.0002491849,0.00036838188,0.0286042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801576,0.0006064755,0.00022509639,0.0004100786,0.0004166558,0.0003259463],"domain_scores_gemma":[0.99337715,0.004218604,0.0006258011,0.0008683625,0.0005937025,0.0003163081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011698017,0.00089662353,0.0011598074,0.0014740047,0.0030218759,0.0037850135,0.0013370406,0.0020771201,0.007910134],"category_scores_gemma":[0.0077202357,0.0010073915,0.0011653535,0.0015474337,0.0036890863,0.006799341,0.0026690708,0.0024441774,0.0022093568],"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.00024217807,0.00004805781,0.0003681942,0.00011823275,0.000013916941,0.00066864985,0.0016009711,0.0015749895,0.005423911,0.971254,0.0012666511,0.01742029],"study_design_scores_gemma":[0.000030403175,0.000054721437,0.00013104889,0.000022724196,0.000020654461,0.0003591517,0.00017895525,0.0030692036,0.002274908,0.9903323,0.0035005058,0.000025367264],"about_ca_topic_score_codex":0.00031697316,"about_ca_topic_score_gemma":0.0004498297,"teacher_disagreement_score":0.007910134,"about_ca_system_score_codex":0.00066494837,"about_ca_system_score_gemma":0.0006047059,"threshold_uncertainty_score":0.026462018},"labels":[],"label_agreement":null},{"id":"W2010962367","doi":"10.1016/s0304-3975(00)00019-0","title":"A space lower bound for st-connectivity on node-named JAGs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Turing machine; Discrete mathematics; Path (computing); Logarithm; Directed graph; Space (punctuation); Computation; Computer science; Algorithm","score_opus":0.014345452906201827,"score_gpt":0.2586123640249335,"score_spread":0.24426691111873167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010962367","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.24734291,0.006861178,0.6103158,0.014707546,0.001096306,0.0006259862,0.006905765,0.005769331,0.10637516],"genre_scores_gemma":[0.8329423,0.004221975,0.12770307,0.0024101508,0.0015392908,0.00079379487,0.004534501,0.0019094668,0.02394549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99307597,0.0015488283,0.00034226626,0.0010029365,0.0021341548,0.0018958969],"domain_scores_gemma":[0.9438062,0.038389776,0.0024955063,0.008825491,0.0031983447,0.0032846981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041349595,0.0031531607,0.0043799384,0.004276139,0.004260413,0.00935687,0.0074359463,0.0042905235,0.026189309],"category_scores_gemma":[0.032003418,0.001647362,0.0030004052,0.008818612,0.0051785507,0.02384402,0.010069128,0.008285046,0.003877908],"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.0030778244,0.0006942692,0.0043541263,0.0018496743,0.00037127474,0.00050039537,0.0016043497,0.2411789,0.013189724,0.5798799,0.052379116,0.10092049],"study_design_scores_gemma":[0.00019177083,0.0004010643,0.0011242512,0.00019935498,0.00032222856,0.0005179285,0.00043706302,0.38280624,0.0056325765,0.5969852,0.011283197,0.000099016506],"about_ca_topic_score_codex":0.0036304267,"about_ca_topic_score_gemma":0.005536236,"teacher_disagreement_score":0.026189309,"about_ca_system_score_codex":0.004539959,"about_ca_system_score_gemma":0.003748452,"threshold_uncertainty_score":0.08761191},"labels":[],"label_agreement":null},{"id":"W2011273749","doi":"10.1016/j.tcs.2010.06.019","title":"The “runs” conjecture","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Conjecture; Combinatorics; Collatz conjecture; Mathematics; Upper and lower bounds; String (physics); Lonely runner conjecture; Discrete mathematics; Mathematical analysis","score_opus":0.0038316263642889036,"score_gpt":0.23197776452990565,"score_spread":0.22814613816561674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011273749","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.1002669,0.008462532,0.42923638,0.11475693,0.004958329,0.00012460357,0.0023498284,0.0030135727,0.3368309],"genre_scores_gemma":[0.8231403,0.004026362,0.062953666,0.024944212,0.00812778,0.00055141695,0.0035984244,0.001990145,0.07066767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99324965,0.0021100272,0.00030427045,0.0020713331,0.001527912,0.00073683856],"domain_scores_gemma":[0.96385396,0.022455616,0.0009588996,0.00995871,0.0019800197,0.00079289026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005141123,0.001409434,0.0022660173,0.0013155399,0.0033817093,0.0061847046,0.0029495475,0.0050896597,0.021665877],"category_scores_gemma":[0.03802357,0.0010762828,0.0017348207,0.0020915233,0.010704509,0.028531265,0.007115332,0.012318393,0.0061275274],"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.00031376653,0.00005344992,0.0008029915,0.00014704582,0.000060384675,0.0001285238,0.00023889117,0.0034399128,0.0008023222,0.9447317,0.033034246,0.016246775],"study_design_scores_gemma":[0.000029483337,0.000012705575,0.00015096944,0.000033736633,0.00001567728,0.000068486384,0.000047718866,0.004856734,0.00046320303,0.9865089,0.0077985106,0.0000138059695],"about_ca_topic_score_codex":0.0012622031,"about_ca_topic_score_gemma":0.001041013,"teacher_disagreement_score":0.021665877,"about_ca_system_score_codex":0.0016934549,"about_ca_system_score_gemma":0.0018845423,"threshold_uncertainty_score":0.072479546},"labels":[],"label_agreement":null},{"id":"W2012753472","doi":"10.1016/j.tcs.2014.09.008","title":"On the conditional diagnosability of matching composition networks","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Composition (language); Matching (statistics); Mathematics; Computer science; Arithmetic; Algorithm; Discrete mathematics; Theoretical computer science; Statistics; Linguistics; Philosophy","score_opus":0.00697799373161165,"score_gpt":0.2244925295369179,"score_spread":0.21751453580530625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012753472","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.2273521,0.00044919766,0.7529498,0.0017312211,0.00012457994,0.00010781607,0.00037238398,0.0008980017,0.01601495],"genre_scores_gemma":[0.9603324,0.00037650266,0.033885363,0.00028931096,0.0001628388,0.00011836341,0.00046119688,0.00014597528,0.004228135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997124,0.00086116913,0.00014472772,0.0006150995,0.00079992315,0.00045492177],"domain_scores_gemma":[0.9531989,0.038088348,0.002386515,0.002584036,0.0023307404,0.0014114442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037778586,0.0007928904,0.0009833926,0.0016129523,0.0010019075,0.0022379232,0.0022147927,0.001603551,0.006761282],"category_scores_gemma":[0.035219513,0.0006793905,0.0011790072,0.001226556,0.004366497,0.006759592,0.0030243923,0.0037981884,0.00033458756],"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.0005158624,0.000112891394,0.002153163,0.00020852966,0.00007005897,0.0002872101,0.00043065473,0.113015115,0.005165943,0.8526759,0.0013972223,0.023967303],"study_design_scores_gemma":[0.00004182618,0.000055875596,0.0004756705,0.00003107123,0.000034635792,0.000100097815,0.000055638327,0.27014458,0.0022528025,0.7261911,0.0005969136,0.000019883955],"about_ca_topic_score_codex":0.0022630696,"about_ca_topic_score_gemma":0.0017796304,"teacher_disagreement_score":0.006761282,"about_ca_system_score_codex":0.0022156802,"about_ca_system_score_gemma":0.0018801956,"threshold_uncertainty_score":0.02261877},"labels":[],"label_agreement":null},{"id":"W2013154696","doi":"10.1016/j.tcs.2015.01.024","title":"A characterization of oblivious message adversaries for which Consensus is solvable","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Henan Institute of Science and Technology; Agence Nationale de la Recherche","keywords":"Network topology; Adversary; Computer science; Set (abstract data type); Theoretical computer science; Characterization (materials science); Message passing; Consensus algorithm; Topology (electrical circuits); Mathematics; Computer network; Discrete mathematics; Distributed computing; Algorithm; Computer security; Combinatorics","score_opus":0.01790132295529213,"score_gpt":0.25373043773067583,"score_spread":0.2358291147753837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013154696","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.33313566,0.00043518146,0.60224676,0.006355965,0.00021608683,0.00047938447,0.0008094664,0.0013362719,0.054985203],"genre_scores_gemma":[0.9668893,0.0002999884,0.02185502,0.0007232455,0.00021773229,0.000298663,0.00051713636,0.00023360735,0.00896528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959692,0.0009917517,0.0002600859,0.0009397358,0.0009389519,0.00090033194],"domain_scores_gemma":[0.9585508,0.029917112,0.0043512704,0.0031317659,0.0020450787,0.002003965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035357922,0.0013359421,0.0023045496,0.0017965322,0.0029823836,0.0067454083,0.0035162352,0.0043738126,0.0060306173],"category_scores_gemma":[0.032967128,0.00126607,0.001711155,0.0019666606,0.005399574,0.010541299,0.005916145,0.006678136,0.00094472885],"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.00032890897,0.00011437503,0.00066059956,0.00013277115,0.0000649771,0.00021702745,0.0005671251,0.03271678,0.0035212557,0.95336,0.0030245748,0.005291645],"study_design_scores_gemma":[0.000070836766,0.00006868053,0.00014744092,0.00002179683,0.000027437087,0.00013553895,0.00014750646,0.15607278,0.0012662533,0.84070075,0.0013140545,0.000027050486],"about_ca_topic_score_codex":0.00095045596,"about_ca_topic_score_gemma":0.00073555676,"teacher_disagreement_score":0.0067454083,"about_ca_system_score_codex":0.0030237255,"about_ca_system_score_gemma":0.0031172333,"threshold_uncertainty_score":0.0219388},"labels":[],"label_agreement":null},{"id":"W2013181989","doi":"10.1016/s0304-3975(02)00317-1","title":"A probabilistic analysis of randomly generated binary constraint satisfaction problems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Probabilistic logic; Binary number; Constraint (computer-aided design); Constraint satisfaction; Complexity of constraint satisfaction; Mathematics; Probabilistic analysis of algorithms; Computer science; Constraint satisfaction dual problem; Algorithm; Combinatorics; Theoretical computer science; Local consistency; Statistics; Arithmetic","score_opus":0.011029752993038324,"score_gpt":0.23533883175807763,"score_spread":0.2243090787650393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013181989","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.16134584,0.0010156275,0.82618433,0.0020740863,0.00009382191,0.0004580587,0.00081379904,0.00058491447,0.007429523],"genre_scores_gemma":[0.839408,0.0007496845,0.15175696,0.00040648656,0.00021449158,0.0008206056,0.0019273836,0.00038085427,0.0043355385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9870586,0.0062038363,0.0004459711,0.0013596356,0.0039662486,0.0009657171],"domain_scores_gemma":[0.82713825,0.1556228,0.0053488254,0.0051789447,0.005460812,0.001250366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014126504,0.0009128251,0.0017862993,0.003012346,0.001572347,0.0027790943,0.0044332263,0.0022490462,0.0073073176],"category_scores_gemma":[0.0975343,0.0014628996,0.0019906065,0.0035309067,0.0027852391,0.0045509823,0.00264799,0.0035203043,0.00044065516],"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.00050269853,0.0002901615,0.004316227,0.0003081596,0.00014914485,0.00012705651,0.00033077857,0.67404354,0.001465808,0.2812,0.0047737067,0.032492764],"study_design_scores_gemma":[0.000037949165,0.000036773035,0.0006554646,0.0000183772,0.00001853791,0.00004157012,0.00003029229,0.9549952,0.00032862488,0.043325085,0.0004954874,0.00001661005],"about_ca_topic_score_codex":0.003942743,"about_ca_topic_score_gemma":0.005141411,"teacher_disagreement_score":0.014126504,"about_ca_system_score_codex":0.0033809477,"about_ca_system_score_gemma":0.0023151888,"threshold_uncertainty_score":0.074709},"labels":[],"label_agreement":null},{"id":"W2013195357","doi":"10.1016/j.tcs.2004.03.042","title":"Classifying RNA pseudoknotted structures","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Protein secondary structure; Nucleic acid secondary structure; Simple (philosophy); Algorithm; Generality; Class (philosophy); Computer science; Sequence (biology); Function (biology); Data structure; Base (topology); Mathematics; Theoretical computer science; RNA; Artificial intelligence; Biology; Programming language","score_opus":0.009692261270437333,"score_gpt":0.2472509920357312,"score_spread":0.23755873076529388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013195357","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.83133876,0.00038875866,0.15648054,0.00058872363,0.00010422023,0.00008103029,0.00037552038,0.00043470823,0.01020776],"genre_scores_gemma":[0.97019255,0.00017742177,0.026146589,0.00010193062,0.00008079225,0.000041566356,0.00083561067,0.00008027177,0.0023431662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994785,0.00009001693,0.000040781353,0.0001122408,0.00019324975,0.000085199994],"domain_scores_gemma":[0.996157,0.0018937658,0.0005855545,0.0005604657,0.0005141837,0.0002890877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004566847,0.00039230406,0.00050315255,0.0020248052,0.0011496351,0.0025339264,0.0010689278,0.0020442498,0.0032400617],"category_scores_gemma":[0.0037603406,0.00031279557,0.0004939745,0.0012730416,0.0015893688,0.0028777076,0.00087953045,0.001060414,0.00040449575],"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.0008110138,0.00021878179,0.016125225,0.00031146524,0.000047203695,0.0012292642,0.00070959976,0.082659885,0.03554691,0.77939093,0.004444515,0.0785051],"study_design_scores_gemma":[0.00002900717,0.00008801081,0.0026590934,0.00003476308,0.000019478503,0.00044026942,0.0002807384,0.4229637,0.009526713,0.56085074,0.0030775368,0.000029970224],"about_ca_topic_score_codex":0.0005332347,"about_ca_topic_score_gemma":0.0007006717,"teacher_disagreement_score":0.0032400617,"about_ca_system_score_codex":0.0008634655,"about_ca_system_score_gemma":0.00033974607,"threshold_uncertainty_score":0.010839045},"labels":[],"label_agreement":null},{"id":"W2014252825","doi":"10.1016/s0304-3975(98)00342-9","title":"The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Victoria","funders":"","keywords":"Colored; Combinatorics; Parameterized complexity; Chordal graph; Mathematics; Pathwidth; Vertex (graph theory); Discrete mathematics; Upper and lower bounds; Tree (set theory); Bounded function; Graph; Line graph","score_opus":0.021004933285101487,"score_gpt":0.28023671478497736,"score_spread":0.25923178149987586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014252825","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.5958303,0.002371463,0.29499564,0.021803575,0.0005100415,0.0003459823,0.0035717457,0.0012093453,0.07936185],"genre_scores_gemma":[0.9016251,0.0019730339,0.06625857,0.0014560526,0.000540078,0.0003081066,0.0021748191,0.0006036123,0.02506068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975539,0.0007970872,0.00012668698,0.00059070723,0.00042095158,0.00051074434],"domain_scores_gemma":[0.97012264,0.023866525,0.0018666139,0.0021976717,0.0006371749,0.0013092064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021386682,0.0012654298,0.0026719244,0.0013353893,0.0042068674,0.0054447693,0.005073055,0.0048702103,0.012031528],"category_scores_gemma":[0.026075576,0.0028269014,0.0025441162,0.0033785836,0.005901365,0.01808124,0.0047995606,0.0072582955,0.0009839929],"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.000991159,0.00034926567,0.0025531205,0.00073181617,0.00015089355,0.0005443658,0.0013057934,0.17688982,0.003196326,0.7516,0.026203671,0.03548376],"study_design_scores_gemma":[0.00014913079,0.000043559383,0.0007723354,0.00005245573,0.000055029996,0.00017394614,0.00037415416,0.069188386,0.0009484345,0.92549676,0.0027174153,0.000028327551],"about_ca_topic_score_codex":0.008095568,"about_ca_topic_score_gemma":0.0075670253,"teacher_disagreement_score":0.012031528,"about_ca_system_score_codex":0.0030118607,"about_ca_system_score_gemma":0.0023767462,"threshold_uncertainty_score":0.040249467},"labels":[],"label_agreement":null},{"id":"W2014679376","doi":"10.1016/j.tcs.2012.10.029","title":"On the exploration of time-varying networks","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":false,"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":"Computability; Computer science; Exploit; Class (philosophy); Node (physics); Focus (optics); Upper and lower bounds; Theoretical computer science; Mathematics; Computer security; Artificial intelligence","score_opus":0.0262796194452426,"score_gpt":0.24617817947768544,"score_spread":0.21989856003244285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014679376","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.1366866,0.008602601,0.81002355,0.005978842,0.00031185956,0.0000880357,0.0003453136,0.00018889927,0.037774347],"genre_scores_gemma":[0.9082024,0.008438459,0.06705366,0.0005241972,0.00048520416,0.00018548664,0.00027399007,0.00013096984,0.014705631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914145,0.00051763136,0.000025880272,0.0000919067,0.00012622129,0.0000968618],"domain_scores_gemma":[0.98690015,0.011599006,0.00048199692,0.0002916048,0.00029376245,0.00043349824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018447565,0.00085222995,0.001351617,0.0013242238,0.000885561,0.0020568292,0.0015513942,0.001599497,0.0047129937],"category_scores_gemma":[0.018206842,0.00059185724,0.00074716983,0.0020967387,0.0025195624,0.0043416275,0.0029367763,0.001599261,0.00023258991],"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.00014911083,0.00004032338,0.0008531145,0.00015952268,0.000055693148,0.0001099857,0.00027562786,0.433564,0.0003528543,0.5459429,0.0025463453,0.015950436],"study_design_scores_gemma":[0.00002041703,0.00002010659,0.000112169946,0.000027494852,0.000010137958,0.000032393178,0.00005834448,0.6199023,0.00005819184,0.3778011,0.0019487552,0.000008616356],"about_ca_topic_score_codex":0.0031291666,"about_ca_topic_score_gemma":0.0021471044,"teacher_disagreement_score":0.0047129937,"about_ca_system_score_codex":0.0011572388,"about_ca_system_score_gemma":0.0009103618,"threshold_uncertainty_score":0.015766561},"labels":[],"label_agreement":null},{"id":"W2015172530","doi":"10.1016/j.tcs.2003.09.013","title":"Metrics for labelled Markov processes","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":309,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Bisimulation; Probabilistic logic; Markov process; Metric (unit); Mathematics; Equivalence (formal languages); Markov chain; Property (philosophy); Markov property; Stochastic process; Discrete mathematics; Markov model; Statistics","score_opus":0.023812914768896423,"score_gpt":0.3019455865412595,"score_spread":0.2781326717723631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015172530","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.064625755,0.0020732412,0.91339153,0.0015153647,0.00025672797,0.00018068083,0.0011455085,0.0005855879,0.016225677],"genre_scores_gemma":[0.7512827,0.0023014867,0.22189061,0.00056255027,0.00064181746,0.0009317848,0.003270275,0.00074615754,0.018372655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919155,0.00313528,0.0007850719,0.0014055109,0.002073091,0.0006855302],"domain_scores_gemma":[0.95734555,0.027123557,0.0050376295,0.0025098647,0.004723776,0.003259646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007560621,0.001861256,0.002029256,0.0071205185,0.0022767596,0.0059864386,0.0020300238,0.0029973714,0.008142412],"category_scores_gemma":[0.047257464,0.001071416,0.0016648805,0.0045403475,0.003889611,0.015589317,0.0041711237,0.00312206,0.00093111285],"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.000042986914,0.000016314094,0.0005755942,0.00008494331,0.000023340219,0.000042464308,0.0001751784,0.009355995,0.0003692221,0.9809223,0.0008396423,0.007551921],"study_design_scores_gemma":[0.0000074413247,0.000020688805,0.00022868262,0.000034522884,0.000011598574,0.000027523123,0.000028060962,0.035278827,0.00019409189,0.96220756,0.0019437856,0.000017182432],"about_ca_topic_score_codex":0.003003439,"about_ca_topic_score_gemma":0.0023478912,"teacher_disagreement_score":0.008142412,"about_ca_system_score_codex":0.0067378986,"about_ca_system_score_gemma":0.0021003515,"threshold_uncertainty_score":0.048887134},"labels":[],"label_agreement":null},{"id":"W2015179126","doi":"10.1016/j.tcs.2014.05.025","title":"Quantum cryptography: Public key distribution and coin tossing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":3914,"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":"Coin flipping; Quantum cryptography; Quantum key distribution; Computer science; Cryptography; Computer security; Theoretical computer science; Quantum channel; Channel (broadcasting); Key (lock); Adversary; Quantum information; Quantum; Mathematics; Computer network; Quantum mechanics; Physics","score_opus":0.008955706879752091,"score_gpt":0.23676191031291838,"score_spread":0.2278062034331663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015179126","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.00856031,0.011020558,0.89045465,0.00833404,0.0010615265,0.00036010655,0.00023574397,0.0007246275,0.07924835],"genre_scores_gemma":[0.6653095,0.017313622,0.25136408,0.0028779216,0.004192398,0.001161245,0.00041519664,0.0003825872,0.056983512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940194,0.002405608,0.00020176948,0.0006864308,0.0021505377,0.00053625077],"domain_scores_gemma":[0.9958834,0.0019630492,0.0003387926,0.0012469458,0.00042091025,0.00014685222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044067856,0.0013366331,0.0016245864,0.0020431518,0.0020227414,0.004702548,0.0023544412,0.0054516527,0.0071176733],"category_scores_gemma":[0.013360943,0.0009106312,0.00092992,0.003914515,0.009003717,0.011977062,0.0044760182,0.004751439,0.0038438984],"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.000034689412,0.000028471692,0.000045999757,0.000083249935,0.0000071830327,0.000036126705,0.000057592395,0.0038639554,0.00043887587,0.97455096,0.004362927,0.016489988],"study_design_scores_gemma":[0.000023838573,0.000016937855,0.00004064889,0.00005005491,0.0000066763746,0.00014950991,0.000015934405,0.02305362,0.00073743775,0.9637854,0.012098759,0.000021282161],"about_ca_topic_score_codex":0.00072557945,"about_ca_topic_score_gemma":0.00040860675,"teacher_disagreement_score":0.0071176733,"about_ca_system_score_codex":0.0036495533,"about_ca_system_score_gemma":0.0024515046,"threshold_uncertainty_score":0.026479423},"labels":[],"label_agreement":null},{"id":"W2015734384","doi":"10.1016/s0304-3975(98)00132-7","title":"Three-dimensional weak visibility: Complexity and applications","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Polyhedron; Disjoint sets; Visibility; Time complexity; Simple (philosophy); Combinatorics; Mathematics; Set (abstract data type); Space (punctuation); Computational complexity theory; Computer science; Algorithm; Discrete mathematics; Physics; Optics","score_opus":0.016896025729502356,"score_gpt":0.262296979198557,"score_spread":0.24540095346905463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015734384","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.13619338,0.0023157997,0.84273577,0.0019570817,0.00015870825,0.000055369976,0.0003150821,0.00030675996,0.015962105],"genre_scores_gemma":[0.8104047,0.0026834072,0.17792541,0.00022598807,0.00037066825,0.000105271254,0.00051472796,0.00023898616,0.007530763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917907,0.00021946063,0.00005247897,0.00017679573,0.00027325083,0.000098923476],"domain_scores_gemma":[0.990752,0.006177518,0.0009495017,0.0009818681,0.0006162528,0.0005228576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108732,0.00072881434,0.0012704742,0.0019494996,0.0013268852,0.004734953,0.002174817,0.0019496054,0.004293597],"category_scores_gemma":[0.011075059,0.00076374674,0.0010638022,0.0023719133,0.0043286444,0.008462311,0.004287247,0.0030208,0.00043619424],"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.00008963648,0.000033273845,0.00093846803,0.00012912553,0.000017517956,0.0000960126,0.00024492294,0.021093344,0.0015718759,0.9448983,0.0020859458,0.02880159],"study_design_scores_gemma":[0.000011973919,0.000010715841,0.0002338283,0.00001439715,0.0000073620736,0.00008115581,0.00006737601,0.095417134,0.0006025452,0.9018041,0.0017387128,0.000010685635],"about_ca_topic_score_codex":0.0016546273,"about_ca_topic_score_gemma":0.0012221355,"teacher_disagreement_score":0.004734953,"about_ca_system_score_codex":0.0010839929,"about_ca_system_score_gemma":0.0006252227,"threshold_uncertainty_score":0.014363468},"labels":[],"label_agreement":null},{"id":"W2015787121","doi":"10.1016/j.tcs.2009.03.026","title":"Estimation of state complexity of combined operations","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"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":"Catenation; State (computer science); Alphabet; Upper and lower bounds; Mathematics; Regular language; Computational complexity theory; Combined operations; Algorithm; Theoretical computer science; Computer science; Discrete mathematics; Automaton; Linguistics","score_opus":0.01599258895503316,"score_gpt":0.26526173501559713,"score_spread":0.24926914606056397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015787121","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.7749575,0.00016300764,0.22206698,0.0001411035,0.00001818132,0.000042900512,0.00034098414,0.00045164058,0.0018177142],"genre_scores_gemma":[0.9778698,0.00004699975,0.021236347,0.0000089141095,0.000020968417,0.000038045306,0.00031355157,0.00003929655,0.0004260232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842995,0.0004280665,0.0000900107,0.0003983986,0.00047324746,0.00018036002],"domain_scores_gemma":[0.9405779,0.051234823,0.0017867805,0.0038657417,0.0017461616,0.0007885364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001454022,0.00061916764,0.0010920335,0.0016643672,0.0004983658,0.0020719247,0.0013329352,0.0011877827,0.0026315677],"category_scores_gemma":[0.023120616,0.0005691056,0.0009766918,0.00092491857,0.0012108848,0.004676124,0.0017188912,0.0014978567,0.00030134118],"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.0034057884,0.000656174,0.038922455,0.0003481386,0.00033810298,0.0003313119,0.000480495,0.7310611,0.034965273,0.06592783,0.001190496,0.122372836],"study_design_scores_gemma":[0.000013420099,0.000081493294,0.0029118597,0.000005292833,0.000020540556,0.000038857834,0.000029595245,0.9721824,0.0045570065,0.020056758,0.00008654193,0.000016297696],"about_ca_topic_score_codex":0.0014161067,"about_ca_topic_score_gemma":0.0014054959,"teacher_disagreement_score":0.0026315677,"about_ca_system_score_codex":0.00114456,"about_ca_system_score_gemma":0.0008057411,"threshold_uncertainty_score":0.008803487},"labels":[],"label_agreement":null},{"id":"W2016258894","doi":"10.1016/j.tcs.2010.03.013","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-Labelings on the composition of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math> graphs","year":2010,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Combinatorics; Graph; Vertex (graph theory); Mathematics; Degree (music); Discrete mathematics; Physics","score_opus":0.014065416741891294,"score_gpt":0.23569754119939718,"score_spread":0.22163212445750588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016258894","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.003511867,0.00035755528,0.4349283,0.0052624354,0.0012101096,0.00036078703,0.04209357,0.058000293,0.45427507],"genre_scores_gemma":[0.04992337,0.002212713,0.3167091,0.0021908763,0.0005569684,0.00080709485,0.09058044,0.055532407,0.48148707],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992951,0.0001574772,0.000059364345,0.00015930158,0.0002445805,0.00008414457],"domain_scores_gemma":[0.99835014,0.00051823165,0.000095852105,0.00052192196,0.00037106432,0.00014280873],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010494431,0.001170272,0.00079109304,0.0019962424,0.0013487322,0.0038986,0.001981109,0.0016337602,0.31013885],"category_scores_gemma":[0.0044278293,0.0011232262,0.001174703,0.0036642984,0.0009590481,0.006418176,0.002218334,0.0027871442,0.21773693],"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.0001210482,0.00005988481,0.00024636928,0.00030407318,0.000012528309,0.000084763706,0.00028961455,0.0012501521,0.0033300053,0.22681426,0.6799651,0.087522216],"study_design_scores_gemma":[0.0000356316,0.000011737488,0.00031199076,0.000063869105,0.00001004472,0.00011612438,0.00008631655,0.0034253965,0.0034415163,0.09034897,0.9021191,0.000029245228],"about_ca_topic_score_codex":0.007399143,"about_ca_topic_score_gemma":0.01053754,"teacher_disagreement_score":0.31013885,"about_ca_system_score_codex":0.0028017876,"about_ca_system_score_gemma":0.0017310781,"threshold_uncertainty_score":0.9840032},"labels":[],"label_agreement":null},{"id":"W2017334312","doi":"10.1016/j.tcs.2015.04.005","title":"The optimal capture time of the one-cop-moves game","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Computer science; Graph; Combinatorial game theory; Monotonic function; Game tree; Set (abstract data type); Depth-first search; Greedy algorithm; Mathematics; Combinatorics; Sequential game; Mathematical optimization; Theoretical computer science; Search algorithm; Algorithm; Game theory; Mathematical economics","score_opus":0.022938131111920657,"score_gpt":0.2674338826879437,"score_spread":0.24449575157602305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017334312","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.60062885,0.0016686989,0.27894008,0.004825332,0.00032238054,0.00028364145,0.001078676,0.0006436534,0.11160877],"genre_scores_gemma":[0.97202015,0.00055159244,0.0117973015,0.00019905601,0.00007305576,0.00013929718,0.00031244013,0.00016894823,0.014738275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989532,0.00033613664,0.00003869494,0.00018428169,0.00015082805,0.00033672666],"domain_scores_gemma":[0.9911248,0.0061436947,0.000534574,0.00034102795,0.00039243503,0.0014635243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017274331,0.0010083863,0.0015117496,0.001021762,0.0009655282,0.0035288788,0.002171,0.0025887303,0.019008474],"category_scores_gemma":[0.013820525,0.00077450526,0.0006780625,0.0006984716,0.0017905317,0.005655289,0.0016686035,0.0026129333,0.0010160499],"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.0014810086,0.00024695744,0.0012387373,0.0003582927,0.000100246136,0.00018384762,0.000475279,0.13236478,0.0054956186,0.829381,0.009009582,0.019664718],"study_design_scores_gemma":[0.0002219054,0.00030638414,0.0012464283,0.000098189405,0.000060166512,0.00012045571,0.00030613865,0.5237578,0.0016326297,0.46965533,0.0025257235,0.00006891865],"about_ca_topic_score_codex":0.0029232346,"about_ca_topic_score_gemma":0.002556401,"teacher_disagreement_score":0.019008474,"about_ca_system_score_codex":0.0021618004,"about_ca_system_score_gemma":0.0031346572,"threshold_uncertainty_score":0.06358975},"labels":[],"label_agreement":null},{"id":"W2017360257","doi":"10.1016/j.tcs.2011.11.010","title":"On sum coloring and sum multi-coloring for restricted families of graphs","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy coloring; Complete coloring; Combinatorics; Graph coloring; Mathematics; Brooks' theorem; Fractional coloring; Edge coloring; List coloring; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.04880908630460297,"score_gpt":0.30058764518823616,"score_spread":0.2517785588836332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017360257","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.27983236,0.0055031558,0.6220978,0.0071199387,0.001186051,0.0001809949,0.00089151965,0.00064365624,0.08254446],"genre_scores_gemma":[0.800612,0.006665454,0.14077304,0.0022849836,0.0024021699,0.0004333721,0.0018473346,0.00102507,0.04395662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795854,0.0008320044,0.0000890475,0.00042216116,0.00036923986,0.00032895384],"domain_scores_gemma":[0.98623043,0.009938152,0.0007374456,0.0010923826,0.0008549021,0.0011465477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031337647,0.0017925603,0.0024277072,0.0029745416,0.0041637127,0.004494344,0.003669504,0.0023570086,0.010395381],"category_scores_gemma":[0.015677499,0.0016742471,0.0031689133,0.005666581,0.00471671,0.013729065,0.0055132494,0.0069481996,0.0010072773],"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.00022567225,0.00012298454,0.0011130649,0.00022850733,0.00005802988,0.00017262445,0.00079183374,0.016579987,0.0008913721,0.95025134,0.008897491,0.020667113],"study_design_scores_gemma":[0.000022640754,0.000022055516,0.00030539613,0.00003682142,0.00004101107,0.0001293755,0.00020925752,0.03371771,0.00021728688,0.96253467,0.00274088,0.000022844064],"about_ca_topic_score_codex":0.0049088215,"about_ca_topic_score_gemma":0.00567999,"teacher_disagreement_score":0.010395381,"about_ca_system_score_codex":0.0032006102,"about_ca_system_score_gemma":0.0015836066,"threshold_uncertainty_score":0.034776032},"labels":[],"label_agreement":null},{"id":"W2018390675","doi":"10.1016/j.tcs.2006.01.040","title":"Representation of a class of nondeterministic semiautomata by canonical words","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Nondeterministic algorithm; Word (group theory); Rewriting; Mathematics; Class (philosophy); Canonical form; TRACE (psycholinguistics); Set (abstract data type); Discrete mathematics; State (computer science); Existential quantification; Computer science; Algorithm; Programming language; Linguistics; Pure mathematics; Artificial intelligence","score_opus":0.012245128598761873,"score_gpt":0.26977786409715443,"score_spread":0.25753273549839256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018390675","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.32635164,0.0007578639,0.61411726,0.001173055,0.0003081419,0.00012059959,0.0008502263,0.001687556,0.054633632],"genre_scores_gemma":[0.93447006,0.00032257772,0.05093112,0.00014265116,0.00012350657,0.00012942217,0.00061398104,0.0003253816,0.012941238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991904,0.00014343101,0.00005670629,0.00024329542,0.00017481731,0.00019129961],"domain_scores_gemma":[0.9985404,0.00061869057,0.00013508109,0.00031111008,0.0002660824,0.00012864206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006330772,0.00043712877,0.0006933754,0.0010763586,0.0017334555,0.0043864725,0.0010607293,0.0012117432,0.007033433],"category_scores_gemma":[0.002230856,0.00047371272,0.0011126795,0.001026456,0.0023377547,0.003904523,0.001309128,0.0019019754,0.0010939544],"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.000019396293,0.000013044615,0.00018325596,0.000015063209,0.000003493326,0.000055655615,0.00018122532,0.0009459284,0.0006471146,0.9928645,0.00049347494,0.0045778155],"study_design_scores_gemma":[0.0000139735,0.000012781611,0.00011345223,0.000012760321,0.00000842724,0.00011527061,0.000100038014,0.014241626,0.0011522818,0.9792142,0.0050020944,0.000013190915],"about_ca_topic_score_codex":0.0012468001,"about_ca_topic_score_gemma":0.0009956297,"teacher_disagreement_score":0.007033433,"about_ca_system_score_codex":0.0010260688,"about_ca_system_score_gemma":0.0010053038,"threshold_uncertainty_score":0.023529172},"labels":[],"label_agreement":null},{"id":"W2018554016","doi":"10.1016/j.tcs.2007.03.014","title":"Defect particle kinematics in one-dimensional cellular automata","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kinematics; Cellular automaton; Automaton; Particle (ecology); Computer science; Mathematics; Theoretical computer science; Geometry; Classical mechanics; Algorithm; Topology (electrical circuits); Discrete mathematics; Combinatorics; Physics; Geology","score_opus":0.01497642273216219,"score_gpt":0.2539691154864794,"score_spread":0.2389926927543172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018554016","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.46240494,0.0008767076,0.4931425,0.001559676,0.00072123465,0.00010849324,0.00019782117,0.00047630616,0.04051228],"genre_scores_gemma":[0.96555394,0.00034527952,0.022103412,0.0001321157,0.000058530404,0.00007909661,0.00010284267,0.0000925092,0.011532249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968743,0.00008510913,0.000022257122,0.000046587014,0.00010897465,0.000049629234],"domain_scores_gemma":[0.99876946,0.0005552537,0.0001416554,0.0001616642,0.00022295854,0.00014886018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924132,0.00047321155,0.00093554845,0.0011098292,0.000982842,0.0029409386,0.0013649144,0.0018984202,0.0031265037],"category_scores_gemma":[0.0036282924,0.00046032367,0.000762327,0.00063655333,0.002985915,0.0020509728,0.0013973123,0.001413408,0.00052066095],"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.000036427416,0.000024614314,0.000559373,0.000037244703,0.0000095691175,0.00013671965,0.00016231617,0.08209848,0.0013646056,0.91178185,0.0005984785,0.003190344],"study_design_scores_gemma":[0.00003561657,0.000027613502,0.00019362093,0.000013464806,0.000008237468,0.00008709353,0.00008476188,0.47849244,0.00067486893,0.5194348,0.0009173518,0.000030074503],"about_ca_topic_score_codex":0.0032186022,"about_ca_topic_score_gemma":0.0017500211,"teacher_disagreement_score":0.0032186022,"about_ca_system_score_codex":0.0014062973,"about_ca_system_score_gemma":0.00086619065,"threshold_uncertainty_score":0.010459185},"labels":[],"label_agreement":null},{"id":"W2018558025","doi":"10.1016/j.tcs.2014.10.009","title":"Approximation algorithms for digraph width parameters","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Digraph; Pathwidth; Mathematics; Combinatorics; Bounded function; Discrete mathematics; Partial k-tree; Approximation algorithm; Directed graph; Algorithm; Graph","score_opus":0.022550280587743977,"score_gpt":0.29856726809895917,"score_spread":0.2760169875112152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018558025","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.050668128,0.0021480885,0.91494507,0.003288582,0.0003929959,0.00042050713,0.0022691009,0.006621303,0.019246276],"genre_scores_gemma":[0.32398292,0.0019099461,0.647743,0.0011925733,0.00049314275,0.00087684754,0.00492852,0.0026807003,0.01619236],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961599,0.0007585549,0.00023138202,0.0011913298,0.0009934724,0.00066543685],"domain_scores_gemma":[0.98361397,0.008919162,0.0007854702,0.0048530805,0.0009739207,0.00085441186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036354614,0.0037120518,0.003484661,0.0043386193,0.0020950024,0.008026169,0.008967317,0.004335119,0.023952456],"category_scores_gemma":[0.024980186,0.0024526455,0.0030539061,0.008850542,0.0021518809,0.021226356,0.0060775853,0.0106670745,0.005102795],"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.0017239294,0.001381704,0.0035804308,0.0010684041,0.0002688416,0.00014261699,0.00084507157,0.1991279,0.005457881,0.22915806,0.05142839,0.50581676],"study_design_scores_gemma":[0.00039121642,0.00011491162,0.0004740536,0.00013743326,0.00021182456,0.00020016187,0.0003241888,0.5242262,0.0036801135,0.46113494,0.009045859,0.000059154983],"about_ca_topic_score_codex":0.0045750192,"about_ca_topic_score_gemma":0.009072648,"teacher_disagreement_score":0.023952456,"about_ca_system_score_codex":0.007841838,"about_ca_system_score_gemma":0.0045668683,"threshold_uncertainty_score":0.08012897},"labels":[],"label_agreement":null},{"id":"W2018748865","doi":"10.1016/j.tcs.2008.06.011","title":"Games to induce specified equilibria","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Nash equilibrium; Computer science; Context (archaeology); Strategy; Repeated game; Mathematical economics; Best response; Node (physics); Range (aeronautics); Sequential game; Game theory; Non-cooperative game; Channel (broadcasting); A priori and a posteriori; Mathematical optimization; Mathematics; Computer network","score_opus":0.020088089347125367,"score_gpt":0.2498175850807489,"score_spread":0.22972949573362353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018748865","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.11477542,0.00018700138,0.7243095,0.0038448784,0.0002728444,0.0008513984,0.0006812552,0.0012179593,0.15385965],"genre_scores_gemma":[0.86414117,0.00025612296,0.08716785,0.0012050956,0.00008327626,0.0013717246,0.0006654764,0.0003124959,0.04479683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972007,0.0012533949,0.00020309046,0.0003069828,0.000490054,0.0005458281],"domain_scores_gemma":[0.991672,0.0049604666,0.00048600862,0.0010169634,0.0009461682,0.0009183425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002572699,0.0010591102,0.0009991437,0.0011023496,0.0019087256,0.0033311378,0.0018853829,0.0023148938,0.0146739315],"category_scores_gemma":[0.015044253,0.0007803459,0.0019737282,0.0010041642,0.0021865177,0.004921002,0.004929588,0.004790634,0.0017132808],"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.00006957089,0.000060757993,0.000110197034,0.000042239153,0.000014195444,0.000042773303,0.00014937781,0.0022933353,0.00054781116,0.99213916,0.0013169126,0.0032136752],"study_design_scores_gemma":[0.000108850334,0.000040604522,0.00006890653,0.000021892965,0.00001874504,0.000040293413,0.00007123122,0.021712009,0.001096778,0.9736415,0.003167546,0.000011639249],"about_ca_topic_score_codex":0.0008151007,"about_ca_topic_score_gemma":0.0016192888,"teacher_disagreement_score":0.0146739315,"about_ca_system_score_codex":0.0022723607,"about_ca_system_score_gemma":0.0020914525,"threshold_uncertainty_score":0.049089134},"labels":[],"label_agreement":null},{"id":"W2019940097","doi":"10.1016/s0304-3975(02)00736-3","title":"Expressive power of SQL","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"SQL; Computer science; Relational algebra; Mathematical proof; Programming language; Theoretical computer science; Reachability; Relational database; Database; Mathematics","score_opus":0.007096860504463824,"score_gpt":0.24190759469112036,"score_spread":0.23481073418665654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019940097","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.07136263,0.006106877,0.6973356,0.015160126,0.00048376387,0.000107066146,0.0016795562,0.0031807094,0.20458364],"genre_scores_gemma":[0.87221044,0.0033543925,0.08876637,0.0025989448,0.0010265027,0.00020429975,0.001708753,0.0010936457,0.029036628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931554,0.002033841,0.000573761,0.0011959288,0.0025448145,0.0004961511],"domain_scores_gemma":[0.988117,0.0071023875,0.00035747085,0.0030899285,0.0010052413,0.00032799147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054329513,0.0009140365,0.001016292,0.0021072319,0.0017897136,0.0090131685,0.0023153478,0.001173494,0.008899666],"category_scores_gemma":[0.016362723,0.0013341417,0.0015468032,0.0021520548,0.0061286567,0.020793905,0.0056859152,0.0064178566,0.002152569],"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.000051456318,0.000023046929,0.00018717081,0.000054971468,0.0000134145575,0.00003412491,0.00044937083,0.0012863036,0.0009603569,0.98237646,0.0019075088,0.012655822],"study_design_scores_gemma":[0.000012994385,0.000008119296,0.000067263034,0.000021642141,0.000022293967,0.0000472464,0.000058631336,0.0059784777,0.0011258161,0.9837143,0.008933257,0.000010008757],"about_ca_topic_score_codex":0.0012980581,"about_ca_topic_score_gemma":0.0008606386,"teacher_disagreement_score":0.0090131685,"about_ca_system_score_codex":0.0021062403,"about_ca_system_score_gemma":0.0013343081,"threshold_uncertainty_score":0.029772341},"labels":[],"label_agreement":null},{"id":"W2020031747","doi":"10.1016/j.tcs.2014.01.033","title":"A note on abelian returns in rotation words","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Abelian group; Prefix; Mathematics; Rotation (mathematics); Connection (principal bundle); Set (abstract data type); Pure mathematics; Discrete mathematics; Computer science; Linguistics; Geometry","score_opus":0.006793204838155968,"score_gpt":0.24547315904204117,"score_spread":0.23867995420388521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020031747","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.080506824,0.01970648,0.40732196,0.047735438,0.022879776,0.00011066246,0.00060307886,0.00134384,0.41979197],"genre_scores_gemma":[0.6645245,0.013042214,0.09159063,0.008583292,0.018374005,0.00024875844,0.00052475516,0.0013156057,0.20179616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983821,0.0005612587,0.00011762422,0.00033438945,0.00032384924,0.00028086052],"domain_scores_gemma":[0.9951756,0.00339838,0.00016239758,0.0006906819,0.00034878898,0.00022410034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015693218,0.0009023435,0.0012717672,0.0014232709,0.0028826594,0.0040699,0.0017415888,0.0023009726,0.016715132],"category_scores_gemma":[0.0065931412,0.0005698547,0.001400105,0.0028371706,0.006994152,0.016081221,0.004545464,0.005412,0.0041126157],"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.000025862273,0.0000064771957,0.00005271935,0.000030048983,0.0000027568724,0.00006774808,0.00017441735,0.0002505815,0.00036406965,0.9891237,0.004324246,0.0055772155],"study_design_scores_gemma":[0.0000066069806,0.000014054033,0.00008574667,0.000014658968,0.000008005013,0.00009835293,0.00008164265,0.000720497,0.0005549503,0.9663856,0.03201353,0.000016282205],"about_ca_topic_score_codex":0.0016322705,"about_ca_topic_score_gemma":0.0014019455,"teacher_disagreement_score":0.016715132,"about_ca_system_score_codex":0.0014878368,"about_ca_system_score_gemma":0.00086181005,"threshold_uncertainty_score":0.05591774},"labels":[],"label_agreement":null},{"id":"W2020054908","doi":"10.1016/s0304-3975(00)00005-0","title":"Finding houses and holes in graphs","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Domino; Mathematics; Graph; Discrete mathematics; Chemistry","score_opus":0.023300947401377867,"score_gpt":0.30398486310987827,"score_spread":0.2806839157085004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020054908","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.76732486,0.0016226048,0.20918305,0.0022803394,0.0001449183,0.00018758292,0.00129344,0.0006688683,0.01729442],"genre_scores_gemma":[0.8418662,0.0009879064,0.14236063,0.000341285,0.0001377361,0.000083845276,0.001898673,0.00024863795,0.0120752165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992823,0.000164024,0.000040745985,0.00023888804,0.00013277253,0.00014125007],"domain_scores_gemma":[0.9948832,0.0033722064,0.0005666594,0.0005597018,0.00025781684,0.00036041555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064000796,0.00082796393,0.0015334965,0.0019361352,0.0017495647,0.0021910185,0.001892161,0.0020585074,0.006733174],"category_scores_gemma":[0.00614866,0.001709522,0.0010475562,0.0023151734,0.002594226,0.008893655,0.002804764,0.0018827486,0.00087627885],"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.0019007329,0.00063410145,0.030099161,0.0017121375,0.0002628567,0.002256442,0.00503798,0.05453166,0.013701666,0.63946956,0.03553878,0.21485499],"study_design_scores_gemma":[0.00015476989,0.0001359259,0.003813829,0.00013308424,0.00014009455,0.00082056725,0.0022311318,0.06779892,0.0049031004,0.9087579,0.011071506,0.000039068636],"about_ca_topic_score_codex":0.0029266928,"about_ca_topic_score_gemma":0.0043340796,"teacher_disagreement_score":0.006733174,"about_ca_system_score_codex":0.000740586,"about_ca_system_score_gemma":0.00049875857,"threshold_uncertainty_score":0.022524714},"labels":[],"label_agreement":null},{"id":"W2020295593","doi":"10.1016/j.tcs.2005.10.028","title":"A categorical model for the geometry of interaction","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Linear logic; Soundness; Categorical variable; Mathematics; Fragment (logic); Interpretation (philosophy); Multiplicative function; Semantics (computer science); Algebra over a field; Operator (biology); Decomposition; Pure mathematics; Calculus (dental); Discrete mathematics; Algorithm; Computer science; Programming language; Mathematical analysis","score_opus":0.026440686120794653,"score_gpt":0.28334616556474046,"score_spread":0.2569054794439458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020295593","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.040080816,0.0021120263,0.80688655,0.010722845,0.0004937462,0.00008095749,0.001046439,0.00081071956,0.13776596],"genre_scores_gemma":[0.8416376,0.0013643308,0.124915555,0.00174911,0.0009038722,0.00029994844,0.0008556094,0.0003315491,0.02794243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969067,0.0011817559,0.00015656074,0.0006249903,0.0007924225,0.0003376089],"domain_scores_gemma":[0.9963445,0.0014717918,0.00030651072,0.00077607774,0.00062706554,0.00047395274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022217236,0.00083790754,0.0010827824,0.0027338604,0.0033617283,0.00852101,0.0031979291,0.0027449215,0.0122723095],"category_scores_gemma":[0.0039812014,0.000770823,0.001923722,0.0022581029,0.011841075,0.016760513,0.0050795767,0.00510762,0.00189327],"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.0000033096085,0.0000017611394,0.000029899267,0.000005060855,0.0000012426096,0.000007945867,0.000055390294,0.000119172735,0.00004237026,0.9989862,0.00021429929,0.00053329754],"study_design_scores_gemma":[0.000006744706,0.000006442438,0.000045203047,0.0000047747553,0.0000025552379,0.000035577013,0.00005745742,0.0011769853,0.00005103822,0.9953957,0.0032122922,0.000005169067],"about_ca_topic_score_codex":0.0028323357,"about_ca_topic_score_gemma":0.001614547,"teacher_disagreement_score":0.0122723095,"about_ca_system_score_codex":0.003946679,"about_ca_system_score_gemma":0.0015759028,"threshold_uncertainty_score":0.041054904},"labels":[],"label_agreement":null},{"id":"W2020715570","doi":"10.1016/j.tcs.2014.04.009","title":"Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Resilience (materials science); Path (computing); Algorithm; Computer science; Mathematics; Computer network; Physics","score_opus":0.020491603163998888,"score_gpt":0.27287342488921645,"score_spread":0.25238182172521756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020715570","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.017337164,0.0010997143,0.97456396,0.0011734241,0.00013984098,0.00013383917,0.00013659375,0.000700723,0.0047146403],"genre_scores_gemma":[0.25612697,0.0011092362,0.7341523,0.00036611813,0.00022796317,0.0005519364,0.00031679912,0.0005392662,0.0066093453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979512,0.00072136236,0.00010983975,0.00049470545,0.00044874765,0.00027417377],"domain_scores_gemma":[0.9802332,0.015171934,0.0011177773,0.0016895245,0.0008522729,0.00093519903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035065964,0.0023112446,0.0023034357,0.0034023523,0.0019036089,0.0027164952,0.0051867794,0.003609832,0.009345302],"category_scores_gemma":[0.026788447,0.0010711184,0.0020123455,0.0043236227,0.0028254997,0.008095978,0.0071490244,0.006822313,0.00095065386],"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.0004681931,0.0003104915,0.001029228,0.0005619761,0.0001081138,0.00010650539,0.00043704512,0.55861044,0.0031550082,0.29265106,0.009711169,0.13285072],"study_design_scores_gemma":[0.000047365847,0.00006034422,0.00012438757,0.0000426748,0.000028726537,0.000049413924,0.00005335332,0.83320713,0.00078081654,0.16363692,0.0019495448,0.000019417059],"about_ca_topic_score_codex":0.0029921972,"about_ca_topic_score_gemma":0.0044309287,"teacher_disagreement_score":0.009345302,"about_ca_system_score_codex":0.0034372495,"about_ca_system_score_gemma":0.0025570067,"threshold_uncertainty_score":0.031263113},"labels":[],"label_agreement":null},{"id":"W2021295875","doi":"10.1016/j.tcs.2004.02.040","title":"A space-efficient algorithm for sequence alignment with inversions and reversals","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Substring; Algorithm; Computation; Shuffling; Dynamic programming; Sequence (biology); Space (punctuation); Smith–Waterman algorithm; Pairwise comparison; Multiple sequence alignment; Mathematics; Computer science; Combinatorics; Sequence alignment; Data structure; Biology; Genetics; Gene; Artificial intelligence","score_opus":0.010298519084731315,"score_gpt":0.23876795517614552,"score_spread":0.2284694360914142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021295875","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.003164449,0.00023821018,0.9886623,0.00010052948,0.000078301775,0.0000952724,0.00018528895,0.006870006,0.0006056954],"genre_scores_gemma":[0.017501183,0.00013578795,0.9795675,0.00006163965,0.000039177703,0.00018187356,0.0007755037,0.00076681864,0.00097046426],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741614,0.0007246539,0.00028622334,0.00066881103,0.0006848471,0.0002192718],"domain_scores_gemma":[0.99596906,0.0018375703,0.0002300421,0.0010220214,0.0008151385,0.00012603584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027094535,0.0028274497,0.0024812862,0.003134873,0.0022695335,0.002718285,0.004039823,0.0022716084,0.008270984],"category_scores_gemma":[0.010856602,0.0013976801,0.0018416684,0.0062899822,0.0012929924,0.004059598,0.0034712136,0.003944661,0.007319985],"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.00056378846,0.00021707581,0.0005868967,0.00037965536,0.00014899966,0.00016173821,0.00031339258,0.027240667,0.020310624,0.02456075,0.017481927,0.9080345],"study_design_scores_gemma":[0.0006465366,0.00048141833,0.0008834142,0.00012363514,0.00023376777,0.0010575585,0.00030393555,0.7387932,0.037639372,0.17294517,0.046696402,0.00019563721],"about_ca_topic_score_codex":0.0030691847,"about_ca_topic_score_gemma":0.004678664,"teacher_disagreement_score":0.008270984,"about_ca_system_score_codex":0.001100839,"about_ca_system_score_gemma":0.002880718,"threshold_uncertainty_score":0.027669191},"labels":[],"label_agreement":null},{"id":"W2021539685","doi":"10.1016/s0304-3975(98)00226-6","title":"Generating irregular partitionable data structures","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Parallel Computing and Optimization Techniques","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":"IBM (Canada); McGill University","funders":"","keywords":"Computer science; Data structure; Theoretical computer science; Pointer (user interface); Formalism (music); Rule-based machine translation; Graph partition; Graph; Parallel computing; Algorithm; Distributed computing; Programming language; Artificial intelligence","score_opus":0.019400851168053863,"score_gpt":0.2738776741788165,"score_spread":0.25447682301076263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021539685","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.29980603,0.00024029658,0.68155956,0.00050550536,0.00018871693,0.00023086187,0.0007528237,0.0029797668,0.013736387],"genre_scores_gemma":[0.6960903,0.00016632648,0.294589,0.00013771286,0.000047178484,0.00022682243,0.0017794084,0.0006609001,0.006302303],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994629,0.00009101409,0.00003465969,0.00008789561,0.00023121397,0.00009228404],"domain_scores_gemma":[0.9979354,0.00080161804,0.00013458455,0.0007752968,0.0002707554,0.00008238201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045833996,0.00037593802,0.00059825776,0.000732583,0.00061141286,0.0010137956,0.0010020995,0.0006772236,0.004471474],"category_scores_gemma":[0.003548167,0.00042408422,0.00059949065,0.0016837287,0.000982007,0.0013571449,0.002297681,0.0010275685,0.0007884319],"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.0010929472,0.00031877574,0.004172611,0.0006895565,0.00009326491,0.00080127607,0.0010792379,0.22380856,0.07694173,0.3071158,0.021199351,0.36268684],"study_design_scores_gemma":[0.00021982622,0.0003358118,0.0008609951,0.00005869945,0.00006911856,0.0003578747,0.0003794804,0.63212645,0.06724062,0.27887863,0.019437551,0.000034969507],"about_ca_topic_score_codex":0.00036173142,"about_ca_topic_score_gemma":0.0008407027,"teacher_disagreement_score":0.004471474,"about_ca_system_score_codex":0.00050749915,"about_ca_system_score_gemma":0.0005406646,"threshold_uncertainty_score":0.01495862},"labels":[],"label_agreement":null},{"id":"W2021596745","doi":"10.1016/j.tcs.2012.04.001","title":"Algorithmic decomposition of shuffle on words","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Sublinear function; Property (philosophy); Decomposition; Mathematics; Time complexity; Combinatorics; Computational complexity theory; Discrete mathematics; Polynomial; Efficient algorithm; Word (group theory); Algorithm","score_opus":0.008221397840494565,"score_gpt":0.2671597439217456,"score_spread":0.258938346081251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021596745","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.22113833,0.0006442521,0.7128863,0.0008648736,0.00022020281,0.00018561637,0.00054128264,0.0007178168,0.06280144],"genre_scores_gemma":[0.7092594,0.0006099509,0.21611214,0.00042713562,0.00022651018,0.00026834334,0.0016758078,0.00057527225,0.07084543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992606,0.0001587374,0.000055750614,0.00015836183,0.00017932427,0.00018727414],"domain_scores_gemma":[0.9988807,0.00038633042,0.000089813424,0.00026357837,0.000203704,0.00017588219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065498904,0.00063661486,0.0008153368,0.0015385939,0.0013817652,0.0033245268,0.0010136487,0.000965083,0.014562727],"category_scores_gemma":[0.0019978476,0.0005778719,0.0014002483,0.0011059985,0.0018892852,0.00572948,0.0027817832,0.001869946,0.0025683714],"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.000069034744,0.000035127192,0.0001946094,0.000046713514,0.000008569266,0.00005267039,0.0002990861,0.0017025819,0.0011181805,0.98431015,0.0012563053,0.0109069515],"study_design_scores_gemma":[0.0000102334525,0.000019193469,0.000106382504,0.0000144238165,0.00000694508,0.00005034781,0.000080619706,0.0064339885,0.00076587696,0.9890838,0.0034194516,0.000008757678],"about_ca_topic_score_codex":0.0006825142,"about_ca_topic_score_gemma":0.0009342862,"teacher_disagreement_score":0.014562727,"about_ca_system_score_codex":0.0009477035,"about_ca_system_score_gemma":0.0008279845,"threshold_uncertainty_score":0.0487172},"labels":[],"label_agreement":null},{"id":"W2021913171","doi":"10.1016/j.tcs.2009.03.031","title":"On the synchronized derivation depth of context-free grammars","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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; Western University","funders":"","keywords":"Rule-based machine translation; Context (archaeology); Tree-adjoining grammar; Context-free grammar; Context-sensitive grammar; Mathematics; Indexed grammar; Computer science; Calculus (dental); Algorithm; Artificial intelligence; Geography","score_opus":0.009761927934682894,"score_gpt":0.2406589230558795,"score_spread":0.2308969951211966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021913171","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.2385213,0.0019057714,0.7220127,0.002503161,0.0001451761,0.0001364196,0.00074532576,0.0010876668,0.032942496],"genre_scores_gemma":[0.9045152,0.0010668464,0.083712466,0.0005805086,0.0002808522,0.000118324904,0.0005184713,0.0007384637,0.008468822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996811,0.0011232627,0.00021248976,0.00053716014,0.00083020964,0.00048591124],"domain_scores_gemma":[0.97059566,0.024889102,0.00082990807,0.0018278807,0.0011037797,0.00075362023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039826296,0.0009227502,0.0017485721,0.0023105799,0.0014819017,0.003037929,0.0028818317,0.0021267587,0.008272047],"category_scores_gemma":[0.025221372,0.001919094,0.0016897202,0.0022836016,0.0046838294,0.019982051,0.007284927,0.004845143,0.0008767244],"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.00016875577,0.000026487767,0.00071191805,0.000111384485,0.000030949384,0.00015945797,0.00104115,0.015145762,0.0023252575,0.9618451,0.00079444895,0.01763929],"study_design_scores_gemma":[0.000022546084,0.000019108082,0.00019229327,0.00002036294,0.00002379035,0.000043390424,0.00007001374,0.02971422,0.00092410564,0.96766704,0.0012828223,0.000020340349],"about_ca_topic_score_codex":0.003177118,"about_ca_topic_score_gemma":0.0028875223,"teacher_disagreement_score":0.008272047,"about_ca_system_score_codex":0.0024313373,"about_ca_system_score_gemma":0.0018678203,"threshold_uncertainty_score":0.027672768},"labels":[],"label_agreement":null},{"id":"W2022206191","doi":"10.1016/j.tcs.2011.05.042","title":"Conservative and aggressive rough SVR modeling","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Saint Mary's University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.037242674983623734,"score_gpt":0.2414768560614927,"score_spread":0.20423418107786895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022206191","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.07511259,0.0003479953,0.9091438,0.0008975476,0.000094152514,0.00002807187,0.00010160604,0.000272917,0.01400129],"genre_scores_gemma":[0.93418205,0.00025416614,0.050674643,0.00018803912,0.00012121976,0.000043265292,0.000110904264,0.00007680224,0.014348978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990889,0.0003171768,0.000031783253,0.00011334273,0.0003160825,0.00013269659],"domain_scores_gemma":[0.9983273,0.00078948383,0.00022971368,0.00029972775,0.0002196503,0.00013410585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016506385,0.0005837698,0.00094103883,0.0005954247,0.00059593766,0.0018595683,0.0013049168,0.0010344426,0.0024474417],"category_scores_gemma":[0.005332134,0.00046928955,0.0008098454,0.00056380103,0.0009805687,0.0025204758,0.0014168614,0.0017411346,0.00031867757],"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.0001144329,0.000054142707,0.0009442435,0.000044970206,0.000042720385,0.00021666451,0.00017204417,0.42765495,0.0024904562,0.54892534,0.0015686573,0.017771538],"study_design_scores_gemma":[0.0000045076276,0.000023791288,0.00018228554,0.0000037017473,0.000007622711,0.000037848058,0.000015770134,0.9304272,0.00026981815,0.068263635,0.0007536193,0.000010172609],"about_ca_topic_score_codex":0.0028553759,"about_ca_topic_score_gemma":0.0023739473,"teacher_disagreement_score":0.0028553759,"about_ca_system_score_codex":0.0007338676,"about_ca_system_score_gemma":0.00068756705,"threshold_uncertainty_score":0.008729458},"labels":[],"label_agreement":null},{"id":"W2022522100","doi":"10.1016/j.tcs.2005.09.047","title":"Tuning evaluation functions by maximizing concordance","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Concordance; Computer science; Mathematics; Algorithm; Biology; Bioinformatics","score_opus":0.029274080074199692,"score_gpt":0.3047333935201485,"score_spread":0.2754593134459488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022522100","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.19199434,0.00076006557,0.7913664,0.00067388,0.000112892354,0.00013908182,0.00005951636,0.0018849247,0.013008845],"genre_scores_gemma":[0.8873244,0.000115965544,0.108925216,0.00016822274,0.00007610691,0.000096834825,0.000092601214,0.0005798864,0.002620699],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99086964,0.0050167865,0.00043725048,0.0011782553,0.0019042382,0.0005938281],"domain_scores_gemma":[0.9794428,0.013671128,0.00085836544,0.002658116,0.0024972106,0.00087231764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010139539,0.0011423641,0.0020762645,0.0020482643,0.0009486538,0.0030638054,0.0019516421,0.0024904334,0.0029815629],"category_scores_gemma":[0.03959311,0.00066552823,0.0006807243,0.0012871596,0.0014821147,0.0029102874,0.002790291,0.002016715,0.0009557205],"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.0018199047,0.0005881493,0.009317809,0.00046137252,0.00034556855,0.00016559905,0.0005202139,0.31730956,0.031605054,0.117396645,0.007197059,0.5132732],"study_design_scores_gemma":[0.00011136805,0.00020391178,0.001379796,0.00005693149,0.000076224096,0.000090754686,0.000081378974,0.91873276,0.010987519,0.066826224,0.0014178724,0.000035259665],"about_ca_topic_score_codex":0.00055942056,"about_ca_topic_score_gemma":0.0006971031,"teacher_disagreement_score":0.010139539,"about_ca_system_score_codex":0.0014017285,"about_ca_system_score_gemma":0.0012560717,"threshold_uncertainty_score":0.053623676},"labels":[],"label_agreement":null},{"id":"W2023422760","doi":"10.1016/j.tcs.2015.02.009","title":"Smoothed heights of tries and patricia tries","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Zhejiang Sci-Tech University; Alberta Innovates - Technology Futures","keywords":"Trie; Bernoulli's principle; String (physics); Set (abstract data type); Mathematics; Combinatorics; Infinity; Binary number; Discrete mathematics; Algorithm; Data structure; Computer science; Physics; Mathematical analysis; Arithmetic; Mathematical physics","score_opus":0.014883339790127296,"score_gpt":0.24625883979561064,"score_spread":0.23137550000548335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023422760","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.54887,0.0017422775,0.34293148,0.002041281,0.0007810911,0.0000876299,0.00079589017,0.0015756686,0.10117462],"genre_scores_gemma":[0.94810295,0.00043661208,0.02605441,0.00027209427,0.0003160204,0.00005641912,0.0004386036,0.0003825284,0.023940483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935275,0.00012374615,0.000028242413,0.000117593256,0.00019882234,0.0001788617],"domain_scores_gemma":[0.9978067,0.00094890693,0.0002515586,0.0004131906,0.00025756296,0.00032209343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007205358,0.0005961399,0.00081696146,0.0028890728,0.0012237565,0.0023439596,0.0013045401,0.001085738,0.014558321],"category_scores_gemma":[0.008120683,0.0005946446,0.00075312384,0.0017399125,0.002590585,0.0027603186,0.003011656,0.0027087384,0.0020132104],"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.00015156527,0.0000178065,0.0009216789,0.000054150038,0.000018486558,0.000179028,0.00035344673,0.009104036,0.0021125404,0.9665062,0.0032425977,0.017338432],"study_design_scores_gemma":[0.00003192533,0.000058870835,0.001691304,0.000031453044,0.000025473564,0.0003940604,0.00036253693,0.05469178,0.0016155066,0.9332225,0.0078333,0.00004127865],"about_ca_topic_score_codex":0.00092836894,"about_ca_topic_score_gemma":0.001068637,"teacher_disagreement_score":0.014558321,"about_ca_system_score_codex":0.0006769626,"about_ca_system_score_gemma":0.0005174547,"threshold_uncertainty_score":0.04870242},"labels":[],"label_agreement":null},{"id":"W2024502076","doi":"10.1016/j.tcs.2008.02.030","title":"Learning indexed families of recursive languages from positive data: A survey","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Inductive reasoning; Recursion (computer science); Computer science; Decidability; Artificial intelligence; Computability theory; Naturalness; String (physics); Theoretical computer science; Natural language processing; Mathematics; Algorithm","score_opus":0.017941794120456118,"score_gpt":0.27954005080668504,"score_spread":0.26159825668622894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024502076","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03750618,0.041657135,0.90863883,0.004006153,0.0001407609,0.00014196464,0.001305602,0.0017238518,0.0048795906],"genre_scores_gemma":[0.3780954,0.06418295,0.53975654,0.0019572952,0.0017418426,0.0006320293,0.007956876,0.0010195419,0.0046575577],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9920522,0.0029813433,0.0008714498,0.0018031582,0.0020171662,0.0002746664],"domain_scores_gemma":[0.9262694,0.061649933,0.001886529,0.0063113025,0.0033006903,0.00058217545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012420188,0.0010234568,0.0026135724,0.0038675496,0.0010997101,0.0045094225,0.0043246346,0.0021170801,0.0031403229],"category_scores_gemma":[0.054231174,0.0013483295,0.0021363543,0.0056236004,0.0029871915,0.019482845,0.0040884074,0.0032369755,0.0014806187],"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.00026627508,0.00034500382,0.014290215,0.0021337853,0.00014903973,0.00014615926,0.00080809667,0.029861622,0.0017480991,0.15408882,0.009309815,0.786853],"study_design_scores_gemma":[0.00006706902,0.00035289797,0.002895933,0.00076531665,0.00009625058,0.0011192,0.00064839044,0.30961213,0.0032207323,0.6470532,0.034065116,0.00010368415],"about_ca_topic_score_codex":0.0010489783,"about_ca_topic_score_gemma":0.0013731545,"teacher_disagreement_score":0.012420188,"about_ca_system_score_codex":0.0016267262,"about_ca_system_score_gemma":0.0030706774,"threshold_uncertainty_score":0.065685034},"labels":[],"label_agreement":null},{"id":"W2024624524","doi":"10.1016/s0304-3975(03)00363-3","title":"An asymptotic fully polynomial time approximation scheme for bin covering","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":51,"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":"Bin packing problem; Bin; Mathematics; Polynomial-time approximation scheme; Scheme (mathematics); Time complexity; Approximation algorithm; Polynomial; Combinatorics; Dual (grammatical number); Mathematical optimization; Discrete mathematics; Algorithm; Mathematical analysis","score_opus":0.006235549382664906,"score_gpt":0.2174321802765514,"score_spread":0.2111966308938865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024624524","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.044532385,0.00092670793,0.9336464,0.000800242,0.00019590427,0.00024793073,0.0008302216,0.0046050902,0.014215139],"genre_scores_gemma":[0.38004234,0.0006543436,0.6052738,0.00051139103,0.00024545632,0.00046563792,0.001825466,0.0007809321,0.010200623],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964709,0.00066356314,0.00017834372,0.00061184895,0.0013141372,0.00076123833],"domain_scores_gemma":[0.99419594,0.0020357235,0.00026126957,0.0027432109,0.00047960717,0.00028424227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020600243,0.0014084412,0.00211787,0.0013717049,0.0013890754,0.0034444178,0.0040979884,0.00183038,0.010839032],"category_scores_gemma":[0.010540796,0.0008319225,0.0012893951,0.0041304477,0.0013047433,0.0069235633,0.0053626653,0.0031079445,0.00275473],"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.0029932181,0.0006760439,0.0014989951,0.00052790774,0.00013517254,0.00013254012,0.00049836753,0.26855156,0.018193275,0.13534965,0.035305105,0.5361381],"study_design_scores_gemma":[0.00013957688,0.00010341605,0.00031458272,0.000027217531,0.000056654626,0.000115254144,0.000055454544,0.908615,0.0031156554,0.08278948,0.0046441928,0.00002353613],"about_ca_topic_score_codex":0.0057180393,"about_ca_topic_score_gemma":0.0081649525,"teacher_disagreement_score":0.010839032,"about_ca_system_score_codex":0.004384103,"about_ca_system_score_gemma":0.0038840023,"threshold_uncertainty_score":0.036260247},"labels":[],"label_agreement":null},{"id":"W2024626468","doi":"10.1016/s0304-3975(00)00282-6","title":"On the expressive power of first-order boolean functions in PCF","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Semilattice; Parallelism (grammar); Mathematics; Simple (philosophy); Boolean function; Order (exchange); Expressive power; Power (physics); Discrete mathematics; Computer science; Combinatorics; Theoretical computer science; Parallel computing","score_opus":0.0141741374407998,"score_gpt":0.23722002919491,"score_spread":0.22304589175411021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024626468","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.23426251,0.0047779013,0.6290714,0.008369504,0.0003616239,0.00010069715,0.000877093,0.0018363175,0.12034299],"genre_scores_gemma":[0.92938656,0.0018756886,0.058407906,0.0009849496,0.0004926949,0.00010158862,0.00038147124,0.00042080297,0.007948285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555236,0.0015642649,0.00028608655,0.00060172635,0.0012085229,0.0007870379],"domain_scores_gemma":[0.964344,0.030133227,0.00075020315,0.0031221493,0.0010946686,0.00055576774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069619166,0.00090761884,0.0014748578,0.0021509042,0.0021087474,0.007262173,0.0024659482,0.0019966813,0.0044172984],"category_scores_gemma":[0.022911675,0.0010096274,0.0017956492,0.0029168788,0.0069006677,0.018966889,0.003737962,0.0068277563,0.00057329435],"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.000120313765,0.00003512883,0.0005565768,0.00008983199,0.000018994278,0.000099575685,0.0006655555,0.0074164746,0.0010644034,0.97028244,0.0011550325,0.018495576],"study_design_scores_gemma":[0.000014448023,0.000015463185,0.00013735697,0.000031001186,0.000019077685,0.000093577175,0.00006200819,0.017437197,0.0008025061,0.9791517,0.0022180886,0.000017620785],"about_ca_topic_score_codex":0.0031725727,"about_ca_topic_score_gemma":0.0028635822,"teacher_disagreement_score":0.007262173,"about_ca_system_score_codex":0.0026837029,"about_ca_system_score_gemma":0.0009487767,"threshold_uncertainty_score":0.036818564},"labels":[],"label_agreement":null},{"id":"W2025143052","doi":"10.1016/j.tcs.2012.11.037","title":"A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Facility location problem; Greedy algorithm; Approximation algorithm; Combinatorial algorithms; Mathematics; Dual (grammatical number); Scheme (mathematics); Combinatorial method; Mathematical optimization; Combinatorial optimization; Algorithm; Computer science; Combinatorics","score_opus":0.015966195577013283,"score_gpt":0.22621936649900135,"score_spread":0.21025317092198806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025143052","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.06823514,0.0017563909,0.8814495,0.0032546858,0.00051029876,0.000631023,0.001630267,0.0046122586,0.037920363],"genre_scores_gemma":[0.21476808,0.00040305906,0.76892287,0.0008826738,0.00018481188,0.0006723124,0.0022968943,0.0006646252,0.011204679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981186,0.00054743595,0.00008455972,0.0004317371,0.00037192195,0.00044570022],"domain_scores_gemma":[0.9977691,0.0012935211,0.0001494219,0.00034561526,0.00021861511,0.00022374757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019296022,0.0022909783,0.0029576258,0.0014528629,0.0012582833,0.003223696,0.004834349,0.0037164118,0.020667331],"category_scores_gemma":[0.0058843596,0.0011379502,0.0019611388,0.0031304755,0.00095858035,0.0036969674,0.0027343805,0.0033720902,0.0035928667],"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.0018407139,0.0015237076,0.001498039,0.00054131524,0.00015455528,0.00019660474,0.00021757741,0.55707395,0.0036306987,0.046436816,0.04686648,0.34001955],"study_design_scores_gemma":[0.0003933787,0.00014175172,0.00032392165,0.000032410502,0.000041347655,0.00009790654,0.00008258548,0.96484303,0.00072149397,0.029972738,0.0033273208,0.000022141641],"about_ca_topic_score_codex":0.01067095,"about_ca_topic_score_gemma":0.0140965255,"teacher_disagreement_score":0.020667331,"about_ca_system_score_codex":0.004157829,"about_ca_system_score_gemma":0.005713246,"threshold_uncertainty_score":0.06913918},"labels":[],"label_agreement":null},{"id":"W2025168251","doi":"10.1016/s0304-3975(01)00280-8","title":"Error-detecting properties of languages","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Computer science; Redundancy (engineering); Property (philosophy); Error detection and correction; Word (group theory); Extension (predicate logic); Algorithm; Error analysis; Theoretical computer science; Natural language processing; Mathematics; Programming language","score_opus":0.022543639455241488,"score_gpt":0.2496567692035984,"score_spread":0.2271131297483569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025168251","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.48056576,0.0004210781,0.50272226,0.0034660366,0.00016072922,0.00009490471,0.00073354447,0.0031257924,0.008709864],"genre_scores_gemma":[0.9679469,0.00012325517,0.028814046,0.00039497175,0.00017228385,0.00008804484,0.00040811778,0.0005166457,0.0015356715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901681,0.002592148,0.00097492797,0.0024993597,0.002511512,0.001254103],"domain_scores_gemma":[0.7549335,0.20262748,0.010551305,0.020744612,0.008163083,0.0029800374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007236925,0.0009258994,0.0015629609,0.0026580482,0.0024908443,0.006048084,0.0036909555,0.003113815,0.0034302461],"category_scores_gemma":[0.08898359,0.001481118,0.0016999383,0.0020231544,0.008553339,0.014044949,0.0045309733,0.0059869387,0.0006042833],"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.0015885872,0.0002664407,0.014653074,0.0004641881,0.00011831074,0.00096694333,0.002663607,0.028711792,0.015382681,0.88320196,0.0040714904,0.047910843],"study_design_scores_gemma":[0.0000775014,0.000076679535,0.0008216516,0.000041520394,0.000056327197,0.00048238123,0.00019985806,0.055220813,0.010484334,0.9313234,0.0011652353,0.00005025746],"about_ca_topic_score_codex":0.0006566663,"about_ca_topic_score_gemma":0.0004699142,"teacher_disagreement_score":0.007236925,"about_ca_system_score_codex":0.0016612523,"about_ca_system_score_gemma":0.0015923489,"threshold_uncertainty_score":0.038272977},"labels":[],"label_agreement":null},{"id":"W2025521996","doi":"10.1016/j.tcs.2004.02.032","title":"On the state complexity of reversals of regular languages","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":103,"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":"Regular language; Variety (cybernetics); Finite-state machine; State (computer science); Deterministic finite automaton; Nondeterministic finite automaton; Mathematics; Automaton; Finite state; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automata theory","score_opus":0.015218119819853127,"score_gpt":0.2520598938413013,"score_spread":0.23684177402144815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025521996","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.838025,0.0012784093,0.12335008,0.0048771873,0.00015647974,0.00011752934,0.00095311453,0.0005041488,0.030738136],"genre_scores_gemma":[0.98804736,0.0004011449,0.007271347,0.00016595602,0.00017129052,0.00007287613,0.0004305629,0.00014013654,0.0032993963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658537,0.001097128,0.00024569698,0.000516514,0.0009078889,0.00064740865],"domain_scores_gemma":[0.8886279,0.098631315,0.0038619612,0.004793499,0.0020269,0.0020584383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003786319,0.00070550805,0.0020730698,0.001865988,0.0018489328,0.0065911957,0.002713078,0.002592255,0.010012105],"category_scores_gemma":[0.04039308,0.0011341441,0.001687006,0.001844581,0.0047536585,0.016862785,0.0038225094,0.0054285005,0.00059529894],"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.00092307193,0.00022721496,0.004350541,0.00024165025,0.000072448085,0.00026226786,0.0009823656,0.0680748,0.0034835741,0.90120393,0.0030331279,0.017145032],"study_design_scores_gemma":[0.000066321205,0.00006126729,0.00096411654,0.000019724646,0.000037903603,0.00008500362,0.00013711766,0.13776112,0.00091029966,0.8593513,0.00056634884,0.0000394384],"about_ca_topic_score_codex":0.002006033,"about_ca_topic_score_gemma":0.0018323043,"teacher_disagreement_score":0.010012105,"about_ca_system_score_codex":0.0026489268,"about_ca_system_score_gemma":0.0016992149,"threshold_uncertainty_score":0.033493876},"labels":[],"label_agreement":null},{"id":"W2025639547","doi":"10.1016/j.tcs.2006.05.034","title":"Progressive solutions to a parallel automata equation","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Component (thermodynamics); Automaton; Block (permutation group theory); Mathematics; Action (physics); Cellular automaton; Computer science; Algorithm; Applied mathematics; Theoretical computer science; Combinatorics; Physics; Thermodynamics","score_opus":0.015572417817744736,"score_gpt":0.25212270200388376,"score_spread":0.23655028418613902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025639547","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.26418746,0.0004632474,0.60306746,0.0031762237,0.00043945207,0.0002015809,0.00028314124,0.0004361957,0.12774529],"genre_scores_gemma":[0.77930677,0.00070397067,0.103461556,0.0004957329,0.00030094673,0.00028195884,0.00027352414,0.00019111478,0.11498446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997172,0.000057119913,0.000020401721,0.000054341956,0.00010245632,0.000048497757],"domain_scores_gemma":[0.99911934,0.0005274959,0.00006190173,0.00008763945,0.00012836163,0.000075187374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006438436,0.0005418006,0.00053504616,0.00055617315,0.001230901,0.0013908454,0.0011158314,0.0012103117,0.013044625],"category_scores_gemma":[0.0034527555,0.00035492968,0.0008474293,0.00070831843,0.0015395384,0.0030078741,0.0024378665,0.002494432,0.0009181345],"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.000022369151,0.00001700652,0.000059086302,0.000025092144,0.0000049801256,0.00010464337,0.0001694228,0.0025919422,0.0011560039,0.9904773,0.00083591364,0.0045362534],"study_design_scores_gemma":[0.0000497085,0.000017789682,0.00005263514,0.0000065694076,0.000008372453,0.00010088811,0.000073776835,0.026472544,0.00091361196,0.96926796,0.0030293202,0.0000068293575],"about_ca_topic_score_codex":0.0013108898,"about_ca_topic_score_gemma":0.0014001783,"teacher_disagreement_score":0.013044625,"about_ca_system_score_codex":0.0009386775,"about_ca_system_score_gemma":0.0009263865,"threshold_uncertainty_score":0.043638647},"labels":[],"label_agreement":null},{"id":"W2026365732","doi":"10.1016/j.tcs.2013.05.003","title":"Addendum to “Recursively defined metric spaces without contraction” [Theoret. Comput. Sci. 380 (1/2) (2007) 143–163]","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Addendum; Mathematics; Contraction (grammar); Metric space; Metric (unit); Discrete mathematics; Combinatorics; Algorithm; Algebra over a field; Calculus (dental); Pure mathematics; Engineering","score_opus":0.012924827962777725,"score_gpt":0.25207466812166757,"score_spread":0.23914984015888985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026365732","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.0061048213,0.021790342,0.40238953,0.049009115,0.22004187,0.00029911858,0.0053374,0.004097436,0.2909304],"genre_scores_gemma":[0.115681425,0.031049563,0.34047043,0.036698617,0.13560995,0.0012044724,0.01896425,0.006860655,0.31346068],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983575,0.00036608562,0.000076400116,0.00039909888,0.0006649045,0.00013603098],"domain_scores_gemma":[0.9950015,0.0019303776,0.00027223298,0.0010934286,0.0011882101,0.0005141624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018294846,0.0026680112,0.0016679411,0.0031572941,0.001946708,0.0038347635,0.0046882527,0.0021997425,0.08790705],"category_scores_gemma":[0.0091748405,0.00081903365,0.0028005394,0.003516872,0.0027947607,0.007563337,0.006098103,0.0060810694,0.041187562],"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.00017607994,0.0001705348,0.00043965798,0.00088662974,0.00013225598,0.0004306274,0.00029318052,0.0013412118,0.0023602997,0.2700184,0.6067926,0.11695856],"study_design_scores_gemma":[0.00004896862,0.00013604952,0.0012578042,0.0001855594,0.00012536469,0.0011371038,0.00011240201,0.004209147,0.0020249707,0.24144547,0.74916756,0.00014957941],"about_ca_topic_score_codex":0.0025182983,"about_ca_topic_score_gemma":0.0045413496,"teacher_disagreement_score":0.08790705,"about_ca_system_score_codex":0.0015633061,"about_ca_system_score_gemma":0.0015384422,"threshold_uncertainty_score":0.29407835},"labels":[],"label_agreement":null},{"id":"W2026409515","doi":"10.1016/j.tcs.2008.09.023","title":"On weighted balls-into-bins games","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ball (mathematics); Bin; Mathematics; Context (archaeology); Computer science; Combinatorics; Mathematical optimization; Algorithm; Geometry","score_opus":0.01958480343885642,"score_gpt":0.21519433549914774,"score_spread":0.1956095320602913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026409515","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.17601986,0.0009730024,0.76168543,0.0034136677,0.00029612178,0.0003829397,0.0005450218,0.0002027178,0.056481298],"genre_scores_gemma":[0.87326884,0.0014121489,0.07871458,0.00089315913,0.00032436615,0.0006327787,0.0006886073,0.00017519799,0.0438903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659926,0.0019833732,0.00013430211,0.00033250332,0.00041315818,0.0005374196],"domain_scores_gemma":[0.9893119,0.007927268,0.0007133306,0.0005145255,0.000585646,0.00094738853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002913267,0.0020275146,0.0036645944,0.0014190051,0.0018425725,0.0048526945,0.004780492,0.0039510457,0.014696968],"category_scores_gemma":[0.020087654,0.0011438036,0.0013068713,0.0024039655,0.004086676,0.008746066,0.0037827701,0.0036160594,0.0010460583],"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.00019606108,0.0000714287,0.0002855424,0.00008112649,0.00003200887,0.00006303465,0.00015822685,0.059681308,0.00042332194,0.9301129,0.002663095,0.00623197],"study_design_scores_gemma":[0.000076497614,0.000027203636,0.00009650839,0.000016995991,0.000013472134,0.000022303555,0.00005465318,0.20171255,0.0000906602,0.79689366,0.0009785679,0.000016891541],"about_ca_topic_score_codex":0.0067180875,"about_ca_topic_score_gemma":0.0060245898,"teacher_disagreement_score":0.014696968,"about_ca_system_score_codex":0.0030117733,"about_ca_system_score_gemma":0.0020764126,"threshold_uncertainty_score":0.049166203},"labels":[],"label_agreement":null},{"id":"W2026582799","doi":"10.1016/j.tcs.2004.07.028","title":"Enhancing global SLS-resolution with loop cutting and tabling mechanisms","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Resolution (logic); Semantics (computer science); Computation; Computer science; Property (philosophy); Loop (graph theory); Bounded function; Stack (abstract data type); Programming language; Simple (philosophy); Algorithm; Theoretical computer science; Mathematics","score_opus":0.006578832329436091,"score_gpt":0.22602170268789493,"score_spread":0.21944287035845883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026582799","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.022654828,0.00031884323,0.96046233,0.00035069644,0.00009886755,0.00010309877,0.00016305277,0.004347873,0.011500464],"genre_scores_gemma":[0.38329494,0.00021845948,0.60682476,0.00029297773,0.000083956904,0.00011064285,0.0005125381,0.0010509867,0.007610724],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745196,0.00084750174,0.00018543446,0.00035493184,0.0008334646,0.00032672015],"domain_scores_gemma":[0.9938506,0.0026703065,0.00029643456,0.002243626,0.0007898441,0.00014918068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030865944,0.0012390133,0.0015259694,0.001745099,0.0011023812,0.0025089218,0.0026546952,0.0018665165,0.020790521],"category_scores_gemma":[0.011856064,0.0005709534,0.0015565405,0.0020316967,0.001992668,0.005991281,0.0061082086,0.0024576308,0.0025685532],"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.00066785514,0.0004005421,0.0018495021,0.0008849255,0.00022046767,0.00041943122,0.0009556051,0.11064493,0.020227535,0.24687696,0.013077796,0.60377455],"study_design_scores_gemma":[0.00017963773,0.00013966658,0.00038807778,0.00012359054,0.0001960344,0.00027966354,0.00041243903,0.57291734,0.029869922,0.37522122,0.02020915,0.00006332695],"about_ca_topic_score_codex":0.0011149793,"about_ca_topic_score_gemma":0.0029204187,"teacher_disagreement_score":0.020790521,"about_ca_system_score_codex":0.0006630376,"about_ca_system_score_gemma":0.0012484655,"threshold_uncertainty_score":0.06955123},"labels":[],"label_agreement":null},{"id":"W2026951311","doi":"10.1016/j.tcs.2009.02.024","title":"Decimations of languages and state complexity","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Context-free language; Context (archaeology); Transformation (genetics); Mathematics; State (computer science); Regular language; Arithmetic; Combinatorics; Upper and lower bounds; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Algorithm; Theoretical computer science; Rule-based machine translation","score_opus":0.01166234300292262,"score_gpt":0.2812288733793871,"score_spread":0.2695665303764645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026951311","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.34134609,0.0034528002,0.591039,0.0057342327,0.00027368302,0.000079033045,0.00054882356,0.0007946826,0.056731727],"genre_scores_gemma":[0.9543078,0.00082941336,0.03275328,0.00036510863,0.00042706696,0.00014212458,0.0002556484,0.00015653291,0.010763108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969326,0.00088018883,0.0002835969,0.0007805965,0.0007101931,0.00041276586],"domain_scores_gemma":[0.9651271,0.028093735,0.0015796956,0.0027457343,0.0014936002,0.0009600797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028145516,0.0006428736,0.0016474985,0.0019490216,0.0016163883,0.0063511604,0.0016206354,0.0015363429,0.008026655],"category_scores_gemma":[0.018125085,0.0009795635,0.0011616352,0.001864856,0.0059795165,0.015609,0.0036967567,0.0055427947,0.0007002405],"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.000037087502,0.000015690497,0.00019088597,0.0000308805,0.000005947767,0.000028857148,0.0002512597,0.0035990467,0.00025083878,0.99006,0.0003157411,0.005213705],"study_design_scores_gemma":[0.0000060353573,0.000005256998,0.0000526973,0.000005235125,0.000003328124,0.00002257472,0.000022996228,0.008014372,0.00016262561,0.99123645,0.00046237835,0.0000061033443],"about_ca_topic_score_codex":0.0008147784,"about_ca_topic_score_gemma":0.00070933776,"teacher_disagreement_score":0.008026655,"about_ca_system_score_codex":0.0023160847,"about_ca_system_score_gemma":0.0009968608,"threshold_uncertainty_score":0.026851833},"labels":[],"label_agreement":null},{"id":"W2027154380","doi":"10.1016/j.tcs.2014.10.037","title":"Improving the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-bound on the price of stability in undirected Shapley network design games","year":2014,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Upper and lower bounds; Stability (learning theory); Function (biology); Combinatorics; Mathematics; Algorithm; Computer science; Discrete mathematics; Mathematical economics; Machine learning; Mathematical analysis","score_opus":0.03073461169615029,"score_gpt":0.2641081378752692,"score_spread":0.2333735261791189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027154380","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.03455656,0.0017232145,0.78573084,0.009154661,0.00093474245,0.00029883985,0.0010964146,0.0010245392,0.16548015],"genre_scores_gemma":[0.5831511,0.0029712068,0.35677436,0.0030179503,0.0010795179,0.00056994637,0.0018216936,0.0016069184,0.0490072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962746,0.0015108936,0.00013827442,0.0007089328,0.000965294,0.00040200623],"domain_scores_gemma":[0.9776659,0.01614971,0.00059920474,0.0028698482,0.0018779525,0.000837496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064633153,0.0026378087,0.0016676657,0.0023268545,0.0016404502,0.0050746463,0.004451164,0.0029906458,0.048319016],"category_scores_gemma":[0.042371757,0.0008898671,0.0024608453,0.0025820853,0.0021872418,0.013648179,0.0054509654,0.007180688,0.008684927],"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.00028306813,0.0005707989,0.0015149342,0.00059835636,0.00014321724,0.00016477745,0.00040035782,0.07268656,0.0029344906,0.7902913,0.04859769,0.08181439],"study_design_scores_gemma":[0.00007432532,0.00011968192,0.0004614651,0.00015032881,0.00006934815,0.000119203294,0.00009373414,0.25645256,0.0017762273,0.7276197,0.013020743,0.000042688396],"about_ca_topic_score_codex":0.0036366382,"about_ca_topic_score_gemma":0.0053172344,"teacher_disagreement_score":0.048319016,"about_ca_system_score_codex":0.003718665,"about_ca_system_score_gemma":0.0036343096,"threshold_uncertainty_score":0.1616432},"labels":[],"label_agreement":null},{"id":"W2027573831","doi":"10.1016/j.tcs.2011.12.016","title":"Encapsulating deontic and branching time specifications","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Deontic logic; Computer science; Modular design; Locality; Temporal logic; Branching (polymer chemistry); Theoretical computer science; Linear temporal logic; Programming language; Modular programming; Epistemology","score_opus":0.045977585765061016,"score_gpt":0.2599045389504922,"score_spread":0.2139269531854312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027573831","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.01888877,0.00014142919,0.97226894,0.00024839948,0.00007879937,0.000096990814,0.0002345391,0.0012036159,0.0068384954],"genre_scores_gemma":[0.49621695,0.0005488968,0.4836696,0.00034738338,0.0001402825,0.00033275035,0.0012840204,0.0012093171,0.016250817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950877,0.0012691298,0.0005669067,0.00056986447,0.0019671032,0.0005392832],"domain_scores_gemma":[0.9875165,0.006847669,0.0008707254,0.0030874608,0.0013476313,0.00032993077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006611271,0.0009782978,0.00079368334,0.0013176316,0.0010099333,0.0043442254,0.0019037358,0.0019890051,0.0044550956],"category_scores_gemma":[0.014787464,0.0013604861,0.0019585367,0.0014238043,0.0026667707,0.007670192,0.0032790222,0.0028344456,0.00111638],"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.000079337595,0.00004339347,0.0003509092,0.00009587672,0.000021356316,0.00019207876,0.00050845137,0.012959242,0.0037349355,0.9639667,0.00055960706,0.017487988],"study_design_scores_gemma":[0.00006550956,0.000052787713,0.00016208485,0.00009297707,0.00010150617,0.00018082872,0.00014041997,0.09574024,0.018628126,0.8591958,0.025588078,0.00005178513],"about_ca_topic_score_codex":0.00290873,"about_ca_topic_score_gemma":0.0032120568,"teacher_disagreement_score":0.006611271,"about_ca_system_score_codex":0.0015691477,"about_ca_system_score_gemma":0.0026604445,"threshold_uncertainty_score":0.034964144},"labels":[],"label_agreement":null},{"id":"W2027783832","doi":"10.1016/s0304-3975(01)00408-x","title":"Embedding problems for paths with direction constrained edges","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consiglio Nazionale delle Ricerche; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Reachability; Embedding; Planar graph; Graph embedding; Path (computing); Mathematics; Book embedding; Graph; Planar; Context (archaeology); Characterization (materials science); Combinatorics; Algorithm; Computer science; Topology (electrical circuits); Discrete mathematics; Artificial intelligence; Pathwidth; Line graph","score_opus":0.017630980161791848,"score_gpt":0.24552910943419673,"score_spread":0.22789812927240488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027783832","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.062711015,0.0008636583,0.92667055,0.00095888984,0.000101565594,0.00008556645,0.0003498667,0.00016367447,0.00809528],"genre_scores_gemma":[0.5113872,0.002442555,0.443783,0.00034243197,0.000357414,0.00037187338,0.00204505,0.00061018206,0.03866028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925715,0.00024993924,0.000042885673,0.00022487399,0.00014902694,0.000076170836],"domain_scores_gemma":[0.99527836,0.0035302066,0.00038171036,0.00026358277,0.00025145922,0.00029479613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825693,0.0017429207,0.0014987135,0.0013495531,0.00076607923,0.002152613,0.002312327,0.0034504395,0.0072552213],"category_scores_gemma":[0.009798901,0.0013823754,0.0010395928,0.0014027988,0.0018249708,0.0065824934,0.0041038757,0.003903377,0.0007639705],"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.0002568535,0.0001831022,0.0007450154,0.0005395033,0.000071241244,0.00024963386,0.00041404468,0.37960416,0.0025395502,0.5403616,0.0066723255,0.068363056],"study_design_scores_gemma":[0.000039892537,0.000066449626,0.00014096702,0.000053362768,0.000021476206,0.00011265849,0.00013078588,0.47054508,0.00071700057,0.52407265,0.0040775635,0.00002212204],"about_ca_topic_score_codex":0.0020127813,"about_ca_topic_score_gemma":0.0016207951,"teacher_disagreement_score":0.0072552213,"about_ca_system_score_codex":0.0009632261,"about_ca_system_score_gemma":0.00067646627,"threshold_uncertainty_score":0.02427113},"labels":[],"label_agreement":null},{"id":"W2027854745","doi":"10.1016/j.tcs.2010.10.026","title":"Reconstructing polygons from scanner data","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Scanner; Point in polygon; Point (geometry); Visibility; Range (aeronautics); Set (abstract data type); Polygon (computer graphics); Mathematics; Plane (geometry); Algorithm; Computational geometry; Computer science; Combinatorics; Geometry; Computer vision; Topology (electrical circuits); Polygon mesh; Artificial intelligence; Geography","score_opus":0.011727437243471292,"score_gpt":0.22411161233133442,"score_spread":0.21238417508786311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027854745","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.038653065,0.00016030976,0.9580444,0.000095691285,0.000029881377,0.00007584104,0.00036923887,0.0016311902,0.00094038306],"genre_scores_gemma":[0.31874698,0.0005304864,0.67695075,0.00003876727,0.000025604131,0.00009057495,0.0015172188,0.00047381542,0.0016257704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940526,0.00009153493,0.0000366223,0.00013856086,0.00026900021,0.000059084177],"domain_scores_gemma":[0.9985323,0.0006642865,0.00013049047,0.0004514831,0.00016667956,0.000054761036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004929063,0.0014181263,0.0010961546,0.0019023981,0.00031143395,0.0014372051,0.0012115776,0.0014870742,0.0017837732],"category_scores_gemma":[0.0038191753,0.0017947314,0.0011767683,0.0021328472,0.0009803594,0.0014713675,0.0015501722,0.0017790783,0.001474534],"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.0004107704,0.00011150211,0.0041834633,0.00045589037,0.00011727309,0.0012324686,0.0004107412,0.501018,0.049490493,0.014750198,0.0033194784,0.4244997],"study_design_scores_gemma":[0.00002065084,0.000047798952,0.00077666057,0.000027109161,0.00002391613,0.00041056512,0.00012466255,0.96531606,0.018682646,0.011789685,0.0027548573,0.000025367874],"about_ca_topic_score_codex":0.0038658308,"about_ca_topic_score_gemma":0.003919998,"teacher_disagreement_score":0.0038658308,"about_ca_system_score_codex":0.0003361212,"about_ca_system_score_gemma":0.0009647985,"threshold_uncertainty_score":0.0076866746},"labels":[],"label_agreement":null},{"id":"W2028077146","doi":"10.1016/j.tcs.2007.03.039","title":"Learning intersection-closed classes with signatures","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Intersection (aeronautics); Equivalence (formal languages); Signature (topology); Mathematics; Theoretical computer science; Algebraic number; Invariant (physics); Scheme (mathematics); Concept class; Algebra over a field; Computer science; Discrete mathematics; Algorithm; Pure mathematics","score_opus":0.004030657338007537,"score_gpt":0.2408022262372431,"score_spread":0.23677156889923556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028077146","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.05758072,0.00067364064,0.93177086,0.0011802248,0.000119235876,0.00008310767,0.0005107121,0.002257591,0.005823945],"genre_scores_gemma":[0.6317725,0.000758431,0.35504338,0.00052982476,0.00040970193,0.0002956468,0.0038588436,0.0008296801,0.00650193],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921923,0.0019045803,0.0007094987,0.002306323,0.0022256416,0.00066162576],"domain_scores_gemma":[0.9776225,0.01411212,0.0012386569,0.0042306776,0.0019883492,0.00080774847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005034991,0.0010310865,0.0024492107,0.0027544298,0.0019623253,0.0064285775,0.0039668023,0.0023252433,0.0064048585],"category_scores_gemma":[0.03207912,0.0013011062,0.0023040508,0.0035488901,0.0034398853,0.024983078,0.0088542355,0.0072021293,0.0018806771],"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.0012790823,0.00051065936,0.009736099,0.00053206226,0.00020128737,0.00019235259,0.001216776,0.040028114,0.002948515,0.4364576,0.01607841,0.49081904],"study_design_scores_gemma":[0.000045204426,0.00006643144,0.00038160433,0.000055707602,0.000039845698,0.00016291601,0.00025061882,0.16655944,0.002423256,0.824836,0.0051507675,0.000028104632],"about_ca_topic_score_codex":0.0010242854,"about_ca_topic_score_gemma":0.0011694529,"teacher_disagreement_score":0.0064285775,"about_ca_system_score_codex":0.0017908888,"about_ca_system_score_gemma":0.0021723383,"threshold_uncertainty_score":0.026627958},"labels":[],"label_agreement":null},{"id":"W2028475750","doi":"10.1016/j.tcs.2012.04.002","title":"One-reversal counter machines and multihead automata: Revisited","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"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; Google (Canada)","funders":"","keywords":"Pushdown automaton; Deterministic pushdown automaton; Deterministic context-free grammar; Computer science; Nested word; Finite-state machine; Embedded pushdown automaton; Deterministic finite automaton; Counterexample; Theoretical computer science; Automaton; Algorithm; Discrete mathematics; Automata theory; Mathematics; Quantum finite automata; Programming language; Nondeterministic finite automaton; Parsing; Context-free grammar","score_opus":0.011368968874612733,"score_gpt":0.2533445139941322,"score_spread":0.2419755451195195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028475750","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.19939479,0.040672604,0.34091637,0.06778302,0.0049922746,0.00012868781,0.00048338028,0.00083699473,0.34479186],"genre_scores_gemma":[0.92936504,0.0065691946,0.031692997,0.00402534,0.0021911552,0.000108222106,0.00012172973,0.00014380399,0.025782503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881834,0.00043858067,0.00006864881,0.00027929456,0.0002116782,0.00018341003],"domain_scores_gemma":[0.99255556,0.004676157,0.0005342685,0.0012879771,0.00059798727,0.00034809258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024337682,0.000699977,0.0013030793,0.0016155696,0.0022724506,0.0046971436,0.003442323,0.0060536275,0.013446562],"category_scores_gemma":[0.007794563,0.00068641274,0.0011606213,0.0026729743,0.0074728606,0.013958421,0.0024816226,0.005935828,0.0014319011],"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.000012800158,0.000008014284,0.000080308906,0.000026164946,0.000002929185,0.000031063642,0.00008133921,0.00027448506,0.00010365623,0.99492633,0.0009803708,0.0034725259],"study_design_scores_gemma":[0.000007488297,0.0000075395033,0.00009742454,0.00001728333,0.000004799279,0.000057664416,0.000078215504,0.0024568124,0.00012726334,0.9949438,0.0021940088,0.000007663669],"about_ca_topic_score_codex":0.0019472481,"about_ca_topic_score_gemma":0.002749333,"teacher_disagreement_score":0.013446562,"about_ca_system_score_codex":0.002183318,"about_ca_system_score_gemma":0.0014475576,"threshold_uncertainty_score":0.044983268},"labels":[],"label_agreement":null},{"id":"W2029064195","doi":"10.1016/j.tcs.2008.09.027","title":"A cyclic binary morphism avoiding Abelian fourth powers","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Abelian group; Mathematics; Binary number; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Arithmetic","score_opus":0.013840604077014223,"score_gpt":0.23986156262289027,"score_spread":0.22602095854587603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029064195","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.7344528,0.00036860982,0.098901704,0.0011028689,0.0006896656,0.000064317566,0.00014636872,0.0005484121,0.16372529],"genre_scores_gemma":[0.9129912,0.00024549995,0.021722345,0.00034000564,0.0002121076,0.000047169262,0.000110029054,0.0002911966,0.064040355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959093,0.000077352364,0.000017232476,0.0000802856,0.00010675105,0.00012734316],"domain_scores_gemma":[0.99905306,0.0003333255,0.000112226735,0.00016825809,0.0001278682,0.00020520318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036657872,0.00048278345,0.0005989801,0.0015603482,0.001926124,0.0019247332,0.00053240487,0.0011558733,0.010078091],"category_scores_gemma":[0.0012783307,0.00042079578,0.00067643856,0.0010540602,0.0022503575,0.0024735923,0.0023161385,0.0017262619,0.0015336929],"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.00008489385,0.000031308806,0.00027488355,0.000038338076,0.0000073615347,0.00029083592,0.00029724606,0.00046403985,0.0051046214,0.98351157,0.0010562355,0.008838709],"study_design_scores_gemma":[0.000041072133,0.0000873518,0.00044732806,0.00003082674,0.000024058958,0.000946769,0.00023072657,0.0037786777,0.0054341033,0.97120315,0.017735744,0.000040123145],"about_ca_topic_score_codex":0.00043086213,"about_ca_topic_score_gemma":0.00032605478,"teacher_disagreement_score":0.010078091,"about_ca_system_score_codex":0.0008038282,"about_ca_system_score_gemma":0.00048545835,"threshold_uncertainty_score":0.033714592},"labels":[],"label_agreement":null},{"id":"W2029413222","doi":"10.1016/j.tcs.2003.10.010","title":"From cascade decompositions to bit-vector algorithms","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Algorithm; Automaton; Cascade; Mathematics; Computation; Bit array; Bounded function; Computer science; Theoretical computer science; Type (biology)","score_opus":0.008736864146077434,"score_gpt":0.25412173965813795,"score_spread":0.2453848755120605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029413222","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.018706542,0.0010497347,0.9501167,0.0011252969,0.0002589768,0.00008655612,0.00022122156,0.0013337552,0.027101217],"genre_scores_gemma":[0.43372625,0.002544751,0.5226532,0.001380731,0.0009257809,0.0004130599,0.0010575403,0.0013295511,0.0359691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990232,0.00029695444,0.00006141457,0.00020984511,0.0002902451,0.00011835237],"domain_scores_gemma":[0.9974995,0.0013590282,0.00012774086,0.00064097333,0.00024694914,0.00012574339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011449778,0.001006695,0.0010067621,0.0016063512,0.0011640482,0.0027180535,0.001477383,0.001365671,0.01798584],"category_scores_gemma":[0.0056413095,0.000754872,0.0010092119,0.002282637,0.0020926322,0.008289019,0.0028705087,0.0033687335,0.0035615936],"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.00011566935,0.000041087867,0.00012428292,0.00007892817,0.000011980616,0.000027875407,0.000110514644,0.0060036285,0.0010791582,0.9342799,0.0058507957,0.0522762],"study_design_scores_gemma":[0.000012212028,0.00001405742,0.000029082796,0.000015359208,0.000007325879,0.000025348085,0.000012558915,0.024644917,0.0006432339,0.97140074,0.0031884883,0.0000067532746],"about_ca_topic_score_codex":0.0006997538,"about_ca_topic_score_gemma":0.0010792998,"teacher_disagreement_score":0.01798584,"about_ca_system_score_codex":0.0011263764,"about_ca_system_score_gemma":0.0007798783,"threshold_uncertainty_score":0.060168684},"labels":[],"label_agreement":null},{"id":"W2029626238","doi":"10.1016/s0304-3975(02)00738-7","title":"Mining for empty spaces in large data sets","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Focus (optics); Scalability; Computer science; Bounded function; Set (abstract data type); Data structure; Space (punctuation); Mathematics; Algorithm; Data mining; Theoretical computer science","score_opus":0.03465404803737175,"score_gpt":0.30475762553959324,"score_spread":0.27010357750222147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029626238","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.30917946,0.0031219854,0.6784425,0.0020351193,0.00024150508,0.0002079507,0.0029260633,0.0025780182,0.0012675105],"genre_scores_gemma":[0.5851716,0.000814801,0.4023047,0.00027620752,0.00026064034,0.00020825848,0.008263156,0.0004293523,0.002271354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99251693,0.0015843539,0.0013521605,0.0013923998,0.0024527467,0.00070147956],"domain_scores_gemma":[0.9621026,0.022130972,0.0034178265,0.0066266186,0.0041369097,0.0015851302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065063005,0.001149357,0.003415719,0.0048809703,0.0034123508,0.00568433,0.0049654623,0.0026211354,0.0016168755],"category_scores_gemma":[0.040301487,0.0012824899,0.0026614442,0.006059836,0.0032275382,0.015370697,0.00702293,0.0033427703,0.00090118137],"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.0032230907,0.0012661009,0.1411399,0.002539841,0.00089082046,0.0029455477,0.0053412667,0.07077123,0.015610813,0.08401102,0.021104738,0.6511556],"study_design_scores_gemma":[0.0001032338,0.00052939117,0.0074522705,0.0005014345,0.00037859287,0.0029509782,0.0043396386,0.6203331,0.026667167,0.32116956,0.01543765,0.00013700145],"about_ca_topic_score_codex":0.000900753,"about_ca_topic_score_gemma":0.0016792319,"teacher_disagreement_score":0.0065063005,"about_ca_system_score_codex":0.0006817351,"about_ca_system_score_gemma":0.0023605756,"threshold_uncertainty_score":0.034408987},"labels":[],"label_agreement":null},{"id":"W2029731972","doi":"10.1016/j.tcs.2008.02.025","title":"Measuring teachability using variants of the teaching dimension","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimension (graph theory); Monomial; Object (grammar); Mathematics education; Mathematics; Computer science; Teaching method; Theoretical computer science; Artificial intelligence; Discrete mathematics; Combinatorics","score_opus":0.025250209994526658,"score_gpt":0.25284650155929644,"score_spread":0.2275962915647698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029731972","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.95133513,0.00022270733,0.035135213,0.00017069765,0.00003022458,0.000108032444,0.0011514222,0.0002607472,0.011585792],"genre_scores_gemma":[0.9919843,0.000059357633,0.006553052,0.000014961901,0.000015182205,0.000086404885,0.00050817634,0.000029231413,0.00074934255],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556774,0.0011570983,0.0003880413,0.0007084451,0.0018321946,0.00034645153],"domain_scores_gemma":[0.9166445,0.06117635,0.0087666325,0.006029604,0.0039683473,0.0034145864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033919346,0.00045975792,0.0005738165,0.0034815676,0.00053606863,0.0026573187,0.00076838006,0.0011293493,0.0044435486],"category_scores_gemma":[0.043538086,0.00020562827,0.0007222236,0.003318907,0.0012274302,0.0032781574,0.0018090577,0.0013724458,0.000810417],"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.0011938522,0.0012404512,0.7767512,0.0003383481,0.00050397974,0.00008649143,0.0017497553,0.017207127,0.014457155,0.018596929,0.0012678414,0.16660675],"study_design_scores_gemma":[0.00009509876,0.0015650076,0.87981516,0.00006280167,0.00022853658,0.00022940502,0.0011626474,0.05248748,0.02017091,0.03964134,0.0043939203,0.0001478126],"about_ca_topic_score_codex":0.0016233086,"about_ca_topic_score_gemma":0.0019369407,"teacher_disagreement_score":0.0044435486,"about_ca_system_score_codex":0.0010878703,"about_ca_system_score_gemma":0.00081349333,"threshold_uncertainty_score":0.017938495},"labels":[],"label_agreement":null},{"id":"W2029877651","doi":"10.1016/j.tcs.2015.04.027","title":"On the complexity of neighbourhood learning in radio networks","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Neighbourhood (mathematics); Schedule; Node (physics); Class (philosophy); Generalization; Radio networks; Upper and lower bounds; Degree (music); Binary logarithm; Graph; Algorithm; Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Wireless network; Artificial intelligence; Wireless; Telecommunications","score_opus":0.06630140433264756,"score_gpt":0.2858921960271714,"score_spread":0.21959079169452386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029877651","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.25328922,0.0055107647,0.6889266,0.012491479,0.00046342274,0.00017425045,0.001284136,0.00044028345,0.037419904],"genre_scores_gemma":[0.9474435,0.0033848064,0.036860548,0.0006634142,0.0008058361,0.00027312286,0.0007225143,0.00023807504,0.0096082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960665,0.002028461,0.00017506568,0.0005058963,0.0008077549,0.0004163509],"domain_scores_gemma":[0.8742948,0.11317897,0.004277618,0.0035334877,0.0020977969,0.002617217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004114425,0.0010667254,0.0031672781,0.002068477,0.001872397,0.004054124,0.0042776745,0.0038757278,0.007683186],"category_scores_gemma":[0.0585735,0.0011731889,0.0014365824,0.0025193994,0.005433593,0.010695463,0.0060888003,0.005021834,0.0006272048],"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.00030104016,0.00012485629,0.0022961325,0.00032545484,0.00010100549,0.00014614702,0.0003441575,0.36284485,0.0006693169,0.6083723,0.0061479458,0.018326767],"study_design_scores_gemma":[0.000040536594,0.000034459965,0.00035090264,0.00003066979,0.00001771921,0.000057921417,0.000054556327,0.42845145,0.00013757168,0.57013,0.0006712927,0.000022913357],"about_ca_topic_score_codex":0.0032845219,"about_ca_topic_score_gemma":0.0031373997,"teacher_disagreement_score":0.007683186,"about_ca_system_score_codex":0.0033835678,"about_ca_system_score_gemma":0.0016159443,"threshold_uncertainty_score":0.025702834},"labels":[],"label_agreement":null},{"id":"W2031856686","doi":"10.1016/j.tcs.2002.11.003","title":"Periodicity in one-dimensional peg duotaire","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Institute for Materials Science","keywords":"Conjecture; PEG ratio; Combinatorics; Mathematics; Hop (telecommunications); Solitaire Cryptographic Algorithm; Discrete mathematics; Computer science; Telecommunications","score_opus":0.02443893551405692,"score_gpt":0.2725862962438209,"score_spread":0.24814736072976398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031856686","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.7066869,0.00055506185,0.19239725,0.0009230269,0.00036415283,0.000098565026,0.00016143595,0.00035957978,0.098453976],"genre_scores_gemma":[0.9615307,0.00014434848,0.019133374,0.00010288747,0.0000541924,0.000059081103,0.00008718632,0.00008868499,0.018799648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954516,0.0001062175,0.000032255044,0.00009111642,0.00012367712,0.00010147618],"domain_scores_gemma":[0.99908996,0.00034149794,0.00016641787,0.00012001935,0.00009486202,0.00018736256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005223348,0.0003937409,0.0010832244,0.0008083882,0.0019786204,0.0019019165,0.0010259363,0.0017826216,0.007553098],"category_scores_gemma":[0.0031802803,0.00054790004,0.00066672044,0.00043722062,0.0022244747,0.0025158918,0.0016908959,0.0015790495,0.0005609053],"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.000074231044,0.000020297373,0.00017828392,0.00002420111,0.000005201345,0.00009753002,0.00015226442,0.0043299575,0.00090137403,0.9894666,0.00052873476,0.004221359],"study_design_scores_gemma":[0.000055930665,0.000045862875,0.00029095655,0.000016395481,0.000005473811,0.00012942519,0.00012891201,0.05110864,0.00056810497,0.94513583,0.002490217,0.000024241213],"about_ca_topic_score_codex":0.0017193141,"about_ca_topic_score_gemma":0.0013731702,"teacher_disagreement_score":0.007553098,"about_ca_system_score_codex":0.0009422739,"about_ca_system_score_gemma":0.00057771255,"threshold_uncertainty_score":0.02526766},"labels":[],"label_agreement":null},{"id":"W2032099069","doi":"10.1016/j.tcs.2007.10.032","title":"Shuffle operations on discrete paths","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematics; Algorithm; Theoretical computer science; Combinatorics","score_opus":0.008344515457987482,"score_gpt":0.26066202948367323,"score_spread":0.25231751402568575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032099069","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.3362443,0.0009355627,0.59585136,0.0016281917,0.00062167214,0.0001472298,0.00075375906,0.0010797074,0.06273816],"genre_scores_gemma":[0.86017126,0.0009360491,0.08243472,0.0003692178,0.00032614102,0.00023561755,0.0005732497,0.0003762803,0.05457733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885476,0.00022869569,0.00009347813,0.00030604994,0.00029994728,0.00021710616],"domain_scores_gemma":[0.9963587,0.0020464188,0.00027777662,0.0005897197,0.0002828563,0.00044448054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094719656,0.00068450073,0.00089283544,0.002039149,0.0019358248,0.0037712927,0.0009888578,0.0012236014,0.01290424],"category_scores_gemma":[0.0040131854,0.0006289698,0.0010820888,0.0022664529,0.0035041245,0.010634686,0.003522212,0.0024122626,0.0019242172],"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.00005244045,0.000022052547,0.000075006516,0.000022157576,0.000003301319,0.000066125824,0.00022668095,0.00063242926,0.0009611356,0.9907295,0.0004995723,0.0067095454],"study_design_scores_gemma":[0.00001442483,0.000023139442,0.0000547086,0.000006972592,0.0000047673084,0.00009649686,0.00006964501,0.002689296,0.001338836,0.99257976,0.0031100041,0.000011847913],"about_ca_topic_score_codex":0.0003147637,"about_ca_topic_score_gemma":0.00031645468,"teacher_disagreement_score":0.01290424,"about_ca_system_score_codex":0.0009877138,"about_ca_system_score_gemma":0.00076147635,"threshold_uncertainty_score":0.043168962},"labels":[],"label_agreement":null},{"id":"W2032125335","doi":"10.1016/j.tcs.2004.05.006","title":"On maximal instances for the original syntenic distance","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"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":"Genome; Synteny; Combinatorics; Chromosome; Genetic distance; Biology; Mathematics; Genetics; Gene","score_opus":0.007896712641639192,"score_gpt":0.24957024624216476,"score_spread":0.24167353360052557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032125335","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.18432455,0.0029152208,0.71353525,0.015542538,0.0005492899,0.00043389262,0.005732563,0.0022018994,0.074764825],"genre_scores_gemma":[0.5522934,0.0029978096,0.39227876,0.0027095235,0.0016781207,0.0009898958,0.012036791,0.0023339475,0.03268177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939614,0.0019430651,0.00034694953,0.0017733093,0.001184121,0.0007912297],"domain_scores_gemma":[0.9745525,0.020408193,0.000732941,0.0024293067,0.0008299169,0.0010470633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005938037,0.002294818,0.0039755045,0.0029799955,0.004290436,0.008559569,0.0081075495,0.0054728887,0.023139756],"category_scores_gemma":[0.034224223,0.0016560418,0.0041755745,0.0068711084,0.004444219,0.021308737,0.0072414693,0.009842358,0.0022059125],"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.0005984522,0.0003057601,0.0010113383,0.00057352823,0.00014162528,0.0002224066,0.0006892135,0.061334874,0.000944622,0.8646168,0.025295626,0.044265743],"study_design_scores_gemma":[0.00012379719,0.000025975618,0.00017771558,0.00005476482,0.000048912912,0.00014483173,0.00011984152,0.087767296,0.00050076935,0.90685976,0.0041529574,0.000023331962],"about_ca_topic_score_codex":0.0036092761,"about_ca_topic_score_gemma":0.004447326,"teacher_disagreement_score":0.023139756,"about_ca_system_score_codex":0.0053573214,"about_ca_system_score_gemma":0.002847699,"threshold_uncertainty_score":0.07741016},"labels":[],"label_agreement":null},{"id":"W2032410720","doi":"10.1016/j.tcs.2010.11.045","title":"On protein structure alignment under distance constraint","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bijection; Mathematics; Combinatorics; Constraint (computer-aided design); Sequence (biology); Enhanced Data Rates for GSM Evolution; Mathematical optimization; Matching (statistics); Algorithm; Computer science; Geometry; Artificial intelligence","score_opus":0.0040224769463836265,"score_gpt":0.22474028448383354,"score_spread":0.2207178075374499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032410720","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.02614021,0.0015738241,0.9623738,0.0015895764,0.0002054076,0.000097396296,0.00024544855,0.000921078,0.006853293],"genre_scores_gemma":[0.27976963,0.0025056268,0.70367146,0.001044952,0.000730329,0.0004388787,0.0022947206,0.0012176528,0.008326771],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750394,0.0011937573,0.00013112639,0.00043966642,0.0005571075,0.00017440629],"domain_scores_gemma":[0.98826104,0.009262463,0.00038030552,0.0013205355,0.0005312945,0.00024429432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035120824,0.001155995,0.002743156,0.0021605573,0.0018309854,0.0024770624,0.0037224195,0.002595744,0.008934324],"category_scores_gemma":[0.019352784,0.0008948799,0.0008320866,0.005821414,0.0023069563,0.007896376,0.0045367065,0.003272205,0.0016329398],"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.00080560596,0.0002482467,0.0009291358,0.0003699045,0.00013360754,0.00020946474,0.0002791134,0.32613146,0.003490833,0.3142305,0.016103294,0.3370688],"study_design_scores_gemma":[0.000063706786,0.000044191864,0.00018765636,0.000029061388,0.00002247526,0.00006839944,0.000048252452,0.66938967,0.0009761366,0.32514933,0.0040071495,0.000013902816],"about_ca_topic_score_codex":0.0037888126,"about_ca_topic_score_gemma":0.003812054,"teacher_disagreement_score":0.008934324,"about_ca_system_score_codex":0.0016499244,"about_ca_system_score_gemma":0.0016832807,"threshold_uncertainty_score":0.029888272},"labels":[],"label_agreement":null},{"id":"W2032897227","doi":"10.1016/j.tcs.2004.03.041","title":"Quantum computing without entanglement","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Quantum entanglement; Quantum; Quantum computer; Computer science; Theoretical computer science; Theoretical physics; Quantum mechanics; Mathematics; Physics","score_opus":0.008001504721208781,"score_gpt":0.25077498416295135,"score_spread":0.24277347944174257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032897227","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.056000553,0.009370404,0.3000175,0.02872077,0.004278045,0.00014493152,0.00042610866,0.00047834587,0.6005633],"genre_scores_gemma":[0.8542204,0.003988585,0.04018168,0.0030731845,0.0025168278,0.00020539633,0.0002229033,0.00029908255,0.09529189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990901,0.0002727847,0.000028155668,0.0001336392,0.00037387793,0.000101513586],"domain_scores_gemma":[0.9986964,0.0005090381,0.000053922293,0.00045874025,0.00018275526,0.00009917969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096902926,0.00049868895,0.0008684766,0.0010625538,0.0021932046,0.003160826,0.0008270965,0.0019732942,0.01118101],"category_scores_gemma":[0.003740895,0.000478557,0.00052065175,0.0009442753,0.006721878,0.007472297,0.0025547033,0.004134243,0.0018696204],"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.0000023587572,0.0000024620024,0.000008255925,0.0000066283264,0.0000012440297,0.000002338699,0.000015866613,0.00013998173,0.00006834238,0.9982316,0.00054989767,0.0009710405],"study_design_scores_gemma":[0.0000021370056,0.000002223966,0.000016409784,0.000005900169,0.0000014835647,0.000009100911,0.00000661169,0.0011242913,0.00013901957,0.99449325,0.004196997,0.0000026313307],"about_ca_topic_score_codex":0.0006446507,"about_ca_topic_score_gemma":0.00042834622,"teacher_disagreement_score":0.01118101,"about_ca_system_score_codex":0.001451856,"about_ca_system_score_gemma":0.0011020635,"threshold_uncertainty_score":0.03740418},"labels":[],"label_agreement":null},{"id":"W2033907672","doi":"10.1016/j.tcs.2015.03.032","title":"Implementation and Application of Automata (CIAA 2013)","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Automaton; Computer science; Mathematics; Programming language; Combinatorics; Theoretical computer science","score_opus":0.012025747789734299,"score_gpt":0.2805018736190902,"score_spread":0.26847612582935587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033907672","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.009082615,0.00020831465,0.94890404,0.0005204505,0.00044463522,0.00017320347,0.00029445573,0.0063328347,0.034039434],"genre_scores_gemma":[0.23088683,0.00028886486,0.7553919,0.0002418351,0.00007532394,0.0005263273,0.0005485473,0.00079940417,0.01124093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784374,0.0007371096,0.00019402361,0.00032417628,0.00065414124,0.0002468867],"domain_scores_gemma":[0.99556136,0.001364205,0.00011301106,0.0016812133,0.00107916,0.00020110772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023914385,0.0005231438,0.0005709654,0.0010418132,0.0015940221,0.003315984,0.0025323553,0.0016263245,0.01549539],"category_scores_gemma":[0.011909095,0.00068249507,0.0014047272,0.0009094896,0.0016883542,0.002198307,0.002988245,0.0021995825,0.0035834815],"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.0001831895,0.0001803587,0.0013117976,0.00032576307,0.00008892347,0.00021164276,0.0007362284,0.049595274,0.006809075,0.7475444,0.014977708,0.17803562],"study_design_scores_gemma":[0.000115678115,0.00011073434,0.00046483538,0.00018771953,0.00012105736,0.0002645094,0.00021274897,0.4717233,0.02335842,0.38276893,0.12058133,0.00009075385],"about_ca_topic_score_codex":0.0095754,"about_ca_topic_score_gemma":0.006911254,"teacher_disagreement_score":0.01549539,"about_ca_system_score_codex":0.0015471124,"about_ca_system_score_gemma":0.0039477237,"threshold_uncertainty_score":0.051837265},"labels":[],"label_agreement":null},{"id":"W2034395812","doi":"10.1016/j.tcs.2015.01.055","title":"Lemmings is PSPACE-complete","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Creatures; Computer science; Mathematical economics; Artificial intelligence; Mathematics; Biology","score_opus":0.05312825676127521,"score_gpt":0.30303378698114386,"score_spread":0.24990553021986867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034395812","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.23915519,0.0018156782,0.2727399,0.011903183,0.00056353747,0.00058357115,0.007434471,0.004152775,0.46165168],"genre_scores_gemma":[0.81743395,0.0009942288,0.06386336,0.0022996806,0.00027717534,0.0003962206,0.00711575,0.00053937203,0.10708024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992637,0.0001465604,0.000042381263,0.00015863604,0.00020524919,0.00018347132],"domain_scores_gemma":[0.997752,0.0014137102,0.00013965745,0.0002224126,0.00026685337,0.00020538164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006212895,0.001211656,0.0012828136,0.00085055927,0.0017061408,0.0026170847,0.0014930606,0.0016570315,0.028306216],"category_scores_gemma":[0.0044137035,0.0005351785,0.0011543456,0.0012000808,0.0012966916,0.003835558,0.00219819,0.003653082,0.003843073],"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.0009992291,0.00043616036,0.001074479,0.0017739517,0.00020399783,0.0007644635,0.0006443948,0.051362813,0.0073951283,0.71454245,0.09621846,0.12458457],"study_design_scores_gemma":[0.00014956652,0.000053181637,0.00032868114,0.000055689197,0.000033720044,0.00025718834,0.00011614929,0.034259994,0.002524944,0.9447926,0.01740512,0.000023081482],"about_ca_topic_score_codex":0.0020912206,"about_ca_topic_score_gemma":0.0033017022,"teacher_disagreement_score":0.028306216,"about_ca_system_score_codex":0.0016469283,"about_ca_system_score_gemma":0.0013928136,"threshold_uncertainty_score":0.09469372},"labels":[],"label_agreement":null},{"id":"W2035362312","doi":"10.1016/s0304-3975(02)00725-9","title":"Algorithms for vertex-partitioning problems on graphs with fixed clique-width","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Chordal graph; Independent set; Time complexity; Maximal independent set; Induced subgraph isomorphism problem; Discrete mathematics; Vertex (graph theory); Treewidth; Indifference graph; Clique-width; Pathwidth; 1-planar graph; Graph; Line graph","score_opus":0.024320585121181022,"score_gpt":0.29363236843299273,"score_spread":0.2693117833118117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035362312","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.07377375,0.0018470389,0.89833,0.0024782722,0.00028333583,0.0009849309,0.0011061205,0.005054749,0.016141811],"genre_scores_gemma":[0.15709563,0.00090850884,0.8297023,0.00048692455,0.00026767945,0.000978273,0.0030405286,0.0011866598,0.006333411],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703264,0.0006969977,0.00017348734,0.0009330667,0.0005675518,0.0005962198],"domain_scores_gemma":[0.9854995,0.00977908,0.0007087439,0.0024676516,0.00084999314,0.00069505343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037760288,0.0035342518,0.0028891058,0.0029268751,0.0030484826,0.0056909504,0.010045751,0.0057325405,0.0149802035],"category_scores_gemma":[0.018041348,0.0026561816,0.0032516583,0.0058746627,0.0022714399,0.015975568,0.006683946,0.006238681,0.0033376857],"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.002549442,0.0015859046,0.002495109,0.0018414429,0.0003668764,0.00016690827,0.0012040408,0.28900063,0.008547848,0.11287009,0.039550997,0.5398207],"study_design_scores_gemma":[0.0009756737,0.00018281316,0.00060830684,0.00012739033,0.00021303957,0.00015452852,0.00042800425,0.70982635,0.004332874,0.27700737,0.0060840775,0.000059546568],"about_ca_topic_score_codex":0.0056152632,"about_ca_topic_score_gemma":0.011082456,"teacher_disagreement_score":0.0149802035,"about_ca_system_score_codex":0.0044946084,"about_ca_system_score_gemma":0.004218818,"threshold_uncertainty_score":0.050113738},"labels":[],"label_agreement":null},{"id":"W2035637517","doi":"10.1016/j.tcs.2007.09.031","title":"On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Split graph; Chordal graph; Mathematics; Combinatorics; Clique problem; Treewidth; Cograph; Independent set; Clique graph; Block graph; Perfect graph; Discrete mathematics; Graph; Pathwidth; 1-planar graph; Line graph; Graph power","score_opus":0.00919946598330105,"score_gpt":0.27909322103857703,"score_spread":0.26989375505527596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035637517","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.43761232,0.004400612,0.43239528,0.015456685,0.0004683647,0.00032034994,0.0021129735,0.0005203362,0.10671306],"genre_scores_gemma":[0.87064147,0.003959969,0.092268415,0.001098891,0.0011340574,0.00034988672,0.0025790015,0.00029087238,0.02767737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877363,0.00041659278,0.000038913924,0.00027549785,0.00030057723,0.00019471237],"domain_scores_gemma":[0.99003816,0.007398937,0.00090288825,0.0005869502,0.00038026666,0.00069288275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014389243,0.0010070038,0.0017164088,0.0016989673,0.002859381,0.0040849843,0.0030158225,0.0033809976,0.010781149],"category_scores_gemma":[0.012573838,0.00087100454,0.0009044687,0.0050082975,0.0031131166,0.00955731,0.0033494318,0.0035446014,0.00092190295],"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.0003642424,0.00019438103,0.001082585,0.00030444044,0.000069333946,0.00016262717,0.0005209263,0.047666803,0.0014691659,0.90235823,0.0154312495,0.030376052],"study_design_scores_gemma":[0.000058214646,0.00002152765,0.00024963764,0.000021687516,0.000015896945,0.00006895138,0.00015007504,0.048707824,0.00025263906,0.94768584,0.0027552398,0.000012387805],"about_ca_topic_score_codex":0.002554165,"about_ca_topic_score_gemma":0.0030142686,"teacher_disagreement_score":0.010781149,"about_ca_system_score_codex":0.001999529,"about_ca_system_score_gemma":0.0012160196,"threshold_uncertainty_score":0.036066532},"labels":[],"label_agreement":null},{"id":"W2036162092","doi":"10.1016/s0304-3975(00)00063-3","title":"Repetitions in Sturmian strings","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Fibonacci number; Sequence (biology); Prefix; Reduction (mathematics); String (physics); Combinatorics; Discrete mathematics; Simple (philosophy); Integer (computer science); Exponent; Algorithm; Computer science","score_opus":0.005278285371736694,"score_gpt":0.2255655579966955,"score_spread":0.2202872726249588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036162092","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.7342352,0.0012399468,0.17716584,0.0015859054,0.00042643806,0.000069056085,0.00033878558,0.00138605,0.08355276],"genre_scores_gemma":[0.96259,0.0002627172,0.020000283,0.00029801234,0.00024958872,0.00008473077,0.00020850815,0.00021156801,0.01609454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981781,0.0006819301,0.00015637846,0.00034032378,0.00042886188,0.00021441774],"domain_scores_gemma":[0.993544,0.004965652,0.00041329733,0.0005475174,0.00030607943,0.0002234199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011655082,0.0004913105,0.0010663794,0.0017366746,0.002009118,0.0024781288,0.0010625903,0.0021787009,0.007624806],"category_scores_gemma":[0.006487372,0.0008263304,0.0011413818,0.0019018096,0.002866544,0.0045633446,0.0017099915,0.0019764728,0.0014783491],"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.00009963823,0.000025517566,0.00035287274,0.0000716323,0.000011013007,0.00043712195,0.0010114304,0.0014549611,0.0029343383,0.98402137,0.00092699385,0.008653039],"study_design_scores_gemma":[0.000022564136,0.000036849262,0.00026902364,0.000018336188,0.00001581343,0.00038513113,0.000091289985,0.0056725047,0.0016401958,0.98984516,0.0019802423,0.000022929788],"about_ca_topic_score_codex":0.00036294488,"about_ca_topic_score_gemma":0.00045121988,"teacher_disagreement_score":0.007624806,"about_ca_system_score_codex":0.0007884638,"about_ca_system_score_gemma":0.00034013184,"threshold_uncertainty_score":0.02550751},"labels":[],"label_agreement":null},{"id":"W2037067117","doi":"10.1016/j.tcs.2014.08.008","title":"The worst case behavior of randomized gossip protocols","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Gossip; Rumor; Computer science; Node (physics); Phone; Gossip protocol; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Randomness; Mathematics; Artificial intelligence; Statistics","score_opus":0.014456712512052642,"score_gpt":0.27928492875888133,"score_spread":0.2648282162468287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037067117","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.6840912,0.0022974138,0.26970145,0.0080663115,0.00025563044,0.00017755346,0.0010242781,0.0019976157,0.032388534],"genre_scores_gemma":[0.98784256,0.00033190896,0.009172427,0.00019952813,0.00008818496,0.000090201254,0.00019466717,0.00021087177,0.0018695277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9892335,0.00542621,0.00043315906,0.0012658274,0.0021275198,0.0015138359],"domain_scores_gemma":[0.84769833,0.12927055,0.0072055683,0.008240545,0.0042075426,0.003377499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014438627,0.0012747585,0.0020253756,0.0021423113,0.002609893,0.004860039,0.003672783,0.003320409,0.0039036218],"category_scores_gemma":[0.0835677,0.0015430019,0.0009661346,0.0017191677,0.0045178984,0.0075187823,0.0028295387,0.0033161272,0.00062610646],"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.0027145233,0.0004341769,0.0043772934,0.00037732013,0.00032121144,0.0007361345,0.0007146369,0.70192534,0.011479983,0.25633436,0.008217532,0.012367435],"study_design_scores_gemma":[0.00010182776,0.00010829022,0.00047214044,0.000028858987,0.000056575624,0.00021277161,0.00019291953,0.90076524,0.0020294604,0.095460445,0.00052675593,0.000044695284],"about_ca_topic_score_codex":0.0018108701,"about_ca_topic_score_gemma":0.0016451456,"teacher_disagreement_score":0.014438627,"about_ca_system_score_codex":0.0031023459,"about_ca_system_score_gemma":0.0028145916,"threshold_uncertainty_score":0.07635969},"labels":[],"label_agreement":null},{"id":"W2037872771","doi":"10.1016/s0304-3975(00)00292-9","title":"Minimal cover-automata for finite languages","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Deterministic automaton; Deterministic finite automaton; Nondeterministic finite automaton; Cover (algebra); Two-way deterministic finite automaton; Büchi automaton; DFA minimization; ω-automaton; Regular language; Quantum finite automata; Finite-state machine; Nested word; Automaton; Mathematics; Discrete mathematics; Computer science; Timed automaton; Automata theory; Theoretical computer science; Algorithm","score_opus":0.010884254074289303,"score_gpt":0.26593739130814764,"score_spread":0.25505313723385836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037872771","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.31252116,0.003507225,0.6133115,0.004274701,0.00031904547,0.00019133446,0.002053621,0.0022200055,0.061601333],"genre_scores_gemma":[0.9179646,0.000933816,0.06260452,0.00045723817,0.0003987619,0.00034079058,0.0023374206,0.00037165667,0.014591294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986602,0.00027696544,0.00009828229,0.0003225842,0.00043577433,0.0002061214],"domain_scores_gemma":[0.9937237,0.0047809985,0.00028129586,0.00048444467,0.00037093784,0.0003586038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009460466,0.0009874104,0.001682845,0.0018621561,0.0028802524,0.0044868444,0.001537513,0.0020423555,0.008827207],"category_scores_gemma":[0.004923667,0.0010994398,0.0020528282,0.0019126311,0.0029392694,0.008575628,0.0027065985,0.0036088615,0.0010827736],"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.0001225765,0.00004471388,0.00038865657,0.000114715825,0.000029158322,0.00016723799,0.0009094427,0.002699685,0.0018590593,0.9827291,0.002038885,0.00889665],"study_design_scores_gemma":[0.0000173487,0.000011201568,0.00010781935,0.000011708016,0.00001675705,0.000072816525,0.000074971795,0.007618218,0.0005443098,0.98976386,0.0017513965,0.000009596938],"about_ca_topic_score_codex":0.0013472211,"about_ca_topic_score_gemma":0.001888459,"teacher_disagreement_score":0.008827207,"about_ca_system_score_codex":0.0021348677,"about_ca_system_score_gemma":0.0009888456,"threshold_uncertainty_score":0.02952993},"labels":[],"label_agreement":null},{"id":"W2038878443","doi":"10.1016/s0304-3975(03)00422-5","title":"Finding hidden independent sets in interval graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"University of Waterloo","keywords":"Interval graph; Interval (graph theory); Set (abstract data type); Computer science; Graph; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Chordal graph","score_opus":0.011004459878765176,"score_gpt":0.2695621984548484,"score_spread":0.2585577385760832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038878443","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.2590762,0.0007572423,0.7333488,0.00059594534,0.00007000132,0.00010531346,0.0006696049,0.00063780975,0.004739158],"genre_scores_gemma":[0.84698004,0.0006520783,0.1466171,0.00015405868,0.00016293145,0.00017945326,0.0017923102,0.00018317495,0.0032788368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862385,0.00038813567,0.00007912898,0.0004037083,0.000319587,0.0001855539],"domain_scores_gemma":[0.9731435,0.022050384,0.0018877267,0.0015709032,0.00069102447,0.00065647444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018166146,0.00097093615,0.0016877748,0.0021595522,0.0010399579,0.0025351718,0.0032840113,0.0015442792,0.0044527655],"category_scores_gemma":[0.01810997,0.001629966,0.0015952999,0.0021029157,0.0016222324,0.005461043,0.0019474493,0.0037965113,0.0005980896],"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.00228093,0.0009916448,0.020511707,0.0011306967,0.0006974765,0.0012558791,0.0018917944,0.30771422,0.010036044,0.42737192,0.00961332,0.21650444],"study_design_scores_gemma":[0.00009492882,0.00007937389,0.0017679607,0.000063599044,0.00011398184,0.00013052428,0.00015363406,0.42724654,0.0018617081,0.56764823,0.00081177027,0.000027761982],"about_ca_topic_score_codex":0.0008287375,"about_ca_topic_score_gemma":0.00092417555,"teacher_disagreement_score":0.0044527655,"about_ca_system_score_codex":0.00079114205,"about_ca_system_score_gemma":0.00057351333,"threshold_uncertainty_score":0.014895976},"labels":[],"label_agreement":null},{"id":"W2039091701","doi":"10.1016/s0304-3975(02)00746-6","title":"A note on differentiable palindromes","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differentiable function; Mathematics; Palindrome; Combinatorics; Discrete mathematics; Pure mathematics; Genetics; Biology; Genome","score_opus":0.008319133653806859,"score_gpt":0.23765318785784942,"score_spread":0.22933405420404257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039091701","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.12925634,0.013741808,0.564107,0.013724499,0.00789945,0.000055748696,0.0004834638,0.00093635335,0.26979536],"genre_scores_gemma":[0.7620702,0.010307642,0.12870929,0.0029228944,0.004325113,0.00008751636,0.00029999108,0.00062530785,0.09065208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996284,0.00009196816,0.000027599657,0.00010622747,0.000101171536,0.000044542678],"domain_scores_gemma":[0.9986274,0.0008474993,0.000061745886,0.00025533861,0.000094898984,0.00011314397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074175897,0.00067185005,0.0009634914,0.0010157853,0.001369259,0.0017555142,0.0012076222,0.0015792045,0.009321741],"category_scores_gemma":[0.0028225537,0.00046054073,0.0009655613,0.00147149,0.0026137838,0.0070781847,0.002464289,0.004643882,0.0012797645],"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.000021525897,0.000010675184,0.00006533546,0.000047723457,0.0000032566043,0.00016392062,0.00011312061,0.00044340888,0.0009638838,0.9842516,0.002214818,0.011700749],"study_design_scores_gemma":[0.000006181303,0.000026771553,0.000091082446,0.000017109609,0.000006318939,0.00022759616,0.0000418711,0.0021457046,0.0006253266,0.9782063,0.018595539,0.0000101459955],"about_ca_topic_score_codex":0.0003356031,"about_ca_topic_score_gemma":0.00046508448,"teacher_disagreement_score":0.009321741,"about_ca_system_score_codex":0.00072727655,"about_ca_system_score_gemma":0.00029181014,"threshold_uncertainty_score":0.031184375},"labels":[],"label_agreement":null},{"id":"W2039194906","doi":"10.1016/j.tcs.2012.12.013","title":"Deterministic quantum non-locality and graph colorings","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Locality; Quantum; Graph; Telepathy; Parallels; Class (philosophy); Computer science; Game theory; Mathematics; Theoretical computer science; Mathematical economics; Discrete mathematics; Combinatorics; Artificial intelligence; Physics; Quantum mechanics; Economics","score_opus":0.010531405984185225,"score_gpt":0.2606419009565169,"score_spread":0.2501104949723317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039194906","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.44976842,0.0013333821,0.50572455,0.007463233,0.0004090249,0.000101187965,0.0005804862,0.0008056287,0.03381409],"genre_scores_gemma":[0.96753603,0.00035311596,0.022289129,0.00061417185,0.000234551,0.00010213602,0.00017836418,0.00014920432,0.008543227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857664,0.00057718507,0.000047829588,0.00032133033,0.00024143426,0.00023554766],"domain_scores_gemma":[0.97883725,0.014100142,0.0014900061,0.0030215543,0.0012617582,0.0012893575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017978281,0.00038584892,0.0012939804,0.0009861088,0.0022072163,0.001982799,0.001909149,0.0017376926,0.005617852],"category_scores_gemma":[0.012037277,0.00088094274,0.00089045404,0.0010885228,0.0042090337,0.0042222566,0.0024820417,0.0032335832,0.00035653682],"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.0000770914,0.000043907257,0.0004858573,0.000062105566,0.0000189429,0.00004885706,0.0001411359,0.014868304,0.0007075401,0.97843987,0.0017866662,0.0033197904],"study_design_scores_gemma":[0.000019840692,0.000008334071,0.00019666241,0.0000046798436,0.0000066624198,0.00003697137,0.000034866993,0.0422756,0.00018758413,0.95665365,0.0005640546,0.000011098205],"about_ca_topic_score_codex":0.0027978215,"about_ca_topic_score_gemma":0.004565028,"teacher_disagreement_score":0.005617852,"about_ca_system_score_codex":0.0022654762,"about_ca_system_score_gemma":0.0013787051,"threshold_uncertainty_score":0.018793583},"labels":[],"label_agreement":null},{"id":"W2039459495","doi":"10.1016/j.tcs.2013.11.010","title":"Approximating the minimum independent dominating set in perturbed graphs","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dominating set; Mathematics; Combinatorics; Set (abstract data type); Maximal independent set; Independent set; Discrete mathematics; Chordal graph; Computer science; Graph; 1-planar graph; Vertex (graph theory)","score_opus":0.015547689309879731,"score_gpt":0.2804480771253872,"score_spread":0.2649003878155075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039459495","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.49306887,0.0014420612,0.4960995,0.0011371217,0.0001488678,0.00015684738,0.000939783,0.00070824975,0.006298733],"genre_scores_gemma":[0.86341316,0.0005674815,0.13189678,0.0001628472,0.00007996376,0.00010804928,0.0010635491,0.00017412005,0.0025340214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987301,0.000442016,0.000046307483,0.00029451717,0.00032680455,0.00016026341],"domain_scores_gemma":[0.99289954,0.0050240275,0.00056619494,0.0006110816,0.00048755514,0.0004115638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537614,0.0016879331,0.002023474,0.0019080045,0.00080872915,0.0021479577,0.0031343962,0.0018215672,0.0016924477],"category_scores_gemma":[0.0126543045,0.0010495036,0.0007934153,0.0019725536,0.001279369,0.0027694758,0.0022628186,0.001852696,0.00041119198],"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.00075356686,0.00013926456,0.0022313835,0.00028603864,0.00009199964,0.0001663244,0.00020501553,0.94299287,0.005548942,0.019726425,0.0025353355,0.025322933],"study_design_scores_gemma":[0.000018190385,0.000046030254,0.0003069929,0.000013550859,0.000016060583,0.000068228284,0.000057149104,0.97032654,0.0011719806,0.02763601,0.0003338261,0.000005390437],"about_ca_topic_score_codex":0.00243039,"about_ca_topic_score_gemma":0.0024067082,"teacher_disagreement_score":0.0031343962,"about_ca_system_score_codex":0.0024405306,"about_ca_system_score_gemma":0.0007587199,"threshold_uncertainty_score":0.017707348},"labels":[],"label_agreement":null},{"id":"W2039936247","doi":"10.1016/j.tcs.2005.07.014","title":"Graph exploration by a finite automaton","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":176,"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 en Outaouais","funders":"","keywords":"Traverse; Combinatorics; Planar graph; Mathematics; Graph; Discrete mathematics; Butterfly graph; Robot; Regular graph; Upper and lower bounds; Voltage graph; Computer science; Line graph; Artificial intelligence","score_opus":0.013465128249734063,"score_gpt":0.2579631548572839,"score_spread":0.24449802660754982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039936247","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.34897596,0.0004381552,0.6217843,0.0014607932,0.00015156137,0.00011267392,0.00035582142,0.0018459483,0.024874857],"genre_scores_gemma":[0.89816654,0.00015197787,0.09494936,0.00011264992,0.000023402912,0.00013730345,0.0001485573,0.00016377248,0.00614637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995484,0.00016416471,0.000025148283,0.00012828395,0.000076105316,0.000057822937],"domain_scores_gemma":[0.9963966,0.0028083592,0.00011028745,0.00037876278,0.00015889073,0.00014704089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004871408,0.00036412582,0.0007016008,0.0007656249,0.0011145873,0.0013885967,0.0011616362,0.0013751666,0.006801763],"category_scores_gemma":[0.0044520022,0.00040949427,0.001352633,0.00075144815,0.0017457281,0.0023047677,0.001599216,0.0012751179,0.00042516337],"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.00048770188,0.00015310028,0.0022150462,0.00026924134,0.00011086787,0.00044066453,0.0006469222,0.31590888,0.010792391,0.61635345,0.0029360119,0.049685758],"study_design_scores_gemma":[0.0000488735,0.000054876375,0.00017495362,0.000020809184,0.000029110424,0.000075259966,0.000058527006,0.65498036,0.001765682,0.34119138,0.0015831789,0.000017000037],"about_ca_topic_score_codex":0.0027396532,"about_ca_topic_score_gemma":0.0032430692,"teacher_disagreement_score":0.006801763,"about_ca_system_score_codex":0.0009321412,"about_ca_system_score_gemma":0.00087705575,"threshold_uncertainty_score":0.022754133},"labels":[],"label_agreement":null},{"id":"W2040122307","doi":"10.1016/j.tcs.2011.05.021","title":"Shortest paths between shortest paths","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"K shortest path routing; Shortest path problem; Shortest Path Faster Algorithm; Combinatorics; Yen's algorithm; Euclidean shortest path; Mathematics; Distance; Sequence (biology); Vertex (graph theory); Control reconfiguration; Floyd–Warshall algorithm; Longest path problem; Discrete mathematics; Graph; Computer science; Dijkstra's algorithm; Biology","score_opus":0.03888412546932748,"score_gpt":0.2914092214865761,"score_spread":0.25252509601724865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040122307","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.17243601,0.0029106068,0.7291766,0.0024524296,0.0008299299,0.0010518045,0.015891908,0.0020100554,0.073240675],"genre_scores_gemma":[0.38622513,0.0036635515,0.5438222,0.00047993485,0.000229311,0.0009422189,0.015252436,0.0005980786,0.04878704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914324,0.00014307382,0.00006354314,0.00029115722,0.0002577904,0.00010125667],"domain_scores_gemma":[0.9976671,0.0012019244,0.00028807504,0.00024584078,0.00039244915,0.00020468413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046993818,0.0010272636,0.0007465656,0.0031408824,0.0013737346,0.0017937064,0.0012518764,0.0012425794,0.019688062],"category_scores_gemma":[0.0052101016,0.00067971204,0.0008577683,0.0039188587,0.000705689,0.0038632976,0.0021021273,0.0016719254,0.0030567325],"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.00079927675,0.0002992497,0.0028209502,0.0025839037,0.00036807722,0.0008509616,0.001079338,0.06016086,0.018665694,0.5042873,0.039238047,0.3688464],"study_design_scores_gemma":[0.00014641756,0.00024371612,0.0016669402,0.00027962998,0.0001592707,0.0006763691,0.0006537906,0.059023883,0.0075455755,0.80444366,0.12510167,0.000059109607],"about_ca_topic_score_codex":0.001375475,"about_ca_topic_score_gemma":0.002414416,"teacher_disagreement_score":0.019688062,"about_ca_system_score_codex":0.00093006704,"about_ca_system_score_gemma":0.0013009277,"threshold_uncertainty_score":0.06586313},"labels":[],"label_agreement":null},{"id":"W2040262311","doi":"10.1016/j.tcs.2012.01.013","title":"A Gray code for fixed-density necklaces and Lyndon words in constant amortized time","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Guelph","funders":"","keywords":"De Bruijn sequence; Gray code; Amortized analysis; Mathematics; Combinatorics; Constant (computer programming); Binary number; Code (set theory); Polyomino; Discrete mathematics; Algorithm; Data structure; Arithmetic; Computer science; Set (abstract data type); Geometry","score_opus":0.00957280733346831,"score_gpt":0.25514893121650056,"score_spread":0.24557612388303227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040262311","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.26961958,0.0022360971,0.6869753,0.0034137813,0.00061678357,0.00047174806,0.0016943563,0.0048674825,0.030104904],"genre_scores_gemma":[0.64100844,0.0010197313,0.32801753,0.0013054421,0.00034704787,0.00096650043,0.0015305921,0.0012384054,0.024566337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980763,0.00034132687,0.00014918167,0.00039430446,0.0006632746,0.0003755595],"domain_scores_gemma":[0.9926801,0.0038627228,0.0004189968,0.0018131906,0.0007204829,0.0005045713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015792842,0.0012639656,0.0018271018,0.0023500368,0.0017993598,0.0037879923,0.0025291701,0.0025787177,0.010503969],"category_scores_gemma":[0.013975042,0.0008028395,0.0011610477,0.0038997133,0.0032115013,0.006659115,0.0050087916,0.0030557865,0.0021713534],"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.0013861478,0.00028086524,0.0011533658,0.00038201385,0.00009508632,0.00029650572,0.000640147,0.07618368,0.011408069,0.71921706,0.026426852,0.16253026],"study_design_scores_gemma":[0.00016975026,0.000145091,0.00025365013,0.000110009394,0.00006481023,0.00018333073,0.00011010155,0.20014969,0.0051469016,0.78680944,0.0067811944,0.000075967495],"about_ca_topic_score_codex":0.0039872588,"about_ca_topic_score_gemma":0.004253664,"teacher_disagreement_score":0.010503969,"about_ca_system_score_codex":0.0040382156,"about_ca_system_score_gemma":0.0036097686,"threshold_uncertainty_score":0.035139322},"labels":[],"label_agreement":null},{"id":"W2040979981","doi":"10.1016/j.tcs.2009.02.033","title":"On two open problems of 2-interval patterns","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Mathematics; Interval (graph theory); Combinatorics; Time complexity; Cardinality (data modeling); Pattern matching; Discrete mathematics; Matching (statistics); Clique; Algorithm; Computer science; Artificial intelligence","score_opus":0.016823842560171616,"score_gpt":0.2936831268212049,"score_spread":0.2768592842610333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040979981","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.14322363,0.005999573,0.7680212,0.021620257,0.0017413258,0.00016404243,0.0008918564,0.00044528802,0.05789287],"genre_scores_gemma":[0.6657277,0.00517287,0.27922058,0.003469632,0.0053626536,0.0004022723,0.002036162,0.00045237536,0.038155816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693835,0.00083424937,0.00024817657,0.00080514495,0.0008117833,0.00036233113],"domain_scores_gemma":[0.9773505,0.017933784,0.0010016153,0.0019666997,0.0011397123,0.00060774194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025141179,0.0007420672,0.0015929214,0.0016792495,0.002021271,0.0040715355,0.0028246588,0.0043255957,0.015706208],"category_scores_gemma":[0.02770561,0.000758038,0.0014980086,0.004281112,0.0043875636,0.013781697,0.004359626,0.0058432645,0.0013410873],"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.00032487317,0.00015700403,0.0009792363,0.00028873578,0.000033819353,0.00034504707,0.0006871327,0.008231936,0.00079294853,0.8893915,0.013187614,0.08558011],"study_design_scores_gemma":[0.00004706156,0.000032917993,0.00026047617,0.00003601971,0.000012019774,0.00028376176,0.000227093,0.020323781,0.00043165797,0.9732728,0.0050520026,0.000020356145],"about_ca_topic_score_codex":0.0007620901,"about_ca_topic_score_gemma":0.00047794817,"teacher_disagreement_score":0.015706208,"about_ca_system_score_codex":0.0011330632,"about_ca_system_score_gemma":0.00070832035,"threshold_uncertainty_score":0.052542508},"labels":[],"label_agreement":null},{"id":"W2041043686","doi":"10.1016/j.tcs.2014.09.016","title":"Public-key cryptography based on bounded quantum reference frames","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Canada Foundation for Innovation; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"Public-key cryptography; Quantum cryptography; Computer science; Cryptographic protocol; Cryptography; Digital signature; Bounded function; Authentication (law); Theoretical computer science; Key (lock); Protocol (science); Computer security; Mathematics; Quantum; Quantum information; Encryption; Hash function; Physics; Quantum mechanics","score_opus":0.020345907675312143,"score_gpt":0.24027860100324214,"score_spread":0.21993269332793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041043686","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.061140317,0.0024106805,0.8774677,0.0035009962,0.00068018155,0.00013360145,0.00032716428,0.0006131149,0.05372624],"genre_scores_gemma":[0.88442534,0.001839608,0.10151364,0.0005828076,0.00070776686,0.00025967322,0.0003335695,0.0001670153,0.010170526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956031,0.0016692231,0.00019551716,0.0005615099,0.0013921713,0.0005785631],"domain_scores_gemma":[0.9930842,0.0031994288,0.00048430098,0.001986812,0.0009191027,0.00032616296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003917409,0.0010507366,0.0020969831,0.0023474724,0.0027392127,0.0045469985,0.0023122446,0.0023842892,0.0056773676],"category_scores_gemma":[0.010669455,0.00065720757,0.00095114356,0.0025660244,0.0048771044,0.00992044,0.004637924,0.0042831637,0.0014494384],"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.000042324933,0.000007578664,0.000017713843,0.000016043265,0.0000034123607,0.000014169087,0.00003702428,0.0022410909,0.000455101,0.99414355,0.0004802128,0.0025417942],"study_design_scores_gemma":[0.0000256501,0.000026796914,0.000029378298,0.000019799283,0.00000818169,0.000023827532,0.000017775252,0.031788547,0.0011534737,0.9645268,0.002355791,0.000023966575],"about_ca_topic_score_codex":0.0012929547,"about_ca_topic_score_gemma":0.0009050838,"teacher_disagreement_score":0.0056773676,"about_ca_system_score_codex":0.0033025932,"about_ca_system_score_gemma":0.0019666306,"threshold_uncertainty_score":0.02396208},"labels":[],"label_agreement":null},{"id":"W2041156108","doi":"10.1016/s0304-3975(03)00086-0","title":"Palindrome recognition using a multidimensional tape","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Turing machine; Computer science; Mathematics; Turing; Algorithm; Theoretical computer science; Arithmetic; Combinatorics; Algebra over a field; Pure mathematics; Programming language","score_opus":0.025244452198185517,"score_gpt":0.2659925015108236,"score_spread":0.24074804931263807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041156108","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.20590004,0.0014672846,0.76552683,0.000519009,0.0007777381,0.0001505454,0.0009056912,0.0046010143,0.020151779],"genre_scores_gemma":[0.59712505,0.000766573,0.38947126,0.00018488942,0.000251504,0.0001797593,0.0012556924,0.00030813858,0.010457117],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996043,0.00006282973,0.000056585402,0.000109157685,0.00010602946,0.00006110468],"domain_scores_gemma":[0.9981256,0.00048260464,0.0001274656,0.000933557,0.0002291079,0.00010159245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024864747,0.0004871661,0.00065831054,0.001054147,0.00094917277,0.0012947472,0.00095164933,0.00064936484,0.005260064],"category_scores_gemma":[0.0018067248,0.00031283795,0.00055386004,0.0013947502,0.00055254105,0.0020084516,0.0014670724,0.00094711134,0.0020603382],"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.0021114398,0.00019703039,0.0016915555,0.00061363954,0.00008101692,0.0017274882,0.00059160317,0.0124845505,0.292314,0.10174373,0.0102463635,0.57619756],"study_design_scores_gemma":[0.00019346597,0.0013292392,0.0018395582,0.00020343412,0.00015493773,0.0034546677,0.000708572,0.2198821,0.6082745,0.10795804,0.055793826,0.00020760004],"about_ca_topic_score_codex":0.00037594576,"about_ca_topic_score_gemma":0.0005661484,"teacher_disagreement_score":0.005260064,"about_ca_system_score_codex":0.00033746107,"about_ca_system_score_gemma":0.00040961607,"threshold_uncertainty_score":0.017596602},"labels":[],"label_agreement":null},{"id":"W2041241584","doi":"10.1016/j.tcs.2014.07.013","title":"Exploring an unknown dangerous graph with a constant number of tokens","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"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; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Asynchronous communication; Security token; Computer science; Constant (computer programming); Graph; Node (physics); Protocol (science); Theoretical computer science; Simple (philosophy); Computer network","score_opus":0.040970488097334945,"score_gpt":0.2704389198655607,"score_spread":0.22946843176822573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041241584","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.53136665,0.00022630843,0.4490897,0.0024673988,0.00016657267,0.00015988675,0.00066791684,0.0011404452,0.014715095],"genre_scores_gemma":[0.7503092,0.0001261324,0.2419592,0.0002231008,0.000041064563,0.00008052305,0.0004864811,0.00033850444,0.0064358274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952567,0.00013223111,0.000016262617,0.00013991477,0.00009501171,0.00009100835],"domain_scores_gemma":[0.9970644,0.0021180734,0.00015489233,0.00026782812,0.00014421095,0.0002506777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062293396,0.0007101849,0.00079811213,0.00095050404,0.0013705291,0.0010029494,0.0023093962,0.0023085834,0.006167311],"category_scores_gemma":[0.0063657328,0.0006745122,0.0011440864,0.0006932271,0.0017153028,0.003765362,0.0021728592,0.0020351384,0.0006202405],"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.0013086604,0.00034165985,0.004431866,0.000433823,0.00012211301,0.0019492912,0.00045728864,0.8182605,0.009764086,0.11948626,0.0050317366,0.03841266],"study_design_scores_gemma":[0.00006156717,0.00007444599,0.00021195861,0.000018542618,0.000032872013,0.00017057703,0.00013833208,0.9030943,0.0022290454,0.09256366,0.0013897093,0.0000149487],"about_ca_topic_score_codex":0.0037321192,"about_ca_topic_score_gemma":0.0056064064,"teacher_disagreement_score":0.006167311,"about_ca_system_score_codex":0.0009353582,"about_ca_system_score_gemma":0.0012723331,"threshold_uncertainty_score":0.02063173},"labels":[],"label_agreement":null},{"id":"W2041342760","doi":"10.1016/j.tcs.2006.11.019","title":"RealLife: The continuum limit of Larger than Life cellular automata","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Cellular automaton; Limit (mathematics); Conjecture; Infinity; Euclidean geometry; Pure mathematics; Combinatorics; Mathematical analysis; Geometry; Algorithm","score_opus":0.006382036356419492,"score_gpt":0.21267497150496656,"score_spread":0.20629293514854707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041342760","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.38023955,0.012419584,0.38557667,0.012781146,0.0014214938,0.00008188753,0.00062388246,0.0021703397,0.20468555],"genre_scores_gemma":[0.9516916,0.0017403531,0.027772808,0.001123028,0.0005381615,0.000090607304,0.00021592675,0.00024974663,0.016577687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995425,0.00012085492,0.000019214964,0.000108865366,0.0001532714,0.00005537116],"domain_scores_gemma":[0.9978345,0.00089016865,0.00020054454,0.00030893678,0.0002931249,0.0004726967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063949305,0.00032316401,0.0006552331,0.0011654943,0.0012012973,0.0043058596,0.0010769361,0.0013202261,0.008372627],"category_scores_gemma":[0.0057093897,0.00034955156,0.00042522216,0.0006451956,0.0032078854,0.0058359094,0.0018902034,0.0019959745,0.00087301864],"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.000018613371,0.000013061443,0.00016369391,0.00003089912,0.0000035250446,0.00008184426,0.00019259861,0.001714907,0.0007574499,0.9921308,0.0016721159,0.003220536],"study_design_scores_gemma":[0.000008609124,0.000010662711,0.00015232978,0.000016243443,0.0000037416326,0.00020422896,0.00011082799,0.023904365,0.00042009976,0.96858037,0.006576827,0.000011708655],"about_ca_topic_score_codex":0.0009842166,"about_ca_topic_score_gemma":0.0008200689,"teacher_disagreement_score":0.008372627,"about_ca_system_score_codex":0.0010212376,"about_ca_system_score_gemma":0.00059265684,"threshold_uncertainty_score":0.028009236},"labels":[],"label_agreement":null},{"id":"W2041784286","doi":"10.1016/j.tcs.2014.10.027","title":"Algorithmic correspondence for intuitionistic modal mu-calculus","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Research Foundation","keywords":"Soundness; Mathematics; Focus (optics); Modal; Calculus (dental); Algebraic number; Intuitionistic logic; Interpretation (philosophy); Algebra over a field; Discrete mathematics; Modal logic; Pure mathematics; Computer science; Propositional calculus; Programming language","score_opus":0.008760041303592257,"score_gpt":0.24834116186091518,"score_spread":0.23958112055732292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041784286","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.0705866,0.0009783464,0.81781155,0.0034338103,0.00034449357,0.0001434447,0.00048819755,0.0011419848,0.10507153],"genre_scores_gemma":[0.7575612,0.0006721916,0.2163255,0.00091559667,0.00044774884,0.00035020182,0.0008221016,0.00030803893,0.022597436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974482,0.00078298803,0.00018317135,0.00054552715,0.00071080023,0.00032941456],"domain_scores_gemma":[0.99744105,0.001471057,0.000120047975,0.00045378253,0.0003417941,0.00017219808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021200539,0.00068338873,0.0012743851,0.0021730214,0.0038818794,0.0057782736,0.0031574457,0.0022316903,0.015623102],"category_scores_gemma":[0.0059442464,0.0008209876,0.0025278039,0.0022400965,0.003440693,0.010974556,0.005103754,0.004619551,0.0015154147],"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.000012035192,0.000015495478,0.000066366316,0.000017653123,0.0000048431957,0.000016897679,0.000094006835,0.00040675042,0.00009986174,0.9965084,0.00045534252,0.002302342],"study_design_scores_gemma":[0.000006289775,0.00000431518,0.000043982815,0.0000052113587,0.0000051478996,0.000017408376,0.000030585277,0.0037689845,0.0001075352,0.99476963,0.0012356733,0.0000052282744],"about_ca_topic_score_codex":0.0016585207,"about_ca_topic_score_gemma":0.0017699508,"teacher_disagreement_score":0.015623102,"about_ca_system_score_codex":0.0027169178,"about_ca_system_score_gemma":0.0017325445,"threshold_uncertainty_score":0.052264452},"labels":[],"label_agreement":null},{"id":"W2041801901","doi":"10.1016/j.tcs.2007.11.020","title":"Another proof of Soittola’s theorem","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Mathematical proof; Formal power series; Analytic proof; Power series; Discrete mathematics; Algebraic number; Formal proof; Series (stratigraphy); Algebra over a field; Pure mathematics; Calculus (dental); Mathematical analysis","score_opus":0.008936159004620844,"score_gpt":0.24335869651830644,"score_spread":0.23442253751368558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041801901","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.029825792,0.004021012,0.4412382,0.046824884,0.009349313,0.00018444733,0.00089127646,0.0019957488,0.46566936],"genre_scores_gemma":[0.63399786,0.0045507574,0.18462962,0.015126878,0.0033855368,0.0005507188,0.00096787454,0.00095494866,0.1558358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908745,0.0001920998,0.000048072427,0.00022603114,0.00028252465,0.00016379522],"domain_scores_gemma":[0.9977848,0.0010045781,0.000096310985,0.00031341176,0.0006109217,0.00018995014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015793098,0.0011493592,0.00089705986,0.0022709903,0.0032004516,0.0023119664,0.0017851016,0.0017872151,0.025070237],"category_scores_gemma":[0.0051738042,0.00049534277,0.002031602,0.0018436699,0.003335434,0.006518271,0.0040474585,0.004032539,0.0034167059],"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.000060522947,0.00003579262,0.00018731112,0.00014481932,0.000027476883,0.00018975638,0.00047721356,0.00032878123,0.0013540199,0.9643332,0.018812796,0.014048289],"study_design_scores_gemma":[0.000059762584,0.000035037752,0.0004343985,0.00005573238,0.000043229305,0.0003697586,0.00015348573,0.0025252865,0.0023759063,0.88204706,0.11186482,0.000035503715],"about_ca_topic_score_codex":0.001567441,"about_ca_topic_score_gemma":0.0012051522,"teacher_disagreement_score":0.025070237,"about_ca_system_score_codex":0.001358447,"about_ca_system_score_gemma":0.00094634865,"threshold_uncertainty_score":0.083868325},"labels":[],"label_agreement":null},{"id":"W2042079117","doi":"10.1016/s0304-3975(02)00853-8","title":"A recognition and parsing algorithm for arbitrary conjunctive grammars","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"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":"L-attributed grammar; Parsing expression grammar; Indexed grammar; Context-free grammar; Parsing; Computer science; Phrase structure grammar; Context-sensitive grammar; Time complexity; Algorithm; Tree-adjoining grammar; Rule-based machine translation; Definite clause grammar; Mathematics; Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.017969218265562234,"score_gpt":0.24748096050476134,"score_spread":0.22951174223919912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042079117","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.0072610253,0.00011628303,0.9744124,0.00021558737,0.0000624039,0.00010707664,0.00030948775,0.0152149955,0.0023007558],"genre_scores_gemma":[0.058798004,0.000106247644,0.9343457,0.00017139596,0.0000356609,0.00014185475,0.0015006292,0.0015540833,0.0033464173],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882275,0.00017452883,0.00012165868,0.000467248,0.00027774854,0.00013594833],"domain_scores_gemma":[0.99803776,0.0011020069,0.000058432604,0.00039315154,0.00033771776,0.000070920505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011787197,0.0012446968,0.0015148303,0.0013101596,0.0015214158,0.0031416693,0.0027457622,0.0023020948,0.011853254],"category_scores_gemma":[0.003782851,0.0015270101,0.0020479837,0.002106949,0.0012648074,0.0051368885,0.002854632,0.0027542962,0.0050961687],"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.00034517134,0.00025756878,0.00083252403,0.00030516717,0.00009835047,0.00043241083,0.00052501477,0.021672767,0.023819664,0.07948453,0.026918173,0.84530884],"study_design_scores_gemma":[0.00019274438,0.0001115203,0.00072245963,0.000084874,0.00019161942,0.000806444,0.00026986908,0.68389994,0.05866334,0.22176199,0.033150915,0.00014433161],"about_ca_topic_score_codex":0.0038213786,"about_ca_topic_score_gemma":0.0049610753,"teacher_disagreement_score":0.011853254,"about_ca_system_score_codex":0.0011534886,"about_ca_system_score_gemma":0.002048393,"threshold_uncertainty_score":0.039653063},"labels":[],"label_agreement":null},{"id":"W2043112783","doi":"10.1016/j.tcs.2008.09.061","title":"Fault-tolerant computation of distributed regular path queries","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computation; Computer science; Path (computing); Fault tolerance; Theoretical computer science; Parallel computing; Distributed computing; Algorithm; Mathematics; Programming language","score_opus":0.0103279312169427,"score_gpt":0.2333992794955134,"score_spread":0.2230713482785707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043112783","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51974964,0.00065649603,0.46763128,0.0011313136,0.00020963133,0.0001855232,0.0003125482,0.0035152105,0.006608347],"genre_scores_gemma":[0.9441508,0.00012173193,0.052656878,0.00011143586,0.000059517875,0.0000625806,0.00030656892,0.00016850836,0.0023619302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794155,0.0004338739,0.0001474769,0.00036736726,0.000742005,0.0003676487],"domain_scores_gemma":[0.99313027,0.0038816498,0.00046041363,0.0015734886,0.00062835036,0.00032591503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020572913,0.0005132895,0.001353468,0.00094231777,0.0011639766,0.0026782013,0.001960159,0.0012239733,0.00258833],"category_scores_gemma":[0.012342341,0.00046267104,0.0004961575,0.0015463849,0.0015471285,0.0040851026,0.0020897216,0.0011470573,0.00039447818],"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.006619253,0.0006320281,0.007859999,0.00065734,0.00027560437,0.0012236652,0.002097706,0.45002297,0.044114403,0.24616446,0.012583129,0.2277493],"study_design_scores_gemma":[0.00024619576,0.00021445354,0.0004469928,0.000018236982,0.00007222999,0.00019464566,0.00019668443,0.8267891,0.014977419,0.1545201,0.0022958925,0.000028026288],"about_ca_topic_score_codex":0.0017627445,"about_ca_topic_score_gemma":0.0020015095,"teacher_disagreement_score":0.0026782013,"about_ca_system_score_codex":0.0012420535,"about_ca_system_score_gemma":0.0012463115,"threshold_uncertainty_score":0.010880113},"labels":[],"label_agreement":null},{"id":"W2043253127","doi":"10.1016/j.tcs.2011.08.040","title":"The minimum positional error incurred by any connectivity-based positioning algorithm for mobile wireless systems","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Node (physics); Wireless sensor network; Algorithm; Wireless network; Wireless; Computer network; Geographic routing; Routing (electronic design automation); Real-time computing; Distributed computing; Routing protocol; Engineering","score_opus":0.008877635359583953,"score_gpt":0.22069445401295212,"score_spread":0.21181681865336818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043253127","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.06532588,0.0009966441,0.92875993,0.0006932516,0.0003425723,0.00004088763,0.00020528078,0.00038699468,0.0032485295],"genre_scores_gemma":[0.80256027,0.00091348734,0.18983772,0.000114059934,0.00021472605,0.000103414626,0.00033829958,0.00024149276,0.0056766174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782,0.0005287177,0.00014608775,0.0003022837,0.000983407,0.00021954309],"domain_scores_gemma":[0.9951344,0.0028853605,0.00032862942,0.0005167237,0.0010121765,0.00012276342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012550122,0.0011572664,0.0009166228,0.00072010333,0.00084002677,0.0012619218,0.0011234034,0.0014257792,0.0020411888],"category_scores_gemma":[0.015508168,0.00036284197,0.00035648077,0.0014266233,0.00081748434,0.0019347601,0.0015446013,0.00109921,0.0005908301],"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.0007395596,0.000060356004,0.0025955539,0.00039662558,0.00009521156,0.00025612663,0.00015956862,0.79875803,0.022909014,0.026373435,0.0022682662,0.14538826],"study_design_scores_gemma":[0.0000361526,0.00038517234,0.0027130113,0.00005707936,0.00006308487,0.0005462429,0.00010573478,0.9581594,0.020159299,0.015016396,0.0027199776,0.000038441183],"about_ca_topic_score_codex":0.0025535054,"about_ca_topic_score_gemma":0.0021543067,"teacher_disagreement_score":0.0025535054,"about_ca_system_score_codex":0.0009200651,"about_ca_system_score_gemma":0.0011883617,"threshold_uncertainty_score":0.006828487},"labels":[],"label_agreement":null},{"id":"W2043304636","doi":"10.1016/j.tcs.2007.04.004","title":"On a zeta function associated with automata and codes","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Simplicity; Automaton; Function (biology); Riemann zeta function; Zero (linguistics); Discrete mathematics; Word (group theory); Combinatorics; Cellular automaton; Pure mathematics; Algorithm; Computer science; Physics; Theoretical computer science; Geometry; Quantum mechanics","score_opus":0.006311545731731295,"score_gpt":0.2193332548910603,"score_spread":0.213021709159329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043304636","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.6481373,0.0015153248,0.25940606,0.005094147,0.001233778,0.00007762832,0.00032013305,0.00047292744,0.08374276],"genre_scores_gemma":[0.96007144,0.0008453467,0.011293346,0.00042479593,0.00095334835,0.00010078218,0.00018584915,0.00022252143,0.025902515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991147,0.00023897055,0.000045342,0.00016174924,0.00021744554,0.00022174443],"domain_scores_gemma":[0.9953198,0.0027242685,0.00037066688,0.00027466405,0.00045581156,0.00085475435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001541634,0.0013974328,0.001475296,0.0048133396,0.00332819,0.0050869635,0.001388801,0.0019998462,0.007580067],"category_scores_gemma":[0.0072679846,0.00058022304,0.0011627937,0.0029514437,0.005229422,0.0076293685,0.00459428,0.003452513,0.0013857195],"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.000038252805,0.000013160342,0.00015704168,0.000016961698,0.0000046066257,0.000067709436,0.00019090722,0.00050903735,0.00040393634,0.9957534,0.00048442621,0.0023606098],"study_design_scores_gemma":[0.000013647445,0.0000113927035,0.00008883412,0.0000123585505,0.000006405469,0.000084065956,0.00006700891,0.003668896,0.00020521843,0.99492645,0.00090285135,0.000012817886],"about_ca_topic_score_codex":0.0008512509,"about_ca_topic_score_gemma":0.0005220576,"teacher_disagreement_score":0.007580067,"about_ca_system_score_codex":0.002009031,"about_ca_system_score_gemma":0.0008362545,"threshold_uncertainty_score":0.025357842},"labels":[],"label_agreement":null},{"id":"W2043865630","doi":"10.1016/j.tcs.2011.09.021","title":"Canonical forms of uptimals","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Order (exchange); Mathematics; Game theory; Canonical form; Publication; Computer science; Mathematical economics; Algebra over a field; Pure mathematics","score_opus":0.039435229842599326,"score_gpt":0.2883830887407444,"score_spread":0.24894785889814508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043865630","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.14081931,0.0006767826,0.2180917,0.0030942005,0.0015729418,0.00019354156,0.00082169945,0.00087913946,0.63385063],"genre_scores_gemma":[0.7935754,0.00068369927,0.033234615,0.0009855143,0.0006845383,0.00033917025,0.0008628126,0.00077237503,0.1688619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797446,0.00046128436,0.00014518916,0.0003932301,0.00049305434,0.0005328794],"domain_scores_gemma":[0.99876547,0.00031494617,0.00011073833,0.0001919403,0.00038506862,0.00023190584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00118286,0.0010401708,0.0010150423,0.0028150934,0.0032062314,0.0069883447,0.0015199186,0.0016489727,0.035091743],"category_scores_gemma":[0.0031425117,0.0008138252,0.0011649772,0.0020762468,0.003601816,0.008547417,0.004076357,0.0036810162,0.0062332875],"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.000011766662,0.000008517253,0.000028116681,0.000007690002,0.0000023513828,0.000030584266,0.00009668516,0.000041632262,0.00010028492,0.99643916,0.0009840805,0.0022491415],"study_design_scores_gemma":[0.0000122083,0.0000071340482,0.000051385825,0.000008399874,0.000005668838,0.00010441013,0.00012172534,0.00060634874,0.00028619717,0.9911267,0.0076601333,0.000009710228],"about_ca_topic_score_codex":0.0005208282,"about_ca_topic_score_gemma":0.0006884312,"teacher_disagreement_score":0.035091743,"about_ca_system_score_codex":0.0011839494,"about_ca_system_score_gemma":0.00073799555,"threshold_uncertainty_score":0.11739355},"labels":[],"label_agreement":null},{"id":"W2044141959","doi":"10.1016/s0304-3975(02)00138-x","title":"Two-way finite automata with quantum and classical states","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":183,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum finite automata; Deterministic finite automaton; Deterministic automaton; Probabilistic automaton; Nondeterministic finite automaton; ω-automaton; Finite-state machine; Discrete mathematics; Nested word; Quantum; Computer science; Mathematics; Automaton; Automata theory; Theoretical computer science; Algorithm; Quantum mechanics; Physics","score_opus":0.008223849374187228,"score_gpt":0.22078804490979856,"score_spread":0.21256419553561134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044141959","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.13518216,0.00056336005,0.82678723,0.0019728036,0.0005094941,0.00019708432,0.0004588618,0.0016913723,0.032637652],"genre_scores_gemma":[0.82933635,0.00032082695,0.15309788,0.0004051941,0.00015387501,0.00049821334,0.00035430916,0.0002106709,0.015622696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593556,0.0013553422,0.00039617877,0.00082541537,0.00086207176,0.0006254784],"domain_scores_gemma":[0.9897714,0.0056850957,0.00048282335,0.0023278354,0.0010591969,0.00067356066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022641714,0.0010739374,0.0013757672,0.0011306637,0.0030774202,0.0073074456,0.003018552,0.0040448857,0.0053311405],"category_scores_gemma":[0.01140494,0.0008763711,0.0022351034,0.0013173982,0.0063083027,0.012158574,0.0054408,0.0032991657,0.0013720373],"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.00014313943,0.000066382876,0.000359309,0.00005383139,0.000019325758,0.00015394115,0.00050087925,0.008885993,0.0013562986,0.9815762,0.0006519512,0.0062327734],"study_design_scores_gemma":[0.0000684278,0.00003866278,0.000093216266,0.000028754597,0.000040493676,0.000107884116,0.00013209277,0.0735791,0.0030207012,0.91908437,0.0037429,0.00006331803],"about_ca_topic_score_codex":0.002398403,"about_ca_topic_score_gemma":0.0026816397,"teacher_disagreement_score":0.0073074456,"about_ca_system_score_codex":0.0020168312,"about_ca_system_score_gemma":0.0025976533,"threshold_uncertainty_score":0.017834425},"labels":[],"label_agreement":null},{"id":"W2044712489","doi":"10.1016/s0304-3975(01)00303-6","title":"Searching games with errors—fifty years of coping with liars","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":211,"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 en Outaouais","funders":"","keywords":"Computer science; Interactivity; Theoretical computer science; Computation; Algorithm; Multimedia","score_opus":0.016146130903592883,"score_gpt":0.24518310904156276,"score_spread":0.2290369781379699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044712489","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.34587938,0.11030291,0.23233195,0.15357903,0.0023934303,0.00017790619,0.00015723555,0.00050190865,0.15467629],"genre_scores_gemma":[0.91609615,0.024841834,0.03500925,0.0051967856,0.0012784755,0.00017178225,0.00009622345,0.00013308185,0.017176343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997265,0.0015944577,0.00012226659,0.00025659346,0.00040482162,0.0003569208],"domain_scores_gemma":[0.98497635,0.010441615,0.001079693,0.001185783,0.0011497218,0.0011668354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057937307,0.00073892623,0.00087434775,0.0010660655,0.0017764898,0.0046480717,0.0023917241,0.0035853584,0.003234327],"category_scores_gemma":[0.027244246,0.00043012513,0.00061146816,0.0009897499,0.008140598,0.009659651,0.0033094378,0.0033900284,0.0004574127],"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.00036974854,0.0004352718,0.007635623,0.0004996833,0.00020815045,0.00034861197,0.010615131,0.032416448,0.0006416409,0.70943344,0.022066541,0.21532969],"study_design_scores_gemma":[0.0000884793,0.0002080276,0.0021616903,0.00067342864,0.00006077614,0.00025417464,0.0076408507,0.052968156,0.0005727761,0.82894677,0.10632898,0.000095897754],"about_ca_topic_score_codex":0.002717821,"about_ca_topic_score_gemma":0.0038020771,"teacher_disagreement_score":0.0057937307,"about_ca_system_score_codex":0.0019618967,"about_ca_system_score_gemma":0.0016038181,"threshold_uncertainty_score":0.030640543},"labels":[],"label_agreement":null},{"id":"W2045152465","doi":"10.1016/j.tcs.2014.09.014","title":"Secure identification and QKD in the bounded-quantum-storage model","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Strategic Research Council; Natural Sciences and Engineering Research Council of Canada; Sino-Danish Center; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Natural Science Foundation of China; National Research Foundation; Fonds Québécois de la Recherche sur la Nature et les Technologies; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Bounded function; Identification (biology); Quantum cryptography; Quantum; Theoretical computer science; Computer science; Mathematics; Computer security; Discrete mathematics; Physics; Quantum mechanics; Quantum information; Biology","score_opus":0.006581475583667152,"score_gpt":0.23141508678499878,"score_spread":0.22483361120133163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045152465","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.21530877,0.0033543792,0.65734434,0.022352016,0.0007124793,0.00015883226,0.0012187271,0.0004979389,0.09905245],"genre_scores_gemma":[0.96276456,0.00088624045,0.02241859,0.0007465299,0.00029590845,0.000105526626,0.00016364276,0.0000708175,0.01254816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966438,0.0013616444,0.00014347656,0.00043190076,0.0008064414,0.00061269937],"domain_scores_gemma":[0.99349,0.0039980407,0.00043483518,0.0013855104,0.00041603186,0.00027550157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030970161,0.0008009777,0.0022588477,0.0010433765,0.0028871873,0.005187298,0.002894472,0.005214446,0.0063310177],"category_scores_gemma":[0.009653891,0.00071261777,0.0014329316,0.0014795519,0.007789888,0.016259337,0.005941444,0.0056487476,0.0011167168],"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.000048559876,0.000013188334,0.000037743055,0.000020265003,0.0000046383266,0.00003733669,0.000049886068,0.006550347,0.00018119658,0.99188083,0.00047514198,0.0007007516],"study_design_scores_gemma":[0.000015625958,0.0000054653324,0.000021487189,0.0000061504784,0.0000024767278,0.00001924931,0.000016308053,0.044320904,0.00012576871,0.9551981,0.00025754754,0.000010923094],"about_ca_topic_score_codex":0.0024998055,"about_ca_topic_score_gemma":0.0016058352,"teacher_disagreement_score":0.0063310177,"about_ca_system_score_codex":0.0036528097,"about_ca_system_score_gemma":0.0028937235,"threshold_uncertainty_score":0.026503146},"labels":[],"label_agreement":null},{"id":"W2046102647","doi":"10.1016/j.tcs.2009.08.006","title":"A sublinear-time approximation scheme for bin packing","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Bin packing problem; Sublinear function; Mathematics; Constant (computer programming); Approximation algorithm; Combinatorics; Exponential function; Sampling (signal processing); Function (biology); Running time; Bin; Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.008633049583876605,"score_gpt":0.22843081015668698,"score_spread":0.21979776057281036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046102647","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.026502578,0.0011425456,0.94943494,0.0012449909,0.000491847,0.00029249056,0.0009138208,0.0059169666,0.014059766],"genre_scores_gemma":[0.1967231,0.0006795211,0.78462577,0.00065647764,0.00032858082,0.00056601065,0.0020123506,0.00081462396,0.013593708],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643326,0.00061616325,0.00023491927,0.00066283037,0.0013854323,0.00066738744],"domain_scores_gemma":[0.99491996,0.0017038132,0.00023710166,0.0023438046,0.00047466913,0.00032071225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019147568,0.0018774834,0.0024751013,0.0017078765,0.0018226296,0.0042732204,0.0051796637,0.002339084,0.015862027],"category_scores_gemma":[0.008548597,0.0010307576,0.0017419445,0.0055373223,0.0014072373,0.007759016,0.0050911233,0.0046218033,0.005076493],"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.0031138684,0.0009014157,0.00095132325,0.00055582565,0.00014343463,0.00015842676,0.00041415382,0.158517,0.016672812,0.104562365,0.05376275,0.6602467],"study_design_scores_gemma":[0.00034722252,0.00015004534,0.0003012165,0.000035782778,0.000075509226,0.00015193265,0.000087449334,0.87611634,0.004663044,0.10750682,0.010521759,0.000042848606],"about_ca_topic_score_codex":0.007251105,"about_ca_topic_score_gemma":0.009699298,"teacher_disagreement_score":0.015862027,"about_ca_system_score_codex":0.0045591835,"about_ca_system_score_gemma":0.0041650753,"threshold_uncertainty_score":0.05306375},"labels":[],"label_agreement":null},{"id":"W2046919262","doi":"10.1016/j.tcs.2010.08.010","title":"Tight bounds for the cover time of multiple random walks","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Hypercube; Mathematics; Upper and lower bounds; Random walk; Conjecture; Bounded function; Logarithm; Discrete mathematics; Random graph; Cover (algebra); Exponent; Expander graph; Order (exchange); Graph","score_opus":0.015307846400194607,"score_gpt":0.2870365055537961,"score_spread":0.2717286591536015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046919262","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.2249884,0.020724291,0.669086,0.014495425,0.0010767166,0.00032890402,0.0029896589,0.0018595558,0.064450994],"genre_scores_gemma":[0.8727374,0.010144641,0.08592988,0.0020763685,0.0030245865,0.00092553574,0.0024765444,0.0016902995,0.020994745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99148834,0.002045957,0.000305272,0.0015889453,0.0025470604,0.0020243358],"domain_scores_gemma":[0.87927777,0.09828064,0.0052263974,0.006207782,0.0037327518,0.007274599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0092102485,0.004522739,0.0066725905,0.0064883954,0.004479866,0.010661294,0.00822019,0.006251269,0.018107833],"category_scores_gemma":[0.07462929,0.0037733607,0.0034048415,0.00752872,0.007382632,0.021269595,0.009264275,0.01316112,0.0023107238],"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.0014383614,0.00038040994,0.0035049317,0.001129456,0.00038815982,0.00058395526,0.0012219001,0.2023001,0.008281706,0.7272257,0.01806869,0.035476707],"study_design_scores_gemma":[0.000100491314,0.00011604022,0.00091334485,0.00015107474,0.00016024106,0.0003005973,0.00013912773,0.42099434,0.0010961251,0.57211185,0.003844282,0.00007238291],"about_ca_topic_score_codex":0.00418966,"about_ca_topic_score_gemma":0.0045969086,"teacher_disagreement_score":0.018107833,"about_ca_system_score_codex":0.008577339,"about_ca_system_score_gemma":0.003112695,"threshold_uncertainty_score":0.06223321},"labels":[],"label_agreement":null},{"id":"W2047406446","doi":"10.1016/j.tcs.2012.02.017","title":"On derandomization and average-case complexity of monotone functions","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Indiana State University; Cisco Systems; National Science Foundation","keywords":"Mathematics; Monotone polygon; Combinatorics; Discrete mathematics; Algorithm; Geometry","score_opus":0.02453344038941696,"score_gpt":0.25747873425363593,"score_spread":0.23294529386421897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047406446","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.38977292,0.0063444865,0.5354517,0.016579049,0.00044025542,0.00034416694,0.0017572253,0.0014498663,0.047860358],"genre_scores_gemma":[0.9334828,0.0027758814,0.04887338,0.0013833481,0.0014264507,0.000551473,0.0015431878,0.0010555097,0.008907945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9797748,0.008951357,0.00095707225,0.0033342976,0.0034395556,0.0035429578],"domain_scores_gemma":[0.70717794,0.25074363,0.008191988,0.021678174,0.006542905,0.0056653237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020373339,0.0026377612,0.005218425,0.004757938,0.004038954,0.010556489,0.009947073,0.0051495517,0.0133445775],"category_scores_gemma":[0.14846912,0.0019158333,0.0040980433,0.0057286737,0.010114549,0.038605932,0.007917012,0.012480358,0.0015325878],"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.0018188279,0.0006382757,0.0076414472,0.0005209293,0.00031014445,0.00025588725,0.0010277388,0.18893214,0.0032597354,0.7442989,0.011276549,0.040019494],"study_design_scores_gemma":[0.000115794996,0.00010579746,0.0010043851,0.00005415523,0.00009778994,0.000182486,0.00013225402,0.27814546,0.0011799532,0.71758544,0.0013346315,0.000061815845],"about_ca_topic_score_codex":0.0032889643,"about_ca_topic_score_gemma":0.0031325761,"teacher_disagreement_score":0.020373339,"about_ca_system_score_codex":0.009930997,"about_ca_system_score_gemma":0.006340024,"threshold_uncertainty_score":0.107745826},"labels":[],"label_agreement":null},{"id":"W2047677968","doi":"10.1016/s0304-3975(01)00256-0","title":"The impact of information on broadcasting time in linear radio networks","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Broadcasting (networking); Computer science; Computer network; Node (physics); Radio broadcasting; Range (aeronautics); Theoretical computer science; Telecommunications","score_opus":0.018276620666140598,"score_gpt":0.26989859452200543,"score_spread":0.2516219738558648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047677968","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.7607927,0.00962398,0.17503397,0.01042168,0.0007366871,0.00005975249,0.0012006485,0.00074248906,0.04138807],"genre_scores_gemma":[0.98979694,0.0017501343,0.0043161586,0.00022071443,0.00028905598,0.000025413394,0.00015168005,0.00024881447,0.003201157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982028,0.00062381657,0.00006571142,0.00019787496,0.00043549913,0.00047433865],"domain_scores_gemma":[0.81465054,0.17174274,0.0047570076,0.0027403526,0.0038758402,0.002233528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035725185,0.0007418267,0.0014317544,0.0016682111,0.001739193,0.003027491,0.0019341855,0.0022002575,0.008286573],"category_scores_gemma":[0.06285181,0.0011220505,0.00046278437,0.0023486419,0.0027649822,0.0067379046,0.0019142386,0.0024332844,0.0006154634],"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.0038932466,0.00046478424,0.006706151,0.0007204746,0.00012390855,0.00057782885,0.0011138648,0.6137407,0.02158746,0.2824273,0.008199902,0.060444254],"study_design_scores_gemma":[0.00022149866,0.00032094354,0.0034958788,0.000088343266,0.00016089388,0.000328735,0.00033103095,0.76292753,0.0074404734,0.22295763,0.0016026705,0.0001244493],"about_ca_topic_score_codex":0.0029039297,"about_ca_topic_score_gemma":0.0039039408,"teacher_disagreement_score":0.008286573,"about_ca_system_score_codex":0.0027618378,"about_ca_system_score_gemma":0.0017886839,"threshold_uncertainty_score":0.027721345},"labels":[],"label_agreement":null},{"id":"W2047837697","doi":"10.1016/j.tcs.2014.09.024","title":"Algebraic methods proving Sauer's bound for teaching complexity","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Algebraic number; Algebra over a field; Mathematics; Computer science; Discrete mathematics; Theoretical computer science; Calculus (dental); Pure mathematics","score_opus":0.017830319807700792,"score_gpt":0.33658955597516604,"score_spread":0.31875923616746527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047837697","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.02651373,0.00085288455,0.8069246,0.010162045,0.00090562523,0.00011772545,0.00034905958,0.0011637317,0.15301062],"genre_scores_gemma":[0.6971639,0.0010952179,0.24001808,0.0022013872,0.0012459992,0.0005001359,0.00063076033,0.0010276901,0.05611691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953094,0.0013459824,0.00027505177,0.0010425779,0.0015151743,0.0005118507],"domain_scores_gemma":[0.97727877,0.016891135,0.00044565919,0.0028146964,0.0016597987,0.0009100594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004093097,0.0013580557,0.0014094448,0.0023641505,0.0030292114,0.004091068,0.0026389882,0.0027453273,0.030333733],"category_scores_gemma":[0.02721529,0.0011620562,0.002910523,0.001905031,0.00605799,0.015779747,0.008588436,0.009235477,0.0035510983],"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.00002825983,0.000028293834,0.0001517336,0.000057607293,0.000013561854,0.000013261876,0.00016212485,0.001911432,0.000335401,0.9824991,0.0030591781,0.011739969],"study_design_scores_gemma":[0.000016661745,0.000011640041,0.000080115555,0.000019070276,0.000015421696,0.00001310161,0.000035596113,0.011314978,0.00067665125,0.9833635,0.004442626,0.000010650162],"about_ca_topic_score_codex":0.0027247248,"about_ca_topic_score_gemma":0.0035532874,"teacher_disagreement_score":0.030333733,"about_ca_system_score_codex":0.0047147474,"about_ca_system_score_gemma":0.0027915598,"threshold_uncertainty_score":0.10147643},"labels":[],"label_agreement":null},{"id":"W2048261494","doi":"10.1016/j.tcs.2008.01.038","title":"Partitioned probe comparability graphs","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Combinatorics; Cograph; Split graph; Mathematics; Discrete mathematics; Pathwidth; Comparability graph; Indifference graph; Chordal graph; Line graph; Graph","score_opus":0.031434286364695405,"score_gpt":0.29781324708134405,"score_spread":0.2663789607166486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048261494","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.15494204,0.00048817066,0.75483316,0.0040302766,0.00025803165,0.0012641924,0.009460177,0.0071833404,0.06754066],"genre_scores_gemma":[0.79527324,0.0003471193,0.15993151,0.0019272452,0.0002657996,0.0013301531,0.014481239,0.0017546689,0.024689015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949468,0.0013721996,0.00018972461,0.0017146051,0.0010371315,0.0007395716],"domain_scores_gemma":[0.9760223,0.010419007,0.0013660411,0.00857298,0.0023675011,0.0012521322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002145636,0.0010774743,0.0014953691,0.001841019,0.001937306,0.003675057,0.0039092903,0.0027432344,0.04564754],"category_scores_gemma":[0.018054865,0.0010972996,0.0012505768,0.002958426,0.0020836222,0.009936662,0.0042852405,0.0037160232,0.0051614637],"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.004419804,0.001030127,0.004274139,0.0009702209,0.00023729564,0.00096058514,0.0010513375,0.04729903,0.049351208,0.6699417,0.049353313,0.17111123],"study_design_scores_gemma":[0.00026878226,0.00037934788,0.0016817668,0.00008227102,0.00011183919,0.0004526188,0.00052953704,0.09847316,0.021477671,0.84723276,0.029260956,0.000049382645],"about_ca_topic_score_codex":0.001236233,"about_ca_topic_score_gemma":0.0015396175,"teacher_disagreement_score":0.04564754,"about_ca_system_score_codex":0.0021152776,"about_ca_system_score_gemma":0.0016291157,"threshold_uncertainty_score":0.1527062},"labels":[],"label_agreement":null},{"id":"W2049009474","doi":"10.1016/j.tcs.2005.04.011","title":"Results on multiples of primitive polynomials and their products over GF(2)","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Primitive polynomial; Multiple; Mathematics; Cryptosystem; Cryptography; GF(2); Discrete mathematics; Degree (music); Arithmetic; Polynomial; Connection (principal bundle); Combinatorics; Finite field; Algorithm; Physics","score_opus":0.012278168014508201,"score_gpt":0.23608899362235822,"score_spread":0.22381082560785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049009474","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.37274948,0.020153055,0.26007026,0.0074351607,0.0017809406,0.00015747278,0.00092578016,0.0014653474,0.33526245],"genre_scores_gemma":[0.8996207,0.010584645,0.037758034,0.0010322491,0.0024703366,0.00013022502,0.00093009905,0.00047047684,0.04700319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997894,0.00037013082,0.00011893758,0.0003955462,0.0006836189,0.00053771655],"domain_scores_gemma":[0.9923781,0.0044911,0.0010016079,0.0012575107,0.00048156583,0.0003899755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017473018,0.0017978624,0.0017000791,0.0037303322,0.0024917675,0.0037383616,0.0014941343,0.0011720267,0.013879578],"category_scores_gemma":[0.008807736,0.0009708007,0.0012563649,0.0067901155,0.004283255,0.013584176,0.0036907305,0.004437863,0.0035606457],"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.0010258281,0.00017698722,0.0013522999,0.0006735168,0.000084280575,0.00059444504,0.0008545698,0.006738056,0.005138009,0.90233123,0.009764903,0.07126594],"study_design_scores_gemma":[0.000052181305,0.00017475172,0.0006562008,0.00015233079,0.00011064991,0.0012918169,0.00024208969,0.009304427,0.0059476984,0.9594108,0.022591265,0.00006582691],"about_ca_topic_score_codex":0.00059139205,"about_ca_topic_score_gemma":0.0007551339,"teacher_disagreement_score":0.013879578,"about_ca_system_score_codex":0.0016552772,"about_ca_system_score_gemma":0.0010340357,"threshold_uncertainty_score":0.04643178},"labels":[],"label_agreement":null},{"id":"W2049140374","doi":"10.1016/j.tcs.2006.07.021","title":"Prime normal form and equivalence of simple grammars","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Terminal and nonterminal symbols; Context-sensitive grammar; Indexed grammar; Tree-adjoining grammar; Mathematics; Context-free grammar; Prefix; Simple (philosophy); Discrete mathematics; Definite clause grammar; L-attributed grammar; Combinatorics; Equivalence (formal languages); Concatenation (mathematics); Logical equivalence; Computer science; Rule-based machine translation; Artificial intelligence; Linguistics","score_opus":0.0058679002261748416,"score_gpt":0.22985309846033694,"score_spread":0.2239851982341621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049140374","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.27587062,0.0016920068,0.58213496,0.0041691833,0.00063071144,0.0001674119,0.00060920266,0.0009685113,0.13375735],"genre_scores_gemma":[0.91505456,0.0010475909,0.060914528,0.00079007784,0.0008103284,0.00015964615,0.00083517557,0.00035597134,0.020032106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687386,0.0008850799,0.00020189359,0.0007274691,0.0009557792,0.0003558188],"domain_scores_gemma":[0.99183214,0.0054828725,0.00037465632,0.0011916896,0.00077509414,0.00034337732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002229411,0.0005699106,0.0012081757,0.0022207375,0.0015635852,0.003707378,0.0011846127,0.0013182178,0.0068844915],"category_scores_gemma":[0.0119376,0.00059790554,0.001133861,0.0022571245,0.0061971205,0.009474188,0.003054716,0.0042620436,0.00090383383],"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.00004774888,0.000027862963,0.0001599034,0.000022751305,0.000005589977,0.00008610657,0.000437557,0.00088469696,0.00045939162,0.9857662,0.0007712572,0.011330851],"study_design_scores_gemma":[0.0000065605536,0.0000055194314,0.000043264736,0.0000026203263,0.0000027627007,0.00003535653,0.000020296773,0.0010059769,0.00017033887,0.9976713,0.001032376,0.000003743249],"about_ca_topic_score_codex":0.0009784745,"about_ca_topic_score_gemma":0.0006414531,"teacher_disagreement_score":0.0068844915,"about_ca_system_score_codex":0.0012854676,"about_ca_system_score_gemma":0.00093655987,"threshold_uncertainty_score":0.023030877},"labels":[],"label_agreement":null},{"id":"W2049709665","doi":"10.1016/j.tcs.2009.04.016","title":"On the uniqueness of shuffle on words and finite languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Uniqueness; Factorization; Regular language; Mathematics; Decomposition; Finite set; Combinatorics; Discrete mathematics; Combinatorics on words; Computer science; Word (group theory); Theoretical computer science; Algorithm; Automaton","score_opus":0.007427173008570303,"score_gpt":0.24655547753011023,"score_spread":0.23912830452153994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049709665","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.27744013,0.0070736133,0.6517526,0.0075455867,0.0009913734,0.00010164732,0.0003707662,0.00030474033,0.054419555],"genre_scores_gemma":[0.8937097,0.0035041985,0.07431503,0.0014913637,0.001114524,0.00019569637,0.00044891506,0.00034228934,0.024878379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980374,0.0008155136,0.00016062411,0.000443092,0.0002694274,0.00027389923],"domain_scores_gemma":[0.9818079,0.0142595135,0.0006484388,0.0012337732,0.0012827566,0.00076765823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046928655,0.0007399783,0.0018627687,0.0022887178,0.0034497513,0.00386021,0.0019197197,0.003445775,0.005387631],"category_scores_gemma":[0.02039604,0.0013244824,0.0018751213,0.001983181,0.009155856,0.022491885,0.006774601,0.00511838,0.0008148906],"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.00008222484,0.000021322976,0.00047837556,0.00005784495,0.000014930735,0.00010564052,0.00044123852,0.0012542834,0.00042837733,0.9911479,0.00065108977,0.0053168205],"study_design_scores_gemma":[0.000006901173,0.000016274893,0.00009514336,0.0000126296145,0.0000060379493,0.00006846042,0.000096720956,0.0020212433,0.00023123642,0.9965333,0.0009010816,0.000010956966],"about_ca_topic_score_codex":0.00085563527,"about_ca_topic_score_gemma":0.0007198526,"teacher_disagreement_score":0.005387631,"about_ca_system_score_codex":0.0013740662,"about_ca_system_score_gemma":0.0014145223,"threshold_uncertainty_score":0.02481854},"labels":[],"label_agreement":null},{"id":"W2050063944","doi":"10.1016/j.tcs.2005.12.016","title":"Asynchronous deterministic rendezvous in graphs","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":162,"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 en Outaouais; Carleton University","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Graph; Upper and lower bounds; Mathematics; Node (physics); Topology (electrical circuits); Combinatorics; Algorithm; Discrete mathematics","score_opus":0.007596805078787223,"score_gpt":0.24335416124682405,"score_spread":0.23575735616803684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050063944","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.41306934,0.0009755725,0.5517805,0.0016395727,0.00020174263,0.00013769924,0.00041766497,0.0012384756,0.030539423],"genre_scores_gemma":[0.95915836,0.00032832328,0.02908006,0.00012169565,0.000056036963,0.00009243631,0.00015875435,0.00019661288,0.010807668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990409,0.0003107656,0.000042229047,0.00024464677,0.00016700303,0.00019437166],"domain_scores_gemma":[0.9920123,0.0054862727,0.0006036684,0.0008919088,0.00042226366,0.00058351265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010333266,0.0006181714,0.0012198926,0.0011827287,0.0016803528,0.0019091953,0.0019269246,0.0012884886,0.006782087],"category_scores_gemma":[0.008050895,0.00071151473,0.0005908607,0.0012915228,0.0020782899,0.0035127618,0.0023475229,0.0015923324,0.0007692908],"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.000657915,0.00009299114,0.0008483667,0.00021151296,0.0000518865,0.00026387282,0.0005464999,0.25104704,0.0055519766,0.7132396,0.0040868395,0.023401516],"study_design_scores_gemma":[0.00010109068,0.00004347918,0.00022349652,0.000018876006,0.000030177987,0.00007955058,0.000168951,0.45258635,0.0021925815,0.5420845,0.0024470144,0.000023845061],"about_ca_topic_score_codex":0.0038493648,"about_ca_topic_score_gemma":0.004861058,"teacher_disagreement_score":0.006782087,"about_ca_system_score_codex":0.0013625388,"about_ca_system_score_gemma":0.00086350495,"threshold_uncertainty_score":0.02268833},"labels":[],"label_agreement":null},{"id":"W2050243630","doi":"10.1016/j.tcs.2006.10.018","title":"Computability of analog networks","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computability; Metric space; Computable function; Mathematics; Discrete mathematics; Continuous function (set theory); Metric (unit); Fixed point; Computation; Topology (electrical circuits); Function (biology); Contraction mapping; Computer science; Algorithm; Mathematical analysis; Combinatorics","score_opus":0.005925309535869799,"score_gpt":0.22441266324461875,"score_spread":0.21848735370874894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050243630","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.3116915,0.003440977,0.46481407,0.0058537456,0.00028901763,0.000092740396,0.00060175464,0.00046209904,0.21275415],"genre_scores_gemma":[0.9788432,0.0006773833,0.012637566,0.00020426285,0.00021569149,0.000053327796,0.00016812366,0.000035716857,0.0071646855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918526,0.00026574588,0.000036779213,0.0002202743,0.00022142113,0.00007051773],"domain_scores_gemma":[0.9947864,0.0038433673,0.00032179843,0.0005848406,0.0002771532,0.00018637626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009532306,0.00039603384,0.0007191655,0.0013174671,0.0008606079,0.002724739,0.0012780579,0.0010488584,0.010885829],"category_scores_gemma":[0.008987369,0.0003316648,0.00074199156,0.00085752556,0.0031245053,0.005093302,0.0015536641,0.0018475149,0.00040596115],"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.000016175103,0.0000073433885,0.00013836414,0.000032282052,0.000011124155,0.000022262773,0.00005422455,0.009670593,0.00025714372,0.9859956,0.00030500686,0.003489998],"study_design_scores_gemma":[0.0000051086386,0.0000024864464,0.00007002418,0.0000049866394,0.00000311878,0.000016684546,0.0000092008395,0.020311445,0.00011549771,0.97890115,0.00055801845,0.000002295376],"about_ca_topic_score_codex":0.0012251245,"about_ca_topic_score_gemma":0.000725789,"teacher_disagreement_score":0.010885829,"about_ca_system_score_codex":0.0015025316,"about_ca_system_score_gemma":0.00049341423,"threshold_uncertainty_score":0.03641677},"labels":[],"label_agreement":null},{"id":"W2051092461","doi":"10.1016/j.tcs.2003.08.001","title":"On-line parallel heuristics, processor scheduling and robot searching under the competitive framework","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Heuristics; Computer science; Scheduling (production processes); Point (geometry); Robot; Heuristic; Path (computing); Line (geometry); Motion planning; Mathematical optimization; Mathematics; Artificial intelligence; Upper and lower bounds; Programming language","score_opus":0.0251432603993933,"score_gpt":0.3021206933952823,"score_spread":0.276977432995889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051092461","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.047171425,0.0030729033,0.9099028,0.0017141134,0.00024328995,0.00012729726,0.00009742959,0.0003544178,0.037316285],"genre_scores_gemma":[0.7903608,0.0032299191,0.18994154,0.00048280502,0.00058104977,0.00024300888,0.00018289106,0.00034472582,0.014633239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731416,0.0014697103,0.000049671642,0.00016957344,0.00061484583,0.00038198318],"domain_scores_gemma":[0.995307,0.003322935,0.00038373758,0.00031912723,0.00044452996,0.00022261191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030647728,0.0011804259,0.0019979912,0.0009498251,0.0012481427,0.0027389666,0.0031290208,0.002616592,0.0053220456],"category_scores_gemma":[0.010327222,0.00072496355,0.0007076926,0.0027158416,0.002111443,0.0034848182,0.001415976,0.0019425082,0.00061159383],"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.00045902425,0.00015928184,0.00031059285,0.00024388453,0.00007497969,0.00007070348,0.00009470298,0.68853164,0.00096804573,0.2664135,0.0053009964,0.03737271],"study_design_scores_gemma":[0.00007584538,0.00009146675,0.000118539494,0.000011970135,0.000016782744,0.000036250138,0.000027801632,0.81722915,0.0002521495,0.18044013,0.0016890999,0.000010799667],"about_ca_topic_score_codex":0.009629213,"about_ca_topic_score_gemma":0.0075085554,"teacher_disagreement_score":0.009629213,"about_ca_system_score_codex":0.002439624,"about_ca_system_score_gemma":0.0033558367,"threshold_uncertainty_score":0.019146323},"labels":[],"label_agreement":null},{"id":"W2051625963","doi":"10.1016/j.tcs.2004.11.009","title":"Formal description and analysis of a distributed location service for mobile ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Neurosurgery Research and Education Foundation","keywords":"Computer science; Computer network; Distributed computing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Routing protocol; Mobile ad hoc network; Wireless ad hoc network; Network packet; Wireless","score_opus":0.008857737886663775,"score_gpt":0.23490069795498855,"score_spread":0.22604296006832478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051625963","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.005983459,0.00021138764,0.98879457,0.00054734695,0.00006854621,0.00015122141,0.0001522963,0.00030681986,0.0037842512],"genre_scores_gemma":[0.40772587,0.0007547946,0.58040476,0.00040816615,0.00028403278,0.0006736363,0.0007373133,0.00028362297,0.008727813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652183,0.0009625547,0.00030457956,0.00038187904,0.0014497957,0.00037943083],"domain_scores_gemma":[0.9958722,0.0021374694,0.00033062437,0.00070599007,0.000806576,0.00014717654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003283309,0.0006828151,0.00065739296,0.0011589123,0.0013598824,0.0047353376,0.0029158234,0.0017375387,0.0035965983],"category_scores_gemma":[0.0073973816,0.0008396611,0.0015803522,0.0012353837,0.003951357,0.0036357294,0.0021992791,0.0024885777,0.0008772697],"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.000054544013,0.00010223668,0.0004780944,0.00017202718,0.000030369782,0.0003652615,0.00056240393,0.061454993,0.003815906,0.9122792,0.0018933126,0.01879161],"study_design_scores_gemma":[0.00010002803,0.00007151518,0.0002660831,0.000090033165,0.00006664155,0.00029116104,0.00021638407,0.4089854,0.004205718,0.5557257,0.029935004,0.00004631559],"about_ca_topic_score_codex":0.008409772,"about_ca_topic_score_gemma":0.006183761,"teacher_disagreement_score":0.008409772,"about_ca_system_score_codex":0.0025138299,"about_ca_system_score_gemma":0.0036784057,"threshold_uncertainty_score":0.01823914},"labels":[],"label_agreement":null},{"id":"W2051924156","doi":"10.1016/j.tcs.2006.08.010","title":"Algebraic properties of substitution on trajectories","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Substitution (logic); Concatenation (mathematics); Transitive closure; Generalization; Concurrency; Closure (psychology); Algebraic number; Transitive relation; Morphism; Algebraic theory; Mathematics; Regular language; Coding (social sciences); Quotient; Algebra over a field; Computer science; Set (abstract data type); Discrete mathematics; Theoretical computer science; Pure mathematics; Combinatorics; Automaton; Programming language","score_opus":0.010173418425434982,"score_gpt":0.2178024978931209,"score_spread":0.2076290794676859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051924156","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.42961255,0.0013559316,0.4608913,0.0037675838,0.00032699303,0.0001059647,0.0007587674,0.0004101846,0.102770686],"genre_scores_gemma":[0.95760953,0.0009067851,0.02559642,0.00027292187,0.00028470578,0.00011260165,0.0003738087,0.00014871075,0.014694479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998754,0.00031364593,0.000090755544,0.00024001877,0.0003666434,0.00023495765],"domain_scores_gemma":[0.996307,0.0020221234,0.0004414569,0.0003345165,0.0005610898,0.00033378226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001301354,0.0007719712,0.0010400356,0.0022904768,0.0021213465,0.0035525346,0.0013215018,0.0015814753,0.008106695],"category_scores_gemma":[0.006498026,0.0006033079,0.0011696088,0.002822174,0.0041920063,0.007838956,0.0024454915,0.0027564713,0.0006952116],"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.000008285344,0.0000038100936,0.000053830052,0.0000071158433,0.000001941712,0.00002015253,0.00006328622,0.00075758895,0.000129778,0.9980763,0.000121724384,0.0007562484],"study_design_scores_gemma":[0.0000090441545,0.0000075232592,0.000057278634,0.0000048828056,0.0000028221345,0.000036379293,0.000032004707,0.005315558,0.00014785101,0.9934736,0.000907198,0.0000057667926],"about_ca_topic_score_codex":0.0025656864,"about_ca_topic_score_gemma":0.0011882727,"teacher_disagreement_score":0.008106695,"about_ca_system_score_codex":0.0023706926,"about_ca_system_score_gemma":0.0011320037,"threshold_uncertainty_score":0.027119637},"labels":[],"label_agreement":null},{"id":"W2052932497","doi":"10.1016/j.tcs.2005.08.025","title":"Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Convexity; Mathematics; Enumeration; Regular polygon; Lattice (music); Combinatorics; Reflection symmetry; Computation; Hexagonal crystal system; Symmetry (geometry); Perimeter; Geometry; Algorithm; Physics","score_opus":0.026403407514722553,"score_gpt":0.30821707422867806,"score_spread":0.2818136667139555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052932497","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.91667473,0.00020722575,0.0316661,0.00047917286,0.00009741028,0.00008421109,0.00063627824,0.0001154643,0.05003938],"genre_scores_gemma":[0.96986616,0.000222771,0.01971456,0.00013168772,0.000074545605,0.00012638995,0.0011971422,0.0000854113,0.00858135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936193,0.00015550206,0.00004262447,0.0000818103,0.00021155823,0.00014651708],"domain_scores_gemma":[0.99862576,0.0005960027,0.0001854453,0.00020862506,0.00019191382,0.00019225583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033963984,0.0005284242,0.001030755,0.0013990307,0.0012662545,0.0028559596,0.001205054,0.0010733594,0.0088584265],"category_scores_gemma":[0.0019202809,0.00052169646,0.00074862305,0.0012913629,0.0016004803,0.0020514452,0.001144886,0.0014709128,0.0006450536],"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.00045956412,0.0002313098,0.004028459,0.0001740515,0.00005268157,0.00038163207,0.0003723918,0.012638303,0.009381758,0.92269146,0.007596076,0.041992303],"study_design_scores_gemma":[0.000114828414,0.00007308892,0.002408025,0.000046011268,0.000021229862,0.00042797558,0.00038401294,0.06383077,0.0029987628,0.9248079,0.0048537445,0.00003358708],"about_ca_topic_score_codex":0.0009748413,"about_ca_topic_score_gemma":0.0016475588,"teacher_disagreement_score":0.0088584265,"about_ca_system_score_codex":0.00071071746,"about_ca_system_score_gemma":0.0005119687,"threshold_uncertainty_score":0.029634356},"labels":[],"label_agreement":null},{"id":"W2053332270","doi":"10.1016/s0304-3975(00)00096-7","title":"Measure and probability for concurrency theorists","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conditional probability; Probabilistic logic; Regular conditional probability; Probability measure; Concurrency; Measure (data warehouse); Law of total probability; Theoretical computer science; Probability theory; Computer science; Conditional probability distribution; Semantics (computer science); Mathematics; Probabilistic argumentation; Probability distribution; Mathematical economics; Probability mass function; Artificial intelligence; Discrete mathematics; Programming language; Posterior probability; Econometrics; Statistics; Data mining; Bayesian probability","score_opus":0.01856159685253597,"score_gpt":0.2620203990383691,"score_spread":0.24345880218583313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053332270","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.040059987,0.029782508,0.7963651,0.06388509,0.0018058848,0.00007371011,0.00041646784,0.00045154206,0.06715971],"genre_scores_gemma":[0.87608284,0.008602705,0.09146197,0.003190521,0.005128463,0.00039845565,0.00033946225,0.000258471,0.014537034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943118,0.0027590902,0.00034774194,0.0009530833,0.0012538626,0.00037439642],"domain_scores_gemma":[0.95836246,0.03414597,0.0011477771,0.0035520534,0.0016117605,0.0011799592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008358628,0.00090598024,0.0022950987,0.0040124576,0.004361005,0.00923762,0.002933469,0.0047677997,0.008127453],"category_scores_gemma":[0.036677055,0.0010849595,0.002228696,0.004500144,0.017612522,0.028917575,0.0055463207,0.008327379,0.00088289904],"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.0000051197158,0.0000048341662,0.00005868549,0.000013930747,0.000004304364,0.000007753961,0.00007521445,0.0003284637,0.000017667644,0.99764305,0.00048677134,0.001354088],"study_design_scores_gemma":[0.0000021079236,0.0000014050826,0.000012754508,0.0000042608926,0.0000015066677,0.000004766439,0.0000138945015,0.0008137693,0.000008759101,0.9984162,0.000718486,0.0000020626528],"about_ca_topic_score_codex":0.0032035047,"about_ca_topic_score_gemma":0.001469019,"teacher_disagreement_score":0.00923762,"about_ca_system_score_codex":0.006274319,"about_ca_system_score_gemma":0.0023478197,"threshold_uncertainty_score":0.045523524},"labels":[],"label_agreement":null},{"id":"W2053695139","doi":"10.1016/j.tcs.2008.08.039","title":"Long binary patterns are Abelian 2-avoidable","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Abelian group; Binary number; Mathematics; Combinatorics; Arithmetic","score_opus":0.012199145243238898,"score_gpt":0.2253280155162436,"score_spread":0.2131288702730047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053695139","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.78055453,0.00064323377,0.14650111,0.0012017394,0.0004877679,0.00012024909,0.000626756,0.0013019032,0.06856266],"genre_scores_gemma":[0.9403672,0.00021328474,0.021394681,0.0003427849,0.00024500088,0.00019419928,0.00041323743,0.0002931916,0.036536377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998784,0.00017696395,0.00010499968,0.0003140648,0.0003274936,0.00029245458],"domain_scores_gemma":[0.9954991,0.0021767307,0.00083428365,0.00051928376,0.0005545118,0.00041607328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061838474,0.00080650195,0.0009703957,0.0017133573,0.0019958199,0.0033157729,0.0010949007,0.0013312522,0.01120342],"category_scores_gemma":[0.0032412615,0.0009460394,0.00067342474,0.0015997436,0.0021994442,0.005366678,0.00217246,0.00179347,0.0020563134],"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.00035135256,0.000079533114,0.0012231692,0.00014984996,0.000026078811,0.00087429717,0.0012461349,0.00085882825,0.0121149495,0.9617601,0.0026376043,0.018678136],"study_design_scores_gemma":[0.000050755574,0.00005476029,0.0005911512,0.000018549908,0.000019560179,0.00073553226,0.0002542362,0.0028560085,0.0031588767,0.9865883,0.0056340946,0.00003813959],"about_ca_topic_score_codex":0.0003126501,"about_ca_topic_score_gemma":0.00048311878,"teacher_disagreement_score":0.01120342,"about_ca_system_score_codex":0.00075061433,"about_ca_system_score_gemma":0.00051621225,"threshold_uncertainty_score":0.037479162},"labels":[],"label_agreement":null},{"id":"W2053806044","doi":"10.1016/s0304-3975(99)00186-3","title":"Scheduling in the dark","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Parallelizable manifold; Computer science; Scheduling (production processes); Multiprocessing; Parallel computing; Multiprocessor scheduling; Partition (number theory); Upper and lower bounds; Distributed computing; Job shop scheduling; Algorithm; Mathematical optimization; Flow shop scheduling; Mathematics; Operating system","score_opus":0.013007104593241791,"score_gpt":0.2663847769236825,"score_spread":0.25337767233044073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053806044","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.06504212,0.013286858,0.17582761,0.10997823,0.008519281,0.00013784207,0.0010474912,0.0020824908,0.62407804],"genre_scores_gemma":[0.7453877,0.006523222,0.037070338,0.010352028,0.0031303407,0.00012240131,0.00062293326,0.0013088871,0.1954821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877566,0.00040205955,0.000029083518,0.00028260463,0.00022134237,0.00028930858],"domain_scores_gemma":[0.9960194,0.0010205337,0.00022755619,0.0011783262,0.00049548136,0.0010586367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021575275,0.0005005825,0.0008530652,0.00081700267,0.0028715422,0.005543649,0.0015467022,0.0017626683,0.042352144],"category_scores_gemma":[0.008047921,0.00057244947,0.00032630356,0.001704247,0.0034144758,0.007480376,0.0022377912,0.004814642,0.007430482],"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.00035964444,0.00009250343,0.00032727892,0.000113661874,0.000021858072,0.00005526299,0.00036844503,0.0075270245,0.0014559733,0.8687327,0.070153825,0.050791886],"study_design_scores_gemma":[0.000059004262,0.000042639316,0.00022605447,0.000060131588,0.000009144482,0.000037702055,0.0005415659,0.015028075,0.00063924404,0.78599584,0.19733669,0.000023957573],"about_ca_topic_score_codex":0.008506688,"about_ca_topic_score_gemma":0.009450621,"teacher_disagreement_score":0.042352144,"about_ca_system_score_codex":0.0037038778,"about_ca_system_score_gemma":0.005115736,"threshold_uncertainty_score":0.14168203},"labels":[],"label_agreement":null},{"id":"W2053905301","doi":"10.1016/j.tcs.2010.11.020","title":"A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Edit distance; Sequence (biology); Algorithm; Hierarchy; Computer science; Nested loop join; Class (philosophy); Mathematics; Theoretical computer science; Artificial intelligence; Data mining","score_opus":0.00882762397902518,"score_gpt":0.25409568040930236,"score_spread":0.2452680564302772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053905301","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.0046928846,0.0000877215,0.99087745,0.000060676975,0.00006906265,0.00010542132,0.00023224107,0.0033793922,0.00049512455],"genre_scores_gemma":[0.0125596905,0.000053972693,0.98513687,0.000035924022,0.000019333405,0.00012353566,0.00065757724,0.00040895212,0.001004186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975407,0.000345325,0.00026299217,0.0008715066,0.0008139232,0.00016541829],"domain_scores_gemma":[0.9961081,0.0012993072,0.00029168272,0.0011599162,0.0009742314,0.0001668011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022495505,0.0014949092,0.0015427022,0.0030988115,0.0017120562,0.0021744715,0.0031417636,0.0018807298,0.007999263],"category_scores_gemma":[0.009621641,0.0011419447,0.0013420103,0.0047120564,0.0010879475,0.0038959624,0.003229126,0.0025113237,0.0038077359],"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.0006208837,0.0001960048,0.0010089746,0.00044807405,0.00013077546,0.0002077878,0.00041644825,0.02214062,0.058702603,0.028292604,0.009704385,0.8781308],"study_design_scores_gemma":[0.00030112464,0.0003864425,0.0012682695,0.00018238442,0.00020712442,0.0010632492,0.00035504595,0.7501594,0.07887454,0.11150125,0.055512138,0.00018898213],"about_ca_topic_score_codex":0.002809194,"about_ca_topic_score_gemma":0.005989399,"teacher_disagreement_score":0.007999263,"about_ca_system_score_codex":0.00095756934,"about_ca_system_score_gemma":0.002065014,"threshold_uncertainty_score":0.02676022},"labels":[],"label_agreement":null},{"id":"W2054080154","doi":"10.1016/j.tcs.2003.04.001","title":"Appendix A: Report on the First International Clobber Tournament","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Tournament; Computer science; Mathematics; Appendix; Calculus (dental); Mathematical economics; Combinatorics; Medicine; Orthodontics; Geology","score_opus":0.022064625004885288,"score_gpt":0.2852826769892971,"score_spread":0.26321805198441184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054080154","genre_codex":"dataset","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.00773404,0.0007058258,0.010906369,0.0039572534,0.0052750777,0.0015675806,0.49169934,0.0025373744,0.47561717],"genre_scores_gemma":[0.05522075,0.0008446536,0.0125572,0.0007154358,0.0010793274,0.0017522121,0.31726217,0.0012362013,0.6093321],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852836,0.00022201706,0.000117449315,0.00016041083,0.000760974,0.00021075916],"domain_scores_gemma":[0.9864861,0.0034848293,0.0005015881,0.0013522612,0.007115322,0.0010599574],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015471389,0.000740295,0.0007023782,0.0026392832,0.0011251126,0.0016563328,0.0014025646,0.00073202886,0.48549467],"category_scores_gemma":[0.016213888,0.00033839032,0.00039237642,0.0043504625,0.0001836735,0.001250023,0.0009959845,0.0010598802,0.22257474],"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.00012437189,0.000082722734,0.00058087707,0.000085275824,0.000007585055,0.000022514772,0.000030566844,0.00025348354,0.00011959621,0.0032411984,0.9652105,0.030241344],"study_design_scores_gemma":[0.00009462357,0.00013738255,0.007838235,0.00006364205,0.000012824081,0.000069332804,0.00012769144,0.00039623384,0.00065834797,0.005994801,0.984582,0.000024821276],"about_ca_topic_score_codex":0.012600844,"about_ca_topic_score_gemma":0.018327901,"teacher_disagreement_score":0.48549467,"about_ca_system_score_codex":0.0013090644,"about_ca_system_score_gemma":0.002062453,"threshold_uncertainty_score":0.7338794},"labels":[],"label_agreement":null},{"id":"W2054220885","doi":"10.1016/j.tcs.2007.04.015","title":"State complexity of combined operations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":88,"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":"State (computer science); Intersection (aeronautics); Combined operations; Star (game theory); Computer science; Theoretical computer science; Computational complexity theory; Mathematics; Algorithm; Engineering; Political science","score_opus":0.018968664395800354,"score_gpt":0.26799451307674566,"score_spread":0.2490258486809453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054220885","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.7962264,0.00043889112,0.17032306,0.0016722006,0.00006850754,0.00008707926,0.00086857687,0.00040102057,0.029914238],"genre_scores_gemma":[0.98753047,0.00014343919,0.007756694,0.000061885585,0.00007091036,0.00008299249,0.00039554533,0.00007798385,0.0038801157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965952,0.00076104293,0.00021044986,0.00060922984,0.00124283,0.0005813547],"domain_scores_gemma":[0.96595806,0.026937747,0.001365397,0.0027972986,0.0018015387,0.0011399237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019051979,0.00056596386,0.0014777706,0.0018884499,0.0017046096,0.0077280677,0.0019261937,0.001902531,0.012460286],"category_scores_gemma":[0.016217213,0.00078603654,0.0017392071,0.0022398012,0.0031619743,0.015326296,0.0034324788,0.003849751,0.0007162648],"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.00044217412,0.00012793482,0.0018163612,0.000108918495,0.000046824312,0.0001390726,0.000680519,0.028253498,0.0027811667,0.9516364,0.0012876072,0.012679543],"study_design_scores_gemma":[0.000034101828,0.000037049034,0.0006940136,0.000011960562,0.00003778733,0.0000631021,0.000108951346,0.11836839,0.00199878,0.877999,0.0006202644,0.000026503723],"about_ca_topic_score_codex":0.0017363622,"about_ca_topic_score_gemma":0.0015500601,"teacher_disagreement_score":0.012460286,"about_ca_system_score_codex":0.0025223705,"about_ca_system_score_gemma":0.0016428854,"threshold_uncertainty_score":0.041683853},"labels":[],"label_agreement":null},{"id":"W2054806088","doi":"10.1016/j.tcs.2012.10.015","title":"PAC learnability under non-atomic measures: A problem by Vidyasagar","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Countable set; Learnability; Uncountable set; Discrete mathematics; Modulo; Dimension (graph theory); Axiom; Combinatorics; Computer science","score_opus":0.007524025083853643,"score_gpt":0.24933544729667395,"score_spread":0.24181142221282032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054806088","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.07904263,0.013565464,0.8250119,0.043181635,0.0011643267,0.00012570799,0.0005259312,0.00079214835,0.036590245],"genre_scores_gemma":[0.8009951,0.008284113,0.15982066,0.005997156,0.0031893179,0.00038016646,0.000730344,0.0007384881,0.019864678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99308443,0.002435255,0.0003656495,0.0018565354,0.001822768,0.00043532305],"domain_scores_gemma":[0.93690246,0.052710332,0.0010918492,0.005397893,0.0029854178,0.000912027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008752968,0.0013647076,0.004351064,0.0018892384,0.0040476047,0.0063754185,0.0031883826,0.005363546,0.0035326702],"category_scores_gemma":[0.057621628,0.0016476021,0.0024146433,0.0043870704,0.010767789,0.02349405,0.008696009,0.018808873,0.00089684105],"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.00013965904,0.00007236072,0.0008063401,0.000199626,0.0000849997,0.00008440694,0.00035133824,0.010630942,0.0004318238,0.9531871,0.0060863593,0.027924962],"study_design_scores_gemma":[0.0000150956175,0.000016354586,0.00012002352,0.00001933794,0.000015243309,0.000028783621,0.00003202433,0.02361765,0.00027968493,0.9740543,0.0017838085,0.000017629895],"about_ca_topic_score_codex":0.0027444125,"about_ca_topic_score_gemma":0.00131739,"teacher_disagreement_score":0.008752968,"about_ca_system_score_codex":0.0031857602,"about_ca_system_score_gemma":0.0026843192,"threshold_uncertainty_score":0.046290696},"labels":[],"label_agreement":null},{"id":"W2056081080","doi":"10.1016/j.tcs.2009.06.019","title":"On-the-fly<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>T</mml:mi><mml:mi>C</mml:mi><mml:mi>T</mml:mi><mml:mi>L</mml:mi></mml:math>model checking for time Petri nets","year":2009,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Algorithm; Computer science; Computer graphics (images); Artificial intelligence; Mathematics; Theology; Philosophy","score_opus":0.02308841751832871,"score_gpt":0.26984431028839184,"score_spread":0.24675589277006313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056081080","genre_codex":"software","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.0036136971,0.00014754517,0.3771153,0.0009934446,0.00050297927,0.0005193436,0.02589618,0.4308577,0.16035385],"genre_scores_gemma":[0.07936945,0.0008792207,0.28695992,0.000833699,0.00026097745,0.001017214,0.07736831,0.19573171,0.3575796],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992902,0.00013693524,0.00004768826,0.00012646457,0.00030659745,0.00009202871],"domain_scores_gemma":[0.99684745,0.0011348213,0.000115709336,0.0011762518,0.00051273947,0.00021292252],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014879225,0.001474435,0.0011479164,0.0019059279,0.00087126606,0.004192605,0.0023825103,0.0014471331,0.3699673],"category_scores_gemma":[0.005863215,0.0011148019,0.0011310186,0.0012116826,0.00065163855,0.0048775305,0.0034612303,0.001741233,0.21707626],"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.0007768745,0.00020386485,0.0009433711,0.0005205251,0.000065629414,0.00021558926,0.00045821237,0.002953,0.010987311,0.028025365,0.6620955,0.29275492],"study_design_scores_gemma":[0.00028576635,0.00005119957,0.0012826349,0.0002034799,0.000038377548,0.00018711993,0.00023833082,0.03830473,0.040213346,0.032769,0.88631725,0.00010870864],"about_ca_topic_score_codex":0.004645639,"about_ca_topic_score_gemma":0.0071847076,"teacher_disagreement_score":0.3699673,"about_ca_system_score_codex":0.0011044345,"about_ca_system_score_gemma":0.0011579589,"threshold_uncertainty_score":0.8986652},"labels":[],"label_agreement":null},{"id":"W2056117079","doi":"10.1016/j.tcs.2008.11.003","title":"Compressed depth sequences","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Redundancy (engineering); Set (abstract data type); Construct (python library); Probability distribution; Binary logarithm; Algorithm; Code (set theory); Discrete mathematics; Computer science; Statistics","score_opus":0.01978348719631589,"score_gpt":0.25570393056188034,"score_spread":0.23592044336556445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056117079","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.11198369,0.0032096398,0.8079473,0.002344572,0.001324085,0.0004731585,0.004357617,0.0035390065,0.06482098],"genre_scores_gemma":[0.54146487,0.0018564208,0.39962834,0.0009768774,0.00057172764,0.00041733414,0.0058769146,0.00065239135,0.048555177],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918526,0.00008901958,0.00004189668,0.00013855836,0.00044929318,0.00009589021],"domain_scores_gemma":[0.9988048,0.00032212766,0.00008123648,0.00041503308,0.0002929908,0.00008384438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000377567,0.00075070275,0.0005788239,0.0014458941,0.00056753226,0.0011189454,0.0007936671,0.0011268922,0.01525741],"category_scores_gemma":[0.003795339,0.00036481136,0.0003206111,0.0015625613,0.00064986915,0.002353188,0.0017569436,0.0015283929,0.002789726],"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.001195568,0.00015025237,0.0007332492,0.0002951569,0.000040461127,0.00042298797,0.00024048756,0.041379906,0.057954438,0.32609102,0.026154164,0.5453423],"study_design_scores_gemma":[0.00022329508,0.00040383317,0.0014476463,0.00025648533,0.00006110037,0.0015619447,0.00025611272,0.39554024,0.11072979,0.3744622,0.11495893,0.0000984222],"about_ca_topic_score_codex":0.0009632664,"about_ca_topic_score_gemma":0.001528433,"teacher_disagreement_score":0.01525741,"about_ca_system_score_codex":0.0009482599,"about_ca_system_score_gemma":0.0012044396,"threshold_uncertainty_score":0.051041126},"labels":[],"label_agreement":null},{"id":"W2057923867","doi":"10.1016/j.tcs.2005.06.030","title":"A representation theorem for Boolean contact algebras","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Representation theorem; Stone's representation theorem for Boolean algebras; Mathematics; Axiom; Connection (principal bundle); Discrete mathematics; Representation (politics); Transitive relation; Free Boolean algebra; Automated theorem proving; Complete Boolean algebra; Class (philosophy); Boolean algebras canonically defined; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Two-element Boolean algebra; Algorithm; Artificial intelligence; Algebra representation","score_opus":0.018317422667850046,"score_gpt":0.2810696077821045,"score_spread":0.26275218511425447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057923867","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.050769288,0.0012292865,0.83009905,0.0032327462,0.00052699546,0.00013812537,0.00090174674,0.00067036296,0.112432316],"genre_scores_gemma":[0.79573256,0.0016953112,0.15058888,0.0019233425,0.0012113532,0.00038663045,0.001504932,0.00032797194,0.046629068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991731,0.00014861843,0.00006115457,0.0002059032,0.00027405928,0.0001371356],"domain_scores_gemma":[0.9988606,0.00050659117,0.00010280899,0.00019030987,0.0002313337,0.000108380606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012635394,0.00058605336,0.00092834415,0.0019552025,0.0020002716,0.0043758377,0.0014823993,0.0016590623,0.015981955],"category_scores_gemma":[0.0034411522,0.00039854043,0.0019464626,0.0025591042,0.0021733246,0.0084728515,0.0023337468,0.003557431,0.0019980976],"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.0000063767334,0.000007770522,0.000019228743,0.000014016811,0.0000039304728,0.000014511821,0.00008013619,0.00020692553,0.00017897121,0.9955884,0.00088327425,0.002996591],"study_design_scores_gemma":[0.000008638747,0.0000075406,0.000028370561,0.000008005444,0.000007274076,0.00004779164,0.000034476874,0.00326558,0.00018511331,0.993359,0.0030409885,0.0000071007553],"about_ca_topic_score_codex":0.00124704,"about_ca_topic_score_gemma":0.0005973376,"teacher_disagreement_score":0.015981955,"about_ca_system_score_codex":0.0015950955,"about_ca_system_score_gemma":0.000838376,"threshold_uncertainty_score":0.05346495},"labels":[],"label_agreement":null},{"id":"W2058095168","doi":"10.1016/j.tcs.2008.06.002","title":"Heuristic algorithms for Hadamard matrices with two circulant cores","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Hadamard transform; Algorithm; Heuristic; Hadamard matrix; Mathematics; Complex Hadamard matrix; Combinatorics; Computer science; Mathematical optimization","score_opus":0.012383514390553699,"score_gpt":0.2220192531576568,"score_spread":0.20963573876710312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058095168","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.055347804,0.00058228656,0.9275929,0.0005312826,0.00018680647,0.00027366672,0.0002182873,0.0015798404,0.013687129],"genre_scores_gemma":[0.20943251,0.00017066875,0.784582,0.00016803111,0.000085222106,0.00031136404,0.00038286563,0.00023645439,0.004630945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907136,0.0003128379,0.0000433095,0.00014819443,0.00021242595,0.00021171285],"domain_scores_gemma":[0.99680114,0.0021018893,0.00014638295,0.00042816857,0.00035401963,0.00016836336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010034182,0.0013504254,0.0015293208,0.0017225926,0.0015788127,0.0020854552,0.002440505,0.0020537288,0.01152187],"category_scores_gemma":[0.006563724,0.0010449408,0.0010814458,0.0022858037,0.0010157262,0.0026441126,0.0019469915,0.0015901779,0.0016398443],"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.00081151136,0.0005720536,0.00085021945,0.00043215993,0.0001188946,0.00025557936,0.00034159044,0.53440726,0.005473796,0.10923425,0.016536014,0.33096665],"study_design_scores_gemma":[0.00020465242,0.0000798807,0.00009070196,0.000023692452,0.000021514981,0.00006458039,0.00008611961,0.9268959,0.0014734756,0.06908576,0.0019523395,0.000021299295],"about_ca_topic_score_codex":0.0055665877,"about_ca_topic_score_gemma":0.01090958,"teacher_disagreement_score":0.01152187,"about_ca_system_score_codex":0.0016203676,"about_ca_system_score_gemma":0.0025497335,"threshold_uncertainty_score":0.038544536},"labels":[],"label_agreement":null},{"id":"W2059032550","doi":"10.1016/j.tcs.2013.02.008","title":"A tight characterization of strategic games with a unique equilibrium","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Wireless Networks and Protocols","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":"Concordia University","funders":"","keywords":"Nash equilibrium; Computer science; Set (abstract data type); Action (physics); Strategy; Characterization (materials science); Mathematical economics; A priori and a posteriori; Correlated equilibrium; Best response; Game theory; Solution concept; Mathematical optimization; Repeated game; Equilibrium selection; Mathematics","score_opus":0.013419054997618576,"score_gpt":0.23159446582972637,"score_spread":0.21817541083210779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059032550","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.17601065,0.00082633767,0.716262,0.0044707875,0.0002665429,0.00032046824,0.0012285319,0.00065543945,0.0999593],"genre_scores_gemma":[0.91050804,0.001089714,0.05974224,0.0011602422,0.00064911065,0.0006857904,0.0011752209,0.00033821372,0.024651514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949004,0.0014326993,0.00035412385,0.0013273846,0.00094572455,0.0010396265],"domain_scores_gemma":[0.98168325,0.011107707,0.0018606886,0.0011284548,0.0020424454,0.0021774606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037608482,0.0024315615,0.0035888623,0.004808917,0.0035544406,0.008297772,0.004701526,0.0035080947,0.01918726],"category_scores_gemma":[0.021806559,0.0020458729,0.0028464156,0.0050074253,0.0056045623,0.014102982,0.0068101827,0.009052012,0.002399688],"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.00006639787,0.000053166343,0.00019829058,0.00006884851,0.000028344568,0.000067306246,0.0002776167,0.0034470148,0.0009635807,0.9901308,0.0018360923,0.0028626618],"study_design_scores_gemma":[0.000038294445,0.000058861813,0.00022492539,0.000035029636,0.000029282093,0.000099956065,0.00012727351,0.028746562,0.0003356951,0.968597,0.001676343,0.000030657473],"about_ca_topic_score_codex":0.0021189838,"about_ca_topic_score_gemma":0.0014614766,"teacher_disagreement_score":0.01918726,"about_ca_system_score_codex":0.0032282132,"about_ca_system_score_gemma":0.0025589485,"threshold_uncertainty_score":0.064187825},"labels":[],"label_agreement":null},{"id":"W2059590924","doi":"10.1016/j.tcs.2010.07.017","title":"Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>ϵ</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math>time","year":2010,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constant (computer programming); Minor (academic); Scroll; Grid; Planar; Mathematics; Factor (programming language); Combinatorics; Computer science; Discrete mathematics; Computer graphics (images); Geometry; Programming language; Humanities; Engineering","score_opus":0.013831030640454033,"score_gpt":0.2509247616131342,"score_spread":0.23709373097268016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059590924","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.22558501,0.000980017,0.7177659,0.0008873031,0.00022438537,0.00014075261,0.0031409604,0.0030940045,0.04818158],"genre_scores_gemma":[0.61310947,0.00058723154,0.35771465,0.00019019043,0.00010060397,0.00014906238,0.006505663,0.0015463694,0.020096775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972755,0.000054029882,0.000010284932,0.00006308738,0.00008591075,0.00005916989],"domain_scores_gemma":[0.99852484,0.0007152421,0.000106798914,0.00029791,0.0002287846,0.00012653196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046579257,0.0010573147,0.0006859874,0.0012047866,0.0005867732,0.0017029268,0.0012281734,0.00073341205,0.019761518],"category_scores_gemma":[0.0049784863,0.00035629966,0.00076616684,0.0011846324,0.00064622273,0.0019748511,0.0011211818,0.0013946408,0.004334903],"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.0018230731,0.0003108999,0.006601824,0.0008292653,0.00011113819,0.00038368907,0.000936586,0.4038379,0.013585289,0.22886509,0.08353597,0.25917935],"study_design_scores_gemma":[0.00008576962,0.00007594921,0.0010758009,0.00006936747,0.00002569332,0.00015079648,0.00023604344,0.8202035,0.0030410627,0.16458565,0.010432387,0.000018069511],"about_ca_topic_score_codex":0.008267238,"about_ca_topic_score_gemma":0.017118886,"teacher_disagreement_score":0.019761518,"about_ca_system_score_codex":0.0014876081,"about_ca_system_score_gemma":0.000994082,"threshold_uncertainty_score":0.06610894},"labels":[],"label_agreement":null},{"id":"W2059986173","doi":"10.1016/j.tcs.2012.07.021","title":"Optimal gathering in radio grids with interference","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Upper and lower bounds; Combinatorics; Node (physics); Computer science; Constant (computer programming); Discrete mathematics; Matching (statistics); Graph; Mathematics; Communication source; Grid; Hexagonal tiling; Set (abstract data type); Computer network; Physics","score_opus":0.009171511087821072,"score_gpt":0.22917257095054375,"score_spread":0.22000105986272267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059986173","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.14565866,0.0009564068,0.83703554,0.0011781368,0.00012986196,0.00010585529,0.00014333671,0.00029967926,0.014492608],"genre_scores_gemma":[0.93339974,0.00067374605,0.05896792,0.00012283144,0.0001130806,0.00011095308,0.00011256027,0.00010442061,0.0063948208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990221,0.00044299444,0.00003803014,0.00014567755,0.00014723079,0.00020399939],"domain_scores_gemma":[0.9940989,0.004434183,0.0005612821,0.0002566401,0.00031958573,0.00032948595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001476116,0.000884062,0.0015992724,0.0010948292,0.001159909,0.001597326,0.0015593442,0.0010958272,0.0024326653],"category_scores_gemma":[0.008472255,0.0009809621,0.0005855438,0.0013713796,0.0019179874,0.0021142743,0.002277049,0.0010064619,0.00026814287],"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.00025688103,0.00006384403,0.0006988823,0.00012810416,0.000038615275,0.00012039128,0.0001428161,0.910564,0.0013596616,0.07233967,0.0017504089,0.01253685],"study_design_scores_gemma":[0.000037728136,0.000039130126,0.00013886826,0.000008302145,0.000010916253,0.000041537973,0.00005662686,0.9364246,0.00031103397,0.062465247,0.00045732225,0.00000862411],"about_ca_topic_score_codex":0.0031920082,"about_ca_topic_score_gemma":0.0024926944,"teacher_disagreement_score":0.0031920082,"about_ca_system_score_codex":0.001340909,"about_ca_system_score_gemma":0.0009222053,"threshold_uncertainty_score":0.009729028},"labels":[],"label_agreement":null},{"id":"W2061265323","doi":"10.1016/j.tcs.2009.01.004","title":"Nondeterministic state complexity of nested word automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"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":"Nondeterministic algorithm; Nondeterministic finite automaton; Nested word; Word (group theory); Discrete mathematics; Deterministic finite automaton; Intersection (aeronautics); Mathematics; Upper and lower bounds; Combinatorics; Automaton; Finite-state machine; Automata theory; Computer science; Quantum finite automata; Theoretical computer science; Algorithm","score_opus":0.01999266988656173,"score_gpt":0.26671292319203743,"score_spread":0.2467202533054757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061265323","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.74132913,0.00058593106,0.23375446,0.002267277,0.00008020793,0.00009509707,0.00071291556,0.0003695673,0.020805363],"genre_scores_gemma":[0.9832028,0.00017482408,0.012584382,0.00007318194,0.00006743431,0.000095713134,0.00029704082,0.00007973585,0.00342486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587643,0.0011667982,0.00034511782,0.00079509866,0.0013065607,0.00050997856],"domain_scores_gemma":[0.9542304,0.03853951,0.0015673512,0.0028942858,0.0017678424,0.0010006109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025016645,0.00051198865,0.0015057364,0.0011439644,0.0016643339,0.0060763354,0.0020883419,0.0015170013,0.0063181357],"category_scores_gemma":[0.022572562,0.0008333637,0.0015242608,0.0013654708,0.0032371879,0.013340981,0.0027133345,0.0037459151,0.00044640453],"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.0002539579,0.00010836599,0.0019460294,0.00011455285,0.00003898959,0.0001968162,0.0009844246,0.03873389,0.0031156635,0.9445148,0.00081216585,0.009180437],"study_design_scores_gemma":[0.00002022274,0.000015910173,0.00035109394,0.0000072001403,0.000015972184,0.000044134653,0.000065297805,0.11296084,0.0010589963,0.8850876,0.00035416379,0.000018579245],"about_ca_topic_score_codex":0.0021679653,"about_ca_topic_score_gemma":0.0022868132,"teacher_disagreement_score":0.0063181357,"about_ca_system_score_codex":0.0029013183,"about_ca_system_score_gemma":0.0020236697,"threshold_uncertainty_score":0.021136224},"labels":[],"label_agreement":null},{"id":"W2061918649","doi":"10.1016/j.tcs.2014.02.045","title":"Online algorithms for 1-space bounded 2-dimensional bin packing and square packing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hebei Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bin packing problem; Bounded function; Bin; Square (algebra); Competitive analysis; Mathematics; Packing problems; Combinatorics; Unit square; Space (punctuation); Sequence (biology); Upper and lower bounds; Online algorithm; Algorithm; Best bin first; Computer science; Geometry; Mathematical analysis; Artificial intelligence; k-nearest neighbors algorithm; Chemistry","score_opus":0.013697621675699418,"score_gpt":0.246702862499147,"score_spread":0.2330052408234476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061918649","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.027177824,0.0020848047,0.9486464,0.0015245304,0.00045432954,0.00030390715,0.0006472778,0.0034978946,0.015662907],"genre_scores_gemma":[0.26291284,0.0011113024,0.7196401,0.0007128374,0.00040377208,0.00082701904,0.0016125329,0.0010581114,0.011721452],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963427,0.0010584453,0.00021886334,0.0006538444,0.0010091052,0.00071695144],"domain_scores_gemma":[0.9900845,0.00621371,0.0005767705,0.0020501362,0.0006209143,0.000453925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025740576,0.002385174,0.003263867,0.0017095277,0.001585541,0.004327648,0.0065651913,0.003497042,0.018995324],"category_scores_gemma":[0.017234448,0.001487409,0.001909566,0.0052698506,0.0017710245,0.010301195,0.0064830147,0.0050541754,0.003919529],"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.0019912312,0.0011543453,0.0012717582,0.0009857779,0.00016699586,0.00016776213,0.00040102119,0.39695653,0.0039278083,0.12888493,0.038366254,0.4257256],"study_design_scores_gemma":[0.00015974748,0.0000977345,0.00024132193,0.000043946227,0.000038704966,0.000087265085,0.00007656183,0.8744722,0.001304757,0.11964379,0.0038097166,0.00002429229],"about_ca_topic_score_codex":0.00434686,"about_ca_topic_score_gemma":0.007073696,"teacher_disagreement_score":0.018995324,"about_ca_system_score_codex":0.0032473877,"about_ca_system_score_gemma":0.003514927,"threshold_uncertainty_score":0.063545644},"labels":[],"label_agreement":null},{"id":"W2062088872","doi":"10.1016/s0304-3975(03)00320-7","title":"On the complexity of finding common approximate substrings","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"","keywords":"Parameterized complexity; Substring; Mathematics; Hamming distance; Combinatorics; String (physics); Alphabet; Time complexity; Class (philosophy); Set (abstract data type); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.03818003502775003,"score_gpt":0.26858535743145007,"score_spread":0.23040532240370004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062088872","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.47401792,0.007134639,0.4661272,0.018041825,0.0006363578,0.00046708138,0.004678404,0.0026968222,0.026199806],"genre_scores_gemma":[0.7585545,0.0032140939,0.21844466,0.0012427686,0.001136095,0.00044766214,0.0064230557,0.0009290152,0.009608076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886497,0.002532762,0.0011152175,0.0020758044,0.0045536812,0.0010726855],"domain_scores_gemma":[0.8172253,0.16346498,0.0047398624,0.009091857,0.0038093838,0.0016687831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055331807,0.0014514682,0.0038580399,0.0037676056,0.0026446246,0.0090950355,0.005657472,0.0041899662,0.014817407],"category_scores_gemma":[0.07686041,0.001399369,0.002431808,0.009220825,0.0044569448,0.023567,0.0069135907,0.0046889964,0.0018041254],"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.0061791004,0.000856752,0.017621541,0.0019674657,0.0005411471,0.0011228698,0.002321393,0.35793012,0.008853751,0.19517924,0.035073765,0.37235284],"study_design_scores_gemma":[0.00029962318,0.00016271131,0.0016029003,0.0000793158,0.00018184836,0.00062705594,0.00061479124,0.64718956,0.0027810899,0.34343582,0.0029644754,0.000060824495],"about_ca_topic_score_codex":0.006744414,"about_ca_topic_score_gemma":0.007841233,"teacher_disagreement_score":0.014817407,"about_ca_system_score_codex":0.0044560432,"about_ca_system_score_gemma":0.0038666606,"threshold_uncertainty_score":0.04956919},"labels":[],"label_agreement":null},{"id":"W2063737596","doi":"10.1016/j.tcs.2011.12.048","title":"State complexity of the concatenation of regular tree languages","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Regular language; Pumping lemma for regular languages; String (physics); Tree (set theory); Mathematics; Automaton; Combinatorics; State (computer science); Discrete mathematics; Formal language; Time complexity; Finite-state machine; Upper and lower bounds; Computer science; Algorithm; Theoretical computer science","score_opus":0.02546993447421071,"score_gpt":0.24267921759233238,"score_spread":0.21720928311812168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063737596","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.89953065,0.00036005932,0.08822673,0.0012409833,0.00004118201,0.00004840816,0.0009868972,0.00039977967,0.009165324],"genre_scores_gemma":[0.9896493,0.00013263444,0.0069707856,0.000047324433,0.00006762821,0.00005505254,0.00067146576,0.00007682663,0.0023290948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996819,0.00082227046,0.00028221725,0.0005473888,0.0010512236,0.0004779244],"domain_scores_gemma":[0.9522783,0.039947346,0.0025600002,0.0021049213,0.0017900133,0.0013194502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020935824,0.00039071485,0.0013859853,0.0014252722,0.0015058604,0.0061185663,0.0016247265,0.0014773766,0.0070066117],"category_scores_gemma":[0.019327274,0.0007513343,0.0012013047,0.0015345928,0.0023522791,0.011573947,0.0024514252,0.0025719835,0.00055102195],"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.0011855246,0.0002365818,0.008261061,0.00025925928,0.00009944657,0.0005631427,0.002062264,0.09347164,0.009153043,0.8617621,0.0022811522,0.02066472],"study_design_scores_gemma":[0.00004801303,0.000082000784,0.0017275398,0.00001994585,0.000048499234,0.00013903782,0.00018175361,0.31783065,0.003353207,0.67574483,0.000775616,0.000048941845],"about_ca_topic_score_codex":0.0019993866,"about_ca_topic_score_gemma":0.001977363,"teacher_disagreement_score":0.0070066117,"about_ca_system_score_codex":0.0023205634,"about_ca_system_score_gemma":0.0018214266,"threshold_uncertainty_score":0.023439467},"labels":[],"label_agreement":null},{"id":"W2063972032","doi":"10.1016/j.tcs.2004.09.035","title":"A behavioural pseudometric for probabilistic transition systems","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Probabilistic logic; Mathematics; Coalgebra; Functor; Equivalence (formal languages); Metric space; Modal logic; Discrete mathematics; Metric (unit); Algebra over a field; Pure mathematics; Modal; Statistics","score_opus":0.019719505836628813,"score_gpt":0.24980407481604147,"score_spread":0.23008456897941265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063972032","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.03471328,0.0005471348,0.94939977,0.002437674,0.0003931813,0.00011961817,0.00045562163,0.00041513058,0.011518535],"genre_scores_gemma":[0.57222015,0.0014481655,0.40350783,0.0011864371,0.0018875898,0.0010670158,0.0015208462,0.0004972063,0.016664647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98961747,0.003708705,0.0010694483,0.0019325468,0.0029724669,0.0006994571],"domain_scores_gemma":[0.9729859,0.014632402,0.0022686666,0.0025180604,0.0042998795,0.0032951818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007874497,0.0010209093,0.0015193454,0.004270452,0.002471063,0.005357291,0.0029806131,0.002943746,0.0060750344],"category_scores_gemma":[0.03580166,0.00088846585,0.0022899723,0.0036730657,0.0053165685,0.014862998,0.006914367,0.007152298,0.0012542874],"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.00004571658,0.000035745576,0.00037718326,0.000062157356,0.000010187857,0.00003801078,0.0002047125,0.0021903035,0.00073153997,0.9836802,0.0008987761,0.011725448],"study_design_scores_gemma":[0.000019182584,0.00009754345,0.00036419358,0.00003306088,0.000017153752,0.00016740263,0.000073833224,0.040309306,0.00063599885,0.95261526,0.0056276596,0.00003943428],"about_ca_topic_score_codex":0.0011699019,"about_ca_topic_score_gemma":0.00073778146,"teacher_disagreement_score":0.007874497,"about_ca_system_score_codex":0.0029225077,"about_ca_system_score_gemma":0.002483765,"threshold_uncertainty_score":0.04164487},"labels":[],"label_agreement":null},{"id":"W2063991224","doi":"10.1016/s0304-3975(01)00152-9","title":"Lower bounds for invariant queries in logics with counting","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Preorder; Unary operation; Locality; Transitive closure; Mathematics; Discrete mathematics; Complexity class; Expressive power; First-order logic; Binary relation; Transitive relation; Second-order logic; Succinctness; Invariant (physics); Proof theory; Combinatorics; Time complexity; Higher-order logic; Computer science; Mathematical proof; Theoretical computer science; Description logic","score_opus":0.022308949309105132,"score_gpt":0.23628980476978478,"score_spread":0.21398085546067966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063991224","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.08792121,0.010151862,0.7637694,0.03828401,0.0014996099,0.0008676043,0.004355214,0.0069207083,0.08623037],"genre_scores_gemma":[0.71040195,0.007124416,0.21769565,0.0126434835,0.007378161,0.0019803497,0.008350865,0.0073119276,0.02711325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.93068725,0.01777509,0.0038920606,0.010031134,0.022231974,0.01538245],"domain_scores_gemma":[0.57469785,0.3710812,0.00829072,0.025038641,0.010490697,0.010400945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03695344,0.006875473,0.0106745,0.015188629,0.0094334725,0.03565769,0.022810888,0.011151626,0.037248965],"category_scores_gemma":[0.19861214,0.0060212836,0.009559476,0.019220905,0.017259471,0.09404856,0.022729935,0.031895306,0.005980928],"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.003483757,0.0013125732,0.004732781,0.0015324315,0.0005090221,0.00030813395,0.0016917324,0.059736315,0.0032655073,0.8157648,0.033326454,0.07433649],"study_design_scores_gemma":[0.00019199331,0.00009780898,0.00043915617,0.00015678455,0.00035927104,0.00016030128,0.00022208536,0.1356379,0.0018437336,0.85785025,0.002942232,0.00009850121],"about_ca_topic_score_codex":0.0064356746,"about_ca_topic_score_gemma":0.009827159,"teacher_disagreement_score":0.037248965,"about_ca_system_score_codex":0.025024887,"about_ca_system_score_gemma":0.012108693,"threshold_uncertainty_score":0.19543076},"labels":[],"label_agreement":null},{"id":"W2064666203","doi":"10.1016/j.tcs.2013.09.034","title":"Safe recursion revisited I: Categorical semantics for lower complexity","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Western University","funders":"","keywords":"Soundness; Mathematics; Bounded function; Categorical variable; Recursion (computer science); Polynomial; Semantics (computer science); Set (abstract data type); Discrete mathematics; Computer science; Algorithm; Programming language; Statistics","score_opus":0.02868647565985513,"score_gpt":0.26988549818003504,"score_spread":0.2411990225201799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064666203","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.0495478,0.0031448905,0.84800947,0.017060123,0.0009798668,0.00007593015,0.00056253566,0.001088076,0.07953131],"genre_scores_gemma":[0.8350912,0.0013865284,0.13414977,0.0038879162,0.0016299434,0.00030243248,0.00048059883,0.00082586706,0.02224581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945738,0.0015623078,0.0003475199,0.0010212911,0.0018047449,0.0006904256],"domain_scores_gemma":[0.98825014,0.0066454476,0.0005225774,0.002473179,0.0013939502,0.00071470096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045718807,0.0006883643,0.0013479918,0.0022241296,0.0026918692,0.00808667,0.0037287273,0.0033765128,0.01232545],"category_scores_gemma":[0.014409649,0.00066626305,0.002892791,0.0027698774,0.011200056,0.02346239,0.0062669646,0.013069334,0.0014283756],"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.000006790296,0.0000050246254,0.000047945563,0.00001329866,0.0000020055927,0.0000071895133,0.000107341206,0.00017768194,0.000120277684,0.9977451,0.0004464692,0.0013209352],"study_design_scores_gemma":[0.000005594674,0.0000047982703,0.00004163344,0.000007941684,0.000004431753,0.000015222078,0.000040308056,0.0013481037,0.0001929649,0.99601233,0.0023200628,0.000006620886],"about_ca_topic_score_codex":0.0021196553,"about_ca_topic_score_gemma":0.0018367157,"teacher_disagreement_score":0.01232545,"about_ca_system_score_codex":0.005731456,"about_ca_system_score_gemma":0.0022351334,"threshold_uncertainty_score":0.04158479},"labels":[],"label_agreement":null},{"id":"W2064871734","doi":"10.1016/j.tcs.2006.06.017","title":"Deterministic M2M multicast in radio networks","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":25,"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 en Outaouais; Carleton University","funders":"","keywords":"Multicast; Computer network; Computer science; Node (physics); Graph; Source-specific multicast; Distributed computing; Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.007809796145720538,"score_gpt":0.24408707871843138,"score_spread":0.23627728257271086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064871734","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.14633948,0.0019461899,0.8360623,0.002743203,0.00020057734,0.00015556383,0.00045443466,0.0005136119,0.011584555],"genre_scores_gemma":[0.91091764,0.0006000276,0.082368545,0.0003354632,0.00020751344,0.00021057014,0.0001617518,0.000106581574,0.005091795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975963,0.0012672294,0.000079604804,0.00031774913,0.00036116602,0.00037793643],"domain_scores_gemma":[0.9861501,0.011156782,0.0009082582,0.00085964444,0.00048405057,0.00044114434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003337578,0.00084704097,0.0020183183,0.0009164298,0.0017808777,0.0017029723,0.002395176,0.0029775556,0.002810776],"category_scores_gemma":[0.01726443,0.0012512036,0.0007747403,0.0015394893,0.0017994497,0.0029585117,0.0027233763,0.0014974581,0.00035876108],"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.0005708638,0.000092758,0.00093549764,0.00025044897,0.00005505413,0.00010951255,0.00011979874,0.8675716,0.0010333918,0.10192303,0.005453695,0.021884404],"study_design_scores_gemma":[0.00005412152,0.00004569697,0.00014438572,0.000012755801,0.00001554288,0.00003983473,0.000027245016,0.9366598,0.00027346474,0.061981495,0.000734793,0.0000109177245],"about_ca_topic_score_codex":0.002648243,"about_ca_topic_score_gemma":0.0036627634,"teacher_disagreement_score":0.003337578,"about_ca_system_score_codex":0.0025731202,"about_ca_system_score_gemma":0.001267629,"threshold_uncertainty_score":0.018669367},"labels":[],"label_agreement":null},{"id":"W2065415255","doi":"10.1016/j.tcs.2014.06.014","title":"H-coloring degree-bounded (acyclic) digraphs","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bounded function; Degree (music); Homomorphism; Conjecture; Upper and lower bounds; Discrete mathematics; Time complexity; Physics","score_opus":0.024553383233821717,"score_gpt":0.2900484033323826,"score_spread":0.26549502009856085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065415255","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.49953592,0.00050436467,0.419744,0.0018703819,0.00022426459,0.00028676886,0.0058597196,0.0014219591,0.07055264],"genre_scores_gemma":[0.887519,0.00038785566,0.08833804,0.00057972287,0.000091392154,0.0001624201,0.0028671967,0.0001643928,0.019889995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942386,0.00013723363,0.000027844244,0.00016141936,0.00008854741,0.00016107368],"domain_scores_gemma":[0.99421704,0.0032666444,0.00034369863,0.0007494472,0.0006074347,0.00081574346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005289188,0.00052113633,0.0005243434,0.0007929923,0.0009808672,0.0016961019,0.0014184173,0.0007204586,0.010755712],"category_scores_gemma":[0.0032124615,0.0004672113,0.0004063228,0.0012372619,0.00077944,0.0015690178,0.0010577162,0.0011652408,0.0009824366],"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.0007956618,0.000402137,0.005764487,0.0005937913,0.00009585472,0.0008340302,0.00069946767,0.06913441,0.020511044,0.8047536,0.024619304,0.071796186],"study_design_scores_gemma":[0.00016430844,0.00011038577,0.0021131583,0.000058975016,0.00005815368,0.0005511241,0.00040766952,0.13031007,0.007979563,0.8433712,0.014835801,0.000039467508],"about_ca_topic_score_codex":0.0026639374,"about_ca_topic_score_gemma":0.0054734754,"teacher_disagreement_score":0.010755712,"about_ca_system_score_codex":0.0012071242,"about_ca_system_score_gemma":0.0009265291,"threshold_uncertainty_score":0.035981476},"labels":[],"label_agreement":null},{"id":"W2065444014","doi":"10.1016/j.tcs.2007.11.016","title":"The Magnus–Derek game","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Waterloo","keywords":"Security token; Combinatorial game theory; Mathematical game; Set (abstract data type); Mathematics; Game tree; Computer science; Repeated game; Combinatorics; Game theory; Mathematical economics; Simultaneous game; Computer network","score_opus":0.009851086488203221,"score_gpt":0.26878522570535635,"score_spread":0.25893413921715314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065444014","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.17394763,0.0018334314,0.49664658,0.015221774,0.000650588,0.00021203095,0.00041189796,0.00022432915,0.31085175],"genre_scores_gemma":[0.89140135,0.00089378504,0.03414862,0.0008733121,0.00022722945,0.00018253353,0.00012352286,0.000068907764,0.072080694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894255,0.00051365985,0.00003818723,0.00012157933,0.00021718157,0.00016676189],"domain_scores_gemma":[0.99823403,0.0011514551,0.000096522104,0.00014057686,0.00012365455,0.00025376817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014868092,0.0007556162,0.0010906165,0.0006536785,0.0011681442,0.0026779682,0.0015071321,0.0023495806,0.010878653],"category_scores_gemma":[0.007857473,0.00033463252,0.000458682,0.00052266975,0.0025504576,0.0043798657,0.0022166977,0.0025151789,0.000899689],"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.0000617323,0.000017080496,0.00009804635,0.000024630204,0.000009535346,0.000040793955,0.000058999765,0.006305681,0.00028589406,0.9839061,0.0027288243,0.006462574],"study_design_scores_gemma":[0.000030053761,0.000020437403,0.000075612596,0.000010988246,0.0000054001594,0.000052809617,0.00003747474,0.049162447,0.00017067732,0.94630045,0.004122359,0.000011337267],"about_ca_topic_score_codex":0.0020889959,"about_ca_topic_score_gemma":0.0016039822,"teacher_disagreement_score":0.010878653,"about_ca_system_score_codex":0.0016189928,"about_ca_system_score_gemma":0.0015223961,"threshold_uncertainty_score":0.03639269},"labels":[],"label_agreement":null},{"id":"W2065463697","doi":"10.1016/j.tcs.2004.02.005","title":"The number of binary words avoiding abelian fourth powers grows exponentially","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Exponential growth; Binary number; Abelian group; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.00792064906453805,"score_gpt":0.24223702468757136,"score_spread":0.2343163756230333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065463697","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.7242743,0.002857546,0.12878352,0.011260673,0.0015514191,0.0001522728,0.0012636197,0.0017135689,0.12814307],"genre_scores_gemma":[0.9088398,0.0023889914,0.034128714,0.0016938999,0.0015232448,0.00046231732,0.0014100581,0.0006598692,0.048893005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980882,0.00042074407,0.00010165629,0.0003684007,0.0006754609,0.00034554157],"domain_scores_gemma":[0.97977865,0.01500271,0.0012876551,0.001943339,0.0012728433,0.0007147007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001322591,0.001103703,0.0016988396,0.0022066578,0.001807412,0.0045036785,0.0022923367,0.003242249,0.011479961],"category_scores_gemma":[0.015620419,0.0010575227,0.0010401079,0.0015316001,0.003775661,0.011379355,0.0030152847,0.004097389,0.0032943757],"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.0006176686,0.00015805388,0.0023355654,0.00063135935,0.00008008658,0.00038878265,0.00036699002,0.007691692,0.022371667,0.91221166,0.011397649,0.041748956],"study_design_scores_gemma":[0.00010126104,0.00008781834,0.0017790748,0.00012456936,0.00007811618,0.0012710182,0.00015690197,0.03723992,0.015332913,0.92981935,0.013937827,0.00007121465],"about_ca_topic_score_codex":0.00016304317,"about_ca_topic_score_gemma":0.00019768352,"teacher_disagreement_score":0.011479961,"about_ca_system_score_codex":0.0010752871,"about_ca_system_score_gemma":0.0007775394,"threshold_uncertainty_score":0.038404346},"labels":[],"label_agreement":null},{"id":"W2065887199","doi":"10.1016/j.tcs.2010.06.009","title":"The surviving rate of an infected network","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Integer (computer science); Discrete mathematics; Physics; Computer science; Graph; Operating system","score_opus":0.004482338258743271,"score_gpt":0.2509630541180462,"score_spread":0.24648071585930292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065887199","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.8376968,0.0005125422,0.15256074,0.0012864333,0.00014294997,0.00007429569,0.0006848057,0.00035660842,0.006684836],"genre_scores_gemma":[0.9823254,0.00058595446,0.009386245,0.00008351862,0.00013792445,0.0000633631,0.0004097052,0.00008817808,0.00691964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992021,0.00024587387,0.00004583719,0.00015077587,0.00022445152,0.00013106706],"domain_scores_gemma":[0.98468244,0.009212246,0.0018165134,0.0011867362,0.0017855059,0.0013165853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002525576,0.0004256703,0.00076626573,0.0024635037,0.0007851514,0.0014950837,0.001989224,0.0016507675,0.0044432194],"category_scores_gemma":[0.02061556,0.00034815422,0.0004747735,0.0009814836,0.0011720994,0.003667885,0.0010394878,0.0011686238,0.00070213963],"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.0005533581,0.00023529016,0.045411166,0.00059843133,0.00024169564,0.0011197106,0.002074936,0.36403796,0.033787284,0.48240584,0.0070167,0.06251767],"study_design_scores_gemma":[0.000030901287,0.00016617052,0.0069755833,0.0000557795,0.00011044436,0.0012804534,0.00043139147,0.8887855,0.0052924114,0.0944386,0.002359381,0.00007342559],"about_ca_topic_score_codex":0.00087822694,"about_ca_topic_score_gemma":0.00048311628,"teacher_disagreement_score":0.0044432194,"about_ca_system_score_codex":0.0007112727,"about_ca_system_score_gemma":0.00040969008,"threshold_uncertainty_score":0.014864087},"labels":[],"label_agreement":null},{"id":"W2066234959","doi":"10.1016/j.tcs.2012.11.022","title":"Exploring an unknown dangerous graph using tokens","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"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":"Computer science; Graph; Theoretical computer science; Combinatorics; Mathematics; Algorithm","score_opus":0.1472886519647449,"score_gpt":0.3144289435516493,"score_spread":0.1671402915869044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066234959","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.33285075,0.00026986477,0.65176326,0.0014227352,0.00014357803,0.00015805004,0.0005507815,0.0010710614,0.011769984],"genre_scores_gemma":[0.6962088,0.00019441464,0.2974703,0.00011852828,0.0000316372,0.000084889005,0.0004325792,0.00032286352,0.0051359474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968386,0.00009317908,0.000013654721,0.00008570619,0.00006957585,0.00005396634],"domain_scores_gemma":[0.9982216,0.0012219528,0.000114402115,0.00020010374,0.00009708089,0.0001448902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005563754,0.00059528137,0.00078609097,0.0011501433,0.0012974828,0.0011136169,0.001786147,0.0015352543,0.006043886],"category_scores_gemma":[0.00393998,0.0005496956,0.0012199251,0.0008973804,0.0015873391,0.004110866,0.0024137166,0.0014867818,0.0004732758],"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.001160055,0.00029033117,0.00672129,0.00057936664,0.00012925481,0.0023036944,0.0008159244,0.5207368,0.012261746,0.35024777,0.0060801585,0.09867351],"study_design_scores_gemma":[0.000039580285,0.00009353276,0.00022509099,0.000036979858,0.000045219396,0.00020447854,0.0002343808,0.78843665,0.0028418587,0.20483905,0.002981583,0.000021528891],"about_ca_topic_score_codex":0.0033183077,"about_ca_topic_score_gemma":0.005712531,"teacher_disagreement_score":0.006043886,"about_ca_system_score_codex":0.00073750556,"about_ca_system_score_gemma":0.0010256598,"threshold_uncertainty_score":0.02021879},"labels":[],"label_agreement":null},{"id":"W2066849493","doi":"10.1016/j.tcs.2010.11.009","title":"Block insertion and deletion on trajectories","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Block (permutation group theory); Arithmetic; Mathematics; Algorithm; Combinatorics; Computer science","score_opus":0.005196956732381941,"score_gpt":0.21990452062673832,"score_spread":0.21470756389435638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066849493","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.26564685,0.000514026,0.6920134,0.0007554597,0.000304532,0.00016310297,0.0010622037,0.0012487168,0.03829171],"genre_scores_gemma":[0.7816876,0.000919446,0.13377991,0.00017388185,0.00013489445,0.00031749625,0.0015305699,0.000734505,0.0807217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879515,0.00018348974,0.00008997924,0.00028779576,0.0003721833,0.00027137506],"domain_scores_gemma":[0.996793,0.0013023699,0.00032058204,0.00075226015,0.0005396057,0.00029218348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066857366,0.00052808033,0.0008898795,0.0011344731,0.0017309488,0.0018585322,0.0013615543,0.0013486268,0.0135195125],"category_scores_gemma":[0.005208965,0.00047040405,0.00096824486,0.0018029081,0.0020193686,0.0053004017,0.0024443076,0.0014644524,0.0026853255],"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.00024637766,0.000032984648,0.0006231937,0.00007797276,0.000010699749,0.00043953813,0.0006418934,0.0075583165,0.008732873,0.9560971,0.001412678,0.024126403],"study_design_scores_gemma":[0.00003919453,0.00006995581,0.00042245563,0.000030948555,0.000023930865,0.00042131176,0.0004170376,0.04253739,0.013097642,0.9264849,0.016421052,0.000034188648],"about_ca_topic_score_codex":0.0020440503,"about_ca_topic_score_gemma":0.0013763432,"teacher_disagreement_score":0.0135195125,"about_ca_system_score_codex":0.0011215786,"about_ca_system_score_gemma":0.0010629775,"threshold_uncertainty_score":0.04522729},"labels":[],"label_agreement":null},{"id":"W2068568045","doi":"10.1016/j.tcs.2009.05.031","title":"Size-constrained tree partitioning: Approximating the multicast<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-tree routing problem","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multicast; Tree (set theory); Routing (electronic design automation); Computer science; Node (physics); Algorithm; Steiner tree problem; Mathematics; Discrete mathematics; Combinatorics; Computer network","score_opus":0.01088862861760366,"score_gpt":0.22809246227566016,"score_spread":0.2172038336580565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068568045","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.08611845,0.0011613907,0.8956257,0.0012046243,0.00012419726,0.00010332385,0.00057428726,0.0005509481,0.0145370085],"genre_scores_gemma":[0.5383459,0.0008538981,0.45106953,0.00035364667,0.00014867506,0.00023065091,0.0011294611,0.0004595584,0.007408682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995733,0.00018317565,0.000012166531,0.000057284116,0.00010278075,0.00007125419],"domain_scores_gemma":[0.9978999,0.0015403015,0.000114887895,0.0001643336,0.00017422064,0.00010633432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014408255,0.00084755686,0.0008972137,0.00076837314,0.00046205884,0.00093656254,0.0017551366,0.0014590666,0.0043032006],"category_scores_gemma":[0.008085232,0.0004934229,0.0005738477,0.0010476925,0.00060728705,0.0020120966,0.0011162402,0.0012260088,0.00063426327],"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.000276707,0.00007826667,0.0006768782,0.0001760352,0.00002840606,0.00007368955,0.000111707115,0.89932984,0.0014449733,0.034602065,0.012121047,0.051080484],"study_design_scores_gemma":[0.000015864136,0.00001985193,0.000070298294,0.000011408988,0.000005037121,0.000019503917,0.00001712571,0.9861298,0.00021238107,0.012932142,0.00056426873,0.000002392617],"about_ca_topic_score_codex":0.007748044,"about_ca_topic_score_gemma":0.0075676264,"teacher_disagreement_score":0.007748044,"about_ca_system_score_codex":0.0014854932,"about_ca_system_score_gemma":0.0011399584,"threshold_uncertainty_score":0.015405893},"labels":[],"label_agreement":null},{"id":"W2068825173","doi":"10.1016/j.tcs.2010.12.065","title":"Fast edge searching and fast searching on graphs","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Search problem; Mathematics; Combinatorics; Graph; Enhanced Data Rates for GSM Evolution; Search algorithm; Discrete mathematics; Computer science; Algorithm; Artificial intelligence","score_opus":0.027501399335166436,"score_gpt":0.2653047214923998,"score_spread":0.23780332215723338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068825173","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.062495932,0.003948228,0.9192044,0.0012934407,0.0002560507,0.000121742836,0.00042951878,0.0009829112,0.011267709],"genre_scores_gemma":[0.30928215,0.0029748748,0.6696381,0.0005310697,0.00027601988,0.00031935022,0.00095120794,0.0006243689,0.01540293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861586,0.0005376798,0.00006705616,0.00025331456,0.00035794076,0.00016816314],"domain_scores_gemma":[0.98938876,0.00817019,0.00042179102,0.0011506836,0.0006091306,0.0002594341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019341193,0.0011161817,0.0018251975,0.0025626987,0.0011560704,0.001988129,0.0024163509,0.0023230345,0.008198333],"category_scores_gemma":[0.016192606,0.000966373,0.0011671243,0.004263592,0.001784942,0.007873406,0.0025575515,0.0031084511,0.0009777122],"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.0012047103,0.00018550563,0.0012011094,0.0009949929,0.00012439166,0.0001534077,0.00036888896,0.31725746,0.0054081245,0.41490537,0.019601002,0.23859508],"study_design_scores_gemma":[0.0001347749,0.00009673815,0.00031602426,0.000058190013,0.000046576963,0.00012277858,0.000063855674,0.49259454,0.0018963789,0.499658,0.0049848235,0.000027388889],"about_ca_topic_score_codex":0.0024113676,"about_ca_topic_score_gemma":0.0022838505,"teacher_disagreement_score":0.008198333,"about_ca_system_score_codex":0.001038449,"about_ca_system_score_gemma":0.0010353792,"threshold_uncertainty_score":0.027426124},"labels":[],"label_agreement":null},{"id":"W2069082489","doi":"10.1016/j.tcs.2011.04.037","title":"Evolving schemas for streaming XML","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Streaming XML; Programming language; XML; Theoretical computer science; World Wide Web","score_opus":0.02430770528093338,"score_gpt":0.25787714938655976,"score_spread":0.23356944410562638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069082489","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.037142675,0.0007949173,0.9443012,0.001123718,0.00023408701,0.0002843702,0.0020943373,0.007832844,0.006191879],"genre_scores_gemma":[0.19703002,0.00090935157,0.78379023,0.00033880016,0.000104306644,0.00025442895,0.006877835,0.0019298729,0.008765175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972473,0.00064654835,0.00042656445,0.00047049575,0.0010577072,0.00015147006],"domain_scores_gemma":[0.9902956,0.0037268042,0.0004246448,0.003459734,0.0016999308,0.00039324473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051269266,0.0005214693,0.0007795447,0.001677268,0.0010462542,0.0037515836,0.0033378873,0.0016927063,0.006830936],"category_scores_gemma":[0.021332158,0.0009788987,0.0011888162,0.0024708374,0.0012301116,0.009099382,0.0035434715,0.0024049995,0.0016914246],"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.0007362875,0.00027445203,0.004815293,0.0004596393,0.000120537814,0.00074750226,0.0021621631,0.053271335,0.012926713,0.5491608,0.025858795,0.3494666],"study_design_scores_gemma":[0.00014154361,0.00013523328,0.00077537645,0.0001722653,0.00012722383,0.0007058745,0.00065160525,0.4905305,0.022242647,0.39050516,0.093917094,0.00009556089],"about_ca_topic_score_codex":0.004122083,"about_ca_topic_score_gemma":0.0047286227,"teacher_disagreement_score":0.006830936,"about_ca_system_score_codex":0.001718928,"about_ca_system_score_gemma":0.0013113499,"threshold_uncertainty_score":0.027114093},"labels":[],"label_agreement":null},{"id":"W2069229408","doi":"10.1016/j.tcs.2011.12.018","title":"Coloring vertices of a graph or finding a Meyniel obstruction","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Graph factorization; Graph power; Discrete mathematics; Graph coloring; Line graph","score_opus":0.05662253399805527,"score_gpt":0.3083479634721874,"score_spread":0.2517254294741321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069229408","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.43455717,0.00076674635,0.40461448,0.0075223492,0.001052845,0.0002732909,0.0006921062,0.0019437709,0.14857726],"genre_scores_gemma":[0.8334249,0.00044308574,0.119632445,0.001093704,0.00018140882,0.0001227196,0.0005514659,0.0004760462,0.044074122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994948,0.000108318665,0.000020016483,0.00013061476,0.00007574037,0.00017049925],"domain_scores_gemma":[0.99932706,0.00031948526,0.00005711625,0.00015108279,0.000048320093,0.000096920914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045631005,0.0006875952,0.0009002523,0.0007696277,0.0022577732,0.001739409,0.0010366194,0.0017356426,0.013053143],"category_scores_gemma":[0.0025270467,0.00039784407,0.00084835675,0.0007270426,0.0019054881,0.0034993405,0.003102989,0.002275863,0.0016385807],"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.00045373186,0.00010238641,0.0014527175,0.0002900421,0.00004399601,0.0005324558,0.0007709631,0.006689913,0.007448344,0.9189886,0.013363847,0.049862955],"study_design_scores_gemma":[0.00006747355,0.0000739283,0.0004900435,0.00004041544,0.00004307818,0.00024402239,0.00050263567,0.012939283,0.005004057,0.95804197,0.022517532,0.000035556874],"about_ca_topic_score_codex":0.001318096,"about_ca_topic_score_gemma":0.0018768053,"teacher_disagreement_score":0.013053143,"about_ca_system_score_codex":0.00081777223,"about_ca_system_score_gemma":0.0008261506,"threshold_uncertainty_score":0.043667138},"labels":[],"label_agreement":null},{"id":"W2069939081","doi":"10.1016/j.tcs.2013.11.023","title":"UNO is hard, even for a single player","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Mattel","keywords":"Simple (philosophy); Computer science; Combinatorial game theory; Mathematical economics; Theoretical computer science; Computational complexity theory; Game theory; Repeated game; Mathematics; Algorithm","score_opus":0.032638003009175416,"score_gpt":0.2799198894126399,"score_spread":0.2472818864034645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069939081","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.32469884,0.0016020369,0.1979077,0.028533036,0.003715541,0.0010859526,0.0069288104,0.0033154336,0.4322127],"genre_scores_gemma":[0.8495723,0.00097071513,0.05689277,0.0028855095,0.0005728094,0.00055421045,0.004447801,0.0009472299,0.083156675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743867,0.0005075996,0.00016701451,0.00067066407,0.00032359408,0.0008924509],"domain_scores_gemma":[0.983906,0.010566173,0.00077357277,0.0019356746,0.0008928098,0.0019258272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016235164,0.0020591796,0.0027064711,0.00074035925,0.003939669,0.0051234765,0.0024545535,0.004219507,0.03920636],"category_scores_gemma":[0.018144023,0.0008964946,0.0016790887,0.0009183935,0.002229689,0.010878135,0.0054153996,0.0046286792,0.0060726823],"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.0053186943,0.0021682088,0.009139973,0.0033587608,0.00052765413,0.002484797,0.001462646,0.0541027,0.01248265,0.53458965,0.17084387,0.20352031],"study_design_scores_gemma":[0.0002404865,0.00025405307,0.0014017177,0.00024678983,0.00009047515,0.00060133927,0.0014960027,0.061868615,0.002879883,0.90782607,0.023026055,0.000068452944],"about_ca_topic_score_codex":0.0020783392,"about_ca_topic_score_gemma":0.0036160338,"teacher_disagreement_score":0.03920636,"about_ca_system_score_codex":0.0008782943,"about_ca_system_score_gemma":0.002345174,"threshold_uncertainty_score":0.13115835},"labels":[],"label_agreement":null},{"id":"W2069969963","doi":"10.1016/s0304-3975(01)00245-6","title":"Restriction categories II: partial map classification","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Subcategory; Monad (category theory); Classifier (UML); Partial derivative; Algebraic number; Artificial intelligence; Computer science; Pure mathematics; Functor","score_opus":0.032646085677826904,"score_gpt":0.304483170689957,"score_spread":0.2718370850121301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069969963","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.16371587,0.009004716,0.45517284,0.0126182595,0.0025009627,0.00025591094,0.0031009535,0.0019841653,0.35164633],"genre_scores_gemma":[0.8301725,0.0045436556,0.059190154,0.0019514094,0.0031519376,0.00041847266,0.0042064064,0.00051775645,0.095847815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915564,0.00018599724,0.00004478948,0.00025513352,0.00024603907,0.000112409434],"domain_scores_gemma":[0.9987961,0.00046459952,0.0001095475,0.00026127818,0.00022197454,0.00014648789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007711944,0.0005386421,0.0008555325,0.0020995692,0.0015803117,0.004307833,0.0011588598,0.0011933197,0.01821128],"category_scores_gemma":[0.0029254616,0.00043224482,0.00061570626,0.002814253,0.002747174,0.009023383,0.0029174238,0.0033599173,0.0029745402],"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.00001748192,0.000014243663,0.00028401363,0.000076739394,0.0000058968594,0.00002463409,0.00017330157,0.00015688283,0.00037985912,0.97707206,0.0071061566,0.014688843],"study_design_scores_gemma":[0.000006512615,0.0000108512595,0.00039911995,0.000019480978,0.000009456462,0.00014814432,0.000087173066,0.0012616314,0.0005191289,0.97252685,0.025002772,0.00000891518],"about_ca_topic_score_codex":0.00080485555,"about_ca_topic_score_gemma":0.00031788863,"teacher_disagreement_score":0.01821128,"about_ca_system_score_codex":0.0011006146,"about_ca_system_score_gemma":0.00064971304,"threshold_uncertainty_score":0.0609228},"labels":[],"label_agreement":null},{"id":"W2070526994","doi":"10.1016/j.tcs.2008.02.035","title":"Time constrained graph searching","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Visibility; Computer science; Graph; Combinatorics; Theoretical computer science; Mathematics; Geography","score_opus":0.015721146206224182,"score_gpt":0.2531572785783627,"score_spread":0.2374361323721385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070526994","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.03732021,0.0017285076,0.874756,0.002894863,0.0004322349,0.0002585767,0.0010181064,0.0015714942,0.0800201],"genre_scores_gemma":[0.44335914,0.0010001839,0.49502218,0.00089564244,0.00027159022,0.00040010636,0.0018989053,0.0011807033,0.055971585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987903,0.0003903953,0.00004151595,0.00032101863,0.0002963941,0.00016037397],"domain_scores_gemma":[0.9965354,0.0023350494,0.00017726338,0.0005480022,0.0002212091,0.00018309818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009357677,0.0010505094,0.0016388451,0.0012334484,0.0009525846,0.0020214624,0.002457134,0.0019988033,0.035436947],"category_scores_gemma":[0.0075065233,0.00067239674,0.0009778333,0.0027696313,0.0011798509,0.0040445165,0.0019140133,0.0026028014,0.002663911],"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.0009539232,0.00041475377,0.0006967234,0.000626716,0.00012803679,0.00019791872,0.00023496841,0.3616204,0.0041006664,0.3053722,0.057110332,0.26854333],"study_design_scores_gemma":[0.00013126484,0.00008708313,0.0002946569,0.000035948593,0.000043918968,0.000113390044,0.00006147285,0.7722383,0.0017821363,0.21399389,0.011201063,0.000016848766],"about_ca_topic_score_codex":0.0051128343,"about_ca_topic_score_gemma":0.007527255,"teacher_disagreement_score":0.035436947,"about_ca_system_score_codex":0.0016229484,"about_ca_system_score_gemma":0.0018484294,"threshold_uncertainty_score":0.11854845},"labels":[],"label_agreement":null},{"id":"W2070767505","doi":"10.1016/s0304-3975(01)00375-9","title":"PSPACE has constant-round quantum interactive proof systems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"PSPACE; Gas meter prover; Computer-assisted proof; Constant (computer programming); Computer science; Quantum computer; Proof complexity; Mathematics; Proof assistant; Quantum; Discrete mathematics; Theoretical computer science; Automated theorem proving; Algorithm; Mathematical proof; Computational complexity theory; Quantum mechanics; Programming language; Physics; Geometry","score_opus":0.012780086443295102,"score_gpt":0.24749018085049437,"score_spread":0.23471009440719928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070767505","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.14325294,0.0011463697,0.68096745,0.007976549,0.0003488746,0.0004320748,0.0023308902,0.005948422,0.1575965],"genre_scores_gemma":[0.8977663,0.00065140106,0.063047014,0.001008399,0.0002991455,0.00033575794,0.0010612119,0.00089954055,0.034931242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99433255,0.0011690389,0.00029416874,0.0013359656,0.0017291171,0.0011391274],"domain_scores_gemma":[0.9749467,0.016254494,0.0010782862,0.004792738,0.0017633094,0.0011644064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034858899,0.0014306736,0.0021293287,0.0013763366,0.0045706523,0.008791039,0.003929468,0.0029815559,0.026530527],"category_scores_gemma":[0.016585788,0.0023063088,0.0021007925,0.0026207268,0.005002581,0.018971782,0.0069714794,0.008930879,0.003938201],"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.0004126964,0.00007566966,0.00038333135,0.00018654765,0.000054267603,0.00008681977,0.0003536319,0.0069458494,0.0013634583,0.9761485,0.0049249106,0.009064349],"study_design_scores_gemma":[0.00011221472,0.000022229418,0.00016730552,0.000016246198,0.000042819815,0.00006098844,0.00004333964,0.01639152,0.0024108163,0.97663784,0.0040655863,0.000029038201],"about_ca_topic_score_codex":0.0031369328,"about_ca_topic_score_gemma":0.0034581874,"teacher_disagreement_score":0.026530527,"about_ca_system_score_codex":0.0042888005,"about_ca_system_score_gemma":0.0042387843,"threshold_uncertainty_score":0.08875346},"labels":[],"label_agreement":null},{"id":"W2072044129","doi":"10.1016/j.tcs.2010.04.041","title":"Reconstructing <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>h</mml:mi><mml:mi>v</mml:mi></mml:math>-convex multi-coloured polyominoes","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polyomino; Combinatorics; Mathematics; Disjoint sets; Intersection (aeronautics); Focus (optics); Regular polygon; Discrete mathematics; Geometry; Physics; Cartography","score_opus":0.01529987571091161,"score_gpt":0.2548659633559216,"score_spread":0.23956608764501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072044129","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.026180796,0.00031457123,0.91912436,0.00056588376,0.000473364,0.00007516654,0.0035506452,0.0014076473,0.04830761],"genre_scores_gemma":[0.3102133,0.0008847315,0.6127577,0.00028245145,0.00015522169,0.00011680066,0.008285026,0.0033434439,0.063961394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999645,0.000040488725,0.000015158704,0.00008037138,0.00017059594,0.000048298927],"domain_scores_gemma":[0.9991806,0.00022878316,0.000052756954,0.00023701119,0.0002322391,0.00006849561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004053807,0.0007730143,0.0006107815,0.0014301294,0.0005575093,0.0020977585,0.00082803104,0.000798787,0.03806045],"category_scores_gemma":[0.0028125138,0.0005087536,0.00080930657,0.0009268651,0.0007101037,0.0021924472,0.0014983438,0.002279015,0.009423609],"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.00043784763,0.00010614805,0.0023921882,0.0006804709,0.000085340456,0.00052939414,0.00035998298,0.099480525,0.020976769,0.4928075,0.09262558,0.2895182],"study_design_scores_gemma":[0.00006937014,0.00006541285,0.0019464273,0.00014388954,0.000028647184,0.00057096645,0.00029440288,0.4768555,0.025748769,0.39807186,0.09613053,0.00007428106],"about_ca_topic_score_codex":0.002520393,"about_ca_topic_score_gemma":0.005033025,"teacher_disagreement_score":0.03806045,"about_ca_system_score_codex":0.00063088944,"about_ca_system_score_gemma":0.0007128284,"threshold_uncertainty_score":0.12732494},"labels":[],"label_agreement":null},{"id":"W2072220447","doi":"10.1016/j.tcs.2014.07.015","title":"On the maximality of languages with combined types of code properties","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; St. Mary's University; Western University","funders":"","keywords":"Decidability; Property (philosophy); Mathematics; Formal language; Regular language; Suffix; Code (set theory); Type (biology); Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; Programming language; Linguistics","score_opus":0.009412736562524896,"score_gpt":0.21528818336526637,"score_spread":0.20587544680274147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072220447","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.59753054,0.001792217,0.32931843,0.004842245,0.00028408284,0.00013493902,0.0009751217,0.00097496825,0.064147495],"genre_scores_gemma":[0.96393704,0.00038170972,0.0288422,0.0005956291,0.0004050515,0.00015799631,0.0004761653,0.00034115167,0.0048630876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992993,0.002489571,0.00054795796,0.0016512516,0.0011962375,0.0011220059],"domain_scores_gemma":[0.9205425,0.0660642,0.003518493,0.0043579154,0.0027357726,0.0027811218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062150424,0.0009511594,0.0022598784,0.0026702972,0.004302075,0.0070320033,0.0030316503,0.0032131195,0.006146082],"category_scores_gemma":[0.029246861,0.0025487696,0.0034137715,0.0018668808,0.010668136,0.01779221,0.0075262617,0.0059619676,0.0007647619],"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.00021509429,0.000047026428,0.0009925746,0.00010078575,0.000031010004,0.00017654592,0.00076309557,0.0022751938,0.0018632923,0.9897316,0.000608802,0.0031948753],"study_design_scores_gemma":[0.00004291996,0.00003593793,0.00028454486,0.00004236446,0.000039202434,0.00024262421,0.0001882013,0.008935725,0.0012156122,0.9878962,0.0010429859,0.00003370359],"about_ca_topic_score_codex":0.0009854748,"about_ca_topic_score_gemma":0.001031913,"teacher_disagreement_score":0.0070320033,"about_ca_system_score_codex":0.0020318746,"about_ca_system_score_gemma":0.0019036426,"threshold_uncertainty_score":0.032868624},"labels":[],"label_agreement":null},{"id":"W2072322452","doi":"10.1016/j.tcs.2004.12.027","title":"Constructing divisions into power groups","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Constructive; Modulo; Conjecture; Mathematics; Group (periodic table); Constructive proof; Algebra over a field; Semigroup; Class (philosophy); Group theory; Algebraic number; Block (permutation group theory); Power (physics); Pure mathematics; Discrete mathematics; Computer science; Combinatorics; Programming language; Artificial intelligence; Mathematical analysis","score_opus":0.005845672047779444,"score_gpt":0.23981276081340724,"score_spread":0.2339670887656278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072322452","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.31521899,0.00042957644,0.5265809,0.0015151852,0.0004141322,0.00017004187,0.00022662533,0.0014525573,0.153992],"genre_scores_gemma":[0.8441218,0.00025074123,0.11053766,0.00034469488,0.00014223723,0.00014417131,0.00035905273,0.00060787593,0.043491792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991466,0.00026490464,0.000045904024,0.00020871576,0.00015100349,0.00018290251],"domain_scores_gemma":[0.998151,0.0010001605,0.00008504302,0.00046782522,0.00011551123,0.00018033439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074766844,0.0006116606,0.0008596477,0.00095031835,0.0020531407,0.0022615155,0.0011714458,0.0008345955,0.013479546],"category_scores_gemma":[0.0026368632,0.0007985123,0.0011392816,0.0011684352,0.0035100454,0.005874198,0.004044396,0.0027344574,0.0032044947],"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.00007078961,0.00003368021,0.00021608449,0.00003954407,0.000008200394,0.00010413668,0.0012076236,0.0011533779,0.0027292634,0.9729592,0.0016374675,0.019840611],"study_design_scores_gemma":[0.000023070634,0.000021682716,0.0000852262,0.000012373836,0.000011090533,0.00006494262,0.00024779106,0.0026320748,0.0026383535,0.9834394,0.010815903,0.000008093466],"about_ca_topic_score_codex":0.000337348,"about_ca_topic_score_gemma":0.00048980553,"teacher_disagreement_score":0.013479546,"about_ca_system_score_codex":0.0007792933,"about_ca_system_score_gemma":0.0003721971,"threshold_uncertainty_score":0.045093596},"labels":[],"label_agreement":null},{"id":"W2072365573","doi":"10.1016/s0304-3975(97)00300-9","title":"On computing graph minor obstruction sets","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","score_opus":0.013123453322863778,"score_gpt":0.28759454073442914,"score_spread":0.27447108741156534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072365573","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.3953034,0.0012826977,0.54918045,0.0026999773,0.00052754226,0.0005182238,0.0016710421,0.0063094157,0.042507254],"genre_scores_gemma":[0.70665526,0.00064445124,0.2674308,0.000666451,0.000520796,0.00032363427,0.004584015,0.0012789898,0.017895548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791247,0.0004132123,0.000115315466,0.000468209,0.0006421925,0.00044868575],"domain_scores_gemma":[0.9910925,0.005299067,0.00036372905,0.0019371299,0.0006175034,0.0006899633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016425382,0.00150325,0.0025743172,0.0045861206,0.0026201548,0.0042746714,0.0035984546,0.0015909236,0.016330497],"category_scores_gemma":[0.011115396,0.0009643987,0.002385746,0.004524762,0.0033489957,0.0106474515,0.0072493576,0.0032076433,0.0023223548],"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.0026210886,0.0011280582,0.01266177,0.0008983549,0.0002314379,0.00037379444,0.002128313,0.062502064,0.014454083,0.5124937,0.033924125,0.3565832],"study_design_scores_gemma":[0.00012940724,0.00022813557,0.0027178356,0.00008345938,0.00013217193,0.00022538955,0.00045656122,0.17809047,0.0045903362,0.80262274,0.010664794,0.000058775804],"about_ca_topic_score_codex":0.0029525468,"about_ca_topic_score_gemma":0.0068654753,"teacher_disagreement_score":0.016330497,"about_ca_system_score_codex":0.0021962267,"about_ca_system_score_gemma":0.0015304929,"threshold_uncertainty_score":0.054630995},"labels":[],"label_agreement":null},{"id":"W2072483141","doi":"10.1016/j.tcs.2014.02.041","title":"Causality in physics and computation","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Causality (physics); Theory of relativity; Causal structure; Spacetime; Computation; Theoretical physics; General relativity; Computer science; Theoretical computer science; Physics; Algorithm; Quantum mechanics","score_opus":0.010787520034739989,"score_gpt":0.2622740298283683,"score_spread":0.2514865097936283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072483141","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.0377935,0.050926246,0.60258096,0.05915955,0.009828414,0.00014643224,0.0005521546,0.00057405414,0.23843865],"genre_scores_gemma":[0.8661956,0.019325372,0.05765091,0.004524022,0.009913219,0.0003371883,0.00029278934,0.00034940167,0.041411437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850166,0.0006033588,0.00009597514,0.00025168195,0.00043061897,0.000116721065],"domain_scores_gemma":[0.99403656,0.0042059873,0.00025842915,0.000736784,0.0005501375,0.00021206918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029488183,0.0007933143,0.0015897804,0.0027223378,0.0025194916,0.004297559,0.0013567158,0.0028395352,0.008121083],"category_scores_gemma":[0.008463767,0.00072162435,0.0009771641,0.0023812412,0.014881269,0.013777128,0.002466922,0.005822308,0.00082714466],"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.0000014780338,0.0000020169216,0.000013656737,0.000012393048,0.0000013616896,0.000004609098,0.000035850007,0.00014527951,0.000013925375,0.99871266,0.00033216586,0.00072456035],"study_design_scores_gemma":[0.0000019311892,8.140847e-7,0.0000071485047,0.000002671828,9.3271115e-7,0.000004059642,0.0000058956193,0.00027643598,0.000012315881,0.99830085,0.0013856974,0.0000012432857],"about_ca_topic_score_codex":0.0023600894,"about_ca_topic_score_gemma":0.0010993943,"teacher_disagreement_score":0.008121083,"about_ca_system_score_codex":0.0024015412,"about_ca_system_score_gemma":0.002039909,"threshold_uncertainty_score":0.027167678},"labels":[],"label_agreement":null},{"id":"W2073028751","doi":"10.1016/s0304-3975(00)00415-1","title":"Taut Monads and T0-spaces","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Dalhousie University","keywords":"Mathematics; Algebra over a field; Pure mathematics; Calculus (dental); Combinatorics; Discrete mathematics","score_opus":0.016859425758040274,"score_gpt":0.23232813335385044,"score_spread":0.21546870759581016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073028751","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.2538634,0.0109498175,0.5335045,0.011503626,0.0014315419,0.00010204171,0.0011499175,0.0012717919,0.18622337],"genre_scores_gemma":[0.9168141,0.002920908,0.04308038,0.0011026172,0.0008583377,0.0001221948,0.0005830384,0.0002236826,0.034294665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984414,0.00045572527,0.00012637088,0.00037822465,0.0002987625,0.00029946768],"domain_scores_gemma":[0.99661714,0.0018352955,0.00034378498,0.00044026508,0.00033640087,0.0004270033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021505828,0.00067794166,0.00072442385,0.0016843003,0.0027081228,0.0065896786,0.0012000633,0.0015620734,0.0095647955],"category_scores_gemma":[0.004284252,0.00063133583,0.0013935381,0.0026223825,0.006075564,0.014903144,0.0040700138,0.004553141,0.0011945053],"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.00002179708,0.000006957396,0.00009413945,0.000017325458,0.0000034021562,0.000029540817,0.00015542225,0.00018924856,0.000112775946,0.9966036,0.0005316934,0.0022340429],"study_design_scores_gemma":[0.000009232518,0.000009870269,0.000057925274,0.000009670965,0.000006182209,0.000063243715,0.00008307634,0.0007953306,0.0002170892,0.995477,0.0032643978,0.000006960356],"about_ca_topic_score_codex":0.0012196574,"about_ca_topic_score_gemma":0.0009476037,"teacher_disagreement_score":0.0095647955,"about_ca_system_score_codex":0.0018721332,"about_ca_system_score_gemma":0.0010888765,"threshold_uncertainty_score":0.031997383},"labels":[],"label_agreement":null},{"id":"W2073076713","doi":"10.1016/j.tcs.2008.03.006","title":"Self-deployment of mobile sensors on a ring","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"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":"Software deployment; Ring (chemistry); Computer science; Visibility; Mathematical proof; Simple (philosophy); Impossibility; RADIUS; Coordinate system; Cover (algebra); Distributed computing; Topology (electrical circuits); Mathematics; Geometry; Physics; Computer network; Combinatorics; Artificial intelligence; Engineering","score_opus":0.015550064127749272,"score_gpt":0.2578851609787024,"score_spread":0.2423350968509531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073076713","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.38021198,0.0006227565,0.612715,0.00056316226,0.00014209087,0.000069766604,0.00010772265,0.00037354755,0.005193933],"genre_scores_gemma":[0.9645006,0.00024512218,0.030917902,0.000046449673,0.0000398154,0.000040295952,0.00004578793,0.000024530495,0.0041395486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928623,0.00022505087,0.000029908531,0.00020560116,0.0001115352,0.00014170409],"domain_scores_gemma":[0.99767727,0.00092966814,0.0004349209,0.0004391877,0.000257878,0.00026113738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010320427,0.00046615102,0.00093570043,0.0005074694,0.0006771868,0.00096761546,0.0014641588,0.0011041068,0.0012027662],"category_scores_gemma":[0.0044552903,0.0006575349,0.00041983736,0.0005643747,0.0008527141,0.0021851354,0.0021111679,0.00058503007,0.0004727812],"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.0009836461,0.00021550279,0.006262548,0.00018247095,0.00012538343,0.000674492,0.000282443,0.85817456,0.042365044,0.038018446,0.0022162981,0.050499126],"study_design_scores_gemma":[0.000021162643,0.00023395118,0.00070866174,0.0000071284385,0.000020867676,0.00013272242,0.000094901116,0.98716205,0.005318219,0.0053871823,0.0008992897,0.000013863098],"about_ca_topic_score_codex":0.00071157474,"about_ca_topic_score_gemma":0.00067145925,"teacher_disagreement_score":0.0014641588,"about_ca_system_score_codex":0.0004389583,"about_ca_system_score_gemma":0.0003523019,"threshold_uncertainty_score":0.0054579973},"labels":[],"label_agreement":null},{"id":"W2073577522","doi":"10.1016/s0304-3975(02)00543-1","title":"On the closure properties of linear conjunctive languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"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":"Indexed grammar; Context-sensitive grammar; Closure (psychology); Context-free grammar; Definite clause grammar; Mathematics; L-attributed grammar; Phrase structure grammar; Rule-based machine translation; Computer science; Discrete mathematics; Tree-adjoining grammar; Context-free language; Artificial intelligence","score_opus":0.011894322274946273,"score_gpt":0.22842020011947572,"score_spread":0.21652587784452945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073577522","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.47851112,0.0045749415,0.40168765,0.008472922,0.0005597085,0.00022781007,0.0012901643,0.0011281424,0.10354754],"genre_scores_gemma":[0.9360494,0.0018494605,0.046524394,0.0010175529,0.0009524666,0.00021630374,0.0013337848,0.00043566857,0.011621032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738127,0.00079805666,0.00024221929,0.0005209428,0.0006354013,0.00042212225],"domain_scores_gemma":[0.9550427,0.038547967,0.0016144819,0.0019705803,0.0017258353,0.0010983926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047461977,0.0007699112,0.0015568177,0.0018284478,0.0026315388,0.005187367,0.0019957656,0.0018303223,0.008017726],"category_scores_gemma":[0.017797528,0.0011749073,0.0020365345,0.0020288958,0.006733885,0.018693402,0.0037012573,0.005059024,0.00089786144],"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.0005425253,0.00018377365,0.0011635418,0.00021288209,0.00003262275,0.00061316654,0.0022740688,0.003136662,0.004976492,0.967378,0.002735728,0.016750472],"study_design_scores_gemma":[0.00006146884,0.00006757221,0.00035354678,0.000038297836,0.00002307175,0.00020165046,0.00029867617,0.0095102815,0.0013125233,0.9857905,0.002317741,0.000024710771],"about_ca_topic_score_codex":0.002011122,"about_ca_topic_score_gemma":0.001185421,"teacher_disagreement_score":0.008017726,"about_ca_system_score_codex":0.001938159,"about_ca_system_score_gemma":0.0012090667,"threshold_uncertainty_score":0.026821971},"labels":[],"label_agreement":null},{"id":"W2074124111","doi":"10.1016/j.tcs.2008.06.015","title":"Discrete sets with minimal moment of inertia","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Moment of inertia; Moment (physics); Combinatorics; Computer science; Algorithm; Physics; Classical mechanics","score_opus":0.011438740854059583,"score_gpt":0.2512032215195959,"score_spread":0.23976448066553632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074124111","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.5302547,0.0012677584,0.3762053,0.0027027414,0.0007883723,0.000106667576,0.0009755377,0.00049665547,0.08720224],"genre_scores_gemma":[0.95605075,0.0004033785,0.026490659,0.0002597987,0.0008090989,0.00011989662,0.0004971793,0.00011347871,0.015255871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900645,0.00014561566,0.00007324572,0.00022915575,0.0003471409,0.00019844773],"domain_scores_gemma":[0.9972409,0.0012892189,0.00042262793,0.00034496913,0.00029357028,0.0004087123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062920514,0.00060901494,0.0014714117,0.0029033648,0.0016827736,0.003186902,0.0011145194,0.0012075393,0.0066319024],"category_scores_gemma":[0.0029394974,0.0005181481,0.0012025955,0.0011077657,0.0032581137,0.0030582864,0.0025170255,0.0021125316,0.00070103776],"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.00010405422,0.000026231239,0.00017986521,0.00004581996,0.0000152199045,0.000084853964,0.00016638954,0.00086191494,0.002331919,0.9899502,0.00082419906,0.0054094093],"study_design_scores_gemma":[0.00005594733,0.00008407048,0.0006656401,0.00001921734,0.000018529861,0.00031830455,0.00011497419,0.0077671777,0.001801515,0.9837361,0.0053819558,0.000036595127],"about_ca_topic_score_codex":0.00027572908,"about_ca_topic_score_gemma":0.00029241003,"teacher_disagreement_score":0.0066319024,"about_ca_system_score_codex":0.00092944247,"about_ca_system_score_gemma":0.00039848743,"threshold_uncertainty_score":0.022185981},"labels":[],"label_agreement":null},{"id":"W2074771880","doi":"10.1016/j.tcs.2008.08.025","title":"Monotonicity in digraph search problems","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Monotonic function; Mathematics; Combinatorics; Computer science; Discrete mathematics","score_opus":0.023210485426576315,"score_gpt":0.2634368297401455,"score_spread":0.24022634431356918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074771880","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.14607401,0.012829555,0.734122,0.009637398,0.00039286056,0.00025022594,0.0007318182,0.0004503668,0.095511794],"genre_scores_gemma":[0.78864247,0.010350258,0.1689313,0.0013729758,0.00068522454,0.00060502754,0.00093368173,0.00031956832,0.028159352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979728,0.0011147643,0.00009971716,0.00024230656,0.00037727045,0.00019315729],"domain_scores_gemma":[0.9787266,0.01862755,0.0005143755,0.00067224394,0.0008447052,0.00061450567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039543686,0.00091487775,0.0022824567,0.0017043436,0.0016526994,0.0038967286,0.002192855,0.002196839,0.006421954],"category_scores_gemma":[0.023789395,0.0010988839,0.0011681302,0.003295671,0.0031258485,0.009123431,0.002471339,0.0058028125,0.0007715873],"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.00014425981,0.00015081636,0.0012740911,0.00052148703,0.00004018654,0.00015946374,0.0003390654,0.022749787,0.0006217815,0.9173597,0.006607068,0.05003222],"study_design_scores_gemma":[0.00003565464,0.000034315293,0.00028170855,0.000069913665,0.00002070159,0.000116056595,0.00007964664,0.077997215,0.00033026768,0.9169197,0.004102721,0.000011983493],"about_ca_topic_score_codex":0.0019383009,"about_ca_topic_score_gemma":0.0021003105,"teacher_disagreement_score":0.006421954,"about_ca_system_score_codex":0.0020236233,"about_ca_system_score_gemma":0.0017356268,"threshold_uncertainty_score":0.0214836},"labels":[],"label_agreement":null},{"id":"W2075116123","doi":"10.1016/j.tcs.2011.02.002","title":"The search for a reduction in combinatory logic equivalent to <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>λ</mml:mi><mml:mi>β</mml:mi></mml:math>-reduction","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Scroll; Reduction (mathematics); Algorithm; Mathematics; Computer science; Artificial intelligence; Theology; Philosophy; Geometry","score_opus":0.025986079673782147,"score_gpt":0.2623358634728863,"score_spread":0.23634978379910415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075116123","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.43943775,0.0012824564,0.31469166,0.029526038,0.0010549511,0.00050547405,0.0017518341,0.0043138308,0.20743603],"genre_scores_gemma":[0.7943899,0.00051661103,0.16446151,0.0029451952,0.00032245953,0.00016771728,0.0023930878,0.0010820739,0.03372144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873954,0.00037087113,0.000064986234,0.00037188816,0.00024128718,0.00021140368],"domain_scores_gemma":[0.9955395,0.0035571568,0.000097841265,0.0003441176,0.00027756358,0.00018389065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014779535,0.00052642263,0.0011020609,0.001169073,0.0018481269,0.0031503204,0.0012251642,0.002278345,0.023787972],"category_scores_gemma":[0.0080933515,0.0006578847,0.002635795,0.0010311798,0.0025823738,0.004471455,0.0021395497,0.0035037769,0.003305029],"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.0010463226,0.00050597795,0.0018952227,0.00097645435,0.00013793207,0.0009182813,0.0011787986,0.009040025,0.012682715,0.8717149,0.03402844,0.06587498],"study_design_scores_gemma":[0.00021979306,0.00020703113,0.00066291797,0.000100276535,0.00013333755,0.0005335209,0.0008766605,0.030468566,0.007728766,0.9410449,0.017978188,0.00004596457],"about_ca_topic_score_codex":0.0021780522,"about_ca_topic_score_gemma":0.004079027,"teacher_disagreement_score":0.023787972,"about_ca_system_score_codex":0.0015655347,"about_ca_system_score_gemma":0.002101523,"threshold_uncertainty_score":0.0795787},"labels":[],"label_agreement":null},{"id":"W2076087052","doi":"10.1016/j.tcs.2006.05.021","title":"Approximating and computing behavioural distances in probabilistic transition systems","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Functor; Probabilistic logic; Mathematics; Equivalence (formal languages); Metric (unit); Probability measure; Discrete mathematics; Statistics","score_opus":0.01054023630763494,"score_gpt":0.22712271224983321,"score_spread":0.21658247594219826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076087052","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.3046521,0.00032990714,0.6922261,0.0005802286,0.000039926457,0.000049778922,0.00018319287,0.0007231806,0.001215595],"genre_scores_gemma":[0.8992913,0.00015334792,0.09891715,0.000072732204,0.000046538804,0.00006094711,0.00034186814,0.00010610335,0.0010100849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967115,0.0011011476,0.00025162424,0.00076749944,0.00082676066,0.0003414446],"domain_scores_gemma":[0.9503695,0.042757493,0.0018281518,0.0024580245,0.0014614583,0.0011253913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040968116,0.0009967866,0.0016893632,0.0021006383,0.0010454322,0.002779595,0.0036271408,0.0018874706,0.0021057343],"category_scores_gemma":[0.042787988,0.0011131947,0.0010502712,0.001985559,0.003257386,0.007296672,0.00428427,0.003807474,0.0002402465],"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.0005173429,0.0001401023,0.006277001,0.00017928502,0.000066182736,0.00007627516,0.00056220434,0.82166016,0.0015627247,0.11990296,0.0005044698,0.04855128],"study_design_scores_gemma":[0.000013347311,0.00003073193,0.00031636746,0.00000766408,0.000010970868,0.000015516027,0.00004929126,0.8873317,0.00053368526,0.11153518,0.00014690749,0.000008672556],"about_ca_topic_score_codex":0.00864256,"about_ca_topic_score_gemma":0.009254638,"teacher_disagreement_score":0.00864256,"about_ca_system_score_codex":0.0035423317,"about_ca_system_score_gemma":0.0015815881,"threshold_uncertainty_score":0.025701523},"labels":[],"label_agreement":null},{"id":"W2076127862","doi":"10.1016/s0304-3975(02)00069-5","title":"Coding properties of DNA languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"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; Saint Mary's University","funders":"","keywords":"DNA computing; Computation; Computer science; Decidability; Coding (social sciences); Theoretical computer science; Programming language; Mathematics","score_opus":0.013384440443422596,"score_gpt":0.2452220632468246,"score_spread":0.231837622803402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076127862","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.69499946,0.0010609695,0.22499089,0.0032987476,0.00013208367,0.00007576317,0.0009820537,0.0006156461,0.07384442],"genre_scores_gemma":[0.9853543,0.0002986562,0.0093340175,0.00024898702,0.00016665834,0.000092848284,0.00041599016,0.0001607066,0.0039277864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877447,0.00033730047,0.00007172541,0.00020171177,0.00039176643,0.00022311877],"domain_scores_gemma":[0.98087376,0.015541936,0.0008302228,0.0011533649,0.0010245838,0.0005762586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012162402,0.00037169023,0.0005385849,0.00216467,0.0013937856,0.0035675312,0.0010035249,0.001110778,0.0047332747],"category_scores_gemma":[0.012563848,0.00050501304,0.0006308053,0.0017914438,0.0023919677,0.0048463363,0.0014096112,0.0022414066,0.00051330193],"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.000042466952,0.000015242434,0.00041889923,0.00004155472,0.000004134669,0.000057545305,0.00036469175,0.0024537344,0.0020490068,0.98896027,0.0006447689,0.004947739],"study_design_scores_gemma":[0.000011515695,0.000010951549,0.00022351142,0.000015772817,0.000006363915,0.000091315276,0.000071138726,0.013958725,0.0016095118,0.98303276,0.0009557341,0.00001284028],"about_ca_topic_score_codex":0.0010281276,"about_ca_topic_score_gemma":0.0006799731,"teacher_disagreement_score":0.0047332747,"about_ca_system_score_codex":0.0012930748,"about_ca_system_score_gemma":0.0008686843,"threshold_uncertainty_score":0.015834332},"labels":[],"label_agreement":null},{"id":"W2076263584","doi":"10.1016/j.tcs.2005.07.013","title":"Decidability of trajectory-based equations","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"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; Acadia University","funders":"","keywords":"Catenation; Decidability; Constructive; Mathematics; Quotient; Trajectory; Regular language; Integer (computer science); Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Theoretical computer science; Programming language; Automaton","score_opus":0.012589549041056431,"score_gpt":0.2672837213251435,"score_spread":0.2546941722840871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076263584","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.16309711,0.0010360323,0.7721092,0.009837526,0.00033046573,0.00029695735,0.0024989937,0.001466498,0.049327333],"genre_scores_gemma":[0.8560598,0.0009608113,0.11595791,0.0016282321,0.00037718387,0.00042989157,0.0036001848,0.0004789754,0.02050701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99570113,0.000945441,0.00037499567,0.0011599129,0.0010574089,0.00076120545],"domain_scores_gemma":[0.9751713,0.021229194,0.0007251817,0.0010238925,0.0013502922,0.00050019234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039676917,0.0011321084,0.001563522,0.0014495965,0.0022394997,0.0051143817,0.004813616,0.003642853,0.009695163],"category_scores_gemma":[0.022345517,0.0014475521,0.004460647,0.0023006662,0.004586162,0.013060695,0.0055077514,0.009483182,0.00078926026],"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.00006004942,0.00005675511,0.0006289132,0.00012412756,0.000047160083,0.0001717978,0.0005966889,0.013800828,0.00056931586,0.9754936,0.002009426,0.0064413096],"study_design_scores_gemma":[0.000063672145,0.000009023743,0.00010841858,0.000018513752,0.000030903626,0.000049549482,0.000075411546,0.045035303,0.0006866742,0.95222026,0.0016876243,0.0000146818875],"about_ca_topic_score_codex":0.009220986,"about_ca_topic_score_gemma":0.006318441,"teacher_disagreement_score":0.009695163,"about_ca_system_score_codex":0.004789618,"about_ca_system_score_gemma":0.0031980902,"threshold_uncertainty_score":0.034751296},"labels":[],"label_agreement":null},{"id":"W2076501806","doi":"10.1016/j.tcs.2007.01.011","title":"Equivalence of simple functions","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","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":"Université du Québec en Outaouais","funders":"","keywords":"Terminal and nonterminal symbols; Mathematics; Simple (philosophy); Equivalence (formal languages); Alphabet; Combinatorics; Deterministic pushdown automaton; Discrete mathematics; Function (biology); Rule-based machine translation; Automaton; Computer science; Automata theory; Theoretical computer science","score_opus":0.012277130162784426,"score_gpt":0.27347997903692145,"score_spread":0.26120284887413703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076501806","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.29349616,0.0023744474,0.4221476,0.00297981,0.0012449428,0.00015610339,0.0007116026,0.00080207945,0.27608722],"genre_scores_gemma":[0.90984863,0.0012662323,0.038662937,0.0011662609,0.0010558962,0.00017729616,0.0009969319,0.0003705968,0.046455186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977245,0.0004654938,0.0001508002,0.0005498231,0.0008043679,0.0003049867],"domain_scores_gemma":[0.9963529,0.0017978487,0.0002610764,0.0005588022,0.00069223996,0.0003371306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013030544,0.00081228185,0.0012004342,0.0030797382,0.001702853,0.0036063897,0.0010982895,0.0014487506,0.0111766355],"category_scores_gemma":[0.0058746655,0.0005763708,0.0014869184,0.0020023326,0.0033892372,0.008683658,0.00360356,0.004106913,0.0016410601],"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.000033971493,0.000022509508,0.00011236297,0.000018784669,0.0000065208224,0.00003557314,0.00016808475,0.00019887346,0.00047788615,0.9897001,0.000919095,0.0083061],"study_design_scores_gemma":[0.000010356566,0.000015190014,0.00016409534,0.000006138163,0.0000064982837,0.000062893945,0.000029613722,0.0011511862,0.00039308696,0.9947194,0.0034350555,0.0000065836925],"about_ca_topic_score_codex":0.00052205287,"about_ca_topic_score_gemma":0.00035423433,"teacher_disagreement_score":0.0111766355,"about_ca_system_score_codex":0.0013185367,"about_ca_system_score_gemma":0.0005784384,"threshold_uncertainty_score":0.037389576},"labels":[],"label_agreement":null},{"id":"W2076508696","doi":"10.1016/j.tcs.2005.11.008","title":"Efficient transitive closure of sparse matrices over closed semirings","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transitive closure; Semiring; Transitive relation; Closure (psychology); Transitive reduction; Kleene algebra; Mathematics; Data structure; Sparse matrix; Combinatorics; Computer science; Discrete mathematics; Algorithm; Programming language","score_opus":0.005652773324240412,"score_gpt":0.2308221720461556,"score_spread":0.2251693987219152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076508696","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.12509917,0.00035585562,0.8597741,0.00065858156,0.00010948749,0.00028581178,0.0012778243,0.0020258531,0.010413322],"genre_scores_gemma":[0.6596569,0.00038934784,0.32807672,0.00021955576,0.0001542639,0.00022076914,0.0027068101,0.00066811335,0.007907495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582505,0.0011408399,0.00029468647,0.00068047026,0.0014597091,0.0005993574],"domain_scores_gemma":[0.9879308,0.0067800023,0.0010219257,0.0025875932,0.001158278,0.0005215194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199593,0.000918467,0.0017139626,0.0010955188,0.0011029205,0.0035059515,0.001512754,0.00075613125,0.0065581887],"category_scores_gemma":[0.011760983,0.000886368,0.0013468355,0.0018296594,0.0013673635,0.005809347,0.0031800703,0.0021938297,0.0010494691],"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.00090519513,0.0005143107,0.0013797182,0.0006404892,0.00011328106,0.00041863683,0.0015852555,0.06726913,0.026742002,0.5990086,0.019423263,0.28200012],"study_design_scores_gemma":[0.00012767939,0.00031474238,0.00037621194,0.00007173683,0.000046865163,0.000325024,0.00058756047,0.24930045,0.018031951,0.720776,0.009996957,0.00004482464],"about_ca_topic_score_codex":0.0020778656,"about_ca_topic_score_gemma":0.004236954,"teacher_disagreement_score":0.0065581887,"about_ca_system_score_codex":0.0010420087,"about_ca_system_score_gemma":0.0017864022,"threshold_uncertainty_score":0.021939278},"labels":[],"label_agreement":null},{"id":"W2076959711","doi":"10.1016/j.tcs.2010.07.005","title":"Equations on palindromes and circular words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Bijection; Mathematics; Palindrome; Translation (biology); Combinatorics; Boundary (topology); Pure mathematics; Plane (geometry); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.008528305360565884,"score_gpt":0.24131079689579749,"score_spread":0.2327824915352316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076959711","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.37843716,0.0017596002,0.4749454,0.0048416243,0.0010976028,0.00019875237,0.0010294943,0.00052855717,0.1371618],"genre_scores_gemma":[0.87766194,0.0008561436,0.05700607,0.0008304892,0.00063688547,0.00019900393,0.0006671161,0.00026020658,0.06188204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999042,0.00022311682,0.00012513343,0.00022796133,0.00020778456,0.00017391855],"domain_scores_gemma":[0.99721295,0.0017664114,0.0002469161,0.00024650485,0.0003738947,0.00015332465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010244509,0.00062531926,0.0007935185,0.0011470645,0.0015463473,0.0027025256,0.0011092975,0.0013911302,0.01278397],"category_scores_gemma":[0.00462068,0.0007143973,0.0013567926,0.0012786369,0.0027051547,0.0076060174,0.002372315,0.0025147076,0.0015713644],"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.000016240945,0.000009843073,0.00011444094,0.000021015181,0.0000028436045,0.000071902665,0.00029189285,0.00043818096,0.00045405026,0.99558496,0.00074671174,0.0022478907],"study_design_scores_gemma":[0.000020116115,0.000009127052,0.00007967315,0.000006421873,0.0000053509834,0.00007600638,0.00007446217,0.0028802461,0.00045904226,0.99357516,0.002803445,0.000010898874],"about_ca_topic_score_codex":0.0015759307,"about_ca_topic_score_gemma":0.0014660801,"teacher_disagreement_score":0.01278397,"about_ca_system_score_codex":0.0014698502,"about_ca_system_score_gemma":0.00070464367,"threshold_uncertainty_score":0.04276663},"labels":[],"label_agreement":null},{"id":"W2077484872","doi":"10.1016/j.tcs.2004.03.057","title":"Longest increasing subsequences in sliding windows","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"University of Waterloo","keywords":"Subsequence; Sliding window protocol; Longest increasing subsequence; Sequence (biology); Generalization; Longest common subsequence problem; Algorithm; Combinatorics; Mathematics; Window (computing); Computer science; Mathematical analysis","score_opus":0.012254478362827302,"score_gpt":0.25266471317457145,"score_spread":0.24041023481174414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077484872","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.19397455,0.0025094314,0.7978244,0.0002242531,0.00022019958,0.00008542548,0.00035825974,0.0007411529,0.0040623196],"genre_scores_gemma":[0.68719757,0.0018393224,0.30061257,0.00012255924,0.00027931473,0.00019060058,0.0012576017,0.00027697594,0.008223586],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912995,0.00014805536,0.00012987028,0.00020335027,0.00030578178,0.00008310469],"domain_scores_gemma":[0.99677366,0.0018696474,0.00040439318,0.00042929218,0.00037912623,0.00014387416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093640195,0.00046719596,0.00074230024,0.0022066284,0.00065664185,0.0011165262,0.0008297624,0.00061478827,0.0030195813],"category_scores_gemma":[0.0073741805,0.00048541924,0.0004939646,0.0033045402,0.00074039167,0.0023863045,0.0009485391,0.00089149916,0.0006634741],"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.0013288689,0.00020596838,0.007072339,0.0005476286,0.00012762695,0.0015589877,0.0009219311,0.088193074,0.048397854,0.35886997,0.004483457,0.4882922],"study_design_scores_gemma":[0.000069573296,0.00030899845,0.0037517918,0.00012461873,0.00011243879,0.0011743535,0.0002616958,0.593795,0.019882489,0.3655175,0.014956253,0.00004528844],"about_ca_topic_score_codex":0.0008252803,"about_ca_topic_score_gemma":0.00081775663,"teacher_disagreement_score":0.0030195813,"about_ca_system_score_codex":0.0004413941,"about_ca_system_score_gemma":0.00052075,"threshold_uncertainty_score":0.010101497},"labels":[],"label_agreement":null},{"id":"W2077525424","doi":"10.1016/j.tcs.2009.02.023","title":"On the similarity metric and the distance metric","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":126,"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":"Division of Mathematical Sciences; National University of Singapore","keywords":"Metric (unit); Similarity (geometry); Mathematics; String metric; Measure (data warehouse); Fisher information metric; Metric space; Equivalence of metrics; Convex metric space; Discrete mathematics; Artificial intelligence; Computer science; Data mining; Image (mathematics)","score_opus":0.01072900924257724,"score_gpt":0.24329269683461782,"score_spread":0.23256368759204057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077525424","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.032108724,0.021980297,0.88268447,0.009421506,0.0011471817,0.000071613504,0.00031728775,0.00012939426,0.05213948],"genre_scores_gemma":[0.5836945,0.0236038,0.3570256,0.0028460429,0.004805563,0.00041969883,0.0012473101,0.0003329702,0.02602441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940065,0.0026817666,0.0004896652,0.0010482057,0.00152076,0.00025315877],"domain_scores_gemma":[0.9810619,0.013128162,0.0010522958,0.0021395595,0.00203272,0.0005853337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054053897,0.0011135888,0.0018028428,0.005258288,0.002140143,0.0049151797,0.00238135,0.0038357927,0.0052552014],"category_scores_gemma":[0.030987153,0.000858757,0.0013600256,0.007168953,0.008810005,0.021895533,0.005965634,0.004614572,0.0012337398],"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.000019432971,0.0000071010186,0.00017653446,0.0000507328,0.000011209635,0.000032715285,0.00012284968,0.0014235084,0.00017685413,0.9853908,0.0012625472,0.011325726],"study_design_scores_gemma":[0.0000047072003,0.000014404597,0.00012121624,0.000025121391,0.0000073767637,0.00007345388,0.00003852878,0.00555686,0.00009606339,0.9873863,0.006663509,0.0000124327535],"about_ca_topic_score_codex":0.0021665175,"about_ca_topic_score_gemma":0.0010792372,"teacher_disagreement_score":0.0054053897,"about_ca_system_score_codex":0.0023307211,"about_ca_system_score_gemma":0.0010254751,"threshold_uncertainty_score":0.028586805},"labels":[],"label_agreement":null},{"id":"W2077734953","doi":"10.1016/j.tcs.2013.08.011","title":"Randomised broadcasting: Memory vs. randomness","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Node (physics); Randomness; Broadcasting (networking); Computer science; Degree (music); Upper and lower bounds; Binary logarithm; Channel (broadcasting); Mathematics; Combinatorics; Discrete mathematics; Algorithm; Computer network; Theoretical computer science; Statistics","score_opus":0.007172847384616654,"score_gpt":0.22012452561771562,"score_spread":0.21295167823309896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077734953","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.18320818,0.0056158127,0.72622687,0.01417212,0.0013234675,0.00028699797,0.001047282,0.0012387799,0.06688047],"genre_scores_gemma":[0.94474703,0.0019467361,0.034730762,0.0014237289,0.0010942571,0.00029852684,0.00037154142,0.0003101007,0.015077336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929531,0.003566013,0.00032458466,0.0009286757,0.0011351319,0.00109243],"domain_scores_gemma":[0.90673065,0.07228342,0.003517461,0.012946769,0.0029544441,0.0015671456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006907916,0.0007418137,0.0020793462,0.0014700685,0.002253217,0.004225474,0.0032556048,0.003501731,0.009603726],"category_scores_gemma":[0.0601124,0.0008825681,0.0011291938,0.0019810118,0.006058808,0.0115717,0.004248761,0.00398849,0.0011956305],"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.00083018315,0.00005913117,0.00071447366,0.00022217212,0.000049875754,0.000112190595,0.0002621775,0.034830566,0.0014945064,0.93588793,0.0058208043,0.019715887],"study_design_scores_gemma":[0.00020019404,0.00013425903,0.00018521387,0.000076090815,0.000049960432,0.00018573602,0.00008356606,0.08582408,0.0014020031,0.9081434,0.0036557447,0.000059799993],"about_ca_topic_score_codex":0.0016544423,"about_ca_topic_score_gemma":0.0015387088,"teacher_disagreement_score":0.009603726,"about_ca_system_score_codex":0.0029281517,"about_ca_system_score_gemma":0.0032737073,"threshold_uncertainty_score":0.03653294},"labels":[],"label_agreement":null},{"id":"W2077987919","doi":"10.1016/j.tcs.2012.10.040","title":"Combinatorial properties of double square tiles","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":14,"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":"Square (algebra); Mathematics; Combinatorics; Discrete mathematics; Geometry","score_opus":0.02192587794218105,"score_gpt":0.2611460789304941,"score_spread":0.23922020098831304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077987919","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.7921432,0.00064494106,0.096328475,0.00048310353,0.00013130868,0.000058848043,0.0004353035,0.00019627206,0.1095786],"genre_scores_gemma":[0.9678439,0.00031359363,0.018357482,0.00010838508,0.00008659526,0.00007700723,0.00048299355,0.00010331027,0.01262674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996505,0.00005433936,0.00002408105,0.000080472906,0.00011559069,0.00007509009],"domain_scores_gemma":[0.9990075,0.0004283401,0.00017585304,0.00011873319,0.000104059596,0.00016543102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002467906,0.0004372679,0.0005180348,0.0013299368,0.0008560234,0.0030802493,0.0006612338,0.00041798168,0.0076131257],"category_scores_gemma":[0.0013980151,0.0005253742,0.00049022894,0.0011781417,0.0014143143,0.0014972527,0.0013033976,0.0010819095,0.00061998045],"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.00026284961,0.000046312427,0.0016664034,0.00014779625,0.000022441236,0.0005037027,0.00042780212,0.008074979,0.0129013555,0.9536795,0.0023278804,0.019939026],"study_design_scores_gemma":[0.00010639743,0.00013273867,0.0033428343,0.000056957986,0.000050315703,0.0013523285,0.00081473053,0.03213743,0.009151177,0.9339245,0.018885951,0.000044641776],"about_ca_topic_score_codex":0.00069807674,"about_ca_topic_score_gemma":0.00072250824,"teacher_disagreement_score":0.0076131257,"about_ca_system_score_codex":0.00051320606,"about_ca_system_score_gemma":0.00021795883,"threshold_uncertainty_score":0.025468409},"labels":[],"label_agreement":null},{"id":"W2078140591","doi":"10.1016/j.tcs.2014.11.008","title":"Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Mathematics; Bipartite graph; Function (biology); Approximation algorithm; Value (mathematics); Combinatorics; Discrete mathematics; Upper and lower bounds; Boolean function; Time complexity; Integer (computer science); Algorithm; Computer science","score_opus":0.026753670774554365,"score_gpt":0.26676395496704475,"score_spread":0.24001028419249038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078140591","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.31657994,0.0067151664,0.62419015,0.0071452036,0.0006184301,0.0002842575,0.0023151543,0.0010663088,0.041085415],"genre_scores_gemma":[0.82282794,0.0024145986,0.15922733,0.00057530164,0.0006860158,0.0004226486,0.0018625221,0.0005717563,0.011411964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952858,0.0019779587,0.00019195465,0.0008350923,0.0009763157,0.00073279045],"domain_scores_gemma":[0.9597507,0.0331146,0.0019493623,0.0020383955,0.0019895078,0.0011574765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064150384,0.0016090936,0.0026939309,0.002734348,0.0016286791,0.006058785,0.004631041,0.0035338018,0.01099925],"category_scores_gemma":[0.05064586,0.0010235406,0.0017860867,0.004899804,0.0027657698,0.007897452,0.002042378,0.0041126725,0.0007391002],"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.0013142842,0.00036453863,0.0023423147,0.00069111405,0.00023973796,0.00006680803,0.0002917868,0.51903135,0.0016945088,0.38517898,0.015537243,0.07324737],"study_design_scores_gemma":[0.00007690666,0.00010410404,0.00067870575,0.00007291445,0.000055788067,0.00005420082,0.00011048091,0.64733326,0.00090620964,0.3492965,0.0012771618,0.000033714638],"about_ca_topic_score_codex":0.002589617,"about_ca_topic_score_gemma":0.0034766132,"teacher_disagreement_score":0.01099925,"about_ca_system_score_codex":0.0056606974,"about_ca_system_score_gemma":0.003386885,"threshold_uncertainty_score":0.041071415},"labels":[],"label_agreement":null},{"id":"W2079050722","doi":"10.1016/j.tcs.2014.01.025","title":"On lattices from combinatorial game theory modularity and a representation theorem: Finite case","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Distributive property; Distributive lattice; Modular design; Mathematics; Closure (psychology); Modularity (biology); Representation (politics); Set (abstract data type); Context (archaeology); Finite set; Representation theorem; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.02126817729949018,"score_gpt":0.2903496638602661,"score_spread":0.26908148656077596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079050722","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.14236479,0.0012767998,0.74895924,0.0060854214,0.00025521097,0.000104885905,0.00033940183,0.00027427208,0.10034001],"genre_scores_gemma":[0.8942405,0.00089370366,0.08962712,0.0006666272,0.0006768933,0.00022006253,0.00031586702,0.00019442798,0.013164812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775356,0.0010896489,0.00008730557,0.00032376204,0.00047877958,0.00026693728],"domain_scores_gemma":[0.9890827,0.007965533,0.0008339517,0.0008339374,0.0006589178,0.0006249805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030105151,0.0010365611,0.0015238668,0.0027425757,0.0018939937,0.0042185197,0.0025440932,0.0022577024,0.008561532],"category_scores_gemma":[0.015504631,0.0009176072,0.0018175521,0.0028521626,0.0068718665,0.0128959995,0.0042565246,0.005179128,0.00073823193],"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.0000068140316,0.00001002043,0.000050236264,0.000015822625,0.0000031436855,0.000019722358,0.000061020008,0.0010180972,0.00007856607,0.9970726,0.00033661595,0.0013273263],"study_design_scores_gemma":[0.000004612515,0.0000027513393,0.00002637944,0.000004963574,0.0000021332314,0.000020970156,0.000014313709,0.0052554524,0.000023237495,0.9943856,0.00025627797,0.0000032960513],"about_ca_topic_score_codex":0.001936185,"about_ca_topic_score_gemma":0.0014859077,"teacher_disagreement_score":0.008561532,"about_ca_system_score_codex":0.0020620339,"about_ca_system_score_gemma":0.0010169632,"threshold_uncertainty_score":0.028641164},"labels":[],"label_agreement":null},{"id":"W2079125934","doi":"10.1016/j.tcs.2011.05.043","title":"Fuzzy quartile encoding as a preprocessing method for biomedical pattern classification","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pattern recognition (psychology); Feature (linguistics); Outlier; Artificial intelligence; Fuzzy logic; Mathematics; Quartile; Fuzzy set; Fuzzy classification; Preprocessor; Data mining; Feature vector; Computer science; Statistics","score_opus":0.03899991989929513,"score_gpt":0.2990199429433027,"score_spread":0.26002002304400756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079125934","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.027329497,0.0003235287,0.96771,0.00032952172,0.00010325669,0.000066970475,0.0005526205,0.0016427824,0.0019418555],"genre_scores_gemma":[0.29677948,0.00044533573,0.6963501,0.00018411984,0.00016360442,0.00014804339,0.0018688085,0.00038395467,0.003676535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994042,0.00015054371,0.00006857146,0.0000899996,0.00019244349,0.00009422689],"domain_scores_gemma":[0.99817276,0.00078239455,0.00013837428,0.00033211836,0.00048664887,0.000087610206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001250453,0.00041894044,0.0007122603,0.0021106265,0.00052353187,0.0017778642,0.0006794465,0.00061947457,0.006578687],"category_scores_gemma":[0.0043474296,0.00024644658,0.00072543044,0.0027039961,0.0005406966,0.0011375385,0.0009119184,0.0011236497,0.001879884],"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.00094294024,0.00018020168,0.0019065582,0.00029334935,0.000069929934,0.00021495858,0.00017110458,0.016263044,0.068483494,0.03600061,0.008842246,0.86663157],"study_design_scores_gemma":[0.00011654145,0.00048748156,0.00811701,0.00011585429,0.00016419453,0.00089975604,0.0002853608,0.7891157,0.10337525,0.07429043,0.022912515,0.00011992891],"about_ca_topic_score_codex":0.001197274,"about_ca_topic_score_gemma":0.001138788,"teacher_disagreement_score":0.006578687,"about_ca_system_score_codex":0.00042314915,"about_ca_system_score_gemma":0.0011436435,"threshold_uncertainty_score":0.022007883},"labels":[],"label_agreement":null},{"id":"W2079567772","doi":"10.1016/j.tcs.2014.11.015","title":"Descriptional complexity of unambiguous input-driven pushdown automata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Pushdown automaton; Deterministic pushdown automaton; Nondeterministic algorithm; Embedded pushdown automaton; Discrete mathematics; Homomorphism; Büchi automaton; Two-way deterministic finite automaton; Nested word; Nondeterministic finite automaton; Deterministic automaton; Mathematics; Deterministic context-free grammar; Combinatorics; Automaton; Computer science; Theoretical computer science; Automata theory; Quantum finite automata; Rule-based machine translation; Context-free grammar; Artificial intelligence","score_opus":0.02080017538274525,"score_gpt":0.24438166321694996,"score_spread":0.2235814878342047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079567772","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.5827055,0.0011019408,0.38367224,0.0057670483,0.000120024815,0.00014742593,0.001857509,0.00072134763,0.023906875],"genre_scores_gemma":[0.9812201,0.00035072715,0.014109846,0.00020672489,0.00007766353,0.00010806603,0.0006178068,0.000115390925,0.0031936932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930507,0.0018567131,0.0006065419,0.0010854229,0.0023690313,0.0010315988],"domain_scores_gemma":[0.96304035,0.029820789,0.0016352794,0.0023116195,0.0021385213,0.001053437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032652216,0.00077143434,0.0017604571,0.0016542879,0.0020498878,0.009366083,0.0034038238,0.0025722573,0.0067500453],"category_scores_gemma":[0.020014858,0.0012261373,0.0024940523,0.002409038,0.0040821275,0.016233113,0.005013554,0.0054805786,0.00047541386],"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.00024704708,0.00013696845,0.0018196778,0.00022541072,0.00006863496,0.00040258147,0.0010432394,0.04103806,0.0021879033,0.9414989,0.0012922098,0.010039488],"study_design_scores_gemma":[0.000028312545,0.000015589276,0.00023240373,0.000014345621,0.00002611736,0.00009100801,0.0001340941,0.06853805,0.0011070014,0.9293107,0.00047750754,0.000024836916],"about_ca_topic_score_codex":0.0026441377,"about_ca_topic_score_gemma":0.0021156662,"teacher_disagreement_score":0.009366083,"about_ca_system_score_codex":0.0042292173,"about_ca_system_score_gemma":0.0027073054,"threshold_uncertainty_score":0.030685246},"labels":[],"label_agreement":null},{"id":"W2079582928","doi":"10.1016/j.tcs.2009.05.001","title":"On the descriptional complexity of Watson–Crick automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":32,"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; Western University","funders":"","keywords":"Watson; Automaton; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Unary operation; Automata theory; Mathematics; Finite-state machine; Regular language; DFA minimization; Deterministic finite automaton; Discrete mathematics; Quantum finite automata; Combinatorics; Computer science; Theoretical computer science; Algorithm; DNA; Base pair","score_opus":0.030091879344747684,"score_gpt":0.2660095653318389,"score_spread":0.2359176859870912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079582928","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.42419684,0.0072149215,0.4395399,0.019707505,0.00053998985,0.00015152863,0.0012698594,0.00047496022,0.10690448],"genre_scores_gemma":[0.96967334,0.0018441596,0.021905728,0.0004471378,0.00040575728,0.00014912235,0.00053977955,0.00014550384,0.0048894617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637234,0.0012818434,0.00024460323,0.00040861577,0.0012827325,0.00040982052],"domain_scores_gemma":[0.9662905,0.028353013,0.0011342369,0.0023065156,0.0013594285,0.0005562892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033907145,0.0008194502,0.0016764881,0.0017814449,0.0019473614,0.00523097,0.003007132,0.0024758053,0.0053280466],"category_scores_gemma":[0.029620698,0.0010547944,0.0014694465,0.00227882,0.005090517,0.013637657,0.0034874901,0.0057194466,0.00053973164],"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.00003972096,0.000026619293,0.00035430334,0.00007127001,0.000015370491,0.00005614448,0.00017486293,0.026916938,0.00031528893,0.96609217,0.0011202039,0.0048170867],"study_design_scores_gemma":[0.0000060296716,0.0000045786883,0.00009054307,0.00001136831,0.0000047083436,0.000022199203,0.000030502633,0.0560027,0.00013274896,0.94317615,0.00050725,0.000011211782],"about_ca_topic_score_codex":0.003205558,"about_ca_topic_score_gemma":0.0015501302,"teacher_disagreement_score":0.0053280466,"about_ca_system_score_codex":0.003698106,"about_ca_system_score_gemma":0.0013755136,"threshold_uncertainty_score":0.026831806},"labels":[],"label_agreement":null},{"id":"W2080292561","doi":"10.1016/j.tcs.2011.08.026","title":"Counting maps on doughnuts","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics; Algorithm","score_opus":0.024539384326035415,"score_gpt":0.2379872145340342,"score_spread":0.2134478302079988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080292561","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.34314495,0.0009820038,0.6153131,0.0014442065,0.0002913857,0.000106244384,0.00041326866,0.0011434718,0.037161324],"genre_scores_gemma":[0.77221155,0.0011046138,0.18398266,0.00050031306,0.0005724122,0.00028665946,0.00080176035,0.00070006115,0.039840043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977106,0.0005042701,0.00014958164,0.0006074794,0.0006386826,0.00038929065],"domain_scores_gemma":[0.9879203,0.0072945985,0.0011816727,0.0014444187,0.0012098163,0.0009491294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018830746,0.0010184258,0.0015196045,0.006013991,0.0031700807,0.00539878,0.0025547405,0.0018656568,0.007526094],"category_scores_gemma":[0.01692954,0.0013528005,0.0009994416,0.006095762,0.0043315226,0.011317968,0.005112795,0.0029448646,0.0010788837],"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.00003285056,0.000018345256,0.0004799049,0.000032504304,0.0000069821253,0.000060716717,0.0002322082,0.0016558913,0.00053437863,0.98782,0.0009078197,0.00821831],"study_design_scores_gemma":[0.000007679621,0.0000126078985,0.00025196857,0.000016848673,0.000012886051,0.00011415718,0.00012478132,0.017047193,0.00077906216,0.97794616,0.0036724494,0.000014229076],"about_ca_topic_score_codex":0.002934653,"about_ca_topic_score_gemma":0.0023044804,"teacher_disagreement_score":0.007526094,"about_ca_system_score_codex":0.0022560616,"about_ca_system_score_gemma":0.0009854246,"threshold_uncertainty_score":0.0251773},"labels":[],"label_agreement":null},{"id":"W2080616298","doi":"10.1016/j.tcs.2012.02.001","title":"A linear partitioning algorithm for Hybrid Lyndons using<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>V</mml:mi></mml:math>-order","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lexicographical order; Factorization; Algorithm; Concatenation (mathematics); Order (exchange); String (physics); Computer science; Generalization; Mathematics; Edit distance; Discrete mathematics; Combinatorics","score_opus":0.019122432015830432,"score_gpt":0.26413282971905006,"score_spread":0.2450103977032196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080616298","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.01336958,0.0001783612,0.9796243,0.000111655725,0.000051244868,0.0000904182,0.000197702,0.0023811883,0.0039955056],"genre_scores_gemma":[0.07649239,0.00013156145,0.91262865,0.00009710396,0.00003974913,0.00021142972,0.0012861064,0.00076874037,0.008344225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999453,0.00008494663,0.000059984526,0.0001267223,0.00020613067,0.00006921825],"domain_scores_gemma":[0.99916446,0.00033147453,0.000046697256,0.0001743742,0.00022401646,0.000059019716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072493457,0.0006876188,0.00077593833,0.0014894699,0.0010315434,0.0016565701,0.0015729376,0.0007984632,0.014729707],"category_scores_gemma":[0.0025699853,0.00056184625,0.0007884616,0.0014682092,0.0007051522,0.0017268634,0.0021268437,0.0012770297,0.004837883],"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.0005882401,0.00015296433,0.0008211922,0.0002758841,0.000055615463,0.00014338212,0.0004174572,0.04862024,0.026272807,0.054160435,0.018581947,0.8499098],"study_design_scores_gemma":[0.000236754,0.00031596114,0.0006520177,0.00009231533,0.0000478013,0.00034651227,0.0004192917,0.86434656,0.031800743,0.070200786,0.031457677,0.000083596235],"about_ca_topic_score_codex":0.0055248723,"about_ca_topic_score_gemma":0.009449497,"teacher_disagreement_score":0.014729707,"about_ca_system_score_codex":0.0009855039,"about_ca_system_score_gemma":0.0012909496,"threshold_uncertainty_score":0.049275756},"labels":[],"label_agreement":null},{"id":"W2080745503","doi":"10.1016/j.tcs.2007.05.011","title":"Map construction of unknown graphs by multiple agents","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"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":"Rendezvous; Traverse; Graph; Computer science; Theoretical computer science; Combinatorics; Mathematics; Discrete mathematics; Algorithm","score_opus":0.01071225163422513,"score_gpt":0.2594873612681509,"score_spread":0.2487751096339258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080745503","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.059084058,0.00010583563,0.93481266,0.00032976113,0.000044812943,0.00008392001,0.00010529962,0.0006207251,0.0048128515],"genre_scores_gemma":[0.5845117,0.0002327641,0.40529865,0.00009206539,0.00004207253,0.00017712978,0.0003223293,0.00030667838,0.009016654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992675,0.00029510199,0.000022707782,0.00017925678,0.00014551655,0.00008978465],"domain_scores_gemma":[0.997456,0.0014259323,0.00013881929,0.0005692996,0.0002190356,0.00019098667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082562875,0.00068840006,0.0011504955,0.0011256782,0.0013928701,0.0015859039,0.0018539609,0.0016931574,0.0045497385],"category_scores_gemma":[0.0055892435,0.0008316221,0.0015690514,0.000967614,0.0013286651,0.003458294,0.0038490614,0.0017379789,0.0007190696],"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.00044456418,0.00019414553,0.0016875244,0.00036950462,0.00016202728,0.00059618615,0.00095112715,0.6354782,0.010826648,0.20894979,0.0048959907,0.13544425],"study_design_scores_gemma":[0.000028167093,0.00004208845,0.00022624359,0.000013933486,0.000031982792,0.00006619877,0.000119825665,0.8822056,0.0041725705,0.11074325,0.0023316918,0.000018494658],"about_ca_topic_score_codex":0.0035942874,"about_ca_topic_score_gemma":0.0028343042,"teacher_disagreement_score":0.0045497385,"about_ca_system_score_codex":0.000947457,"about_ca_system_score_gemma":0.00092355715,"threshold_uncertainty_score":0.015220404},"labels":[],"label_agreement":null},{"id":"W2081745941","doi":"10.1016/j.tcs.2012.03.043","title":"Lower bounds for the size of deterministic unranked tree automata","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"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":"Nondeterministic finite automaton; Nondeterministic algorithm; Automaton; Deterministic finite automaton; Deterministic automaton; Mathematics; Combinatorics; Upper and lower bounds; Tree (set theory); Discrete mathematics; Regular language; Computer science; Automata theory; Theoretical computer science","score_opus":0.013030139263550754,"score_gpt":0.2616167939493669,"score_spread":0.24858665468581612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081745941","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.36605018,0.008539893,0.53156215,0.017083565,0.0011793269,0.0003367476,0.0050400677,0.0057921847,0.06441579],"genre_scores_gemma":[0.8881777,0.002391325,0.08862635,0.0014571501,0.0014442394,0.00068503275,0.002669482,0.0014394124,0.013109381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919308,0.0021784112,0.00051735085,0.0014682022,0.0026143698,0.0012908998],"domain_scores_gemma":[0.8418501,0.13507333,0.0038110435,0.010623374,0.004633711,0.004008334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051589403,0.0018596002,0.002698607,0.0027398278,0.0022167135,0.006498889,0.0056168293,0.0040183617,0.014680682],"category_scores_gemma":[0.05119228,0.001589564,0.00214784,0.0025709695,0.0043658027,0.015794335,0.004732637,0.006316073,0.002375174],"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.0024066188,0.0006644548,0.005156788,0.0016263644,0.00026246,0.00049580046,0.0011650485,0.18066996,0.033542432,0.6813336,0.023522202,0.069154225],"study_design_scores_gemma":[0.00012895915,0.00012700837,0.0006965186,0.000093476556,0.00009107062,0.00019528672,0.00010481835,0.26964852,0.0071827797,0.7186316,0.0030260421,0.00007383055],"about_ca_topic_score_codex":0.00092107855,"about_ca_topic_score_gemma":0.0019442424,"teacher_disagreement_score":0.014680682,"about_ca_system_score_codex":0.003817931,"about_ca_system_score_gemma":0.002769389,"threshold_uncertainty_score":0.049111784},"labels":[],"label_agreement":null},{"id":"W2081804360","doi":"10.1016/j.tcs.2005.10.033","title":"Compatibility of unrooted phylogenetic trees is FPT","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Phylogenetic tree; Compatibility (geochemistry); Mathematics; Combinatorics; Tree (set theory); Discrete mathematics; Biology","score_opus":0.009351693141450177,"score_gpt":0.24839597547942832,"score_spread":0.23904428233797814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081804360","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.12641272,0.00069880084,0.82861185,0.0018585138,0.0006789968,0.00013837477,0.0016631321,0.0019815953,0.037956025],"genre_scores_gemma":[0.7029348,0.00061626226,0.28105396,0.00054022204,0.000794237,0.0002949272,0.0040141414,0.0012568668,0.008494616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939686,0.0019083056,0.00054544036,0.0014517796,0.0015408788,0.0005850979],"domain_scores_gemma":[0.9604696,0.02414141,0.0020986744,0.006807502,0.005266754,0.0012159676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057299235,0.0006394577,0.0011760708,0.0034845732,0.0018603464,0.0040296502,0.002234289,0.0022652852,0.011360445],"category_scores_gemma":[0.047468856,0.0007902605,0.0010187251,0.003449684,0.002255217,0.010127768,0.0033763573,0.0033597047,0.002929441],"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.00088065915,0.00019954127,0.009023017,0.00037718329,0.00012217226,0.0017645473,0.000955839,0.009555165,0.012788527,0.7026464,0.009922413,0.2517645],"study_design_scores_gemma":[0.000048249785,0.00017301633,0.0023330692,0.00007662383,0.00006753947,0.0019648569,0.00025786762,0.049711425,0.008750049,0.9131123,0.023455165,0.00004995765],"about_ca_topic_score_codex":0.00052535144,"about_ca_topic_score_gemma":0.0003904823,"teacher_disagreement_score":0.011360445,"about_ca_system_score_codex":0.0007366605,"about_ca_system_score_gemma":0.0012493602,"threshold_uncertainty_score":0.038004458},"labels":[],"label_agreement":null},{"id":"W2082273344","doi":"10.1016/s0304-3975(02)00577-7","title":"On the k-path partition of graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Indifference graph; Longest path problem; Discrete mathematics; Bipartite graph; Cograph; Pathwidth; Hamiltonian path problem; Complete bipartite graph; Partition (number theory); Frequency partition of a graph; Hamiltonian path; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.017306891891451286,"score_gpt":0.28038951099357523,"score_spread":0.26308261910212394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082273344","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.7016447,0.0021103285,0.18987915,0.003538862,0.00034950822,0.00016581283,0.0019656015,0.00045466266,0.09989133],"genre_scores_gemma":[0.9174067,0.0022249403,0.045298614,0.0007707077,0.00063373166,0.00024823964,0.003881537,0.00052129297,0.029014206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991115,0.0002608751,0.000036738005,0.00019476078,0.0001840955,0.00021208085],"domain_scores_gemma":[0.9961068,0.0023018455,0.00039373754,0.000489263,0.00027607923,0.00043219695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086996774,0.00088103814,0.0015377919,0.0023491147,0.0028248765,0.004203948,0.0017838513,0.0017281175,0.014798152],"category_scores_gemma":[0.0060677053,0.00090316875,0.0009625889,0.0036162108,0.0034686099,0.008397033,0.0029307783,0.0028753087,0.0019846617],"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.00041178236,0.00006513715,0.0012319975,0.00017816095,0.000032525662,0.00015557787,0.0010245452,0.013817813,0.0019251109,0.94942826,0.009774955,0.021954058],"study_design_scores_gemma":[0.00003848272,0.000029448041,0.0007148065,0.00003982018,0.000018794479,0.00010170388,0.00025761247,0.01718157,0.00028980584,0.9782103,0.003103665,0.000013903147],"about_ca_topic_score_codex":0.0031433962,"about_ca_topic_score_gemma":0.003057468,"teacher_disagreement_score":0.014798152,"about_ca_system_score_codex":0.00161028,"about_ca_system_score_gemma":0.00081295357,"threshold_uncertainty_score":0.049504817},"labels":[],"label_agreement":null},{"id":"W2082317627","doi":"10.1016/s0304-3975(01)00192-x","title":"Computing similarity between RNA structures","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"RNA; Combinatorics; Nucleic acid secondary structure; Protein tertiary structure; Similarity (geometry); Mathematics; Protein secondary structure; Maximization; Algorithm; Base pair; Time complexity; Nucleic acid structure; Set (abstract data type); Computer science; Chemistry; Biology; Genetics; DNA; Artificial intelligence; Mathematical optimization","score_opus":0.016584805876790128,"score_gpt":0.2512811595752036,"score_spread":0.23469635369841346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082317627","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7714613,0.0014704019,0.21722576,0.00059026293,0.00012622717,0.00013087339,0.0011272001,0.0021681183,0.0056998124],"genre_scores_gemma":[0.93841743,0.0002472669,0.057992563,0.00007475566,0.000102583595,0.000054029973,0.0020023931,0.00012534413,0.0009836305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806327,0.0003578765,0.00015709523,0.0006348054,0.0006312839,0.00015571166],"domain_scores_gemma":[0.9934975,0.003979158,0.00054398034,0.00116188,0.000515917,0.0003016521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011034822,0.00055554346,0.0015694742,0.005955228,0.0010111786,0.0021769158,0.0018573799,0.002064861,0.0055438145],"category_scores_gemma":[0.013631923,0.0004897742,0.0014109993,0.003858969,0.00106136,0.0048795533,0.0018725564,0.0010800337,0.00087102945],"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.0035900516,0.00088235573,0.0453292,0.0009695206,0.00082642835,0.001024817,0.0006207101,0.18734626,0.035495393,0.086100556,0.009209615,0.6286051],"study_design_scores_gemma":[0.0000934761,0.00038467164,0.0051503135,0.000033006123,0.00013378474,0.0005658245,0.00023133261,0.85614896,0.009617214,0.12561971,0.0019860764,0.000035710833],"about_ca_topic_score_codex":0.0012926968,"about_ca_topic_score_gemma":0.0019309324,"teacher_disagreement_score":0.005955228,"about_ca_system_score_codex":0.0011297098,"about_ca_system_score_gemma":0.000704642,"threshold_uncertainty_score":0.018545926},"labels":[],"label_agreement":null},{"id":"W2082407347","doi":"10.1016/j.tcs.2010.06.016","title":"On the number of episturmian palindromes","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"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":"Euler's totient function; Palindrome; Mathematics; Alphabet; Combinatorics; Function (biology); Euler's formula; Prefix; Enumeration; Generalization; Discrete mathematics; Mathematical analysis","score_opus":0.006382837415070408,"score_gpt":0.2457086827320534,"score_spread":0.239325845316983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082407347","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.88053983,0.0014814566,0.07211269,0.0039827256,0.0003141723,0.00007370464,0.0008177729,0.00038318706,0.040294446],"genre_scores_gemma":[0.98197144,0.00034360398,0.012581104,0.00023228931,0.00034418597,0.00010960762,0.00031557019,0.000087155524,0.0040151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964359,0.00112145,0.00031541576,0.000913443,0.0007637654,0.00045001926],"domain_scores_gemma":[0.94825107,0.041383103,0.0032727746,0.0028694689,0.0016790044,0.0025447044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003809585,0.0007776423,0.0018286365,0.0027830482,0.0028546916,0.005622939,0.003262724,0.0027943235,0.0099147605],"category_scores_gemma":[0.0227082,0.0011360873,0.00105777,0.0016769727,0.0054502646,0.010375224,0.003069488,0.0032392992,0.0008594986],"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.0014368776,0.00020355484,0.0065856706,0.0003335987,0.00009445402,0.00050640083,0.0008774687,0.008574655,0.008197168,0.9483566,0.0030181808,0.021815315],"study_design_scores_gemma":[0.00016942728,0.00014944008,0.0018915089,0.00006892693,0.000086493485,0.0008805155,0.00026995045,0.030790849,0.0029473274,0.9603083,0.002373099,0.000064169755],"about_ca_topic_score_codex":0.0002841918,"about_ca_topic_score_gemma":0.00039416508,"teacher_disagreement_score":0.0099147605,"about_ca_system_score_codex":0.001287447,"about_ca_system_score_gemma":0.00081347354,"threshold_uncertainty_score":0.033168137},"labels":[],"label_agreement":null},{"id":"W2082853563","doi":"10.1016/j.tcs.2008.01.037","title":"On the weight of universal insertion grammars","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Recursively enumerable language; Rule-based machine translation; Morphism; Mathematics; Regular language; Indexed grammar; Discrete mathematics; Computer science; Context-sensitive grammar; Programming language; Context-free grammar; Theoretical computer science; Natural language processing; Automaton","score_opus":0.010292168348289705,"score_gpt":0.21424115294548252,"score_spread":0.20394898459719282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082853563","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.43315047,0.004394356,0.40647346,0.013595842,0.0010886061,0.00008336048,0.00065712555,0.00080591324,0.13975088],"genre_scores_gemma":[0.96089536,0.0017035953,0.020627273,0.00089447096,0.0011791702,0.00009990919,0.00033749788,0.0004234028,0.013839306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753153,0.0007750208,0.000106009385,0.00035131056,0.0008195924,0.0004165591],"domain_scores_gemma":[0.9673227,0.026419347,0.0011216265,0.0025573361,0.0015378465,0.001041099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030601725,0.0010729061,0.0019059161,0.003679916,0.0022557997,0.0044802064,0.0026020021,0.002697183,0.010059607],"category_scores_gemma":[0.031135147,0.0010285294,0.0008981999,0.0036726084,0.006700984,0.013416838,0.0049079363,0.0052082143,0.0009794761],"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.00006537647,0.000014927899,0.0003328515,0.000044504464,0.000009641881,0.000041392184,0.00013513572,0.002602747,0.0003249488,0.9866426,0.0010779273,0.008707978],"study_design_scores_gemma":[0.000008489699,0.000004682894,0.00006235396,0.000011896434,0.000006030188,0.000025178604,0.000016969258,0.0067659295,0.00013201618,0.99216664,0.00079397653,0.0000057889197],"about_ca_topic_score_codex":0.001367458,"about_ca_topic_score_gemma":0.0012458687,"teacher_disagreement_score":0.010059607,"about_ca_system_score_codex":0.0019391692,"about_ca_system_score_gemma":0.00097093027,"threshold_uncertainty_score":0.033652723},"labels":[],"label_agreement":null},{"id":"W2083006134","doi":"10.1016/j.tcs.2013.03.001","title":"Infinite ternary square-free words concatenated from permutations of a single word","year":2013,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Ternary operation; Square-free integer; Morphism; Combinatorics; Word (group theory); Square (algebra); Mathematics; Factorization; Discrete mathematics; Arithmetic; Computer science; Algorithm; Geometry","score_opus":0.0166314847851349,"score_gpt":0.24482904076071738,"score_spread":0.22819755597558247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083006134","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.43686214,0.0010642043,0.4954075,0.0010070414,0.0011684509,0.00015768777,0.0013408716,0.0039742473,0.059017852],"genre_scores_gemma":[0.8587386,0.00038090922,0.09959131,0.0003784526,0.0003095782,0.00017298786,0.0012372362,0.000819888,0.03837096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990459,0.00016260557,0.00010516261,0.00025481376,0.0002629909,0.00016858277],"domain_scores_gemma":[0.99785304,0.00081762066,0.00031104148,0.00042192556,0.00038698333,0.0002094189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051460066,0.00063045614,0.00066046097,0.0008016301,0.0013031431,0.0020475083,0.00081699376,0.00088345446,0.010246812],"category_scores_gemma":[0.0033093418,0.00052277563,0.00068930205,0.0010451991,0.0015643955,0.003507878,0.0024461558,0.0010298608,0.0037209147],"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.001144894,0.00010918285,0.0017469829,0.0004795015,0.00006475203,0.00298349,0.0017026502,0.0062728166,0.08760883,0.81455,0.00639664,0.07694029],"study_design_scores_gemma":[0.00008757024,0.00027620487,0.0011445296,0.0001786784,0.00013572823,0.0015545056,0.00040879688,0.0283504,0.091379896,0.81906116,0.057308808,0.0001137249],"about_ca_topic_score_codex":0.0003353562,"about_ca_topic_score_gemma":0.0005769358,"teacher_disagreement_score":0.010246812,"about_ca_system_score_codex":0.0005011659,"about_ca_system_score_gemma":0.0010927629,"threshold_uncertainty_score":0.03427899},"labels":[],"label_agreement":null},{"id":"W2083420236","doi":"10.1016/j.tcs.2008.02.048","title":"Improved upper bounds on the L(2,1) -labeling of the skew and converse skew product graphs","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Skew; Converse; Mathematics; Combinatorics; Product (mathematics); Upper and lower bounds; Discrete mathematics; Computer science; Telecommunications","score_opus":0.011870947777317311,"score_gpt":0.21092350078615546,"score_spread":0.19905255300883815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083420236","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.25697446,0.0074842763,0.55817264,0.007551318,0.00090074644,0.0003511396,0.004528152,0.0038673773,0.1601699],"genre_scores_gemma":[0.65943193,0.0035582706,0.30302703,0.00229762,0.0010450496,0.00065749296,0.005056449,0.00176419,0.023161927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665004,0.0009670808,0.00015245173,0.0006530258,0.0009163702,0.00066102436],"domain_scores_gemma":[0.977193,0.015348915,0.0009332948,0.0033923092,0.0016780718,0.0014543824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003987649,0.0024854299,0.0024767984,0.0029549513,0.0030310927,0.0063103116,0.00505162,0.0027494559,0.017124865],"category_scores_gemma":[0.018116059,0.001671635,0.0017498129,0.0038253574,0.003528292,0.01205562,0.0067148623,0.0069064316,0.0042723683],"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.0012051036,0.0004420336,0.0032160177,0.00075023907,0.000082756545,0.00022622148,0.0011313384,0.058442667,0.014052636,0.81137645,0.03598348,0.073091],"study_design_scores_gemma":[0.00011546709,0.00015503367,0.0017995982,0.00018108117,0.00016085905,0.000412049,0.00038392306,0.19694309,0.01126271,0.77022284,0.018239105,0.00012424025],"about_ca_topic_score_codex":0.0022100967,"about_ca_topic_score_gemma":0.004228414,"teacher_disagreement_score":0.017124865,"about_ca_system_score_codex":0.0047518164,"about_ca_system_score_gemma":0.0026697945,"threshold_uncertainty_score":0.05728835},"labels":[],"label_agreement":null},{"id":"W2083770519","doi":"10.1016/s0304-3975(03)00090-2","title":"The ring of k-regular sequences, II","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":227,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ring (chemistry); Mathematics; State (computer science); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm","score_opus":0.007250582662101844,"score_gpt":0.22411700245009575,"score_spread":0.2168664197879939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083770519","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.25286928,0.042887196,0.20010994,0.011412212,0.003491667,0.0000976608,0.0017682862,0.00078596233,0.4865778],"genre_scores_gemma":[0.90871865,0.0054527377,0.026541576,0.00068785966,0.0015465312,0.000074178686,0.00043357123,0.000085567444,0.056459423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954385,0.00010018168,0.00003343253,0.00015619732,0.000098900535,0.00006741183],"domain_scores_gemma":[0.99935144,0.00026746345,0.00008833234,0.00010893948,0.00009243792,0.000091391834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634659,0.00027738017,0.0005482268,0.00086209335,0.0010544775,0.0036169724,0.00049406156,0.00039078004,0.0040262127],"category_scores_gemma":[0.0014053977,0.00026207187,0.000452995,0.00094021746,0.0030143731,0.005375158,0.00095653767,0.0015493887,0.0013089771],"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.000040008115,0.000006069088,0.00014107226,0.000045966044,0.0000042373026,0.000023579949,0.00021027564,0.00035983464,0.00074236456,0.98967427,0.0023388918,0.006413431],"study_design_scores_gemma":[0.000008964042,0.000022900023,0.00032786897,0.000018157109,0.000005897517,0.00011130972,0.00011139457,0.0010894054,0.00053593295,0.97647583,0.021283574,0.000008809115],"about_ca_topic_score_codex":0.00042417174,"about_ca_topic_score_gemma":0.00021617253,"teacher_disagreement_score":0.0040262127,"about_ca_system_score_codex":0.0009831791,"about_ca_system_score_gemma":0.00052679185,"threshold_uncertainty_score":0.013468981},"labels":[],"label_agreement":null},{"id":"W2083810917","doi":"10.1016/j.tcs.2011.06.021","title":"Finite state complexity","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Finite-state machine; Upper and lower bounds; Turing machine; Descriptive complexity theory; Deterministic finite automaton; Prefix; Finite set; State (computer science); Kolmogorov complexity; Finite state; Complexity class; Discrete mathematics; Time complexity; Algorithm","score_opus":0.0383737367207392,"score_gpt":0.24576939112310286,"score_spread":0.20739565440236366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083810917","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.106567755,0.0051248074,0.4705296,0.013717121,0.00078515726,0.00018418505,0.0022197983,0.00108674,0.3997848],"genre_scores_gemma":[0.895148,0.0024515102,0.033526365,0.0008391615,0.0009476735,0.00026937705,0.0014130517,0.00028484006,0.06512009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997983,0.00037629335,0.00012170651,0.0005507908,0.0007462452,0.00022186893],"domain_scores_gemma":[0.9928965,0.004743697,0.00021705573,0.0012024363,0.00069548876,0.00024480128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010082389,0.00068918715,0.001514818,0.0015413037,0.0020922578,0.0055245706,0.0014298836,0.0016226819,0.021802425],"category_scores_gemma":[0.0072106654,0.0005590511,0.0014739782,0.0022127104,0.0038279314,0.011608507,0.0028187367,0.004807249,0.0027379366],"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.000008116908,0.0000097522425,0.000083186766,0.000028379658,0.0000057832167,0.000017260707,0.00010976025,0.00094049424,0.00015765191,0.9922069,0.0015625278,0.0048703244],"study_design_scores_gemma":[0.0000021813673,0.0000022812208,0.000045327943,0.000004397721,0.0000033432148,0.000017873475,0.000015178036,0.0021599093,0.00012714391,0.99445564,0.0031637577,0.0000030406372],"about_ca_topic_score_codex":0.0011493711,"about_ca_topic_score_gemma":0.00063697144,"teacher_disagreement_score":0.021802425,"about_ca_system_score_codex":0.0026999975,"about_ca_system_score_gemma":0.0014637107,"threshold_uncertainty_score":0.072936356},"labels":[],"label_agreement":null},{"id":"W2083970526","doi":"10.1016/s0304-3975(02)00048-8","title":"Structuring the elementary components of graphs having a perfect internal matching","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Structuring; Computer science; Mathematics; Matching (statistics); Combinatorics; Theoretical computer science","score_opus":0.01473154606041251,"score_gpt":0.28159802193216416,"score_spread":0.26686647587175166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083970526","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.5223445,0.00044347692,0.4178468,0.00040717464,0.000094943316,0.00032305685,0.0007087971,0.0014388589,0.05639233],"genre_scores_gemma":[0.7399063,0.00044750154,0.23493397,0.00018160086,0.000051583625,0.00016472697,0.0017685075,0.0007479497,0.0217978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957687,0.000060169812,0.000029473807,0.0001193012,0.00008663528,0.0001276385],"domain_scores_gemma":[0.9987834,0.00028947202,0.00013154274,0.0003890301,0.00023443857,0.00017210601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030055645,0.0004625348,0.0005234662,0.0012112834,0.0013345438,0.0026519925,0.0010408142,0.0009078671,0.0062038344],"category_scores_gemma":[0.0018791157,0.0006165554,0.00076236215,0.0014328839,0.0013411606,0.0030343696,0.001921717,0.0008964215,0.0021145872],"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.0008052713,0.00022096507,0.0040858723,0.0004894067,0.00006843487,0.000690828,0.0027649952,0.010597986,0.087558866,0.7314219,0.006361203,0.15493427],"study_design_scores_gemma":[0.000061276754,0.00020554103,0.0035352898,0.00013873057,0.00019423116,0.00049056223,0.0018105295,0.022992833,0.047862157,0.8828333,0.039829295,0.000046281482],"about_ca_topic_score_codex":0.0012193338,"about_ca_topic_score_gemma":0.0019550016,"teacher_disagreement_score":0.0062038344,"about_ca_system_score_codex":0.0005497199,"about_ca_system_score_gemma":0.00071586255,"threshold_uncertainty_score":0.02075386},"labels":[],"label_agreement":null},{"id":"W2084170146","doi":"10.1016/j.tcs.2014.07.025","title":"A second look at counting triangles in graph streams","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Streaming algorithm; Combinatorics; Mathematics; Constant (computer programming); Graph; Space (punctuation); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Computer science","score_opus":0.00985627178227796,"score_gpt":0.2302904869943695,"score_spread":0.22043421521209153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084170146","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.041395497,0.020440454,0.73207945,0.062560245,0.004965373,0.0001977898,0.0020310583,0.0017613338,0.1345688],"genre_scores_gemma":[0.3467933,0.013941297,0.4602021,0.02453594,0.013372541,0.00031919134,0.0024005275,0.0025799514,0.13585517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997773,0.0006401709,0.00011197333,0.00056318066,0.0006457825,0.00026591317],"domain_scores_gemma":[0.9871683,0.007846951,0.0004991542,0.0018977819,0.0016882578,0.00089954847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020864299,0.001461547,0.0024976674,0.006341857,0.0030105223,0.0069901026,0.004074139,0.004157742,0.03556181],"category_scores_gemma":[0.01913656,0.0008337096,0.0021399395,0.008728403,0.005142277,0.034602676,0.0036639958,0.009402795,0.003298907],"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.0001530337,0.00010405294,0.0010756587,0.00030199275,0.000055240496,0.00017690584,0.00048003456,0.0030875166,0.0013209332,0.9145917,0.035738114,0.042914826],"study_design_scores_gemma":[0.000030634426,0.000064092266,0.000538165,0.00014259307,0.000060380007,0.00035108597,0.00037388146,0.01771974,0.0012284744,0.93657637,0.042869434,0.000045078028],"about_ca_topic_score_codex":0.0047202324,"about_ca_topic_score_gemma":0.0048721707,"teacher_disagreement_score":0.03556181,"about_ca_system_score_codex":0.00293347,"about_ca_system_score_gemma":0.0011003535,"threshold_uncertainty_score":0.11896604},"labels":[],"label_agreement":null},{"id":"W2084172672","doi":"10.1016/j.tcs.2011.07.010","title":"Hardness results for covering arrays avoiding forbidden edges and error-locating arrays","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada","keywords":"Clique; Enhanced Data Rates for GSM Evolution; Binary number; Reduction (mathematics); Time complexity; Combinatorics; Hardness of approximation; Computer science; Computational complexity theory; Discrete mathematics; Mathematics; Algorithm; Approximation algorithm; Arithmetic; Artificial intelligence; Geometry","score_opus":0.057304972214434674,"score_gpt":0.28066317984675326,"score_spread":0.2233582076323186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084172672","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.19810046,0.0016772925,0.7458919,0.005617522,0.00027496027,0.00023212368,0.0015612667,0.0024204375,0.04422404],"genre_scores_gemma":[0.8245463,0.0016194723,0.15579426,0.0015862546,0.0005881679,0.00036766758,0.0022865136,0.000874069,0.012337328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958068,0.0010707257,0.00026728833,0.00082470046,0.0013143187,0.00071602035],"domain_scores_gemma":[0.95496976,0.03756806,0.0016910356,0.0039148913,0.0010918947,0.00076444534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018146867,0.0018852152,0.0020251772,0.0016911896,0.0021420035,0.0035966071,0.004386523,0.0032305385,0.010437593],"category_scores_gemma":[0.024233095,0.0019292837,0.0030739477,0.002784229,0.003942846,0.01232188,0.004251009,0.00631158,0.001185517],"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.0019430239,0.0007621286,0.008253856,0.0026012661,0.0005354344,0.0015572278,0.0021638903,0.26083288,0.017024191,0.5427304,0.035598606,0.12599717],"study_design_scores_gemma":[0.00022612353,0.00013424952,0.0016869693,0.000119492855,0.0002553319,0.00079448894,0.00037283514,0.18402515,0.006385953,0.7997652,0.0061513023,0.000082926956],"about_ca_topic_score_codex":0.0023123831,"about_ca_topic_score_gemma":0.0022701437,"teacher_disagreement_score":0.010437593,"about_ca_system_score_codex":0.0014024002,"about_ca_system_score_gemma":0.001305575,"threshold_uncertainty_score":0.034917176},"labels":[],"label_agreement":null},{"id":"W2084661883","doi":"10.1016/j.tcs.2009.02.025","title":"State complexity of power","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Combinatorics; Nondeterministic algorithm; Alphabet; Regular language; Nondeterministic finite automaton; Deterministic finite automaton; State (computer science); Upper and lower bounds; Mathematics; Finite-state machine; Function (biology); Discrete mathematics; Time complexity; Constant (computer programming); Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.014499479140722055,"score_gpt":0.25283446374698176,"score_spread":0.2383349846062597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084661883","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.61607915,0.0012602025,0.21025968,0.0063762995,0.00015162013,0.00010444836,0.0012173855,0.0005679861,0.16398332],"genre_scores_gemma":[0.98803234,0.0002075062,0.0037435724,0.00009664256,0.00011742956,0.000059929174,0.00023056936,0.00007372378,0.007438301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976265,0.0005455138,0.00011688754,0.0004955682,0.00077657984,0.00043900622],"domain_scores_gemma":[0.9813448,0.0132487975,0.0007930216,0.0025897603,0.0012123664,0.00081131095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624701,0.0004874102,0.0013942643,0.0018716484,0.0021841335,0.0068139085,0.0016159096,0.0015132697,0.017676188],"category_scores_gemma":[0.015345587,0.00065457966,0.0012444467,0.002235061,0.0045685507,0.016861426,0.0032433032,0.00390947,0.0009522394],"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.00003913016,0.000015214552,0.00033442583,0.000020506597,0.000006988806,0.000024640349,0.00028164982,0.0025298218,0.0002234803,0.9930565,0.0006761466,0.002791469],"study_design_scores_gemma":[0.000008288669,0.000005753463,0.00019502817,0.0000042343745,0.000007046971,0.000023238412,0.0000605721,0.011613966,0.00024834843,0.9870964,0.0007301737,0.000007025833],"about_ca_topic_score_codex":0.0017393586,"about_ca_topic_score_gemma":0.0009193986,"teacher_disagreement_score":0.017676188,"about_ca_system_score_codex":0.0022961241,"about_ca_system_score_gemma":0.0011349699,"threshold_uncertainty_score":0.059132695},"labels":[],"label_agreement":null},{"id":"W2084807618","doi":"10.1016/j.tcs.2004.02.031","title":"Deletion along trajectories","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":47,"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":"Decidability; Closure (psychology); Regular language; Mathematical proof; Formal language; Mathematics; Inverse; Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Algorithm; Automaton","score_opus":0.007075571221615482,"score_gpt":0.22688505009427937,"score_spread":0.2198094788726639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084807618","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.20498171,0.00064114976,0.5843671,0.0026683589,0.00081662985,0.0002713947,0.0021621066,0.0027064504,0.20138508],"genre_scores_gemma":[0.6719773,0.00097097724,0.103610456,0.0006215268,0.00023865157,0.0003412845,0.0041605127,0.0024723157,0.21560706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980484,0.00026999135,0.00012588724,0.000675976,0.0005168538,0.00036287055],"domain_scores_gemma":[0.9949797,0.0015751016,0.0003048516,0.0014884232,0.0012366617,0.00041534766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010046987,0.0008908292,0.0011224343,0.0016780427,0.0038514538,0.0035732244,0.0018289611,0.0017721048,0.026602412],"category_scores_gemma":[0.006993387,0.00071897334,0.0013485112,0.001895403,0.002706206,0.008393473,0.0045072245,0.0037665265,0.007781181],"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.0001432812,0.000034653953,0.000666487,0.00007860744,0.0000114730765,0.0005852988,0.00097392703,0.0015478119,0.004499225,0.96325374,0.00380698,0.024398535],"study_design_scores_gemma":[0.000020963642,0.000031128206,0.00029545111,0.00004053121,0.000020361993,0.00054297433,0.00065126107,0.005406213,0.0068325987,0.9501979,0.03593421,0.000026408341],"about_ca_topic_score_codex":0.0018750866,"about_ca_topic_score_gemma":0.0011619803,"teacher_disagreement_score":0.026602412,"about_ca_system_score_codex":0.001389544,"about_ca_system_score_gemma":0.0015229747,"threshold_uncertainty_score":0.08899397},"labels":[],"label_agreement":null},{"id":"W2084869467","doi":"10.1016/j.tcs.2009.02.035","title":"State complexity of unique rational operations","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; State (computer science); Regular language; Theoretical computer science; Computational complexity theory; Time complexity; Algorithm; Automaton","score_opus":0.019159765986843016,"score_gpt":0.2675043142512131,"score_spread":0.2483445482643701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084869467","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.84790367,0.00062488863,0.118761085,0.002010637,0.00006522887,0.00005380743,0.000566901,0.0002643012,0.029749464],"genre_scores_gemma":[0.992687,0.00021008847,0.0038113426,0.000053669333,0.00006467895,0.000037803467,0.00021741491,0.000039202427,0.0028786995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760145,0.00054193893,0.00014810135,0.00044169227,0.0007935618,0.00047334612],"domain_scores_gemma":[0.9768513,0.01860655,0.0011126786,0.0015945768,0.0010568295,0.0007780708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001868922,0.00053301064,0.0014102034,0.0017538179,0.0017073812,0.007297028,0.0016140398,0.0015186223,0.00893812],"category_scores_gemma":[0.013713592,0.0006771678,0.0013264107,0.0018603703,0.0036093981,0.013875721,0.003067958,0.0036144296,0.00047907868],"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.0001370685,0.000043722746,0.00089428923,0.000053307765,0.00001542999,0.000055885455,0.00052794773,0.009701556,0.0007888151,0.9816964,0.0005576756,0.0055277664],"study_design_scores_gemma":[0.000017731372,0.000016459411,0.00039778254,0.000008568397,0.000017080984,0.00003615358,0.00010733867,0.03837544,0.0007499577,0.9598572,0.00039801895,0.000018233648],"about_ca_topic_score_codex":0.0016774645,"about_ca_topic_score_gemma":0.0013662232,"teacher_disagreement_score":0.00893812,"about_ca_system_score_codex":0.0024490743,"about_ca_system_score_gemma":0.0013769639,"threshold_uncertainty_score":0.029901028},"labels":[],"label_agreement":null},{"id":"W2084955549","doi":"10.1016/s0304-3975(03)00286-x","title":"On universally easy classes for NP-complete problems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Time complexity; Mathematics; NP-complete; Intersection (aeronautics); P versus NP problem; Polynomial; Combinatorics; Discrete mathematics; Computer science","score_opus":0.026521373393528832,"score_gpt":0.287435863305529,"score_spread":0.26091448991200017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084955549","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.16690701,0.008317287,0.56879586,0.016326545,0.0015775318,0.0004609929,0.001948107,0.0015805631,0.23408607],"genre_scores_gemma":[0.8233527,0.0063037756,0.10929304,0.0032568714,0.0035564725,0.0009727066,0.0040206136,0.0015074499,0.047736265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99465114,0.001267741,0.00032225644,0.0011220215,0.0014987469,0.0011380676],"domain_scores_gemma":[0.97701913,0.01874487,0.000780729,0.0014881821,0.000811743,0.0011553115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004685966,0.0027332809,0.0029645152,0.0053852084,0.0049350318,0.008233516,0.00405092,0.003318453,0.020369448],"category_scores_gemma":[0.024702687,0.0021747747,0.0037512898,0.0054387003,0.0077223955,0.025969675,0.01081274,0.016648544,0.002048093],"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.00018765083,0.00013059187,0.0005795949,0.00025699535,0.00003100205,0.0001183798,0.00065767654,0.0038963556,0.00047490653,0.96748257,0.006457955,0.019726386],"study_design_scores_gemma":[0.00004288232,0.00001871204,0.00028318286,0.000058158712,0.000025120704,0.000061048755,0.00010107129,0.004705921,0.00015972451,0.9903081,0.0042145965,0.00002137402],"about_ca_topic_score_codex":0.0036763563,"about_ca_topic_score_gemma":0.0044288617,"teacher_disagreement_score":0.020369448,"about_ca_system_score_codex":0.005448453,"about_ca_system_score_gemma":0.0017866837,"threshold_uncertainty_score":0.06814259},"labels":[],"label_agreement":null},{"id":"W2085202968","doi":"10.1016/j.tcs.2004.06.028","title":"Template-guided DNA recombination","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Saskatchewan","funders":"","keywords":"Recombination; DNA; Gene; Genome; Genetics; Process (computing); Computer science; Computational biology; Biology; Theoretical computer science; Computation; Algorithm; Programming language","score_opus":0.01405394857149718,"score_gpt":0.26742032745287747,"score_spread":0.2533663788813803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085202968","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.093611896,0.0021151486,0.8524664,0.00063773716,0.00043844077,0.00013659798,0.00014349545,0.0025376035,0.04791264],"genre_scores_gemma":[0.7772965,0.001063643,0.1871629,0.00033920194,0.00007658507,0.0001546468,0.00035971685,0.0005157465,0.03303099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996731,0.00007851179,0.000010616278,0.0000823002,0.000110761706,0.000044705324],"domain_scores_gemma":[0.999577,0.00018476341,0.00003589856,0.0001290995,0.000035061148,0.00003828166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004392484,0.00038964042,0.00066032854,0.0003922083,0.00042107765,0.0009832291,0.0013179492,0.0013715083,0.005587421],"category_scores_gemma":[0.0013601319,0.00036170986,0.0005503264,0.00055110856,0.0006903181,0.0007598842,0.0011207109,0.0013768446,0.0021681974],"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.0005161693,0.0002268883,0.0005191378,0.0003025617,0.000081221755,0.0002513588,0.0003066827,0.10946089,0.2041777,0.43407932,0.008411042,0.24166702],"study_design_scores_gemma":[0.00012605872,0.00018996123,0.00030647186,0.00003531352,0.000042870997,0.00045190012,0.00004575089,0.663031,0.13977316,0.16462594,0.031316087,0.000055607754],"about_ca_topic_score_codex":0.00024569934,"about_ca_topic_score_gemma":0.0002559481,"teacher_disagreement_score":0.005587421,"about_ca_system_score_codex":0.000499056,"about_ca_system_score_gemma":0.00031279112,"threshold_uncertainty_score":0.018691838},"labels":[],"label_agreement":null},{"id":"W2085216434","doi":"10.1016/s0304-3975(00)00144-4","title":"The ultimate strategy to search on m rays?","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Competitive analysis; Upper and lower bounds; Mathematics; Combinatorics; Algorithm; Computer science; Mathematical analysis","score_opus":0.02509891212686544,"score_gpt":0.30945091024063853,"score_spread":0.2843519981137731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085216434","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.07438202,0.006781055,0.7807874,0.02637974,0.0010550016,0.0001375134,0.0004299018,0.0010153591,0.109032005],"genre_scores_gemma":[0.56570363,0.0031638723,0.37024513,0.0031529309,0.00064635143,0.00024523409,0.0004165875,0.00055753975,0.05586856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990693,0.000413295,0.000048526264,0.00017443193,0.0001431271,0.00015145518],"domain_scores_gemma":[0.9974752,0.001290876,0.00019786485,0.00050929835,0.0002755764,0.00025106623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016837232,0.000774751,0.0011054329,0.00092236476,0.0014544284,0.0033859725,0.0017984966,0.0035895072,0.016008869],"category_scores_gemma":[0.013212392,0.00074393145,0.00076516723,0.001079047,0.0025135966,0.0070541026,0.0022812323,0.0026301788,0.004459389],"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.00036046185,0.000096420496,0.0017670913,0.00026114722,0.00008859085,0.0000986246,0.0002778004,0.017476676,0.0014186796,0.7949327,0.022821784,0.16039993],"study_design_scores_gemma":[0.00007201312,0.00012328473,0.00037285828,0.00019451222,0.000043136788,0.00026756938,0.0004944738,0.07971374,0.0015291832,0.88358647,0.033565383,0.000037457557],"about_ca_topic_score_codex":0.0007909136,"about_ca_topic_score_gemma":0.0011123361,"teacher_disagreement_score":0.016008869,"about_ca_system_score_codex":0.00085002364,"about_ca_system_score_gemma":0.0010022693,"threshold_uncertainty_score":0.05355507},"labels":[],"label_agreement":null},{"id":"W2085334526","doi":"10.1016/s0304-3975(03)00220-2","title":"Two bijective proofs for the arborescent form of the Good–Lagrange formula and some applications to colored rooted trees and cacti","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Colored; Mathematical proof; Mathematics; Bijection; Combinatorics; Polyomino; Algebra over a field; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.020873280411200817,"score_gpt":0.3137634951874374,"score_spread":0.29289021477623656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085334526","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.04104575,0.0019949656,0.8063367,0.008159383,0.0018682864,0.00017133506,0.0005717796,0.0007534431,0.13909839],"genre_scores_gemma":[0.5000313,0.0038589004,0.40924928,0.0045395303,0.0030622724,0.00050815963,0.0011217335,0.0012416452,0.07638721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836046,0.00047170557,0.0001282464,0.00026293556,0.00058791944,0.00018867601],"domain_scores_gemma":[0.9933518,0.0039495016,0.00039461433,0.0008909167,0.0009854835,0.0004277185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028709564,0.0012965377,0.0010323834,0.0032982847,0.0036017697,0.0043555303,0.0028216064,0.0025506953,0.017597176],"category_scores_gemma":[0.013960245,0.0012066098,0.0021521223,0.0042431788,0.0045839576,0.011181166,0.0052102925,0.009189161,0.0020722195],"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.000011393885,0.000027355378,0.000084005595,0.00005484755,0.000006144934,0.00008532637,0.00019556227,0.00024327838,0.0004324596,0.987194,0.003338823,0.008326819],"study_design_scores_gemma":[0.000015039551,0.000012054139,0.0001330341,0.000028418917,0.000017478307,0.00016992197,0.00006077713,0.002236096,0.00085898023,0.98532003,0.011120951,0.000027058826],"about_ca_topic_score_codex":0.0011704162,"about_ca_topic_score_gemma":0.0022485766,"teacher_disagreement_score":0.017597176,"about_ca_system_score_codex":0.0022500993,"about_ca_system_score_gemma":0.0012012194,"threshold_uncertainty_score":0.05886841},"labels":[],"label_agreement":null},{"id":"W2085490472","doi":"10.1016/j.tcs.2007.07.031","title":"An infinite hierarchy induced by depth synchronization","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Saskatchewan; Western University","funders":"","keywords":"Synchronization (alternating current); Measure (data warehouse); Hierarchy; Logarithm; Mathematics; Context (archaeology); Bounded function; Grammar; Constant (computer programming); Word (group theory); Discrete mathematics; Computer science; Combinatorics; Topology (electrical circuits); Mathematical analysis; Linguistics; Geometry; Programming language; Data mining","score_opus":0.009671298505598903,"score_gpt":0.27280782412570487,"score_spread":0.263136525620106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085490472","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.65318894,0.00072867965,0.2583032,0.0023368848,0.0002297949,0.0000849835,0.0005303793,0.001152362,0.08344487],"genre_scores_gemma":[0.96319604,0.000203126,0.024734559,0.00034019505,0.00011941753,0.00006681171,0.0001799528,0.0001806397,0.010979248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927133,0.000138432,0.000036218964,0.00013518358,0.00021127392,0.00020756485],"domain_scores_gemma":[0.9958352,0.0020077808,0.00034605994,0.00040593446,0.00046866515,0.0009363256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007104246,0.00036687712,0.0008712399,0.0016483323,0.0021040495,0.0025544418,0.0012034727,0.0011089197,0.006137691],"category_scores_gemma":[0.005130851,0.0006424191,0.00067423936,0.0009531779,0.0022442248,0.0036105865,0.0028429395,0.0022261483,0.0005374541],"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.000044465152,0.000015637477,0.0002664009,0.000032230222,0.000006375656,0.00011134362,0.00028353606,0.0008218256,0.003801435,0.9913106,0.0006073341,0.002698915],"study_design_scores_gemma":[0.000033838853,0.000016615288,0.0003104119,0.000014461269,0.000011984548,0.00014832817,0.00009856693,0.015832745,0.0011285354,0.9805093,0.0018782736,0.000017038921],"about_ca_topic_score_codex":0.0012832003,"about_ca_topic_score_gemma":0.0017720433,"teacher_disagreement_score":0.006137691,"about_ca_system_score_codex":0.001841531,"about_ca_system_score_gemma":0.0010642766,"threshold_uncertainty_score":0.020532668},"labels":[],"label_agreement":null},{"id":"W2086228055","doi":"10.1016/j.tcs.2014.07.009","title":"On non-progressive spread of influence through social networks","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics; Theoretical computer science; Sociology","score_opus":0.005540294514259801,"score_gpt":0.2710650071988626,"score_spread":0.2655247126846028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086228055","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.44961053,0.0024745697,0.52642244,0.0028450836,0.00011877884,0.00018232054,0.0004073065,0.00029933933,0.017639654],"genre_scores_gemma":[0.9685364,0.00241289,0.01962451,0.00021201976,0.00036357692,0.0002214512,0.00020768726,0.0001125978,0.008308858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979559,0.0009279978,0.00007036611,0.0004614639,0.00034687808,0.00023739984],"domain_scores_gemma":[0.88070196,0.105408825,0.0049371854,0.004141895,0.0026143813,0.0021957553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057675834,0.0012789926,0.0019932825,0.0047505964,0.0020019743,0.0028167616,0.0035792089,0.0027032888,0.006332215],"category_scores_gemma":[0.0694628,0.0012873631,0.0012335406,0.0031161786,0.0073488764,0.011565044,0.0039343606,0.0033230598,0.0005763678],"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.00023234572,0.00013719632,0.0052962825,0.00030522924,0.00015020408,0.0003862966,0.0015325155,0.16798213,0.0021840637,0.7968247,0.0022090059,0.02276004],"study_design_scores_gemma":[0.00004452876,0.00006557581,0.0025853342,0.000060701583,0.00005881088,0.00016366389,0.00022187184,0.44621846,0.00041646545,0.54917145,0.0009480838,0.000045075958],"about_ca_topic_score_codex":0.0057788026,"about_ca_topic_score_gemma":0.0036539864,"teacher_disagreement_score":0.006332215,"about_ca_system_score_codex":0.0019403759,"about_ca_system_score_gemma":0.0008147353,"threshold_uncertainty_score":0.03050226},"labels":[],"label_agreement":null},{"id":"W2086236932","doi":"10.1016/j.tcs.2006.10.031","title":"Feasibility and complexity of broadcasting with random transmission failures","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"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":"Broadcasting (networking); Transmission (telecommunications); Computer science; Theoretical computer science; Distributed computing; Computer network; Telecommunications","score_opus":0.022599235541769923,"score_gpt":0.24212688485675357,"score_spread":0.21952764931498364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086236932","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.51857543,0.001814225,0.39013284,0.020155841,0.00037981648,0.0004082016,0.002721587,0.0005900552,0.06522208],"genre_scores_gemma":[0.95540935,0.0010925146,0.031294413,0.0005319624,0.00078002806,0.0004532315,0.0011036689,0.00023087114,0.009103846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99267393,0.0035272925,0.0003127821,0.0009005826,0.001619275,0.00096607907],"domain_scores_gemma":[0.8340752,0.1511346,0.005430402,0.003921791,0.002829272,0.0026086955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066791833,0.0012564756,0.0028847067,0.0021523691,0.0028468405,0.0074685784,0.005205954,0.004589945,0.012673139],"category_scores_gemma":[0.08304793,0.002730441,0.0021550776,0.0034335242,0.0062362836,0.017018724,0.0047047003,0.006414501,0.0008333435],"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.001568003,0.00025186874,0.0022564023,0.00046863398,0.000107635424,0.00038308,0.0005915835,0.23684269,0.001595482,0.73582387,0.007974481,0.012136254],"study_design_scores_gemma":[0.00021616873,0.00004811234,0.0004408841,0.000026455567,0.000041801562,0.00014989631,0.00011552794,0.27293462,0.00047873633,0.72478217,0.0007264061,0.00003914047],"about_ca_topic_score_codex":0.0039178967,"about_ca_topic_score_gemma":0.0023377512,"teacher_disagreement_score":0.012673139,"about_ca_system_score_codex":0.004272762,"about_ca_system_score_gemma":0.004525759,"threshold_uncertainty_score":0.04239589},"labels":[],"label_agreement":null},{"id":"W2086306425","doi":"10.1016/j.tcs.2007.09.015","title":"Palindrome positions in ternary square-free words","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Palindrome; Ternary operation; Mathematics; Sequence (biology); Word (group theory); Combinatorics; Integer (computer science); Position (finance); Arbitrariness; Word length; Binary number; Square (algebra); Arithmetic; Discrete mathematics; Computer science; Linguistics; Natural language processing; Philosophy; Geometry","score_opus":0.006775379402386871,"score_gpt":0.24749328958025793,"score_spread":0.24071791017787106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086306425","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.92915374,0.00039602525,0.04350531,0.0005304146,0.00022402564,0.000045608984,0.00025314503,0.00040838568,0.025483275],"genre_scores_gemma":[0.9860736,0.00007610003,0.0066884956,0.00007585563,0.000057123565,0.000026987327,0.000107758824,0.000053236945,0.0068408656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995372,0.00008005353,0.000048293354,0.00011826159,0.000096968666,0.00011925598],"domain_scores_gemma":[0.9982256,0.0010470506,0.00020165497,0.00017615668,0.00018449727,0.00016505801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004009274,0.00036051084,0.00044485464,0.0007679288,0.0017424579,0.0027165017,0.00062675215,0.0010163434,0.0071028015],"category_scores_gemma":[0.0024433436,0.0005452803,0.0003416116,0.00094167166,0.0017295378,0.002653085,0.0010650322,0.0010052042,0.0014025779],"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.00072319485,0.00011009583,0.0017201039,0.00011459144,0.000009369424,0.001598065,0.0029852681,0.002113071,0.02258081,0.94340765,0.0011571636,0.023480617],"study_design_scores_gemma":[0.00015266087,0.00023204286,0.0011668821,0.000046041663,0.00003260664,0.00093750976,0.001214829,0.009927577,0.01834624,0.9605788,0.0073044365,0.000060378807],"about_ca_topic_score_codex":0.00070482434,"about_ca_topic_score_gemma":0.0010390616,"teacher_disagreement_score":0.0071028015,"about_ca_system_score_codex":0.0006737014,"about_ca_system_score_gemma":0.00064142677,"threshold_uncertainty_score":0.023761213},"labels":[],"label_agreement":null},{"id":"W2086312880","doi":"10.1016/j.tcs.2014.03.028","title":"Multi-target ray searching problems","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Multiplicative function; Context (archaeology); Mathematics; Mathematical optimization; Metric (unit); Measure (data warehouse); Disjoint sets; Linear search; Asymptotically optimal algorithm; Competitive analysis; Beam search; Computer science; Algorithm; Search algorithm; Discrete mathematics; Upper and lower bounds; Data mining","score_opus":0.017390947517490634,"score_gpt":0.26955533553006034,"score_spread":0.2521643880125697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086312880","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.012991605,0.0012038215,0.9605766,0.0006748931,0.00010244003,0.000113535345,0.0002521502,0.00031140668,0.02377352],"genre_scores_gemma":[0.46381813,0.0023856557,0.48269907,0.0006144899,0.00032839525,0.0007355393,0.0010726424,0.0007028277,0.04764325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849,0.00057858275,0.000059489754,0.0003122199,0.0004352104,0.00012450402],"domain_scores_gemma":[0.99607676,0.003056258,0.00024953845,0.0001816742,0.0002479467,0.00018776016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021497388,0.0018004624,0.002230454,0.0017389612,0.0009804926,0.0030070506,0.002462227,0.004789277,0.011569322],"category_scores_gemma":[0.009806955,0.0011359456,0.0016104785,0.0023329319,0.0014170017,0.0032396105,0.003702652,0.0026788318,0.0020478521],"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.00045603394,0.00014310522,0.0009769977,0.00055356,0.00019716586,0.00035772147,0.00019470887,0.7935922,0.0024152258,0.1287442,0.008373222,0.063995756],"study_design_scores_gemma":[0.000058225138,0.00010551599,0.00032360584,0.000052398304,0.000044968663,0.00024064678,0.00008072443,0.91496164,0.0014551372,0.07829022,0.0043563973,0.000030442437],"about_ca_topic_score_codex":0.0010562128,"about_ca_topic_score_gemma":0.0007120971,"teacher_disagreement_score":0.011569322,"about_ca_system_score_codex":0.0014383654,"about_ca_system_score_gemma":0.00079614174,"threshold_uncertainty_score":0.038703263},"labels":[],"label_agreement":null},{"id":"W2086603341","doi":"10.1016/j.tcs.2010.11.025","title":"Complexity and palindromic defect of infinite words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Palindrome; Conjecture; Mathematics; State (computer science); Combinatorics; Palindromic sequence; Algorithm; CRISPR; Genetics","score_opus":0.011621170060287709,"score_gpt":0.24605559810753605,"score_spread":0.23443442804724834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086603341","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.93708575,0.00042809983,0.03782664,0.0014464163,0.00006919725,0.000027936041,0.00022006911,0.00008381264,0.022812067],"genre_scores_gemma":[0.99266654,0.00014590193,0.0037967188,0.00006832126,0.0001255492,0.000032894764,0.00016875811,0.000024535186,0.0029707318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856806,0.00030710103,0.00011722123,0.00028971667,0.0005055226,0.0002123406],"domain_scores_gemma":[0.98664385,0.009332891,0.0013302501,0.001028738,0.00075554143,0.0009086263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011407889,0.00041672244,0.0011114012,0.002324531,0.0014776876,0.005049332,0.0014757196,0.0013747095,0.0047357534],"category_scores_gemma":[0.009796782,0.0005099635,0.0009292039,0.001513875,0.0048541063,0.009085879,0.0024896706,0.0026426732,0.00037132192],"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.00010395473,0.000036448764,0.0013604792,0.00004850276,0.00000972226,0.00013226834,0.0005936067,0.0022286887,0.0015190832,0.9903854,0.00035178536,0.0032301303],"study_design_scores_gemma":[0.000023196728,0.000021887328,0.00056147284,0.000007491421,0.000007150566,0.0001486901,0.00012480974,0.0057614967,0.0005532645,0.9922597,0.00051546545,0.000015360245],"about_ca_topic_score_codex":0.0005566183,"about_ca_topic_score_gemma":0.00040305522,"teacher_disagreement_score":0.005049332,"about_ca_system_score_codex":0.0014654561,"about_ca_system_score_gemma":0.0005737317,"threshold_uncertainty_score":0.015842736},"labels":[],"label_agreement":null},{"id":"W2086666778","doi":"10.1016/j.tcs.2005.01.005","title":"Avoiding large squares in infinite binary words","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; Mathematics; Construct (python library); Word (group theory); Least-squares function approximation; Combinatorics; Discrete mathematics; Arithmetic; Statistics; Computer science; Geometry","score_opus":0.00866029022211975,"score_gpt":0.24990594008600098,"score_spread":0.24124564986388122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086666778","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.73235464,0.00042556287,0.21568182,0.0011584448,0.00023460791,0.00006562116,0.0001274646,0.00072819844,0.04922367],"genre_scores_gemma":[0.93174726,0.00016942252,0.036578912,0.00024253568,0.000094477145,0.00008620605,0.0001345352,0.0002654222,0.030681133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943596,0.00017603888,0.000036695477,0.00012424048,0.00012423728,0.00010280918],"domain_scores_gemma":[0.9947108,0.0036335278,0.0004287798,0.00047075184,0.00035619424,0.0003998985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005906124,0.0005176419,0.0008284296,0.000741243,0.0019745615,0.0021643445,0.00078596204,0.0014951328,0.0064160447],"category_scores_gemma":[0.0053426605,0.00080689054,0.0005968596,0.0008304359,0.002161681,0.0040048193,0.0024274567,0.0017124629,0.0012495731],"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.00018292313,0.000045487162,0.0006819767,0.00011628899,0.000010777772,0.00041983242,0.0009990714,0.004721775,0.006735842,0.9732002,0.0018236742,0.011062224],"study_design_scores_gemma":[0.000025077681,0.000031438205,0.00018116938,0.000011705069,0.0000079847905,0.00018173021,0.00019095505,0.01099286,0.0017631578,0.9844648,0.002136904,0.000012167771],"about_ca_topic_score_codex":0.0005677533,"about_ca_topic_score_gemma":0.0011717957,"teacher_disagreement_score":0.0064160447,"about_ca_system_score_codex":0.00052572764,"about_ca_system_score_gemma":0.00046012536,"threshold_uncertainty_score":0.021463811},"labels":[],"label_agreement":null},{"id":"W2087289587","doi":"10.1016/j.tcs.2008.11.022","title":"A constrained edit distance algorithm between semi-ordered trees","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Plant biochemistry and biosynthesis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"CHIST-ERA; Agence Nationale de la Recherche","keywords":"Edit distance; Algorithm; Combinatorics; Mathematics; Computer science; Discrete mathematics","score_opus":0.008301617499869166,"score_gpt":0.22136372594427678,"score_spread":0.21306210844440762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087289587","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.012683151,0.00023079867,0.9841393,0.00012151105,0.000065770335,0.00013925784,0.00044347945,0.0010922059,0.0010845009],"genre_scores_gemma":[0.07430651,0.00013894534,0.92127645,0.00007911697,0.000037332848,0.00015901809,0.0014071846,0.0003865876,0.00220881],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967733,0.0006588711,0.00027433006,0.00082826166,0.0013080955,0.0001570849],"domain_scores_gemma":[0.992605,0.004027327,0.0003708582,0.0014044323,0.0012194219,0.00037306425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994668,0.0008460331,0.002131303,0.0027503776,0.0012428381,0.0024912106,0.004010305,0.0024627445,0.005611625],"category_scores_gemma":[0.011990364,0.0010190614,0.0014158982,0.004319439,0.000995075,0.005055533,0.0035112016,0.0030004266,0.0013802127],"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.0005223316,0.00048253263,0.0010907874,0.000576521,0.00019881628,0.00034008868,0.0005193662,0.15614146,0.015421728,0.08624775,0.011560981,0.7268977],"study_design_scores_gemma":[0.00008076558,0.00022621886,0.0004032295,0.000056343844,0.000045546993,0.00033732416,0.00013758737,0.8800841,0.009568489,0.09789056,0.011108267,0.0000616105],"about_ca_topic_score_codex":0.0032540234,"about_ca_topic_score_gemma":0.0052828323,"teacher_disagreement_score":0.005611625,"about_ca_system_score_codex":0.0011613236,"about_ca_system_score_gemma":0.0022165878,"threshold_uncertainty_score":0.01877278},"labels":[],"label_agreement":null},{"id":"W2087404611","doi":"10.1016/s0304-3975(98)00047-4","title":"Alternating finite automata and star-free languages","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Star (game theory); Automaton; Two-way deterministic finite automaton; Deterministic automaton; Regular language; Regular expression; Nondeterministic finite automaton; Mathematics; Class (philosophy); Finite-state machine; Construct (python library); Discrete mathematics; Representation (politics); Loop (graph theory); Deterministic finite automaton; Computer science; Combinatorics; Automata theory; Algorithm; Theoretical computer science; Programming language; Mathematical analysis; Artificial intelligence","score_opus":0.005757112725756986,"score_gpt":0.23699416293092448,"score_spread":0.2312370502051675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087404611","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.24490969,0.024673708,0.59460694,0.010257867,0.0016717522,0.000106868785,0.0010555119,0.0008354892,0.12188222],"genre_scores_gemma":[0.89496356,0.0068018413,0.05433737,0.001002878,0.0015931451,0.00021134899,0.000999113,0.00014818035,0.039942477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988945,0.0003703755,0.00008870381,0.00029627298,0.00023996187,0.0001102345],"domain_scores_gemma":[0.9960491,0.0028808536,0.00027462977,0.00028455438,0.00031854358,0.00019233211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011396327,0.00077829254,0.001032928,0.0013852608,0.0015188365,0.0033940726,0.0010724744,0.0018700359,0.0072878357],"category_scores_gemma":[0.0047153584,0.00058703223,0.0009342368,0.0025752883,0.004127493,0.00890347,0.0014867405,0.0026090925,0.0011833294],"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.00002747244,0.000012775799,0.00012098589,0.000041583906,0.0000046736545,0.00005252108,0.0002386104,0.0009972431,0.00037635202,0.9926456,0.0010928096,0.0043892805],"study_design_scores_gemma":[0.0000051987518,0.0000050284766,0.000040066036,0.00000469198,0.0000035552694,0.000038985287,0.000030263684,0.0018563585,0.000096662574,0.9953715,0.002543187,0.0000045270563],"about_ca_topic_score_codex":0.0010864012,"about_ca_topic_score_gemma":0.0010019434,"teacher_disagreement_score":0.0072878357,"about_ca_system_score_codex":0.0012307123,"about_ca_system_score_gemma":0.0010453555,"threshold_uncertainty_score":0.024380207},"labels":[],"label_agreement":null},{"id":"W2088319085","doi":"10.1016/j.tcs.2004.02.036","title":"An algorithmic view of gene teams","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"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":"Computer science; Genome; Comparative genomics; Divide and conquer algorithms; Computational complexity theory; Theoretical computer science; Computational genomics; Partition (number theory); Algorithm; Time complexity; Genomics; Identification (biology); Function (biology); Gene; Mathematics; Biology; Genetics; Combinatorics","score_opus":0.005230644258047232,"score_gpt":0.24631887927356755,"score_spread":0.24108823501552032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088319085","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.04353531,0.0007457457,0.8942462,0.0051387795,0.00016537747,0.00007357228,0.0001924096,0.0002725631,0.05563003],"genre_scores_gemma":[0.65793175,0.0015427548,0.30621827,0.00115559,0.0007178774,0.00045098498,0.00072673307,0.00032417497,0.030931883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839824,0.00058282545,0.000065237575,0.00032883178,0.00042534844,0.00019946255],"domain_scores_gemma":[0.9946827,0.0035255917,0.0003148365,0.0007146016,0.00040768954,0.00035457656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019573756,0.0006873731,0.00092977245,0.0019008766,0.0028178256,0.0045487,0.0041145007,0.0027437443,0.012588178],"category_scores_gemma":[0.009835134,0.00076099613,0.0015065445,0.0024223076,0.0052666473,0.009830037,0.003700684,0.0035527672,0.0011627217],"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.000008255944,0.000007999683,0.00010366403,0.000013934064,0.0000039670213,0.00001276208,0.00007284736,0.008666008,0.00007136775,0.98705286,0.0008973826,0.0030889849],"study_design_scores_gemma":[0.000008051697,0.000005130866,0.000040232382,0.000006418288,0.000003918537,0.000019240371,0.000036844423,0.030726517,0.000061802566,0.9671879,0.0019003691,0.0000034480497],"about_ca_topic_score_codex":0.0021718617,"about_ca_topic_score_gemma":0.0020415606,"teacher_disagreement_score":0.012588178,"about_ca_system_score_codex":0.002054907,"about_ca_system_score_gemma":0.0015376938,"threshold_uncertainty_score":0.042111635},"labels":[],"label_agreement":null},{"id":"W2088334991","doi":"10.1016/j.tcs.2009.02.002","title":"Energy efficient randomised communication in unknown AdHoc networks","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada); Simon Fraser University","funders":"","keywords":"Broadcasting (networking); Gossip; Binary logarithm; Upper and lower bounds; Computer science; Node (physics); Computer network; Randomized algorithm; Log-log plot; Mathematics; Algorithm; Discrete mathematics; Theoretical computer science","score_opus":0.005181335881111793,"score_gpt":0.22327924849091482,"score_spread":0.21809791260980302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088334991","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.09793161,0.0011594974,0.8867594,0.0024247793,0.00040199634,0.00019603231,0.00023435049,0.0005632412,0.010329158],"genre_scores_gemma":[0.9413222,0.00037925874,0.050893217,0.0003274365,0.0001451663,0.00022473164,0.00013875308,0.000087040535,0.006482158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99515414,0.0024815202,0.00021268635,0.00055316417,0.00097471353,0.00062377524],"domain_scores_gemma":[0.96145207,0.032635167,0.0013758136,0.002572332,0.00131036,0.00065425254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003950869,0.0007016774,0.0017190474,0.00089163333,0.0015037475,0.0018648437,0.002516239,0.0024733888,0.0033146748],"category_scores_gemma":[0.030983875,0.0007150985,0.0005771134,0.0011819375,0.0036074677,0.0037353723,0.005166528,0.0020366034,0.0005896425],"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.0011323947,0.00010035354,0.0006280327,0.00029668232,0.000052981297,0.00018562647,0.00027516036,0.7224241,0.0047912635,0.24105835,0.0028750116,0.026180068],"study_design_scores_gemma":[0.000105039195,0.000106106214,0.00014247575,0.000026688213,0.000015717902,0.00006853568,0.00005586112,0.8510449,0.0010349876,0.14637436,0.0009955715,0.000029816301],"about_ca_topic_score_codex":0.0014090054,"about_ca_topic_score_gemma":0.0015365375,"teacher_disagreement_score":0.003950869,"about_ca_system_score_codex":0.0018615774,"about_ca_system_score_gemma":0.0016625411,"threshold_uncertainty_score":0.020894408},"labels":[],"label_agreement":null},{"id":"W2088855462","doi":"10.1016/j.tcs.2006.10.007","title":"On codes defined by bio-operations","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Baoji University of Arts And Sciences","keywords":"Code (set theory); Block code; Computer science; Decidability; Function (biology); Reed–Muller code; Linear code; Mathematics; Theoretical computer science; Discrete mathematics; Algorithm; Programming language; Biology; Decoding methods; Genetics","score_opus":0.005389987106981573,"score_gpt":0.23005966072130168,"score_spread":0.2246696736143201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088855462","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.12551339,0.0047249952,0.7727477,0.0040704743,0.0018355589,0.00015240039,0.00078578945,0.0006886685,0.08948108],"genre_scores_gemma":[0.8038152,0.0041989186,0.15410092,0.0020055803,0.0015377508,0.0006554759,0.0009455728,0.0005683274,0.032172255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774724,0.0006980203,0.00015040852,0.0002981502,0.0007806385,0.00032548778],"domain_scores_gemma":[0.99376583,0.0038479378,0.00050422986,0.0005905755,0.0008932937,0.00039819337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001448983,0.0013536878,0.0010631051,0.0036180736,0.0018231762,0.0035606679,0.0011953117,0.0019559676,0.004229695],"category_scores_gemma":[0.008250627,0.00044771002,0.0009446856,0.0029485167,0.0055345744,0.004781154,0.0035648881,0.0032977029,0.00090236583],"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.000013382628,0.0000031818163,0.000035705016,0.000013273799,0.00000172312,0.0000151797985,0.00006300042,0.001006559,0.00015008522,0.99531496,0.00042098065,0.0029620042],"study_design_scores_gemma":[0.0000071217532,0.000008939804,0.000032280444,0.000021271808,0.0000025593874,0.000034360488,0.000024208151,0.0055565,0.00023907908,0.990765,0.0033001078,0.000008535067],"about_ca_topic_score_codex":0.002245454,"about_ca_topic_score_gemma":0.0013282108,"teacher_disagreement_score":0.004229695,"about_ca_system_score_codex":0.0021066954,"about_ca_system_score_gemma":0.0013727059,"threshold_uncertainty_score":0.015285194},"labels":[],"label_agreement":null},{"id":"W2088906714","doi":"10.1016/j.tcs.2013.08.013","title":"Enhanced string covering","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"String (physics); Cover (algebra); Mathematics; Prefix; Suffix; Cardinality (data modeling); Combinatorics; Computation; String searching algorithm; Computer science; Discrete mathematics; Algorithm; Data structure; Linguistics","score_opus":0.006813118042016994,"score_gpt":0.2286797062139488,"score_spread":0.22186658817193183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088906714","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.15335533,0.0024920008,0.77001655,0.0011080297,0.00089016266,0.00018900077,0.0017974853,0.004132564,0.066018976],"genre_scores_gemma":[0.75969946,0.001228441,0.20294611,0.000598786,0.0005247217,0.00019013096,0.0035414614,0.0007454243,0.030525498],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853027,0.00031452626,0.000078741876,0.00029078554,0.00059551105,0.00019006143],"domain_scores_gemma":[0.9974794,0.00077528815,0.00010687579,0.0012408592,0.00029846613,0.00009911978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063494314,0.00058736914,0.0009526069,0.0013591135,0.0005955762,0.0012144112,0.00088035833,0.00118641,0.01111514],"category_scores_gemma":[0.003984489,0.00029975205,0.0006688709,0.002017944,0.00062929874,0.0025083155,0.0022781738,0.0011248356,0.0026366462],"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.0010622502,0.00021479532,0.0013679328,0.00043147238,0.000104659724,0.0008028555,0.00024964858,0.0771701,0.04305564,0.27760357,0.030420676,0.5675164],"study_design_scores_gemma":[0.00009477288,0.00032143848,0.0018542706,0.000101732505,0.000103717335,0.0018918312,0.00009195728,0.59472346,0.049865387,0.2820074,0.06887871,0.00006532063],"about_ca_topic_score_codex":0.000367755,"about_ca_topic_score_gemma":0.00035113937,"teacher_disagreement_score":0.01111514,"about_ca_system_score_codex":0.00063000986,"about_ca_system_score_gemma":0.0005723122,"threshold_uncertainty_score":0.03718382},"labels":[],"label_agreement":null},{"id":"W2088999425","doi":"10.1016/j.tcs.2009.02.043","title":"State-complexity hierarchies of uniform languages of alphabet-size length","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Waterloo","funders":"","keywords":"Alphabet; Regular language; Mathematics; Hierarchy; Combinatorics; Class (philosophy); State (computer science); Formal language; Discrete mathematics; Simple (philosophy); Complexity class; Chomsky hierarchy; Set (abstract data type); Finite-state machine; Automaton; Computer science; Time complexity; Theoretical computer science; Algorithm; Linguistics; Programming language; Artificial intelligence","score_opus":0.010043604494926939,"score_gpt":0.2575917261567074,"score_spread":0.24754812166178045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088999425","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.86704844,0.0010213715,0.10673762,0.0018092728,0.00003324317,0.000106828105,0.0018349225,0.001020484,0.020387722],"genre_scores_gemma":[0.97638285,0.00037064587,0.017666312,0.00016169126,0.000099523,0.00013222152,0.0010347482,0.00021276632,0.003939262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770206,0.00045635906,0.00015208551,0.00036683542,0.00072477246,0.00059788907],"domain_scores_gemma":[0.95482624,0.03551633,0.002707631,0.0025935366,0.0021570027,0.002199293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001731172,0.0006361697,0.0015819917,0.0033561096,0.0024795837,0.00692319,0.0020059624,0.0017274151,0.009402724],"category_scores_gemma":[0.017813805,0.0013412545,0.0013328558,0.0024151108,0.002411987,0.009066798,0.0021205018,0.002695675,0.0006476463],"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.00054474926,0.00019391188,0.006871119,0.00028937514,0.00006519139,0.00025181592,0.0022149922,0.036903836,0.0111503275,0.91851187,0.0032438906,0.019758938],"study_design_scores_gemma":[0.0000695414,0.00007004486,0.0049097463,0.000043006137,0.00005192411,0.00022424616,0.00035069202,0.19631955,0.0032619815,0.7928681,0.001756504,0.00007457857],"about_ca_topic_score_codex":0.0029081588,"about_ca_topic_score_gemma":0.004687868,"teacher_disagreement_score":0.009402724,"about_ca_system_score_codex":0.0037376338,"about_ca_system_score_gemma":0.0020088656,"threshold_uncertainty_score":0.03145522},"labels":[],"label_agreement":null},{"id":"W2089081951","doi":"10.1016/j.tcs.2011.08.007","title":"Palindromic complexity of codings of rotations","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"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":"Palindrome; Mathematics; Computer science; Artificial intelligence; Algorithm; Biology","score_opus":0.04530645399952978,"score_gpt":0.2533063429209016,"score_spread":0.2079998889213718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089081951","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.7832548,0.0008995852,0.13850383,0.0037505925,0.00018740894,0.00011465741,0.0010973263,0.00034394846,0.0718479],"genre_scores_gemma":[0.9835504,0.00029261518,0.008673772,0.00023686534,0.00020879364,0.00009268458,0.00059833424,0.00008118613,0.0062652314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746597,0.00064723403,0.00017158633,0.0004400358,0.0007753953,0.0004998297],"domain_scores_gemma":[0.9847472,0.01075856,0.0013455917,0.0014527638,0.0009189918,0.0007770643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014340032,0.000568347,0.0011612428,0.0018292441,0.0016990426,0.0047390894,0.0019725778,0.002001615,0.012500443],"category_scores_gemma":[0.012976915,0.00062497606,0.0011633143,0.0021464578,0.003298634,0.008018409,0.0025329478,0.0033305509,0.0011391498],"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.00009437425,0.000033633012,0.00043990498,0.000041907046,0.0000070466895,0.00007506848,0.00029860364,0.0051207957,0.0006272338,0.9879451,0.00089520245,0.004421162],"study_design_scores_gemma":[0.000024170726,0.000018879698,0.00020938388,0.000009011171,0.0000063417287,0.000068611946,0.00006572013,0.010675945,0.00048767804,0.98776823,0.0006532604,0.000012741208],"about_ca_topic_score_codex":0.0012585891,"about_ca_topic_score_gemma":0.0010700867,"teacher_disagreement_score":0.012500443,"about_ca_system_score_codex":0.0019729421,"about_ca_system_score_gemma":0.0012927116,"threshold_uncertainty_score":0.041818142},"labels":[],"label_agreement":null},{"id":"W2089886783","doi":"10.1016/j.tcs.2014.02.029","title":"Exhaustive generation of atomic combinatorial differential operators","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Analytical Chemistry and Chromatography","field":"Chemistry","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 à Chicoutimi; Université du Québec à Montréal","funders":"","keywords":"sort; Generalization; Operator (biology); Mathematics; Differential (mechanical device); Differential operator; Discrete mathematics; Combinatorics; Algorithm; Computer science; Pure mathematics; Arithmetic; Chemistry; Physics; Mathematical analysis","score_opus":0.007786497966708939,"score_gpt":0.22595117613908997,"score_spread":0.21816467817238103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089886783","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.21102613,0.00032114296,0.74187917,0.0006038418,0.0002389545,0.0001009632,0.0002515692,0.00074740284,0.044830758],"genre_scores_gemma":[0.8843332,0.00016547945,0.10480389,0.00024839697,0.00009067431,0.000098668024,0.00031426863,0.00034846237,0.009596956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993026,0.00019472411,0.000034026412,0.00008855009,0.00027003948,0.000110018394],"domain_scores_gemma":[0.9980782,0.0011122496,0.00007931809,0.00035712155,0.00025774215,0.00011533869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009411846,0.00049389916,0.0006795831,0.0011446489,0.0007182741,0.0013278681,0.0011306432,0.0008590631,0.006614102],"category_scores_gemma":[0.004354418,0.00038510625,0.00075543765,0.00079949445,0.0014729335,0.0019358062,0.0019934895,0.0012751222,0.00069893576],"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.00008488795,0.00004292212,0.00035258138,0.00008601588,0.00001683739,0.000116583666,0.00012474794,0.018474732,0.0039616055,0.95238173,0.0021552097,0.022202121],"study_design_scores_gemma":[0.000025605586,0.000027025113,0.00015390775,0.000014634648,0.00001117899,0.00010646928,0.00003623133,0.2023174,0.0042892783,0.79104066,0.0019607944,0.000016865753],"about_ca_topic_score_codex":0.00033012818,"about_ca_topic_score_gemma":0.0006542063,"teacher_disagreement_score":0.006614102,"about_ca_system_score_codex":0.00075278414,"about_ca_system_score_gemma":0.0006445668,"threshold_uncertainty_score":0.022126317},"labels":[],"label_agreement":null},{"id":"W2089939112","doi":"10.1016/j.tcs.2008.03.011","title":"Embedding finite automata within regular expressions","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular expression; Computer science; Automaton; Nondeterministic finite automaton; Timed automaton; Theoretical computer science; Büchi automaton; Set (abstract data type); Deterministic automaton; Algorithm; Expression (computer science); Representation (politics); Automata theory; Programming language","score_opus":0.029109684257736527,"score_gpt":0.3043006566341777,"score_spread":0.2751909723764412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089939112","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.018581897,0.00021927494,0.9734677,0.00030359376,0.00007417455,0.000043142107,0.00007917541,0.001336184,0.0058948398],"genre_scores_gemma":[0.60409456,0.00071908545,0.3842299,0.00020652908,0.00009978354,0.00018318379,0.00043864286,0.0009179372,0.009110279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748874,0.0009582088,0.00020425797,0.00056084763,0.0005905648,0.0001974195],"domain_scores_gemma":[0.9930982,0.0046140403,0.00031817832,0.0013740008,0.00048513527,0.000110413435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018328897,0.00076820876,0.00069548894,0.00094103353,0.00058563176,0.0028203789,0.0013557199,0.0010680172,0.0044898978],"category_scores_gemma":[0.008786207,0.0011136545,0.0012223258,0.00088594295,0.0026658906,0.0082243355,0.0027663368,0.0028730445,0.0016325254],"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.000113413465,0.00006260641,0.00034256035,0.00018411914,0.000025096442,0.00017260715,0.000979295,0.024044495,0.004876669,0.9186169,0.0006722875,0.049909916],"study_design_scores_gemma":[0.000026762094,0.00004015141,0.00007534287,0.000060320297,0.000038056925,0.000076695935,0.00015205517,0.06963035,0.008706525,0.91015565,0.011015345,0.00002278896],"about_ca_topic_score_codex":0.00077024143,"about_ca_topic_score_gemma":0.00070103403,"teacher_disagreement_score":0.0044898978,"about_ca_system_score_codex":0.000906523,"about_ca_system_score_gemma":0.0007991114,"threshold_uncertainty_score":0.015020192},"labels":[],"label_agreement":null},{"id":"W2090143015","doi":"10.1016/s0304-3975(02)00183-4","title":"A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Education, Culture, Sports, Science and Technology; Alberta Innovates - Health Solutions","keywords":"Simple (philosophy); Greedy algorithm; Bounded function; Algorithm; Computer science; Domain (mathematical analysis); Mathematics; Function (biology); Relational database; Constant (computer programming); Theoretical computer science; Mathematical optimization; Data mining","score_opus":0.01779435933608195,"score_gpt":0.2961311114551869,"score_spread":0.2783367521191049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090143015","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.0048567113,0.00008135678,0.99215055,0.00010334752,0.000025010433,0.00022732043,0.00015501093,0.0014080572,0.0009925342],"genre_scores_gemma":[0.034800176,0.00004860008,0.9634746,0.000048604987,0.000029103549,0.00024402521,0.00029707002,0.0001337,0.00092422735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976786,0.00052092463,0.00020377887,0.00050053996,0.00082043896,0.0002758098],"domain_scores_gemma":[0.9959341,0.0023274838,0.00021444129,0.00071316527,0.0006670338,0.00014377848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024225402,0.0018259248,0.0019806705,0.00383775,0.001549261,0.0019967915,0.0039355024,0.0018703707,0.011994504],"category_scores_gemma":[0.009039155,0.0010357532,0.0016841447,0.0042741396,0.0013133122,0.0029483107,0.0022353162,0.0016712786,0.004265532],"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.0005469926,0.000726975,0.0028589754,0.00040968807,0.00016891788,0.00034063566,0.00024317448,0.07563968,0.013004443,0.04352626,0.015358821,0.8471754],"study_design_scores_gemma":[0.00022981901,0.00015705556,0.0008438459,0.000031652522,0.00011932033,0.0007437687,0.00012348128,0.90075976,0.0052586733,0.08721052,0.004470092,0.000051991552],"about_ca_topic_score_codex":0.0048357463,"about_ca_topic_score_gemma":0.009641367,"teacher_disagreement_score":0.011994504,"about_ca_system_score_codex":0.0010952752,"about_ca_system_score_gemma":0.003393747,"threshold_uncertainty_score":0.04012561},"labels":[],"label_agreement":null},{"id":"W2090562519","doi":"10.1016/j.tcs.2008.02.051","title":"Extension of Brzozowski’s derivation calculus of rational expressions to series over the free partially commutative monoids","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"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":"Noncommutative geometry; Extension (predicate logic); Mathematics; Power series; Commutative property; Formal power series; Series (stratigraphy); Expression (computer science); Pure mathematics; Finitely-generated abelian group; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.015476486358449839,"score_gpt":0.25462773357631596,"score_spread":0.23915124721786613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090562519","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.1501521,0.0032546811,0.6116763,0.003031673,0.0011013852,0.00014753919,0.0004598057,0.00072292966,0.22945356],"genre_scores_gemma":[0.8564018,0.0027119203,0.09965738,0.0006426162,0.00074928196,0.00009876205,0.00021649644,0.00028862318,0.03923318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.00015341166,0.000047687245,0.00013710928,0.00021127908,0.00008628978],"domain_scores_gemma":[0.9993237,0.00022638882,0.000039522107,0.00014262676,0.00020114901,0.000066500135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013661048,0.00045002226,0.00071821216,0.001444652,0.0012000815,0.002001578,0.00098512,0.00059504766,0.0040509566],"category_scores_gemma":[0.0018768741,0.00048986904,0.0011493487,0.0011848615,0.002855934,0.005582466,0.0020518787,0.0022598065,0.0008969637],"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.000011374601,0.000011606348,0.00005207183,0.000024005443,0.0000056169233,0.0000794021,0.00031870435,0.0005105651,0.00105176,0.9920827,0.000434141,0.005418103],"study_design_scores_gemma":[0.000015933188,0.0000127966,0.00017117464,0.000015110322,0.00001428073,0.00011663126,0.000053338084,0.0037322573,0.0010723821,0.9771608,0.01761879,0.000016577063],"about_ca_topic_score_codex":0.0012173012,"about_ca_topic_score_gemma":0.0009969705,"teacher_disagreement_score":0.0040509566,"about_ca_system_score_codex":0.0015684352,"about_ca_system_score_gemma":0.00088877615,"threshold_uncertainty_score":0.013551831},"labels":[],"label_agreement":null},{"id":"W2090863119","doi":"10.1016/j.tcs.2007.07.032","title":"On the existence of regular approximations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"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; McGill University","funders":"","keywords":"Closure (psychology); Measure (data warehouse); Degree (music); Mathematics; Context (archaeology); Automaton; Regular language; Approximations of π; Discrete mathematics; Approximation algorithm; Combinatorics; Applied mathematics; Computer science; Theoretical computer science","score_opus":0.011196178193247025,"score_gpt":0.24015798834140104,"score_spread":0.228961810148154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090863119","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.35666007,0.002396562,0.55033183,0.007531284,0.00043758366,0.00009334401,0.00031839887,0.0005705255,0.08166043],"genre_scores_gemma":[0.92494076,0.00096480065,0.05744432,0.00067831145,0.0002621996,0.00012278106,0.0003122602,0.00018659064,0.015087976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965861,0.0012182585,0.00021000365,0.00070764386,0.0008119377,0.0004660539],"domain_scores_gemma":[0.9517306,0.03994527,0.0013367254,0.0031752875,0.002521594,0.0012905495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045008683,0.00066066335,0.0019582766,0.001499183,0.002319046,0.0045325714,0.0020726703,0.002487618,0.00565404],"category_scores_gemma":[0.037967317,0.0011551572,0.0015971899,0.0012524805,0.007963159,0.011449152,0.006017039,0.0055313054,0.00064731005],"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.000127741,0.000025585727,0.00032317507,0.00005710622,0.00001527916,0.000083497755,0.0006273234,0.0034342362,0.00072063186,0.98999584,0.0006417702,0.003947724],"study_design_scores_gemma":[0.000023985218,0.000024930194,0.00011045517,0.000024870802,0.0000144863425,0.00007242342,0.0002053472,0.020760037,0.0005084002,0.9769582,0.0012850269,0.000011845698],"about_ca_topic_score_codex":0.0012266483,"about_ca_topic_score_gemma":0.00091249374,"teacher_disagreement_score":0.00565404,"about_ca_system_score_codex":0.0025536509,"about_ca_system_score_gemma":0.001239842,"threshold_uncertainty_score":0.023803115},"labels":[],"label_agreement":null},{"id":"W2091687228","doi":"10.1016/j.tcs.2013.01.032","title":"Cops and invisible robbers: The cost of drunkenness","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Psychology","score_opus":0.0059258660472191645,"score_gpt":0.23838519953481221,"score_spread":0.23245933348759304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091687228","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.7114566,0.006146462,0.112013936,0.016146643,0.000727431,0.00007748238,0.0014550778,0.00044978343,0.15152664],"genre_scores_gemma":[0.9886291,0.00048473832,0.003367412,0.00013573091,0.00007465865,0.000014683744,0.000114286195,0.00007532455,0.0071040634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838173,0.00065619644,0.00005452387,0.0002583354,0.00037114296,0.0002781761],"domain_scores_gemma":[0.98694754,0.007542004,0.0016321768,0.0015393673,0.0012463965,0.0010924912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014864865,0.0005451488,0.00089843996,0.0012805344,0.0014015363,0.0026579583,0.0013126507,0.0023007658,0.03641143],"category_scores_gemma":[0.029762115,0.0005563611,0.00047495752,0.0012192983,0.0022881364,0.0069592404,0.0021003175,0.0019761522,0.0017435382],"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.0020755543,0.00038781005,0.03998356,0.0005948962,0.0003640424,0.0014302004,0.0015659682,0.0774094,0.0022055025,0.63814384,0.042689297,0.19314997],"study_design_scores_gemma":[0.00008128821,0.00021235278,0.023996862,0.0002481742,0.00020541466,0.0015470543,0.0029749807,0.19468813,0.0011449376,0.7547695,0.020019092,0.00011222857],"about_ca_topic_score_codex":0.005212349,"about_ca_topic_score_gemma":0.0057089785,"teacher_disagreement_score":0.03641143,"about_ca_system_score_codex":0.0011589106,"about_ca_system_score_gemma":0.0006876529,"threshold_uncertainty_score":0.12180841},"labels":[],"label_agreement":null},{"id":"W2091897018","doi":"10.1016/j.tcs.2009.05.013","title":"A 3.4713-approximation algorithm for the capacitated multicast tree routing problem","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Multicast; Computer science; Routing (electronic design automation); Tree (set theory); Destination-Sequenced Distance Vector routing; Mathematics; Approximation algorithm; Algorithm; Link-state routing protocol; Combinatorics; Routing protocol; Distributed computing; Computer network","score_opus":0.020962504307776086,"score_gpt":0.29635319215966927,"score_spread":0.2753906878518932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091897018","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.13012995,0.003202804,0.72712016,0.0055888263,0.0012311569,0.0013170607,0.0049023274,0.017336069,0.10917158],"genre_scores_gemma":[0.23359726,0.0005562579,0.72962254,0.001197028,0.00023287052,0.00094354217,0.007379446,0.0012649455,0.025206132],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802953,0.00035876926,0.00010466791,0.0004405631,0.00056134525,0.00050504424],"domain_scores_gemma":[0.9984493,0.0005877436,0.00009019384,0.00042519497,0.00028401587,0.00016351289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013705981,0.0020054632,0.001833326,0.00148689,0.001485426,0.002687037,0.0035530038,0.0031477546,0.036743265],"category_scores_gemma":[0.004621152,0.0008469929,0.0018644984,0.0029313052,0.00067229196,0.0039449045,0.0026127049,0.0026085814,0.008689628],"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.0035391245,0.0015898518,0.0016346762,0.000672107,0.00019181737,0.00023036914,0.0002831027,0.1579316,0.014305676,0.03745985,0.096847326,0.68531454],"study_design_scores_gemma":[0.0012977821,0.00041749078,0.0014305694,0.000098688724,0.00016298321,0.00041609263,0.00023578187,0.8877842,0.008333956,0.07063845,0.02910462,0.00007941759],"about_ca_topic_score_codex":0.0068931687,"about_ca_topic_score_gemma":0.009646923,"teacher_disagreement_score":0.036743265,"about_ca_system_score_codex":0.0046003005,"about_ca_system_score_gemma":0.0047928668,"threshold_uncertainty_score":0.12291843},"labels":[],"label_agreement":null},{"id":"W2091933094","doi":"10.1016/j.tcs.2010.11.006","title":"On the relationship between fuzzy and Boolean cellular automata","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Automaton; Fuzzy logic; Mathematics; Boolean expression; Cellular automaton; Theoretical computer science; Computer science; Discrete mathematics; Algebra over a field; Boolean function; Algorithm; Artificial intelligence; Pure mathematics","score_opus":0.018595582783489318,"score_gpt":0.2532387237377519,"score_spread":0.23464314095426259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091933094","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.17105556,0.015381071,0.682992,0.00867962,0.0010291132,0.00007881554,0.00053565693,0.00025904307,0.11998909],"genre_scores_gemma":[0.91104895,0.0058984077,0.06662128,0.0010240901,0.00085166324,0.0001266231,0.00023903158,0.00008527738,0.014104734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986889,0.0004920962,0.00008562365,0.00029054034,0.00032003998,0.00012290607],"domain_scores_gemma":[0.980959,0.016197821,0.0006814901,0.0007780742,0.0010902578,0.0002933256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020431438,0.00047359624,0.0009587831,0.0017221696,0.0016633556,0.0039611016,0.0014100483,0.0023707738,0.006054379],"category_scores_gemma":[0.022751674,0.0005842937,0.000879755,0.0021937503,0.0047915047,0.0069176713,0.0018422384,0.002858197,0.00047100172],"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.000021303054,0.000007696905,0.00018625891,0.00003220413,0.0000070788847,0.000034746263,0.00012376769,0.0053966143,0.00020772147,0.9884444,0.00045993322,0.005078409],"study_design_scores_gemma":[0.0000065865083,0.000009771619,0.00013464704,0.000017081074,0.000009446415,0.000040353374,0.00004054575,0.031754445,0.00013200873,0.96604544,0.0017986476,0.000011141227],"about_ca_topic_score_codex":0.0044458504,"about_ca_topic_score_gemma":0.0031471802,"teacher_disagreement_score":0.006054379,"about_ca_system_score_codex":0.0025181894,"about_ca_system_score_gemma":0.0009500273,"threshold_uncertainty_score":0.020253897},"labels":[],"label_agreement":null},{"id":"W2092520161","doi":"10.1016/s0304-3975(01)00164-5","title":"Frozen development in graph coloring","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Graph coloring; Complete coloring; Combinatorics; Fractional coloring; Edge coloring; Mathematics; List coloring; Discrete mathematics; Random graph; Greedy coloring; Dense graph; Graph; Line graph; Graph power; 1-planar graph","score_opus":0.011163201346677422,"score_gpt":0.23511345542789475,"score_spread":0.22395025408121733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092520161","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.1828933,0.0019373324,0.71575814,0.0030361086,0.00030535323,0.00017282594,0.00032147535,0.00077006436,0.0948054],"genre_scores_gemma":[0.8206178,0.0013196326,0.1312893,0.0006408255,0.00016430307,0.00021059703,0.0005522372,0.0005213948,0.04468382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992889,0.00028249755,0.000020246369,0.00014762586,0.00013323271,0.00012755636],"domain_scores_gemma":[0.995194,0.002950264,0.00022992713,0.00071378343,0.00049817236,0.00041381907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014453834,0.00045567477,0.0006879354,0.0011040643,0.002016953,0.0019797338,0.0018869522,0.0010416608,0.0056716157],"category_scores_gemma":[0.00737329,0.0011700161,0.00090731366,0.001300613,0.0033992478,0.0040856223,0.0023136146,0.004225223,0.00061877386],"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.000032201813,0.000024899657,0.00037515143,0.000043114833,0.000008680847,0.00008475257,0.0003123827,0.0104426555,0.0007102333,0.97553355,0.0030538873,0.009378545],"study_design_scores_gemma":[0.000011132678,0.0000083949435,0.00012710215,0.000013811545,0.000008784027,0.000044655066,0.000067408946,0.03067218,0.0005082307,0.9653815,0.0031492936,0.0000075166154],"about_ca_topic_score_codex":0.008003358,"about_ca_topic_score_gemma":0.009883406,"teacher_disagreement_score":0.008003358,"about_ca_system_score_codex":0.002354253,"about_ca_system_score_gemma":0.0017406266,"threshold_uncertainty_score":0.01897347},"labels":[],"label_agreement":null},{"id":"W2092910894","doi":"10.1016/s0304-3975(98)00223-0","title":"Power consumption in packet radio networks","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":424,"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; Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Bounded function; Network packet; Constant (computer programming); Approximation algorithm; Mathematics; Assignment problem; Range (aeronautics); Generalized assignment problem; Node (physics); Path (computing); Mathematical optimization; Dynamic programming; Combinatorics; Discrete mathematics; Computer science; Computer network","score_opus":0.007225679416192487,"score_gpt":0.23289500770145535,"score_spread":0.22566932828526287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092910894","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.3544423,0.007324516,0.6013944,0.00178365,0.00036905587,0.00006505358,0.0003919,0.0008790328,0.033350095],"genre_scores_gemma":[0.9830777,0.0011683195,0.008236516,0.000063076346,0.000080402824,0.000024582117,0.000117674674,0.000102464284,0.0071292827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994986,0.00013781323,0.000018218927,0.000060008202,0.00020513989,0.0000801645],"domain_scores_gemma":[0.9986154,0.001034012,0.00006485952,0.00010826869,0.00014496878,0.000032463355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005207947,0.00040126123,0.00046750225,0.0005424452,0.00032602772,0.0009298898,0.0006237803,0.0004706422,0.0030575146],"category_scores_gemma":[0.0036036423,0.0003561513,0.00015037687,0.0010702218,0.00041213716,0.0013491708,0.0003870357,0.00038661197,0.00041224464],"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.00030042115,0.00010993284,0.0038247595,0.0001854387,0.00005057761,0.00021543397,0.00015370798,0.80079514,0.011439772,0.058081225,0.0031908303,0.12165279],"study_design_scores_gemma":[0.000012567203,0.000070553026,0.0024717506,0.000014947683,0.000027930582,0.00018832253,0.00008850092,0.9461772,0.0041278256,0.043027215,0.003780666,0.000012547025],"about_ca_topic_score_codex":0.0010478911,"about_ca_topic_score_gemma":0.00077288167,"teacher_disagreement_score":0.0030575146,"about_ca_system_score_codex":0.000711805,"about_ca_system_score_gemma":0.0002546063,"threshold_uncertainty_score":0.010228395},"labels":[],"label_agreement":null},{"id":"W2093015753","doi":"10.1016/j.tcs.2009.04.023","title":"On the relative dominance of paging algorithms","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Austrian Science Fund","keywords":"Paging; Computer science; Algorithm; Thrashing; Demand paging; Interval (graph theory); Mathematics; Virtual memory; Parallel computing; Combinatorics; Operating system; Memory management","score_opus":0.013791904763709497,"score_gpt":0.2660141089415978,"score_spread":0.2522222041778883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093015753","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.13562194,0.010502571,0.7268359,0.006878623,0.00074136857,0.0002459787,0.000639456,0.0006056956,0.11792854],"genre_scores_gemma":[0.8122628,0.006994543,0.14355366,0.0019997444,0.0017893005,0.00044538148,0.0007007449,0.00084529474,0.0314086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893231,0.005871721,0.00034988148,0.00072464085,0.002383186,0.0013474997],"domain_scores_gemma":[0.93903404,0.051178027,0.0016632491,0.0033590642,0.0030333798,0.0017322042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010451717,0.002203675,0.004003275,0.0028660847,0.0027096532,0.0065031294,0.004450327,0.002877304,0.012306551],"category_scores_gemma":[0.06398213,0.0013915859,0.0015930102,0.0053325747,0.0042889104,0.012630519,0.0044979397,0.005689218,0.0020894888],"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.0010214174,0.00031396514,0.0014057831,0.00048202332,0.00010922729,0.00013598977,0.0005448136,0.103908576,0.0022831617,0.7782071,0.017497964,0.09409004],"study_design_scores_gemma":[0.00014749145,0.00025643726,0.0005286261,0.00012424585,0.00009829135,0.00027875823,0.0001610548,0.264923,0.0010526609,0.7238074,0.008580866,0.000041077998],"about_ca_topic_score_codex":0.002875619,"about_ca_topic_score_gemma":0.0022980026,"teacher_disagreement_score":0.012306551,"about_ca_system_score_codex":0.0031008008,"about_ca_system_score_gemma":0.0033954117,"threshold_uncertainty_score":0.055274606},"labels":[],"label_agreement":null},{"id":"W2093528244","doi":"10.1016/j.tcs.2005.11.039","title":"Approximation algorithms for minimizing the total weighted tardiness on a single machine","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"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; European Social Fund; Ministry of National Education and Religious Affairs","keywords":"Tardiness; Algorithm; Single-machine scheduling; Computer science; Approximation algorithm; Mathematical optimization; Mathematics; Job shop scheduling","score_opus":0.009993433012399786,"score_gpt":0.21974957702617523,"score_spread":0.20975614401377546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093528244","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.025642263,0.0005735094,0.97055906,0.00037991177,0.0001104534,0.00008145356,0.00010621005,0.0005039538,0.0020431601],"genre_scores_gemma":[0.3493368,0.0008954321,0.6436822,0.00020992446,0.00024729696,0.00043728529,0.0004977874,0.00036446803,0.0043288935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985763,0.0005197169,0.000070660295,0.00024631462,0.0003437252,0.00024326117],"domain_scores_gemma":[0.9940877,0.0042709243,0.00045956144,0.00049877877,0.00042640197,0.00025666706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032556138,0.0018175271,0.0025648922,0.0013133954,0.0008994589,0.0020440104,0.003434696,0.0023968322,0.003520716],"category_scores_gemma":[0.010057096,0.0012557727,0.001235765,0.0029674387,0.001110825,0.0030555048,0.0014497305,0.0026308706,0.0008119525],"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.00042523188,0.00014703738,0.00041259758,0.0001517413,0.000053164506,0.000033346143,0.00007978449,0.92856306,0.000962325,0.012023031,0.0023920904,0.05475663],"study_design_scores_gemma":[0.000039079652,0.000031326068,0.000046947178,0.000006536155,0.000010233294,0.000012239114,0.000012137142,0.99083215,0.00018701146,0.00864684,0.00017141819,0.0000041102185],"about_ca_topic_score_codex":0.005429791,"about_ca_topic_score_gemma":0.0057120924,"teacher_disagreement_score":0.005429791,"about_ca_system_score_codex":0.0025430843,"about_ca_system_score_gemma":0.0028186094,"threshold_uncertainty_score":0.018451393},"labels":[],"label_agreement":null},{"id":"W2093783531","doi":"10.1016/j.tcs.2011.02.021","title":"Positive expansiveness versus network dimension in symbolic dynamical systems","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dynamical systems theory; Countable set; Dynamical system (definition); Topological entropy; Symbolic dynamics; Counterexample; Discrete mathematics; Invariant (physics); Exponent; Dimension (graph theory); Function (biology); Topological conjugacy; Pure mathematics; Combinatorics","score_opus":0.014673494038912948,"score_gpt":0.23768209010071864,"score_spread":0.2230085960618057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093783531","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.7309556,0.0020057845,0.20287225,0.0031427091,0.00015854288,0.000043318087,0.00016370104,0.000084220286,0.060573943],"genre_scores_gemma":[0.9936069,0.00047676978,0.00417949,0.000048541642,0.00010090006,0.00003352913,0.000022766788,0.000009508149,0.0015215781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936324,0.00028193748,0.000033379314,0.00011100523,0.00014157507,0.000068896596],"domain_scores_gemma":[0.9914683,0.006314428,0.0007882383,0.00046700664,0.00036264857,0.0005993899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010923997,0.00046417164,0.0006632825,0.0012706025,0.0010271134,0.0026686722,0.00054444076,0.0007366749,0.0033223839],"category_scores_gemma":[0.006419997,0.00033187892,0.00036523698,0.00071831414,0.005791295,0.004879345,0.002368573,0.0012981879,0.00016325692],"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.000042841733,0.000014656973,0.00075798645,0.000044395296,0.00001233776,0.00006848702,0.00037589722,0.012135766,0.00070768053,0.9816098,0.00018450065,0.004045622],"study_design_scores_gemma":[0.000017733008,0.000026362502,0.00042087625,0.000016308952,0.000011022641,0.00006279108,0.0001438443,0.028421473,0.00024695243,0.9697379,0.0008828232,0.000011895414],"about_ca_topic_score_codex":0.00047193872,"about_ca_topic_score_gemma":0.00040893446,"teacher_disagreement_score":0.0033223839,"about_ca_system_score_codex":0.0006243596,"about_ca_system_score_gemma":0.000320528,"threshold_uncertainty_score":0.011114538},"labels":[],"label_agreement":null},{"id":"W2093995619","doi":"10.1016/j.tcs.2005.11.023","title":"Efficient algorithms for robustness in resource allocation and scheduling problems","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Robustness (evolution); Scheduling (production processes); Algorithm; Mathematical optimization; Distributed computing; Mathematics","score_opus":0.019938166810192462,"score_gpt":0.27476555904362915,"score_spread":0.2548273922334367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093995619","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.005909426,0.000608523,0.9905894,0.00033552325,0.00006759948,0.00006240844,0.00005997945,0.00033511425,0.0020319729],"genre_scores_gemma":[0.4742645,0.0015318985,0.51730484,0.00043403683,0.0005139383,0.0006628514,0.0004864599,0.0005280037,0.004273529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954821,0.0023540931,0.00021389041,0.0006148936,0.00087788026,0.00045720034],"domain_scores_gemma":[0.9805982,0.016033087,0.0012537441,0.0010889333,0.0006774475,0.00034860653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073167565,0.0025424266,0.0027958106,0.0025255603,0.0009823542,0.0030449254,0.0030234335,0.0031093939,0.004178653],"category_scores_gemma":[0.031098995,0.0012993551,0.0020647233,0.0021458177,0.0026499284,0.0040923352,0.0038043985,0.004303695,0.00074866693],"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.0002714925,0.000084623876,0.00025991024,0.00017482479,0.000089309906,0.000041635518,0.000068225716,0.8882728,0.0010652686,0.059480026,0.0022996245,0.04789223],"study_design_scores_gemma":[0.0000418158,0.00003213423,0.000048346876,0.000014715015,0.000017098,0.000015308944,0.000010586856,0.9444652,0.0003399719,0.05449842,0.0005085358,0.000007840212],"about_ca_topic_score_codex":0.0022438124,"about_ca_topic_score_gemma":0.0013841987,"teacher_disagreement_score":0.0073167565,"about_ca_system_score_codex":0.0022665919,"about_ca_system_score_gemma":0.001748414,"threshold_uncertainty_score":0.038695157},"labels":[],"label_agreement":null},{"id":"W2094083250","doi":"10.1016/j.tcs.2011.05.016","title":"An edge deletion model for complex networks","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.035898796686286094,"score_gpt":0.28954232575921907,"score_spread":0.25364352907293297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094083250","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.06320065,0.0005175738,0.91864383,0.0031018124,0.00014826375,0.000090380985,0.00067220494,0.00022092479,0.013404354],"genre_scores_gemma":[0.82730216,0.002112366,0.11260974,0.0008864991,0.00042062928,0.00051608245,0.0011017446,0.00026407445,0.054786716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910957,0.00039455216,0.000029302944,0.00023621248,0.00013205183,0.00009820927],"domain_scores_gemma":[0.99353784,0.004340008,0.00053659145,0.00066923327,0.00047528124,0.00044098354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024745713,0.0011349645,0.0015564197,0.001111088,0.0011961648,0.0022202968,0.0042809374,0.0029457244,0.008235074],"category_scores_gemma":[0.010086553,0.00070075586,0.0010145709,0.0017746869,0.0020706188,0.005474994,0.0019159293,0.0032174091,0.0013631061],"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.00013339432,0.00008478526,0.0007464024,0.00011905412,0.00003909806,0.00024031571,0.00026669184,0.2635894,0.0014830711,0.7178456,0.0050147735,0.010437431],"study_design_scores_gemma":[0.00004005786,0.000027453758,0.00017387584,0.000014915335,0.000028193283,0.00010975022,0.000044504042,0.6575598,0.00020924884,0.33901986,0.002753515,0.000018899686],"about_ca_topic_score_codex":0.002523747,"about_ca_topic_score_gemma":0.0028079026,"teacher_disagreement_score":0.008235074,"about_ca_system_score_codex":0.0014900168,"about_ca_system_score_gemma":0.0009841636,"threshold_uncertainty_score":0.027549028},"labels":[],"label_agreement":null},{"id":"W2094270516","doi":"10.1016/j.tcs.2014.03.014","title":"A bijective variant of the Burrows–Wheeler Transform using V -order","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"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; Bijection; String (physics); Factorization; Order (exchange); Combinatorics; Mathematics; Sorting; Suffix; Algorithm; Extension (predicate logic); Suffix array; Discrete mathematics; Data structure; Computer science","score_opus":0.008812748346585018,"score_gpt":0.23876803994743095,"score_spread":0.22995529160084593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094270516","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.019407678,0.000931712,0.9485382,0.00040983703,0.00070184586,0.000073652875,0.00019833926,0.0005924084,0.02914634],"genre_scores_gemma":[0.36685714,0.0021018593,0.5797764,0.00068258826,0.0008013792,0.00017914589,0.0006571264,0.0010570174,0.047887325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992105,0.00014855937,0.000046435165,0.00014606536,0.00036848095,0.00008000691],"domain_scores_gemma":[0.99927837,0.000212941,0.000050052637,0.0002615607,0.00014698652,0.000050067196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005528592,0.00049778254,0.0005757893,0.0013809287,0.0005544857,0.0017579786,0.0008976404,0.0007449016,0.006871098],"category_scores_gemma":[0.0027402434,0.00028001762,0.0005412857,0.001439376,0.0012796103,0.002312161,0.0015380504,0.0018789798,0.0029406687],"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.000111278976,0.00006540507,0.00017443362,0.00010781332,0.000018912004,0.00013641547,0.00014399664,0.0068061342,0.017074168,0.792282,0.005288333,0.17779106],"study_design_scores_gemma":[0.00006485921,0.00017492376,0.0003952082,0.00007827171,0.00003205951,0.0010200435,0.00014053588,0.11153233,0.031470172,0.7636806,0.09131618,0.00009483044],"about_ca_topic_score_codex":0.00074823794,"about_ca_topic_score_gemma":0.0007828343,"teacher_disagreement_score":0.006871098,"about_ca_system_score_codex":0.0003774763,"about_ca_system_score_gemma":0.00065166835,"threshold_uncertainty_score":0.022986114},"labels":[],"label_agreement":null},{"id":"W2094391659","doi":"10.1016/j.tcs.2013.12.023","title":"Price of asynchrony in mobile agents computing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"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 en Outaouais","funders":"","keywords":"Asynchrony (computer programming); Asynchronous communication; Rendezvous; Computer science; Distributed computing; Task (project management); Context (archaeology); Grid; Node (physics); Synchronization (alternating current); Distributed algorithm; Integer (computer science); Computer network; Mathematics; Spacecraft","score_opus":0.01074761978554087,"score_gpt":0.27420456160855056,"score_spread":0.26345694182300966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094391659","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.30889925,0.0070883418,0.567707,0.0342268,0.0031044676,0.00017127019,0.00048121306,0.0012009011,0.077120714],"genre_scores_gemma":[0.97176987,0.0007208237,0.019215517,0.00054775,0.0007507922,0.00009752568,0.000047669582,0.0001825808,0.006667379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963708,0.0014752891,0.00020017973,0.0005766452,0.0009169289,0.00046023296],"domain_scores_gemma":[0.957598,0.03204528,0.0020376947,0.004710835,0.0019369897,0.0016712871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005337352,0.0005762818,0.0016759551,0.00083237083,0.0018240876,0.0042212023,0.0022635292,0.0031597205,0.012663185],"category_scores_gemma":[0.05128165,0.0008997383,0.0005488707,0.0010983925,0.0025986603,0.012275859,0.0035162303,0.005123039,0.0011917572],"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.0014651822,0.00023698247,0.0024507064,0.00041605922,0.00010199791,0.0006367281,0.00060182816,0.14107099,0.0052212197,0.78512335,0.012084855,0.050590105],"study_design_scores_gemma":[0.00027605376,0.00021718591,0.00069825817,0.000051569914,0.00007251553,0.00029946183,0.00022531206,0.44723997,0.001339731,0.54213417,0.0074007367,0.00004506312],"about_ca_topic_score_codex":0.0010064547,"about_ca_topic_score_gemma":0.001246195,"teacher_disagreement_score":0.012663185,"about_ca_system_score_codex":0.0016190637,"about_ca_system_score_gemma":0.0015938574,"threshold_uncertainty_score":0.04236257},"labels":[],"label_agreement":null},{"id":"W2094408690","doi":"10.1016/j.tcs.2012.12.011","title":"Strict hierarchy among Bell Theorems","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Bell state; Local hidden variable theory; Bell's theorem; Bell test experiments; Quantum teleportation; Mathematics; Quantum mechanics; Bipartite graph; State (computer science); Quantum entanglement; Quantum; Discrete mathematics; Physics; Quantum channel; Algorithm","score_opus":0.008465686951181533,"score_gpt":0.24540853434351137,"score_spread":0.23694284739232985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094408690","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.09346235,0.0054684347,0.35783747,0.018692559,0.001615982,0.0001822947,0.0013517148,0.0011724079,0.5202167],"genre_scores_gemma":[0.89454734,0.0021552285,0.05468745,0.006391486,0.0026375442,0.0003277286,0.0008765463,0.000533952,0.037842616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928135,0.0023737296,0.0005459958,0.0010536335,0.0022564025,0.0009568156],"domain_scores_gemma":[0.9766629,0.014399285,0.00083257514,0.004318023,0.002594096,0.0011931595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076311193,0.0008419718,0.0023598077,0.0037060273,0.006438139,0.006108026,0.0028150238,0.003821302,0.014887792],"category_scores_gemma":[0.021905962,0.002141664,0.0015443579,0.0029559194,0.008996581,0.018464567,0.006105439,0.011634217,0.0035093965],"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.000007870087,0.0000059231506,0.000031774976,0.000018745806,0.0000023804564,0.000010666055,0.00006586754,0.000043691507,0.00006979786,0.99762446,0.0011073351,0.0010114504],"study_design_scores_gemma":[0.000005358689,0.0000028583652,0.00005044617,0.0000070359883,0.0000025572567,0.000020146059,0.00001135454,0.00047642854,0.000050939037,0.9984097,0.00095820485,0.0000049523483],"about_ca_topic_score_codex":0.0015431583,"about_ca_topic_score_gemma":0.001723576,"teacher_disagreement_score":0.014887792,"about_ca_system_score_codex":0.0031470712,"about_ca_system_score_gemma":0.0018144913,"threshold_uncertainty_score":0.04980457},"labels":[],"label_agreement":null},{"id":"W2096578724","doi":"10.1016/j.tcs.2014.09.022","title":"Confident and consistent partial learning of recursive functions","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National University of Singapore","keywords":"Recursive functions; Partial function; Computer science; Mathematics; Calculus (dental); Algebra over a field; Theoretical computer science; Algorithm; Artificial intelligence; Discrete mathematics; Pure mathematics; Medicine","score_opus":0.005754438812722299,"score_gpt":0.23142524644197493,"score_spread":0.22567080762925262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096578724","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.1008047,0.0009511762,0.8870587,0.0029039728,0.00007660718,0.000044669956,0.0004981015,0.0005107226,0.0071514137],"genre_scores_gemma":[0.9078235,0.0008403359,0.08179731,0.0006241274,0.00032440005,0.00014580472,0.0008732913,0.00020674765,0.007364447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931879,0.0034454984,0.00032273142,0.0011103757,0.0014132416,0.0005202465],"domain_scores_gemma":[0.86643976,0.10965387,0.0044971905,0.012797468,0.0048334254,0.0017782975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010227935,0.001086793,0.0020493574,0.0014114011,0.0010924699,0.0042803544,0.003077135,0.0029811433,0.004456153],"category_scores_gemma":[0.11904595,0.0014729903,0.0012198718,0.0017256457,0.005920359,0.011084907,0.005064319,0.0059951274,0.00061474374],"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.0003292879,0.00006231933,0.002267834,0.00013802695,0.00007280227,0.00010352421,0.00036468095,0.072882846,0.0006494529,0.8857296,0.0026302766,0.03476944],"study_design_scores_gemma":[0.000026949994,0.00003469472,0.00039271777,0.00003137598,0.000015407617,0.000049455393,0.000021451498,0.17660616,0.00041663635,0.82179886,0.00058899575,0.000017333776],"about_ca_topic_score_codex":0.0020648597,"about_ca_topic_score_gemma":0.0020227223,"teacher_disagreement_score":0.010227935,"about_ca_system_score_codex":0.0020281505,"about_ca_system_score_gemma":0.002546362,"threshold_uncertainty_score":0.054091156},"labels":[],"label_agreement":null},{"id":"W2099745962","doi":"10.1016/j.tcs.2011.09.002","title":"Asynchronous deterministic rendezvous in bounded terrains","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"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 en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Robot; Asynchronous communication; Computer science; Terrain; Bounded function; Mobile robot; Polygon (computer graphics); A priori and a posteriori; Trajectory; Algorithm; Motion planning; Mathematical optimization; Mathematics; Artificial intelligence; Spacecraft; Engineering; Geography","score_opus":0.027579630914106534,"score_gpt":0.2618971261887515,"score_spread":0.23431749527464496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099745962","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.40429333,0.0008512723,0.57606596,0.00064562564,0.00014169143,0.00006515864,0.00038314197,0.0008287318,0.016725142],"genre_scores_gemma":[0.97557175,0.00019942754,0.01936144,0.000041353233,0.000023529441,0.000041120104,0.00015604851,0.00008410024,0.0045213406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929273,0.00015981295,0.00003211294,0.0001554145,0.00017108154,0.00018878089],"domain_scores_gemma":[0.996933,0.0019832917,0.00026405498,0.00040500885,0.00017114957,0.00024352975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005803126,0.00050253735,0.001386089,0.0007189709,0.00120064,0.001385466,0.0015992244,0.0010447591,0.0043329704],"category_scores_gemma":[0.0054562385,0.00065510574,0.00048601098,0.0009380526,0.0015455539,0.0023391764,0.0030820828,0.0010628945,0.00049715873],"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.0005399718,0.000043955868,0.00086214737,0.00011306745,0.00003695226,0.00025077982,0.00019814304,0.86201805,0.004388732,0.11709571,0.0014437714,0.013008686],"study_design_scores_gemma":[0.000043706725,0.000023297893,0.0001777342,0.000005726015,0.000008589554,0.000036742116,0.00006254189,0.95351636,0.00067651836,0.044742893,0.00069630425,0.000009607367],"about_ca_topic_score_codex":0.005784438,"about_ca_topic_score_gemma":0.005980021,"teacher_disagreement_score":0.005784438,"about_ca_system_score_codex":0.0009901663,"about_ca_system_score_gemma":0.00056688057,"threshold_uncertainty_score":0.014495194},"labels":[],"label_agreement":null},{"id":"W2099846147","doi":"10.1016/j.tcs.2007.04.024","title":"Hardness and approximation results for Black Hole Search in arbitrary networks","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Node (physics); Black hole (networking); Approximation algorithm; Tree (set theory); Upper and lower bounds; Computer science; Mathematics; Black box; Combinatorics; Planar graph; Discrete mathematics; Theoretical computer science; Graph; Physics; Computer network; Artificial intelligence; Routing (electronic design automation)","score_opus":0.015594494620845169,"score_gpt":0.26388932728968884,"score_spread":0.24829483266884367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099846147","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.19979589,0.006310434,0.69282347,0.028004117,0.00096028275,0.0006961545,0.0032699045,0.0025096252,0.06563013],"genre_scores_gemma":[0.8443563,0.003262397,0.12436048,0.0028569608,0.0013341943,0.0007471672,0.0026153119,0.0009316416,0.019535564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936062,0.0022944,0.0002979356,0.0011711896,0.0012527704,0.0013775022],"domain_scores_gemma":[0.9445315,0.045923654,0.0019101825,0.004702879,0.0010728157,0.0018589386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055135996,0.0029494842,0.0051255133,0.0025043136,0.0042424994,0.0075267213,0.008601036,0.005794986,0.015453137],"category_scores_gemma":[0.044940688,0.0019746698,0.0039210073,0.00452938,0.008152681,0.023756787,0.0069718133,0.011145128,0.0013845216],"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.0031845383,0.00086699566,0.0041244784,0.0016446474,0.00046274616,0.0003980582,0.0014921767,0.36571032,0.002155084,0.5312062,0.039027475,0.049727302],"study_design_scores_gemma":[0.00029819642,0.00007309555,0.00040585198,0.000069818605,0.0001242289,0.000097234544,0.00022204565,0.3043947,0.0005551329,0.6914922,0.0022311017,0.000036390244],"about_ca_topic_score_codex":0.006893515,"about_ca_topic_score_gemma":0.0060815993,"teacher_disagreement_score":0.015453137,"about_ca_system_score_codex":0.0061168154,"about_ca_system_score_gemma":0.004960661,"threshold_uncertainty_score":0.051695883},"labels":[],"label_agreement":null},{"id":"W2100899126","doi":"10.1016/j.tcs.2009.03.030","title":"Interpolation of polynomials given by straight-line programs","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Interpolation (computer graphics); Line (geometry); Combinatorics; Polynomial; Polynomial interpolation; Degree (music); Upper and lower bounds; Discrete mathematics; Linear interpolation; Geometry; Mathematical analysis; Computer science; Image (mathematics)","score_opus":0.00979432748980266,"score_gpt":0.2506469350022867,"score_spread":0.24085260751248402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100899126","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.18123735,0.0002582705,0.79374427,0.00021985373,0.000073158146,0.000084018735,0.00024648223,0.0010902009,0.023046331],"genre_scores_gemma":[0.81899965,0.0003533399,0.16759261,0.00009984904,0.0000718631,0.00008184514,0.0004647552,0.00038427213,0.011951809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992329,0.00025115197,0.000039125443,0.00013112274,0.00021606202,0.0001297424],"domain_scores_gemma":[0.99827087,0.0009921069,0.00018963315,0.00022602912,0.00022444538,0.00009683435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010742735,0.000567568,0.0007136967,0.0009745906,0.0005926608,0.0014338379,0.0009653364,0.00057231466,0.0075504947],"category_scores_gemma":[0.0053554694,0.0003990333,0.000690299,0.0014497973,0.0009896151,0.002263564,0.0013295853,0.0017186401,0.0013694473],"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.00076642935,0.00017214222,0.0011286655,0.00018916368,0.000039308467,0.00016424374,0.00039523182,0.043894093,0.0070116865,0.85058594,0.0027295349,0.09292343],"study_design_scores_gemma":[0.00017673892,0.00024720764,0.00053406175,0.00006831037,0.000042925003,0.0001649084,0.00011197639,0.2707763,0.013604883,0.70090294,0.013324109,0.000045572095],"about_ca_topic_score_codex":0.0009139791,"about_ca_topic_score_gemma":0.0011594224,"teacher_disagreement_score":0.0075504947,"about_ca_system_score_codex":0.0010493436,"about_ca_system_score_gemma":0.0005312129,"threshold_uncertainty_score":0.025258958},"labels":[],"label_agreement":null},{"id":"W2101961482","doi":"10.1016/j.tcs.2012.10.011","title":"Learning without coding","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Numbering; Theoretical computer science; Computer science; Computable function; Coding (social sciences); Iterative learning control; Artificial intelligence; Natural language processing; Mathematics; Algorithm","score_opus":0.009088502408711367,"score_gpt":0.2651701515503501,"score_spread":0.2560816491416388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101961482","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.008742067,0.0015325826,0.8759051,0.010508679,0.0010557444,0.000090338166,0.00078675227,0.0010209787,0.100357704],"genre_scores_gemma":[0.5666062,0.003296287,0.26521742,0.005236536,0.0019764288,0.00051675335,0.002599082,0.0012336569,0.15331763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977811,0.00080759544,0.000114823284,0.00050181046,0.00063114276,0.00016366314],"domain_scores_gemma":[0.9914186,0.004291307,0.00023535464,0.0030303614,0.00082587835,0.00019851574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015993973,0.0008741128,0.00089301035,0.001220157,0.0013075947,0.002965188,0.0014220393,0.0017435986,0.017257862],"category_scores_gemma":[0.016224602,0.0005579202,0.0009896754,0.0013068464,0.004201011,0.009102668,0.0037318587,0.005038348,0.004447875],"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.000022825778,0.00001307669,0.00013842943,0.000060874318,0.000013314311,0.000023639228,0.000054659413,0.0037715642,0.00022992247,0.9418209,0.008437134,0.04541368],"study_design_scores_gemma":[0.000004144788,0.0000037290556,0.000029429923,0.000016419694,0.000004523196,0.000022824313,0.0000074901545,0.012096495,0.000286999,0.982209,0.0053144465,0.0000044440335],"about_ca_topic_score_codex":0.0016399262,"about_ca_topic_score_gemma":0.0013464354,"teacher_disagreement_score":0.017257862,"about_ca_system_score_codex":0.0015626119,"about_ca_system_score_gemma":0.0017900756,"threshold_uncertainty_score":0.057733297},"labels":[],"label_agreement":null},{"id":"W2102729564","doi":"10.1016/j.tcs.2004.10.033","title":"Data exchange: semantics and query answering","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1203,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Data exchange; Schema (genetic algorithms); Theoretical computer science; Semantics (computer science); Information retrieval; Database; Programming language","score_opus":0.022598624166246625,"score_gpt":0.2786496916886596,"score_spread":0.25605106752241297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102729564","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.011483171,0.009430942,0.9594916,0.008982442,0.0005868182,0.00013505264,0.00052122807,0.0008704953,0.008498204],"genre_scores_gemma":[0.4480446,0.013946088,0.5140966,0.002632444,0.0034675582,0.0006963182,0.0033463668,0.00076205673,0.013007939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98861814,0.0045568915,0.0016646781,0.0016976785,0.002859619,0.0006029936],"domain_scores_gemma":[0.98338795,0.0093707945,0.0011285617,0.0036264414,0.0019777664,0.00050849246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010682277,0.0013519529,0.002815471,0.0038938608,0.0028785588,0.015152608,0.0034102385,0.0044612563,0.0045990865],"category_scores_gemma":[0.03031478,0.0014552257,0.002298429,0.008585234,0.00794145,0.04401869,0.0051269215,0.0050905026,0.0014994942],"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.000102184036,0.000039465398,0.00033246278,0.00025024914,0.000030642088,0.000083347,0.00050675834,0.0025309396,0.00039100103,0.96038646,0.004545911,0.03080057],"study_design_scores_gemma":[0.000024400217,0.000014206131,0.00008998936,0.000061968516,0.00003859767,0.00020853193,0.00018179564,0.014964259,0.00062904146,0.9704724,0.01329495,0.000019719384],"about_ca_topic_score_codex":0.0025926768,"about_ca_topic_score_gemma":0.0012047074,"teacher_disagreement_score":0.015152608,"about_ca_system_score_codex":0.0028851717,"about_ca_system_score_gemma":0.0026601446,"threshold_uncertainty_score":0.056493938},"labels":[],"label_agreement":null},{"id":"W2102862468","doi":"10.1016/j.tcs.2005.10.002","title":"Simplifying the weft hierarchy","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Hierarchy; Normalization (sociology); Monotone polygon; Simple (philosophy); Mathematics; Discrete mathematics; Combinatorics; Calculus (dental); Algebra over a field; Pure mathematics; Philosophy; Epistemology; Geometry","score_opus":0.017219545451255067,"score_gpt":0.3028416063272443,"score_spread":0.2856220608759892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102862468","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.17544329,0.0018251548,0.30968413,0.009169406,0.0010509413,0.00007924135,0.00043951007,0.0016969114,0.5006114],"genre_scores_gemma":[0.8566135,0.0013656196,0.053060398,0.0014386011,0.0006084671,0.00008181692,0.00044354628,0.0009858012,0.085402235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899524,0.00022359329,0.000032804914,0.00017596495,0.00028884117,0.00028362777],"domain_scores_gemma":[0.9977804,0.0005978055,0.000114668685,0.0010055786,0.00028521646,0.00021638778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006476661,0.0005749464,0.0010691015,0.0013389323,0.0030267774,0.002468652,0.0015791587,0.0014923776,0.022020139],"category_scores_gemma":[0.004539668,0.0005269256,0.0010677304,0.0011908244,0.0036613804,0.009477835,0.004163448,0.0048791575,0.004411975],"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.000022721886,0.000013651626,0.0000585021,0.000021192584,0.0000034019783,0.000025924053,0.00015573014,0.0005549217,0.0004209226,0.9889915,0.0036298153,0.006101634],"study_design_scores_gemma":[0.000008958472,0.000006030066,0.000044321245,0.000011429913,0.0000051233787,0.000030412897,0.000059223483,0.0027451497,0.0002507727,0.98837847,0.008454,0.0000061345954],"about_ca_topic_score_codex":0.003430745,"about_ca_topic_score_gemma":0.004710073,"teacher_disagreement_score":0.022020139,"about_ca_system_score_codex":0.0016054421,"about_ca_system_score_gemma":0.00096812204,"threshold_uncertainty_score":0.073664665},"labels":[],"label_agreement":null},{"id":"W2104606980","doi":"10.1016/j.tcs.2011.10.026","title":"The loop formula based semantics of description logic programs","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stable model semantics; Answer set programming; Well-founded semantics; Logic programming; Semantics (computer science); Classical logic; Theoretical computer science; Programming language; Computer science; Operational semantics; Mathematics; Set (abstract data type); Algebra over a field; Discrete mathematics; Algorithm; Denotational semantics; Pure mathematics","score_opus":0.0374375417248961,"score_gpt":0.24258265929032496,"score_spread":0.20514511756542886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104606980","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.026843244,0.00052258815,0.9551336,0.0017152213,0.000120977726,0.00010825402,0.0005425598,0.0011886153,0.013824968],"genre_scores_gemma":[0.7304053,0.00064838456,0.25838917,0.0007854587,0.00024066101,0.0002831359,0.00096336775,0.00043522715,0.007849312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807656,0.0006519445,0.00017763236,0.000291032,0.00057964853,0.00022309515],"domain_scores_gemma":[0.99651766,0.001890188,0.0002267318,0.000578192,0.00059704325,0.00019015577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025248816,0.0005442249,0.00064540404,0.0015132395,0.0009245895,0.0041213487,0.0020920138,0.0014505956,0.0049760025],"category_scores_gemma":[0.0065328805,0.0005136208,0.0012260531,0.0012772463,0.0030428374,0.009513984,0.0022354077,0.0026156476,0.00073399383],"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.00006202925,0.000023137382,0.000116707735,0.00006184909,0.000009525375,0.000046063527,0.000256848,0.0025310817,0.0010100323,0.9817708,0.0007531726,0.013358588],"study_design_scores_gemma":[0.000038281134,0.000025118146,0.000055971832,0.000027185624,0.000025316045,0.00004291088,0.000059736238,0.023943061,0.0016488475,0.96811265,0.0060061878,0.000014655953],"about_ca_topic_score_codex":0.0016747739,"about_ca_topic_score_gemma":0.0011977763,"teacher_disagreement_score":0.0049760025,"about_ca_system_score_codex":0.001660177,"about_ca_system_score_gemma":0.0015087345,"threshold_uncertainty_score":0.016646385},"labels":[],"label_agreement":null},{"id":"W2105334284","doi":"10.1016/j.tcs.2014.12.007","title":"Searching on a line: A complete characterization of the optimal solution","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Competitive analysis; Parameterized complexity; Mathematics; Position (finance); Upper and lower bounds; Mathematical optimization; Characterization (materials science); Line (geometry); Search problem; Combinatorics","score_opus":0.02262614493001695,"score_gpt":0.2660139534981598,"score_spread":0.24338780856814288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105334284","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.028471222,0.0013556987,0.92038137,0.0019899476,0.00008714891,0.00013133504,0.0008527145,0.0002962262,0.0464343],"genre_scores_gemma":[0.48829454,0.0059969327,0.4581929,0.001772651,0.0008105763,0.0008918564,0.0024967662,0.001088294,0.040455464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984756,0.00042804118,0.00010074358,0.0003959289,0.00039759412,0.00020214317],"domain_scores_gemma":[0.99677104,0.001808971,0.0003896766,0.00033921393,0.0004721986,0.00021888979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00167144,0.0018445511,0.002250502,0.0029786245,0.0013744602,0.004850482,0.002851002,0.0027926378,0.019970281],"category_scores_gemma":[0.010142162,0.001094969,0.001700176,0.0033816274,0.0028659878,0.010789605,0.0031683636,0.0042900424,0.0022564405],"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.000110433015,0.00009901643,0.00071729836,0.00033972628,0.000060287075,0.000088897534,0.000270072,0.09766402,0.0015459254,0.83197844,0.010111434,0.057014503],"study_design_scores_gemma":[0.000024609622,0.0001028432,0.0003090554,0.00009693424,0.000026721595,0.00013307478,0.00011910729,0.28255665,0.0005893956,0.7079807,0.008032764,0.000028095103],"about_ca_topic_score_codex":0.0015552398,"about_ca_topic_score_gemma":0.0010369794,"teacher_disagreement_score":0.019970281,"about_ca_system_score_codex":0.0012350361,"about_ca_system_score_gemma":0.0015825069,"threshold_uncertainty_score":0.06680721},"labels":[],"label_agreement":null},{"id":"W2106875872","doi":"10.1016/j.tcs.2012.10.055","title":"Quotient complexity of ideal languages","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ideal (ethics); Mathematics; Regular language; Concatenation (mathematics); Quotient; Discrete mathematics; Intersection (aeronautics); Generator (circuit theory); Combinatorics; Computer science; Theoretical computer science; Automaton","score_opus":0.020154317981563488,"score_gpt":0.2752687244087085,"score_spread":0.255114406427145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106875872","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.72519916,0.0013469431,0.1652901,0.0064508105,0.00020627576,0.00007783664,0.00072639965,0.00054939295,0.100153126],"genre_scores_gemma":[0.98107845,0.00034384363,0.00734483,0.00021852864,0.0002625847,0.00007223732,0.00046619438,0.00010189893,0.010111582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997629,0.0006173744,0.00015323117,0.00040393104,0.00075822056,0.00043833756],"domain_scores_gemma":[0.99067783,0.00615962,0.00058858015,0.0007563889,0.0008614716,0.00095600873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019180942,0.0005914428,0.0012415366,0.0020252264,0.0020239411,0.00582352,0.0016907259,0.0010628429,0.010824594],"category_scores_gemma":[0.008733174,0.0005498522,0.0013250029,0.0015380768,0.0045180186,0.015942873,0.0034570226,0.003622749,0.00079700025],"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.00008080471,0.00002702121,0.00041818531,0.000026560458,0.000006463905,0.000048629227,0.0004098621,0.001219365,0.00047427637,0.99460924,0.0005558393,0.0021237293],"study_design_scores_gemma":[0.00001393583,0.000008728841,0.00015870528,0.0000040168343,0.0000060483267,0.00004126129,0.00006448898,0.0054383893,0.00033415417,0.993233,0.00068829086,0.000008918573],"about_ca_topic_score_codex":0.0016082122,"about_ca_topic_score_gemma":0.0010923087,"teacher_disagreement_score":0.010824594,"about_ca_system_score_codex":0.0030126928,"about_ca_system_score_gemma":0.0011236024,"threshold_uncertainty_score":0.03621185},"labels":[],"label_agreement":null},{"id":"W2107243490","doi":"10.1016/j.tcs.2005.05.007","title":"Games on triangulations","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Artificial Intelligence in Medicine (Canada); University of New Brunswick","funders":"","keywords":"Combinatorial game theory; Computer science; Theoretical computer science; Variation (astronomy); Combinatorics; Position (finance); Time complexity; Mathematics; Game theory; Sequential game; Mathematical economics","score_opus":0.02323360527989452,"score_gpt":0.3010453241538673,"score_spread":0.27781171887397277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107243490","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.13888295,0.0009000284,0.49325892,0.0039505004,0.00085797644,0.00029940566,0.00096821284,0.000503184,0.3603788],"genre_scores_gemma":[0.7833161,0.0008138705,0.09806824,0.00055032823,0.00027214142,0.00034079017,0.0010941376,0.00041047556,0.11513393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986507,0.00043831806,0.00008637854,0.00023676129,0.00036979103,0.00021798538],"domain_scores_gemma":[0.9976935,0.0011352121,0.00020786218,0.00027060666,0.0002857669,0.00040698837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006653938,0.00093815,0.0010888256,0.0018114875,0.0023717282,0.0038146118,0.0016010336,0.0016642166,0.025521489],"category_scores_gemma":[0.0054061357,0.0007897038,0.0013631871,0.0016062907,0.0029662438,0.0053757518,0.0046077697,0.003419381,0.0019798807],"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.000015867812,0.000006049094,0.00004153481,0.000015760701,0.0000047073563,0.0000237538,0.00012423215,0.0014514525,0.00014516897,0.9944689,0.0011397063,0.0025628712],"study_design_scores_gemma":[0.000015940452,0.000007735289,0.000045482288,0.000010871783,0.000004483293,0.000027439755,0.00010608363,0.0067359456,0.00007580205,0.98821634,0.0047489847,0.0000047480353],"about_ca_topic_score_codex":0.003556071,"about_ca_topic_score_gemma":0.0033174313,"teacher_disagreement_score":0.025521489,"about_ca_system_score_codex":0.0018199449,"about_ca_system_score_gemma":0.00073042396,"threshold_uncertainty_score":0.08537787},"labels":[],"label_agreement":null},{"id":"W2107263471","doi":"10.1016/j.tcs.2006.02.024","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-Spine, 1-bend planarity","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Planarity testing; Planar graph; Planar; Combinatorics; Mathematics; Geometry; Vertex (graph theory); Hamiltonian path; Algorithm; Graph; Computer science; Computer graphics (images)","score_opus":0.012392663271763091,"score_gpt":0.23701306708695594,"score_spread":0.22462040381519285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107263471","genre_codex":"methods","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.0016826462,0.00041426977,0.44270402,0.0032578814,0.001411577,0.00034675185,0.11746145,0.14222747,0.290494],"genre_scores_gemma":[0.028677361,0.0015889138,0.3123768,0.0018692882,0.0007457999,0.0008781643,0.21757178,0.12214745,0.3141445],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952495,0.000060478604,0.00005302,0.00006843236,0.0002500651,0.000043030446],"domain_scores_gemma":[0.9987645,0.0003445395,0.000069714086,0.0003107967,0.00042167288,0.000088698434],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00058461673,0.0015239228,0.0009941871,0.0020377317,0.0010259363,0.0044964883,0.003335664,0.0021195677,0.44092923],"category_scores_gemma":[0.003798441,0.0010433492,0.0009770995,0.002986727,0.0006701726,0.005257679,0.002113883,0.0023737224,0.2921074],"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.00007149121,0.000030940184,0.00014140269,0.00034510822,0.000009849152,0.000075176235,0.00009916726,0.0010437137,0.0025817,0.057838798,0.88343215,0.054330382],"study_design_scores_gemma":[0.000056470824,0.000015144137,0.00032778247,0.0000828131,0.000008663748,0.0002093812,0.000056393972,0.007813406,0.0076909745,0.037564114,0.94613254,0.000042332867],"about_ca_topic_score_codex":0.0057879575,"about_ca_topic_score_gemma":0.008645889,"teacher_disagreement_score":0.55907077,"about_ca_system_score_codex":0.0015114595,"about_ca_system_score_gemma":0.0012252482,"threshold_uncertainty_score":0.7974466},"labels":[],"label_agreement":null},{"id":"W2107552967","doi":"10.1016/j.tcs.2011.12.028","title":"State complexity of union and intersection of star on regular languages","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Intersection (aeronautics); Regular language; State (computer science); Star (game theory); Component (thermodynamics); Mathematics; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automaton","score_opus":0.02220350129067516,"score_gpt":0.24425759313541612,"score_spread":0.22205409184474095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107552967","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.92217183,0.00028684156,0.063296594,0.0017905873,0.000038347658,0.00007082886,0.0011751449,0.00041412428,0.010755703],"genre_scores_gemma":[0.99125403,0.000107572916,0.005367859,0.000056311277,0.000050134466,0.00004553073,0.0006715752,0.00009809525,0.0023489934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619484,0.0009650253,0.00029682365,0.0006885214,0.0009806271,0.00087411137],"domain_scores_gemma":[0.931561,0.056383282,0.00296428,0.0040427065,0.0023736584,0.0026750644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030099342,0.00051181886,0.0020943575,0.0017313871,0.0026069393,0.00895697,0.002514832,0.002375279,0.012750997],"category_scores_gemma":[0.026616193,0.0011532914,0.0022276328,0.0020639708,0.0039836755,0.018170014,0.004107705,0.0040246625,0.0005469303],"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.0017484489,0.00030080313,0.009669343,0.0002446925,0.000116475865,0.00027257408,0.0020717655,0.08984633,0.0040662372,0.87194073,0.0035290786,0.016193543],"study_design_scores_gemma":[0.000095457006,0.00007674804,0.0018767153,0.000020703608,0.0000728906,0.000105906634,0.00042576174,0.29505345,0.003046676,0.6984658,0.0007052948,0.00005459353],"about_ca_topic_score_codex":0.005626721,"about_ca_topic_score_gemma":0.0055914572,"teacher_disagreement_score":0.012750997,"about_ca_system_score_codex":0.0039903787,"about_ca_system_score_gemma":0.003211083,"threshold_uncertainty_score":0.042656302},"labels":[],"label_agreement":null},{"id":"W2108489993","doi":"10.1016/j.tcs.2007.02.059","title":"Recursively defined metric spaces without contraction","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Metric space; Bounded function; Metric (unit); Fixed point; Contraction (grammar); Probabilistic logic; Banach space; Discrete mathematics; Contraction mapping; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.012316706694448192,"score_gpt":0.2644182511156446,"score_spread":0.2521015444211964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108489993","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.057143748,0.0013251951,0.89525145,0.001362943,0.00020643226,0.000077982506,0.00027445392,0.00039814244,0.043959558],"genre_scores_gemma":[0.5920309,0.0010175166,0.37688333,0.0007432003,0.00021807707,0.00030960992,0.0007942759,0.00042104823,0.027582001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953616,0.0015948939,0.0003910081,0.0011049209,0.0011617853,0.00038586807],"domain_scores_gemma":[0.9938933,0.0028517435,0.00035333112,0.0013506887,0.0010415618,0.0005093308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003108308,0.0009271027,0.0011465919,0.0019136666,0.001560014,0.003673062,0.0023459417,0.0019541301,0.006241839],"category_scores_gemma":[0.0111461,0.0007450233,0.0017139348,0.0015047723,0.004783294,0.014067767,0.006593222,0.0061338553,0.0014401829],"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.000008983033,0.00000539444,0.0000502873,0.000014531012,0.000003303731,0.000025183186,0.00011877632,0.000331806,0.00031522888,0.9953366,0.0002663978,0.0035236122],"study_design_scores_gemma":[0.000009303274,0.00001586911,0.00006546985,0.000012248788,0.000006733574,0.00010087746,0.00005635582,0.0054112864,0.000685027,0.98904735,0.004578477,0.00001091617],"about_ca_topic_score_codex":0.00097255176,"about_ca_topic_score_gemma":0.0011455581,"teacher_disagreement_score":0.006241839,"about_ca_system_score_codex":0.0021693406,"about_ca_system_score_gemma":0.0012835322,"threshold_uncertainty_score":0.020880997},"labels":[],"label_agreement":null},{"id":"W2109036808","doi":"10.1016/j.tcs.2008.12.054","title":"State complexity of basic operations on suffix-free regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"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":"Catenation; Regular language; Suffix; Deterministic finite automaton; State (computer science); Abstract family of languages; Regular expression; Computer science; Nondeterministic finite automaton; Automaton; Cone (formal languages); Finite-state machine; Combined operations; Deterministic automaton; Pumping lemma for regular languages; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Programming language; Automata theory; Second-generation programming language; Fifth-generation programming language; Linguistics","score_opus":0.015094532963450848,"score_gpt":0.26196869014037016,"score_spread":0.24687415717691932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109036808","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.9209095,0.0002011775,0.06808453,0.00081736915,0.000031959877,0.00006497258,0.00086551695,0.00043371186,0.008591223],"genre_scores_gemma":[0.9903054,0.00011673311,0.0063640457,0.000048097107,0.00005279563,0.00005635474,0.0006121635,0.00008749353,0.0023568426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974954,0.0004793327,0.00021545874,0.0004397656,0.00076942274,0.00060052966],"domain_scores_gemma":[0.9609974,0.0316106,0.0017707425,0.0027771348,0.0015922349,0.0012517706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017973302,0.00053408137,0.0014569827,0.0012100771,0.0014475666,0.006524659,0.0019574156,0.0016668617,0.010024718],"category_scores_gemma":[0.015903234,0.000764378,0.0014301649,0.0016800753,0.0027560452,0.0133164115,0.0025658316,0.0028002372,0.0006607213],"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.0020163455,0.00039599015,0.0060998793,0.00027374073,0.000087049695,0.00030487048,0.0019537155,0.07114,0.01240842,0.87819004,0.0028115585,0.024318349],"study_design_scores_gemma":[0.00010088773,0.0001143825,0.0015180288,0.000016198708,0.00005461707,0.00010028579,0.00024292954,0.20489375,0.005347736,0.78698343,0.0005775558,0.000050196835],"about_ca_topic_score_codex":0.0021933133,"about_ca_topic_score_gemma":0.0024192366,"teacher_disagreement_score":0.010024718,"about_ca_system_score_codex":0.0023530605,"about_ca_system_score_gemma":0.002054681,"threshold_uncertainty_score":0.033536077},"labels":[],"label_agreement":null},{"id":"W2111945870","doi":"10.1016/j.tcs.2014.07.011","title":"On the approximability of the exemplar adjacency number problem for genomes with gene repetitions","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Alberta Innovates - Technology Futures; National Science Foundation","keywords":"Combinatorics; Parameterized complexity; Adjacency list; Mathematics; Genome; Approximation algorithm; Set (abstract data type); Alphabet; Measure (data warehouse); Discrete mathematics; Gene; Computer science; Biology; Genetics","score_opus":0.006080399229874966,"score_gpt":0.21752872795666095,"score_spread":0.21144832872678598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111945870","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.2610508,0.0017137341,0.70668733,0.0055894363,0.00025762644,0.00015848111,0.000839119,0.0019679659,0.021735517],"genre_scores_gemma":[0.67977333,0.0009920762,0.30502963,0.0009503437,0.00047292246,0.00030240274,0.002263524,0.0009134181,0.009302357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720997,0.0011217267,0.00012936817,0.00070121704,0.00046573984,0.00037198688],"domain_scores_gemma":[0.95618314,0.039268214,0.0010141981,0.0019590443,0.00085324177,0.00072208594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038859544,0.0018370942,0.00270085,0.0018521337,0.0019075687,0.0043707695,0.0059006936,0.004332919,0.011011249],"category_scores_gemma":[0.040039558,0.0010963195,0.002325687,0.0025603604,0.003882608,0.01002224,0.0040817126,0.0059195175,0.0011357156],"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.0010871767,0.00048307076,0.003473492,0.000671283,0.00018849413,0.00023567195,0.0007746795,0.6392479,0.0025116906,0.27464932,0.012322208,0.064354986],"study_design_scores_gemma":[0.000071944116,0.00004936458,0.00027088745,0.000038169426,0.00003516852,0.000101854945,0.00009796742,0.6882381,0.00053685845,0.30960774,0.0009353044,0.000016657725],"about_ca_topic_score_codex":0.006213332,"about_ca_topic_score_gemma":0.0065662493,"teacher_disagreement_score":0.011011249,"about_ca_system_score_codex":0.0030930617,"about_ca_system_score_gemma":0.0021639327,"threshold_uncertainty_score":0.036836267},"labels":[],"label_agreement":null},{"id":"W2111953579","doi":"10.1016/j.tcs.2009.09.014","title":"Why greed works for shortest common superstring problem","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Tsinghua University; National Science Foundation","keywords":"Greedy algorithm; Mathematics; Algorithm; Combinatorics; Superstring theory; Asymptotically optimal algorithm; Approximation algorithm; Sequence (biology); Biology; Supersymmetry; Genetics","score_opus":0.012502913709073315,"score_gpt":0.2567674646483736,"score_spread":0.24426455093930027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111953579","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.18281576,0.007971285,0.6464126,0.052245144,0.004475812,0.0003426769,0.0011580257,0.0062044794,0.098374225],"genre_scores_gemma":[0.6962422,0.0023564969,0.25539368,0.0062163924,0.0017094705,0.00024383716,0.0013796411,0.0024646255,0.03399372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610597,0.0013580755,0.00020026589,0.00087584945,0.0008973215,0.0005623515],"domain_scores_gemma":[0.98463076,0.008275791,0.00039401243,0.0045800232,0.0016008789,0.0005185139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038842608,0.0006533817,0.0020277046,0.0016709467,0.002505797,0.0046839137,0.0026051633,0.0048485403,0.015477897],"category_scores_gemma":[0.030453209,0.0006267787,0.0015847447,0.0020365268,0.004538977,0.020229876,0.0029394552,0.004975226,0.0040724324],"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.00055994134,0.00018481474,0.0016271524,0.00043776093,0.00009708423,0.000288732,0.00037876848,0.016708883,0.0030620412,0.8287592,0.043665405,0.10423008],"study_design_scores_gemma":[0.000065760454,0.000042756514,0.00012977181,0.00005501717,0.000029435316,0.00024962914,0.00015023146,0.032093,0.0020937661,0.95557994,0.00948569,0.000025102894],"about_ca_topic_score_codex":0.0014239107,"about_ca_topic_score_gemma":0.0010714149,"teacher_disagreement_score":0.015477897,"about_ca_system_score_codex":0.0015633933,"about_ca_system_score_gemma":0.0017603742,"threshold_uncertainty_score":0.051778734},"labels":[],"label_agreement":null},{"id":"W2112167630","doi":"10.1016/j.tcs.2009.06.003","title":"The complexity of weighted Boolean #CSP with mixed signs","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Parameterized complexity; Discrete mathematics; Sign (mathematics); Partition (number theory); Weight function; Combinatorics; Function (biology); Boolean function; Polynomial; Affine transformation; Pure mathematics","score_opus":0.025818018430684833,"score_gpt":0.28477121299437513,"score_spread":0.2589531945636903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112167630","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.5732782,0.000763289,0.36568826,0.0103224665,0.00025335656,0.000313499,0.003922222,0.0013258321,0.044132918],"genre_scores_gemma":[0.9225834,0.00048587704,0.059764776,0.0005684887,0.00034089206,0.00030594575,0.0021424585,0.00046414117,0.013343926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995014,0.0015507363,0.00033104213,0.00070741895,0.0015701803,0.000826572],"domain_scores_gemma":[0.9791485,0.015862681,0.0015544151,0.0014424729,0.0010688476,0.00092310214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025152566,0.0011723974,0.0019551876,0.0012260881,0.0017167772,0.008490958,0.0038097985,0.002557851,0.016493883],"category_scores_gemma":[0.018608687,0.0011469583,0.001989974,0.003207155,0.0027228429,0.016545339,0.0042591165,0.0043343552,0.0012196341],"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.0012377285,0.00027137285,0.00225051,0.0006159744,0.00017090805,0.00044524312,0.0005167896,0.10613183,0.004686723,0.8286871,0.011093732,0.043892078],"study_design_scores_gemma":[0.00011559966,0.000037114984,0.00034546887,0.00002311539,0.000059588572,0.00013081991,0.0000956328,0.169024,0.0013813195,0.82738686,0.0013654844,0.000035138957],"about_ca_topic_score_codex":0.0053746505,"about_ca_topic_score_gemma":0.005866896,"teacher_disagreement_score":0.016493883,"about_ca_system_score_codex":0.0036543214,"about_ca_system_score_gemma":0.0036494147,"threshold_uncertainty_score":0.05517757},"labels":[],"label_agreement":null},{"id":"W2112908352","doi":"10.1016/j.tcs.2014.05.005","title":"New space/time tradeoffs for top- k document retrieval on sequences","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico","keywords":"Document retrieval; Computer science; Space (punctuation); Information retrieval; Combinatorics; Mathematics","score_opus":0.008556120600705158,"score_gpt":0.25402016309942393,"score_spread":0.24546404249871878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112908352","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.08620887,0.0140672885,0.8785967,0.0031704826,0.0006522165,0.00027757479,0.0011112075,0.0030482367,0.012867264],"genre_scores_gemma":[0.40849552,0.0045084255,0.5719308,0.000649229,0.001545547,0.00035314888,0.0013487806,0.001256038,0.009912517],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98955476,0.003368799,0.0010119517,0.0009299397,0.004138984,0.0009955752],"domain_scores_gemma":[0.95231426,0.03506189,0.0017098738,0.005751139,0.0036008386,0.0015619126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008816387,0.0020717543,0.0026806605,0.0046393834,0.0017622354,0.0061360705,0.0038545723,0.003580687,0.014607446],"category_scores_gemma":[0.06420129,0.0012143505,0.0010059414,0.007002582,0.0024942185,0.018502397,0.0041369353,0.0034404409,0.003891533],"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.0042815,0.0007983999,0.0024553125,0.00124605,0.00017457352,0.00022550378,0.00068210054,0.1717075,0.038025297,0.15908383,0.02398112,0.5973388],"study_design_scores_gemma":[0.00015202345,0.00033243344,0.00066096237,0.000080662845,0.00009556149,0.00045988956,0.00022081869,0.8687865,0.010119878,0.115023576,0.003976028,0.000091638474],"about_ca_topic_score_codex":0.0026129186,"about_ca_topic_score_gemma":0.004451335,"teacher_disagreement_score":0.014607446,"about_ca_system_score_codex":0.004198353,"about_ca_system_score_gemma":0.0029484215,"threshold_uncertainty_score":0.04886681},"labels":[],"label_agreement":null},{"id":"W2114513404","doi":"10.1016/j.tcs.2013.11.033","title":"Social exchange networks with distant bargaining","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extension (predicate logic); Core (optical fiber); Computer science; Set (abstract data type); Matching (statistics); Time complexity; Bargaining problem; Stability (learning theory); Mathematical economics; Theoretical computer science; Class (philosophy); Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.02023283452738109,"score_gpt":0.21274166859308735,"score_spread":0.19250883406570626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114513404","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.24368243,0.0014017547,0.68938655,0.004180503,0.00029781135,0.00020295264,0.00041922907,0.00022823345,0.06020053],"genre_scores_gemma":[0.9461378,0.0006567403,0.02534919,0.0002594013,0.00025970902,0.0001728287,0.00018589741,0.000044184755,0.026934221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685174,0.0019530774,0.00008536319,0.0005675495,0.00030954866,0.00023278415],"domain_scores_gemma":[0.982418,0.013431563,0.0015774007,0.0012856848,0.0005394082,0.00074789673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038013675,0.0008157732,0.0018089474,0.0017371221,0.0025604642,0.0046187285,0.0024935044,0.004406539,0.019342974],"category_scores_gemma":[0.022894762,0.0009913051,0.0009987102,0.0022724506,0.0031580778,0.009666651,0.0035774577,0.0028955692,0.0017808533],"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.00009613805,0.00006099226,0.00054710486,0.00005114767,0.000028346596,0.00016522624,0.00023159957,0.038323216,0.00020017484,0.95210505,0.00116424,0.007026815],"study_design_scores_gemma":[0.00003631471,0.00002423644,0.00019045718,0.0000160964,0.000018479832,0.00007702765,0.00010231225,0.11740517,0.000093148556,0.880528,0.0014948308,0.000013862234],"about_ca_topic_score_codex":0.00091635424,"about_ca_topic_score_gemma":0.0009265389,"teacher_disagreement_score":0.019342974,"about_ca_system_score_codex":0.0012521561,"about_ca_system_score_gemma":0.0006064819,"threshold_uncertainty_score":0.06470877},"labels":[],"label_agreement":null},{"id":"W2114650657","doi":"10.1016/j.tcs.2006.05.011","title":"A PTAS for the minimization of polynomials of fixed degree over the simplex","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Degree (music); Simplex; Combinatorics; Discrete mathematics; Upper and lower bounds; Polynomial; Integer (computer science); Mathematical analysis","score_opus":0.056029897949023626,"score_gpt":0.36187059965159923,"score_spread":0.3058407017025756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114650657","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.0067299525,0.00025719,0.97634625,0.0005108336,0.00022574064,0.000072553325,0.00018757941,0.00032349458,0.01534631],"genre_scores_gemma":[0.23511139,0.0009587191,0.71095186,0.00053380657,0.00048330054,0.0004558319,0.000623218,0.0009657037,0.049916234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992085,0.00025390787,0.000031097534,0.00016441544,0.00027591054,0.000066212146],"domain_scores_gemma":[0.99942136,0.00024507372,0.000039483923,0.000107853164,0.00011487744,0.00007150358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084691873,0.0011805457,0.0011039332,0.0007235842,0.00058921723,0.0013817422,0.0017262782,0.0014195031,0.014626882],"category_scores_gemma":[0.0036781523,0.0004182822,0.0013396267,0.0011755605,0.0010501647,0.0017039281,0.0024780214,0.003177544,0.0032065285],"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.00027437112,0.0001540028,0.00039401936,0.00041526073,0.00009989532,0.0001401126,0.00015713056,0.15041777,0.0072092987,0.63114095,0.024751168,0.18484607],"study_design_scores_gemma":[0.000056351557,0.00013867526,0.00014984793,0.00005702005,0.00003347471,0.0001353403,0.000058347752,0.643398,0.0017349989,0.3388901,0.015323041,0.000024823468],"about_ca_topic_score_codex":0.0016220124,"about_ca_topic_score_gemma":0.0022065141,"teacher_disagreement_score":0.014626882,"about_ca_system_score_codex":0.0008996444,"about_ca_system_score_gemma":0.0011391145,"threshold_uncertainty_score":0.048931837},"labels":[],"label_agreement":null},{"id":"W2114968511","doi":"10.1016/j.tcs.2005.09.030","title":"List matrix partitions of chordal graphs","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Split graph; Indifference graph; Interval graph; Discrete mathematics; Clique-sum; Pathwidth; Partition (number theory); Cograph; Graph; Line graph; 1-planar graph","score_opus":0.013647279260516391,"score_gpt":0.3137581876164931,"score_spread":0.3001109083559767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114968511","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.6519583,0.00081429473,0.26307145,0.0011450109,0.00021548326,0.00043933708,0.005021229,0.0020313647,0.07530346],"genre_scores_gemma":[0.84536254,0.0005013861,0.10760007,0.00029954012,0.00015741975,0.0003345696,0.006274668,0.0005578988,0.03891185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993173,0.00012132004,0.00004585721,0.00013734217,0.00018336887,0.0001948282],"domain_scores_gemma":[0.9970188,0.0011298709,0.00029970848,0.00054954656,0.0005660024,0.00043600547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003305962,0.00042773908,0.0006262109,0.001924406,0.0021350393,0.0034717296,0.0014745353,0.0007850489,0.019331086],"category_scores_gemma":[0.0032862832,0.00043553615,0.00039527076,0.0023062713,0.0007765749,0.0031539476,0.001345506,0.0009889407,0.0028193144],"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.0019774875,0.00033368033,0.0026334147,0.00054455904,0.00006846646,0.0003864681,0.0016227354,0.018969597,0.0322677,0.7862172,0.033051096,0.12192765],"study_design_scores_gemma":[0.00023411437,0.0002482537,0.0025371492,0.00010671954,0.00008754291,0.0004714852,0.0016151172,0.089074336,0.012214146,0.8614149,0.031925026,0.00007122226],"about_ca_topic_score_codex":0.0024170189,"about_ca_topic_score_gemma":0.005257986,"teacher_disagreement_score":0.019331086,"about_ca_system_score_codex":0.001240204,"about_ca_system_score_gemma":0.0008435585,"threshold_uncertainty_score":0.06466895},"labels":[],"label_agreement":null},{"id":"W2115404543","doi":"10.1016/j.tcs.2004.06.029","title":"Computationally universal P systems without priorities: two catalysts are sufficient","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":122,"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":"Catalysis; Symbol (formal); Reduction (mathematics); P system; Power (physics); Mathematics; Computer science; Membrane computing; Chemistry; Theoretical computer science; Algorithm; Physics; Quantum mechanics","score_opus":0.008116660906839171,"score_gpt":0.2500124413008852,"score_spread":0.24189578039404602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115404543","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.22370176,0.0013388868,0.66236365,0.011191053,0.00073223846,0.00039579964,0.0011762775,0.0029538437,0.09614651],"genre_scores_gemma":[0.9298352,0.000335623,0.061324887,0.0009328731,0.00019382531,0.00024898202,0.00028404445,0.00030707114,0.0065373946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687284,0.0007158411,0.00023382773,0.0006820293,0.0005973991,0.0008980731],"domain_scores_gemma":[0.9784168,0.013338102,0.0007581531,0.004546063,0.001422667,0.0015182402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039328905,0.0008754711,0.001433651,0.0011632328,0.0020793818,0.00435049,0.002550323,0.0033578167,0.0145193525],"category_scores_gemma":[0.029516397,0.0011074598,0.00123871,0.0010096082,0.0051817745,0.011037451,0.005474306,0.0050958716,0.0020961163],"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.0002642704,0.000049746228,0.0004807472,0.00015015356,0.000018493623,0.00012320485,0.00021498335,0.003949285,0.0012084311,0.97929484,0.002526776,0.011719247],"study_design_scores_gemma":[0.000066426015,0.00002647001,0.000084702086,0.00002086455,0.000014287455,0.000082445775,0.00007172262,0.020848725,0.001544457,0.97531146,0.0019082569,0.000020150961],"about_ca_topic_score_codex":0.0011680529,"about_ca_topic_score_gemma":0.0012096323,"teacher_disagreement_score":0.0145193525,"about_ca_system_score_codex":0.0013008186,"about_ca_system_score_gemma":0.0033700159,"threshold_uncertainty_score":0.048572123},"labels":[],"label_agreement":null},{"id":"W2116273603","doi":"10.1016/j.tcs.2012.01.041","title":"Fighting constrained fires in graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Limiting; Random regular graph; Random graph; Mathematics; Graph; Discrete mathematics; Chordal graph; 1-planar graph; Engineering","score_opus":0.00893920547535462,"score_gpt":0.263824961362226,"score_spread":0.2548857558868714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116273603","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.29799816,0.000361928,0.6889916,0.0007025649,0.000115675895,0.00009999864,0.00023110931,0.00024570603,0.011253278],"genre_scores_gemma":[0.9331038,0.00036851963,0.051940393,0.0001907118,0.000087965396,0.00014581218,0.00026799945,0.00013544415,0.013759322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938965,0.00020917568,0.000028004082,0.00016252846,0.00009967519,0.000110923196],"domain_scores_gemma":[0.99059993,0.0070142695,0.00084649026,0.00047727692,0.00028279098,0.00077928667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011138142,0.0008768506,0.0012091629,0.0010479036,0.0011495273,0.0013557258,0.0022390543,0.0019402945,0.006702504],"category_scores_gemma":[0.008142974,0.00079928426,0.0008166638,0.0010160161,0.0017644371,0.0031531353,0.0024280595,0.0020801786,0.00037723692],"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.00023461545,0.000086969885,0.0010381214,0.00015866474,0.00010685468,0.00020623684,0.00021155633,0.77093256,0.002474748,0.20497604,0.0021897312,0.01738395],"study_design_scores_gemma":[0.000022296936,0.000029764125,0.00023680102,0.0000126270315,0.000018659552,0.000042683838,0.0000627832,0.8055038,0.00040777904,0.19313145,0.0005218693,0.000009570076],"about_ca_topic_score_codex":0.002595865,"about_ca_topic_score_gemma":0.0038628313,"teacher_disagreement_score":0.006702504,"about_ca_system_score_codex":0.000740632,"about_ca_system_score_gemma":0.0004992799,"threshold_uncertainty_score":0.022422135},"labels":[],"label_agreement":null},{"id":"W2116298394","doi":"10.1016/s0304-3975(99)00267-4","title":"Query learning of bounded-width OBDDs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Calgary","keywords":"Learnability; Binary decision diagram; Equivalence (formal languages); Bounded function; Mathematics; Discrete mathematics; Combinatorics; Time complexity; Theoretical computer science; Algorithm; Computer science; Artificial intelligence","score_opus":0.0043915468152772134,"score_gpt":0.23586408441484966,"score_spread":0.23147253759957245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116298394","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.16937299,0.0027363428,0.81739575,0.002295258,0.00012621541,0.00014225957,0.0012911536,0.0025014535,0.0041385195],"genre_scores_gemma":[0.7917199,0.00091191725,0.19894919,0.0005793254,0.00016632066,0.0001450654,0.0028117786,0.0004649824,0.0042515337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964581,0.0012006641,0.00034307266,0.0006763905,0.0009484961,0.00037329152],"domain_scores_gemma":[0.9796515,0.015020933,0.0006017138,0.002585355,0.0017913362,0.00034917056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002798061,0.0007190888,0.0021774957,0.0012456398,0.0007787113,0.0035208894,0.0030767766,0.0013440934,0.005339013],"category_scores_gemma":[0.027255699,0.0007038477,0.0014161275,0.002275195,0.0012311144,0.009390851,0.0031435054,0.002233391,0.0006521648],"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.0018238311,0.0005174645,0.009728929,0.0012920843,0.00025251744,0.00035111306,0.00092543825,0.28625894,0.006523662,0.14648329,0.020538649,0.525304],"study_design_scores_gemma":[0.000089272326,0.00008264683,0.00044989126,0.000057987658,0.0000630136,0.00014225002,0.00019942128,0.76504904,0.002978412,0.2280873,0.002784973,0.000015794829],"about_ca_topic_score_codex":0.0027476065,"about_ca_topic_score_gemma":0.0040278593,"teacher_disagreement_score":0.005339013,"about_ca_system_score_codex":0.0017379946,"about_ca_system_score_gemma":0.0014375686,"threshold_uncertainty_score":0.01786083},"labels":[],"label_agreement":null},{"id":"W2118223706","doi":"10.1016/j.tcs.2005.09.011","title":"The complexity of partition functions","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Constraint satisfaction problem; Adjacency matrix; Homomorphism; Partition (number theory); Counting problem; Discrete mathematics; Time complexity; Equivalence (formal languages); Graph","score_opus":0.040453615366782006,"score_gpt":0.3106491400712147,"score_spread":0.2701955247044327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118223706","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.6649363,0.004320522,0.17880002,0.028886061,0.00045044534,0.00011118087,0.0021272732,0.0005551264,0.11981304],"genre_scores_gemma":[0.97159886,0.0016593514,0.011707709,0.00079984474,0.0009226816,0.00017578805,0.0010350553,0.0002488716,0.011851805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955283,0.0014217196,0.00017059804,0.0007235969,0.0014863196,0.00066940923],"domain_scores_gemma":[0.94770974,0.043735255,0.0020998113,0.0035191088,0.0013515168,0.0015846421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032013466,0.0010941556,0.002753211,0.0034185706,0.0030233273,0.010473621,0.0041396376,0.003963979,0.014119414],"category_scores_gemma":[0.03620664,0.0015038957,0.0017734019,0.004699309,0.007716201,0.026668506,0.004552566,0.0081269955,0.0013345458],"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.000113551236,0.00004329123,0.0010242141,0.00007478799,0.000022198703,0.000045993842,0.0002720108,0.0074857567,0.00033024864,0.97991633,0.0035584955,0.0071131163],"study_design_scores_gemma":[0.000019015532,0.000006089757,0.00035084644,0.000010098505,0.000010658989,0.000047285514,0.00004329874,0.015049566,0.00013434506,0.98352355,0.00079460716,0.000010725902],"about_ca_topic_score_codex":0.0019896557,"about_ca_topic_score_gemma":0.0015429843,"teacher_disagreement_score":0.014119414,"about_ca_system_score_codex":0.0047263457,"about_ca_system_score_gemma":0.001832561,"threshold_uncertainty_score":0.047234178},"labels":[],"label_agreement":null},{"id":"W2119251691","doi":"10.1016/j.tcs.2004.05.019","title":"Competitive online routing in geometric graphs","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Mathematics; Routing (electronic design automation); Shortest path problem; Convex polygon; Regular polygon; Discrete mathematics; Computer science; Graph; Geometry","score_opus":0.014311499595550056,"score_gpt":0.2694103437007924,"score_spread":0.25509884410524236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119251691","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.39476964,0.004316061,0.52432895,0.007510772,0.0004860477,0.00032111994,0.0009400219,0.0009803616,0.06634708],"genre_scores_gemma":[0.874919,0.0023646094,0.09159408,0.0008620986,0.00063892023,0.0002746594,0.0009897952,0.00039252182,0.027964301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977374,0.0009186753,0.00006775976,0.00039267298,0.0004780676,0.00040547425],"domain_scores_gemma":[0.9867237,0.009349375,0.0011715927,0.0008619017,0.00077517127,0.0011182689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021666754,0.0013988088,0.0028179823,0.001833758,0.0023093917,0.004848305,0.0046588033,0.0039970498,0.013196325],"category_scores_gemma":[0.015050785,0.0011956675,0.0010444466,0.0036844853,0.0025293892,0.009668965,0.0027029146,0.0031155813,0.0013593833],"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.00074007455,0.00051045883,0.0013894897,0.000589955,0.00011421954,0.00024403646,0.0004491661,0.18661301,0.0023798598,0.72292566,0.025616253,0.058427904],"study_design_scores_gemma":[0.00014622207,0.00012410534,0.00042815483,0.000033131877,0.00006016385,0.00020280645,0.00016234932,0.42148018,0.0007163447,0.5712863,0.005333217,0.000027131035],"about_ca_topic_score_codex":0.004180997,"about_ca_topic_score_gemma":0.0053660106,"teacher_disagreement_score":0.013196325,"about_ca_system_score_codex":0.0032725702,"about_ca_system_score_gemma":0.0019091434,"threshold_uncertainty_score":0.04414606},"labels":[],"label_agreement":null},{"id":"W2120324771","doi":"10.1016/j.tcs.2011.04.019","title":"A linear time and space algorithm for detecting path intersection in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Intersection (aeronautics); Initialization; Algorithm; Path (computing); Dimension (graph theory); Mathematics; Linear space; Data structure; Time complexity; Computer science; Discrete mathematics; Combinatorics","score_opus":0.017869333412496385,"score_gpt":0.24595248615093426,"score_spread":0.22808315273843788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120324771","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.008390922,0.00048406902,0.9714149,0.00049047335,0.00016454216,0.0003271856,0.00081413315,0.012667794,0.0052460297],"genre_scores_gemma":[0.045425624,0.00022982362,0.9443609,0.00012331665,0.00006954546,0.0003737082,0.0026526859,0.0005542847,0.0062101544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752825,0.00034434054,0.00022038833,0.0007164224,0.0009158744,0.00027472325],"domain_scores_gemma":[0.9967435,0.0017600949,0.00023469877,0.00055382104,0.0005233071,0.00018467083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001451856,0.002438256,0.0016275917,0.004410553,0.0019770025,0.0037590743,0.003543975,0.002177872,0.030905722],"category_scores_gemma":[0.006975184,0.0008403711,0.0016921728,0.004383046,0.0013311349,0.004295948,0.0030432988,0.0024459043,0.009595045],"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.00077343854,0.0004410012,0.0013770753,0.00058287627,0.00014977627,0.00020018323,0.0002907709,0.037662964,0.013225868,0.024733422,0.04447063,0.876092],"study_design_scores_gemma":[0.0005495506,0.0005808696,0.0019509689,0.000121111276,0.00016942005,0.0009580388,0.0006823498,0.8407074,0.030622939,0.08581724,0.03767016,0.00016996216],"about_ca_topic_score_codex":0.014968536,"about_ca_topic_score_gemma":0.02449514,"teacher_disagreement_score":0.030905722,"about_ca_system_score_codex":0.00219721,"about_ca_system_score_gemma":0.004750612,"threshold_uncertainty_score":0.10338992},"labels":[],"label_agreement":null},{"id":"W2120837895","doi":"10.1016/s0304-3975(03)00139-7","title":"Closure and decidability properties of some language classes with respect to ciliate bio-operations","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"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":"Closure (psychology); Decidability; Mathematics; Ciliate; Computer science; Discrete mathematics; Biology; Ecology; Political science","score_opus":0.011038720805139993,"score_gpt":0.24515593442266154,"score_spread":0.23411721361752155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120837895","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.76685846,0.0005258746,0.20898075,0.0031867407,0.00018008535,0.00026427006,0.0018849965,0.0016919551,0.016426876],"genre_scores_gemma":[0.96490264,0.00017996089,0.028183695,0.00033907636,0.00024658925,0.00023603425,0.0018343586,0.00033515383,0.0037424106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948454,0.00073026493,0.00049983355,0.0017810722,0.0009494817,0.0011938706],"domain_scores_gemma":[0.9672107,0.02537115,0.0022989877,0.0016197582,0.0015848461,0.0019146232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046287226,0.00073452987,0.0014733551,0.0025527305,0.004538087,0.007981977,0.0027011584,0.002370662,0.0059366445],"category_scores_gemma":[0.017025651,0.0012013481,0.0047414517,0.0015599345,0.0055669043,0.010857115,0.0031266566,0.005811253,0.0004080122],"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.0013003835,0.0005581711,0.006768401,0.00038744012,0.00016934708,0.0014989498,0.0057779,0.00881512,0.024538856,0.92778724,0.0028850418,0.019513087],"study_design_scores_gemma":[0.00044899384,0.00017901997,0.002708563,0.00007166165,0.00020472621,0.0009875016,0.0014499332,0.057848703,0.023811154,0.90708995,0.0050641634,0.00013563372],"about_ca_topic_score_codex":0.004671209,"about_ca_topic_score_gemma":0.0027443615,"teacher_disagreement_score":0.007981977,"about_ca_system_score_codex":0.0038128453,"about_ca_system_score_gemma":0.002932992,"threshold_uncertainty_score":0.027664304},"labels":[],"label_agreement":null},{"id":"W2120954276","doi":"10.1016/j.tcs.2010.03.014","title":"Randomized priority algorithms","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy algorithm; Randomized algorithm; Job shop scheduling; Class (philosophy); Approximation algorithm; Computer science; Scheduling (production processes); Algorithm; Context (archaeology); Deterministic algorithm; Mathematical optimization; Mathematics; Schedule; Artificial intelligence","score_opus":0.010635678378934522,"score_gpt":0.2768811115611415,"score_spread":0.26624543318220695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120954276","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.015830858,0.0026231129,0.91890585,0.004693432,0.002070709,0.0004357008,0.0006908613,0.0036218464,0.05112754],"genre_scores_gemma":[0.36303926,0.002325974,0.55271006,0.003399654,0.00311525,0.0010417718,0.0021484045,0.0022778576,0.06994177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915194,0.0030743792,0.00034514786,0.0016552638,0.0020805672,0.0013252888],"domain_scores_gemma":[0.98223627,0.008521868,0.000709632,0.005435106,0.001754953,0.0013421908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065389983,0.0020508734,0.0031415334,0.0023684832,0.0031384157,0.0058222087,0.0060948143,0.0032591517,0.036839634],"category_scores_gemma":[0.030585067,0.0014262763,0.0020399855,0.0038099398,0.0027820438,0.009174346,0.0046308893,0.0072208038,0.00956607],"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.0021117127,0.00084374595,0.00080889254,0.00050561543,0.00013684647,0.00007168558,0.00019397053,0.037212837,0.0022147123,0.6561523,0.08082497,0.2189227],"study_design_scores_gemma":[0.0008506495,0.0003170614,0.00026719779,0.000077320925,0.00012348285,0.00015700978,0.00006634304,0.2188505,0.0023954962,0.7470512,0.029792182,0.00005161384],"about_ca_topic_score_codex":0.0022312542,"about_ca_topic_score_gemma":0.003513271,"teacher_disagreement_score":0.036839634,"about_ca_system_score_codex":0.0040685977,"about_ca_system_score_gemma":0.007472386,"threshold_uncertainty_score":0.12324083},"labels":[],"label_agreement":null},{"id":"W2121102942","doi":"10.1016/j.tcs.2015.03.011","title":"Low space data structures for geometric range mode query","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba","funders":"Canada Research Chairs","keywords":"Multiset; Range (aeronautics); Data structure; Set (abstract data type); Space (punctuation); Range query (database); Mode (computer interface); Combinatorics; Point (geometry); Mathematics; Word (group theory); Computer science; Sargable; Web search query; Geometry; Information retrieval; Search engine","score_opus":0.04144772785392008,"score_gpt":0.30845009617466385,"score_spread":0.26700236832074375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121102942","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.14310095,0.0029685278,0.8270153,0.0022883334,0.00028564446,0.00029185473,0.0027411333,0.007133234,0.014174986],"genre_scores_gemma":[0.66859335,0.00080780406,0.313999,0.0007799501,0.00030912046,0.0005276823,0.0042574513,0.00070966384,0.010016052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981066,0.00024486525,0.0001562021,0.00018816862,0.001097355,0.00020671681],"domain_scores_gemma":[0.99507684,0.0013781748,0.00033536213,0.0024768435,0.0005983924,0.00013434503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001088806,0.0005715567,0.0011729448,0.0020933542,0.00095317425,0.0027692914,0.0019309251,0.001022717,0.009826645],"category_scores_gemma":[0.0077995984,0.00039841622,0.00046389963,0.0041672788,0.0012343099,0.0054711998,0.0039289063,0.0017783949,0.0021359164],"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.0027985687,0.0005237949,0.004955366,0.0006831124,0.00009882323,0.00023171086,0.000899065,0.04989031,0.034538046,0.31839666,0.05616566,0.5308189],"study_design_scores_gemma":[0.0003547822,0.0006730176,0.0015416577,0.00012404929,0.000105122446,0.0006446649,0.00055848673,0.38232,0.03391991,0.5487845,0.03086716,0.000106600644],"about_ca_topic_score_codex":0.0012572974,"about_ca_topic_score_gemma":0.0021467162,"teacher_disagreement_score":0.009826645,"about_ca_system_score_codex":0.0013596197,"about_ca_system_score_gemma":0.0014133777,"threshold_uncertainty_score":0.032873333},"labels":[],"label_agreement":null},{"id":"W2121524100","doi":"10.1016/s0304-3975(02)00640-0","title":"Analysis of edge deletion processes on faulty random regular graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Random graph; Enhanced Data Rates for GSM Evolution; Degree (music); Expander graph; Random regular graph; Mathematics; Fault tolerance; Constant (computer programming); Computer science; Discrete mathematics; Combinatorics; Chordal graph; Graph; 1-planar graph; Distributed computing; Artificial intelligence","score_opus":0.00983825410962391,"score_gpt":0.24056285942636824,"score_spread":0.23072460531674432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121524100","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.5119367,0.00069258915,0.48030743,0.0013520761,0.00009100731,0.00012492972,0.00028100907,0.00064939493,0.0045648934],"genre_scores_gemma":[0.9778153,0.00037957547,0.016335407,0.00009554519,0.0000789473,0.00008399168,0.00021543006,0.00014065774,0.004855247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828714,0.00061592215,0.00007426736,0.00027680362,0.0003941642,0.0003516558],"domain_scores_gemma":[0.9575714,0.031442184,0.004250198,0.0026791987,0.0027223972,0.0013345752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042217155,0.00087214523,0.0015540074,0.0021774035,0.00087876845,0.0020587044,0.00395626,0.0021323033,0.0043028635],"category_scores_gemma":[0.027487116,0.00091140025,0.0009980862,0.0013672803,0.0026651009,0.0029525722,0.0016319131,0.0016833688,0.00043010482],"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.0005106214,0.0001282621,0.0051815333,0.00015850266,0.00008772971,0.0005732531,0.0003337473,0.7640548,0.0045695,0.21168426,0.0018210353,0.010896681],"study_design_scores_gemma":[0.000029509327,0.000030111958,0.00040254177,0.0000093896015,0.000022966398,0.00008209373,0.00005310109,0.9330143,0.0009549322,0.06512633,0.00026238844,0.000012359644],"about_ca_topic_score_codex":0.002544092,"about_ca_topic_score_gemma":0.0018270062,"teacher_disagreement_score":0.0043028635,"about_ca_system_score_codex":0.0019625793,"about_ca_system_score_gemma":0.0010725076,"threshold_uncertainty_score":0.022326887},"labels":[],"label_agreement":null},{"id":"W2121556262","doi":"10.1016/j.tcs.2014.03.034","title":"The cyclical scheduling problem","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Scheduling (production processes); Vertex (graph theory); Combinatorics; Job shop scheduling; Mathematics; Computer science; Matching (statistics); Algorithm; Mathematical optimization; Graph; Schedule","score_opus":0.0113602510684824,"score_gpt":0.2838421154584433,"score_spread":0.2724818643899609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121556262","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.1975036,0.0030518917,0.57925344,0.016839832,0.0013905825,0.000705957,0.004105154,0.0010206678,0.19612889],"genre_scores_gemma":[0.74393433,0.002612957,0.18637171,0.0019189628,0.0017170863,0.00056040473,0.0046553947,0.00055222184,0.057676934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998004,0.0006713671,0.00008325459,0.0005386156,0.00033956973,0.000363149],"domain_scores_gemma":[0.99178,0.00505663,0.0006822708,0.0010503897,0.0006049974,0.0008257513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017091851,0.00087070296,0.0010788394,0.0009146908,0.0021579394,0.0036932144,0.0024590385,0.0024038386,0.016816737],"category_scores_gemma":[0.011297273,0.00075356645,0.0010086293,0.0026640934,0.0019971547,0.0049648075,0.0019963458,0.0031254485,0.0015491496],"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.00047134547,0.00029001723,0.00065943657,0.00046407207,0.000074476055,0.00022028301,0.00027498897,0.055508863,0.0021513635,0.84123415,0.042098742,0.056552295],"study_design_scores_gemma":[0.00011572386,0.000058565685,0.00021826067,0.000040706116,0.000030977033,0.00015394272,0.00016294516,0.089638725,0.0009704389,0.88988566,0.018699974,0.000024031091],"about_ca_topic_score_codex":0.0046033454,"about_ca_topic_score_gemma":0.004489382,"teacher_disagreement_score":0.016816737,"about_ca_system_score_codex":0.0024196303,"about_ca_system_score_gemma":0.004099713,"threshold_uncertainty_score":0.056257606},"labels":[],"label_agreement":null},{"id":"W2121693375","doi":"10.1016/j.tcs.2006.08.022","title":"Codes defined by multiple sets of trajectories","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Mathematics; Computer science; Algorithm; Combinatorics; Discrete mathematics","score_opus":0.006236922189298416,"score_gpt":0.22849628015321546,"score_spread":0.22225935796391705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121693375","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.373104,0.0008456507,0.5820124,0.0017839468,0.00045566258,0.00018771504,0.0011588585,0.0008342075,0.03961751],"genre_scores_gemma":[0.8850555,0.00044357422,0.10010093,0.00031185977,0.00016120491,0.000506931,0.00073534856,0.00023090086,0.012453809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977901,0.00049480674,0.00017567693,0.00041939752,0.00074854156,0.00037144622],"domain_scores_gemma":[0.99050176,0.004797106,0.001204883,0.0015061181,0.0012014842,0.0007886645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010562425,0.000809108,0.0012181539,0.003518573,0.0016882023,0.0036618412,0.0019792279,0.0027898268,0.0066498257],"category_scores_gemma":[0.011863704,0.0007483067,0.0009950683,0.0023165704,0.0035604716,0.0046674726,0.003416365,0.0027561123,0.0007941687],"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.00007075718,0.000017415014,0.0003910724,0.000041094656,0.000016014572,0.000101950514,0.00011868315,0.010697434,0.0013425018,0.9820451,0.0005182528,0.0046395995],"study_design_scores_gemma":[0.000038973223,0.000027583914,0.00023252309,0.000044250894,0.0000088114475,0.00015505753,0.00008083862,0.09378368,0.002358923,0.90086424,0.0023633137,0.0000418195],"about_ca_topic_score_codex":0.0015761002,"about_ca_topic_score_gemma":0.0013331211,"teacher_disagreement_score":0.0066498257,"about_ca_system_score_codex":0.0022317932,"about_ca_system_score_gemma":0.0014894556,"threshold_uncertainty_score":0.022245884},"labels":[],"label_agreement":null},{"id":"W2122177483","doi":"10.1016/j.tcs.2003.06.002","title":"The generalized Weil pairing and the discrete logarithm problem on elliptic curves","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Discrete logarithm; Mathematics; Elliptic curve; Pairing; Logarithm; TRACE (psycholinguistics); Reduction (mathematics); Generalization; Modulo; Pure mathematics; Edwards curve; Simple (philosophy); Discrete mathematics; Finite field; Schoof's algorithm; Mathematical analysis; Public-key cryptography; Computer science; Geometry; Quarter period; Physics","score_opus":0.0056954008353222035,"score_gpt":0.22177431581755602,"score_spread":0.2160789149822338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122177483","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.71039474,0.011098457,0.11480216,0.032227322,0.0025763826,0.00010696544,0.0003858615,0.00028795813,0.12812024],"genre_scores_gemma":[0.9705258,0.0032626812,0.008257578,0.00047499736,0.0020642371,0.000070105285,0.00014660327,0.00005044797,0.015147604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811316,0.0007615841,0.00008677084,0.00027500995,0.00041968617,0.00034388687],"domain_scores_gemma":[0.9969303,0.0017176393,0.00040606124,0.00039396537,0.00016722654,0.00038483017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022474162,0.00112758,0.0021503312,0.0028371774,0.0038256303,0.0069382144,0.0013283037,0.0032652696,0.006092293],"category_scores_gemma":[0.008341937,0.0007955741,0.001029011,0.0035238,0.009955608,0.015856251,0.006283316,0.0060707973,0.0009464542],"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.00011149742,0.00003214018,0.0002821411,0.00004327174,0.000008395211,0.0001854064,0.00025166594,0.0022457368,0.00023182236,0.989876,0.0013169765,0.0054150247],"study_design_scores_gemma":[0.000016855129,0.000009373779,0.000058426995,0.00001230035,0.0000032455648,0.00006757559,0.000057853616,0.0024548522,0.00011952868,0.9960659,0.0011250923,0.000009010937],"about_ca_topic_score_codex":0.00055697263,"about_ca_topic_score_gemma":0.00038784198,"teacher_disagreement_score":0.0069382144,"about_ca_system_score_codex":0.0020854163,"about_ca_system_score_gemma":0.0012866742,"threshold_uncertainty_score":0.020380735},"labels":[],"label_agreement":null},{"id":"W2122181022","doi":"10.1016/s0304-3975(02)00038-5","title":"Order-incompleteness and finite lambda reduction models","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Finitary; Mathematics; Lambda calculus; Term (time); Mathematical proof; Calculus (dental); Simply typed lambda calculus; Lambda; Reduction (mathematics); Typed lambda calculus; Algebra over a field; Pure mathematics; Discrete mathematics","score_opus":0.03184987190362172,"score_gpt":0.236760036849676,"score_spread":0.2049101649460543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122181022","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.26816323,0.003245105,0.5712685,0.015098176,0.00030563466,0.0001276523,0.0010605961,0.0010750555,0.13965598],"genre_scores_gemma":[0.9298973,0.0011867828,0.043192394,0.00074435625,0.00031822943,0.00014113361,0.0008176413,0.0002485856,0.023453543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598724,0.001246611,0.0002512381,0.00059524656,0.001348237,0.0005714879],"domain_scores_gemma":[0.9809787,0.012182394,0.0012265823,0.0032763104,0.0016319157,0.00070406805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004736877,0.0007339679,0.001449475,0.0019401504,0.00298287,0.0064162663,0.0028011561,0.0021801933,0.0071250643],"category_scores_gemma":[0.014414133,0.0010709189,0.0021124973,0.0019964848,0.009049353,0.018106505,0.003521489,0.00826642,0.0008109764],"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.00001999007,0.000021765005,0.00015044429,0.000023578623,0.00000752652,0.000042292308,0.00024118113,0.0023302569,0.0001071867,0.99476045,0.00054570026,0.0017495763],"study_design_scores_gemma":[0.0000058656788,0.0000026627883,0.00002751393,0.000005615194,0.0000046711334,0.000017487066,0.000039010236,0.0029000095,0.00011156732,0.9962023,0.00067895796,0.0000043800633],"about_ca_topic_score_codex":0.005140852,"about_ca_topic_score_gemma":0.005199582,"teacher_disagreement_score":0.0071250643,"about_ca_system_score_codex":0.0044864635,"about_ca_system_score_gemma":0.002658373,"threshold_uncertainty_score":0.032551646},"labels":[],"label_agreement":null},{"id":"W2122388370","doi":"10.1016/j.tcs.2007.03.003","title":"Bounds on the bisection width for random d -regular graphs","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Generalitat de Catalunya","keywords":"Bisection; Mathematics; Upper and lower bounds; Asymptotically optimal algorithm; Combinatorics; Bisection method; Random graph; Discrete mathematics; Value (mathematics); Graph; Algorithm; Statistics; Geometry; Mathematical analysis","score_opus":0.022499315483579776,"score_gpt":0.2983433027230205,"score_spread":0.27584398723944076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122388370","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.3139586,0.011778426,0.6104341,0.012313168,0.0005236136,0.00023346717,0.002607145,0.0025468648,0.045604676],"genre_scores_gemma":[0.8711822,0.006465332,0.10611111,0.0022463077,0.0011804169,0.0008653993,0.0019120713,0.0019360875,0.008101034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934202,0.0019991298,0.00038982046,0.0017938464,0.0013523448,0.001044702],"domain_scores_gemma":[0.83866256,0.13215928,0.0064339037,0.0120285265,0.003827272,0.006888462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010517984,0.0034951747,0.004583542,0.0076394686,0.0031956532,0.010194893,0.009351167,0.0048113777,0.010240775],"category_scores_gemma":[0.07719286,0.0031588282,0.0025667788,0.0064513385,0.0076889973,0.024353076,0.010398526,0.013333124,0.0017738559],"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.0018583726,0.00036516937,0.004680716,0.0009574608,0.00030546155,0.00023928437,0.0014558808,0.08737246,0.009507643,0.8432485,0.009660398,0.040348716],"study_design_scores_gemma":[0.000095654184,0.00009660302,0.00070453295,0.00018723734,0.00013313949,0.00023488632,0.00022094627,0.17526008,0.0029156997,0.81772995,0.0023400162,0.00008131727],"about_ca_topic_score_codex":0.0011906866,"about_ca_topic_score_gemma":0.0015803673,"teacher_disagreement_score":0.010517984,"about_ca_system_score_codex":0.005561382,"about_ca_system_score_gemma":0.0020005354,"threshold_uncertainty_score":0.05562508},"labels":[],"label_agreement":null},{"id":"W2122483877","doi":"10.1016/s0304-3975(02)00643-6","title":"Almost k-wise independence and hard Boolean functions","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Boolean function; Mathematics; Combinatorics; Discrete mathematics; Linear subspace; Upper and lower bounds; Function (biology); Polynomial; Computable function; Independence (probability theory); Circuit complexity; Affine transformation; Electronic circuit; Pure mathematics","score_opus":0.015241762987331061,"score_gpt":0.23840912940705755,"score_spread":0.22316736641972648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122483877","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.6204779,0.001834323,0.2696033,0.009591315,0.00021018687,0.00010520253,0.0012450245,0.00048683098,0.09644595],"genre_scores_gemma":[0.97115356,0.0006421286,0.013576159,0.0009206984,0.00046022696,0.00014029731,0.00079696794,0.00012071719,0.012189213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975152,0.00082983164,0.00010454106,0.00055050064,0.00059082406,0.00040906225],"domain_scores_gemma":[0.97234726,0.021757826,0.001848858,0.0016347646,0.0008913704,0.0015199844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017246283,0.0008661828,0.0016148699,0.0016169247,0.0022464017,0.004416472,0.0022759214,0.0020294837,0.0077643776],"category_scores_gemma":[0.013512469,0.0012372325,0.0014939245,0.0022117756,0.0046324264,0.010122468,0.0032020542,0.007949809,0.0009941686],"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.00044121966,0.00018299794,0.002325142,0.00021842895,0.00007709716,0.00023142179,0.00056884735,0.011092742,0.0019042437,0.9620646,0.005429773,0.015463406],"study_design_scores_gemma":[0.000031641735,0.000014530309,0.000825641,0.000012438547,0.000018418219,0.00017057922,0.00005935095,0.011826512,0.00045669748,0.9857431,0.0008247658,0.000016247604],"about_ca_topic_score_codex":0.0011153967,"about_ca_topic_score_gemma":0.0014748808,"teacher_disagreement_score":0.0077643776,"about_ca_system_score_codex":0.0018303981,"about_ca_system_score_gemma":0.0010595623,"threshold_uncertainty_score":0.025974393},"labels":[],"label_agreement":null},{"id":"W2122658384","doi":"10.1016/j.tcs.2008.09.042","title":"Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Nucleic acid; RNA; Nucleic acid structure; Computational biology; Nucleic acid secondary structure; DNA; Function (biology); Molecule; Translation (biology); Protein secondary structure; Small molecule; Gene; Biology; Chemistry; Nanotechnology; Computer science; Cell biology; Biochemistry; Messenger RNA; Materials science","score_opus":0.015871321677934976,"score_gpt":0.25836071146186823,"score_spread":0.24248938978393325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122658384","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15244783,0.008288106,0.8296806,0.0030282808,0.00013781054,0.00012701891,0.00066389784,0.0023887027,0.00323775],"genre_scores_gemma":[0.4802659,0.0053208666,0.5105184,0.00034853918,0.0001988019,0.00030911007,0.0015936993,0.00035040156,0.0010943665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998874,0.0006438944,0.0000545365,0.00012941843,0.00027086303,0.000027271697],"domain_scores_gemma":[0.9877823,0.010428851,0.00026344476,0.0005606634,0.00075599673,0.00020880919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003901282,0.0008578562,0.0021315343,0.001109836,0.0007207947,0.0020586152,0.002563068,0.0010365862,0.0016084402],"category_scores_gemma":[0.01266669,0.0007515187,0.000939051,0.0014040212,0.0011613856,0.0019658662,0.00075971795,0.0017551257,0.0005572256],"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.00040647018,0.00031576838,0.007684185,0.0008628652,0.00038194424,0.00007160926,0.000095397685,0.77120554,0.0034188565,0.020182563,0.0033068913,0.19206788],"study_design_scores_gemma":[0.00004048534,0.000024005834,0.00026375978,0.000021389056,0.00001900063,0.000017908469,0.000016396303,0.9861457,0.0007033151,0.012240284,0.0005009302,0.0000068696054],"about_ca_topic_score_codex":0.0068280837,"about_ca_topic_score_gemma":0.008294889,"teacher_disagreement_score":0.0068280837,"about_ca_system_score_codex":0.00096516445,"about_ca_system_score_gemma":0.0028395783,"threshold_uncertainty_score":0.020632207},"labels":[],"label_agreement":null},{"id":"W2123868336","doi":"10.1016/j.tcs.2007.02.033","title":"Efficient algorithms for center problems in cactus networks","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Cactus; Center (category theory); Algorithm; Computer science; Mathematics","score_opus":0.018651931694772642,"score_gpt":0.30651717067432355,"score_spread":0.2878652389795509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123868336","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.12590963,0.0012429212,0.8361456,0.0028578425,0.00030729268,0.00088512496,0.0012532909,0.005900796,0.02549753],"genre_scores_gemma":[0.37807027,0.00058821304,0.60604465,0.00033013496,0.00023181645,0.00045894997,0.0023857972,0.0008198816,0.011070324],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977059,0.0005821889,0.00012117374,0.00056150154,0.00049231324,0.0005369732],"domain_scores_gemma":[0.9895068,0.0065044607,0.00069316465,0.0017105615,0.0009466666,0.0006384888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002244359,0.001859716,0.002190759,0.0027574257,0.003462456,0.004747545,0.005244085,0.0032685145,0.018944453],"category_scores_gemma":[0.01237406,0.0011548613,0.0016540304,0.003473809,0.0021185584,0.008956677,0.004726303,0.0034366748,0.0025198273],"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.0018381856,0.0012534673,0.0031559519,0.00093081855,0.00017843545,0.00016568483,0.00095540186,0.28307387,0.0069078263,0.2362482,0.061169893,0.40412217],"study_design_scores_gemma":[0.00036030766,0.00012018511,0.0003476378,0.000060063932,0.000072474286,0.00010884153,0.00044882344,0.74359167,0.005405502,0.24230643,0.0071432595,0.00003483668],"about_ca_topic_score_codex":0.007297577,"about_ca_topic_score_gemma":0.011850764,"teacher_disagreement_score":0.018944453,"about_ca_system_score_codex":0.004100718,"about_ca_system_score_gemma":0.0044914624,"threshold_uncertainty_score":0.06337547},"labels":[],"label_agreement":null},{"id":"W2123984395","doi":"10.1016/j.tcs.2004.06.013","title":"Characterization of networks supporting multi-dimensional linear interval routing schemes","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Node (physics); Interval (graph theory); Routing (electronic design automation); Class (philosophy); Generalization; Integer (computer science); Discrete mathematics; Computer science; Mathematics; Combinatorics; Scheme (mathematics); Set (abstract data type); Topology (electrical circuits); Computer network; Artificial intelligence","score_opus":0.01905426557928505,"score_gpt":0.30749170544809024,"score_spread":0.2884374398688052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123984395","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.80021805,0.00069661083,0.18415736,0.0005894009,0.000042242016,0.00016899046,0.0010034473,0.00041541195,0.012708545],"genre_scores_gemma":[0.9750038,0.0002717751,0.022475805,0.0000727112,0.000044386292,0.00010418606,0.0006434269,0.000032238855,0.0013516847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988171,0.0002757096,0.00011593519,0.00023020456,0.0003093758,0.000251706],"domain_scores_gemma":[0.98490244,0.008290276,0.0036399707,0.0011951833,0.0010601064,0.00091206306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013687798,0.0006218905,0.00074819307,0.0021689888,0.00088981073,0.00337977,0.001903907,0.0010724993,0.0036995676],"category_scores_gemma":[0.010733684,0.00047499372,0.00038378523,0.0019093788,0.0009952765,0.0034411456,0.001397315,0.0009581543,0.00038873183],"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.0032791868,0.0006548617,0.014929251,0.00076274277,0.00014030792,0.000623185,0.0011153828,0.2519953,0.08459828,0.5418146,0.00590583,0.094181016],"study_design_scores_gemma":[0.00011384572,0.0007338754,0.0042427215,0.00011590408,0.00007944387,0.0009967473,0.0006614503,0.80081934,0.014723853,0.1723023,0.0051349686,0.00007563544],"about_ca_topic_score_codex":0.0003807204,"about_ca_topic_score_gemma":0.00044282211,"teacher_disagreement_score":0.0036995676,"about_ca_system_score_codex":0.0012559581,"about_ca_system_score_gemma":0.0006108886,"threshold_uncertainty_score":0.012376308},"labels":[],"label_agreement":null},{"id":"W2124356944","doi":"10.1016/j.tcs.2005.08.019","title":"The discrete Green Theorem and some applications in discrete geometry","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":26,"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":"Direction Générale de la Compétitivité, de l’Industrie et des Services","keywords":"Mathematics; Intersection (aeronautics); Polyomino; Boundary (topology); Discrete geometry; Moment (physics); Geometry; Generating function; Green's theorem; Center (category theory); Function (biology); Bounded function; Discrete mathematics; Combinatorics; Fundamental theorem; Mathematical analysis","score_opus":0.007065804377029443,"score_gpt":0.2646758480864806,"score_spread":0.2576100437094512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124356944","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.062820785,0.068591855,0.711337,0.02878171,0.0041454933,0.0000605669,0.00040186045,0.00032399717,0.123536624],"genre_scores_gemma":[0.6839069,0.05177031,0.20219633,0.0059755696,0.012367665,0.00021299762,0.00046522822,0.00041166187,0.042693425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994543,0.00023394435,0.00003109931,0.00008696651,0.00014442917,0.000049323076],"domain_scores_gemma":[0.99825305,0.0012308857,0.00011546235,0.00010945307,0.00015237283,0.0001388187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018654526,0.0011781781,0.0016845969,0.0032717895,0.001446777,0.0030459114,0.0012029851,0.0021046964,0.0040335697],"category_scores_gemma":[0.0041473797,0.0005539678,0.0014709731,0.0033710427,0.0070306486,0.004854007,0.0022335132,0.0061411383,0.0006380812],"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.000008086353,0.0000086293785,0.00005243783,0.000036527086,0.0000074456048,0.000033296503,0.000044617,0.0008058384,0.00020309545,0.99372125,0.0010259385,0.0040529436],"study_design_scores_gemma":[0.0000066904777,0.000005962853,0.000060012848,0.0000086591035,0.0000027794074,0.00003532983,0.000016864655,0.0029929332,0.00005468126,0.9936812,0.0031289367,0.000005978763],"about_ca_topic_score_codex":0.0013283392,"about_ca_topic_score_gemma":0.0009494206,"teacher_disagreement_score":0.0040335697,"about_ca_system_score_codex":0.0018966086,"about_ca_system_score_gemma":0.0005889177,"threshold_uncertainty_score":0.013760924},"labels":[],"label_agreement":null},{"id":"W2124849294","doi":"10.1016/j.tcs.2010.05.027","title":"Analysis of a cellular automaton model for car traffic with a slow-to-stop rule","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Traffic control and management","field":"Engineering","cited_by":26,"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; McMaster University","funders":"","keywords":"Cellular automaton; Automaton; Computer science; Traffic model; Block cellular automaton; Stochastic cellular automaton; Theoretical computer science; Algorithm; Automata theory; Mobile automaton","score_opus":0.004090382981792452,"score_gpt":0.19381443217619634,"score_spread":0.1897240491944039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124849294","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.4853508,0.0012854295,0.48538494,0.0012388834,0.00019006248,0.00010121587,0.0005668463,0.0004267134,0.025455091],"genre_scores_gemma":[0.9903818,0.0001869172,0.004915725,0.000037696478,0.000027027798,0.000034834993,0.0000983505,0.000035888643,0.0042816442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997008,0.00008168217,0.000010210003,0.000060933908,0.000061907755,0.0000845506],"domain_scores_gemma":[0.9985459,0.00089385116,0.00013495488,0.00006538725,0.00027546578,0.000084499654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005003051,0.00071986084,0.0011732794,0.00083021715,0.0009468398,0.0014620863,0.0012647483,0.0014090475,0.0041824067],"category_scores_gemma":[0.0024079036,0.00053005514,0.001156001,0.00059292634,0.0011073955,0.0006654353,0.0006149541,0.00082091166,0.00036513913],"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.00003753821,0.000025203715,0.00089111127,0.000026756521,0.000031761738,0.0001342801,0.000069346155,0.96137154,0.0015143835,0.033782706,0.00043569034,0.001679704],"study_design_scores_gemma":[0.0000035076607,0.000005986624,0.00008242736,0.0000021197025,0.000007522814,0.000009712932,0.000008803487,0.99654514,0.00007552419,0.0031627289,0.00009302676,0.0000034788106],"about_ca_topic_score_codex":0.03295735,"about_ca_topic_score_gemma":0.012418246,"teacher_disagreement_score":0.03295735,"about_ca_system_score_codex":0.0019894189,"about_ca_system_score_gemma":0.0017457247,"threshold_uncertainty_score":0.065531015},"labels":[],"label_agreement":null},{"id":"W2124856856","doi":"10.1016/j.tcs.2005.10.014","title":"Maximizing agreements and coagnostic learning","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing; Mathematical economics; Mathematics","score_opus":0.005471975983276587,"score_gpt":0.2387742020984049,"score_spread":0.2333022261151283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124856856","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.08956287,0.0011220829,0.8232295,0.010179063,0.00020571265,0.00014724408,0.0003145546,0.00057457876,0.07466439],"genre_scores_gemma":[0.90042967,0.00080685,0.06910426,0.0012558387,0.00041199572,0.00038265224,0.00024453254,0.00027253572,0.027091801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895559,0.006714197,0.00036807745,0.0012836285,0.0013712755,0.0007070232],"domain_scores_gemma":[0.91167796,0.070368394,0.0037323167,0.009074344,0.0029178183,0.002229176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0121096,0.00090638397,0.0024250054,0.0012974631,0.002122947,0.004180979,0.0033838763,0.0042933864,0.012003673],"category_scores_gemma":[0.07234951,0.0009029653,0.0010146976,0.002387031,0.005244993,0.011332256,0.0056556994,0.0059122434,0.0014866507],"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.00006870765,0.000050040246,0.00044609385,0.000046526467,0.0000209309,0.000039695296,0.000141278,0.008114782,0.00010853875,0.9718531,0.0026110697,0.01649922],"study_design_scores_gemma":[0.000011045597,0.0000066675466,0.00006223553,0.0000075702865,0.0000039274387,0.000023676048,0.000018137933,0.016320756,0.000061146035,0.98272187,0.00075886503,0.0000040399395],"about_ca_topic_score_codex":0.00091839,"about_ca_topic_score_gemma":0.000899401,"teacher_disagreement_score":0.0121096,"about_ca_system_score_codex":0.0021918819,"about_ca_system_score_gemma":0.002082282,"threshold_uncertainty_score":0.06404239},"labels":[],"label_agreement":null},{"id":"W2125204297","doi":"10.1016/j.tcs.2010.12.034","title":"Two infinite families of polyominoes that tile the plane by translation in two distinct ways","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"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":"Polyomino; Tile; Plane (geometry); Focus (optics); Mathematics; Translation (biology); Fibonacci number; Combinatorics; Fractal; Geometry; Mathematical analysis; Physics; Optics","score_opus":0.012861044561188799,"score_gpt":0.2507726794940887,"score_spread":0.2379116349328999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125204297","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.7384198,0.0008991187,0.18706581,0.0011806019,0.00032212146,0.00008452212,0.00036347966,0.00037410491,0.07129054],"genre_scores_gemma":[0.94014853,0.0002936038,0.034994476,0.0002095568,0.00006829564,0.00020954182,0.00045128714,0.00016372898,0.023460988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993204,0.00010863554,0.000040455354,0.00017420859,0.00019527803,0.0001610186],"domain_scores_gemma":[0.99814606,0.00090794463,0.00024288936,0.00025345632,0.00015575519,0.0002939539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004115006,0.00049426017,0.00054110336,0.0010146478,0.002318436,0.0029017916,0.0009077715,0.0012720423,0.005061792],"category_scores_gemma":[0.002564186,0.0006924615,0.00085478614,0.0007824099,0.003136684,0.0027463627,0.0018119566,0.0016509946,0.00044657392],"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.000391927,0.000063259664,0.001140817,0.00008572887,0.000021769247,0.00091432524,0.0015997951,0.0023179587,0.00912838,0.9709465,0.0017185259,0.011670952],"study_design_scores_gemma":[0.0002247787,0.0001332311,0.0029305168,0.000108505934,0.000056113277,0.0018700103,0.0019881318,0.023311626,0.010086092,0.93496066,0.024227615,0.00010272353],"about_ca_topic_score_codex":0.00066677,"about_ca_topic_score_gemma":0.0008684514,"teacher_disagreement_score":0.005061792,"about_ca_system_score_codex":0.00085103913,"about_ca_system_score_gemma":0.0004602206,"threshold_uncertainty_score":0.016933441},"labels":[],"label_agreement":null},{"id":"W2125583143","doi":"10.1016/j.tcs.2013.06.009","title":"On minimum cost edge searching","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Ideal (ethics); Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Best-first search; Mathematical optimization; Beam search; Search algorithm; Computer science; Combinatorics; Artificial intelligence","score_opus":0.018929723704174912,"score_gpt":0.30389556963707576,"score_spread":0.28496584593290086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125583143","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.105243444,0.0049243183,0.7767037,0.0064560394,0.0008730077,0.00041518334,0.0012911081,0.0011257079,0.10296755],"genre_scores_gemma":[0.39495784,0.0030793522,0.5473253,0.0017815882,0.000638289,0.00053383736,0.0020372197,0.00097157795,0.048674952],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986418,0.00046550515,0.00006389185,0.00026699918,0.00034283043,0.00021897102],"domain_scores_gemma":[0.99306196,0.0053400965,0.00026138753,0.0007311364,0.00034994146,0.00025548253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013702896,0.0017136593,0.0023124074,0.0024202564,0.0013943792,0.0020253274,0.004407706,0.0030104194,0.024266746],"category_scores_gemma":[0.014583551,0.0009397428,0.0010957725,0.0048685377,0.0021632737,0.006355263,0.004150887,0.0033089896,0.0020537856],"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.0016823058,0.00053907273,0.0013749592,0.000834159,0.0001567339,0.00016342525,0.00040174572,0.2413691,0.003764747,0.33876124,0.054541256,0.35641125],"study_design_scores_gemma":[0.00021708217,0.00017323549,0.0005646455,0.00014920664,0.00008609991,0.00015449405,0.00015494777,0.44329235,0.0012361663,0.5437582,0.0101834405,0.000030081972],"about_ca_topic_score_codex":0.0032221198,"about_ca_topic_score_gemma":0.003946162,"teacher_disagreement_score":0.024266746,"about_ca_system_score_codex":0.0015207755,"about_ca_system_score_gemma":0.0014941151,"threshold_uncertainty_score":0.08118039},"labels":[],"label_agreement":null},{"id":"W2126750116","doi":"10.1016/j.tcs.2006.06.008","title":"A construction method for optimally universal hash families and its consequences for the existence of RBIBDs","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Hash function; Prime (order theory); Corollary; Discrete mathematics; Combinatorics; Time complexity; Computer science","score_opus":0.00984109463461909,"score_gpt":0.2334235269196561,"score_spread":0.223582432285037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126750116","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.05364364,0.00030697827,0.9302945,0.0011642451,0.00008494136,0.00013320209,0.0002922892,0.0009626995,0.013117428],"genre_scores_gemma":[0.561717,0.00046948268,0.4251458,0.00046931746,0.00015545364,0.00057775166,0.00047363303,0.00045591933,0.010535592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692696,0.00075772096,0.00023395462,0.0007735884,0.0007645532,0.0005431674],"domain_scores_gemma":[0.98461086,0.007829029,0.00059738365,0.0052454257,0.0009925414,0.00072467374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034613821,0.0005932002,0.001105135,0.001618555,0.003143381,0.003127868,0.0020723871,0.0023797532,0.009190337],"category_scores_gemma":[0.014419472,0.0014061186,0.001343529,0.0019685277,0.0040640845,0.008574907,0.008028861,0.004016923,0.0016687154],"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.00032847692,0.00009221878,0.0010740495,0.00015587236,0.000027412614,0.00009940711,0.00049977674,0.006337016,0.0077910656,0.9271138,0.0033412236,0.053139806],"study_design_scores_gemma":[0.00018912514,0.00015934273,0.0005424945,0.00009262109,0.00009976635,0.00076698605,0.0003148916,0.07310575,0.024762308,0.8851718,0.014668307,0.00012659488],"about_ca_topic_score_codex":0.000635544,"about_ca_topic_score_gemma":0.00066641456,"teacher_disagreement_score":0.009190337,"about_ca_system_score_codex":0.0019023925,"about_ca_system_score_gemma":0.0018474815,"threshold_uncertainty_score":0.030744791},"labels":[],"label_agreement":null},{"id":"W2129749965","doi":"10.1016/j.tcs.2010.09.006","title":"On the complexity of deciding avoidability of sets of partial words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Combinatorics on words; Set (abstract data type); Word (group theory); Alphabet; Space (punctuation); Discrete mathematics; Decidability; Finite set; Polynomial; De Bruijn sequence; Time complexity; Upper and lower bounds; Existential quantification; Computer science","score_opus":0.025403499655608456,"score_gpt":0.2698010805531539,"score_spread":0.24439758089754543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129749965","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.78214204,0.0016139486,0.16273008,0.017722962,0.00036018246,0.0005397255,0.0038069217,0.001611338,0.0294728],"genre_scores_gemma":[0.94275665,0.0007375228,0.04451127,0.0009423399,0.00063334644,0.00030633263,0.003924417,0.00042405617,0.0057641007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9873871,0.0037686436,0.0010658756,0.0024522375,0.003484279,0.0018418769],"domain_scores_gemma":[0.7628587,0.21983285,0.0050839633,0.006088544,0.0028230723,0.003312882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069900397,0.0014302799,0.0036688538,0.0021907361,0.0039237347,0.014057222,0.0053836866,0.004445937,0.015265959],"category_scores_gemma":[0.06360253,0.0020280434,0.004911249,0.0037877294,0.007270552,0.027726384,0.006919493,0.0089491885,0.0009775488],"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.008064088,0.0015768434,0.019048132,0.002271704,0.001028234,0.0017254348,0.0045420025,0.26564777,0.009796284,0.5659232,0.022064198,0.09831208],"study_design_scores_gemma":[0.0004432144,0.00014024744,0.0015905091,0.000055917935,0.00019680185,0.00029767817,0.0006617212,0.2036054,0.0018750306,0.7896697,0.0013852413,0.00007852246],"about_ca_topic_score_codex":0.009719081,"about_ca_topic_score_gemma":0.011645588,"teacher_disagreement_score":0.015265959,"about_ca_system_score_codex":0.0065098642,"about_ca_system_score_gemma":0.005929846,"threshold_uncertainty_score":0.051069736},"labels":[],"label_agreement":null},{"id":"W2130262632","doi":"10.1016/j.tcs.2009.07.057","title":"Covering arrays avoiding forbidden edges","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University; University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Pairwise comparison; Clique; Generalization; Enhanced Data Rates for GSM Evolution; Binary number; Software; Mathematics; Computer science; Algorithm; Theoretical computer science; Combinatorics; Discrete mathematics; Artificial intelligence; Arithmetic; Programming language","score_opus":0.01674969832501048,"score_gpt":0.26296799658636427,"score_spread":0.2462182982613538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130262632","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.31003392,0.00038254322,0.63612545,0.0007752254,0.00019687225,0.00010318934,0.00062408374,0.0038272422,0.04793149],"genre_scores_gemma":[0.81257164,0.00027828265,0.17239638,0.00036143608,0.00006723438,0.00016432627,0.00095752033,0.0007391915,0.012463928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876356,0.0003298125,0.00009034139,0.00021155922,0.00036039914,0.00024429636],"domain_scores_gemma":[0.99128574,0.0048233345,0.00064225745,0.0019040251,0.0009982613,0.0003462691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053728867,0.0006558079,0.0007565795,0.0012221291,0.0011296791,0.0016523886,0.0011604395,0.0010421263,0.006387398],"category_scores_gemma":[0.00629546,0.0007440818,0.0006000223,0.0019094696,0.0008841004,0.0029288074,0.0019206911,0.001485769,0.0014569146],"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.00087806483,0.0002279877,0.004133053,0.00041005085,0.00008873368,0.0010144578,0.00082876073,0.034707844,0.050110467,0.6688594,0.013296973,0.22544427],"study_design_scores_gemma":[0.000087515335,0.00018130676,0.0010287747,0.00008581486,0.00009575778,0.001033831,0.00028296458,0.09181452,0.038668785,0.8444489,0.022220246,0.00005157052],"about_ca_topic_score_codex":0.0004255806,"about_ca_topic_score_gemma":0.0006170245,"teacher_disagreement_score":0.006387398,"about_ca_system_score_codex":0.00045232833,"about_ca_system_score_gemma":0.00047075102,"threshold_uncertainty_score":0.021368027},"labels":[],"label_agreement":null},{"id":"W2130729091","doi":"10.1016/j.tcs.2011.05.012","title":"Polyominoes simulating arbitrary-neighborhood zippers and tilings","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","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":"Polyomino; Mathematics; Combinatorics; Discrete mathematics; Geometry","score_opus":0.014175814350595672,"score_gpt":0.22785787668915014,"score_spread":0.21368206233855447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130729091","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.9015251,0.00017202272,0.06785238,0.00036923357,0.000351922,0.000067579844,0.0001994043,0.00045211686,0.029010167],"genre_scores_gemma":[0.9849421,0.00006437943,0.010752683,0.00008025961,0.00002051426,0.000056455585,0.00009777151,0.00008542369,0.0039004018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997404,0.000060525745,0.000014452707,0.00005085088,0.00006411849,0.00006964338],"domain_scores_gemma":[0.9988084,0.00060188613,0.00009193575,0.0002250426,0.000093783536,0.00017897885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033568757,0.00025324305,0.00084017694,0.000543407,0.0010653493,0.0014092837,0.0010133532,0.0012202923,0.009516281],"category_scores_gemma":[0.0029378082,0.0003891432,0.0006188313,0.0005508673,0.0014369532,0.001609656,0.0013939363,0.00094366336,0.00050350523],"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.00041036174,0.0001973333,0.0019561856,0.00012534982,0.00005531613,0.00045842244,0.0003589331,0.5324955,0.009645305,0.4422825,0.002510384,0.009504397],"study_design_scores_gemma":[0.00008776044,0.000064608124,0.0002828676,0.0000120867135,0.00001413638,0.000053118896,0.0001585618,0.8856778,0.0024681669,0.10967966,0.0014790781,0.000022100505],"about_ca_topic_score_codex":0.0022797012,"about_ca_topic_score_gemma":0.0028096975,"teacher_disagreement_score":0.009516281,"about_ca_system_score_codex":0.0009146154,"about_ca_system_score_gemma":0.0005868191,"threshold_uncertainty_score":0.03183508},"labels":[],"label_agreement":null},{"id":"W2131488553","doi":"10.1016/j.tcs.2010.12.044","title":"Local 7-coloring for planar subgraphs of unit disk graphs","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Planar graph; Unit disk graph; Mathematics; Vertex (graph theory); Complete coloring; Graph factorization; Edge coloring; Graph coloring; Fractional coloring; Graph; Discrete mathematics; Graph power; Computer science; Line graph","score_opus":0.017918212958136517,"score_gpt":0.2962133064616216,"score_spread":0.2782950935034851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131488553","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.82054096,0.00059059163,0.13496576,0.0010317768,0.00006686376,0.000110446155,0.0007445212,0.000988,0.040960975],"genre_scores_gemma":[0.94494,0.00041890203,0.03397842,0.0002663489,0.000103400984,0.00021411618,0.0016839824,0.00042775337,0.017967256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936694,0.00014841977,0.000027536707,0.00015636416,0.000117368276,0.00018336887],"domain_scores_gemma":[0.9970253,0.0012973336,0.00041570023,0.00042673966,0.0002808691,0.00055396464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005783463,0.00060544815,0.0010593851,0.0012405396,0.001970152,0.002490817,0.002214996,0.00086589355,0.01369776],"category_scores_gemma":[0.0024116084,0.0007402174,0.0008701415,0.0015437132,0.001565142,0.0027022657,0.0021734186,0.0016929955,0.0017893423],"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.0016813669,0.00055967184,0.006647634,0.00087063905,0.00012597919,0.0008086498,0.0020821735,0.041528028,0.029505001,0.83990395,0.01764002,0.058646902],"study_design_scores_gemma":[0.00027099403,0.00014623466,0.0037266356,0.00005447407,0.00013821077,0.0004891486,0.0009894609,0.08562375,0.010738833,0.89022076,0.0075387154,0.00006281393],"about_ca_topic_score_codex":0.0023931172,"about_ca_topic_score_gemma":0.004123097,"teacher_disagreement_score":0.01369776,"about_ca_system_score_codex":0.001715627,"about_ca_system_score_gemma":0.0008175802,"threshold_uncertainty_score":0.045823634},"labels":[],"label_agreement":null},{"id":"W213233986","doi":"10.1016/j.tcs.2013.02.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-labelings on the modular product of two graphs","year":2013,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Graph; Vertex (graph theory); Product (mathematics); Mathematics; Algorithm; Geometry","score_opus":0.01497110216309254,"score_gpt":0.2328032701847388,"score_spread":0.21783216802164623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W213233986","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.0023929237,0.00045038262,0.19613452,0.0065683047,0.001285132,0.00027530995,0.11157249,0.10106266,0.58025825],"genre_scores_gemma":[0.041911695,0.002166267,0.18224671,0.002646795,0.000872996,0.0007990072,0.17499395,0.106653824,0.4877087],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996026,0.00007743172,0.000033242715,0.00007575547,0.00016433855,0.00004663191],"domain_scores_gemma":[0.9984958,0.00044857268,0.00010509248,0.00036663358,0.00042894395,0.00015484364],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007175328,0.0012200164,0.00085860724,0.0021701388,0.00088156166,0.0042848317,0.00244845,0.0013673231,0.55838346],"category_scores_gemma":[0.003255442,0.00087747374,0.000873674,0.0037982373,0.00067567604,0.0048720553,0.0019721563,0.0026795326,0.4042349],"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.000053745334,0.000028749346,0.00013100427,0.00019978739,0.000008095294,0.00003727616,0.00010418049,0.00035044306,0.0013008879,0.05933649,0.893924,0.04452528],"study_design_scores_gemma":[0.000042731386,0.000013524851,0.00049273885,0.00006427803,0.000006976805,0.00012196838,0.00006925281,0.0024744845,0.003463108,0.043329217,0.9498855,0.000036216232],"about_ca_topic_score_codex":0.0070719775,"about_ca_topic_score_gemma":0.0077963853,"teacher_disagreement_score":0.55838346,"about_ca_system_score_codex":0.0021193086,"about_ca_system_score_gemma":0.0012978882,"threshold_uncertainty_score":0.6299124},"labels":[],"label_agreement":null},{"id":"W2134071399","doi":"10.1016/j.tcs.2004.09.024","title":"Verification and refinement with fine-grained action-based concurrent objects","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Correctness; Computer science; Programming language; Guard (computer science); Action (physics); Object (grammar); Contrast (vision); Object-oriented programming; Theoretical computer science; Artificial intelligence","score_opus":0.018709218350867675,"score_gpt":0.25738826103413764,"score_spread":0.23867904268326998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134071399","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.027505057,0.00008030374,0.9695151,0.00013642188,0.00005417882,0.00009767704,0.00006445268,0.0012706527,0.0012761735],"genre_scores_gemma":[0.5041008,0.00012048176,0.49238524,0.00013081713,0.00006476875,0.00016845041,0.00019881794,0.00029199774,0.002538589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98898834,0.002584197,0.0010237511,0.0021048891,0.0039877784,0.0013111327],"domain_scores_gemma":[0.96621764,0.017767934,0.0017981724,0.010896781,0.0026275774,0.0006919124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010197626,0.0009433644,0.0014591834,0.0015043233,0.0016106255,0.0035315158,0.0040904544,0.0019854428,0.0033828444],"category_scores_gemma":[0.028878054,0.0017481644,0.003308521,0.0013437702,0.0077616414,0.008195212,0.006381051,0.0038694148,0.00053568376],"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.00095757376,0.00019345644,0.0036612614,0.00033861084,0.00015031097,0.0006067341,0.001152322,0.21180291,0.016305203,0.693832,0.0011012634,0.069898285],"study_design_scores_gemma":[0.0001760183,0.00010215015,0.00030525675,0.000048444912,0.00010933161,0.0001067062,0.000075566575,0.49859235,0.015054898,0.48191184,0.0034610184,0.000056377823],"about_ca_topic_score_codex":0.009230409,"about_ca_topic_score_gemma":0.009949346,"teacher_disagreement_score":0.010197626,"about_ca_system_score_codex":0.0022881734,"about_ca_system_score_gemma":0.0030013295,"threshold_uncertainty_score":0.05393082},"labels":[],"label_agreement":null},{"id":"W2136026170","doi":"10.1016/j.tcs.2009.09.033","title":"Priority algorithms for graph optimization problems","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Greedy algorithm; Algorithm; Mathematical optimization; Mathematics","score_opus":0.020045918708397618,"score_gpt":0.2708548621187035,"score_spread":0.2508089434103059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136026170","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.017395556,0.0022097107,0.96338916,0.002150514,0.00049885554,0.00014322347,0.00014725723,0.00076686236,0.0132988],"genre_scores_gemma":[0.42302322,0.0042466926,0.5408823,0.0012696921,0.0016222112,0.000530013,0.0009516903,0.0009631354,0.026511036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739516,0.00095331384,0.00013194511,0.00036744497,0.00071073876,0.00044133427],"domain_scores_gemma":[0.98698527,0.009215435,0.00058509957,0.0013632617,0.0009998954,0.00085107656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044000316,0.0013874612,0.0021351338,0.0016802154,0.0020081955,0.004804303,0.003828075,0.0019656387,0.009390961],"category_scores_gemma":[0.0215774,0.000941883,0.0012544959,0.0027903735,0.0018385821,0.009147679,0.0028041825,0.0056821313,0.0017966118],"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.0006380369,0.00034539477,0.0006279495,0.0005500492,0.000066235014,0.000056130484,0.0003204048,0.07022899,0.0014940434,0.76329243,0.021740887,0.14063945],"study_design_scores_gemma":[0.00016737093,0.00008867894,0.00015933132,0.000031447646,0.000035732653,0.000043494332,0.00006372356,0.21843207,0.00068985857,0.7732954,0.006974947,0.000017857445],"about_ca_topic_score_codex":0.0033275795,"about_ca_topic_score_gemma":0.0039161383,"teacher_disagreement_score":0.009390961,"about_ca_system_score_codex":0.0031176792,"about_ca_system_score_gemma":0.0031744281,"threshold_uncertainty_score":0.03141588},"labels":[],"label_agreement":null},{"id":"W2136499814","doi":"10.1016/j.tcs.2009.02.032","title":"Twin-roots of words and their properties","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Involution (esoterism); Mathematics; Catenation; Combinatorics; Uniqueness; Word (group theory); Primitive root modulo n; Factorization; Pure mathematics; Modulo; Algorithm; Geometry; Biology; Mathematical analysis","score_opus":0.010737442766716497,"score_gpt":0.21839386871214253,"score_spread":0.20765642594542602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136499814","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.60360086,0.0021990591,0.33696648,0.0014164397,0.0004462552,0.00010661906,0.00052685343,0.0004648893,0.054272596],"genre_scores_gemma":[0.9513463,0.00053030235,0.034336686,0.00013006658,0.0002402105,0.00010243313,0.0002460413,0.00018716017,0.012880885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905056,0.00021220226,0.000091939975,0.00030157462,0.00020413053,0.0001396336],"domain_scores_gemma":[0.9932914,0.004352444,0.00062694476,0.00060160056,0.0005801739,0.00054742914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095925236,0.0005521954,0.0012507031,0.0020323687,0.0020630548,0.0033940242,0.00088010466,0.0014040285,0.0068507004],"category_scores_gemma":[0.008400957,0.0006867007,0.00079005945,0.0022724345,0.0037316105,0.008221894,0.002457709,0.002542937,0.0011272491],"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.00005561881,0.0000118993585,0.00024281692,0.0000359519,0.00000593355,0.00014356207,0.0005263651,0.00037711175,0.0011234966,0.99201113,0.00032574,0.0051402356],"study_design_scores_gemma":[0.000013438379,0.0000124810995,0.00009859705,0.000009162824,0.0000065824865,0.00017677553,0.00011719973,0.0018131739,0.00037106822,0.99569017,0.0016823283,0.000009126936],"about_ca_topic_score_codex":0.0003536845,"about_ca_topic_score_gemma":0.00041576024,"teacher_disagreement_score":0.0068507004,"about_ca_system_score_codex":0.0006415041,"about_ca_system_score_gemma":0.0005931106,"threshold_uncertainty_score":0.022917867},"labels":[],"label_agreement":null},{"id":"W2137465421","doi":"10.1016/j.tcs.2008.10.015","title":"The degree distribution of random<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-trees","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Degree (music); Mathematics; Distribution (mathematics); Computer science; Physics; Mathematical analysis; Theology; Philosophy","score_opus":0.015779277903760762,"score_gpt":0.24383143856678902,"score_spread":0.22805216066302825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137465421","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.50343454,0.0009745479,0.45375255,0.004590987,0.00017385335,0.00017686703,0.0074841627,0.00076297735,0.028649503],"genre_scores_gemma":[0.9600867,0.0010307964,0.016231116,0.00021612972,0.00013167506,0.00019893018,0.0026547485,0.00023312944,0.01921681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990657,0.00022495551,0.000034471508,0.00029151273,0.00020987426,0.00017360401],"domain_scores_gemma":[0.989176,0.0069584334,0.0008864454,0.0010937187,0.0012107528,0.0006747269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014830868,0.0003034472,0.0005580123,0.002259068,0.00076158525,0.0019683477,0.0013608685,0.0011455406,0.008945079],"category_scores_gemma":[0.018374763,0.00041080525,0.000425103,0.00155581,0.0014388374,0.004230559,0.00076331303,0.0011330389,0.0020794026],"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.00022424638,0.00007609855,0.013890764,0.00023969037,0.000047376914,0.00026136398,0.00081272714,0.06417819,0.004634889,0.86819977,0.01709679,0.030338103],"study_design_scores_gemma":[0.000052077758,0.000063092804,0.012140926,0.00011390504,0.000046691413,0.000770382,0.00037577425,0.40686452,0.0036435798,0.562585,0.013264531,0.000079516176],"about_ca_topic_score_codex":0.0025014945,"about_ca_topic_score_gemma":0.0039008358,"teacher_disagreement_score":0.008945079,"about_ca_system_score_codex":0.0016695068,"about_ca_system_score_gemma":0.00057376234,"threshold_uncertainty_score":0.029924273},"labels":[],"label_agreement":null},{"id":"W2137845880","doi":"10.1016/j.tcs.2007.04.036","title":"Agreement in synchronous networks with ubiquitous faults","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Impossibility; Computer science; Distributed computing; Topology (electrical circuits); Component (thermodynamics); Class (philosophy); Theoretical computer science; Mathematics","score_opus":0.004726351572055682,"score_gpt":0.22857777259807088,"score_spread":0.2238514210260152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137845880","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.17840159,0.00075595366,0.80733097,0.0013596762,0.00026676763,0.00011071239,0.00011319516,0.0005381943,0.011122916],"genre_scores_gemma":[0.9642468,0.00040257638,0.0288713,0.00013137373,0.00020431408,0.00013435213,0.00007919235,0.00007784676,0.0058523263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644405,0.0012774956,0.00024838705,0.0006790871,0.0008159848,0.00053509965],"domain_scores_gemma":[0.9713936,0.01976503,0.002249929,0.0032281962,0.001821996,0.0015412698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048175533,0.0004608536,0.0016109454,0.0011881794,0.0020956176,0.0035215404,0.0019107269,0.0018515545,0.0036165027],"category_scores_gemma":[0.024612917,0.000705728,0.00060072873,0.0016663173,0.0032929264,0.007955719,0.0040211184,0.0026451766,0.000531668],"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.00041751037,0.000077738354,0.0009939123,0.000094949464,0.00002164957,0.00036961195,0.00065870414,0.06772644,0.0021418065,0.9101035,0.0014317778,0.015962327],"study_design_scores_gemma":[0.00010776401,0.00006156762,0.00019613301,0.000013683302,0.000029599261,0.00010589687,0.00019184373,0.27978745,0.0011653135,0.7161804,0.0021420196,0.000018384015],"about_ca_topic_score_codex":0.001426982,"about_ca_topic_score_gemma":0.0012856195,"teacher_disagreement_score":0.0048175533,"about_ca_system_score_codex":0.0015139162,"about_ca_system_score_gemma":0.0017414668,"threshold_uncertainty_score":0.025478005},"labels":[],"label_agreement":null},{"id":"W2138079171","doi":"10.1016/j.tcs.2012.12.017","title":"Classical, quantum and nonsignalling resources in bipartite games","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Bipartite graph; Quantum; Mathematical economics; Mathematics; Computer science; Theoretical computer science; Combinatorics; Discrete mathematics; Quantum mechanics; Physics; Graph","score_opus":0.012374730256739512,"score_gpt":0.25664841359229545,"score_spread":0.24427368333555594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138079171","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.65608966,0.0011863598,0.26439583,0.0055786865,0.0002389144,0.00021855869,0.00056413596,0.00018317392,0.07154466],"genre_scores_gemma":[0.9665881,0.0003909752,0.015604894,0.00032858548,0.00014381007,0.0001536174,0.00015748723,0.00005230118,0.016580215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974573,0.0014454186,0.00011055046,0.0002056106,0.00033593783,0.0004452134],"domain_scores_gemma":[0.9850352,0.011865229,0.0006789547,0.0005790634,0.00046018048,0.0013813851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004932679,0.000798956,0.0016743443,0.0012122507,0.00198384,0.0054386947,0.002322788,0.0026402976,0.009281508],"category_scores_gemma":[0.015666045,0.0009285835,0.00090989267,0.0012307029,0.004806891,0.008275045,0.0030085207,0.0029089598,0.00039453406],"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.00011580586,0.000041756517,0.00018815871,0.000029599529,0.000010685719,0.0000358058,0.00015605541,0.010106496,0.00021838577,0.9873223,0.00058498065,0.0011899619],"study_design_scores_gemma":[0.000056393743,0.000018226106,0.0001467829,0.000011174713,0.00001144493,0.00002516623,0.000089840985,0.07417709,0.00007335272,0.92493296,0.00044129734,0.000016364676],"about_ca_topic_score_codex":0.006297614,"about_ca_topic_score_gemma":0.007437203,"teacher_disagreement_score":0.009281508,"about_ca_system_score_codex":0.0026160209,"about_ca_system_score_gemma":0.00286911,"threshold_uncertainty_score":0.031049788},"labels":[],"label_agreement":null},{"id":"W2140266967","doi":"10.1016/j.tcs.2014.02.006","title":"Graph transformation for incremental natural language analysis","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transformation (genetics); Graph rewriting; Computer science; Graph; Mathematics; Programming language; Theoretical computer science","score_opus":0.0046900244990736,"score_gpt":0.26367150925723376,"score_spread":0.2589814847581602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140266967","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.009243397,0.000141282,0.9734177,0.00022362429,0.000061426814,0.00019441993,0.0007900748,0.0127627505,0.0031652928],"genre_scores_gemma":[0.19768795,0.0002644692,0.78662074,0.00027984552,0.0000834832,0.00033624005,0.00447604,0.0027891353,0.00746206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901915,0.00023569226,0.00007002715,0.00028109926,0.00030306203,0.000090901354],"domain_scores_gemma":[0.9974038,0.0014027882,0.00008605769,0.0006482926,0.00040583397,0.000053239364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054798357,0.00061382743,0.0005871332,0.0020044444,0.00076408446,0.0010933616,0.0014902764,0.0005914919,0.009058533],"category_scores_gemma":[0.0037336817,0.00049699814,0.0018175971,0.001645788,0.0009105392,0.0029170092,0.001772162,0.0017866895,0.00299534],"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.00035730161,0.00035090727,0.0012921677,0.00057060627,0.000120740726,0.00045232935,0.0005825804,0.025523303,0.025431763,0.19276308,0.028995533,0.72355974],"study_design_scores_gemma":[0.000080449536,0.00008355167,0.0007587498,0.00006528872,0.00017324348,0.0002708934,0.00020449438,0.3974074,0.037190747,0.5271233,0.036586076,0.00005585836],"about_ca_topic_score_codex":0.005538134,"about_ca_topic_score_gemma":0.008598479,"teacher_disagreement_score":0.009058533,"about_ca_system_score_codex":0.0007815898,"about_ca_system_score_gemma":0.0012667659,"threshold_uncertainty_score":0.030303836},"labels":[],"label_agreement":null},{"id":"W2140571294","doi":"10.1016/j.tcs.2004.01.013","title":"The abc conjecture and correctly rounded reciprocal square roots","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Conjecture; Reciprocal; Square root; Square (algebra); Mathematics; Point (geometry); Code (set theory); Constant (computer programming); Computation; Collatz conjecture; Scheme (mathematics); Combinatorics; Discrete mathematics; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.008188843754170748,"score_gpt":0.26321091355238313,"score_spread":0.2550220697982124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140571294","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24173555,0.0036022575,0.28888965,0.023740144,0.005450548,0.000076296776,0.00060522644,0.0012813132,0.43461907],"genre_scores_gemma":[0.9214084,0.0010846953,0.041767817,0.002924946,0.0010073256,0.00008441652,0.00031973547,0.00048022842,0.030922381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729794,0.0007094242,0.00010857948,0.00048419976,0.0010572124,0.0003426294],"domain_scores_gemma":[0.9925925,0.0039828066,0.00043848198,0.001792427,0.00093391637,0.00025978463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017944119,0.00076969335,0.0011551485,0.0015414862,0.002083879,0.005914489,0.0012320435,0.0038262191,0.023099313],"category_scores_gemma":[0.029282704,0.00071679737,0.00065147685,0.0013771488,0.006810134,0.0075477376,0.003321285,0.005610872,0.005332901],"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.0001140783,0.000012335951,0.00023413954,0.000048879472,0.0000045120432,0.0001442734,0.0001193523,0.0020272222,0.000493903,0.98015827,0.005950507,0.010692511],"study_design_scores_gemma":[0.000019648316,0.0000072247035,0.000049313963,0.000021555554,0.000003055301,0.0001177882,0.000072684816,0.004077209,0.000383711,0.9907286,0.004509936,0.0000093330345],"about_ca_topic_score_codex":0.0010104708,"about_ca_topic_score_gemma":0.0006636765,"teacher_disagreement_score":0.023099313,"about_ca_system_score_codex":0.0010118387,"about_ca_system_score_gemma":0.0006678616,"threshold_uncertainty_score":0.07727486},"labels":[],"label_agreement":null},{"id":"W2141195801","doi":"10.1016/j.tcs.2015.10.038","title":"Order compression schemes","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Compression (physics); Mathematics; Data compression; Conjecture; Data compression ratio; Sample (material); Lossless compression; Intersection (aeronautics); Dimension (graph theory); Order (exchange); Algorithm; Image compression; Discrete mathematics; Computer science; Combinatorics; Artificial intelligence","score_opus":0.014273892912185154,"score_gpt":0.27760372365807984,"score_spread":0.26332983074589467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141195801","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.0462672,0.0036081502,0.7343222,0.003108971,0.0016391396,0.00066972943,0.0022790015,0.0041118576,0.20399378],"genre_scores_gemma":[0.5385441,0.0040054107,0.30527973,0.0017616977,0.0013617668,0.0005598188,0.004233378,0.0014753137,0.14277878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998577,0.00021536331,0.00008944614,0.00017728673,0.0007205647,0.00022041312],"domain_scores_gemma":[0.9971943,0.0005284008,0.00008794418,0.0017922734,0.0003078093,0.000089276466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097558514,0.00087737833,0.0007642177,0.001943532,0.0013317113,0.0022836232,0.0010539332,0.0011651375,0.0298561],"category_scores_gemma":[0.0043644286,0.00039469282,0.0006199347,0.0026636424,0.001226923,0.0033719174,0.0023388213,0.0026433885,0.008560823],"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.00041628082,0.00009999609,0.00027053172,0.00014440747,0.000019968991,0.000097248405,0.00013653815,0.0060589355,0.0070521226,0.6996436,0.026794875,0.25926548],"study_design_scores_gemma":[0.00014154238,0.00017137364,0.00047235814,0.00013408864,0.000049504473,0.0005425258,0.00008701017,0.04691249,0.036582883,0.7942339,0.12060615,0.00006617289],"about_ca_topic_score_codex":0.00050852017,"about_ca_topic_score_gemma":0.00071121304,"teacher_disagreement_score":0.0298561,"about_ca_system_score_codex":0.0011434277,"about_ca_system_score_gemma":0.0012134665,"threshold_uncertainty_score":0.09987867},"labels":[],"label_agreement":null},{"id":"W2141385438","doi":"10.1016/j.tcs.2012.03.046","title":"State complexity of union and intersection of square and reversal on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math> regular languages","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Intersection (aeronautics); Component (thermodynamics); Mathematics; Discrete mathematics; Computer science; Algorithm; Engineering; Physics","score_opus":0.014212729719191937,"score_gpt":0.24482203627869006,"score_spread":0.23060930655949813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141385438","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.89920753,0.00036844966,0.06335511,0.002660342,0.00007432578,0.00011603617,0.004059041,0.0009365372,0.029222636],"genre_scores_gemma":[0.98254967,0.00010450948,0.009110152,0.000097295364,0.000047451267,0.000069072994,0.0023415936,0.00015878207,0.0055215964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970963,0.0005424797,0.00023313923,0.00070816453,0.00069278094,0.00072724506],"domain_scores_gemma":[0.96615434,0.02635246,0.0016906984,0.0023123329,0.0018678346,0.0016223819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001715716,0.00045136787,0.0012258529,0.0014144179,0.0023857835,0.006797786,0.0019378719,0.0020309116,0.02566034],"category_scores_gemma":[0.018672602,0.0006784646,0.0020050826,0.0015325813,0.0027061442,0.011496374,0.0029420308,0.0027243788,0.0011564333],"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.0025122932,0.0003946157,0.013992474,0.0005911284,0.00015245387,0.00057102775,0.0016731044,0.114671744,0.0055185393,0.80706775,0.015026148,0.037828773],"study_design_scores_gemma":[0.00014555009,0.00011636813,0.0032547975,0.00004734517,0.00010660805,0.00024265221,0.0005700778,0.30949238,0.005604225,0.6780177,0.0023239672,0.000078306904],"about_ca_topic_score_codex":0.009574852,"about_ca_topic_score_gemma":0.010659121,"teacher_disagreement_score":0.02566034,"about_ca_system_score_codex":0.0037878677,"about_ca_system_score_gemma":0.003293333,"threshold_uncertainty_score":0.08584237},"labels":[],"label_agreement":null},{"id":"W2142971854","doi":"10.1016/j.tcs.2009.01.016","title":"Exploration–exploitation tradeoff using variance estimates in multi-armed bandits","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":566,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Variance (accounting); Stochastic game; Upper and lower bounds; Logarithm; Mathematical optimization; Computer science; Multi-armed bandit; Interval (graph theory); Mathematics; Mathematical economics; Machine learning; Economics","score_opus":0.20250909729079805,"score_gpt":0.46313926625110025,"score_spread":0.2606301689603022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142971854","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.035254948,0.0012148488,0.959457,0.0008320826,0.00005525736,0.000042777097,0.000052160478,0.00017878696,0.002912093],"genre_scores_gemma":[0.8497404,0.0009737169,0.14528857,0.00028440903,0.00021749924,0.0003045098,0.0001220478,0.00020141384,0.0028673785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900691,0.007260599,0.00047015442,0.00063790864,0.0010063457,0.0005558263],"domain_scores_gemma":[0.9136565,0.07833941,0.0026579332,0.00258174,0.002190966,0.00057355623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01741206,0.0018010485,0.0032923566,0.0019395467,0.0010088648,0.0040788027,0.0024635296,0.0041495333,0.0020091971],"category_scores_gemma":[0.08031216,0.001942511,0.0010070892,0.0017059548,0.0026680212,0.0067503364,0.0038569972,0.0032342982,0.0004377603],"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.0005399436,0.000094682975,0.0017169504,0.00023331214,0.00024398493,0.00007355642,0.00016216392,0.8388136,0.0012782945,0.11119803,0.00090468815,0.044740878],"study_design_scores_gemma":[0.000044859702,0.000069811096,0.00023162256,0.000039903385,0.000029815594,0.000031734842,0.000018339764,0.94764453,0.00048352723,0.051202465,0.00018079963,0.000022719052],"about_ca_topic_score_codex":0.0011009963,"about_ca_topic_score_gemma":0.00080451055,"teacher_disagreement_score":0.01741206,"about_ca_system_score_codex":0.0013783948,"about_ca_system_score_gemma":0.0016630786,"threshold_uncertainty_score":0.092084885},"labels":[],"label_agreement":null},{"id":"W2144182788","doi":"10.1016/j.tcs.2007.09.032","title":"Gathering asynchronous oblivious mobile robots in a ring","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Snapshot (computer storage); Robot; Asynchronous communication; Computer science; Mobile robot; Node (physics); Ring (chemistry); Algorithm; Topology (electrical circuits); Mathematics; Combinatorics; Computer network; Artificial intelligence; Engineering; Operating system","score_opus":0.009868126200166685,"score_gpt":0.26984641937393045,"score_spread":0.25997829317376375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144182788","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.3239764,0.00035349224,0.6653677,0.00086316303,0.00010484595,0.00018555603,0.00014255922,0.00061717373,0.008389221],"genre_scores_gemma":[0.9026564,0.00023552414,0.08685754,0.000079692865,0.00007364582,0.00020776532,0.00008067811,0.00007383189,0.00973498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911016,0.00028796672,0.000054711945,0.00019590635,0.00016394522,0.00018735885],"domain_scores_gemma":[0.99468285,0.00306725,0.00071977417,0.0007898108,0.000294697,0.00044564044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016351538,0.0006313457,0.0013362564,0.00084195693,0.0015717504,0.0013381081,0.0018839362,0.001102525,0.004044795],"category_scores_gemma":[0.006606077,0.00059233274,0.000592298,0.00091843464,0.0012867312,0.0036670784,0.0038792843,0.0011145714,0.0007695107],"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.0024904492,0.00034080274,0.0026890673,0.0006353147,0.00017791387,0.0006582446,0.0009722957,0.67916137,0.0334267,0.21913776,0.004123767,0.05618636],"study_design_scores_gemma":[0.00012891498,0.00036248006,0.0002649779,0.000018020815,0.000050339986,0.0001287076,0.0002026789,0.9247347,0.005638298,0.06632079,0.0021251438,0.000025025412],"about_ca_topic_score_codex":0.00047599833,"about_ca_topic_score_gemma":0.0006236786,"teacher_disagreement_score":0.004044795,"about_ca_system_score_codex":0.0006270033,"about_ca_system_score_gemma":0.000665208,"threshold_uncertainty_score":0.013531208},"labels":[],"label_agreement":null},{"id":"W2144694779","doi":"10.1016/s0304-3975(02)00421-8","title":"On learning of functions refutably","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Real Estate Foundation of British Columbia","keywords":"Function (biology); Artificial intelligence; Computer science; Type (biology); Mathematics; Machine learning","score_opus":0.0060477036543585775,"score_gpt":0.23988754661695125,"score_spread":0.23383984296259266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144694779","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.03662179,0.0022273601,0.9394241,0.00482502,0.0005148824,0.00008181526,0.00023412817,0.0013415143,0.014729339],"genre_scores_gemma":[0.6559834,0.002512976,0.30903766,0.0024433255,0.0011259975,0.00028313935,0.0020103068,0.0009703439,0.025632886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941999,0.0028702915,0.0003132575,0.0011375181,0.0010750195,0.00040402755],"domain_scores_gemma":[0.9495706,0.039149936,0.0009376859,0.007069892,0.002746202,0.00052575587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063052187,0.0013821292,0.0018889678,0.0018793537,0.0018936339,0.0027225476,0.004843913,0.0030889194,0.009058295],"category_scores_gemma":[0.062088042,0.0008067118,0.0019372727,0.002462043,0.0064591765,0.01257211,0.0070161624,0.0053284434,0.0016394055],"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.00036010778,0.00010707932,0.0021967303,0.00025927697,0.000085433225,0.00010492594,0.0006049852,0.047636095,0.00066150824,0.70269775,0.012461115,0.23282497],"study_design_scores_gemma":[0.000030658106,0.000040414085,0.0001336264,0.00004988061,0.000021577955,0.000042935357,0.00005632315,0.11592697,0.0005855872,0.8791662,0.0039339536,0.0000117991085],"about_ca_topic_score_codex":0.003146757,"about_ca_topic_score_gemma":0.0033781005,"teacher_disagreement_score":0.009058295,"about_ca_system_score_codex":0.0019516393,"about_ca_system_score_gemma":0.0018133777,"threshold_uncertainty_score":0.03334558},"labels":[],"label_agreement":null},{"id":"W2145253149","doi":"10.1016/j.tcs.2005.06.037","title":"The HASCASL prologue: Categorical syntax and semantics of the partial <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>λ</mml:mi></mml:math>-calculus","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Partenariat Canadien Contre Le Cancer","keywords":"Syntax; Scroll; Algorithm; Semantics (computer science); Prologue; Computer science; Categorical variable; Mathematics; Programming language; Artificial intelligence; Machine learning; Philosophy; Theology; Art","score_opus":0.01425435046213259,"score_gpt":0.2348297229824746,"score_spread":0.220575372520342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145253149","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.0076035107,0.0010065843,0.882253,0.0024151145,0.0007067988,0.00021056738,0.010734784,0.015381334,0.07968838],"genre_scores_gemma":[0.28321058,0.0026864668,0.60362506,0.0021840173,0.0009243471,0.0008434226,0.02214098,0.011840408,0.072544776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989843,0.00029459296,0.00009607906,0.00017752552,0.00030313962,0.00014423463],"domain_scores_gemma":[0.9992902,0.00023131382,0.000055180197,0.00015549801,0.00019460029,0.00007317135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015012901,0.00056123344,0.0006033907,0.0012316129,0.0018719655,0.0052400515,0.0016932421,0.0010033356,0.026313977],"category_scores_gemma":[0.0023656737,0.000787269,0.0011253098,0.0018104704,0.0025661222,0.004732235,0.0025837584,0.00234309,0.010653391],"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.00006983034,0.000020594462,0.00019162119,0.00018728942,0.000008350384,0.00007550057,0.00036807463,0.0008560841,0.001347462,0.9280427,0.038974483,0.029858068],"study_design_scores_gemma":[0.000066819484,0.000028907369,0.00023838622,0.00014194389,0.00002070307,0.00023432383,0.0002079666,0.0069435574,0.0040790914,0.49970907,0.48827392,0.000055304827],"about_ca_topic_score_codex":0.0051727593,"about_ca_topic_score_gemma":0.0058596027,"teacher_disagreement_score":0.026313977,"about_ca_system_score_codex":0.0019005239,"about_ca_system_score_gemma":0.0031244014,"threshold_uncertainty_score":0.08802909},"labels":[],"label_agreement":null},{"id":"W2147012241","doi":"10.1016/s0304-3975(01)00154-2","title":"Rigorous results for random (2+p)-SAT","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Random variable; Set (abstract data type); Order (exchange); Discrete mathematics; Statistics; Computer science","score_opus":0.011106381693631446,"score_gpt":0.2534107792008292,"score_spread":0.24230439750719776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147012241","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.029010892,0.0046056015,0.895347,0.008639239,0.00077774806,0.0002574941,0.0015694484,0.0012430009,0.058549594],"genre_scores_gemma":[0.6676254,0.0074776695,0.2647198,0.0071099293,0.0049768332,0.0019680276,0.0044319993,0.0028407702,0.038849544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9822827,0.007352474,0.00090671575,0.0027818892,0.004964584,0.0017116099],"domain_scores_gemma":[0.9202651,0.06267099,0.0031067312,0.008023372,0.0037941565,0.0021397413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016965313,0.0035480994,0.005039928,0.0057734926,0.0037071912,0.009318782,0.008497845,0.005176124,0.018564448],"category_scores_gemma":[0.07568291,0.0030350378,0.0061818804,0.0066344063,0.010227095,0.022797557,0.009837535,0.014249304,0.0026948622],"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.00013485923,0.000113223185,0.000591401,0.00033428948,0.00011248595,0.000076762975,0.000118570126,0.02122524,0.0006215302,0.9593572,0.007586017,0.00972849],"study_design_scores_gemma":[0.000053951117,0.00003026646,0.0002477053,0.00004928602,0.00004193027,0.00006893974,0.00002577638,0.06377093,0.0002940527,0.93324065,0.0021459905,0.000030463667],"about_ca_topic_score_codex":0.0027495567,"about_ca_topic_score_gemma":0.00349174,"teacher_disagreement_score":0.018564448,"about_ca_system_score_codex":0.006504861,"about_ca_system_score_gemma":0.0041387314,"threshold_uncertainty_score":0.089722216},"labels":[],"label_agreement":null},{"id":"W2147763027","doi":"10.1016/j.tcs.2008.09.056","title":"Quasiperiodic and Lyndon episturmian words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"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":"Quasiperiodic function; Mathematics; Generalization; Morphism; Word (group theory); Characterization (materials science); Class (philosophy); Directive; Pure mathematics; Combinatorics; Computer science; Artificial intelligence; Mathematical analysis; Physics; Geometry","score_opus":0.008835510490404727,"score_gpt":0.2206555159525293,"score_spread":0.21182000546212457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147763027","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.80258256,0.0009446497,0.090965495,0.0014480373,0.0005970179,0.000061413004,0.00031352192,0.0002588678,0.10282843],"genre_scores_gemma":[0.97109985,0.00017629679,0.007990475,0.00020186599,0.00021286249,0.00006606718,0.00015473676,0.000049124028,0.020048749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960977,0.00009429257,0.000030804513,0.00009135585,0.000091177506,0.00008256439],"domain_scores_gemma":[0.9991841,0.00036545683,0.00012228872,0.00009795944,0.00010746589,0.00012275156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054926187,0.00035689733,0.0005541917,0.0010349626,0.0020181704,0.0020808834,0.0004762341,0.0009843343,0.0061381035],"category_scores_gemma":[0.0019813585,0.00033218472,0.00049892045,0.0008368001,0.002340561,0.002325385,0.0013126195,0.0010691854,0.00063117815],"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.000048583035,0.000008440903,0.00020323323,0.000013905023,0.0000028242682,0.00016040837,0.0003488597,0.00020748192,0.001251479,0.99438876,0.00051053957,0.0028555687],"study_design_scores_gemma":[0.000022246688,0.000020802767,0.00038679788,0.000006503277,0.0000059092067,0.0002700817,0.00018071526,0.0021574595,0.00047420672,0.9930715,0.003390687,0.000013130005],"about_ca_topic_score_codex":0.00040244457,"about_ca_topic_score_gemma":0.0005861947,"teacher_disagreement_score":0.0061381035,"about_ca_system_score_codex":0.0007764461,"about_ca_system_score_gemma":0.0003571638,"threshold_uncertainty_score":0.020534039},"labels":[],"label_agreement":null},{"id":"W2148837681","doi":"10.1016/s0304-3975(03)00049-5","title":"A fast algorithm to generate necklaces with fixed content","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Alphabet; Amortized analysis; Algorithm; Mathematics; Fixed point; Constant (computer programming); Simple (philosophy); Symbol (formal); Construct (python library); Bounding overwatch; Listing (finance); Combinatorics; Content (measure theory); Computer science; Data structure; Artificial intelligence","score_opus":0.015390357915986018,"score_gpt":0.23220576042524038,"score_spread":0.21681540250925435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148837681","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.009111247,0.00017490942,0.9846795,0.000110203786,0.000115514056,0.0002523283,0.00021057698,0.0025053527,0.0028403017],"genre_scores_gemma":[0.036849957,0.000120171615,0.9575428,0.000049684422,0.00003712691,0.00024872887,0.0004472208,0.00043088227,0.0042734137],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990754,0.000093067945,0.00006911421,0.0001370146,0.0005454139,0.00008000678],"domain_scores_gemma":[0.9976852,0.00069911673,0.00015096522,0.0007644751,0.00059228676,0.00010801136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097123004,0.0014586402,0.0008009097,0.0021737786,0.0010151032,0.0010961132,0.001293017,0.001461345,0.01202235],"category_scores_gemma":[0.0045694634,0.0006233622,0.0008900075,0.0018419526,0.0010350568,0.0016752811,0.0029547152,0.0014272437,0.00484326],"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.0006797907,0.00014610095,0.0005070459,0.00035687487,0.00006911681,0.00032060622,0.00036534696,0.017606346,0.08201431,0.055165395,0.017459888,0.8253092],"study_design_scores_gemma":[0.00049616594,0.00068376283,0.0009196381,0.00016846828,0.00017442214,0.0020666053,0.00028729608,0.5491254,0.2752033,0.09510413,0.07559809,0.00017276793],"about_ca_topic_score_codex":0.0010843049,"about_ca_topic_score_gemma":0.0018483636,"teacher_disagreement_score":0.01202235,"about_ca_system_score_codex":0.00070924446,"about_ca_system_score_gemma":0.0010718763,"threshold_uncertainty_score":0.04021877},"labels":[],"label_agreement":null},{"id":"W2149317979","doi":"10.1016/j.tcs.2010.10.038","title":"On the red/blue spanning tree problem","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Division of Biological Infrastructure; National Natural Science Foundation of China","keywords":"Combinatorics; Spanning tree; Mathematics; Shortest-path tree; Euclidean minimum spanning tree; Minimum spanning tree; Vertex (graph theory); k-minimum spanning tree; Convex hull; Tree (set theory); Minimum degree spanning tree; Path (computing); K-ary tree; Regular polygon; Geometry; Tree structure; Graph; Binary tree; Computer science","score_opus":0.00984460314560611,"score_gpt":0.23983971626585446,"score_spread":0.22999511312024834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149317979","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.19423851,0.0034661952,0.6849896,0.008840214,0.0006569207,0.00014167806,0.0006166822,0.00050117075,0.10654899],"genre_scores_gemma":[0.7177956,0.0026037968,0.23542929,0.0014016777,0.0005584583,0.00012906684,0.0010500088,0.00036644505,0.04066575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994742,0.0002149947,0.000017212347,0.000095130665,0.000102724705,0.00009576722],"domain_scores_gemma":[0.99886346,0.0007219209,0.00007501673,0.00010745733,0.00011008011,0.00012210803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009262648,0.00054909464,0.00086731924,0.00062835205,0.0009480403,0.0011655283,0.0011144568,0.0013461515,0.007938178],"category_scores_gemma":[0.004230203,0.00033455182,0.00039957458,0.001012823,0.0009508849,0.0028470748,0.0018737315,0.001550263,0.0009623413],"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.00055468414,0.00014935614,0.00077234633,0.00035569866,0.00006704062,0.00025166804,0.00034112256,0.1603208,0.0034130581,0.6423362,0.04353296,0.14790504],"study_design_scores_gemma":[0.00007048735,0.000058322716,0.000347078,0.000047632173,0.000029512039,0.00017201001,0.00018198884,0.3585806,0.000943445,0.6291983,0.010356851,0.000013722016],"about_ca_topic_score_codex":0.0016666712,"about_ca_topic_score_gemma":0.0016796156,"teacher_disagreement_score":0.007938178,"about_ca_system_score_codex":0.00066229264,"about_ca_system_score_gemma":0.0005586447,"threshold_uncertainty_score":0.026555836},"labels":[],"label_agreement":null},{"id":"W2152595206","doi":"10.1016/j.tcs.2004.10.021","title":"Domain theory, testing and simulation for labelled Markov processes","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Preorder; Mathematics; Probabilistic logic; Domain theory; Equivalence (formal languages); Domain (mathematical analysis); Markov chain; State space; Markov kernel; Markov process; Discrete mathematics; Kernel (algebra); Computer science; Pure mathematics; Markov model; Variable-order Markov model","score_opus":0.02515576003690079,"score_gpt":0.30781641537150756,"score_spread":0.28266065533460677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152595206","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.051636778,0.0003923126,0.93903553,0.0008851451,0.000052163556,0.000099299155,0.00021297135,0.00031694968,0.0073688794],"genre_scores_gemma":[0.8636205,0.00050833495,0.13026021,0.00025280297,0.000117364914,0.0003637854,0.0005429862,0.00014392224,0.0041900165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99195194,0.0046878275,0.00039903703,0.00096973625,0.0012962912,0.00069521717],"domain_scores_gemma":[0.8988493,0.09155221,0.0021847314,0.004044914,0.0022185214,0.0011503613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007984368,0.001160267,0.0016174266,0.0025049197,0.0016546801,0.0040450967,0.0028123748,0.002761907,0.0041719577],"category_scores_gemma":[0.046679847,0.001101215,0.0030292834,0.0016049875,0.008830637,0.008300892,0.004246857,0.0042437245,0.0004678346],"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.00019261753,0.00006579188,0.00096085377,0.00010868484,0.000044717974,0.00012917271,0.00039548907,0.07413798,0.00064571947,0.91506386,0.0003877274,0.007867486],"study_design_scores_gemma":[0.000029044199,0.000020966969,0.00009445404,0.00002670362,0.00001512783,0.000022196573,0.000052319112,0.1431646,0.00050385454,0.8556617,0.0003970123,0.000011927846],"about_ca_topic_score_codex":0.0055768727,"about_ca_topic_score_gemma":0.004080746,"teacher_disagreement_score":0.007984368,"about_ca_system_score_codex":0.0035841968,"about_ca_system_score_gemma":0.0034419717,"threshold_uncertainty_score":0.042225897},"labels":[],"label_agreement":null},{"id":"W2154866826","doi":"10.1016/j.tcs.2013.12.018","title":"Restriction categories as enriched categories","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Australian Research Council","keywords":"Computer science; Mathematics; Linguistics; Natural language processing; Philosophy","score_opus":0.015895323894086648,"score_gpt":0.28641501998191393,"score_spread":0.2705196960878273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154866826","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.33535323,0.00799296,0.33370188,0.007568303,0.0006018767,0.00010577539,0.00077817246,0.0007940762,0.31310374],"genre_scores_gemma":[0.9288949,0.0022295397,0.025092624,0.0007940186,0.00061975524,0.0001213489,0.00046109542,0.00016467054,0.041622058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986565,0.00041035126,0.000075167314,0.00026402937,0.00040874173,0.00018529207],"domain_scores_gemma":[0.99830675,0.0007741208,0.00013720237,0.0002566355,0.00029730998,0.00022799025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013444051,0.0006714061,0.00094362465,0.0036673604,0.001967915,0.004650903,0.0013532953,0.0013962089,0.00906016],"category_scores_gemma":[0.002544161,0.0006924503,0.0007636659,0.0027210086,0.005755592,0.012443376,0.0046901335,0.003371994,0.00097054034],"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.000005266199,0.0000039091797,0.00006245485,0.000010472747,0.0000023177738,0.000018308552,0.00014274735,0.00007752495,0.00012339141,0.99806005,0.00020444085,0.0012890492],"study_design_scores_gemma":[0.0000056736003,0.0000044623275,0.00013131187,0.000005750939,0.0000063747007,0.000048555936,0.000083428065,0.0008460391,0.00016720954,0.9941744,0.0045212563,0.0000054737543],"about_ca_topic_score_codex":0.000999744,"about_ca_topic_score_gemma":0.0008427479,"teacher_disagreement_score":0.00906016,"about_ca_system_score_codex":0.001459421,"about_ca_system_score_gemma":0.00060475606,"threshold_uncertainty_score":0.03030932},"labels":[],"label_agreement":null},{"id":"W2155175290","doi":"10.1016/j.tcs.2012.03.021","title":"Euclidean chains and their shortcuts","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Chinese University of Hong Kong; University of Hong Kong","keywords":"Computer science; Combinatorics; Euclidean geometry; Euclidean distance; Mathematics; Algebra over a field; Algorithm; Artificial intelligence; Pure mathematics; Geometry","score_opus":0.01138904384297347,"score_gpt":0.2426906368052338,"score_spread":0.23130159296226033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155175290","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.28956258,0.007425088,0.56448114,0.0025461481,0.00096648437,0.0001458835,0.000651573,0.0005146626,0.13370645],"genre_scores_gemma":[0.72780615,0.0051478813,0.15532346,0.00083281705,0.0006523131,0.0002550152,0.0009819116,0.00085153314,0.108148955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995726,0.000087410954,0.000025018186,0.00008933164,0.00016551449,0.000060090762],"domain_scores_gemma":[0.99829096,0.00073847244,0.0002433659,0.00017190224,0.0002464305,0.00030883707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064562773,0.0006634984,0.0008107136,0.0034021358,0.0017588087,0.0024283067,0.0013213011,0.0018612974,0.014905677],"category_scores_gemma":[0.0043428703,0.00066557387,0.00070347247,0.0019822791,0.0021244385,0.0032770077,0.0027134058,0.002851158,0.0013363137],"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.000013647012,0.0000075284497,0.000080541606,0.000024314279,0.0000042176157,0.000028446397,0.00007177879,0.0014885698,0.00027483783,0.9908716,0.00089351455,0.006240956],"study_design_scores_gemma":[0.0000060973102,0.000010617369,0.00009073238,0.000018519475,0.000003213222,0.00004284496,0.000046576566,0.0062483153,0.00015569468,0.9889087,0.0044639916,0.0000048015872],"about_ca_topic_score_codex":0.0011041068,"about_ca_topic_score_gemma":0.0014043173,"teacher_disagreement_score":0.014905677,"about_ca_system_score_codex":0.0009826359,"about_ca_system_score_gemma":0.0004312215,"threshold_uncertainty_score":0.04986453},"labels":[],"label_agreement":null},{"id":"W2155195622","doi":"10.1016/j.tcs.2005.12.003","title":"Combinatorial properties of smooth infinite words","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"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":"Bijection; Mathematics; Combinatorics; Mixing (physics); Monoid; Class (philosophy); Fixed point; Palindrome; Combinatorial algorithms; Computation; Free monoid; Point (geometry); Discrete mathematics; Computer science; Algorithm","score_opus":0.008293644474209383,"score_gpt":0.20828282649396776,"score_spread":0.19998918201975838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155195622","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.9087008,0.0008561078,0.0528062,0.0008015757,0.00006129063,0.000038122584,0.00031391744,0.00016582564,0.036256026],"genre_scores_gemma":[0.98470217,0.00036281327,0.0077579184,0.000079049416,0.00017682917,0.00005397389,0.0003943051,0.00006357447,0.0064093755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938107,0.00015526867,0.000056217374,0.00014027154,0.00018386758,0.000083299456],"domain_scores_gemma":[0.99494874,0.0033127067,0.0006341427,0.00031101916,0.00037153243,0.0004218001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070642645,0.0006299066,0.0007322814,0.0036741234,0.0016611819,0.0047875633,0.0010839443,0.0008608379,0.005451278],"category_scores_gemma":[0.003967068,0.00073236274,0.00076978205,0.0027751666,0.004035775,0.004977412,0.0015609398,0.0018451578,0.00040062313],"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.00007361806,0.00002801639,0.0010306983,0.00006644814,0.000014746685,0.00024682996,0.0005916777,0.0012758262,0.003274511,0.9878093,0.00042283078,0.005165508],"study_design_scores_gemma":[0.00002061824,0.000025412726,0.0011015371,0.0000132098,0.000020745854,0.00028211332,0.00026705468,0.0044239676,0.0009921567,0.991135,0.0016962803,0.000021860975],"about_ca_topic_score_codex":0.000528179,"about_ca_topic_score_gemma":0.00054470316,"teacher_disagreement_score":0.005451278,"about_ca_system_score_codex":0.0009859712,"about_ca_system_score_gemma":0.00035807528,"threshold_uncertainty_score":0.018236399},"labels":[],"label_agreement":null},{"id":"W2155834001","doi":"10.1016/j.tcs.2015.05.031","title":"A framework for non-interactive instance-dependent commitment schemes (NIC)","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Variety (cybernetics); Computer science; Theoretical computer science; Closure (psychology); Abstraction; Zero-knowledge proof; Artificial intelligence; Algorithm; Cryptography","score_opus":0.025976171992434783,"score_gpt":0.3073404757690739,"score_spread":0.2813643037766391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155834001","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.0036390305,0.00034927743,0.97415155,0.0010264196,0.00023608223,0.00022355802,0.00021356951,0.0005313474,0.019629188],"genre_scores_gemma":[0.3483035,0.00116758,0.6149246,0.001000797,0.00060067984,0.0012748927,0.00069715,0.0004764199,0.031554338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934541,0.0020418526,0.00039095368,0.00117159,0.0021177258,0.0008238186],"domain_scores_gemma":[0.9933776,0.0018584104,0.00038263778,0.0030057796,0.0008464017,0.0005291857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005656064,0.0010001818,0.0013949402,0.0010402709,0.0027481606,0.00546921,0.007925616,0.002892725,0.009001664],"category_scores_gemma":[0.010016218,0.0010177734,0.001793156,0.0018894764,0.0040108534,0.009815192,0.008448247,0.008503485,0.00296789],"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.000022168339,0.00001974086,0.000040865176,0.00003753624,0.0000071303957,0.00003142171,0.00007856533,0.0038069692,0.00033185713,0.99008465,0.0012026537,0.004336511],"study_design_scores_gemma":[0.00003022654,0.000035369798,0.00006106919,0.000048701793,0.000026333853,0.00012379934,0.00006258463,0.09073285,0.0010472976,0.8812124,0.02658278,0.000036630212],"about_ca_topic_score_codex":0.0018279429,"about_ca_topic_score_gemma":0.0019968941,"teacher_disagreement_score":0.009001664,"about_ca_system_score_codex":0.004783748,"about_ca_system_score_gemma":0.0044821887,"threshold_uncertainty_score":0.03470868},"labels":[],"label_agreement":null},{"id":"W2156139008","doi":"10.1016/j.tcs.2012.02.030","title":"State complexity of combined operations with two basic operations","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"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":"State (computer science); Component (thermodynamics); Upper and lower bounds; Computer science; Computational complexity theory; Mathematics; Theoretical computer science; Algorithm","score_opus":0.020934576738689207,"score_gpt":0.2652000572899269,"score_spread":0.2442654805512377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156139008","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.78378123,0.0002854152,0.1955146,0.0009941731,0.000073540854,0.00010270842,0.00084958825,0.00042410585,0.017974779],"genre_scores_gemma":[0.98273736,0.000094947056,0.013737904,0.00004946242,0.00006461232,0.000086808,0.00040843114,0.00007595098,0.0027444132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972012,0.0005816575,0.00021313321,0.00053021894,0.0009231054,0.0005507469],"domain_scores_gemma":[0.97518075,0.019739697,0.00092524453,0.0020182042,0.0011750854,0.0009610961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014916684,0.0005777855,0.0012156223,0.0013264392,0.0012784292,0.005558253,0.0017634598,0.0017629126,0.010792725],"category_scores_gemma":[0.012277385,0.000599128,0.0016780277,0.0016725631,0.0025301906,0.011633482,0.0029096734,0.002515856,0.00055360544],"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.001676141,0.00035162905,0.0037871,0.0002818302,0.000108435146,0.00032640056,0.0009398212,0.08513379,0.010387863,0.86427987,0.0028359403,0.029891193],"study_design_scores_gemma":[0.00007847373,0.00011935543,0.0013649461,0.000017288572,0.000074951735,0.0001267162,0.00015709248,0.313154,0.0056531136,0.6783517,0.0008486656,0.000053626212],"about_ca_topic_score_codex":0.0017446473,"about_ca_topic_score_gemma":0.0015955293,"teacher_disagreement_score":0.010792725,"about_ca_system_score_codex":0.0019548147,"about_ca_system_score_gemma":0.001647333,"threshold_uncertainty_score":0.036105275},"labels":[],"label_agreement":null},{"id":"W2156204758","doi":"10.1016/j.tcs.2004.09.038","title":"Aspects of shuffle and deletion on trajectories","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Decidability; Word (group theory); Context (archaeology); Generalization; Variable (mathematics); Sequence (biology); Constraint (computer-aided design); Focus (optics); Catenation; Binary number; Computer science; Palindrome; Context-free language; Quotient; Integer (computer science); Morphism; Mathematics; Algorithm; Discrete mathematics; Arithmetic; Combinatorics; Artificial intelligence; Programming language; Rule-based machine translation","score_opus":0.007725269626223187,"score_gpt":0.2393898409633678,"score_spread":0.2316645713371446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156204758","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.4954807,0.0015583355,0.42857373,0.004642328,0.0003251848,0.00010520892,0.0005431563,0.00058306183,0.06818824],"genre_scores_gemma":[0.95840263,0.0009632851,0.02277018,0.0002063127,0.0001780412,0.000087223096,0.0003042255,0.0002651974,0.016822943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921155,0.00022148757,0.000041824806,0.00011458342,0.00025559595,0.0001549545],"domain_scores_gemma":[0.9944218,0.0034447159,0.0004360515,0.0007457632,0.00043138236,0.0005203747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215326,0.00051356107,0.0009798692,0.0014922901,0.002300616,0.0028643992,0.0018496404,0.0021105444,0.0077486997],"category_scores_gemma":[0.010388564,0.00046831803,0.0009535022,0.0019694553,0.0037513662,0.006325822,0.0025930197,0.0022028973,0.0005106722],"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.00003437207,0.0000091334205,0.00016778175,0.000013851384,0.0000034975155,0.000053789456,0.00010693333,0.008745191,0.00027138618,0.987608,0.00046924702,0.002516688],"study_design_scores_gemma":[0.000010800966,0.0000105625095,0.00010013368,0.0000069668204,0.0000031160462,0.000059058253,0.00005666684,0.031686567,0.00032865195,0.96666145,0.0010683925,0.0000075143457],"about_ca_topic_score_codex":0.0036632335,"about_ca_topic_score_gemma":0.0015348018,"teacher_disagreement_score":0.0077486997,"about_ca_system_score_codex":0.0014592091,"about_ca_system_score_gemma":0.0010373999,"threshold_uncertainty_score":0.02592194},"labels":[],"label_agreement":null},{"id":"W2156537685","doi":"10.1016/j.tcs.2015.04.004","title":"On the expressivity of time-varying graphs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Research Institute for Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Rendering (computer graphics); Algebraic number; Theoretical computer science; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.017447829726501374,"score_gpt":0.24559491417567908,"score_spread":0.2281470844491777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156537685","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.08906217,0.0012758893,0.8797716,0.0019461437,0.00014149971,0.00004080465,0.0004529014,0.00047103525,0.026838003],"genre_scores_gemma":[0.9065678,0.0022079821,0.07494844,0.0007350751,0.00039949338,0.00012994703,0.0007116074,0.00037098388,0.013928531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983304,0.00065464695,0.00009304006,0.00037187268,0.00034972557,0.00020026151],"domain_scores_gemma":[0.9864189,0.010526205,0.0009775264,0.0009231454,0.0008075148,0.00034675034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026932058,0.0009928033,0.0008341872,0.0015562307,0.0008183484,0.0027598513,0.001985904,0.0012725324,0.0040062615],"category_scores_gemma":[0.01375995,0.00069094537,0.0011352856,0.001819549,0.0028393515,0.0066408804,0.0021681169,0.0037725717,0.00050784566],"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.000036569865,0.0000144107835,0.00018712568,0.00003717191,0.000012824113,0.00006931949,0.00021284694,0.01827701,0.0008466673,0.9750404,0.0006855935,0.0045800745],"study_design_scores_gemma":[0.000009726158,0.000014299472,0.0000895712,0.000014957817,0.000012232969,0.00004635809,0.000040029696,0.10269777,0.00025771337,0.8956823,0.001125261,0.0000098127675],"about_ca_topic_score_codex":0.0026404408,"about_ca_topic_score_gemma":0.0016330618,"teacher_disagreement_score":0.0040062615,"about_ca_system_score_codex":0.0018095322,"about_ca_system_score_gemma":0.0005466085,"threshold_uncertainty_score":0.0142431855},"labels":[],"label_agreement":null},{"id":"W2157637221","doi":"10.1016/j.tcs.2004.09.008","title":"Mergible states in large NFA","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Parameterized complexity; Regular language; Constant (computer programming); Automaton; Deterministic finite automaton; Nondeterministic finite automaton; Mathematics; Finite-state machine; Deterministic automaton; Discrete mathematics; Büchi automaton; State (computer science); Computer science; Combinatorics; Algorithm; Theoretical computer science; Automata theory; Programming language","score_opus":0.005756027207093133,"score_gpt":0.23843631340741395,"score_spread":0.2326802862003208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157637221","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.6709726,0.00051378075,0.29068506,0.0015707391,0.00012015867,0.0001065275,0.0004477392,0.0013582426,0.03422513],"genre_scores_gemma":[0.9642668,0.0001138164,0.027587853,0.00012851156,0.00006251445,0.00012066271,0.00023783397,0.00015623168,0.0073256795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988644,0.00031985942,0.00011096983,0.00025905945,0.0002502674,0.00019544768],"domain_scores_gemma":[0.9851467,0.0108488295,0.0008196963,0.0015740681,0.0008979631,0.0007127563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017004336,0.00040116502,0.0010436976,0.0017119412,0.002778736,0.0035954334,0.0010543122,0.001695319,0.0076587903],"category_scores_gemma":[0.010676942,0.00078138465,0.0009339533,0.001091854,0.004654896,0.00902314,0.002578562,0.0023607363,0.00059887796],"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.00007417554,0.000035248522,0.0009972815,0.00003979907,0.00000768777,0.00024325143,0.0008678954,0.0032374968,0.0013173559,0.9882377,0.00046665163,0.0044754385],"study_design_scores_gemma":[0.000013098722,0.000007732124,0.00012654191,0.000009134419,0.000007697823,0.00006792512,0.00015701559,0.010672881,0.00043601388,0.9877517,0.0007411578,0.000009074734],"about_ca_topic_score_codex":0.0021785744,"about_ca_topic_score_gemma":0.0031648038,"teacher_disagreement_score":0.0076587903,"about_ca_system_score_codex":0.0014070892,"about_ca_system_score_gemma":0.0008600738,"threshold_uncertainty_score":0.025621176},"labels":[],"label_agreement":null},{"id":"W2158592145","doi":"10.1016/j.tcs.2007.10.029","title":"A characterization of fine words over a finite alphabet","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Lexicographical order; Word (group theory); Prefix; Characterization (materials science); Mathematics; Alphabet; Combinatorics; Aperiodic graph; Combinatorics on words; Discrete mathematics; Linguistics","score_opus":0.006842940091432575,"score_gpt":0.23709594725084926,"score_spread":0.23025300715941668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158592145","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.5419572,0.0009549468,0.38735285,0.0015648697,0.00022132376,0.00011645865,0.0011001049,0.0010621803,0.065670095],"genre_scores_gemma":[0.9480259,0.00027105043,0.03284175,0.0002973936,0.00022241211,0.0000924137,0.0008225836,0.00022117134,0.017205281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927384,0.00011586339,0.000068728536,0.00023155237,0.00015875783,0.00015124526],"domain_scores_gemma":[0.9954336,0.0025338242,0.0005926314,0.00050501083,0.00044074992,0.0004942327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005746054,0.0005255272,0.00073605106,0.0022696361,0.0019254147,0.003612795,0.00091702555,0.0012480227,0.0077202213],"category_scores_gemma":[0.004260267,0.0006098002,0.00070471247,0.0018010939,0.0025992424,0.005459852,0.002026979,0.0018597993,0.0010816539],"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.0001322949,0.000041967658,0.0014576067,0.00010305761,0.000010384981,0.0003834459,0.0011587836,0.0013661733,0.0073742764,0.9718056,0.0013376503,0.014828915],"study_design_scores_gemma":[0.000015466538,0.000070018534,0.0010702298,0.00004856527,0.000018427127,0.0006723514,0.0005418538,0.008706481,0.0024146517,0.9763248,0.010082877,0.00003427444],"about_ca_topic_score_codex":0.00046909612,"about_ca_topic_score_gemma":0.00041438444,"teacher_disagreement_score":0.0077202213,"about_ca_system_score_codex":0.0007471431,"about_ca_system_score_gemma":0.00039877417,"threshold_uncertainty_score":0.025826752},"labels":[],"label_agreement":null},{"id":"W2159035200","doi":"10.1016/j.tcs.2010.04.007","title":"Active learning in heteroscedastic noise","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Nemzeti Kutatási és Technológiai Hivatal; Magyar Tudományos Akadémia; Hungarian Scientific Research Fund","keywords":"Logarithm; Mathematics; Asymptotically optimal algorithm; Variance (accounting); Heteroscedasticity; Conjecture; Sample (material); Simple (philosophy); Distribution (mathematics); Sample size determination; Mathematical optimization; Applied mathematics; Statistics; Discrete mathematics; Mathematical analysis","score_opus":0.004437595498572343,"score_gpt":0.24734009686251593,"score_spread":0.2429025013639436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159035200","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.016898124,0.00074886985,0.97998273,0.00068300904,0.00010698959,0.000017042996,0.000066343215,0.00010766113,0.0013892622],"genre_scores_gemma":[0.859963,0.0018629082,0.11484327,0.0007774068,0.0010570029,0.00023120291,0.00046835007,0.00020740298,0.02058941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667645,0.0017343801,0.00013686079,0.0006845148,0.0005409089,0.0002268683],"domain_scores_gemma":[0.9558126,0.039356366,0.0011966829,0.0017552229,0.0013966839,0.00048243414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008740218,0.0009609798,0.0023000052,0.0010102951,0.00069615635,0.002875768,0.003224617,0.0028170445,0.0024471693],"category_scores_gemma":[0.037632417,0.0012568466,0.0010077707,0.0012504274,0.0038362683,0.005430602,0.0028143667,0.003386,0.0005323835],"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.00035169235,0.00011023594,0.0019543022,0.00026240977,0.00021613007,0.00017820224,0.0002479508,0.44059986,0.001210398,0.50946033,0.0021542627,0.043254282],"study_design_scores_gemma":[0.00002496123,0.000023270504,0.00018557369,0.000012763181,0.000020719748,0.000021668455,0.000010184296,0.8496784,0.00024503627,0.14932184,0.00044415655,0.000011480516],"about_ca_topic_score_codex":0.0024431602,"about_ca_topic_score_gemma":0.0021822813,"teacher_disagreement_score":0.008740218,"about_ca_system_score_codex":0.0012682696,"about_ca_system_score_gemma":0.0009881341,"threshold_uncertainty_score":0.046223223},"labels":[],"label_agreement":null},{"id":"W2161403911","doi":"10.1016/j.tcs.2007.07.015","title":"Adaptive searching in succinctly encoded binary relations and tree-structured documents","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Conjunctive query; Binary relation; Binary number; XML; Intersection (aeronautics); Theoretical computer science; Representation (politics); Binary tree; Information retrieval; Relation (database); Data mining; Mathematics; Algorithm; Discrete mathematics; Relational database; World Wide Web","score_opus":0.008911253992056412,"score_gpt":0.2664774614759441,"score_spread":0.2575662074838877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161403911","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.30967793,0.0018589683,0.6810802,0.00081191596,0.00015094147,0.00010390651,0.00080390606,0.001829578,0.0036826832],"genre_scores_gemma":[0.5967364,0.000902395,0.39379847,0.00026764147,0.00010659503,0.00011491789,0.00152975,0.00028635422,0.0062575783],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998728,0.0003104494,0.00011945913,0.00021028526,0.0005187551,0.000113098715],"domain_scores_gemma":[0.9917075,0.005622964,0.0005186466,0.0012819488,0.00071664073,0.00015230104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010450582,0.00035743735,0.001022231,0.0014804855,0.0005192635,0.0014764126,0.0014452464,0.0012952171,0.0022941455],"category_scores_gemma":[0.012698007,0.0004930085,0.00038272876,0.0037924824,0.00084597827,0.0039190357,0.0012677164,0.0010495256,0.0007205417],"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.002100033,0.00041316624,0.0031746314,0.0006075021,0.00009019712,0.0007540505,0.00086217985,0.2521647,0.04198977,0.1098618,0.01076541,0.57721657],"study_design_scores_gemma":[0.00006414483,0.00011493917,0.00050149055,0.000042482337,0.00003232308,0.00038745385,0.0001515852,0.9160029,0.01748573,0.06297778,0.0022140741,0.000025108986],"about_ca_topic_score_codex":0.0020271083,"about_ca_topic_score_gemma":0.0032263417,"teacher_disagreement_score":0.0022941455,"about_ca_system_score_codex":0.00082353404,"about_ca_system_score_gemma":0.00093418034,"threshold_uncertainty_score":0.007674694},"labels":[],"label_agreement":null},{"id":"W2161797215","doi":"10.1016/s0304-3975(99)00021-3","title":"Automata of asynchronous behaviors","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Automaton; Asynchronous communication; Computer science; Theoretical computer science; Programming language; Computer network","score_opus":0.01062701085896973,"score_gpt":0.2832916232939664,"score_spread":0.2726646124349967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161797215","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.11222906,0.0005899152,0.81076974,0.0009416055,0.0003354178,0.0001345077,0.0006312097,0.0017513507,0.072617166],"genre_scores_gemma":[0.9142424,0.00029635124,0.062383078,0.00020017677,0.00012798894,0.00022939767,0.00041184452,0.00023732777,0.021871518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990128,0.0002508951,0.00008944593,0.0002618333,0.00027678328,0.00010818149],"domain_scores_gemma":[0.99692494,0.0017478713,0.00019021408,0.0005479223,0.00044180907,0.00014709347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924688,0.00061984605,0.00054420397,0.0010842955,0.0012045257,0.0025867021,0.00081080827,0.0011609204,0.007344168],"category_scores_gemma":[0.0041235965,0.0005296834,0.00096262834,0.0007318273,0.0018934375,0.0039941897,0.0015634797,0.0018847999,0.0012287614],"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.000028452143,0.000015403328,0.0002263779,0.000027321272,0.000006015554,0.000091425165,0.00033050717,0.0024131772,0.0016994566,0.98941725,0.00052603503,0.0052185305],"study_design_scores_gemma":[0.000023645154,0.000020855874,0.0001926376,0.000015739655,0.000019562482,0.0001272356,0.00009817259,0.030114355,0.0023535225,0.9581799,0.008839596,0.000014755515],"about_ca_topic_score_codex":0.0008504522,"about_ca_topic_score_gemma":0.00082727155,"teacher_disagreement_score":0.007344168,"about_ca_system_score_codex":0.0010176324,"about_ca_system_score_gemma":0.0006387712,"threshold_uncertainty_score":0.024568677},"labels":[],"label_agreement":null},{"id":"W2162312358","doi":"10.1016/j.tcs.2008.11.008","title":"Local edge colouring of Yao-like subgraphs of Unit Disk Graphs","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; University of Ottawa; Université du Québec en Outaouais","funders":"","keywords":"Combinatorics; Mathematics; Unit disk graph; Unit disk; Graph; Discrete mathematics; Partition (number theory); Constant (computer programming); Locality; Computer science","score_opus":0.021918745402650586,"score_gpt":0.27866484541387604,"score_spread":0.25674610001122544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162312358","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.9614497,0.0001433523,0.028645916,0.00026661504,0.00001401905,0.000026147607,0.000152436,0.00013961073,0.0091623245],"genre_scores_gemma":[0.9844141,0.00010263949,0.010709263,0.00006651496,0.0000145912045,0.000042872194,0.00027144482,0.00007225131,0.004306463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997019,0.00009794209,0.000014215938,0.00007560321,0.000050955085,0.00005935754],"domain_scores_gemma":[0.9974171,0.0011988692,0.00046165238,0.00032362784,0.00024365309,0.00035511173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033777664,0.00022777363,0.00060685835,0.00087800436,0.0012321145,0.0014221579,0.0009869528,0.00082480744,0.004572729],"category_scores_gemma":[0.0028637198,0.0003869003,0.00029779345,0.001058514,0.0010804007,0.001982817,0.0011017638,0.00082578225,0.00032905606],"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.0010889601,0.00019127388,0.010022007,0.000307162,0.000048862526,0.0006479947,0.0017889771,0.030357797,0.050612826,0.87463415,0.003721303,0.026578667],"study_design_scores_gemma":[0.00015033338,0.00013252712,0.00686529,0.00005544535,0.000078610894,0.0005575573,0.0009059145,0.10575804,0.013766137,0.86708844,0.0045949924,0.00004673265],"about_ca_topic_score_codex":0.0010254268,"about_ca_topic_score_gemma":0.0019022912,"teacher_disagreement_score":0.004572729,"about_ca_system_score_codex":0.00060004694,"about_ca_system_score_gemma":0.0002980951,"threshold_uncertainty_score":0.015297294},"labels":[],"label_agreement":null},{"id":"W2162572810","doi":"10.1016/s0304-3975(99)00277-7","title":"Shuffle and scattered deletion closure of languages","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Closure (psychology); Computer science; Programming language; Mathematics; Linguistics; Combinatorics; Philosophy; Political science","score_opus":0.004512639951644926,"score_gpt":0.24192520145966326,"score_spread":0.23741256150801834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162572810","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.5115188,0.000595488,0.44315335,0.0014578823,0.00023464079,0.00008936602,0.0005862737,0.0012565455,0.04110773],"genre_scores_gemma":[0.95076054,0.00023404286,0.031353097,0.00035225053,0.0001566152,0.000121323545,0.00047704508,0.0004730141,0.016071938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980562,0.0004012576,0.00017272972,0.00046422787,0.00044007998,0.0004654971],"domain_scores_gemma":[0.99124616,0.005128079,0.00063809234,0.0013354863,0.00082722283,0.000824931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020599284,0.00067740143,0.0016287349,0.0017330709,0.0033598167,0.003866692,0.0016838755,0.0013412564,0.006853005],"category_scores_gemma":[0.0092770895,0.0008032898,0.0016078707,0.0018925427,0.0046634357,0.009589749,0.00502745,0.0033663407,0.00086553185],"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.00012259673,0.000024944262,0.00024082013,0.000030217292,0.0000076744645,0.00019013904,0.0005104272,0.0013908003,0.0010825761,0.98967654,0.0006429873,0.006080267],"study_design_scores_gemma":[0.000028929535,0.000022402262,0.00008935875,0.000008183907,0.000008167658,0.00020640974,0.00011583783,0.0033321201,0.0012298283,0.99341655,0.0015282846,0.000013990556],"about_ca_topic_score_codex":0.0010208951,"about_ca_topic_score_gemma":0.0008482287,"teacher_disagreement_score":0.006853005,"about_ca_system_score_codex":0.0014055569,"about_ca_system_score_gemma":0.0011258096,"threshold_uncertainty_score":0.022925615},"labels":[],"label_agreement":null},{"id":"W2162678883","doi":"10.1016/j.tcs.2009.07.010","title":"A new approach to the periodicity lemma on strings with holes","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Substring; Lemma (botany); Mathematics; String (physics); Combinatorics; Discrete mathematics; Computer science; Data structure","score_opus":0.012621170148108091,"score_gpt":0.2370631779968014,"score_spread":0.2244420078486933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162678883","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.02178528,0.0015017152,0.9385207,0.0025533114,0.0012213092,0.00007228839,0.00022733229,0.00055470626,0.03356339],"genre_scores_gemma":[0.43444195,0.0036472715,0.51249355,0.0036249966,0.00588975,0.00046532298,0.0008037209,0.0016185393,0.037014965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774545,0.0006086088,0.00016792414,0.00047872728,0.00076795573,0.00023122312],"domain_scores_gemma":[0.9935888,0.003424909,0.00036208172,0.0017511526,0.0006005877,0.0002723834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020868608,0.0009273289,0.0016313446,0.0033409533,0.0020074788,0.0036042025,0.0024367105,0.0023820389,0.0077829],"category_scores_gemma":[0.009965455,0.00086660136,0.0018030145,0.0031831644,0.004630272,0.013742393,0.0064865025,0.0054825805,0.0017250035],"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.00004396252,0.000020522844,0.0001655032,0.000060307277,0.000010485643,0.00014253396,0.00014372806,0.0011972331,0.0018160398,0.9775229,0.002758346,0.016118478],"study_design_scores_gemma":[0.000017751665,0.000034474815,0.0001268095,0.000028295752,0.00001603974,0.00029955397,0.00004941314,0.02063919,0.0011803735,0.9678648,0.009719085,0.00002428013],"about_ca_topic_score_codex":0.00043828474,"about_ca_topic_score_gemma":0.00046366444,"teacher_disagreement_score":0.0077829,"about_ca_system_score_codex":0.0009928936,"about_ca_system_score_gemma":0.0007630567,"threshold_uncertainty_score":0.026036441},"labels":[],"label_agreement":null},{"id":"W2163134916","doi":"10.1016/j.tcs.2015.09.025","title":"Fast rendezvous with advice","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"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","keywords":"Rendezvous; Computer science; Oracle; Advice (programming); Set (abstract data type); Node (physics); Upper and lower bounds; Integer (computer science); String (physics); Algorithm; Mathematics","score_opus":0.01677587884675006,"score_gpt":0.25703540298749517,"score_spread":0.2402595241407451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163134916","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.107675426,0.0008272554,0.8055499,0.0012774038,0.00073822035,0.0002494312,0.00089314533,0.03579978,0.046989396],"genre_scores_gemma":[0.6306136,0.00028979796,0.32826447,0.00032674687,0.00014302925,0.00017351923,0.0009591762,0.0031083534,0.036121305],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851245,0.0002659301,0.00006198094,0.00027023954,0.0005636225,0.00032579582],"domain_scores_gemma":[0.9951821,0.0018855343,0.000118496995,0.0020731029,0.0005746955,0.00016610877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012673059,0.0012059882,0.0013567874,0.0011076359,0.0014430027,0.0012907246,0.0016659494,0.001693833,0.023292786],"category_scores_gemma":[0.011450511,0.00062237616,0.000739351,0.00095638825,0.0012971183,0.0024104468,0.0035954795,0.0018565429,0.005891641],"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.0042210105,0.00020572162,0.003943278,0.0006989734,0.00021642026,0.0009663183,0.0011791522,0.08708825,0.032357726,0.12817308,0.0713514,0.6695986],"study_design_scores_gemma":[0.000584448,0.00026299758,0.0010247726,0.00014497619,0.00014680254,0.0006349189,0.00049151195,0.67394555,0.038315095,0.22874932,0.055607144,0.000092493385],"about_ca_topic_score_codex":0.006025072,"about_ca_topic_score_gemma":0.008573192,"teacher_disagreement_score":0.023292786,"about_ca_system_score_codex":0.00065608294,"about_ca_system_score_gemma":0.0012495434,"threshold_uncertainty_score":0.077922106},"labels":[],"label_agreement":null},{"id":"W2163285607","doi":"10.1016/s0304-3975(02)00398-5","title":"Periodicity, morphisms, and matrices","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Conjecture; Iterated function; Combinatorics; Constant (computer programming); Word (group theory); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.006621511833063064,"score_gpt":0.22147273379972024,"score_spread":0.21485122196665718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163285607","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.38838091,0.014803793,0.47517875,0.0058220997,0.0012884843,0.00007241009,0.0005610585,0.0007285468,0.113163956],"genre_scores_gemma":[0.91671854,0.003066133,0.053779934,0.0003931616,0.0010349813,0.00011348539,0.00029224635,0.000093009214,0.024508419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913114,0.00028044602,0.000063377694,0.00025962386,0.00016964681,0.000095874224],"domain_scores_gemma":[0.99751943,0.0015187118,0.00025266482,0.0003694496,0.00017053643,0.00016921993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010929015,0.0004119604,0.00068348314,0.001298799,0.0013696745,0.002277218,0.00047375314,0.0009843905,0.005056473],"category_scores_gemma":[0.0036670973,0.00045909648,0.00058709737,0.001352664,0.004265319,0.0061969617,0.0014149062,0.0015540288,0.00079324027],"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.00003652347,0.000012685952,0.00022401797,0.000033185202,0.000003496564,0.00004989249,0.00027207128,0.00051153963,0.00067836826,0.9861123,0.00098927,0.011076663],"study_design_scores_gemma":[0.000006321171,0.00001323298,0.0001318313,0.0000063337043,0.0000029279056,0.00007298622,0.000050232687,0.0012817755,0.00018900393,0.9956524,0.0025862334,0.0000067796473],"about_ca_topic_score_codex":0.0006452245,"about_ca_topic_score_gemma":0.0006351365,"teacher_disagreement_score":0.005056473,"about_ca_system_score_codex":0.00073593465,"about_ca_system_score_gemma":0.00056874036,"threshold_uncertainty_score":0.01691556},"labels":[],"label_agreement":null},{"id":"W2163677685","doi":"10.1016/s0304-3975(99)00100-0","title":"Using DNA to solve the Bounded Post Correspondence Problem","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"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":"Bounded function; Mathematics; Combinatorics; DNA; Discrete mathematics; Algorithm; Computer science; Algebra over a field; Genetics; Biology; Pure mathematics","score_opus":0.01483284745428979,"score_gpt":0.2743296738512333,"score_spread":0.2594968263969435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163677685","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.10190852,0.00019568607,0.87642527,0.0015117951,0.00021826237,0.00006768446,0.000107989705,0.0006912313,0.018873554],"genre_scores_gemma":[0.62191516,0.00018628179,0.35864243,0.00045754111,0.0001559359,0.00019177754,0.00033555445,0.00034525685,0.017770065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922323,0.00027986272,0.00003177431,0.0001665212,0.00018528641,0.00011327854],"domain_scores_gemma":[0.996393,0.0027506263,0.00014073828,0.00039325544,0.00020853714,0.000113805196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011054112,0.0005956142,0.00094427087,0.0005906907,0.001197705,0.0014536711,0.0014685238,0.0020629643,0.007294358],"category_scores_gemma":[0.0075711156,0.000395228,0.0007510064,0.00079795136,0.0019386461,0.0033686066,0.0027994544,0.0024410007,0.0011496274],"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.00045848967,0.00020229166,0.0004859428,0.00022577705,0.00003569414,0.00021735784,0.00026280907,0.15245868,0.0062656817,0.73939604,0.0059416355,0.09404958],"study_design_scores_gemma":[0.00008413405,0.00006736162,0.00005822251,0.000013195303,0.000009404857,0.0000344855,0.00005225995,0.27893528,0.004264847,0.7134947,0.0029707502,0.000015420532],"about_ca_topic_score_codex":0.0011394623,"about_ca_topic_score_gemma":0.0012814605,"teacher_disagreement_score":0.007294358,"about_ca_system_score_codex":0.0007530646,"about_ca_system_score_gemma":0.0013281622,"threshold_uncertainty_score":0.024402082},"labels":[],"label_agreement":null},{"id":"W2165037031","doi":"10.1016/j.tcs.2015.01.011","title":"On graphs that are not PCGs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Wheel graph; Vertex (graph theory); Graph; Path graph; Graph power; Pairwise comparison; Planar graph; Discrete mathematics; Line graph","score_opus":0.049060207401457154,"score_gpt":0.31182620543233247,"score_spread":0.2627659980308753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165037031","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.5945488,0.0016138469,0.19931953,0.0058804583,0.00060782116,0.00037273724,0.0020755855,0.00091066555,0.19467062],"genre_scores_gemma":[0.8616298,0.0013108453,0.065701865,0.0015527566,0.00047180618,0.0002822697,0.0037016515,0.0005935302,0.06475545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984755,0.00034386854,0.00006458308,0.00044478558,0.0002985568,0.0003726675],"domain_scores_gemma":[0.9887134,0.0059160786,0.0010487899,0.0020334464,0.0011893872,0.0010990396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010694325,0.0011123217,0.0015518501,0.0024987974,0.0039610695,0.003932087,0.0016262191,0.0024289237,0.01188311],"category_scores_gemma":[0.009135107,0.001183437,0.0013550023,0.0032309853,0.0032742382,0.008393005,0.003079387,0.003885551,0.0013159693],"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.00023041652,0.00007701818,0.001239723,0.00023364565,0.00003558034,0.00026938244,0.00047721606,0.0090162875,0.0018624631,0.96730053,0.006763011,0.012494778],"study_design_scores_gemma":[0.000022017452,0.000021591575,0.0004079307,0.0000465885,0.000020367746,0.00015198751,0.00020807936,0.010884035,0.0006779043,0.9829847,0.004563763,0.000011022892],"about_ca_topic_score_codex":0.004395576,"about_ca_topic_score_gemma":0.0066568977,"teacher_disagreement_score":0.01188311,"about_ca_system_score_codex":0.0019345484,"about_ca_system_score_gemma":0.0012208364,"threshold_uncertainty_score":0.03975296},"labels":[],"label_agreement":null},{"id":"W2166582984","doi":"10.1016/j.tcs.2009.05.007","title":"On the surface area of the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-star graph","year":2009,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Graph; Scroll; Node (physics); Surface (topology); Mathematics; Combinatorics; Computer science; Algorithm; Discrete mathematics; Geometry; Physics","score_opus":0.01527671044608049,"score_gpt":0.23081596269499186,"score_spread":0.21553925224891138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166582984","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.2708762,0.0032744736,0.22051811,0.005087093,0.0015814701,0.00022694543,0.012771877,0.0022685272,0.4833953],"genre_scores_gemma":[0.8405999,0.0026418488,0.044985045,0.00050227955,0.0009646208,0.00026684566,0.005632683,0.001700305,0.1027065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996375,0.00004455026,0.000009921754,0.00011402071,0.00012999921,0.000064022075],"domain_scores_gemma":[0.99892277,0.00046165797,0.00010133197,0.000085816384,0.00033540287,0.00009292194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030792266,0.00063931476,0.000599491,0.001866569,0.0005836083,0.0017680353,0.0007424138,0.0007961956,0.053738426],"category_scores_gemma":[0.0027822477,0.00018194402,0.00042363774,0.0010863101,0.00083000114,0.0016056569,0.0010197404,0.0009881053,0.010023351],"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.00037439112,0.00010666575,0.0050815493,0.00056700804,0.000055641907,0.0003852425,0.0005945087,0.019575737,0.038078867,0.7109146,0.06250317,0.16176258],"study_design_scores_gemma":[0.00008603384,0.00015961986,0.020956684,0.00030423613,0.00006680848,0.0012926378,0.00075679313,0.14759855,0.020769857,0.65883094,0.14907399,0.000103820574],"about_ca_topic_score_codex":0.0013639508,"about_ca_topic_score_gemma":0.0013515552,"teacher_disagreement_score":0.053738426,"about_ca_system_score_codex":0.0006867664,"about_ca_system_score_gemma":0.00036689514,"threshold_uncertainty_score":0.17977297},"labels":[],"label_agreement":null},{"id":"W2166846151","doi":"10.1016/j.tcs.2013.06.003","title":"State complexity of star of union and square of union on k regular languages","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Star (game theory); Square (algebra); Regular language; Mathematics; Component (thermodynamics); Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Algorithm; Automaton; Geometry; Physics","score_opus":0.011941278949197592,"score_gpt":0.24203050426044778,"score_spread":0.2300892253112502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166846151","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.95428795,0.00018999954,0.03504146,0.0012231009,0.000028090088,0.000046176894,0.0008564694,0.0003137122,0.008013001],"genre_scores_gemma":[0.994369,0.00005983087,0.00309196,0.000041624648,0.000027469427,0.00002957654,0.0004341874,0.000057133933,0.0018892231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768806,0.0005005547,0.00016996541,0.00048601054,0.0005097584,0.000645661],"domain_scores_gemma":[0.96395695,0.028426193,0.0018754499,0.002215154,0.001626004,0.0019001828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016340332,0.000407375,0.001463563,0.0010758645,0.0019547215,0.006220172,0.0018653326,0.0017927507,0.012558928],"category_scores_gemma":[0.017324544,0.00072591763,0.0015291848,0.0013788228,0.0028301924,0.010826432,0.0030480057,0.0026246621,0.00056382315],"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.003387987,0.0003358082,0.015817411,0.00035535925,0.0001226876,0.00050778885,0.003094336,0.119728565,0.007453255,0.82337475,0.00511845,0.020703629],"study_design_scores_gemma":[0.0001254991,0.00012083294,0.003083996,0.000022843988,0.000069852555,0.00015171798,0.0005970209,0.39914373,0.0034389128,0.5924264,0.00075321714,0.00006592431],"about_ca_topic_score_codex":0.006528023,"about_ca_topic_score_gemma":0.006073799,"teacher_disagreement_score":0.012558928,"about_ca_system_score_codex":0.0031825108,"about_ca_system_score_gemma":0.0028157923,"threshold_uncertainty_score":0.042013824},"labels":[],"label_agreement":null},{"id":"W2167390667","doi":"10.1016/j.tcs.2007.05.009","title":"Formalization of the Standard Uniform random variable","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Random variable; HOL; Mathematics; Automated theorem proving; Correctness; Probabilistic logic; Random element; Algorithm; Random function; Convergence of random variables; Central limit theorem; Discrete mathematics; Computer science; Theoretical computer science; Calculus (dental); Statistics","score_opus":0.008524250274741239,"score_gpt":0.23561232784780017,"score_spread":0.22708807757305893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167390667","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.011737574,0.00068306306,0.9645573,0.0020818019,0.0003709778,0.000061863546,0.00034783068,0.00032806938,0.019831568],"genre_scores_gemma":[0.60396266,0.0019674702,0.36117974,0.0024592322,0.0020025629,0.00070897286,0.0007948661,0.00062383333,0.026300816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99417466,0.002197351,0.0003602116,0.0013319711,0.001433679,0.0005022007],"domain_scores_gemma":[0.98997694,0.0056237224,0.0007374103,0.0018830673,0.0013176064,0.00046134423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065891976,0.00077721156,0.0013444697,0.0023709137,0.0014950716,0.0048627565,0.0029507787,0.0019648606,0.008599564],"category_scores_gemma":[0.016929653,0.0007806341,0.0016717535,0.0021838974,0.0071589337,0.007716306,0.0038338872,0.0053948923,0.0014293799],"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.000005682275,0.0000043482296,0.000047340265,0.000008685441,0.00000286027,0.000011843748,0.000028053179,0.00041825735,0.000081353974,0.99792755,0.00026174053,0.0012020702],"study_design_scores_gemma":[0.000016303395,0.0000142083745,0.000077155535,0.000022417704,0.000012824573,0.0000830879,0.000020557343,0.013271592,0.00036011526,0.98154277,0.00456461,0.000014488111],"about_ca_topic_score_codex":0.0013536479,"about_ca_topic_score_gemma":0.0010792983,"teacher_disagreement_score":0.008599564,"about_ca_system_score_codex":0.0026468793,"about_ca_system_score_gemma":0.002339734,"threshold_uncertainty_score":0.03484744},"labels":[],"label_agreement":null},{"id":"W2168431435","doi":"10.1016/j.tcs.2009.08.031","title":"Theory of one-tape linear-time Turing machines","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Time hierarchy theorem; Turing machine; Probabilistic Turing machine; Non-deterministic Turing machine; DTIME; NSPACE; Super-recursive algorithm; Computer science; Nondeterministic algorithm; Time complexity; Universal Turing machine; NP; Description number; Theoretical computer science; PSPACE; Complexity class; Algorithm; Computational complexity theory; Computation","score_opus":0.007599579880102563,"score_gpt":0.23473991430566515,"score_spread":0.22714033442556258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168431435","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.081201516,0.005200962,0.5976272,0.01501475,0.0011726693,0.00019615948,0.0014656485,0.0013987031,0.2967223],"genre_scores_gemma":[0.85202503,0.0033469095,0.0807887,0.0018549556,0.0010200539,0.00043507066,0.0009290754,0.00029853333,0.05930163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998628,0.00037045695,0.00007572016,0.00019596986,0.00043155183,0.0002982879],"domain_scores_gemma":[0.99754286,0.0013061779,0.00013250149,0.00046832,0.0003374595,0.00021270946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011362518,0.00080667954,0.0014474088,0.0012772682,0.0026805305,0.0041567,0.003273267,0.0025824106,0.012540184],"category_scores_gemma":[0.0037638363,0.000685333,0.0012583511,0.0015089867,0.0052914442,0.007821811,0.0023408695,0.004690436,0.002257043],"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.0000070928145,0.0000062056847,0.00001721475,0.000024734123,0.0000019963338,0.000013611873,0.000042804648,0.00086569914,0.00009270269,0.99698985,0.0008557118,0.0010823729],"study_design_scores_gemma":[0.0000076063952,0.0000045449196,0.000015892705,0.000007942545,0.0000029994997,0.000018665367,0.000012749837,0.004590824,0.00015703903,0.99357283,0.0016033462,0.0000055479054],"about_ca_topic_score_codex":0.0012647122,"about_ca_topic_score_gemma":0.0009311443,"teacher_disagreement_score":0.012540184,"about_ca_system_score_codex":0.0028564907,"about_ca_system_score_gemma":0.0022077404,"threshold_uncertainty_score":0.04195112},"labels":[],"label_agreement":null},{"id":"W2170096365","doi":"10.1016/j.tcs.2014.10.044","title":"On a class of covering problems with variable capacities in wireless networks","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc 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 Lethbridge; Queen's University","funders":"","keywords":"Class (philosophy); Variable (mathematics); Computer science; Wireless; Wireless network; Mathematics; Theoretical computer science; Computer network; Telecommunications; Artificial intelligence","score_opus":0.005265615106788304,"score_gpt":0.1913742510683054,"score_spread":0.1861086359615171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170096365","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.05291928,0.005342117,0.88533413,0.004684223,0.00048270408,0.00049195235,0.0010823586,0.00048811652,0.049175188],"genre_scores_gemma":[0.6232471,0.014029914,0.3210733,0.0022734248,0.0034030597,0.0018784592,0.0024969482,0.00080384314,0.030793894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99488986,0.0028892865,0.00016147313,0.0006341956,0.0007143286,0.0007109539],"domain_scores_gemma":[0.98978055,0.008275802,0.0006134874,0.00053106603,0.00037692857,0.00042215467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034392835,0.0038939738,0.0027083587,0.0018903697,0.0023903253,0.004180959,0.0032351788,0.004355627,0.009617819],"category_scores_gemma":[0.013366802,0.0014961212,0.003448127,0.004835053,0.003357033,0.007508385,0.0038041128,0.0045012506,0.0010014533],"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.00020664731,0.00026037506,0.0006525963,0.00041407556,0.00018341577,0.00041695283,0.00032363556,0.58811927,0.00081177126,0.3603502,0.016209831,0.03205132],"study_design_scores_gemma":[0.00012638654,0.00012358178,0.00027534668,0.00011842023,0.00004573455,0.00027736666,0.00011252194,0.6362726,0.00025829786,0.35020983,0.012142528,0.000037345148],"about_ca_topic_score_codex":0.0045148586,"about_ca_topic_score_gemma":0.0026663672,"teacher_disagreement_score":0.009617819,"about_ca_system_score_codex":0.0034583171,"about_ca_system_score_gemma":0.0018057346,"threshold_uncertainty_score":0.032174766},"labels":[],"label_agreement":null},{"id":"W2170431684","doi":"10.1016/j.tcs.2013.11.031","title":"Fixed-orientation equilateral triangle matching of point sets","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Equilateral triangle; Combinatorics; Mathematics; General position; Vertex (graph theory); Discrete mathematics; Delaunay triangulation; Graph; Geometry","score_opus":0.009409666610581204,"score_gpt":0.2569229396507219,"score_spread":0.24751327304014067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170431684","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.073636815,0.0001513427,0.91111374,0.00010753996,0.0001086184,0.00017706196,0.00022706819,0.00058178755,0.013895944],"genre_scores_gemma":[0.575721,0.00024693628,0.41501445,0.0000771565,0.000031469255,0.00014815299,0.0007375499,0.00034175557,0.0076815044],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989999,0.00017589732,0.00007171903,0.00021796345,0.00042399764,0.00011060366],"domain_scores_gemma":[0.9989121,0.0002617999,0.00011673597,0.00034852553,0.00027452048,0.00008636687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006992402,0.00047915426,0.0010764612,0.0015472134,0.0006243376,0.0016247118,0.0021491721,0.0012412322,0.00702973],"category_scores_gemma":[0.005432299,0.00052492024,0.0006128302,0.0019938604,0.00079791824,0.0017689234,0.002482776,0.001349496,0.0017600106],"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.0008836275,0.00032548327,0.0026546775,0.00034705424,0.00007052865,0.0003811343,0.0004721157,0.12956896,0.03301217,0.28544226,0.0055608163,0.5412811],"study_design_scores_gemma":[0.000113643175,0.00025646354,0.0009950281,0.00007489375,0.000039553386,0.0003822294,0.00032980242,0.74180514,0.023378858,0.21767788,0.014901402,0.000045073575],"about_ca_topic_score_codex":0.0015557314,"about_ca_topic_score_gemma":0.0015107256,"teacher_disagreement_score":0.00702973,"about_ca_system_score_codex":0.0006915814,"about_ca_system_score_gemma":0.0005510324,"threshold_uncertainty_score":0.023516834},"labels":[],"label_agreement":null},{"id":"W2170840812","doi":"10.1016/j.tcs.2006.08.045","title":"The degree distribution of the generalized duplication model","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Degree distribution; Degree (music); Gene duplication; Combinatorics; Node (physics); Mathematics; Graph; Discrete mathematics; Preferential attachment; Complex network; Gene; Physics","score_opus":0.009081162169139182,"score_gpt":0.21888527224500479,"score_spread":0.2098041100758656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170840812","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.72462124,0.0018451108,0.23481649,0.006103196,0.00011307886,0.00009643659,0.00090185157,0.00053981744,0.030962734],"genre_scores_gemma":[0.98599374,0.0011035397,0.0049004573,0.00023257911,0.00017177706,0.000067148685,0.00027474752,0.00009095673,0.0071651367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913615,0.0003031351,0.000024169776,0.00020139205,0.00013920077,0.00019596414],"domain_scores_gemma":[0.99039185,0.006217735,0.0008691861,0.0009884856,0.0006820378,0.0008506878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023700148,0.0006257691,0.0015819994,0.0022435724,0.001088132,0.002887208,0.0034296922,0.0023199331,0.007776186],"category_scores_gemma":[0.016848689,0.00073521683,0.00083355315,0.0019707314,0.0032349022,0.0066548423,0.0018304199,0.0019732032,0.0010325423],"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.00012320017,0.0000332991,0.0019577176,0.0001165863,0.000037571564,0.00018615095,0.00033978903,0.08573427,0.001906701,0.8999115,0.0031435015,0.006509742],"study_design_scores_gemma":[0.000050641862,0.000021995167,0.0012469492,0.000028173192,0.00002349755,0.0002406429,0.000101399935,0.27698016,0.0003285297,0.719388,0.0015551134,0.00003500297],"about_ca_topic_score_codex":0.0034772097,"about_ca_topic_score_gemma":0.002182457,"teacher_disagreement_score":0.007776186,"about_ca_system_score_codex":0.002269826,"about_ca_system_score_gemma":0.0009760667,"threshold_uncertainty_score":0.02601391},"labels":[],"label_agreement":null},{"id":"W2171278552","doi":"10.1016/j.tcs.2011.06.012","title":"The Černý conjecture for one-cluster automata with prime length cycle","year":2011,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Conjecture; Prime (order theory); Combinatorics; Cluster (spacecraft); Automaton; Mathematics; Computer science; Theoretical computer science","score_opus":0.013767798483434209,"score_gpt":0.23932951504386277,"score_spread":0.22556171656042856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171278552","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.60718673,0.0020394726,0.22133838,0.029104393,0.0018475465,0.00019056088,0.0013522161,0.0019451153,0.1349956],"genre_scores_gemma":[0.96741307,0.0004739261,0.013535321,0.0015827796,0.00053292495,0.00013664727,0.0005682993,0.00024199476,0.015515036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760133,0.00044126218,0.00013890374,0.0009048108,0.00040848707,0.0005052394],"domain_scores_gemma":[0.9847075,0.009083053,0.00084580696,0.0030851061,0.0012832395,0.000995348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021932016,0.0006872418,0.0020642378,0.0009746468,0.004019967,0.0062641297,0.002021752,0.004310288,0.010143177],"category_scores_gemma":[0.0143958125,0.0009294894,0.0015968888,0.0012328323,0.0071038175,0.015872406,0.0039261733,0.005920575,0.0016243753],"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.00018020938,0.000044588745,0.00063877035,0.00013513982,0.000011788054,0.00012867196,0.00043886976,0.0034337977,0.00091542746,0.98532975,0.004356503,0.004386375],"study_design_scores_gemma":[0.000025826992,0.000009223734,0.000073152165,0.000011391138,0.0000056657273,0.000054342632,0.00008225872,0.0042160028,0.00043216202,0.99356294,0.0015155479,0.000011528052],"about_ca_topic_score_codex":0.0015686578,"about_ca_topic_score_gemma":0.0013774931,"teacher_disagreement_score":0.010143177,"about_ca_system_score_codex":0.0022448536,"about_ca_system_score_gemma":0.0020773297,"threshold_uncertainty_score":0.03393233},"labels":[],"label_agreement":null},{"id":"W2172943111","doi":"10.1016/j.tcs.2013.09.026","title":"Accelerated training of max-margin Markov networks with kernels","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; Google; University of Chicago; National Science Foundation","keywords":"Margin (machine learning); Computation; Markov chain; Convergence (economics); Projection (relational algebra); Computer science; Mathematical optimization; Euclidean geometry; Mathematics; Algorithm; Machine learning","score_opus":0.01849413291799128,"score_gpt":0.24994403962652262,"score_spread":0.23144990670853133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172943111","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.08312833,0.00067129906,0.9111667,0.000490939,0.00016008316,0.000052293464,0.00013092524,0.0017932456,0.002406159],"genre_scores_gemma":[0.80053234,0.00024182466,0.19252267,0.00024388566,0.00010358046,0.00012760349,0.0005209205,0.0002749693,0.0054322015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992747,0.0002847928,0.000043089396,0.00014908498,0.00014782917,0.00010051583],"domain_scores_gemma":[0.99654645,0.00223449,0.00016957353,0.00038736628,0.0004923054,0.00016993195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017450509,0.0007237987,0.0011166214,0.0003957147,0.00043351328,0.000786645,0.0019422123,0.0016266063,0.0044869194],"category_scores_gemma":[0.009165663,0.00066277286,0.000603349,0.00048791058,0.0006317054,0.002241831,0.0020723636,0.0023613474,0.0011009895],"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.000780051,0.0001727088,0.0011031306,0.00012429194,0.00006749997,0.00007820387,0.00009417331,0.7928193,0.0040374706,0.016140325,0.0037458732,0.1808369],"study_design_scores_gemma":[0.0000062149265,0.000011840888,0.000042847714,0.0000028226734,0.0000023767345,0.0000050223516,0.0000024343017,0.99741155,0.0003688213,0.002048761,0.00009563832,0.0000017217278],"about_ca_topic_score_codex":0.005918555,"about_ca_topic_score_gemma":0.008910596,"teacher_disagreement_score":0.005918555,"about_ca_system_score_codex":0.0009336922,"about_ca_system_score_gemma":0.0017349933,"threshold_uncertainty_score":0.015010238},"labels":[],"label_agreement":null},{"id":"W2172997278","doi":"10.1016/j.tcs.2012.03.044","title":"Approximation algorithms for orienting mixed graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Approximation algorithm; Undirected graph; Vertex (graph theory); Mathematics; Combinatorics; Graph; Directed graph; Mixed graph; Discrete mathematics; Algorithm; Computer science; Line graph; Voltage graph","score_opus":0.011063770892872771,"score_gpt":0.25410822685249945,"score_spread":0.24304445595962668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172997278","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.045112196,0.0010732907,0.9402706,0.0010522422,0.00013442547,0.0002010731,0.0007660378,0.0016050204,0.009785203],"genre_scores_gemma":[0.25684693,0.0011216769,0.72736025,0.0005773653,0.00022193018,0.0005993089,0.0031205795,0.0009593255,0.009192625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986927,0.00043761387,0.00006301792,0.00034210796,0.00027959223,0.00018502826],"domain_scores_gemma":[0.9919791,0.0055955756,0.0004273116,0.0011407991,0.00044369817,0.000413487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019098696,0.0026393735,0.002316976,0.0025253608,0.001213002,0.0031760533,0.0052476036,0.0026423777,0.012065312],"category_scores_gemma":[0.012766181,0.0014963505,0.0019691966,0.004298288,0.0015124953,0.007333802,0.00380647,0.004172528,0.002005593],"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.000692209,0.0005711901,0.002194482,0.00080033054,0.00018212206,0.0001748391,0.0005009563,0.46075618,0.0029005215,0.22962083,0.027181476,0.27442485],"study_design_scores_gemma":[0.0001025346,0.000056774337,0.00021407641,0.00005272279,0.00005861466,0.000074969365,0.000091498805,0.72382563,0.00077455555,0.27192208,0.0028116126,0.000014948954],"about_ca_topic_score_codex":0.0042529693,"about_ca_topic_score_gemma":0.006130766,"teacher_disagreement_score":0.012065312,"about_ca_system_score_codex":0.002829918,"about_ca_system_score_gemma":0.001469811,"threshold_uncertainty_score":0.040362537},"labels":[],"label_agreement":null},{"id":"W2173002974","doi":"10.1016/j.tcs.2015.02.017","title":"Strong connectivity of sensor networks with double antennae","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Wireless sensor network; Mathematics; Computer network","score_opus":0.0180973245174269,"score_gpt":0.24659175151804394,"score_spread":0.22849442700061703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173002974","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.3613303,0.003457916,0.61061555,0.00173202,0.0003546255,0.00008407629,0.00023762541,0.00027896263,0.021909047],"genre_scores_gemma":[0.98493516,0.0011195827,0.0106534455,0.00010173269,0.00013146394,0.00006133415,0.00007808705,0.000022201959,0.0028969755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923384,0.0003186883,0.000038723236,0.00014280678,0.00016538094,0.00010059237],"domain_scores_gemma":[0.99454236,0.0037167084,0.0005801796,0.00044126398,0.0004542739,0.00026514978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007693992,0.0004386975,0.0005896869,0.0009907235,0.00059722975,0.0011434528,0.00080431084,0.0007196053,0.0018485833],"category_scores_gemma":[0.007672116,0.00054223073,0.00031224647,0.0009927815,0.0011698272,0.0021486925,0.0020323126,0.0009698693,0.0002492192],"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.0011240471,0.00011487803,0.0076132957,0.0007427454,0.00017505804,0.0013688793,0.0007565285,0.425012,0.029952938,0.42286062,0.0062942305,0.10398477],"study_design_scores_gemma":[0.0001463891,0.0005094971,0.003388682,0.000088859524,0.00010628706,0.0012957717,0.0004082211,0.65260565,0.0055006286,0.32738113,0.008510347,0.000058597678],"about_ca_topic_score_codex":0.00026012518,"about_ca_topic_score_gemma":0.0003436987,"teacher_disagreement_score":0.0018485833,"about_ca_system_score_codex":0.0003523214,"about_ca_system_score_gemma":0.0002699003,"threshold_uncertainty_score":0.006184101},"labels":[],"label_agreement":null},{"id":"W2174018860","doi":"10.1016/j.tcs.2015.04.017","title":"State complexity of inversion operations","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Yonsei University","keywords":"Substring; Inversion (geology); Nondeterministic algorithm; Prefix; Upper and lower bounds; Computational complexity theory; Mathematics; Combinatorics; Algorithm; Computer science; Discrete mathematics; Data structure","score_opus":0.04010833710941971,"score_gpt":0.2705048822927333,"score_spread":0.23039654518331357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174018860","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.79878193,0.0004928241,0.15647843,0.0029947977,0.00009093936,0.00007677744,0.0008897104,0.00040552567,0.039789043],"genre_scores_gemma":[0.98985505,0.00017815178,0.005319376,0.00008968215,0.00008160079,0.00005497437,0.00039889003,0.00008308778,0.003939085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972441,0.0006430047,0.00017172002,0.00046143698,0.0008744998,0.0006053395],"domain_scores_gemma":[0.97465056,0.020235315,0.0010950214,0.0020276085,0.0012789449,0.00071242475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017137057,0.00053396454,0.0013263198,0.001527181,0.0015199946,0.0065498156,0.0018188683,0.0018434804,0.013432205],"category_scores_gemma":[0.016042434,0.0006999196,0.0015182456,0.0018192858,0.0029895015,0.0142524,0.0028981266,0.003940467,0.0007544858],"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.0002807246,0.00011061691,0.0016004697,0.00008163025,0.000026339725,0.00009923033,0.00058376,0.019527784,0.002211119,0.96172404,0.0014608146,0.012293424],"study_design_scores_gemma":[0.000025695892,0.00002704457,0.0005484026,0.000010487924,0.000023270251,0.00004698945,0.00009789885,0.07418456,0.0013797665,0.92312545,0.00050846365,0.000021907732],"about_ca_topic_score_codex":0.0021417232,"about_ca_topic_score_gemma":0.0017679066,"teacher_disagreement_score":0.013432205,"about_ca_system_score_codex":0.002361763,"about_ca_system_score_gemma":0.001878557,"threshold_uncertainty_score":0.044935226},"labels":[],"label_agreement":null},{"id":"W2174619083","doi":"10.1016/j.tcs.2012.07.033","title":"On the competitiveness of AIMD-TCP within a general network","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bottleneck; Computer science; Router; Competitive analysis; Scheduling (production processes); Multiplicative function; Computer network; Distributed computing; Set (abstract data type); Mathematical optimization; Upper and lower bounds; Mathematics","score_opus":0.016616668126334232,"score_gpt":0.2587536619840035,"score_spread":0.2421369938576693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174619083","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.6866076,0.006484038,0.14860597,0.014485009,0.00072027766,0.00029511517,0.0012985291,0.0011631706,0.1403403],"genre_scores_gemma":[0.97589386,0.0011620522,0.017587274,0.0004429083,0.00035114368,0.000110732035,0.00035819778,0.00033670836,0.0037571364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940813,0.0026636808,0.00014506647,0.0006955554,0.00089819613,0.0015161983],"domain_scores_gemma":[0.9186272,0.06747824,0.0023300431,0.003785927,0.0036543577,0.004124267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01143976,0.001273027,0.0032811002,0.0027450884,0.0030102432,0.006268224,0.0041194004,0.0031606006,0.0136747025],"category_scores_gemma":[0.061300695,0.00068223465,0.0013242005,0.0027603328,0.0043527167,0.008601524,0.0054697283,0.004653493,0.0011249305],"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.003971361,0.000495386,0.0066799386,0.0006899657,0.00022750592,0.00031586914,0.0005242729,0.52105474,0.0046573356,0.40389138,0.019327208,0.038165007],"study_design_scores_gemma":[0.00018789421,0.00033893107,0.0012633312,0.00007634317,0.000112525624,0.00019453293,0.0003512506,0.848144,0.0014579678,0.14484861,0.0029856584,0.00003901824],"about_ca_topic_score_codex":0.005054626,"about_ca_topic_score_gemma":0.004612284,"teacher_disagreement_score":0.0136747025,"about_ca_system_score_codex":0.0039381,"about_ca_system_score_gemma":0.0052536484,"threshold_uncertainty_score":0.060499907},"labels":[],"label_agreement":null},{"id":"W2174851824","doi":"10.1016/j.tcs.2012.01.035","title":"More efficient periodic traversal in anonymous undirected graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Tree traversal; Undirected graph; Combinatorics; Graph; Set (abstract data type); Node (physics); Computer science; Mathematics; Period length; Discrete mathematics; Time complexity; Integer (computer science); Binary logarithm; Algorithm","score_opus":0.010685658302965768,"score_gpt":0.2572362291670868,"score_spread":0.24655057086412105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174851824","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.55093354,0.0004992486,0.41277155,0.0016356289,0.00029374694,0.00021979702,0.0010804951,0.0033638082,0.029202059],"genre_scores_gemma":[0.7578777,0.00020888784,0.22653846,0.00028298175,0.00009862975,0.00011157377,0.0014339881,0.0004637224,0.012983971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895084,0.00028117764,0.00006488503,0.0002151889,0.00024576398,0.00024202738],"domain_scores_gemma":[0.99599046,0.001480084,0.0002973611,0.0017390742,0.00027297824,0.00022010924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010975339,0.00041788546,0.0009583073,0.0009493311,0.0009943661,0.0017427324,0.001498418,0.001009336,0.0097468775],"category_scores_gemma":[0.006227811,0.00042569847,0.0006778377,0.0016248572,0.0005696551,0.00366213,0.0014568336,0.0011212165,0.0010965221],"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.0020801432,0.0012422336,0.0047670933,0.0006115383,0.00013911838,0.0008042407,0.000990949,0.29860687,0.030374356,0.31245005,0.036978174,0.31095526],"study_design_scores_gemma":[0.00021114075,0.00020464347,0.00071860495,0.00003637081,0.000069799025,0.00034051848,0.000264194,0.78399223,0.007293672,0.19742595,0.009407923,0.000034963756],"about_ca_topic_score_codex":0.0029030377,"about_ca_topic_score_gemma":0.0077554155,"teacher_disagreement_score":0.0097468775,"about_ca_system_score_codex":0.001018125,"about_ca_system_score_gemma":0.0016133814,"threshold_uncertainty_score":0.032606542},"labels":[],"label_agreement":null},{"id":"W2176863542","doi":"10.1016/j.tcs.2007.03.023","title":"Powers in a class of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi mathvariant=\"script\">A</mml:mi></mml:math>-strict standard episturmian words","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"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":"Scroll; Class (philosophy); Mathematics; Algorithm; Computer science; Artificial intelligence; Theology; Philosophy","score_opus":0.010309950302254896,"score_gpt":0.2403761296158783,"score_spread":0.2300661793136234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176863542","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.16487244,0.0010308032,0.33948538,0.0020891044,0.0013273191,0.00022073113,0.0017777887,0.0015002146,0.48769617],"genre_scores_gemma":[0.7876108,0.00049521466,0.043541256,0.00056374137,0.0007040561,0.00022292312,0.0016598492,0.00079694984,0.1644051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986778,0.0002960765,0.00015700949,0.00035670446,0.00029388085,0.00021847393],"domain_scores_gemma":[0.9981723,0.0006330362,0.00016011922,0.00039300526,0.0004698784,0.00017160796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009527666,0.00059049565,0.0005058981,0.0011277787,0.002821137,0.0035000308,0.00070738746,0.000745296,0.02088369],"category_scores_gemma":[0.0027127839,0.0004356885,0.0007896801,0.0009944447,0.003519095,0.004851456,0.0020375194,0.0019276353,0.0060853907],"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.000040059655,0.000012445707,0.00020833727,0.00004123577,0.000005688786,0.00018139865,0.00053267315,0.00009658424,0.0012915788,0.9874164,0.0034212386,0.0067522554],"study_design_scores_gemma":[0.000024007339,0.000030425435,0.00049742253,0.000037278984,0.000015537096,0.0004973139,0.00037541083,0.0013682663,0.0030292748,0.9115572,0.08254065,0.000027076485],"about_ca_topic_score_codex":0.0008037572,"about_ca_topic_score_gemma":0.0010358233,"teacher_disagreement_score":0.02088369,"about_ca_system_score_codex":0.0008872709,"about_ca_system_score_gemma":0.0005312488,"threshold_uncertainty_score":0.06986284},"labels":[],"label_agreement":null},{"id":"W2179376195","doi":"10.1016/j.tcs.2012.07.004","title":"Gathering asynchronous oblivious agents with local vision in regular bipartite graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"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; Snapshot (computer storage); Asynchronous communication; Bipartite graph; Existential quantification; Theoretical computer science; Graph; Algorithm; Mathematics; Combinatorics; Computer network","score_opus":0.010246317737841494,"score_gpt":0.2581444462834714,"score_spread":0.2478981285456299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179376195","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.2141423,0.00017084672,0.7765846,0.0007429762,0.00004861025,0.00019000309,0.00011216492,0.00056850177,0.007440015],"genre_scores_gemma":[0.92086685,0.00010750242,0.073549576,0.00015854937,0.00004328781,0.00020154918,0.00012519318,0.00009780593,0.0048497026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871314,0.00053137314,0.000051898987,0.00028238757,0.00018537683,0.00023581227],"domain_scores_gemma":[0.99334407,0.0042779986,0.0007306016,0.0006601651,0.00041172802,0.00057538686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018746858,0.00083318393,0.0018082528,0.0010253296,0.0015032334,0.0018534572,0.0027075512,0.0019184356,0.0026689528],"category_scores_gemma":[0.010467876,0.00091611425,0.00084418623,0.0011109832,0.0017971275,0.003264669,0.003656932,0.0015328191,0.00044776895],"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.000970403,0.00033814058,0.0016131086,0.00031828837,0.00017356008,0.00036786043,0.0006531538,0.8060565,0.00818641,0.14469267,0.003223827,0.033406094],"study_design_scores_gemma":[0.000053754404,0.0000599879,0.000114817434,0.000006885276,0.000017931185,0.000027275926,0.000058089,0.93779045,0.0006915818,0.060895372,0.00027358104,0.000010359678],"about_ca_topic_score_codex":0.0031364905,"about_ca_topic_score_gemma":0.0037455661,"teacher_disagreement_score":0.0031364905,"about_ca_system_score_codex":0.0012591921,"about_ca_system_score_gemma":0.0012472116,"threshold_uncertainty_score":0.009914398},"labels":[],"label_agreement":null},{"id":"W2180483632","doi":"10.1016/j.tcs.2015.02.006","title":"Complexity of barrier coverage with relocatable sensors in the plane","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo; Concordia University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Minimax; Plane (geometry); Set (abstract data type); Perpendicular; Range (aeronautics); Time complexity; Computer science; Line (geometry); Mathematical optimization; Algorithm; Mathematics; Topology (electrical circuits); Combinatorics; Geometry; Engineering","score_opus":0.020268602013612684,"score_gpt":0.2532846675983693,"score_spread":0.23301606558475663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180483632","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.62797844,0.0014287637,0.31691912,0.0067011095,0.00018833554,0.0003498933,0.0042221695,0.0009407811,0.041271426],"genre_scores_gemma":[0.9437791,0.0009574011,0.04319604,0.00035337918,0.000176554,0.0002781945,0.001999975,0.00034907804,0.008910182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798137,0.0005815333,0.000094907075,0.00033852717,0.00049671374,0.0005069244],"domain_scores_gemma":[0.97623694,0.019832814,0.0013595261,0.00086782884,0.0006290702,0.0010738712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015098504,0.0012369356,0.00244944,0.0011671542,0.0013071235,0.004232689,0.0032285184,0.0031495343,0.01553787],"category_scores_gemma":[0.02114505,0.0011721362,0.0013444979,0.0019216276,0.0017916212,0.0058403816,0.0038236897,0.0025668703,0.00089140574],"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.001046693,0.000135542,0.0031016064,0.00044805818,0.00012123354,0.00042186008,0.00035970582,0.8689179,0.0022279376,0.1003186,0.00887815,0.014022678],"study_design_scores_gemma":[0.0001533448,0.000079243015,0.00071233994,0.00003138197,0.000048140068,0.00018262737,0.00021691674,0.88482714,0.00068484445,0.11189358,0.0011479848,0.00002247704],"about_ca_topic_score_codex":0.0072639296,"about_ca_topic_score_gemma":0.0035990633,"teacher_disagreement_score":0.01553787,"about_ca_system_score_codex":0.0022865215,"about_ca_system_score_gemma":0.0018912157,"threshold_uncertainty_score":0.051979303},"labels":[],"label_agreement":null},{"id":"W2180828828","doi":"10.1016/j.tcs.2013.05.037","title":"On approximating string selection problems with outliers","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; String (physics); Hamming distance; Combinatorics; Mathematics; Polynomial-time approximation scheme; Time complexity; Outlier; Edit distance; Selection (genetic algorithm); Approximation algorithm; Set (abstract data type); Randomized algorithm; Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Statistics","score_opus":0.006601948988134197,"score_gpt":0.20958767853864238,"score_spread":0.20298572955050817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180828828","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.018228326,0.0017183712,0.97653085,0.0012769802,0.00017996672,0.000062298015,0.000105033745,0.00031107714,0.0015871297],"genre_scores_gemma":[0.3215412,0.00397651,0.6590699,0.0011852394,0.001540439,0.0005957982,0.001667861,0.0006767048,0.009746414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99224514,0.0042004157,0.00045872014,0.0007968697,0.0019306754,0.00036828843],"domain_scores_gemma":[0.9322966,0.059052687,0.0018201389,0.0034398732,0.0025687737,0.00082196126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010678695,0.0020130994,0.004359384,0.0030453163,0.0014295656,0.0029964321,0.003970244,0.0049810903,0.0038681396],"category_scores_gemma":[0.070867755,0.0012177171,0.0013570834,0.0090319365,0.0037250463,0.008200152,0.005028247,0.005202569,0.0010593019],"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.0007225195,0.00025774734,0.0026563583,0.0004219719,0.00015337447,0.00026480446,0.00030401687,0.69476044,0.0014698029,0.11748773,0.007991207,0.17351],"study_design_scores_gemma":[0.00003026214,0.00006311251,0.00014616399,0.0000307753,0.000016745938,0.00006860677,0.000041702213,0.9260569,0.0005349352,0.07200523,0.0009950225,0.000010511902],"about_ca_topic_score_codex":0.0023247933,"about_ca_topic_score_gemma":0.0012082602,"teacher_disagreement_score":0.010678695,"about_ca_system_score_codex":0.0018404567,"about_ca_system_score_gemma":0.0015869191,"threshold_uncertainty_score":0.056474984},"labels":[],"label_agreement":null},{"id":"W2183729464","doi":"10.1016/j.tcs.2015.11.011","title":"Fast construction of wavelet trees","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wavelet; Computer science; Mathematics; Artificial intelligence; Algorithm","score_opus":0.014599212517948037,"score_gpt":0.2475569675169556,"score_spread":0.23295775499900756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183729464","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.016174383,0.00027053963,0.9801588,0.00011431555,0.000084205436,0.000036747922,0.00012832439,0.00058006524,0.0024526387],"genre_scores_gemma":[0.1476566,0.00062698603,0.8465113,0.000083738894,0.00008802004,0.00013111446,0.0006869818,0.00046468063,0.0037505038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993864,0.000126688,0.000040855917,0.000077243814,0.0002899472,0.000078732395],"domain_scores_gemma":[0.9985593,0.0005799023,0.00007786537,0.00034086275,0.0003387421,0.00010330687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006728685,0.0005983861,0.00086988154,0.0015432347,0.0005150813,0.0012246694,0.0007720304,0.00069377664,0.00449371],"category_scores_gemma":[0.00416009,0.0005528247,0.0007806486,0.0016602546,0.0004954103,0.0017309521,0.00220714,0.0017595155,0.0020195164],"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.00041806372,0.00009934136,0.0008422305,0.00035258825,0.00007420406,0.00031259583,0.0003851343,0.040623184,0.057457093,0.22387144,0.0124583915,0.6631057],"study_design_scores_gemma":[0.00013937322,0.00016443132,0.0007624575,0.00009249412,0.000056356144,0.000488841,0.00016781664,0.6289946,0.03679099,0.30491698,0.027377682,0.000047862053],"about_ca_topic_score_codex":0.00037534535,"about_ca_topic_score_gemma":0.00067027,"teacher_disagreement_score":0.00449371,"about_ca_system_score_codex":0.00040418448,"about_ca_system_score_gemma":0.0005576108,"threshold_uncertainty_score":0.015032947},"labels":[],"label_agreement":null},{"id":"W2189549633","doi":"10.1016/j.tcs.2017.01.030","title":"The within-strip discrete unit disk cover problem","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"STRIPS; Cardinality (data modeling); Cover (algebra); Set cover problem; Approximation algorithm; Unit disk; Set (abstract data type); Mathematics; Unit (ring theory); Plane (geometry); Combinatorics; Unit disk graph; Discrete mathematics; Algorithm; Computer science; Geometry; Telecommunications","score_opus":0.01477852363600524,"score_gpt":0.27497184750959625,"score_spread":0.260193323873591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189549633","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.36052564,0.002270595,0.5786805,0.004310184,0.00045317583,0.00022252754,0.002018342,0.00071133743,0.05080765],"genre_scores_gemma":[0.89346176,0.0011617494,0.08612925,0.000340028,0.00036358048,0.0001744335,0.001406085,0.00027615542,0.01668682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992747,0.00023411094,0.000027139313,0.00016831885,0.000170969,0.00012484798],"domain_scores_gemma":[0.9970728,0.0019781606,0.0001801238,0.00038307437,0.000120545505,0.00026531104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008081752,0.00063146185,0.0017350428,0.00063341844,0.00088331936,0.0022454807,0.0022590861,0.002624808,0.010128275],"category_scores_gemma":[0.005956448,0.00068218843,0.00052730774,0.0014166732,0.0012720338,0.0033765016,0.002078364,0.0016898223,0.00095439336],"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.0009889625,0.00028588888,0.0015930191,0.00082937547,0.0001259262,0.0006037447,0.00039442588,0.50917584,0.0045598694,0.33913755,0.03318288,0.109122515],"study_design_scores_gemma":[0.0001253587,0.00008567648,0.0005035366,0.000046165074,0.000030426047,0.00030637046,0.00022691477,0.76485693,0.0019463777,0.22515732,0.006694887,0.00002015332],"about_ca_topic_score_codex":0.0013458469,"about_ca_topic_score_gemma":0.0007805898,"teacher_disagreement_score":0.010128275,"about_ca_system_score_codex":0.00082822196,"about_ca_system_score_gemma":0.0005827575,"threshold_uncertainty_score":0.0338825},"labels":[],"label_agreement":null},{"id":"W2191739325","doi":"10.1016/j.tcs.2015.11.048","title":"Space-efficient algorithm for computing a centerpoint of a set of points in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">R</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math>","year":2015,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Set (abstract data type); Space (punctuation); Point (geometry); Computer science; Scroll; Mathematics; Geometry; Programming language","score_opus":0.021527318223237855,"score_gpt":0.256776298198295,"score_spread":0.23524897997505714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2191739325","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.005922134,0.00017445513,0.98538697,0.00015083441,0.000071311544,0.00012596235,0.00043052813,0.0034299633,0.0043078116],"genre_scores_gemma":[0.06579246,0.00013703671,0.9248798,0.000067646855,0.000028929348,0.00026333978,0.0017374734,0.00052085565,0.006572445],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994363,0.0000651238,0.00004300924,0.00012431009,0.00026028932,0.000070894566],"domain_scores_gemma":[0.9991253,0.0002277285,0.000052458083,0.00021468487,0.0003269853,0.00005295919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006830485,0.0011708651,0.0009912263,0.0022879457,0.0009793548,0.00161668,0.0022779189,0.0013149981,0.02373072],"category_scores_gemma":[0.0028129166,0.0005408085,0.0009559773,0.001880917,0.0007347454,0.0016296997,0.0027934986,0.0013628502,0.009520921],"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.00046647203,0.00023028169,0.0018625209,0.00043113952,0.00012234996,0.00016272657,0.0004522867,0.07887622,0.016897691,0.0689879,0.04715578,0.78435457],"study_design_scores_gemma":[0.00025530296,0.0002069193,0.00090919895,0.00006576092,0.000072714654,0.000339462,0.0003727552,0.8547854,0.020980382,0.07506324,0.046894863,0.00005407788],"about_ca_topic_score_codex":0.0055526653,"about_ca_topic_score_gemma":0.010472925,"teacher_disagreement_score":0.02373072,"about_ca_system_score_codex":0.0010084329,"about_ca_system_score_gemma":0.002430018,"threshold_uncertainty_score":0.07938719},"labels":[],"label_agreement":null},{"id":"W2196269078","doi":"10.1016/j.tcs.2015.06.040","title":"Matchings in higher-order Gabriel graphs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Order (exchange); Mathematics; Computer science; Discrete mathematics; Business","score_opus":0.02564039760582372,"score_gpt":0.2643235027200953,"score_spread":0.2386831051142716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196269078","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.7185121,0.0007672721,0.233962,0.0014297421,0.0001252996,0.00014799765,0.00043417525,0.00084564695,0.043775775],"genre_scores_gemma":[0.9085587,0.00064454286,0.06281697,0.0003157107,0.000091127025,0.00009191982,0.0005837385,0.00026183572,0.026635488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932516,0.00013803026,0.00004600598,0.00012889109,0.00020769486,0.00015432508],"domain_scores_gemma":[0.9974252,0.0012101501,0.00046996077,0.00028237002,0.0002833768,0.00032900824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082517765,0.00056844094,0.0008220922,0.0031832324,0.001986229,0.003591991,0.0017185754,0.0018778703,0.00874782],"category_scores_gemma":[0.0054922765,0.00081305,0.000904131,0.0019248181,0.0017786041,0.0048178416,0.001959676,0.0017852318,0.0013300907],"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.00009617316,0.00006666811,0.0011464752,0.000092610884,0.00001550598,0.00022259438,0.0006159459,0.010919605,0.002194909,0.9671104,0.0016960901,0.01582304],"study_design_scores_gemma":[0.00002720398,0.000027640155,0.00047575796,0.000029177176,0.000019459707,0.00018364903,0.00026221047,0.045443755,0.0014870784,0.9481704,0.0038547167,0.000018925697],"about_ca_topic_score_codex":0.003335144,"about_ca_topic_score_gemma":0.0044757803,"teacher_disagreement_score":0.00874782,"about_ca_system_score_codex":0.0019475586,"about_ca_system_score_gemma":0.00065189827,"threshold_uncertainty_score":0.02926433},"labels":[],"label_agreement":null},{"id":"W2206772957","doi":"10.1016/j.tcs.2015.11.027","title":"Descriptional Complexity of Formal Systems","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Middlesex London Health Unit","funders":"","keywords":"Formal language; Computer science; Formal system; Theoretical computer science; Programming language; Mathematics; Linguistics; Philosophy","score_opus":0.07158295952416184,"score_gpt":0.2757495938322175,"score_spread":0.20416663430805565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206772957","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.30706653,0.004412999,0.5850009,0.0249037,0.00020561276,0.00017772322,0.0020471967,0.00047706702,0.07570825],"genre_scores_gemma":[0.961293,0.0015372136,0.028837582,0.0005800072,0.00033186318,0.00020020087,0.0010166498,0.00009943797,0.006104111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916637,0.0026958175,0.0005694995,0.0010067465,0.0033427433,0.0007215129],"domain_scores_gemma":[0.9530526,0.038533237,0.001889011,0.0034292305,0.0020114467,0.0010844885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004867475,0.00070896436,0.0014453145,0.0027709617,0.0019456577,0.00952008,0.0030458304,0.0020447264,0.008278567],"category_scores_gemma":[0.027099604,0.0010502152,0.0019331392,0.0031063964,0.0064727864,0.021298734,0.004745175,0.006041033,0.00046930675],"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.000024294988,0.000023430173,0.0004355783,0.00007515639,0.000019879393,0.000028831151,0.00028626312,0.005339821,0.00015260204,0.9890416,0.0006553985,0.003916986],"study_design_scores_gemma":[0.000007299746,0.0000036011756,0.0001189557,0.000008052251,0.000007129913,0.000021243684,0.000051617848,0.012410769,0.00009891869,0.9865906,0.0006757655,0.0000059740205],"about_ca_topic_score_codex":0.0023741291,"about_ca_topic_score_gemma":0.0015385798,"teacher_disagreement_score":0.00952008,"about_ca_system_score_codex":0.0057406393,"about_ca_system_score_gemma":0.0022488816,"threshold_uncertainty_score":0.041651487},"labels":[],"label_agreement":null},{"id":"W2209166757","doi":"10.1016/j.tcs.2015.10.035","title":"Partial learning of recursively enumerable languages","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National University of Singapore","keywords":"Consistency (knowledge bases); Recursion (computer science); Mathematics; Inference; Recursively enumerable language; Limit (mathematics); Extension (predicate logic); Partial function; Class (philosophy); Relation (database); Inductive reasoning; Theoretical computer science; Computer science; Artificial intelligence; Discrete mathematics; Algorithm; Programming language; Data mining","score_opus":0.011608975006489186,"score_gpt":0.2756719027429692,"score_spread":0.26406292773648005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209166757","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.15492524,0.0007685765,0.82900983,0.0014617423,0.000082121085,0.000072213166,0.0007381952,0.0016302179,0.011311763],"genre_scores_gemma":[0.79926705,0.0006443993,0.18279101,0.0005729509,0.00015749407,0.00023820889,0.0023993151,0.00052408833,0.013405477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785596,0.0010104259,0.000119412885,0.00039712916,0.00038524353,0.00023175763],"domain_scores_gemma":[0.97351664,0.021666205,0.00074904336,0.0022837792,0.0012589525,0.0005254395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002066225,0.0006720556,0.00091826665,0.0011035679,0.0010686758,0.0029849284,0.0021194627,0.0012159415,0.007331421],"category_scores_gemma":[0.026520232,0.00086514425,0.0013987329,0.0012663944,0.002459894,0.007610806,0.0032751972,0.003311195,0.0009441817],"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.000245281,0.000110703244,0.0028810573,0.00032478434,0.00006432978,0.0001455164,0.0006920346,0.059773564,0.0023419783,0.8377291,0.0044943104,0.09119722],"study_design_scores_gemma":[0.000016147253,0.000026245643,0.0001893276,0.000038064005,0.000014777135,0.000059077265,0.00005161427,0.14199594,0.0009281651,0.85544604,0.0012225857,0.00001221563],"about_ca_topic_score_codex":0.0014958398,"about_ca_topic_score_gemma":0.0038067356,"teacher_disagreement_score":0.007331421,"about_ca_system_score_codex":0.0016683723,"about_ca_system_score_gemma":0.0018749812,"threshold_uncertainty_score":0.02452606},"labels":[],"label_agreement":null},{"id":"W2210036804","doi":"10.1016/j.tcs.2015.05.023","title":"TCS in the 21st century","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"History of Medical Practice","field":"Medicine","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":"Computer science; Mathematics; Programming language","score_opus":0.029955469606361602,"score_gpt":0.3083197519809694,"score_spread":0.2783642823746078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2210036804","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.041912742,0.095731355,0.024263876,0.1881452,0.0038150195,0.000064187516,0.0002720814,0.0002694129,0.64552605],"genre_scores_gemma":[0.78838736,0.0657477,0.008819676,0.015796984,0.0069386354,0.00012742789,0.00018915258,0.00022497948,0.113768004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973068,0.0011986578,0.000109071756,0.0003823388,0.0007033326,0.00029975732],"domain_scores_gemma":[0.9876523,0.007321249,0.0005145665,0.0010077424,0.0023499033,0.0011542721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027273835,0.0003653275,0.00044440877,0.0030043058,0.0028565503,0.0073405537,0.00083054346,0.0034562342,0.014919001],"category_scores_gemma":[0.012945844,0.00026041875,0.00024537486,0.003456298,0.01980488,0.005817907,0.0020370597,0.0052296626,0.001965073],"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.000013977447,0.000013881324,0.0002452184,0.00007928905,0.0000033244971,0.00003289222,0.0017374028,0.00033793197,0.00005732573,0.96488845,0.010329877,0.022260435],"study_design_scores_gemma":[0.000016387916,0.00003211773,0.00083779235,0.00047770943,0.000005656058,0.00017006115,0.0017624847,0.0013133978,0.00020465907,0.40699068,0.5881722,0.000016888478],"about_ca_topic_score_codex":0.01604985,"about_ca_topic_score_gemma":0.013176637,"teacher_disagreement_score":0.01604985,"about_ca_system_score_codex":0.0139740035,"about_ca_system_score_gemma":0.00966613,"threshold_uncertainty_score":0.10138899},"labels":[],"label_agreement":null},{"id":"W2219611942","doi":"10.1016/j.tcs.2015.12.012","title":"A probabilistic version of the game of Zombies and Survivors on graphs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Zombie; Vertex (graph theory); Mathematics; Discrete mathematics; Probabilistic logic; Graph; Computer science; Statistics; Computer security","score_opus":0.019414974779184177,"score_gpt":0.27299347884894193,"score_spread":0.25357850406975774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219611942","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.19615531,0.00070130895,0.7079479,0.0065013347,0.00027698645,0.00032474168,0.0013706066,0.0005117979,0.08620991],"genre_scores_gemma":[0.8964629,0.00072107074,0.059955396,0.00082686695,0.00035345895,0.00030126225,0.00060927146,0.00026893304,0.04050091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971745,0.0011222952,0.00013165739,0.00054238364,0.0005390598,0.0004899957],"domain_scores_gemma":[0.9904383,0.0056588193,0.0007862949,0.0014130841,0.00064953935,0.0010539705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025511226,0.0009098974,0.0017948322,0.0015238516,0.0021949157,0.0048848377,0.0046640355,0.0037150525,0.01991909],"category_scores_gemma":[0.016115291,0.0011885047,0.0014939834,0.0021028346,0.004730892,0.010462207,0.0038705268,0.0044629276,0.0010459422],"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.0000456856,0.000018838266,0.00022200639,0.00004672709,0.000017920996,0.00004397087,0.0001906879,0.015355967,0.00033824585,0.9790597,0.0019511958,0.0027090781],"study_design_scores_gemma":[0.000033188615,0.000016378057,0.00015429658,0.000013964515,0.000013348844,0.000060911087,0.00007669585,0.062011465,0.00010465669,0.93538964,0.0021044067,0.000021024747],"about_ca_topic_score_codex":0.0073476625,"about_ca_topic_score_gemma":0.0059604193,"teacher_disagreement_score":0.01991909,"about_ca_system_score_codex":0.0021038475,"about_ca_system_score_gemma":0.002015675,"threshold_uncertainty_score":0.066636026},"labels":[],"label_agreement":null},{"id":"W2236520910","doi":"10.1016/j.tcs.2016.01.002","title":"Solving the Many to Many assignment problem by improving the Kuhn–Munkres algorithm with backtracking","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":117,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Backtracking; Algorithm; Task (project management); Assignment problem; Computer science; Mathematics; Process (computing); Mathematical optimization","score_opus":0.0047725030374459534,"score_gpt":0.19742278774281283,"score_spread":0.19265028470536688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236520910","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.019584546,0.0002957716,0.9725213,0.00031568337,0.00012753617,0.00009392527,0.00005315282,0.0011122163,0.0058959196],"genre_scores_gemma":[0.147031,0.00019345626,0.8449433,0.00021030061,0.00008381631,0.00012080419,0.0001835601,0.00034468583,0.0068891286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986456,0.00042432334,0.00006977042,0.0003145785,0.0003110817,0.00023471404],"domain_scores_gemma":[0.99807465,0.0009990002,0.0001629583,0.00038922884,0.00026950377,0.000104569575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014894145,0.0013499304,0.0022086925,0.0017737048,0.0017419478,0.0014858801,0.002806198,0.002129215,0.009872815],"category_scores_gemma":[0.0045878645,0.0008909812,0.0011033603,0.0025817573,0.0015719479,0.0034134667,0.0020412158,0.0029614486,0.0021998044],"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.00058361125,0.00065503566,0.00083024096,0.00039316626,0.00014156416,0.00013773836,0.00026579466,0.54900473,0.0065651536,0.07543793,0.011368539,0.3546165],"study_design_scores_gemma":[0.00009334731,0.00008017963,0.00013404517,0.00001575314,0.000026548676,0.00005663064,0.000043635828,0.9378957,0.0017375891,0.057160094,0.0027348096,0.000021593229],"about_ca_topic_score_codex":0.005335957,"about_ca_topic_score_gemma":0.008517401,"teacher_disagreement_score":0.009872815,"about_ca_system_score_codex":0.000956195,"about_ca_system_score_gemma":0.0025372657,"threshold_uncertainty_score":0.033027887},"labels":[],"label_agreement":null},{"id":"W2248326503","doi":"10.1016/j.tcs.2016.04.026","title":"Recognizing and drawing IC-planar graphs","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; Deutsche Forschungsgemeinschaft","keywords":"Planar graph; Combinatorics; Planar straight-line graph; Book embedding; Mathematics; Planarity testing; Outerplanar graph; 1-planar graph; Planar; Time complexity; Graph drawing; Discrete mathematics; Rotation system; Pathwidth; Line graph; Graph; Computer science","score_opus":0.01154503844059302,"score_gpt":0.23778373087163776,"score_spread":0.22623869243104475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248326503","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.047598343,0.0001731212,0.9347717,0.0002570856,0.00007192916,0.00018091768,0.0004484715,0.0036273003,0.012871098],"genre_scores_gemma":[0.29934567,0.0003585443,0.6851399,0.00016422456,0.00005150718,0.00011563018,0.0025559918,0.0010146507,0.011253874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917245,0.00009831423,0.00005211524,0.00033365,0.00021278119,0.00013070495],"domain_scores_gemma":[0.99880874,0.0003594065,0.00011378763,0.0003770251,0.00025622323,0.00008482592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000384161,0.0012697804,0.0010294708,0.0019209115,0.00074877654,0.0026601637,0.0024619447,0.0017265485,0.009786546],"category_scores_gemma":[0.002860821,0.0009622423,0.0012858938,0.0020128894,0.0011745039,0.0033143878,0.0020334087,0.0022743575,0.002702695],"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.00026754814,0.0001413218,0.002878115,0.0006219622,0.00007665499,0.0005532524,0.00074757595,0.17118725,0.03838839,0.14759575,0.016695146,0.620847],"study_design_scores_gemma":[0.000026272319,0.00008800524,0.0010013808,0.0000767905,0.000051341278,0.0003658741,0.00060650834,0.8154096,0.031523436,0.12806834,0.022748908,0.000033500415],"about_ca_topic_score_codex":0.00532996,"about_ca_topic_score_gemma":0.008175215,"teacher_disagreement_score":0.009786546,"about_ca_system_score_codex":0.00089858595,"about_ca_system_score_gemma":0.00062024023,"threshold_uncertainty_score":0.03273928},"labels":[],"label_agreement":null},{"id":"W2250680610","doi":"10.1016/j.tcs.2015.05.003","title":"Studies on finite Sturmian words","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"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":"Christoffel symbols; Mathematics; Bijection; Closure (psychology); Combinatorics; Palindrome; Extension (predicate logic); Word (group theory); Inverse; Combinatorics on words; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.03992175234996239,"score_gpt":0.30067441099862086,"score_spread":0.2607526586486585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250680610","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.56951886,0.020562002,0.10842102,0.0040618884,0.0007800666,0.00005974884,0.00030825514,0.00027890006,0.29600924],"genre_scores_gemma":[0.9548609,0.004466188,0.011876976,0.000458877,0.0006908158,0.000060968523,0.00030720275,0.00012045917,0.02715758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893934,0.0003837404,0.0000838097,0.00018120358,0.000248949,0.00016292816],"domain_scores_gemma":[0.99572206,0.0031072202,0.00025711162,0.00024999044,0.00044729034,0.00021638274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014801705,0.00079706486,0.0011441758,0.004182659,0.002643249,0.0028641257,0.0010829134,0.0012181255,0.011661895],"category_scores_gemma":[0.0056715244,0.0004708145,0.0013975198,0.004878998,0.0052945344,0.006981158,0.0016177131,0.0019028744,0.0011795829],"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.000017934557,0.000012450363,0.00017866163,0.00009060566,0.000006275475,0.00008760613,0.00055773114,0.00044497047,0.0004817065,0.994493,0.00040252536,0.0032266155],"study_design_scores_gemma":[0.000008437053,0.000036610425,0.0004150436,0.000040297444,0.00001889431,0.00020754397,0.00029863114,0.0015286785,0.0006913912,0.98957026,0.0071711875,0.000013054223],"about_ca_topic_score_codex":0.0010246617,"about_ca_topic_score_gemma":0.0010248843,"teacher_disagreement_score":0.011661895,"about_ca_system_score_codex":0.0021930097,"about_ca_system_score_gemma":0.00079226313,"threshold_uncertainty_score":0.03901291},"labels":[],"label_agreement":null},{"id":"W2266731991","doi":"10.1016/j.tcs.2016.01.037","title":"Topology recognition and leader election in colored networks","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki","keywords":"Node (physics); Colored; Leader election; Computer science; Topology (electrical circuits); Upper and lower bounds; Network topology; Path (computing); Theoretical computer science; Mathematics; Computer network; Combinatorics","score_opus":0.013708711981975702,"score_gpt":0.23691358033165807,"score_spread":0.22320486834968237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266731991","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.13990818,0.00037868728,0.84949565,0.00073479017,0.00023302683,0.000060846505,0.00006396716,0.00049823,0.008626638],"genre_scores_gemma":[0.93752414,0.0002728781,0.054781765,0.00011999671,0.000071054485,0.0000574317,0.00009014756,0.00008450895,0.006998061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988674,0.00044756004,0.00003844122,0.0002151816,0.00019467142,0.0002366914],"domain_scores_gemma":[0.9948137,0.0032372044,0.0005704502,0.00054487505,0.00045216465,0.00038162238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014655971,0.0003786767,0.0007349601,0.00074158894,0.0010571731,0.0020461008,0.0015824911,0.0011197632,0.0020159255],"category_scores_gemma":[0.009479694,0.00048809714,0.0004307104,0.00087891216,0.0016169909,0.002286204,0.001418337,0.0011040284,0.00035444007],"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.0004363003,0.00010769821,0.0016439088,0.00010560748,0.000042464115,0.00022123319,0.0003639442,0.5556809,0.008643077,0.38367984,0.0029683744,0.046106685],"study_design_scores_gemma":[0.000022178174,0.000024113171,0.00019915026,0.000004754971,0.000008079921,0.000030694624,0.000046155492,0.88150537,0.0015400482,0.115922965,0.00068455073,0.00001197216],"about_ca_topic_score_codex":0.0038372397,"about_ca_topic_score_gemma":0.0037212276,"teacher_disagreement_score":0.0038372397,"about_ca_system_score_codex":0.0012231533,"about_ca_system_score_gemma":0.001121482,"threshold_uncertainty_score":0.008874595},"labels":[],"label_agreement":null},{"id":"W2267246357","doi":"10.1016/j.tcs.2016.02.030","title":"To catch a falling robber","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; State Administration of Foreign Experts Affairs; Ryerson University","keywords":"Falling (accident); Mathematics; Psychology","score_opus":0.021773099119165425,"score_gpt":0.2934336035943495,"score_spread":0.2716605044751841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267246357","genre_codex":"commentary","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.020456538,0.008544383,0.09159479,0.5608379,0.025117576,0.00011030494,0.0003912929,0.0021477316,0.29079947],"genre_scores_gemma":[0.33225116,0.004425984,0.054663856,0.15399443,0.007002947,0.00029660462,0.0004984684,0.0021100324,0.44475642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772197,0.00080218184,0.0000759052,0.00038166897,0.0006452397,0.0003730723],"domain_scores_gemma":[0.9908948,0.0028436347,0.0004755031,0.0013803166,0.0027657032,0.0016401055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026282608,0.0009525352,0.0010927379,0.0017046584,0.0064461655,0.0054304735,0.0017576136,0.006256891,0.042353228],"category_scores_gemma":[0.025972372,0.00045569713,0.0008571784,0.00082972244,0.008149979,0.0137598645,0.005942689,0.010824819,0.021011231],"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.00011883529,0.00007598889,0.0005759405,0.00013256453,0.000045641165,0.00026294513,0.0017294191,0.0007057342,0.0006882714,0.4755314,0.4703224,0.04981092],"study_design_scores_gemma":[0.000023144192,0.0000449012,0.00017460168,0.0001801053,0.000013643319,0.0002556585,0.0019065822,0.0012500702,0.00029467253,0.65673137,0.33909374,0.000031363616],"about_ca_topic_score_codex":0.0035333857,"about_ca_topic_score_gemma":0.0048348173,"teacher_disagreement_score":0.042353228,"about_ca_system_score_codex":0.001900788,"about_ca_system_score_gemma":0.002071833,"threshold_uncertainty_score":0.14168572},"labels":[],"label_agreement":null},{"id":"W2281873354","doi":"10.1016/j.tcs.2017.03.029","title":"A direct algorithm to compute the topological Euler characteristic and Chern–Schwartz–MacPherson class of projective complete intersection varieties","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chern class; Intersection (aeronautics); Euler's formula; Scheme (mathematics); Gravitational singularity; Euler characteristic; Characteristic class; Complete intersection; Class (philosophy); Field (mathematics); Pure mathematics; Computation; Topology (electrical circuits); Discrete mathematics; Algorithm; Combinatorics; Mathematical analysis; Computer science; Cohomology; Artificial intelligence","score_opus":0.03763302985100976,"score_gpt":0.30511557534237294,"score_spread":0.2674825454913632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281873354","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.08214955,0.000508868,0.89922553,0.00047979155,0.00016016825,0.00018685125,0.0005817302,0.004569969,0.012137547],"genre_scores_gemma":[0.38630083,0.0001895083,0.6021962,0.0001364688,0.00012840565,0.00025076457,0.0019855197,0.0006298146,0.008182544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917716,0.00011581584,0.00005833497,0.00026778408,0.00025875756,0.00012215186],"domain_scores_gemma":[0.9982734,0.0006828462,0.00011089613,0.00042029147,0.0003361489,0.00017635472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000883867,0.0013745617,0.0013508764,0.0025550749,0.0012523129,0.0030505862,0.0021719795,0.0013232852,0.0116541255],"category_scores_gemma":[0.0042012087,0.00070561504,0.0009645803,0.001987011,0.0013195286,0.004071085,0.0040414426,0.002082376,0.0035007491],"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.0006192459,0.00051375024,0.0057682483,0.00044258145,0.00016810934,0.00032173257,0.0006789227,0.028973324,0.01740884,0.16628064,0.020985717,0.7578389],"study_design_scores_gemma":[0.0005046862,0.0003148724,0.0036001266,0.000065203174,0.00013682149,0.0005332605,0.00040295057,0.37467718,0.01693918,0.5795532,0.023147611,0.00012488046],"about_ca_topic_score_codex":0.0016248889,"about_ca_topic_score_gemma":0.0038669345,"teacher_disagreement_score":0.0116541255,"about_ca_system_score_codex":0.0013843951,"about_ca_system_score_gemma":0.0018319294,"threshold_uncertainty_score":0.03898698},"labels":[],"label_agreement":null},{"id":"W2284684210","doi":"10.1016/j.tcs.2020.01.031","title":"Paid exchanges are worth the price","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Business; Economics","score_opus":0.03455886438842057,"score_gpt":0.2758827443001755,"score_spread":0.24132387991175494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284684210","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.0040079923,0.0064843493,0.011456538,0.09320297,0.08851812,0.00021416227,0.0024469262,0.003158416,0.7905106],"genre_scores_gemma":[0.016092626,0.0011681598,0.0014776334,0.004147741,0.0058046607,0.0000720061,0.0008112813,0.0009202227,0.96950555],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971999,0.0004081712,0.00012625323,0.00055394514,0.0013334396,0.00037832707],"domain_scores_gemma":[0.9905764,0.0019320779,0.000608965,0.002034271,0.0029883941,0.0018599051],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001970466,0.0013468817,0.002289493,0.0016659239,0.0024660644,0.009940402,0.001742301,0.009459159,0.4553242],"category_scores_gemma":[0.025930136,0.000968159,0.0010563838,0.0023532363,0.0017346357,0.012210518,0.0027639198,0.00742276,0.35860902],"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.0003389779,0.00010429097,0.00036755597,0.00008739995,0.000027787715,0.00017868399,0.0000736659,0.00036327814,0.00054329046,0.09074823,0.8052277,0.10193911],"study_design_scores_gemma":[0.00005214059,0.000031893884,0.00043526242,0.000059930226,0.000012049504,0.0001679953,0.00008314151,0.0005533802,0.00012693269,0.019164734,0.97928977,0.000022866314],"about_ca_topic_score_codex":0.0018908071,"about_ca_topic_score_gemma":0.0025187992,"teacher_disagreement_score":0.4553242,"about_ca_system_score_codex":0.0020162745,"about_ca_system_score_gemma":0.0020543311,"threshold_uncertainty_score":0.7769139},"labels":[],"label_agreement":null},{"id":"W2288306272","doi":"10.1016/j.tcs.2016.02.034","title":"The effect of end-markers on counter machines and commutativity","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Commutative property; Nondeterministic algorithm; Mathematics; Decidability; Deterministic pushdown automaton; Finite-state machine; Discrete mathematics; Bounded function; Nested word; Closure (psychology); Regular language; Pushdown automaton; Class (philosophy); Quotient; Automaton; Quantum finite automata; Nondeterministic finite automaton; Combinatorics; Automata theory; Computer science; Algorithm; Theoretical computer science","score_opus":0.0032313319446241667,"score_gpt":0.23135244729608526,"score_spread":0.2281211153514611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288306272","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.6430867,0.0011043769,0.26863638,0.0031632343,0.00077422755,0.00009810893,0.00034306862,0.0019480392,0.080845885],"genre_scores_gemma":[0.97938377,0.00019703616,0.013734906,0.00022010275,0.00012480622,0.000057167377,0.00006256433,0.0003658466,0.005853769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476385,0.0022698354,0.00039268695,0.0009713276,0.0007241551,0.000878089],"domain_scores_gemma":[0.89360785,0.08386366,0.0027962683,0.013108104,0.003190646,0.00343337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006747651,0.00083317753,0.0016761611,0.0012748276,0.003997591,0.005504524,0.0023926913,0.0031258988,0.019556684],"category_scores_gemma":[0.04550185,0.001239842,0.0018036693,0.0010382002,0.009225705,0.01886707,0.005851478,0.0032587533,0.0012073881],"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.0013745544,0.0001879328,0.0021537275,0.00020473448,0.000042062926,0.0005072657,0.0013710451,0.007155868,0.00791598,0.9627567,0.0013861452,0.014944044],"study_design_scores_gemma":[0.00014186557,0.00015133027,0.00095461705,0.000042489148,0.00012650776,0.00032928726,0.0005216002,0.019030888,0.016012302,0.9597734,0.002837784,0.000077942736],"about_ca_topic_score_codex":0.0010491967,"about_ca_topic_score_gemma":0.0011486133,"teacher_disagreement_score":0.019556684,"about_ca_system_score_codex":0.0010518337,"about_ca_system_score_gemma":0.001427538,"threshold_uncertainty_score":0.06542361},"labels":[],"label_agreement":null},{"id":"W2288393983","doi":"10.1016/j.tcs.2016.01.025","title":"Rendezvous with constant memory","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"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; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Rendezvous; Constant (computer programming); Robot; Computer science; Asynchronous communication; Transmission (telecommunications); State (computer science); Mobile robot; Theoretical computer science; Algorithm; Artificial intelligence; Computer network; Telecommunications; Programming language","score_opus":0.009871011720561236,"score_gpt":0.23466240848243702,"score_spread":0.2247913967618758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288393983","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.29180777,0.0016228774,0.6158201,0.0010725516,0.00035563973,0.00018174782,0.0006893448,0.0040818243,0.08436816],"genre_scores_gemma":[0.92159414,0.0003362064,0.050677862,0.0001245089,0.00008113183,0.0001152987,0.00028870496,0.000493377,0.026288807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917585,0.00012341373,0.0000391291,0.00023977025,0.00017359153,0.0002482487],"domain_scores_gemma":[0.99745935,0.0010043897,0.00015976514,0.001091398,0.00014159012,0.00014344849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005430715,0.00095921935,0.0012948064,0.0008146367,0.0014855766,0.0019949917,0.002226249,0.0010840193,0.015808076],"category_scores_gemma":[0.005889114,0.00051902997,0.00055905886,0.0011069187,0.0018425453,0.004582848,0.004169286,0.0014158316,0.0024462533],"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.0037202856,0.00018912402,0.0014598973,0.0004588556,0.00020617204,0.0005191765,0.00063456217,0.35706806,0.015162268,0.43051702,0.016898377,0.1731662],"study_design_scores_gemma":[0.0003038713,0.00014843595,0.00032838338,0.00004399944,0.00006932243,0.00024524538,0.00022820274,0.55749345,0.012347771,0.4202055,0.008538838,0.000047049896],"about_ca_topic_score_codex":0.0029324775,"about_ca_topic_score_gemma":0.0024330565,"teacher_disagreement_score":0.015808076,"about_ca_system_score_codex":0.000723809,"about_ca_system_score_gemma":0.00086602475,"threshold_uncertainty_score":0.052883267},"labels":[],"label_agreement":null},{"id":"W2289737386","doi":"10.1016/j.tcs.2006.09.011","title":"Preface","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Computer science; Philosophy","score_opus":0.003825225736326931,"score_gpt":0.21797820993581318,"score_spread":0.21415298419948625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289737386","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.00212813,0.012963398,0.027183646,0.045346774,0.23122522,0.0005699197,0.017777191,0.0027199981,0.6600857],"genre_scores_gemma":[0.010548352,0.0051752604,0.0075135287,0.006880633,0.032515433,0.00034261687,0.012400291,0.0016029839,0.92302084],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936134,0.00010849142,0.00003584238,0.00012026694,0.0003229514,0.000051121096],"domain_scores_gemma":[0.9950747,0.0009057479,0.00014398083,0.00050781353,0.002652104,0.00071556424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012021832,0.00083840464,0.0006448077,0.0030077898,0.0019961894,0.002607955,0.0011279925,0.00075985986,0.41634414],"category_scores_gemma":[0.011456732,0.00024284332,0.0005055582,0.0022869022,0.0005100454,0.0020426656,0.0015638266,0.0024145572,0.25944132],"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.000020608915,0.000018699211,0.00008517282,0.000065185865,0.0000019458266,0.000026036512,0.000037216632,0.000103524166,0.00010026742,0.008044001,0.9467129,0.04478444],"study_design_scores_gemma":[0.00000477511,0.000010448138,0.00024187457,0.00008166377,0.0000021432902,0.000039059396,0.000044288765,0.00008235122,0.00012298305,0.008818245,0.99054724,0.0000049307687],"about_ca_topic_score_codex":0.0028325324,"about_ca_topic_score_gemma":0.003659153,"teacher_disagreement_score":0.41634414,"about_ca_system_score_codex":0.0018166275,"about_ca_system_score_gemma":0.0016859977,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2292546119","doi":"10.1016/j.tcs.2013.09.018","title":"Guest Editorsʼ introduction","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Global Security and Public Health","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.007993924183787497,"score_gpt":0.2834320103082725,"score_spread":0.275438086124485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292546119","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.0002005984,0.005346197,0.0008715259,0.045383513,0.9072074,0.000040961524,0.00037214442,0.00027888574,0.04029867],"genre_scores_gemma":[0.0038202112,0.004852784,0.0006958053,0.028211968,0.63652647,0.000093451396,0.00036394453,0.00052240444,0.324913],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968388,0.0003868196,0.0002263807,0.00067331217,0.0014516724,0.0004229824],"domain_scores_gemma":[0.98320955,0.0027850291,0.001167653,0.0012411785,0.0073651765,0.0042314176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040091183,0.001617761,0.0011369144,0.0033599653,0.0020642036,0.008643099,0.0020130465,0.004446587,0.1893315],"category_scores_gemma":[0.024177171,0.0005555059,0.0010015911,0.001587454,0.0012294544,0.0032027345,0.0031128265,0.007310363,0.122416794],"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.000019627285,0.0000070259553,0.00004547501,0.00008790711,0.0000030590472,0.000037261703,0.000016762908,0.00002768395,0.000087436216,0.0022482318,0.98145145,0.015968125],"study_design_scores_gemma":[0.000008514026,0.000010996502,0.0001289057,0.00008522804,0.000004201345,0.000055827004,0.000024708905,0.000050356677,0.00009190125,0.0015103553,0.9980223,0.00000670797],"about_ca_topic_score_codex":0.000965283,"about_ca_topic_score_gemma":0.0016565882,"teacher_disagreement_score":0.1893315,"about_ca_system_score_codex":0.0019194458,"about_ca_system_score_gemma":0.0027522969,"threshold_uncertainty_score":0.63337696},"labels":[],"label_agreement":null},{"id":"W2313440826","doi":"10.1016/j.tcs.2011.08.039","title":"WITHDRAWN: Quantum cryptography: Public key distribution and coin tossing","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","cited_by":114,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Coin flipping; Public-key cryptography; Cryptography; Key (lock); Computer security; Computer science; Quantum key distribution; Quantum cryptography; Theoretical computer science; Mathematics; Quantum; Encryption; Statistics; Physics; Quantum information; Quantum mechanics","score_opus":0.046140776292576936,"score_gpt":0.2645989169087647,"score_spread":0.21845814061618776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313440826","genre_codex":"commentary","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.00586415,0.013262509,0.0070387353,0.60078686,0.28609338,0.00034758932,0.012356046,0.001892098,0.07235864],"genre_scores_gemma":[0.11788327,0.009306681,0.0089441985,0.32920837,0.14760908,0.00052321586,0.008423395,0.00068868947,0.37741306],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99233043,0.0008284926,0.0006426478,0.0006584027,0.0046866164,0.00085338997],"domain_scores_gemma":[0.9663608,0.007405201,0.0017014014,0.0022437703,0.019967608,0.002321226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005187298,0.0014163622,0.002380694,0.0027628122,0.0051907958,0.006748751,0.004694899,0.018198797,0.035254337],"category_scores_gemma":[0.052745797,0.00079498376,0.0019326058,0.0037340932,0.0022683104,0.00447655,0.0017297717,0.008544367,0.01973736],"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.00017399198,0.000038692197,0.0003565827,0.0002214858,0.000027209346,0.00015090701,0.000042352167,0.00014444086,0.00052502105,0.02682719,0.9571903,0.014301863],"study_design_scores_gemma":[0.00022387346,0.00010425499,0.0035270404,0.00021639642,0.000101217534,0.0003361668,0.00008324022,0.0012914507,0.0023289227,0.040230133,0.95145506,0.000102230035],"about_ca_topic_score_codex":0.016641676,"about_ca_topic_score_gemma":0.017192533,"teacher_disagreement_score":0.035254337,"about_ca_system_score_codex":0.0062719556,"about_ca_system_score_gemma":0.011199234,"threshold_uncertainty_score":0.117937505},"labels":[],"label_agreement":null},{"id":"W2338410001","doi":"10.1016/j.tcs.2016.04.005","title":"Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Vertex cover; Cover (algebra); Vertex (graph theory); Mathematics; Edge cover; Approximation algorithm; Dual (grammatical number); Covering problems; Combinatorics; Set cover problem; Mathematical optimization; Algorithm; Computer science; Graph; Set (abstract data type)","score_opus":0.027205835633059547,"score_gpt":0.26314649833605147,"score_spread":0.2359406627029919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338410001","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.030138008,0.001867845,0.9514575,0.0016277345,0.00030833922,0.00029858423,0.00047593744,0.0011180312,0.012707961],"genre_scores_gemma":[0.31601104,0.0010511756,0.6699507,0.0007242805,0.00037695057,0.0007435888,0.0012578627,0.0006567918,0.009227608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836594,0.0005671472,0.000057113797,0.00029728224,0.0003624709,0.00035003264],"domain_scores_gemma":[0.9956676,0.0029145184,0.0002825997,0.0004626571,0.00034840312,0.00032424915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032883813,0.0024795684,0.0028323452,0.0016859216,0.0009762704,0.003901753,0.0037097652,0.002888603,0.009516623],"category_scores_gemma":[0.009707417,0.0013439821,0.0016241511,0.0030802551,0.0012512,0.004597943,0.0028580218,0.00548745,0.0016149614],"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.00080746145,0.0011187941,0.0013274527,0.0006367448,0.0001841644,0.00013297798,0.0001985552,0.68531156,0.0016591023,0.09129788,0.026383128,0.19094223],"study_design_scores_gemma":[0.00007045793,0.00004156431,0.00008001499,0.00003057491,0.00002232946,0.000039366638,0.000037174745,0.96308357,0.0002766704,0.03526084,0.0010499322,0.0000075542225],"about_ca_topic_score_codex":0.004144427,"about_ca_topic_score_gemma":0.0060046515,"teacher_disagreement_score":0.009516623,"about_ca_system_score_codex":0.0033380855,"about_ca_system_score_gemma":0.003303661,"threshold_uncertainty_score":0.03183627},"labels":[],"label_agreement":null},{"id":"W2342108770","doi":"10.1016/j.tcs.2016.04.016","title":"An alternative proof for the equivalence of ∞-searcher and 2-searcher","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Visibility; Equivalence (formal languages); Conjecture; Computer science; Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.03990573698417783,"score_gpt":0.33345797334618205,"score_spread":0.2935522363620042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342108770","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.035462763,0.0013070449,0.7769881,0.010914048,0.0017628646,0.00012405851,0.0008137489,0.0007345967,0.1718928],"genre_scores_gemma":[0.73084754,0.0016075346,0.21568961,0.008258612,0.0022599234,0.0004353628,0.00085697166,0.00058401,0.039460473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969999,0.0008585029,0.00023258307,0.0007096303,0.0007069905,0.0004922498],"domain_scores_gemma":[0.9901428,0.006395643,0.00041137805,0.0013214259,0.0013725443,0.00035621226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030609115,0.000837214,0.0011599095,0.0016550457,0.0016369612,0.003491878,0.0027891237,0.0032730212,0.026998585],"category_scores_gemma":[0.01651488,0.00055113906,0.0020175395,0.0020739578,0.004303632,0.012320488,0.005132012,0.006486883,0.0022521012],"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.000025957917,0.000020048034,0.00011716938,0.000043607106,0.000008754004,0.00005540985,0.00010623103,0.00049591734,0.00036415164,0.99082655,0.0023594922,0.0055767456],"study_design_scores_gemma":[0.000019742469,0.00002056917,0.00015915139,0.000014761966,0.000008423059,0.000115352945,0.00003787625,0.0043089944,0.0003344224,0.9900614,0.0049066115,0.000012783704],"about_ca_topic_score_codex":0.0012166267,"about_ca_topic_score_gemma":0.00092188065,"teacher_disagreement_score":0.026998585,"about_ca_system_score_codex":0.00132522,"about_ca_system_score_gemma":0.0015876943,"threshold_uncertainty_score":0.090319276},"labels":[],"label_agreement":null},{"id":"W2343833891","doi":"10.1016/j.tcs.2003.11.001","title":"Preface","year":2003,"lang":"en","type":"article","venue":"Theoretical 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":"Dalhousie University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.010688338425084355,"score_gpt":0.25891585120388516,"score_spread":0.2482275127788008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343833891","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.0013932738,0.014487849,0.022171356,0.04890015,0.31478637,0.00048633022,0.010057799,0.001979067,0.58573776],"genre_scores_gemma":[0.008067467,0.0070462357,0.0052665644,0.00750128,0.052421253,0.000279954,0.0072616376,0.0013134606,0.9108422],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938583,0.00010185312,0.000037846978,0.00010940311,0.0003145773,0.000050442402],"domain_scores_gemma":[0.9948198,0.0009112882,0.00015800634,0.0005618746,0.002828638,0.0007204584],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012186685,0.0010272132,0.0006971509,0.003518062,0.002508207,0.0030390369,0.0012392098,0.00091813895,0.33813635],"category_scores_gemma":[0.010573372,0.00030793442,0.00063162594,0.002486817,0.0006509657,0.0028091352,0.0017728582,0.003230001,0.22569937],"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.00002102505,0.000019102565,0.00006567638,0.00007585592,0.0000020015086,0.000023796732,0.00003681961,0.00006729582,0.00011900136,0.008418768,0.9533175,0.037833124],"study_design_scores_gemma":[0.000004645848,0.000012257257,0.00024118555,0.00009932901,0.0000028205998,0.000037880087,0.00004818345,0.00006114909,0.00014653426,0.008665407,0.99067456,0.0000061467886],"about_ca_topic_score_codex":0.003141717,"about_ca_topic_score_gemma":0.004163616,"teacher_disagreement_score":0.6618637,"about_ca_system_score_codex":0.0019299466,"about_ca_system_score_gemma":0.0015925127,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2344606806","doi":"10.1016/j.tcs.2016.04.015","title":"On Sillke's bijection","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Cardinality (data modeling); Indecomposable module; Combinatorics; Mathematics; Group (periodic table); Discrete mathematics; Computer science; Chemistry; Database","score_opus":0.005954904830763786,"score_gpt":0.223660163684643,"score_spread":0.21770525885387923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344606806","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.08765749,0.004523948,0.4723934,0.011673258,0.0033973285,0.00011840965,0.0005486345,0.0011380364,0.41854954],"genre_scores_gemma":[0.7513572,0.002869065,0.08646727,0.0042794547,0.0013207664,0.00027736826,0.0005315447,0.001118066,0.15177917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987469,0.00043441312,0.0000877968,0.00028024355,0.0002595473,0.0001911343],"domain_scores_gemma":[0.9982773,0.0010163726,0.00007125566,0.00021171814,0.0002786852,0.00014457598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014889495,0.00078981515,0.0011408145,0.0029244937,0.004491279,0.0038332683,0.0012396767,0.0022585778,0.018828064],"category_scores_gemma":[0.004545555,0.00079533196,0.0013507155,0.002464234,0.0054724636,0.011980352,0.005045443,0.004871202,0.0043079103],"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.000016276543,0.000009296037,0.000028119965,0.000019760297,0.0000028217949,0.000032812735,0.00029799662,0.00011889524,0.00020280154,0.99417096,0.0014575353,0.003642798],"study_design_scores_gemma":[0.00000854659,0.000007822801,0.000025931899,0.0000105172985,0.0000046539203,0.00006861045,0.00007674426,0.0005285281,0.00021517469,0.98987496,0.009168302,0.000010328936],"about_ca_topic_score_codex":0.0010709327,"about_ca_topic_score_gemma":0.0008899184,"teacher_disagreement_score":0.018828064,"about_ca_system_score_codex":0.0015251356,"about_ca_system_score_gemma":0.0007127832,"threshold_uncertainty_score":0.062986135},"labels":[],"label_agreement":null},{"id":"W2397866482","doi":"10.1016/j.tcs.2016.05.018","title":"State complexity of prefix distance","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Suffix; Generalized suffix tree; Prefix; Combinatorics; Regular language; Mathematics; Deterministic finite automaton; Nondeterministic algorithm; Nondeterministic finite automaton; Discrete mathematics; State (computer science); Suffix tree; Set (abstract data type); Finite-state machine; Automaton; Computer science; Algorithm; Theoretical computer science; Automata theory","score_opus":0.016784463291252882,"score_gpt":0.24484974529758166,"score_spread":0.22806528200632878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397866482","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.72300076,0.00091137725,0.23085961,0.005316833,0.00012363297,0.000095296025,0.0016899448,0.00050724286,0.037495323],"genre_scores_gemma":[0.982771,0.00033673708,0.009901714,0.00015711701,0.00015028744,0.00010589997,0.00066725624,0.000110133464,0.005799839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610907,0.0010137623,0.00027842302,0.00080565567,0.0011200744,0.00067290245],"domain_scores_gemma":[0.95981735,0.03243057,0.0016850152,0.0029373835,0.0017052923,0.001424361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023690804,0.0005519718,0.0018503212,0.001942572,0.0020278126,0.007423308,0.0028300202,0.002711565,0.015405649],"category_scores_gemma":[0.023922447,0.0007602858,0.0014212014,0.002983263,0.0039219256,0.018130975,0.0047612675,0.004204904,0.00094354595],"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.00022345629,0.00006374798,0.0012069419,0.00009478822,0.000023748977,0.00007931522,0.00045726763,0.018713556,0.0009347717,0.9687353,0.001237398,0.008229746],"study_design_scores_gemma":[0.000022249978,0.00002147612,0.0002750375,0.000009929893,0.000015678586,0.000044358545,0.000060995335,0.062428165,0.000560836,0.93609935,0.00044455167,0.000017310827],"about_ca_topic_score_codex":0.0019447865,"about_ca_topic_score_gemma":0.0013925876,"teacher_disagreement_score":0.015405649,"about_ca_system_score_codex":0.003360262,"about_ca_system_score_gemma":0.0021780967,"threshold_uncertainty_score":0.051537037},"labels":[],"label_agreement":null},{"id":"W2400068012","doi":"10.1016/j.tcs.2016.05.024","title":"Document retrieval with one wildcard","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Substring; Symbol (formal); String (physics); Computer science; Data structure; Alphabet; Extension (predicate logic); Linear space; Space (punctuation); Pattern matching; Listing (finance); Combinatorics; Mathematics; Algorithm; Theoretical computer science; Information retrieval; Artificial intelligence; Linguistics","score_opus":0.00782486814828636,"score_gpt":0.22878456495539984,"score_spread":0.22095969680711347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400068012","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.07474711,0.005721474,0.87296754,0.0039436948,0.0036836271,0.0007254364,0.0016700996,0.0059850104,0.030556053],"genre_scores_gemma":[0.35623544,0.0015951954,0.58551675,0.0013714117,0.0019431947,0.00033451017,0.0026743733,0.0006684658,0.049660675],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959661,0.00082410383,0.00054872606,0.00078977755,0.0014934781,0.00037776344],"domain_scores_gemma":[0.994076,0.0013009255,0.00020202357,0.0031701222,0.001075664,0.00017517865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027208778,0.000959416,0.0023890075,0.0049217236,0.0015091484,0.0049495357,0.0018502683,0.0026263962,0.021744505],"category_scores_gemma":[0.013724502,0.0005864383,0.00079726346,0.004679692,0.0021414012,0.010222742,0.0034394178,0.0017368294,0.013412553],"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.0011677359,0.00027920154,0.0010810603,0.00031582272,0.0000714419,0.00033760894,0.00011327345,0.0050356598,0.02497456,0.1075382,0.032652494,0.8264329],"study_design_scores_gemma":[0.00044892277,0.0013378039,0.0017677435,0.00024045873,0.00021790169,0.00511862,0.00030373115,0.34413457,0.087404065,0.4471567,0.1116536,0.0002159521],"about_ca_topic_score_codex":0.0006483893,"about_ca_topic_score_gemma":0.000807883,"teacher_disagreement_score":0.021744505,"about_ca_system_score_codex":0.00092367595,"about_ca_system_score_gemma":0.0015891024,"threshold_uncertainty_score":0.07274264},"labels":[],"label_agreement":null},{"id":"W2400176033","doi":"10.1016/s0304-3975(04)00143-4","title":"On the number of nonterminals in linear conjunctive grammars*1","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Terminal and nonterminal symbols; Indexed grammar; Mathematics; Context-sensitive grammar; Disjoint sets; Discrete mathematics; Combinatorics; Rule-based machine translation; Computer science; Context-free grammar; Natural language processing","score_opus":0.009711916773719308,"score_gpt":0.2632984173633767,"score_spread":0.2535865005896574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400176033","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.37157452,0.003458792,0.52832365,0.012964813,0.0011361088,0.00018601175,0.0016071025,0.0014608962,0.07928811],"genre_scores_gemma":[0.8596938,0.0017819051,0.11399075,0.0010832995,0.001278566,0.00041347506,0.0012350704,0.0010172917,0.019505829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991028,0.003866445,0.0006565983,0.0018049318,0.0016395331,0.0010044506],"domain_scores_gemma":[0.75639486,0.22417496,0.0049701184,0.0070598577,0.0035449564,0.0038552484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009187085,0.0015327964,0.0035387606,0.0029378291,0.0045933686,0.0070840647,0.005501327,0.0051570265,0.01470914],"category_scores_gemma":[0.06065893,0.0026202756,0.0021526918,0.0033871797,0.009776243,0.031302676,0.0049144356,0.0072151856,0.0017523167],"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.0007605657,0.00016613114,0.0037453943,0.00042809738,0.000053589418,0.0004274029,0.001063822,0.032209486,0.0031898364,0.92847127,0.005357639,0.024126677],"study_design_scores_gemma":[0.000048860682,0.00005561582,0.0005288649,0.000057387108,0.000044608983,0.00023661024,0.00014188013,0.06467699,0.0013871494,0.93088996,0.0018954976,0.000036539233],"about_ca_topic_score_codex":0.0012900432,"about_ca_topic_score_gemma":0.0016149922,"teacher_disagreement_score":0.01470914,"about_ca_system_score_codex":0.0032589561,"about_ca_system_score_gemma":0.0017446887,"threshold_uncertainty_score":0.049206972},"labels":[],"label_agreement":null},{"id":"W2401552927","doi":"10.1016/j.tcs.2019.03.015","title":"Weighted minimum backward Fréchet distance","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backtracking; Mathematics; Tree traversal; Combinatorics; Euclidean space; Simple (philosophy); Euclidean distance; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Geometry; Computer science; Artificial intelligence","score_opus":0.006085964691183508,"score_gpt":0.23055598571832414,"score_spread":0.22447002102714064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401552927","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.038135834,0.0005976857,0.9461706,0.00052845624,0.00026613913,0.00005611935,0.00038563387,0.0004156077,0.013443966],"genre_scores_gemma":[0.40446708,0.0007806943,0.54445726,0.00027655778,0.00020582194,0.0003174122,0.0012545398,0.00073058787,0.047510017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993104,0.00017324096,0.00003753708,0.00013753258,0.00025149505,0.000089797744],"domain_scores_gemma":[0.9989826,0.0003360603,0.000068832596,0.00018610129,0.00032364193,0.000102635706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009254638,0.0009962787,0.0014912331,0.0019724595,0.0009413365,0.0014454459,0.0017301341,0.0019095987,0.012167511],"category_scores_gemma":[0.004294017,0.00041573762,0.000757799,0.0011080359,0.000659526,0.0023919141,0.0022877608,0.0015870399,0.0021427975],"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.0008012926,0.00021793898,0.0009548598,0.0005808113,0.000120939774,0.00016532667,0.00014184456,0.12296931,0.019341342,0.4639765,0.017564727,0.37316513],"study_design_scores_gemma":[0.000060763166,0.0002804753,0.00075246725,0.0001037086,0.00006195251,0.00044094337,0.00007746421,0.45159817,0.010977883,0.51505834,0.0205426,0.000045152035],"about_ca_topic_score_codex":0.0009201492,"about_ca_topic_score_gemma":0.0011049943,"teacher_disagreement_score":0.012167511,"about_ca_system_score_codex":0.0008433412,"about_ca_system_score_gemma":0.0009806182,"threshold_uncertainty_score":0.04070437},"labels":[],"label_agreement":null},{"id":"W2407207612","doi":"10.1016/j.tcs.2016.02.036","title":"Permuted scaled matching","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Substring; Permutation (music); Matching (statistics); String searching algorithm; Mathematics; Scaling; Computer science; 3-dimensional matching; Pattern matching; Algorithm; Blossom algorithm; Artificial intelligence; Set (abstract data type); Statistics","score_opus":0.007325258038249031,"score_gpt":0.23932446873999386,"score_spread":0.2319992107017448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407207612","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.13697232,0.0007363405,0.7425933,0.0017965401,0.0012828963,0.00039141037,0.0020020716,0.0027018392,0.11152326],"genre_scores_gemma":[0.6274848,0.00048258217,0.29359052,0.0012732962,0.0004648201,0.00033034303,0.0027812696,0.001082329,0.072510116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980567,0.00046478852,0.00014365722,0.0006049566,0.0004998241,0.00023009689],"domain_scores_gemma":[0.99756926,0.00043529808,0.00014416019,0.0013400154,0.0003614057,0.00014990717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011468186,0.0005107453,0.0009306325,0.0014323164,0.0011205982,0.0019465477,0.001283542,0.0015413167,0.029800449],"category_scores_gemma":[0.006378703,0.00039675858,0.00088897184,0.0020132996,0.0013975211,0.0033205573,0.0030265094,0.0014759641,0.006980914],"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.0006390491,0.00019965676,0.0009769747,0.00017939426,0.00007910231,0.0003523738,0.00020625207,0.013995088,0.014058551,0.7428029,0.020684566,0.20582604],"study_design_scores_gemma":[0.00010242125,0.00017842017,0.00071487785,0.000050597184,0.0000614859,0.0006345864,0.00014025331,0.08018687,0.013913371,0.8608843,0.043085013,0.000047737536],"about_ca_topic_score_codex":0.0004650009,"about_ca_topic_score_gemma":0.00047378294,"teacher_disagreement_score":0.029800449,"about_ca_system_score_codex":0.0006981053,"about_ca_system_score_gemma":0.00094743667,"threshold_uncertainty_score":0.099692404},"labels":[],"label_agreement":null},{"id":"W2409994095","doi":"10.1016/j.tcs.2016.04.046","title":"An FPTAS for the parallel two-stage flowshop problem","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Alberta Innovates - Technology Futures; Program for Changjiang Scholars and Innovative Research Team in University; Georgia Southern University","keywords":"Job shop scheduling; Schedule; Subroutine; Computer science; Mathematical optimization; Scheme (mathematics); Dynamic programming; Time complexity; Scheduling (production processes); Polynomial-time approximation scheme; Parallel computing; Algorithm; Mathematics","score_opus":0.01124981111899529,"score_gpt":0.25387417817360247,"score_spread":0.2426243670546072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409994095","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.046869136,0.0011969669,0.9175806,0.0022314861,0.00034612976,0.0003128227,0.0007926742,0.0007167066,0.029953437],"genre_scores_gemma":[0.5129418,0.0015178876,0.4658834,0.00061448076,0.00032635964,0.00068209774,0.0009257236,0.00021949041,0.016888807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946314,0.00012176258,0.000017992537,0.00012922607,0.00012248303,0.00014546732],"domain_scores_gemma":[0.9989172,0.00078949094,0.0000562729,0.00007115624,0.00008696563,0.000078924364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010944058,0.0013291903,0.0016400542,0.0005940404,0.0006681157,0.0016291885,0.002183455,0.002491815,0.006700086],"category_scores_gemma":[0.0033073886,0.00073353795,0.0010401516,0.0011348936,0.0007863067,0.0019338615,0.0016781155,0.0028334754,0.0004660235],"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.00022731407,0.00021166615,0.00032077124,0.00025879967,0.000057173052,0.00015313353,0.0000701178,0.89343995,0.000999771,0.04324216,0.009320615,0.051698506],"study_design_scores_gemma":[0.000075149976,0.00005325751,0.000080565056,0.000020201918,0.000021961707,0.000045930334,0.00002518902,0.97052956,0.00019803821,0.027097845,0.0018448948,0.0000074941318],"about_ca_topic_score_codex":0.009737051,"about_ca_topic_score_gemma":0.009184299,"teacher_disagreement_score":0.009737051,"about_ca_system_score_codex":0.0019238776,"about_ca_system_score_gemma":0.0030293365,"threshold_uncertainty_score":0.022414088},"labels":[],"label_agreement":null},{"id":"W2416495215","doi":"10.1016/j.tcs.2016.04.041","title":"A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisfiability; Probabilistic logic; Constraint programming; Constraint (computer-aided design); Computer science; Mathematics; Programming language; Theoretical computer science; Algorithm; Mathematical optimization; Discrete mathematics; Stochastic programming; Artificial intelligence","score_opus":0.021345531829380798,"score_gpt":0.2795715204165245,"score_spread":0.2582259885871437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416495215","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.045263797,0.0019543415,0.94351447,0.0031012339,0.00008902058,0.0001217828,0.00021785981,0.00016515394,0.0055723516],"genre_scores_gemma":[0.77998656,0.0027392271,0.20886055,0.0011827571,0.0010790782,0.0005303315,0.00053248997,0.0003809343,0.004708022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98133415,0.00983005,0.0007323736,0.0027709296,0.004311186,0.0010213512],"domain_scores_gemma":[0.7592135,0.21593028,0.0075586485,0.009279155,0.0057854825,0.0022329306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021959469,0.0015775829,0.0025925904,0.005150724,0.0025302062,0.0058746906,0.0062833694,0.0035918872,0.007851372],"category_scores_gemma":[0.14525206,0.0022656724,0.004461513,0.006698373,0.012672804,0.020542827,0.006666575,0.009610184,0.00033581242],"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.00007731058,0.00005346146,0.0015191232,0.00019630053,0.00008441332,0.000071261384,0.00033082417,0.03617547,0.00036042582,0.9461891,0.0009885369,0.013953759],"study_design_scores_gemma":[0.000023162409,0.0000423891,0.0005274785,0.000057196776,0.00004293141,0.000106084124,0.00008250998,0.15321995,0.00020586805,0.8447835,0.000879741,0.000029236415],"about_ca_topic_score_codex":0.003622274,"about_ca_topic_score_gemma":0.002798101,"teacher_disagreement_score":0.021959469,"about_ca_system_score_codex":0.0040244176,"about_ca_system_score_gemma":0.0025096843,"threshold_uncertainty_score":0.11613417},"labels":[],"label_agreement":null},{"id":"W2418872760","doi":"10.1016/j.tcs.2016.04.044","title":"Approximating the restricted 1-center in graphs","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Combinatorics; Saddle point; Approximation algorithm; Center (category theory); Separable space; Binary logarithm; Vertex (graph theory); Discrete mathematics; Matrix (chemical analysis); Distance matrix; Graph; Mathematical analysis; Geometry","score_opus":0.01411976057326362,"score_gpt":0.24352743115335584,"score_spread":0.22940767058009223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2418872760","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.5172235,0.0015981324,0.4462451,0.003067892,0.00019171179,0.00015938075,0.0011861658,0.0029052421,0.027422884],"genre_scores_gemma":[0.8436321,0.00067698414,0.1449451,0.00058902474,0.00018795962,0.00013290026,0.0012549639,0.0008852978,0.0076956106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809104,0.0006060385,0.000061480096,0.00051992823,0.00032417808,0.00039729092],"domain_scores_gemma":[0.9903232,0.005803543,0.0008799648,0.001663444,0.00063362933,0.00069621165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015875235,0.0016883251,0.0022247126,0.002095137,0.0017644865,0.0037764178,0.004173864,0.002660084,0.008777607],"category_scores_gemma":[0.013544708,0.0009947508,0.0011421551,0.0025398799,0.0028682442,0.007931477,0.004141177,0.0033616386,0.001779266],"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.0022399249,0.0006475649,0.006227577,0.0009798787,0.00014335102,0.0002793561,0.0012314415,0.3115381,0.011370081,0.53129655,0.02857249,0.105473764],"study_design_scores_gemma":[0.00012598027,0.00009017427,0.000592956,0.000055563927,0.000057527446,0.00015208835,0.00024002997,0.3988565,0.003825093,0.5926297,0.0033468888,0.000027499394],"about_ca_topic_score_codex":0.0045433976,"about_ca_topic_score_gemma":0.0066738417,"teacher_disagreement_score":0.008777607,"about_ca_system_score_codex":0.0031950076,"about_ca_system_score_gemma":0.0015198193,"threshold_uncertainty_score":0.02936405},"labels":[],"label_agreement":null},{"id":"W242605419","doi":"10.1016/j.tcs.2015.05.005","title":"An adaptive algorithm for group testing for complexes","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"SARS-CoV-2 detection and testing","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Group testing; Cardinality (data modeling); Mathematics; Generalization; Group (periodic table); Combinatorics; Algorithm; Property testing; Set (abstract data type); Binary number; Polynomial; Discrete mathematics; Computer science; Arithmetic; Data mining","score_opus":0.09479870449260654,"score_gpt":0.3446798799702559,"score_spread":0.24988117547764938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W242605419","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.0037866342,0.0000380889,0.99509215,0.00008034006,0.00003447891,0.000042716896,0.000032454624,0.00039029875,0.0005027814],"genre_scores_gemma":[0.08977594,0.000047570746,0.9075995,0.00013782234,0.00007671817,0.00024010913,0.00025221167,0.00015625345,0.001713849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774617,0.0007417267,0.00016576129,0.00047877646,0.00066839525,0.00019910219],"domain_scores_gemma":[0.99196553,0.005001605,0.0003668563,0.0012160116,0.001182342,0.00026764118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025839931,0.0011720737,0.0011987893,0.0018144465,0.000701755,0.001359136,0.0026910128,0.0017414322,0.005890471],"category_scores_gemma":[0.017325178,0.0004698757,0.00091894495,0.0012797725,0.0012540253,0.0020849998,0.003183762,0.0021091397,0.0020382786],"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.000854869,0.00021215067,0.0029598335,0.00017210873,0.00013392585,0.00017297805,0.00027140774,0.11950601,0.017637987,0.068784826,0.007942768,0.7813511],"study_design_scores_gemma":[0.000086746164,0.00011743776,0.00041019914,0.000016002856,0.000024061514,0.0001297219,0.00003893309,0.94529635,0.0034407612,0.048180893,0.0022399316,0.000018916418],"about_ca_topic_score_codex":0.0018513852,"about_ca_topic_score_gemma":0.001846343,"teacher_disagreement_score":0.005890471,"about_ca_system_score_codex":0.00070147077,"about_ca_system_score_gemma":0.0015927008,"threshold_uncertainty_score":0.019705534},"labels":[],"label_agreement":null},{"id":"W2460638073","doi":"10.1016/j.tcs.2007.05.022","title":"Width versus size in resolution proofs","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Resolution (logic); Mathematical proof; Exponential function; Theme (computing); Propositional calculus; Computer science; Upper and lower bounds; Mathematics; Calculus (dental); Discrete mathematics; Combinatorics; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.024770213205656318,"score_gpt":0.2673765226264571,"score_spread":0.2426063094208008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460638073","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.08038745,0.005472129,0.7972524,0.023114653,0.00092289964,0.00022279903,0.00055224024,0.0023393438,0.08973604],"genre_scores_gemma":[0.8106068,0.0023307486,0.16306978,0.0022242854,0.0012801916,0.00030214063,0.00038449286,0.0014845512,0.018317018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9738599,0.014220714,0.0018024733,0.0029043707,0.0053071743,0.0019053386],"domain_scores_gemma":[0.7654049,0.20241277,0.004801878,0.018940378,0.005282897,0.0031571686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020705163,0.0017047678,0.003042107,0.0051568463,0.005854294,0.011517993,0.005420415,0.0046913447,0.023139024],"category_scores_gemma":[0.13935645,0.0038638848,0.0027236585,0.006211633,0.014679385,0.06599607,0.0144218495,0.010131148,0.0025444902],"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.00012295233,0.000030365343,0.0003111348,0.00012505849,0.000017377502,0.000045568482,0.0005912937,0.0011546316,0.00020595,0.9808189,0.0016435887,0.014933025],"study_design_scores_gemma":[0.000028483495,0.00001619584,0.000040038016,0.0000395269,0.000026962025,0.0000411913,0.00010110688,0.003213392,0.0005259035,0.99354255,0.0024099394,0.000014594331],"about_ca_topic_score_codex":0.0010937778,"about_ca_topic_score_gemma":0.00091371435,"teacher_disagreement_score":0.023139024,"about_ca_system_score_codex":0.0037111223,"about_ca_system_score_gemma":0.0026221755,"threshold_uncertainty_score":0.109500706},"labels":[],"label_agreement":null},{"id":"W2470754857","doi":"10.1016/j.tcs.2016.06.022","title":"Mitigating covert channels based on analysis of the potential for communication","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Covert; Covert channel; Computer science; Concurrency; Channel (broadcasting); Limiting; Communications system; Order (exchange); Distributed computing; Theoretical computer science; Computer network; Engineering","score_opus":0.013632418037605558,"score_gpt":0.263277827929747,"score_spread":0.24964540989214146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470754857","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.06849689,0.0007947612,0.9025029,0.0018001953,0.00017647108,0.00009148565,0.00013965843,0.00032371227,0.025673918],"genre_scores_gemma":[0.9584978,0.00077325414,0.035349477,0.00017683623,0.0001659693,0.00008276757,0.000054047643,0.00009354158,0.0048061875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751914,0.0007095501,0.00005933145,0.0003011982,0.00094801123,0.00046278053],"domain_scores_gemma":[0.9773332,0.018332472,0.0010260874,0.001780713,0.0012086161,0.00031888086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002249058,0.0011556129,0.0012093846,0.0016909546,0.0012618821,0.002285386,0.0016226611,0.002172704,0.0071630594],"category_scores_gemma":[0.02035769,0.0006468832,0.0008735137,0.00090015243,0.0031485746,0.0065593664,0.0027663761,0.0023890065,0.0005862064],"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.0002508797,0.00006753302,0.00083737186,0.0002355834,0.00007941369,0.00032989815,0.00022201648,0.3204152,0.010016822,0.6388426,0.0027783879,0.025924291],"study_design_scores_gemma":[0.000012785701,0.000051116716,0.00015368007,0.00004080646,0.00002959134,0.00023172356,0.000056149936,0.73861516,0.004029347,0.25537288,0.0013810256,0.000025768457],"about_ca_topic_score_codex":0.00068127434,"about_ca_topic_score_gemma":0.0007807773,"teacher_disagreement_score":0.0071630594,"about_ca_system_score_codex":0.0016226409,"about_ca_system_score_gemma":0.001529988,"threshold_uncertainty_score":0.023962796},"labels":[],"label_agreement":null},{"id":"W2472694993","doi":"10.1016/j.tcs.2016.06.027","title":"Conspiracy number search with relative sibling scores","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo tree search; Heuristic; Null-move heuristic; Champion; Computer science; Tree (set theory); Node (physics); Iterative deepening depth-first search; Search tree; Game tree; Search algorithm; Bidirectional search; Mathematics; Algorithm; Theoretical computer science; Best-first search; Beam search; Monte Carlo method; Artificial intelligence; Statistics; Combinatorics; Game theory; Sequential game","score_opus":0.029266208269517896,"score_gpt":0.3119599208179767,"score_spread":0.28269371254845876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472694993","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.7669726,0.0005575208,0.19973658,0.0009137626,0.00012200104,0.00017404507,0.00035042013,0.0009139783,0.030259112],"genre_scores_gemma":[0.9766568,0.000046342215,0.018715376,0.000047088695,0.000030643714,0.000035184825,0.0001336526,0.00004980478,0.0042852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981639,0.00080480654,0.0000637329,0.00030093707,0.00039609298,0.0002705159],"domain_scores_gemma":[0.9854177,0.010658452,0.00081970246,0.0017232754,0.00068149186,0.00069931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023319342,0.00048990594,0.0013834119,0.0013557574,0.0007818543,0.0012839467,0.002023549,0.001231268,0.011621831],"category_scores_gemma":[0.0282365,0.00029214335,0.00043378508,0.0014024022,0.0009993879,0.004248791,0.0019390602,0.0008667859,0.0009156674],"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.005539517,0.0016250032,0.034310553,0.00051010645,0.00027124304,0.00045219745,0.0005834951,0.2723821,0.0067095724,0.23698547,0.018042242,0.4225886],"study_design_scores_gemma":[0.00015166897,0.00042846645,0.0027991063,0.000025280016,0.000055357406,0.00015562281,0.00010519267,0.9009611,0.00079866056,0.09362088,0.0008738407,0.000024908317],"about_ca_topic_score_codex":0.0029493398,"about_ca_topic_score_gemma":0.005080136,"teacher_disagreement_score":0.011621831,"about_ca_system_score_codex":0.00087491353,"about_ca_system_score_gemma":0.0013395183,"threshold_uncertainty_score":0.038878918},"labels":[],"label_agreement":null},{"id":"W2484948871","doi":"10.1016/j.tcs.2012.12.012","title":"Quantum entanglement and the communication complexity of the inner product function","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Waterloo","funders":"","keywords":"Computer science; Quantum entanglement; Communication complexity; Quantum information science; Product (mathematics); Probabilistic logic; Bounded function; Theoretical computer science; Mathematical proof; Quantum capacity; Function (biology); Quantum; Discrete mathematics; Mathematics; Quantum network; Quantum mechanics; Physics","score_opus":0.02005179859931104,"score_gpt":0.25480346788828306,"score_spread":0.234751669288972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484948871","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.5724597,0.0046474948,0.33168933,0.013037516,0.00045278217,0.000066305976,0.000663314,0.00019437721,0.07678923],"genre_scores_gemma":[0.9852331,0.0009104714,0.009879649,0.0002637324,0.00065147283,0.00005953112,0.000117119416,0.00004579439,0.0028390435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969997,0.0012711246,0.00013191781,0.00041641522,0.0007825968,0.00039818147],"domain_scores_gemma":[0.9718463,0.022896908,0.00166324,0.0019079928,0.0009274096,0.000758257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033528653,0.0006173268,0.001443773,0.0015838809,0.0020017028,0.0048436513,0.001559138,0.002599905,0.0045823758],"category_scores_gemma":[0.01935363,0.0006384024,0.0008421177,0.0013830746,0.00716481,0.013033519,0.003695912,0.004133819,0.0005394652],"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.000048400183,0.000021948936,0.00023959474,0.000029903635,0.000009163851,0.000044811713,0.0001365744,0.0053829937,0.00038663964,0.99081624,0.00048255487,0.0024012532],"study_design_scores_gemma":[0.000008201245,0.000011102455,0.00019016863,0.000008831715,0.000004294947,0.00003863164,0.000025553683,0.02500269,0.00017852035,0.9741279,0.000386508,0.00001745256],"about_ca_topic_score_codex":0.0008661535,"about_ca_topic_score_gemma":0.00044257738,"teacher_disagreement_score":0.0048436513,"about_ca_system_score_codex":0.0014647976,"about_ca_system_score_gemma":0.0009601873,"threshold_uncertainty_score":0.017731845},"labels":[],"label_agreement":null},{"id":"W2485167870","doi":"10.1016/j.tcs.2016.07.039","title":"Dynamic range majority data structures","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Data structure; Amortized analysis; Combinatorics; Range (aeronautics); Mathematics; Set (abstract data type); Range query (database); Constant (computer programming); Space (punctuation); Upper and lower bounds; Fraction (chemistry); Discrete mathematics; Computer science; Information retrieval; Search engine; Web search query; Sargable","score_opus":0.017063029502736967,"score_gpt":0.2707024161268978,"score_spread":0.25363938662416086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485167870","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.087009996,0.0036949562,0.80785865,0.0037583492,0.0007176562,0.0003538441,0.002767169,0.009431952,0.08440739],"genre_scores_gemma":[0.75263995,0.0016094603,0.18388845,0.0018367682,0.00074819353,0.0004969233,0.0038384043,0.0015150269,0.053426847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739146,0.00039304516,0.00024150143,0.00051993754,0.001061312,0.0003927278],"domain_scores_gemma":[0.9925206,0.0014000565,0.00051957055,0.00417253,0.0010214637,0.00036590517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017289986,0.00061103713,0.0011653029,0.0015024344,0.0018723345,0.0031360162,0.0022386836,0.000989849,0.021848446],"category_scores_gemma":[0.007924457,0.0006218028,0.00059873925,0.002656155,0.0015251806,0.009956718,0.008259778,0.0023781192,0.0066508595],"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.0012137407,0.0002244516,0.0017525745,0.00047346394,0.00008293515,0.0001500134,0.0005419875,0.009886152,0.018304272,0.56716424,0.038695306,0.36151087],"study_design_scores_gemma":[0.00018864845,0.00048982294,0.0006832476,0.00016091116,0.00013957557,0.00072619045,0.0003605571,0.04592128,0.055695154,0.77712196,0.11839302,0.0001197204],"about_ca_topic_score_codex":0.000272034,"about_ca_topic_score_gemma":0.00044314665,"teacher_disagreement_score":0.021848446,"about_ca_system_score_codex":0.000749058,"about_ca_system_score_gemma":0.0011555842,"threshold_uncertainty_score":0.073090315},"labels":[],"label_agreement":null},{"id":"W2491829515","doi":"10.1016/j.tcs.2015.09.011","title":"The Beachcombers' Problem: Walking and searching with mobile robots","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Schedule; Mobile robot; Set (abstract data type); Computer science; Algorithm; Line segment; Real-time computing; Artificial intelligence","score_opus":0.012996402439254037,"score_gpt":0.26030036725639494,"score_spread":0.2473039648171409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491829515","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.09661519,0.0029320768,0.8785539,0.0029192844,0.00038140223,0.00012676041,0.0003782927,0.00027711136,0.01781598],"genre_scores_gemma":[0.6649534,0.0027700062,0.28804043,0.0004308583,0.00030533815,0.00026791764,0.0005521751,0.00017803082,0.04250179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999642,0.00012865583,0.000016979679,0.00009848282,0.00007158331,0.00004228098],"domain_scores_gemma":[0.9993112,0.00045320462,0.000055862118,0.00006619256,0.000040850893,0.00007266413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005329707,0.0006806701,0.0010838592,0.00060681585,0.0009531616,0.001510284,0.001657647,0.003808054,0.0060696956],"category_scores_gemma":[0.0041774646,0.00063352316,0.0008020423,0.0012614838,0.0015348529,0.0027343663,0.0019931383,0.0014309831,0.00061003945],"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.0006167785,0.00017859548,0.001815453,0.00055061834,0.00013147134,0.0007028281,0.00047229294,0.5629424,0.0031806498,0.24976745,0.018121397,0.16152011],"study_design_scores_gemma":[0.000120578,0.00011402332,0.00051481486,0.0000503642,0.000029168219,0.00029134238,0.0002697788,0.7842691,0.0010494267,0.20138343,0.011871423,0.000036539222],"about_ca_topic_score_codex":0.0034492856,"about_ca_topic_score_gemma":0.0034685754,"teacher_disagreement_score":0.0060696956,"about_ca_system_score_codex":0.0004298337,"about_ca_system_score_gemma":0.0006267554,"threshold_uncertainty_score":0.020305157},"labels":[],"label_agreement":null},{"id":"W2493758942","doi":"10.1016/j.tcs.2017.03.040","title":"Outfix-guided insertion","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Ministry of Education, Science and Technology; Ministry of Science, ICT and Future Planning","keywords":"Mathematics; Computer science","score_opus":0.021440013269191774,"score_gpt":0.2984234565227588,"score_spread":0.27698344325356705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493758942","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.0820503,0.0002829752,0.84545726,0.0005672015,0.0005797736,0.00024978642,0.00096361974,0.019562729,0.050286364],"genre_scores_gemma":[0.4873424,0.0002568443,0.4381026,0.00077996106,0.00012515037,0.00023392205,0.002306669,0.0066285,0.06422388],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998823,0.0001502574,0.00006088789,0.00031003242,0.0003899392,0.00026589437],"domain_scores_gemma":[0.9979119,0.0005199289,0.000100409095,0.0010386157,0.00033340836,0.00009568091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007530898,0.0014745011,0.0011157969,0.0010384767,0.001332904,0.0017136821,0.0022359693,0.0018006988,0.027301988],"category_scores_gemma":[0.0027459385,0.00064777356,0.0011586772,0.0010481861,0.0014079906,0.0021514702,0.0037879632,0.0017409405,0.008558124],"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.0015232457,0.0004130331,0.00321057,0.0005926888,0.000118293145,0.00092686183,0.0007066716,0.021652233,0.10378535,0.18477736,0.030486643,0.65180707],"study_design_scores_gemma":[0.00022557395,0.0006439384,0.0019076681,0.00018847788,0.00023010507,0.0017628311,0.0004888711,0.21096721,0.297805,0.3284517,0.15710868,0.00022002707],"about_ca_topic_score_codex":0.0011242153,"about_ca_topic_score_gemma":0.0024440528,"teacher_disagreement_score":0.027301988,"about_ca_system_score_codex":0.0007747074,"about_ca_system_score_gemma":0.0011553575,"threshold_uncertainty_score":0.09133428},"labels":[],"label_agreement":null},{"id":"W2495876702","doi":"10.1016/j.tcs.2016.07.018","title":"An efficient method to evaluate intersections on big data sets","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Trie; Intersection (aeronautics); Identifier; Computer science; Context (archaeology); Set (abstract data type); Interval (graph theory); Theoretical computer science; Tree (set theory); Search tree; Sequence (biology); Data structure; Node (physics); Inverted index; Algorithm; Binary tree; Data mining; Mathematics; Information retrieval; Search algorithm; Search engine indexing; Combinatorics","score_opus":0.0577306352145133,"score_gpt":0.3662562790384329,"score_spread":0.30852564382391956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495876702","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.018818097,0.00047747628,0.973612,0.00019317026,0.00016205576,0.0001830461,0.0005279702,0.004251319,0.0017747766],"genre_scores_gemma":[0.12548777,0.00024402008,0.8683389,0.00008932427,0.00017042331,0.00036014093,0.0019304166,0.0004952567,0.0028837223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954035,0.0006258845,0.000348058,0.0004569422,0.0029061914,0.00025950026],"domain_scores_gemma":[0.9906889,0.003800943,0.00053544325,0.0017039493,0.0028818068,0.00038880878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024022132,0.0014911154,0.0019562747,0.00627069,0.0015316942,0.0031232492,0.0024799742,0.0012288633,0.0072985482],"category_scores_gemma":[0.015447699,0.00083800097,0.001177552,0.005835533,0.001228525,0.0041599046,0.0040447125,0.0019883986,0.0025069413],"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.0008876733,0.0003233031,0.0075156274,0.00038165302,0.00023572314,0.00020557805,0.0003489428,0.060256418,0.015029802,0.043009993,0.01822136,0.8535838],"study_design_scores_gemma":[0.000092812494,0.00023021337,0.002007308,0.00005357874,0.00009115059,0.0003766025,0.00024536278,0.9000005,0.01759457,0.067030154,0.012214665,0.00006307233],"about_ca_topic_score_codex":0.0024693508,"about_ca_topic_score_gemma":0.004130742,"teacher_disagreement_score":0.0072985482,"about_ca_system_score_codex":0.0010971763,"about_ca_system_score_gemma":0.0026833236,"threshold_uncertainty_score":0.024416089},"labels":[],"label_agreement":null},{"id":"W2523839178","doi":"10.1016/j.tcs.2017.05.001","title":"Functional clones and expressibility of partition functions","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Partition (number theory); Combinatorics; Functional analysis; Multiplication (music); Boolean function; Discrete mathematics; Constraint (computer-aided design); Set (abstract data type); Lattice (music); Computer science; Biology; Physics; Genetics","score_opus":0.02092870772223816,"score_gpt":0.2655031272994424,"score_spread":0.24457441957720427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523839178","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.60933805,0.00056966435,0.35272196,0.0011586399,0.00008559753,0.000051439474,0.0002465445,0.000701715,0.035126437],"genre_scores_gemma":[0.9668695,0.00029261902,0.023206938,0.00018207877,0.00009292157,0.0000985469,0.0002503765,0.00021867653,0.008788346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996743,0.00079958775,0.00022251211,0.0006672372,0.0008531649,0.00071451615],"domain_scores_gemma":[0.98968714,0.006323983,0.0007212885,0.0016711914,0.0009948267,0.00060150813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033836209,0.00086562586,0.0013766238,0.0025047697,0.002425663,0.0066967546,0.0019714048,0.0023207865,0.0039882604],"category_scores_gemma":[0.012154943,0.0010873678,0.0017721023,0.002943715,0.005823379,0.010954751,0.0043199393,0.0033358638,0.0005535239],"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.000036376554,0.000013894414,0.00036639755,0.000016555445,0.000007641393,0.0000776293,0.00057628355,0.0007963968,0.0010620091,0.9937656,0.00015864841,0.0031225858],"study_design_scores_gemma":[0.00002278552,0.00001586253,0.00021933894,0.000010848672,0.000023538243,0.00016448782,0.00013553516,0.0043558488,0.0015050849,0.9923099,0.0012220398,0.000014600878],"about_ca_topic_score_codex":0.0014410135,"about_ca_topic_score_gemma":0.0009903946,"teacher_disagreement_score":0.0066967546,"about_ca_system_score_codex":0.002392763,"about_ca_system_score_gemma":0.0010529913,"threshold_uncertainty_score":0.017894506},"labels":[],"label_agreement":null},{"id":"W2530989744","doi":"10.1016/j.tcs.2016.09.020","title":"Rate-limited secure function evaluation","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Technische Universität Darmstadt; Aarhus Universitet","keywords":"Function (biology); Computer science; Mathematics; Algorithm; Biology","score_opus":0.013407019797567228,"score_gpt":0.25250418889849796,"score_spread":0.23909716910093073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530989744","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.04494461,0.0011858561,0.91329426,0.0023938967,0.00031400114,0.00019992741,0.00033204292,0.0016455693,0.035689816],"genre_scores_gemma":[0.85885113,0.00086936774,0.111414455,0.0005568049,0.00043427592,0.00027301593,0.0003403485,0.00042349016,0.026837008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99224174,0.0027366676,0.00036111323,0.00066591456,0.0030429016,0.0009517378],"domain_scores_gemma":[0.9856719,0.0066817137,0.00057230075,0.0050451956,0.0015428928,0.000485984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006871714,0.0013863147,0.0019612703,0.0016234138,0.0011983276,0.0039450806,0.0021948207,0.0018244929,0.00980815],"category_scores_gemma":[0.022653999,0.00060564006,0.0011951142,0.0013157555,0.0028594327,0.0076629734,0.0060884226,0.003710678,0.003639734],"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.0012256806,0.00012697473,0.000638414,0.00020734768,0.000055755,0.0001603792,0.00013949862,0.034054022,0.0075322147,0.8514071,0.0069050374,0.09754761],"study_design_scores_gemma":[0.00011000826,0.00026380853,0.00024316327,0.000097202304,0.000060416358,0.0004490711,0.000031175638,0.26969838,0.017244026,0.7045877,0.0071591125,0.000055898065],"about_ca_topic_score_codex":0.00037126828,"about_ca_topic_score_gemma":0.00033565768,"teacher_disagreement_score":0.00980815,"about_ca_system_score_codex":0.0026412408,"about_ca_system_score_gemma":0.0021464406,"threshold_uncertainty_score":0.036341548},"labels":[],"label_agreement":null},{"id":"W2538425405","doi":"10.1016/j.tcs.2016.10.005","title":"Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Computer science; Algorithm; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.010856704063362848,"score_gpt":0.2600031196010287,"score_spread":0.24914641553766584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538425405","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.09093884,0.0008242608,0.89325315,0.0012772125,0.00017871441,0.00014531153,0.00019079648,0.0003252872,0.012866425],"genre_scores_gemma":[0.60611475,0.00081366755,0.37258533,0.0005721698,0.00030871382,0.00039737325,0.00072101626,0.00029333265,0.01819367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764854,0.0007383147,0.00019847778,0.00057493156,0.00055688043,0.00028284563],"domain_scores_gemma":[0.9853968,0.011812475,0.0006133443,0.0007606317,0.0009468228,0.00046998716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027552198,0.000696236,0.0010191023,0.0017188314,0.0017716711,0.003755278,0.0023142903,0.0015051119,0.0069926055],"category_scores_gemma":[0.014374397,0.0006111882,0.0014954823,0.0018330109,0.0024632765,0.005685109,0.0028487,0.0034430628,0.0008863262],"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.00021620859,0.0000788069,0.0008626292,0.00015714142,0.000029802897,0.000044913526,0.00041017716,0.015832193,0.0013308473,0.92471415,0.0026481424,0.053675033],"study_design_scores_gemma":[0.00003167858,0.000034745095,0.000109395325,0.000024322931,0.00001539609,0.0000493002,0.000070585615,0.067378454,0.00093185715,0.92983603,0.0015028352,0.000015377718],"about_ca_topic_score_codex":0.001363463,"about_ca_topic_score_gemma":0.0017119886,"teacher_disagreement_score":0.0069926055,"about_ca_system_score_codex":0.002448619,"about_ca_system_score_gemma":0.0019804952,"threshold_uncertainty_score":0.023392618},"labels":[],"label_agreement":null},{"id":"W2548497170","doi":"10.1016/j.tcs.2018.05.030","title":"Whom to befriend to influence people","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Influencer marketing; Dominating set; Time complexity; DTIME; Computer science; Social network (sociolinguistics); Set (abstract data type); Viral marketing; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science; Graph; Computation; Algorithm; Vertex (graph theory); Social media","score_opus":0.004446420588320317,"score_gpt":0.2697570541844836,"score_spread":0.26531063359616325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548497170","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.48554212,0.0064822957,0.0769385,0.028180402,0.003328181,0.0004496615,0.0019791042,0.0011538615,0.3959459],"genre_scores_gemma":[0.9051752,0.001392446,0.0057309815,0.0018563768,0.0012942173,0.00009811751,0.00037237673,0.00015371987,0.08392654],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982279,0.0006700982,0.000042788415,0.00043628537,0.00039714688,0.00022582892],"domain_scores_gemma":[0.9933903,0.002053145,0.0009072777,0.0007449041,0.0010892255,0.0018151327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001230908,0.000489205,0.00060525833,0.0013440901,0.0029458797,0.0025411122,0.0006233827,0.0014028536,0.024463193],"category_scores_gemma":[0.011745221,0.00027995487,0.00042134026,0.0012139665,0.0007290804,0.0032249924,0.0013957303,0.0012191195,0.0062782858],"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.00066824333,0.0012016788,0.17605388,0.0010203029,0.0010123049,0.0035534299,0.018880099,0.003963733,0.011190165,0.15834646,0.17072275,0.45338696],"study_design_scores_gemma":[0.00015464102,0.0006582,0.11335869,0.00042404808,0.0011928314,0.006374276,0.02219347,0.033186607,0.010364429,0.17077316,0.641076,0.00024363997],"about_ca_topic_score_codex":0.0040733516,"about_ca_topic_score_gemma":0.0059962613,"teacher_disagreement_score":0.024463193,"about_ca_system_score_codex":0.00066073926,"about_ca_system_score_gemma":0.00064215163,"threshold_uncertainty_score":0.081837595},"labels":[],"label_agreement":null},{"id":"W2549642977","doi":"10.1016/j.tcs.2016.11.014","title":"Covering points with convex sets of minimum size","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Automated Road and Building Extraction","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Ministry of Education; Hankuk University of Foreign Studies","keywords":"Perimeter; Mathematics; Regular polygon; Combinatorics; Cover (algebra); Bounded function; Plane (geometry); Cluster analysis; Convex set; Set (abstract data type); Algorithm; Computer science; Convex optimization; Geometry; Statistics; Mathematical analysis","score_opus":0.004117169033881237,"score_gpt":0.2045481531417101,"score_spread":0.20043098410782886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549642977","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.12518908,0.00085589493,0.86106855,0.00042754688,0.000052777294,0.00017318779,0.00083858316,0.00050718203,0.010887115],"genre_scores_gemma":[0.47822946,0.0010007672,0.51116,0.00016184938,0.000121823614,0.0004987657,0.002151677,0.0004935066,0.0061821635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810505,0.000489328,0.00014478751,0.00032640353,0.00073373236,0.00020064828],"domain_scores_gemma":[0.99196094,0.0056474637,0.00064927654,0.0009840822,0.00049279595,0.00026542298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011226748,0.0013188425,0.0022404278,0.0021717977,0.00078316673,0.0023744646,0.0020743643,0.0020832047,0.006253841],"category_scores_gemma":[0.01476473,0.0017913193,0.001713191,0.0035423234,0.0013675966,0.004017808,0.0033318333,0.0021393471,0.0013283842],"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.0010725384,0.000236139,0.0040574204,0.0011909918,0.00025872726,0.0006768209,0.0006896674,0.5514239,0.033215962,0.16433473,0.009116794,0.23372634],"study_design_scores_gemma":[0.000069430556,0.0002309816,0.002055872,0.000096833726,0.000066555825,0.0007269861,0.00017712948,0.8163369,0.011392568,0.16213225,0.006674379,0.000040114595],"about_ca_topic_score_codex":0.0014415667,"about_ca_topic_score_gemma":0.00119402,"teacher_disagreement_score":0.006253841,"about_ca_system_score_codex":0.000897318,"about_ca_system_score_gemma":0.00046670213,"threshold_uncertainty_score":0.02092117},"labels":[],"label_agreement":null},{"id":"W2550472248","doi":"10.1016/j.tcs.2016.11.019","title":"Evacuating two robots from multiple unknown exits in a circle","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Parameterized complexity; Mobile robot; Simple (philosophy); Computer science; Control (management); Mathematics; Domain (mathematical analysis); Algorithm; Topology (electrical circuits); Artificial intelligence; Combinatorics; Mathematical analysis","score_opus":0.017454379383506465,"score_gpt":0.27701269766194486,"score_spread":0.2595583182784384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550472248","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.5990949,0.00030464234,0.3846512,0.0014548191,0.00027640825,0.000223899,0.00019015095,0.00074155384,0.013062343],"genre_scores_gemma":[0.9122266,0.000109930836,0.075119704,0.00009833408,0.000041069925,0.00011631214,0.00020010416,0.0000726936,0.0120151965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992848,0.00015856195,0.000032396263,0.00022414004,0.00012422749,0.000175924],"domain_scores_gemma":[0.99812216,0.0008441504,0.00022645411,0.0002212197,0.00016041638,0.0004256319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084093586,0.000909897,0.001285131,0.0006012377,0.002633963,0.0015075627,0.0018091076,0.0032796473,0.003361567],"category_scores_gemma":[0.004284388,0.00077163585,0.0009365728,0.00053552195,0.0017016295,0.002240866,0.006597096,0.0019514831,0.0007818219],"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.0022881285,0.00029504762,0.0073547466,0.00023364332,0.0002227795,0.005775692,0.0019183183,0.90405256,0.011680099,0.031038892,0.0030102564,0.03212975],"study_design_scores_gemma":[0.00013708333,0.0005238684,0.0011790778,0.00003927121,0.0000595131,0.00045129153,0.0011324431,0.9749893,0.0056653763,0.012340453,0.0034179753,0.00006428705],"about_ca_topic_score_codex":0.0034380779,"about_ca_topic_score_gemma":0.0027251227,"teacher_disagreement_score":0.0034380779,"about_ca_system_score_codex":0.0007637346,"about_ca_system_score_gemma":0.0010895494,"threshold_uncertainty_score":0.011245489},"labels":[],"label_agreement":null},{"id":"W2552316968","doi":"10.1016/j.tcs.2016.10.015","title":"On prefix normal words and prefix normal forms","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Prefix; Word (group theory); Mathematics; Combinatorics; Context (archaeology); Equivalence (formal languages); Binary number; Unary operation; Discrete mathematics; Prefix code; Arithmetic; Algorithm; Linguistics","score_opus":0.006545220852153862,"score_gpt":0.22883456753285955,"score_spread":0.22228934668070569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552316968","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.06657339,0.00943918,0.8254542,0.006264267,0.0015049095,0.00016710814,0.0007030787,0.00077926426,0.08911466],"genre_scores_gemma":[0.64355975,0.014594988,0.25962132,0.0030593113,0.0041322946,0.0006491904,0.002137716,0.0011106799,0.07113475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964222,0.0010690225,0.00031493235,0.0006157191,0.0012594098,0.00031881913],"domain_scores_gemma":[0.990789,0.00577927,0.0004878601,0.001661426,0.0010479041,0.00023456366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020341887,0.001380013,0.0014449725,0.00414802,0.0019307515,0.0044678603,0.0014757715,0.002218086,0.010337066],"category_scores_gemma":[0.018868698,0.00077088573,0.0009829698,0.007663724,0.0063397232,0.017757779,0.0054999734,0.0042537143,0.002440621],"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.00004121688,0.000015523487,0.00015343269,0.000050611063,0.000005596151,0.00009197155,0.00024257242,0.002472934,0.0003764901,0.9610745,0.0025243252,0.03295087],"study_design_scores_gemma":[0.0000030298302,0.000006327766,0.000027153488,0.000018509621,0.0000035849698,0.000092961556,0.00003612303,0.005458115,0.0002339062,0.9903808,0.0037329374,0.0000065676422],"about_ca_topic_score_codex":0.0011344656,"about_ca_topic_score_gemma":0.00084611657,"teacher_disagreement_score":0.010337066,"about_ca_system_score_codex":0.001614827,"about_ca_system_score_gemma":0.0010151409,"threshold_uncertainty_score":0.034580886},"labels":[],"label_agreement":null},{"id":"W2561213546","doi":"10.1016/j.tcs.2019.10.021","title":"Kochen-Specker sets and Hadamard matrices","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical proof; Hadamard transform; Kochen–Specker theorem; Parity (physics); Class (philosophy); Simple (philosophy); Discrete mathematics; Combinatorics; Pure mathematics; Computer science; Physics; Quantum","score_opus":0.005715462573881126,"score_gpt":0.23983065091279487,"score_spread":0.23411518833891376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561213546","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.4751853,0.005235709,0.32790056,0.008010164,0.001243256,0.00013295481,0.00081990164,0.00046615966,0.181006],"genre_scores_gemma":[0.9363132,0.0013265857,0.03137098,0.00068532804,0.0007872814,0.000112423266,0.0003290643,0.00011797113,0.02895719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982083,0.0005399897,0.00010421003,0.00029082847,0.00055065786,0.00030599337],"domain_scores_gemma":[0.99704593,0.0015703903,0.00035516196,0.0004133164,0.0003396092,0.00027566517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001750906,0.0009504446,0.0014773262,0.0039851745,0.0028618835,0.0056709596,0.0016687186,0.002569537,0.009267408],"category_scores_gemma":[0.006812298,0.0007514686,0.001232074,0.0034337707,0.005657609,0.0076281778,0.003443922,0.004290281,0.0015314047],"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.000013477613,0.0000067472656,0.000029072053,0.000009391875,0.0000028033064,0.000019530005,0.000066940396,0.00037340168,0.00013774593,0.9979678,0.0002808918,0.0010921918],"study_design_scores_gemma":[0.0000048083893,0.0000033719025,0.00003555936,0.0000036601655,0.000001495682,0.000030022904,0.000020101887,0.0017045906,0.00014226335,0.99756867,0.0004785514,0.0000069292532],"about_ca_topic_score_codex":0.00073189527,"about_ca_topic_score_gemma":0.0004988753,"teacher_disagreement_score":0.009267408,"about_ca_system_score_codex":0.001595641,"about_ca_system_score_gemma":0.0009248265,"threshold_uncertainty_score":0.031002581},"labels":[],"label_agreement":null},{"id":"W2561282814","doi":"10.1016/j.tcs.2012.10.008","title":"Toward a classification of finite partial-monitoring games","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Computer science; Algebra over a field; Calculus (dental); Mathematical economics; Pure mathematics; Medicine","score_opus":0.18861928299444541,"score_gpt":0.44523061759891325,"score_spread":0.25661133460446783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561282814","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.24557751,0.000835944,0.71799576,0.002860869,0.00013304701,0.00032108408,0.00082899333,0.0004933768,0.030953398],"genre_scores_gemma":[0.8587171,0.0010147776,0.12542038,0.0007529499,0.0003526206,0.0005162153,0.0013755846,0.00017146689,0.011678917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737656,0.00089222775,0.00022439599,0.00053790025,0.0005310164,0.0004380242],"domain_scores_gemma":[0.9820806,0.012522177,0.0015024741,0.00130933,0.0010694418,0.0015159305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034687598,0.0013434393,0.0022488998,0.0023537725,0.0014819736,0.006151097,0.0034165827,0.0029028265,0.0064065703],"category_scores_gemma":[0.017986951,0.0007724241,0.001771059,0.001888042,0.0033472772,0.0074901246,0.0027719277,0.0053809755,0.00061575614],"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.00009889488,0.00011653577,0.0013865432,0.00008430033,0.000029424953,0.000044486576,0.00023478406,0.0121772215,0.0006283492,0.9686148,0.0025273354,0.014057473],"study_design_scores_gemma":[0.000051208568,0.000055851055,0.0005005774,0.000048852657,0.000021041928,0.00007383879,0.00007972777,0.13452259,0.00025422534,0.86278987,0.0015821848,0.00002015418],"about_ca_topic_score_codex":0.0017453134,"about_ca_topic_score_gemma":0.00150421,"teacher_disagreement_score":0.0064065703,"about_ca_system_score_codex":0.0025847172,"about_ca_system_score_gemma":0.0024180147,"threshold_uncertainty_score":0.021432102},"labels":[],"label_agreement":null},{"id":"W2564591273","doi":"10.1016/j.tcs.2017.03.035","title":"Computing real witness points of positive dimensional polynomial systems","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":17,"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":"Witness; Mathematics; Component (thermodynamics); Polynomial; Connected component; Perturbation (astronomy); Path (computing); Mathematical optimization; Algorithm; Computer science; Applied mathematics; Mathematical analysis; Discrete mathematics","score_opus":0.010384160367676391,"score_gpt":0.2589777510609282,"score_spread":0.2485935906932518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564591273","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.65577227,0.00054319814,0.32396114,0.0014247878,0.00016004292,0.00014987342,0.0011792557,0.0016309315,0.0151785435],"genre_scores_gemma":[0.9544945,0.00017131976,0.04031693,0.00007605633,0.000059901173,0.00003962958,0.00090018206,0.00015229634,0.0037892142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988859,0.00024297115,0.00007213336,0.00027424013,0.0003388943,0.00018584864],"domain_scores_gemma":[0.99416095,0.0035602148,0.00046675498,0.00084788864,0.00058304606,0.000381192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013823293,0.0008345824,0.0009798771,0.001111989,0.00093632337,0.0033444976,0.0017460529,0.0011662962,0.013071701],"category_scores_gemma":[0.012002594,0.0006704681,0.0006623779,0.0010555725,0.002238999,0.0069350186,0.004027645,0.002740586,0.0015058116],"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.0016428204,0.00027732644,0.008960074,0.00089547137,0.0001426799,0.00056363805,0.001416453,0.045149498,0.01337497,0.8248479,0.008865614,0.093863614],"study_design_scores_gemma":[0.0001174955,0.00013073265,0.00088554487,0.000060543305,0.000051566523,0.00017774467,0.0006013197,0.098731294,0.0074542374,0.8885062,0.0032476652,0.00003579496],"about_ca_topic_score_codex":0.000499651,"about_ca_topic_score_gemma":0.0009119775,"teacher_disagreement_score":0.013071701,"about_ca_system_score_codex":0.0010117341,"about_ca_system_score_gemma":0.0006355492,"threshold_uncertainty_score":0.043729126},"labels":[],"label_agreement":null},{"id":"W2582851771","doi":"10.1016/j.tcs.2017.01.028","title":"Algorithmic complexity of weakly semiregular partitioning and the representation number","year":2017,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","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; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Injective function; Bipartite graph; Vertex (graph theory); Graph; Conjecture; Modulo; Degree (music); Discrete mathematics; Induced subgraph; Physics","score_opus":0.031946229294501596,"score_gpt":0.29685800832948783,"score_spread":0.26491177903498625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582851771","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.56122017,0.001902078,0.376559,0.016801191,0.0002895084,0.00024456333,0.003521396,0.001123132,0.038339075],"genre_scores_gemma":[0.8912771,0.0010384048,0.09093754,0.0009206699,0.00046810976,0.00038689762,0.0031622944,0.00058862433,0.011220388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956214,0.0016949135,0.00018111069,0.0010539702,0.00084127847,0.0006073427],"domain_scores_gemma":[0.97418267,0.019832654,0.0014874376,0.0026582933,0.0008042925,0.0010346761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003343455,0.0011587236,0.002358204,0.0016279303,0.0018235596,0.009718994,0.00425977,0.0034463317,0.016461851],"category_scores_gemma":[0.025590448,0.0012840322,0.0018235779,0.00311088,0.004135425,0.013849601,0.004292606,0.004608028,0.001525875],"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.00097254396,0.00024974518,0.00472332,0.00055279845,0.000099438446,0.00016344267,0.0007024379,0.0825311,0.004013242,0.8492066,0.015545145,0.0412401],"study_design_scores_gemma":[0.00007231774,0.000032789278,0.0005537692,0.000029416602,0.000036790887,0.00011149785,0.00015326086,0.14174755,0.00093709276,0.85470283,0.0016008002,0.00002185112],"about_ca_topic_score_codex":0.0018319313,"about_ca_topic_score_gemma":0.0018956944,"teacher_disagreement_score":0.016461851,"about_ca_system_score_codex":0.0039568054,"about_ca_system_score_gemma":0.0025120955,"threshold_uncertainty_score":0.0550704},"labels":[],"label_agreement":null},{"id":"W2585764344","doi":"10.1016/j.tcs.2017.02.012","title":"Abelian-square-rich words","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Square (algebra); Abelian group; Combinatorics; Algebra over a field; Pure mathematics; Geometry","score_opus":0.012208342314047174,"score_gpt":0.2651676796845346,"score_spread":0.2529593373704874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585764344","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.6789692,0.0010429422,0.17574896,0.002416404,0.00047917245,0.00009031599,0.0009632015,0.0014891903,0.13880059],"genre_scores_gemma":[0.9640741,0.00015302333,0.010806942,0.0002512692,0.00019120639,0.00005153347,0.0004523542,0.00012438098,0.023895215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934834,0.00014861826,0.00005053816,0.00016995173,0.00014910664,0.0001334558],"domain_scores_gemma":[0.99819285,0.00083380204,0.00018570144,0.0002342499,0.00033262238,0.0002207778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050729216,0.0004992728,0.00057205564,0.0012285893,0.001585473,0.0025221894,0.0005211291,0.00073285215,0.009850912],"category_scores_gemma":[0.002139921,0.0004207312,0.00047591102,0.001144801,0.0023732889,0.004148024,0.0022675595,0.0011143581,0.0022914503],"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.00018919651,0.000022712144,0.00052669185,0.00006227054,0.000013560436,0.00027820456,0.0006074895,0.00046794125,0.0053396556,0.98443353,0.0019359774,0.0061227363],"study_design_scores_gemma":[0.000036049154,0.000027345097,0.0004690162,0.000011104413,0.000020607351,0.00041995134,0.00035990568,0.0020831185,0.0034777147,0.9832532,0.009821593,0.000020368627],"about_ca_topic_score_codex":0.00035697166,"about_ca_topic_score_gemma":0.0005039128,"teacher_disagreement_score":0.009850912,"about_ca_system_score_codex":0.00061262527,"about_ca_system_score_gemma":0.0004081818,"threshold_uncertainty_score":0.032954633},"labels":[],"label_agreement":null},{"id":"W2592557380","doi":"10.1016/j.tcs.2017.02.016","title":"Constructing an indeterminate string from its associated graph","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"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":"Combinatorics; Mathematics; Cardinality (data modeling); Discrete mathematics; Heuristics; Clique; Alphabet; String (physics); Vertex cover; Heuristic; Graph; Computer science; Mathematical optimization","score_opus":0.020535399402898905,"score_gpt":0.2824883555088229,"score_spread":0.261952956105924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592557380","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.12367845,0.00023089742,0.85234076,0.0012390743,0.0004003194,0.00015199093,0.0008807266,0.0018183204,0.019259423],"genre_scores_gemma":[0.5569551,0.00040656808,0.42619023,0.00034661283,0.000115479495,0.00020008461,0.0014304272,0.00089730474,0.013458288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925846,0.00017604505,0.00005312165,0.0001718727,0.00023378588,0.0001066126],"domain_scores_gemma":[0.99816006,0.000872809,0.000086616164,0.000540965,0.0002564681,0.00008313605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005724675,0.00053069816,0.0006121192,0.0013313815,0.00088048587,0.0016100378,0.0011342247,0.0013620037,0.006532608],"category_scores_gemma":[0.0049285335,0.00027125987,0.00057121547,0.0020485735,0.0009769291,0.0025437109,0.0017895995,0.0016299682,0.0021797472],"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.00065983494,0.00018182791,0.0015169035,0.00045464482,0.00003274634,0.00093428756,0.000571947,0.022739885,0.026367957,0.68752587,0.00954277,0.24947134],"study_design_scores_gemma":[0.00005033114,0.00015180276,0.00046431756,0.00008690455,0.000048924572,0.00061805156,0.00027023163,0.1183071,0.021740492,0.83840823,0.019798478,0.00005502679],"about_ca_topic_score_codex":0.0004955449,"about_ca_topic_score_gemma":0.00049114734,"teacher_disagreement_score":0.006532608,"about_ca_system_score_codex":0.0005061815,"about_ca_system_score_gemma":0.0006463114,"threshold_uncertainty_score":0.021853745},"labels":[],"label_agreement":null},{"id":"W2595036685","doi":"10.1016/j.tcs.2017.03.007","title":"State complexity of permutation on finite languages over a binary alphabet","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"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; Ministry of Education, Science and Technology; Ministry of Science, ICT and Future Planning","keywords":"Deterministic finite automaton; Combinatorics; Mathematics; Permutation (music); Regular language; Modulo; Nondeterministic finite automaton; Finite-state machine; Discrete mathematics; Deterministic automaton; State (computer science); DFA minimization; Cyclic permutation; Alphabet; String (physics); Binary number; Automaton; Automata theory; Algorithm; Computer science; Arithmetic; Symmetric group; Theoretical computer science; Physics","score_opus":0.023003178710106462,"score_gpt":0.2986228897265871,"score_spread":0.27561971101648064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595036685","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.9191755,0.00022722532,0.069073476,0.0017154402,0.000041467396,0.000048624068,0.00073551276,0.00025303554,0.008729804],"genre_scores_gemma":[0.99243635,0.00010689448,0.004171996,0.00006725144,0.000062687985,0.00004925563,0.0004635077,0.00007071643,0.002571314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737144,0.00073310424,0.00015839546,0.0004117548,0.0006620393,0.0006633596],"domain_scores_gemma":[0.9565765,0.037006702,0.0018975269,0.0021651443,0.0010476981,0.0013064147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018373942,0.0005322392,0.0014157433,0.0013966677,0.0013067133,0.005929689,0.0018483548,0.0020990088,0.009269638],"category_scores_gemma":[0.018604955,0.0006957239,0.0012408704,0.0015999501,0.0026759224,0.011517711,0.0027784994,0.0028217218,0.00041189505],"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.0014490603,0.00032866246,0.0078029684,0.00023207902,0.00009334736,0.00033272887,0.0014538039,0.12985629,0.0062402855,0.8304626,0.0028929526,0.018855216],"study_design_scores_gemma":[0.00007832069,0.0000722987,0.001592005,0.000016785129,0.000036078283,0.000080773265,0.000170588,0.3020455,0.0020763916,0.69341797,0.00037462404,0.00003866171],"about_ca_topic_score_codex":0.0032769314,"about_ca_topic_score_gemma":0.0030733687,"teacher_disagreement_score":0.009269638,"about_ca_system_score_codex":0.0029944186,"about_ca_system_score_gemma":0.002664471,"threshold_uncertainty_score":0.031009972},"labels":[],"label_agreement":null},{"id":"W2595941837","doi":"10.1016/j.tcs.2017.02.023","title":"A symbolic dynamics approach to Epileptic Chronnectomics: Employing strings to predict crisis onset","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"State Scholarships Foundation","keywords":"Dynamics (music); Symbolic dynamics; Computer science; Statistical physics; Econometrics; Mathematics; Algorithm; Artificial intelligence; Psychology; Pure mathematics; Physics","score_opus":0.02152651764763815,"score_gpt":0.2679997071560513,"score_spread":0.24647318950841315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595941837","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.15114947,0.00052001444,0.8354916,0.0010894602,0.000163435,0.000049496837,0.00039764526,0.00057274575,0.010566226],"genre_scores_gemma":[0.9548984,0.00025563518,0.04301177,0.000050585775,0.000050494295,0.000034638848,0.00013254363,0.000040975297,0.0015249272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999033,0.00003054023,0.000008592959,0.000020839321,0.000024027857,0.000012571466],"domain_scores_gemma":[0.9992316,0.00045949433,0.0000959306,0.00006362231,0.000099277895,0.000050168474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002853612,0.000400303,0.000386954,0.00097602344,0.0004297448,0.0011757145,0.00053108553,0.0007928484,0.00333006],"category_scores_gemma":[0.0034447452,0.00017286075,0.0002149482,0.0006715319,0.00071573735,0.001586817,0.00080364663,0.0008178868,0.00036198032],"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.00018622009,0.00007766607,0.0066276724,0.00008535898,0.000049010756,0.00034835842,0.00021696466,0.8027152,0.004236361,0.104424104,0.0017185848,0.07931455],"study_design_scores_gemma":[0.0000022529553,0.000008878335,0.00021102582,0.000005998566,0.0000025076645,0.000015338559,0.00001732283,0.97619116,0.00018658127,0.023160806,0.0001932366,0.0000048738057],"about_ca_topic_score_codex":0.003300569,"about_ca_topic_score_gemma":0.0023840386,"teacher_disagreement_score":0.00333006,"about_ca_system_score_codex":0.00034429276,"about_ca_system_score_gemma":0.00050940434,"threshold_uncertainty_score":0.011140108},"labels":[],"label_agreement":null},{"id":"W2601587549","doi":"10.1016/j.tcs.2017.03.023","title":"TCS SNC Preface","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics","score_opus":0.03760811578990411,"score_gpt":0.2334731767846426,"score_spread":0.1958650609947385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601587549","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.0012577081,0.008151185,0.009878918,0.022988206,0.17848152,0.0003255589,0.00886886,0.0025142746,0.7675338],"genre_scores_gemma":[0.0043594535,0.0023663598,0.001805244,0.0017167326,0.017129868,0.00010652825,0.0038214468,0.0010347177,0.9676596],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994554,0.000066608176,0.00003093488,0.00012076282,0.00027827188,0.000047973866],"domain_scores_gemma":[0.99585176,0.0003805033,0.00009055959,0.00032763978,0.00269617,0.0006534078],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007363429,0.0009468298,0.0006853189,0.003504103,0.0016757454,0.0027172973,0.0011621652,0.001125387,0.5432763],"category_scores_gemma":[0.0055883406,0.00029853536,0.0004634201,0.001880354,0.00041945453,0.0016598159,0.0015363605,0.0021493286,0.40331024],"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.000014764545,0.000013047921,0.000043282707,0.000056846966,0.0000016331387,0.000020602061,0.00001395632,0.000104377345,0.00016466966,0.002713405,0.95297694,0.043876477],"study_design_scores_gemma":[0.0000030649755,0.0000071702657,0.00016471132,0.000066269524,0.0000018127974,0.000025602374,0.00001894806,0.00010743503,0.00013470656,0.002420369,0.99704605,0.000003974833],"about_ca_topic_score_codex":0.004883614,"about_ca_topic_score_gemma":0.008178819,"teacher_disagreement_score":0.5432763,"about_ca_system_score_codex":0.0021932663,"about_ca_system_score_gemma":0.001960898,"threshold_uncertainty_score":0.6514609},"labels":[],"label_agreement":null},{"id":"W2610819251","doi":"10.1016/j.tcs.2017.04.008","title":"Reconstructing a string from its Lyndon arrays","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"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":"String (physics); Combinatorics; Computer science; Mathematics; Algorithm","score_opus":0.0204940698894321,"score_gpt":0.2687786662791555,"score_spread":0.2482845963897234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610819251","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.13667315,0.00052755483,0.85344255,0.0007291485,0.00030872854,0.000045925746,0.000454524,0.001760184,0.0060581826],"genre_scores_gemma":[0.5223949,0.00057647773,0.46185952,0.00031178675,0.00016523832,0.00013046083,0.0015800621,0.0004134286,0.012568077],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999286,0.00015164429,0.00007681199,0.00012413348,0.00027633616,0.00008503164],"domain_scores_gemma":[0.9980394,0.0009188864,0.00014011879,0.00055040483,0.00027832694,0.00007289871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006373531,0.0005815668,0.00073716615,0.00087748165,0.00048787642,0.0010121237,0.00068623846,0.0015148591,0.00283399],"category_scores_gemma":[0.0050105243,0.0003506456,0.0004943699,0.0014653285,0.00073033624,0.0021712005,0.0016050166,0.0015426406,0.0016822426],"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.0018529715,0.0001979775,0.003596322,0.0005890444,0.00008918831,0.0012984034,0.0007503783,0.040179137,0.11428533,0.18644473,0.011970286,0.63874626],"study_design_scores_gemma":[0.00010885081,0.000477257,0.0015418561,0.00019692355,0.00009373509,0.0015623231,0.0006434229,0.50788665,0.13807109,0.32885495,0.020451527,0.00011140238],"about_ca_topic_score_codex":0.000500473,"about_ca_topic_score_gemma":0.00068366394,"teacher_disagreement_score":0.00283399,"about_ca_system_score_codex":0.00028826573,"about_ca_system_score_gemma":0.0006044435,"threshold_uncertainty_score":0.009480655},"labels":[],"label_agreement":null},{"id":"W2613337430","doi":"10.1016/j.tcs.2020.04.008","title":"Step-optimal implementations of large single-writer registers","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Register (sociolinguistics); Algorithm; Arithmetic; Shift register; Upper and lower bounds; Binary logarithm; Time complexity; Bit (key); Discrete mathematics; Mathematics","score_opus":0.02542056911127512,"score_gpt":0.28924634464861265,"score_spread":0.26382577553733755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613337430","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.16596563,0.0013065191,0.8068942,0.00062606577,0.00024120716,0.00015454345,0.00043742376,0.0077180583,0.016656354],"genre_scores_gemma":[0.6670701,0.00033232383,0.31995407,0.00017199884,0.00007411786,0.00014742443,0.00041430083,0.00044307398,0.011392562],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990208,0.00018457999,0.00010051943,0.00014894025,0.0003665987,0.00017859507],"domain_scores_gemma":[0.99773526,0.0007520548,0.00011154342,0.0010281355,0.00029435236,0.000078585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064647215,0.00059840723,0.0005891574,0.0006511531,0.000640548,0.0016495074,0.0019969712,0.0006431291,0.011251923],"category_scores_gemma":[0.0037598156,0.00054924644,0.00041423793,0.0011263106,0.0004954974,0.0032560285,0.0013428401,0.0009809289,0.002621365],"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.0040855636,0.00045515876,0.0025438983,0.0006227388,0.00011909368,0.00030668272,0.00043266977,0.063681275,0.09059351,0.13173482,0.020755585,0.68466896],"study_design_scores_gemma":[0.0007196056,0.00073362916,0.0013350619,0.00014347325,0.00017460852,0.000492782,0.00032738023,0.60020095,0.21216021,0.16072372,0.022884857,0.00010367949],"about_ca_topic_score_codex":0.00060001144,"about_ca_topic_score_gemma":0.0024515255,"teacher_disagreement_score":0.011251923,"about_ca_system_score_codex":0.00076365785,"about_ca_system_score_gemma":0.0017195885,"threshold_uncertainty_score":0.037641466},"labels":[],"label_agreement":null},{"id":"W2616150629","doi":"10.1016/j.tcs.2004.10.036","title":"On reasoning about structural equality in XML: a description logic approach","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Satisfiability; Feature (linguistics); Description logic; XML; Theoretical computer science; Boolean satisfiability problem; Programming language; Mathematics; Linguistics","score_opus":0.02815735822224639,"score_gpt":0.2811092599757268,"score_spread":0.25295190175348037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616150629","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.00828399,0.0014513942,0.97844565,0.004267752,0.00017116957,0.00012691184,0.00043910704,0.0004536292,0.0063602817],"genre_scores_gemma":[0.2426615,0.0041178134,0.7405558,0.0025405916,0.0007501148,0.00034469005,0.0025884479,0.00041915601,0.0060218438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98601705,0.0050293836,0.0019254481,0.0019698646,0.0038736018,0.0011846548],"domain_scores_gemma":[0.973142,0.020867812,0.0010496089,0.0025974256,0.0018291178,0.00051397353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0138638895,0.0017490018,0.0026990937,0.006147148,0.0036501933,0.01027135,0.008722543,0.006325591,0.007329162],"category_scores_gemma":[0.03409026,0.0026718723,0.0071631554,0.00907276,0.010769805,0.05202513,0.009785383,0.007442981,0.0010098977],"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.00007499877,0.00009183242,0.0004938975,0.00031745379,0.000119490825,0.00039063723,0.0008266096,0.012281846,0.00055747083,0.9515173,0.0023473736,0.030981107],"study_design_scores_gemma":[0.000029909927,0.000012703744,0.00008168334,0.0000802716,0.00011257014,0.000149811,0.00021731493,0.03149379,0.00089287607,0.9627461,0.004148628,0.00003436343],"about_ca_topic_score_codex":0.015054785,"about_ca_topic_score_gemma":0.011683211,"teacher_disagreement_score":0.015054785,"about_ca_system_score_codex":0.0048885965,"about_ca_system_score_gemma":0.0031506948,"threshold_uncertainty_score":0.07332015},"labels":[],"label_agreement":null},{"id":"W2616344723","doi":"10.1016/s0304-3975(02)00739-9","title":"Algebraic rewritings for optimizing regular path queries","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rewriting; Computer science; Tuple; Materialized view; Query optimization; Query language; Algebraic number; Conjunctive query; Theoretical computer science; Relational algebra; Relational database; Mathematics; View; Programming language; Database; Discrete mathematics; Database design","score_opus":0.009068548688099044,"score_gpt":0.24208067029440322,"score_spread":0.2330121216063042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616344723","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.042199295,0.00070819556,0.9366866,0.0006101238,0.0002277895,0.0001906857,0.0003658019,0.004841672,0.01416991],"genre_scores_gemma":[0.5163768,0.00080621446,0.46816412,0.00038153798,0.00037870352,0.00020981768,0.0010086844,0.0013749764,0.0112991715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960718,0.00083453197,0.00030892706,0.0005118702,0.0018829511,0.0003898581],"domain_scores_gemma":[0.9951167,0.002608103,0.0003034591,0.0010327093,0.00080291915,0.00013610479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019821941,0.00071197737,0.0011504381,0.0012472395,0.0009707087,0.0023452735,0.0017982603,0.0008654593,0.0052680536],"category_scores_gemma":[0.010668861,0.0006748896,0.0014148025,0.0023307975,0.0017561753,0.004809086,0.0019932173,0.0027222757,0.001221858],"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.00040433605,0.00018157376,0.0007603621,0.0003680663,0.00008310357,0.00025109446,0.0006591782,0.038994595,0.009722778,0.71998125,0.010874269,0.21771936],"study_design_scores_gemma":[0.0001043829,0.00013174502,0.00026748565,0.00004043848,0.00013786457,0.0002268035,0.00018397578,0.19672018,0.010534527,0.7751298,0.016465863,0.000056857156],"about_ca_topic_score_codex":0.002459833,"about_ca_topic_score_gemma":0.003497991,"teacher_disagreement_score":0.0052680536,"about_ca_system_score_codex":0.0013895803,"about_ca_system_score_gemma":0.0011703912,"threshold_uncertainty_score":0.017623425},"labels":[],"label_agreement":null},{"id":"W2616737215","doi":"10.1016/s0304-3975(02)00737-5","title":"Scalar aggregation in inconsistent databases","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Scalar (mathematics); Database; Computer science; Mathematics; Set (abstract data type); Characterization (materials science); Theoretical computer science; Programming language","score_opus":0.0173094157674278,"score_gpt":0.2560617708558215,"score_spread":0.23875235508839368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616737215","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.095295675,0.002561873,0.8892129,0.0027172735,0.00026581544,0.00010372519,0.0003953112,0.0010513224,0.008395994],"genre_scores_gemma":[0.69123524,0.0013548415,0.3000718,0.0004679625,0.0004570077,0.000119755096,0.00089300156,0.0002352077,0.005165121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98881114,0.0037831273,0.0017252892,0.0013373337,0.0037537639,0.0005893234],"domain_scores_gemma":[0.9633762,0.0194973,0.0030583183,0.008567402,0.004844104,0.0006567057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014117011,0.0005084894,0.002052038,0.0032182196,0.002605929,0.007421826,0.002476498,0.0017970069,0.003713013],"category_scores_gemma":[0.045773152,0.0012497326,0.0011869898,0.0067717424,0.0027829516,0.0155935995,0.0049420823,0.002540907,0.0005400417],"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.0005505206,0.00010031339,0.00518444,0.00033786971,0.000111855385,0.0005878178,0.0009965589,0.01902268,0.0013703705,0.8864556,0.0048925527,0.08038944],"study_design_scores_gemma":[0.000059362177,0.00004510944,0.0005172955,0.0000630635,0.00013453623,0.0005083852,0.00035156155,0.118212864,0.0025288507,0.8703769,0.0071668094,0.00003517324],"about_ca_topic_score_codex":0.0016897556,"about_ca_topic_score_gemma":0.0015541569,"teacher_disagreement_score":0.014117011,"about_ca_system_score_codex":0.0015541384,"about_ca_system_score_gemma":0.0016743555,"threshold_uncertainty_score":0.07465881},"labels":[],"label_agreement":null},{"id":"W2617479596","doi":"10.1016/j.tcs.2017.05.018","title":"The entire chromatic number of graphs embedded on the torus with large maximum degree","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Torus; Combinatorics; Mathematics; Graph; Colored; Degree (music); Chromatic scale; Edge coloring; Discrete mathematics; Graph power; Physics; Geometry; Line graph","score_opus":0.023421179190116572,"score_gpt":0.3095576618514181,"score_spread":0.28613648266130154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617479596","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.97777486,0.00027016335,0.0069874907,0.0006107346,0.000038770497,0.000009228142,0.0004981743,0.00014658789,0.013663951],"genre_scores_gemma":[0.99521023,0.0001844777,0.0018164475,0.000047099693,0.000044416276,0.000018212,0.00035525212,0.000065251785,0.002258751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997981,0.00004423104,0.0000058673354,0.000057422545,0.00003913316,0.000055318444],"domain_scores_gemma":[0.99660057,0.0018767938,0.0005294659,0.0002471012,0.00025950003,0.0004866132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039861017,0.00039114195,0.00033228067,0.001914807,0.0010949892,0.0016008797,0.0009259753,0.0006707093,0.006770248],"category_scores_gemma":[0.003430279,0.00040000086,0.00024392283,0.0010550447,0.0017275253,0.0024118759,0.0008350429,0.0006509728,0.00036573905],"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.002831406,0.00021901976,0.027219135,0.0006990305,0.00017605623,0.0008420065,0.0015926294,0.26932153,0.07020385,0.567222,0.021706259,0.037967175],"study_design_scores_gemma":[0.00020199837,0.00020928487,0.030965852,0.00012612173,0.00014702087,0.00073571166,0.0012111283,0.46805045,0.013995472,0.4776116,0.0066519473,0.00009330361],"about_ca_topic_score_codex":0.0026490376,"about_ca_topic_score_gemma":0.004024739,"teacher_disagreement_score":0.006770248,"about_ca_system_score_codex":0.0011082767,"about_ca_system_score_gemma":0.0005668544,"threshold_uncertainty_score":0.022648752},"labels":[],"label_agreement":null},{"id":"W2618109676","doi":"10.1016/j.tcs.2018.04.024","title":"Variations of checking stack automata: Obtaining unexpected decidability properties","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Undecidable problem; Decidability; Nondeterministic algorithm; Emptiness; Decision problem; Discrete mathematics; Automaton; Bounded function; Mathematics; Computer science; Combinatorics; Algorithm; Theoretical computer science","score_opus":0.018541725253925886,"score_gpt":0.25498249743764784,"score_spread":0.23644077218372195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618109676","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.46999222,0.0003676973,0.5147634,0.0006391093,0.00014582185,0.00016236868,0.0007351488,0.007395483,0.0057987887],"genre_scores_gemma":[0.87856483,0.000088031586,0.11834164,0.00017016419,0.00009169406,0.00008562262,0.0006354361,0.0010673426,0.0009552017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992362,0.0020634537,0.0004055564,0.0022071477,0.0022694895,0.0006923466],"domain_scores_gemma":[0.952359,0.032186452,0.0018089666,0.011157949,0.0015821393,0.00090538943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004195503,0.0014956525,0.0013392243,0.002098825,0.00137498,0.002968734,0.00596679,0.0022485103,0.0033115253],"category_scores_gemma":[0.032630306,0.0012400333,0.0028114563,0.0027377647,0.0043883016,0.0061054043,0.004431642,0.004285157,0.00048485646],"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.0032576572,0.0007128425,0.033083137,0.0011143535,0.0009987438,0.00207979,0.0020353855,0.2295003,0.13171466,0.38981846,0.0082174055,0.19746716],"study_design_scores_gemma":[0.00009921071,0.0001865906,0.0027992646,0.000042263062,0.0003431,0.00033606205,0.00014493892,0.5846158,0.05228268,0.35727397,0.001789913,0.00008623925],"about_ca_topic_score_codex":0.0019681857,"about_ca_topic_score_gemma":0.0036286197,"teacher_disagreement_score":0.00596679,"about_ca_system_score_codex":0.00165882,"about_ca_system_score_gemma":0.0016651938,"threshold_uncertainty_score":0.022188187},"labels":[],"label_agreement":null},{"id":"W2619621338","doi":"10.1016/j.tcs.2017.05.016","title":"Corrigendum to “An FPTAS for the parallel two-stage flowshop problem” [Theoret. Comput. Sci. 657 (2017) 64–72]","year":2017,"lang":"en","type":"erratum","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Computer science; Parallel computing; Combinatorics","score_opus":0.02781184992361467,"score_gpt":0.28506034541367054,"score_spread":0.25724849549005585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619621338","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.0005363891,0.0059409537,0.012866465,0.11446847,0.8258864,0.00011096843,0.0034103212,0.000988496,0.035791505],"genre_scores_gemma":[0.03177721,0.021526739,0.03627171,0.11052943,0.17117716,0.000594601,0.010794068,0.0027061903,0.61462295],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972473,0.00051155087,0.0002674341,0.00050627725,0.0012086759,0.00025867065],"domain_scores_gemma":[0.98995626,0.0031400386,0.00038656205,0.0008235866,0.0053421855,0.00035132034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00238931,0.0017115086,0.0017964519,0.0023056362,0.002646693,0.0029830954,0.0032667008,0.0047300705,0.16039513],"category_scores_gemma":[0.029236456,0.0008457301,0.0021381308,0.0028523686,0.0018562974,0.0038206344,0.0023325812,0.006040993,0.053898744],"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.000027597662,0.000008724158,0.00003566396,0.00011111765,0.000012004003,0.00009970767,0.000016692742,0.00031229766,0.00006524457,0.0049880357,0.9858395,0.0084834285],"study_design_scores_gemma":[0.000059336027,0.000032386855,0.00038580302,0.00032765168,0.000053762345,0.0002472929,0.00006683517,0.0017620675,0.00054109906,0.020170594,0.97628856,0.00006470169],"about_ca_topic_score_codex":0.020603891,"about_ca_topic_score_gemma":0.0266685,"teacher_disagreement_score":0.16039513,"about_ca_system_score_codex":0.005748298,"about_ca_system_score_gemma":0.003774271,"threshold_uncertainty_score":0.5365752},"labels":[],"label_agreement":null},{"id":"W2622492622","doi":"10.1016/j.tcs.2017.05.035","title":"Computing conforming partitions of orthogonal polygons with minimum stabbing number","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba","funders":"","keywords":"Combinatorics; Partition (number theory); Mathematics; Disjoint sets; Rectangle; Polygon (computer graphics); Polygon covering; Line segment; Rounding; Polygonal chain; Partition problem; Discrete mathematics; Regular polygon; Computer science; Geometry","score_opus":0.014265505653925382,"score_gpt":0.28223805436392385,"score_spread":0.2679725487099985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622492622","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.48425665,0.00013732452,0.5081033,0.00010602493,0.000048052414,0.00015257661,0.00035003127,0.0007460276,0.0061001354],"genre_scores_gemma":[0.669475,0.00008365603,0.32651666,0.00004877492,0.0000152954,0.00014485212,0.00093831285,0.00036917673,0.0024081855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994785,0.00012688505,0.000030777923,0.000101321944,0.00017654066,0.00008594999],"domain_scores_gemma":[0.998106,0.0011891136,0.00014761207,0.00023269927,0.00018506829,0.00013951288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125507,0.0008764659,0.0012432898,0.0011680262,0.0006304588,0.0013216233,0.0011328252,0.0011751922,0.0044545797],"category_scores_gemma":[0.0046697413,0.0008743131,0.00074408815,0.0010705333,0.00084252626,0.0013016684,0.0019731468,0.0010585831,0.00051496347],"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.001242027,0.00026038996,0.0041721435,0.00032765412,0.00008928125,0.00030573714,0.0006676598,0.75632405,0.022627484,0.03697011,0.0031359326,0.1738776],"study_design_scores_gemma":[0.00004660579,0.00012140114,0.00038269375,0.000017243206,0.000012074846,0.000041957195,0.0001603284,0.97761106,0.0030600466,0.017845578,0.0006917595,0.000009189862],"about_ca_topic_score_codex":0.0023861136,"about_ca_topic_score_gemma":0.0045809406,"teacher_disagreement_score":0.0044545797,"about_ca_system_score_codex":0.00049011025,"about_ca_system_score_gemma":0.0006679453,"threshold_uncertainty_score":0.014902055},"labels":[],"label_agreement":null},{"id":"W2623507859","doi":"10.1016/j.tcs.2017.05.029","title":"Improved analysis of the online set cover problem with advice","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Advice (programming); Set cover problem; Cover (algebra); Online algorithm; Set (abstract data type); Competitive analysis; Upper and lower bounds; Time complexity; Computer science; Mathematics; Computational complexity theory; Quality (philosophy); Algorithm; Discrete mathematics; Theoretical computer science; Combinatorics","score_opus":0.013541789528518268,"score_gpt":0.2784548933950822,"score_spread":0.26491310386656397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623507859","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.06781044,0.0023756353,0.87598825,0.0036139027,0.0004685092,0.00031368932,0.00096111855,0.0012781904,0.047190193],"genre_scores_gemma":[0.6948515,0.002151447,0.25551498,0.001137669,0.0015937459,0.0005026143,0.0014901119,0.0014141692,0.041343708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99553156,0.0011994763,0.00011330553,0.00046454577,0.0018840005,0.00080703787],"domain_scores_gemma":[0.9709701,0.023979008,0.00084243435,0.0017042345,0.001717678,0.0007865468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003930311,0.0019104416,0.0031270923,0.0023848915,0.0012363973,0.0032972863,0.0054376815,0.0034947963,0.02265198],"category_scores_gemma":[0.031560186,0.0010723614,0.0025963564,0.0027457764,0.002302656,0.0071058148,0.0030181934,0.0057864124,0.0015264401],"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.0007304193,0.0005421789,0.0014342285,0.00078730425,0.00016965656,0.00028913806,0.0003278916,0.6150464,0.003580149,0.27393514,0.024231823,0.078925624],"study_design_scores_gemma":[0.000035586407,0.000047191064,0.00023752492,0.00004356422,0.0000351584,0.00005353924,0.000025227033,0.90100586,0.0004143861,0.09656467,0.0015233267,0.000013949028],"about_ca_topic_score_codex":0.007950711,"about_ca_topic_score_gemma":0.007746951,"teacher_disagreement_score":0.02265198,"about_ca_system_score_codex":0.004003036,"about_ca_system_score_gemma":0.0039367643,"threshold_uncertainty_score":0.075778365},"labels":[],"label_agreement":null},{"id":"W2623681909","doi":"10.1016/j.tcs.2017.01.034","title":"Higher-level constructs for families and multisets","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Philosophy and Theoretical Science","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiset; Intersection (aeronautics); Power set; Set (abstract data type); Mathematics; Complement (music); Functor; Family of sets; Computer science; Theoretical computer science; Discrete mathematics; Programming language","score_opus":0.05420908054288178,"score_gpt":0.34654448382506264,"score_spread":0.2923354032821809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623681909","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.31349346,0.00087249075,0.6003869,0.0027546734,0.00025662238,0.00027503588,0.001354919,0.0007136535,0.07989223],"genre_scores_gemma":[0.8901139,0.00018475008,0.104033865,0.00015173753,0.000087179586,0.00035310598,0.0007518537,0.00011002628,0.0042135334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971762,0.0010587757,0.000347885,0.0006368137,0.0004111439,0.00036913375],"domain_scores_gemma":[0.9902208,0.0049926653,0.001209176,0.0013820357,0.0011741141,0.0010213185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040240833,0.0008126852,0.0007117216,0.0038183737,0.0042687044,0.005420446,0.0011740575,0.0014962801,0.015168976],"category_scores_gemma":[0.009843268,0.00054943335,0.0020623333,0.0043665096,0.006201756,0.01709465,0.0037388434,0.0033694536,0.0011762595],"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.00001698107,0.000026128791,0.0016509283,0.000035384026,0.0000091686225,0.00003971661,0.0022506919,0.00016741791,0.00026047946,0.9893271,0.00033829507,0.005877628],"study_design_scores_gemma":[0.0000133309,0.0000381212,0.0022632154,0.000054834254,0.000024617382,0.00018145064,0.0029176963,0.0018505274,0.00043201083,0.9838075,0.008393134,0.000023566878],"about_ca_topic_score_codex":0.0014327153,"about_ca_topic_score_gemma":0.001498052,"teacher_disagreement_score":0.015168976,"about_ca_system_score_codex":0.002387491,"about_ca_system_score_gemma":0.0011656226,"threshold_uncertainty_score":0.05074525},"labels":[],"label_agreement":null},{"id":"W2624658792","doi":"10.1016/j.tcs.2017.05.039","title":"On RAC drawings of 1-planar graphs","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar graph; Combinatorics; Planar straight-line graph; Outerplanar graph; Book embedding; Planar; Graph drawing; Mathematics; Line graph; 1-planar graph; Graph; Discrete mathematics; Pathwidth; Computer science; Computer graphics (images)","score_opus":0.010909321731467709,"score_gpt":0.26626685491266744,"score_spread":0.25535753318119975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624658792","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.3217207,0.001711199,0.5047518,0.0016367367,0.0003119176,0.00029102282,0.0017903699,0.0013043224,0.16648196],"genre_scores_gemma":[0.69237435,0.003335756,0.2239421,0.00055592647,0.00026603273,0.00024505187,0.004240532,0.00091485353,0.074125424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991586,0.00025838657,0.000034864628,0.0001416937,0.00025907226,0.00014728532],"domain_scores_gemma":[0.99801135,0.00091327453,0.0003319478,0.00028261114,0.0002903338,0.00017045203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047988608,0.0010722373,0.0006852343,0.0020204536,0.0011505673,0.002369925,0.0014028884,0.0013253897,0.01980955],"category_scores_gemma":[0.0039646267,0.00089992466,0.0006637612,0.0026990834,0.0010038065,0.003056699,0.0017793357,0.0019900734,0.0028879645],"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.00014826792,0.00007114978,0.0009702366,0.00024263158,0.000023139297,0.00031661938,0.00056323514,0.04311243,0.0044287764,0.8600787,0.016244112,0.073800735],"study_design_scores_gemma":[0.0000649479,0.00007810385,0.0011940256,0.00013496369,0.000044926866,0.0004907038,0.00045782814,0.12148717,0.0029552714,0.82879883,0.044255365,0.000037728267],"about_ca_topic_score_codex":0.0027018662,"about_ca_topic_score_gemma":0.0050498806,"teacher_disagreement_score":0.01980955,"about_ca_system_score_codex":0.0011467978,"about_ca_system_score_gemma":0.0004262562,"threshold_uncertainty_score":0.06626952},"labels":[],"label_agreement":null},{"id":"W2625894783","doi":"10.1016/j.tcs.2017.05.021","title":"Know when to persist: Deriving value from a stream buffer","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","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":"Carleton University; McMaster University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Random permutation; Competitive analysis; Scheduling (production processes); Data stream; Online algorithm; Permutation (music); Algorithm; Mathematics; Mathematical optimization; Upper and lower bounds; Statistics; Discrete mathematics","score_opus":0.01683647901415447,"score_gpt":0.27598478296795875,"score_spread":0.2591483039538043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625894783","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.05780859,0.0005784046,0.9327365,0.0018220957,0.00015241561,0.00011852583,0.00049102673,0.0012128847,0.005079515],"genre_scores_gemma":[0.73140264,0.00046453855,0.26215422,0.00036147624,0.00024344488,0.00010780006,0.0005033476,0.0005256855,0.00423689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782157,0.00051400217,0.0001474299,0.000616652,0.0005701147,0.00033025866],"domain_scores_gemma":[0.9815594,0.013392254,0.0008670255,0.001891766,0.0015075267,0.00078194024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043997997,0.00091810746,0.0016393469,0.0015991573,0.0011238074,0.0044787605,0.0032091297,0.0022832442,0.0042957845],"category_scores_gemma":[0.036137253,0.0008806981,0.0010158892,0.0016397444,0.0027531742,0.012823236,0.0037045751,0.0030801862,0.000699028],"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.0015465408,0.00033936027,0.009308179,0.00036345876,0.00014244582,0.0007516299,0.0016389941,0.25034067,0.0057091275,0.49920335,0.008291566,0.2223646],"study_design_scores_gemma":[0.00004606176,0.000073725416,0.00026664007,0.000057852074,0.000060997307,0.00007833106,0.0001751838,0.60638297,0.0029974917,0.38770795,0.0021211975,0.000031644984],"about_ca_topic_score_codex":0.0041385936,"about_ca_topic_score_gemma":0.0030856496,"teacher_disagreement_score":0.0044787605,"about_ca_system_score_codex":0.0017437382,"about_ca_system_score_gemma":0.002754253,"threshold_uncertainty_score":0.0232687},"labels":[],"label_agreement":null},{"id":"W2626630915","doi":"10.1016/j.tcs.2017.12.024","title":"New results on edge partitions of 1-plane graphs","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cubic graph; Planar graph; Distance-regular graph; Regular graph; Graph power; Vertex (graph theory); Discrete mathematics; Complement graph; Butterfly graph; Line graph; Graph; Voltage graph","score_opus":0.0309586809723489,"score_gpt":0.32480655874926573,"score_spread":0.29384787777691684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626630915","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.39329177,0.008005442,0.43804926,0.0045313626,0.0013475376,0.00034191893,0.0032578674,0.0010874876,0.15008742],"genre_scores_gemma":[0.7098881,0.008314915,0.21537478,0.0031172626,0.0029434618,0.0006868673,0.0069415737,0.0018930832,0.050839875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811804,0.00043084798,0.00010451171,0.00051297405,0.00047071488,0.00036301735],"domain_scores_gemma":[0.9910278,0.005664866,0.0008639928,0.001076848,0.0005395942,0.0008269727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012841999,0.002018863,0.0019893688,0.00429898,0.0032495337,0.006462185,0.0042688525,0.0021482909,0.01744519],"category_scores_gemma":[0.008109191,0.0016705412,0.001996155,0.006671519,0.0036019664,0.0125340205,0.004569865,0.006946265,0.0023005763],"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.00074451294,0.00033938358,0.0027271977,0.00081411796,0.00012542856,0.0003220616,0.0016730115,0.019218732,0.0075973608,0.8888774,0.023017824,0.054542936],"study_design_scores_gemma":[0.00007620355,0.00009266929,0.002061469,0.00011501641,0.000117828415,0.00039091444,0.0006386572,0.025667854,0.0017655479,0.95154124,0.017488252,0.00004441583],"about_ca_topic_score_codex":0.0013416716,"about_ca_topic_score_gemma":0.001782181,"teacher_disagreement_score":0.01744519,"about_ca_system_score_codex":0.0015997094,"about_ca_system_score_gemma":0.00057947886,"threshold_uncertainty_score":0.05835992},"labels":[],"label_agreement":null},{"id":"W2669944882","doi":"10.1016/s0304-3975(02)00649-7","title":"Uniform multi-hop all-to-all optical routings in rings","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wavelength-division multiplexing; Hop (telecommunications); Computer science; Computer network; Optical communication; Routing (electronic design automation); Wavelength; Routing and wavelength assignment; Node (physics); Telecommunications; Physics; Optics; Quantum mechanics","score_opus":0.01194601667252668,"score_gpt":0.24577727401127708,"score_spread":0.2338312573387504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2669944882","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.3191868,0.0013628817,0.66357714,0.00050045946,0.0002003724,0.0001258291,0.00032408314,0.0014278302,0.013294485],"genre_scores_gemma":[0.88230926,0.00046576987,0.11189944,0.00011184129,0.00008338682,0.00007926629,0.000108877095,0.00009492209,0.004847157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990662,0.00031293297,0.000068576715,0.00020453845,0.00013281904,0.00021497786],"domain_scores_gemma":[0.9970114,0.0011288857,0.000512331,0.00081936194,0.00033503323,0.00019291141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016431559,0.00054835033,0.0010316564,0.0011294875,0.0015597274,0.0013854938,0.0018000947,0.0005144304,0.0022955812],"category_scores_gemma":[0.0043101753,0.00056382874,0.00045025442,0.0011186076,0.00094380585,0.0029044722,0.0017886312,0.00057919894,0.00037300022],"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.003005436,0.00029673538,0.0029467142,0.0005095239,0.00018105005,0.00030839036,0.00043323642,0.33675337,0.03589753,0.39812908,0.008608311,0.21293074],"study_design_scores_gemma":[0.00013895525,0.0004656311,0.0010628368,0.00004501345,0.00011506158,0.0002630151,0.000133096,0.833771,0.01631499,0.14326626,0.0043504597,0.000073807576],"about_ca_topic_score_codex":0.00077220734,"about_ca_topic_score_gemma":0.0019524856,"teacher_disagreement_score":0.0022955812,"about_ca_system_score_codex":0.00092969055,"about_ca_system_score_gemma":0.00061076984,"threshold_uncertainty_score":0.00868994},"labels":[],"label_agreement":null},{"id":"W2676800707","doi":"10.1016/s0304-3975(02)00650-3","title":"The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Simple (philosophy); Factorization; Mathematics; Expressive power; Range (aeronautics); Discrete mathematics; Combinatorics; Computer science; Graph; Theoretical computer science; Algorithm","score_opus":0.010286011854412915,"score_gpt":0.20471116056560285,"score_spread":0.19442514871118993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2676800707","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.6262039,0.0008638501,0.22708519,0.003596281,0.00035964453,0.0001948543,0.0011537663,0.00039044683,0.1401521],"genre_scores_gemma":[0.8727118,0.0007902777,0.08117522,0.0007778382,0.0002975447,0.00015678366,0.0010389688,0.00019924073,0.04285233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995172,0.00011925211,0.00002039885,0.000105910374,0.00010297915,0.00013434487],"domain_scores_gemma":[0.99876773,0.00050944573,0.00017929582,0.0002143168,0.00014209084,0.00018722856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060949544,0.0007368178,0.0007169382,0.0011517144,0.0017589796,0.002304442,0.00087904313,0.0016499048,0.013051872],"category_scores_gemma":[0.0032484327,0.00060070615,0.0006613021,0.0011111886,0.0013797719,0.0033030424,0.0014239142,0.002054463,0.001564604],"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.00022958765,0.000067649504,0.00032573153,0.00012602242,0.000017969613,0.00016854887,0.00048693575,0.0072033103,0.0038920026,0.9547265,0.012032286,0.020723443],"study_design_scores_gemma":[0.0000506063,0.000024028808,0.00018011454,0.00002019671,0.000008500047,0.00012879106,0.00015755376,0.015663091,0.0008489691,0.97912496,0.0037786064,0.000014557582],"about_ca_topic_score_codex":0.0014545199,"about_ca_topic_score_gemma":0.002550102,"teacher_disagreement_score":0.013051872,"about_ca_system_score_codex":0.000672497,"about_ca_system_score_gemma":0.0007730143,"threshold_uncertainty_score":0.043662846},"labels":[],"label_agreement":null},{"id":"W2727458370","doi":"10.1016/j.tcs.2017.06.014","title":"Asymptotic medians of random permutations sampled from reversal random walks","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Median; Random walk; Mathematics; Random permutation; Combinatorics; Discrete mathematics; Statistics; Symmetric group","score_opus":0.009401001321547755,"score_gpt":0.2585849957158825,"score_spread":0.24918399439433475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727458370","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.27894238,0.0014261893,0.70674163,0.0017461744,0.00024439036,0.00022173856,0.0010198978,0.0013621805,0.008295451],"genre_scores_gemma":[0.8819597,0.0011479743,0.10264935,0.00067071535,0.0005923735,0.00069104985,0.0026681593,0.000692321,0.008928401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963652,0.0016540246,0.00016486921,0.00080151163,0.0006181054,0.00039627557],"domain_scores_gemma":[0.9419609,0.046294138,0.0029114452,0.0045094294,0.0023838675,0.0019402417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009111476,0.0011876469,0.0027031114,0.0042226,0.0015059335,0.0040620756,0.005045268,0.003536343,0.009801316],"category_scores_gemma":[0.07267148,0.0017941761,0.001536754,0.0028910583,0.0042495537,0.007663343,0.0038993666,0.0039791884,0.0013394833],"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.0011037003,0.00029344743,0.008074659,0.00032560586,0.00019236385,0.0002468435,0.0005150408,0.28611812,0.003184833,0.6507459,0.0077954265,0.041403927],"study_design_scores_gemma":[0.00010752146,0.00009751102,0.0013865742,0.000086491054,0.000034273755,0.00014186595,0.000121006815,0.63226825,0.0011328141,0.36337033,0.0012029877,0.00005039391],"about_ca_topic_score_codex":0.0014695689,"about_ca_topic_score_gemma":0.0019292001,"teacher_disagreement_score":0.009801316,"about_ca_system_score_codex":0.0024404514,"about_ca_system_score_gemma":0.0018004245,"threshold_uncertainty_score":0.04818666},"labels":[],"label_agreement":null},{"id":"W2732417078","doi":"10.1016/j.tcs.2017.07.001","title":"Pseudoknot-generating operation","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning","keywords":"Pseudoknot; Undecidable problem; String (physics); Automaton; Computer science; Context (archaeology); Closure (psychology); Algorithm; Time complexity; Theoretical computer science; Deterministic finite automaton; Rewriting; Decidability; Mathematics; Programming language; Base sequence; DNA","score_opus":0.012409678940562215,"score_gpt":0.2677902802252762,"score_spread":0.25538060128471396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732417078","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.0736373,0.00028130066,0.8731951,0.0006913478,0.0005699387,0.00013181819,0.0002940573,0.0012628193,0.049936328],"genre_scores_gemma":[0.818052,0.00042081458,0.15086633,0.00050709775,0.00032446504,0.00023934843,0.00036914548,0.0006943815,0.028526383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989994,0.00028396133,0.00005932188,0.00021348211,0.0003147884,0.00012903301],"domain_scores_gemma":[0.99785054,0.0011685428,0.000102881095,0.0004934634,0.000271918,0.00011263183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010055543,0.0005845797,0.00048316005,0.0008996217,0.0009110651,0.0012561028,0.0012723046,0.001136111,0.009301458],"category_scores_gemma":[0.004132017,0.00023249343,0.00073438004,0.00081507006,0.001531485,0.002696792,0.0017952047,0.0014456257,0.002284812],"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.00009931389,0.000025581872,0.0001610513,0.00007203058,0.000007309101,0.00015553784,0.00009422491,0.004179625,0.0061610616,0.95564467,0.0023989608,0.031000646],"study_design_scores_gemma":[0.00004078669,0.00007313296,0.00019788125,0.000019560413,0.000018063909,0.00084412063,0.000029477485,0.060709495,0.02684498,0.8984638,0.0127073005,0.000051413816],"about_ca_topic_score_codex":0.00012341047,"about_ca_topic_score_gemma":0.000100785765,"teacher_disagreement_score":0.009301458,"about_ca_system_score_codex":0.00047929471,"about_ca_system_score_gemma":0.0005027717,"threshold_uncertainty_score":0.031116486},"labels":[],"label_agreement":null},{"id":"W2741500259","doi":"10.1016/j.tcs.2018.05.035","title":"Bounds on the burning numbers of spiders and path-forests","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Graph; Mathematics; Path (computing); Upper and lower bounds; Discrete mathematics; Computer science","score_opus":0.011822099500608281,"score_gpt":0.2734107971776106,"score_spread":0.26158869767700227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741500259","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.3843581,0.010646204,0.51126146,0.0071383053,0.0005189937,0.0001449879,0.0013757062,0.0005595556,0.083996706],"genre_scores_gemma":[0.89641523,0.0054314844,0.07975349,0.0007656648,0.0007296263,0.00027303846,0.00083110225,0.0004239731,0.0153763695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807054,0.0005853674,0.000084061416,0.00042616954,0.0004663105,0.00036751849],"domain_scores_gemma":[0.9497706,0.041714724,0.0021634875,0.0020783637,0.0013073208,0.002965427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046091476,0.001604749,0.0019037043,0.0039217523,0.0023531534,0.0046425005,0.003936239,0.0026406706,0.012501226],"category_scores_gemma":[0.040107004,0.0012799504,0.0014675179,0.0031143245,0.0043141185,0.013455877,0.004271547,0.006146324,0.0009628939],"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.00032354944,0.00009135863,0.0035679874,0.00042699673,0.00008676495,0.00014402588,0.00050397456,0.0367055,0.0033776658,0.92337227,0.004634579,0.026765324],"study_design_scores_gemma":[0.000019545885,0.00002767506,0.00090370077,0.00007857297,0.000040916064,0.00019221954,0.000082828534,0.0900368,0.0007608117,0.90541977,0.0024159723,0.000021172147],"about_ca_topic_score_codex":0.0007530532,"about_ca_topic_score_gemma":0.0014695926,"teacher_disagreement_score":0.012501226,"about_ca_system_score_codex":0.0019474067,"about_ca_system_score_gemma":0.00081227336,"threshold_uncertainty_score":0.041820824},"labels":[],"label_agreement":null},{"id":"W2754752206","doi":"10.1016/j.tcs.2017.08.023","title":"A general framework for searching on a line","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Competitive analysis; Constant (computer programming); Search cost; Mathematics; Mathematical optimization; Line (geometry); Search problem; Upper and lower bounds; Fixed cost; Computer science","score_opus":0.048514790885910465,"score_gpt":0.3635690444791842,"score_spread":0.3150542535932737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754752206","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.0015815246,0.0002848584,0.98594785,0.00043322454,0.00005992063,0.000028296945,0.00007352286,0.00016315712,0.011427669],"genre_scores_gemma":[0.15088049,0.001368808,0.81882846,0.00053721864,0.000310699,0.0003688667,0.0003716024,0.0003773954,0.026956405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990683,0.00031313035,0.00005338037,0.00021443467,0.00023860262,0.000112278976],"domain_scores_gemma":[0.999111,0.00039328446,0.00006400239,0.00019777131,0.0001631731,0.000070800554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011102812,0.0010009845,0.001033848,0.0015324915,0.0014757484,0.0028417313,0.003364946,0.0023284866,0.017483031],"category_scores_gemma":[0.0045476095,0.00060072815,0.0016155483,0.0027748712,0.0022522276,0.005391902,0.0025938929,0.0029082224,0.0032431106],"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.0000152080465,0.000018284743,0.00013496328,0.000068514615,0.000011518766,0.000054422344,0.000111388516,0.03305468,0.0005045778,0.94139814,0.0037072792,0.020921068],"study_design_scores_gemma":[0.000018246197,0.000029025197,0.000065097396,0.000031195104,0.000012456147,0.000077639386,0.000047482103,0.20532341,0.00023769845,0.7735708,0.020571593,0.000015367652],"about_ca_topic_score_codex":0.0034967014,"about_ca_topic_score_gemma":0.0032501672,"teacher_disagreement_score":0.017483031,"about_ca_system_score_codex":0.0012754482,"about_ca_system_score_gemma":0.0011070268,"threshold_uncertainty_score":0.05848652},"labels":[],"label_agreement":null},{"id":"W2754950191","doi":"10.1016/j.tcs.2017.09.007","title":"Finding modes with equality comparisons","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sorting; Mathematics; Element (criminal law); Generalization; Maximal element; Equivalence (formal languages); Combinatorics; Set (abstract data type); Upper and lower bounds; Contrast (vision); Order (exchange); Discrete mathematics; Algorithm; Computer science","score_opus":0.07704094708051623,"score_gpt":0.36278967107923105,"score_spread":0.2857487239987148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754950191","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.38515866,0.00062387256,0.5782756,0.0017393267,0.00022724613,0.0001985129,0.00084226136,0.0013241025,0.03161035],"genre_scores_gemma":[0.87658554,0.00018033116,0.11347161,0.00025791686,0.000118307704,0.0001421096,0.0007109967,0.00033354395,0.008199533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966092,0.0011037102,0.00019383199,0.0011354751,0.00053033134,0.00042738696],"domain_scores_gemma":[0.98241836,0.011821594,0.0010119968,0.0029201664,0.0011442528,0.0006837453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002711253,0.0009221894,0.0012660006,0.0029177608,0.0020198133,0.0031964702,0.0024887694,0.0022483692,0.014938958],"category_scores_gemma":[0.024891775,0.0010438254,0.0011634778,0.0022022831,0.0032010088,0.012777485,0.0048742355,0.0035358293,0.0020807923],"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.0009901475,0.00037769426,0.0115915295,0.00045874997,0.000112142625,0.00042835483,0.0016887955,0.009995121,0.007898056,0.77824277,0.010052952,0.17816378],"study_design_scores_gemma":[0.000037364014,0.00006229513,0.00070422905,0.000043749038,0.000038472943,0.00018771194,0.0005056954,0.020571465,0.0023823886,0.97292906,0.0025087046,0.000028942031],"about_ca_topic_score_codex":0.00058725604,"about_ca_topic_score_gemma":0.0008011665,"teacher_disagreement_score":0.014938958,"about_ca_system_score_codex":0.00071568455,"about_ca_system_score_gemma":0.0008360334,"threshold_uncertainty_score":0.049975753},"labels":[],"label_agreement":null},{"id":"W2760545295","doi":"10.1016/j.tcs.2017.09.018","title":"An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Office of the Vice President for Research and Economic Development, University at Buffalo; Kyushu Institute of Technology; Alberta Innovates - Technology Futures; Office of the Vice President for Research and Economic Development, University of Iowa; Georgia Southern University","keywords":"Scheme (mathematics); Job shop scheduling; Mathematical optimization; Flow (mathematics); Polynomial-time approximation scheme; Mathematics; Computer science; Stage (stratigraphy); Scheduling (production processes); Parallel computing; Algorithm; Approximation algorithm; Biology; Routing (electronic design automation); Geometry; Mathematical analysis; Computer network","score_opus":0.03236869020933152,"score_gpt":0.29743998264156546,"score_spread":0.26507129243223393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760545295","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.0333436,0.00023876816,0.96397877,0.00013670448,0.00006322817,0.000081642895,0.00007098259,0.00020534145,0.0018808353],"genre_scores_gemma":[0.55500495,0.00028242136,0.44104493,0.0000886,0.000073553136,0.00024767854,0.0002083243,0.00010340672,0.002946101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992317,0.00026264403,0.0000347498,0.000114197464,0.00021175893,0.00014483999],"domain_scores_gemma":[0.99894565,0.00055188243,0.00009559706,0.00014225893,0.00016720034,0.00009736993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001990907,0.0008798774,0.0015340027,0.0005881722,0.00076043536,0.0010909863,0.0024909298,0.0011317467,0.0020102437],"category_scores_gemma":[0.0037648128,0.0006333484,0.000947128,0.0011072066,0.00068666204,0.001225376,0.0011742819,0.0013956398,0.00022575207],"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.00028534513,0.00006792837,0.0002686932,0.000112094865,0.000032709533,0.000048510676,0.000071342736,0.9489819,0.0023253956,0.0126340315,0.0011188794,0.03405318],"study_design_scores_gemma":[0.000011006964,0.000029223225,0.000046952362,0.0000034902996,0.0000059257113,0.000007804235,0.0000057289594,0.9969056,0.00023347397,0.0025625783,0.00018514333,0.0000030046056],"about_ca_topic_score_codex":0.006056968,"about_ca_topic_score_gemma":0.005205589,"teacher_disagreement_score":0.006056968,"about_ca_system_score_codex":0.0016386003,"about_ca_system_score_gemma":0.0023798754,"threshold_uncertainty_score":0.0120434165},"labels":[],"label_agreement":null},{"id":"W2768476682","doi":"10.1016/j.tcs.2018.04.039","title":"Avoidance bases for formulas with reversal","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Index (typography); Subject (documents); Mathematics; Combinatorics; Computer science","score_opus":0.011948554639043669,"score_gpt":0.25296535695797273,"score_spread":0.24101680231892905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768476682","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.24787503,0.0017818358,0.53826964,0.0032886895,0.0012335768,0.00017092195,0.0011233686,0.0016129649,0.204644],"genre_scores_gemma":[0.89802647,0.0007425209,0.053652097,0.0008716176,0.00063333474,0.00019159446,0.001293864,0.0005093972,0.044079166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990338,0.00016217989,0.000064843654,0.00021109483,0.00033079393,0.00019725275],"domain_scores_gemma":[0.9986455,0.00051619357,0.00010214894,0.00027360703,0.00028540008,0.00017720826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090574805,0.0009902102,0.00086334045,0.0024115155,0.002376659,0.0046428107,0.0014714258,0.0013088344,0.011646345],"category_scores_gemma":[0.0027562813,0.0006336518,0.0011312697,0.0015906745,0.0022494048,0.005736694,0.0027874424,0.003895163,0.0024100281],"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.000032845728,0.000025460584,0.00009088347,0.00002659233,0.0000063318344,0.0000420988,0.00015378409,0.00044124655,0.0006976529,0.98954713,0.0012627906,0.0076731876],"study_design_scores_gemma":[0.00001265934,0.000007127136,0.00003574835,0.000008177399,0.000008757888,0.000032063934,0.00004280166,0.0015429282,0.0004739016,0.99398685,0.0038404833,0.000008518627],"about_ca_topic_score_codex":0.0009924505,"about_ca_topic_score_gemma":0.0012051194,"teacher_disagreement_score":0.011646345,"about_ca_system_score_codex":0.0012969206,"about_ca_system_score_gemma":0.000962396,"threshold_uncertainty_score":0.038960934},"labels":[],"label_agreement":null},{"id":"W2771270479","doi":"10.1016/j.tcs.2018.04.019","title":"Leaf realization problem, caterpillar graphs and prefix normal words","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bijection; Simple graph; Prefix; Discrete mathematics; Graph; Simple (philosophy); Natural number; Realization (probability)","score_opus":0.006163145191917235,"score_gpt":0.22559021252530242,"score_spread":0.21942706733338518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771270479","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.6545474,0.0013020715,0.279466,0.00933589,0.0002767699,0.00014021173,0.0014199567,0.0007838404,0.05272783],"genre_scores_gemma":[0.9296853,0.00092055195,0.045657832,0.0004811724,0.00022847047,0.00011878545,0.002090962,0.00017974491,0.020637102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941206,0.00014231328,0.000038989183,0.0001960549,0.000082422586,0.0001281377],"domain_scores_gemma":[0.99779606,0.0013783732,0.00020528145,0.0003129085,0.00011239617,0.0001949783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007141022,0.00045337493,0.0011241024,0.00052862446,0.0024944013,0.003456541,0.0014725303,0.0027939847,0.010553362],"category_scores_gemma":[0.0031775846,0.0005609377,0.00094317837,0.0015843877,0.0022391756,0.006316441,0.001975933,0.0023441024,0.001289916],"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.00019520156,0.00009453375,0.00066578394,0.00018467409,0.000021962773,0.00039212886,0.0006218253,0.0074043255,0.0031060237,0.9633781,0.0067117307,0.017223716],"study_design_scores_gemma":[0.000028679475,0.000016083324,0.0001384216,0.0000118155585,0.000011277646,0.00012516948,0.00029995228,0.00924323,0.0006592079,0.98714286,0.0023123738,0.000010851142],"about_ca_topic_score_codex":0.0014952937,"about_ca_topic_score_gemma":0.0017161759,"teacher_disagreement_score":0.010553362,"about_ca_system_score_codex":0.0012626492,"about_ca_system_score_gemma":0.0010398118,"threshold_uncertainty_score":0.035304487},"labels":[],"label_agreement":null},{"id":"W2774221743","doi":"10.1016/j.tcs.2017.11.024","title":"On the teaching complexity of linear sets","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Computer science; Theoretical computer science; Discrete mathematics; Combinatorics; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.03139846617734175,"score_gpt":0.31474211638168936,"score_spread":0.2833436502043476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774221743","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.3574133,0.0024555493,0.35085502,0.030218402,0.00061239715,0.00019691166,0.0006671321,0.0009150856,0.2566662],"genre_scores_gemma":[0.9491891,0.00060821045,0.02903022,0.00062002975,0.00038615032,0.00017022135,0.00041208675,0.00023623972,0.019347709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634486,0.0017104715,0.0001353111,0.00049261976,0.00090280164,0.00041399035],"domain_scores_gemma":[0.90621984,0.08329371,0.0020968348,0.0035391445,0.0028237784,0.002026597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025633983,0.00058061746,0.0010589149,0.0008652239,0.0019123298,0.0037685237,0.0018534368,0.002018133,0.02539357],"category_scores_gemma":[0.05499872,0.0006628382,0.00096175476,0.0013133604,0.0029500243,0.010722975,0.0039865845,0.004761907,0.0015143054],"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.00033720015,0.00023834982,0.0020855477,0.00020464924,0.000031885407,0.00005216652,0.0008127501,0.02415902,0.0012065829,0.916215,0.008897366,0.04575945],"study_design_scores_gemma":[0.00006058745,0.000052002015,0.00074732903,0.00003419387,0.000019688408,0.00003546087,0.00017838644,0.07676372,0.00093183544,0.9175984,0.0035639629,0.0000144006935],"about_ca_topic_score_codex":0.002967904,"about_ca_topic_score_gemma":0.0038222151,"teacher_disagreement_score":0.02539357,"about_ca_system_score_codex":0.005165858,"about_ca_system_score_gemma":0.0025471407,"threshold_uncertainty_score":0.08494997},"labels":[],"label_agreement":null},{"id":"W2782891332","doi":"10.1016/j.tcs.2018.10.017","title":"Critical exponents of infinite balanced words","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Exponent; Critical exponent; Construct (python library); Word (group theory); Mathematics; Discrete mathematics; Combinatorics; Computer science; Scaling; Geometry","score_opus":0.015274009070791862,"score_gpt":0.28262871418596985,"score_spread":0.267354705115178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782891332","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.887604,0.0015983674,0.05427669,0.0018978666,0.00037208493,0.0000575418,0.0002558354,0.0002580847,0.05367957],"genre_scores_gemma":[0.9853786,0.00037313765,0.003063292,0.00014392077,0.0002755651,0.000059746333,0.00011603997,0.0000977163,0.010491995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954045,0.00012057493,0.000027618398,0.00007773462,0.000112748785,0.000120862045],"domain_scores_gemma":[0.99659014,0.00188805,0.0004151803,0.00016570477,0.00044770035,0.00049322756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077981554,0.0007608628,0.00059817114,0.0025323865,0.0013262224,0.0030761417,0.00052266277,0.00080352946,0.00763407],"category_scores_gemma":[0.007340689,0.00043562643,0.00031332712,0.00073880935,0.0022314994,0.0040640035,0.0015096248,0.0013245656,0.00083868724],"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.00011524294,0.000020542875,0.00064819364,0.000054432814,0.0000070159535,0.00020972344,0.00047349947,0.0010001911,0.0032636696,0.9889824,0.001326972,0.0038981335],"study_design_scores_gemma":[0.000041838513,0.000017678985,0.0003273538,0.000030768224,0.000008778716,0.00009398417,0.00016242416,0.006622464,0.0011800927,0.98921204,0.0022900028,0.0000125882725],"about_ca_topic_score_codex":0.00050981407,"about_ca_topic_score_gemma":0.0006132109,"teacher_disagreement_score":0.00763407,"about_ca_system_score_codex":0.0011775414,"about_ca_system_score_gemma":0.00051830546,"threshold_uncertainty_score":0.025538504},"labels":[],"label_agreement":null},{"id":"W2784921327","doi":"10.1016/j.tcs.2019.07.003","title":"Type-two polynomial-time and restricted lookahead","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; CHIST-ERA; Agence Nationale de la Recherche","keywords":"Computability; Oracle; Class (philosophy); Time complexity; Mathematics; Closure (psychology); Polynomial; Discrete mathematics; Simple (philosophy); Subroutine; Computer science; Combinatorics; Programming language","score_opus":0.006589398957977416,"score_gpt":0.23664922752132503,"score_spread":0.2300598285633476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784921327","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.1852014,0.0015250685,0.7177353,0.0056534274,0.0009217234,0.00023192936,0.0023087617,0.006434387,0.079988025],"genre_scores_gemma":[0.90052915,0.0003913283,0.07215028,0.000862716,0.00028767475,0.000104030616,0.00081008935,0.0010347094,0.02383004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961739,0.00071961636,0.00022291401,0.0009142263,0.00081850967,0.0011507807],"domain_scores_gemma":[0.97948885,0.010327305,0.0010947038,0.0068773627,0.0013395738,0.000872281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026577688,0.00079824677,0.0013772361,0.0011091031,0.0020977235,0.004569993,0.0043984754,0.0019256439,0.0188514],"category_scores_gemma":[0.019799802,0.0010331731,0.0023298275,0.002145111,0.0035132875,0.013831039,0.0042708092,0.0060331477,0.0020190352],"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.0019205933,0.000195555,0.0020510696,0.00029810643,0.0000928111,0.00029551,0.00039152498,0.030636033,0.0033977018,0.90098137,0.014523929,0.045215804],"study_design_scores_gemma":[0.00008129346,0.000038087277,0.00017918646,0.000020455045,0.000064687134,0.00017455404,0.000066760455,0.050110605,0.0022740727,0.9441394,0.0028176482,0.00003328367],"about_ca_topic_score_codex":0.0038631656,"about_ca_topic_score_gemma":0.004076891,"teacher_disagreement_score":0.0188514,"about_ca_system_score_codex":0.003020303,"about_ca_system_score_gemma":0.0037586745,"threshold_uncertainty_score":0.06306422},"labels":[],"label_agreement":null},{"id":"W2790857551","doi":"10.1016/j.tcs.2018.02.001","title":"On the string matching with k mismatches","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"String (physics); Computer science; String searching algorithm; Mathematics; Matching (statistics); Combinatorics; Algorithm; Pattern matching; Programming language; Statistics","score_opus":0.010314673885081276,"score_gpt":0.2341122272412989,"score_spread":0.22379755335621762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790857551","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.07434918,0.0051105046,0.89152724,0.0032527589,0.0007405296,0.00016450728,0.00050601206,0.0012026901,0.023146639],"genre_scores_gemma":[0.61298615,0.0056066364,0.35294247,0.0018310247,0.0014221105,0.00031022594,0.0015015753,0.0009419785,0.02245789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940692,0.001918658,0.00059353194,0.0012252097,0.001555768,0.00063752366],"domain_scores_gemma":[0.9805367,0.013492695,0.0008125682,0.0037494828,0.0010480273,0.00036046613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003805275,0.0010488294,0.0024045317,0.0032296726,0.0018037724,0.003501518,0.0037052545,0.0043187644,0.009737788],"category_scores_gemma":[0.031213133,0.0010090984,0.0011810546,0.00844227,0.0042886822,0.014884757,0.007139337,0.0035013168,0.0031542252],"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.0015108971,0.00022481095,0.0022744166,0.00057826575,0.00012977043,0.00060718064,0.00057498337,0.10229606,0.005880007,0.53419757,0.015867524,0.3358585],"study_design_scores_gemma":[0.00006281592,0.00009959745,0.00031210712,0.00008346515,0.000050910545,0.00034395527,0.00010340498,0.25629812,0.0028468417,0.73341906,0.00633512,0.000044589182],"about_ca_topic_score_codex":0.0018983056,"about_ca_topic_score_gemma":0.0011216861,"teacher_disagreement_score":0.009737788,"about_ca_system_score_codex":0.0015552687,"about_ca_system_score_gemma":0.0017203056,"threshold_uncertainty_score":0.032576144},"labels":[],"label_agreement":null},{"id":"W2794348239","doi":"10.1016/j.tcs.2018.02.026","title":"An approximation algorithm for the k-median problem with uniform penalties via pseudo-solution","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Algorithm; Mathematics; Approximation algorithm; Computer science; Combinatorics; Mathematical optimization","score_opus":0.01356936042573732,"score_gpt":0.23478928602623958,"score_spread":0.22121992560050227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794348239","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.014466709,0.0003937411,0.97734946,0.00069851463,0.00017246247,0.00018824209,0.00028905232,0.0013311835,0.005110682],"genre_scores_gemma":[0.13186519,0.00025524083,0.8612799,0.00031181454,0.00011999288,0.00051916065,0.0007974193,0.00031329447,0.0045379046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828786,0.00052178843,0.00009407973,0.0003553428,0.00043341517,0.0003074042],"domain_scores_gemma":[0.9967139,0.0019474986,0.00020836908,0.00048676418,0.00041312276,0.00023035317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017386591,0.0017280186,0.0023718907,0.0015335053,0.001299571,0.002631077,0.0039813793,0.0034128665,0.011522119],"category_scores_gemma":[0.008857141,0.0010122359,0.0015014047,0.003046685,0.0012672642,0.0035191902,0.003487979,0.0032814934,0.00230849],"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.0008826882,0.00058815867,0.0009469664,0.00041188495,0.00010881687,0.00012915363,0.00019343139,0.68041545,0.0025994654,0.047856342,0.01939227,0.24647537],"study_design_scores_gemma":[0.00014527467,0.00007009117,0.00012448833,0.00002111865,0.000015737542,0.00006196435,0.000043658776,0.970682,0.000550059,0.02692653,0.0013442138,0.000014728353],"about_ca_topic_score_codex":0.0065634972,"about_ca_topic_score_gemma":0.008282573,"teacher_disagreement_score":0.011522119,"about_ca_system_score_codex":0.0022888256,"about_ca_system_score_gemma":0.004800946,"threshold_uncertainty_score":0.03854531},"labels":[],"label_agreement":null},{"id":"W2802261039","doi":"10.1016/j.tcs.2018.04.022","title":"Approximation and complexity of multi-target graph search and the Canadian traveler problem","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Graph; Computer science; Approximation algorithm; Theoretical computer science; Mathematics; Combinatorics; Mathematical optimization","score_opus":0.039379010213812085,"score_gpt":0.27466528492848,"score_spread":0.23528627471466795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802261039","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.47023442,0.0070403805,0.41841778,0.017181434,0.0005344466,0.0006861132,0.0066994587,0.0016266502,0.077579364],"genre_scores_gemma":[0.8479118,0.001916782,0.12494641,0.00077246607,0.0002797547,0.00032052412,0.004221123,0.0005224761,0.019108804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970299,0.0009875415,0.00008446668,0.00050238473,0.0005956589,0.0007998903],"domain_scores_gemma":[0.9839041,0.012849059,0.00063688576,0.00085700426,0.0007958742,0.00095714757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033099963,0.001971616,0.0034440134,0.0027306422,0.0026623849,0.004736077,0.0059650764,0.0045484235,0.015581176],"category_scores_gemma":[0.026904738,0.0010778697,0.0017732193,0.0060310923,0.003131175,0.00806679,0.0031536599,0.0042767767,0.00087145786],"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.0010945839,0.00037090207,0.0031064788,0.00039013854,0.00012099086,0.00013269491,0.00031582528,0.8390086,0.0004312427,0.101321615,0.021719845,0.031987034],"study_design_scores_gemma":[0.000108321765,0.000036626974,0.00048084755,0.000028390183,0.00003822671,0.000043908633,0.00013486481,0.9326005,0.00015785107,0.06500015,0.0013506341,0.00001973113],"about_ca_topic_score_codex":0.19771467,"about_ca_topic_score_gemma":0.16757055,"teacher_disagreement_score":0.19771467,"about_ca_system_score_codex":0.012752414,"about_ca_system_score_gemma":0.012122128,"threshold_uncertainty_score":0.39312774},"labels":[],"label_agreement":null},{"id":"W2804617844","doi":"10.1016/j.tcs.2018.05.017","title":"Designing and implementing algorithms for the closest string problem","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Algorithm; String (physics); Hamming distance; Time complexity; Set (abstract data type); String searching algorithm; Computer science; Mathematics; Pattern matching","score_opus":0.02336628486097867,"score_gpt":0.29476499538044393,"score_spread":0.27139871051946524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804617844","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.008885239,0.0002585096,0.98668414,0.0004570487,0.00012420482,0.00011546103,0.00008408095,0.0016414319,0.0017499168],"genre_scores_gemma":[0.069690056,0.00029394918,0.92707896,0.00021620469,0.00013908291,0.00019543871,0.00044855234,0.0003579085,0.001579829],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928526,0.0020966134,0.00076936843,0.0014953772,0.0021632814,0.00062267284],"domain_scores_gemma":[0.9860486,0.0074076774,0.00072567345,0.003983489,0.0015169511,0.00031765955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004582409,0.0013031407,0.0022205652,0.0025105798,0.0021474387,0.0048212516,0.005749437,0.004044761,0.0074418434],"category_scores_gemma":[0.031874787,0.0012145853,0.0017426097,0.0047026374,0.0023652092,0.011278605,0.006190874,0.0045025884,0.003738232],"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.000694147,0.0005040777,0.0020719343,0.0006232952,0.00015732386,0.00017126714,0.0005844516,0.096050695,0.010843045,0.20208566,0.016750485,0.66946363],"study_design_scores_gemma":[0.0001839202,0.00016263657,0.00019841336,0.000079323385,0.000052073316,0.00034231332,0.000333415,0.59942377,0.015935574,0.37441412,0.008824694,0.00004972407],"about_ca_topic_score_codex":0.001285161,"about_ca_topic_score_gemma":0.0016947389,"teacher_disagreement_score":0.0074418434,"about_ca_system_score_codex":0.0015869032,"about_ca_system_score_gemma":0.0030329868,"threshold_uncertainty_score":0.02489549},"labels":[],"label_agreement":null},{"id":"W2806423369","doi":"10.1016/j.tcs.2020.05.039","title":"Tree path majority data structures","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Instituto Millenium","keywords":"Combinatorics; Logarithm; Binary logarithm; Sigma; Mathematics; Path (computing); Tree (set theory); Log-log plot; Time complexity; Entropy (arrow of time); Data structure; Space (punctuation); Linear space; Discrete mathematics; Physics; Computer science; Mathematical analysis","score_opus":0.040455948883471746,"score_gpt":0.29748064855604134,"score_spread":0.2570246996725696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806423369","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.13867001,0.002762075,0.7974454,0.0044647898,0.00060732284,0.00032020194,0.004307291,0.004704824,0.046718065],"genre_scores_gemma":[0.67875046,0.0014132961,0.2675372,0.0014164712,0.0005505704,0.00053224456,0.0053245095,0.001127911,0.043347396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987884,0.00022731653,0.0000920909,0.00022949475,0.0005056088,0.00015723864],"domain_scores_gemma":[0.99506736,0.0016166583,0.00028083666,0.00199557,0.00086322235,0.00017624123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071911,0.00042546217,0.00086282357,0.0012535242,0.0014680973,0.0021994933,0.0013022623,0.000978625,0.015580435],"category_scores_gemma":[0.0067046536,0.00035291974,0.00038970416,0.0028152259,0.0011316652,0.006386753,0.0032064999,0.0018297883,0.003962867],"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.0010297988,0.0001726676,0.0013502837,0.00036527423,0.000052500778,0.00017835418,0.00043142308,0.014049644,0.012194775,0.54990613,0.047832992,0.3724361],"study_design_scores_gemma":[0.00010481,0.00024231512,0.0005102371,0.0000900003,0.000055302036,0.00043418637,0.00020391207,0.07979195,0.021138478,0.85025024,0.047135644,0.000042837415],"about_ca_topic_score_codex":0.00045122055,"about_ca_topic_score_gemma":0.0009492632,"teacher_disagreement_score":0.015580435,"about_ca_system_score_codex":0.0008885124,"about_ca_system_score_gemma":0.0013283469,"threshold_uncertainty_score":0.05212176},"labels":[],"label_agreement":null},{"id":"W2806746572","doi":"10.1016/j.tcs.2018.05.033","title":"Unary patterns under permutations","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Unary operation; Combinatorics; Permutation (music); Mathematics; Alphabet; Integer (computer science); Word (group theory); Discrete mathematics; Function (biology); Combinatorics on words; Computer science","score_opus":0.01175273181836696,"score_gpt":0.2700564735631998,"score_spread":0.25830374174483284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806746572","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.34560326,0.0011378712,0.34659508,0.005420368,0.0011343986,0.00020497626,0.0014081075,0.0010783961,0.2974175],"genre_scores_gemma":[0.8721448,0.00090619706,0.0474453,0.0010738429,0.0007842224,0.00026960473,0.001061812,0.00051309064,0.07580111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734503,0.00070614746,0.00022307965,0.000656967,0.00058302656,0.0004857883],"domain_scores_gemma":[0.99615085,0.0015875879,0.0004375704,0.0010038893,0.00052675017,0.0002933736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001195688,0.0006077266,0.0009608371,0.0019151615,0.0023976509,0.0059737205,0.0011082096,0.0017309331,0.012699144],"category_scores_gemma":[0.0064256485,0.0006344794,0.0010095095,0.002596564,0.0030586089,0.009975806,0.0031483024,0.0025735558,0.0028949457],"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.000050551615,0.000017644861,0.00017627765,0.000024453559,0.0000062087493,0.000080084224,0.00019945294,0.00028631085,0.0006096413,0.98273724,0.0013355686,0.014476481],"study_design_scores_gemma":[0.000008549126,0.000010629904,0.00008608273,0.0000083294035,0.0000068927975,0.00017659407,0.00005643968,0.0009935573,0.00054970337,0.9938261,0.004269491,0.000007487036],"about_ca_topic_score_codex":0.0004348195,"about_ca_topic_score_gemma":0.00036323376,"teacher_disagreement_score":0.012699144,"about_ca_system_score_codex":0.0009988201,"about_ca_system_score_gemma":0.00085554476,"threshold_uncertainty_score":0.042482913},"labels":[],"label_agreement":null},{"id":"W2884716215","doi":"10.1016/j.tcs.2018.06.045","title":"On asynchronous rendezvous in general graphs","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Asynchronous communication; Traverse; Computer science; Adversary; Characterization (materials science); Time complexity; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics; Algorithm; Computer network; Computer security; Geography","score_opus":0.010886347146242769,"score_gpt":0.26764632849572767,"score_spread":0.2567599813494849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884716215","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.38432494,0.0019873488,0.5423877,0.0028110484,0.00038750924,0.00018133273,0.0005554351,0.000735545,0.06662921],"genre_scores_gemma":[0.9410726,0.0012607636,0.030638728,0.0003047246,0.0002920971,0.00016955886,0.00037915312,0.0003754133,0.025506983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901175,0.0003322739,0.000036875583,0.00022751182,0.00016454306,0.00022696808],"domain_scores_gemma":[0.98973864,0.0074160513,0.00075150887,0.00092150096,0.0004711109,0.00070126896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012732168,0.0011298415,0.0017098042,0.0018298607,0.0021737486,0.0021663278,0.002602034,0.0015290035,0.013477307],"category_scores_gemma":[0.01233405,0.0006662199,0.00082705595,0.0020764463,0.0027753043,0.0060790004,0.0035367329,0.0022426313,0.0010490943],"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.00048125235,0.000062623316,0.0005664758,0.00021156057,0.00003952659,0.00021167824,0.00048334955,0.14566733,0.002133524,0.8306709,0.0049579577,0.014513824],"study_design_scores_gemma":[0.00008379756,0.000039718274,0.00022726636,0.000033728462,0.000030887288,0.000071364964,0.00019865994,0.3086896,0.0006805359,0.6875275,0.0023939165,0.000023009656],"about_ca_topic_score_codex":0.0042452724,"about_ca_topic_score_gemma":0.0045333356,"teacher_disagreement_score":0.013477307,"about_ca_system_score_codex":0.0016062403,"about_ca_system_score_gemma":0.0010074069,"threshold_uncertainty_score":0.045086026},"labels":[],"label_agreement":null},{"id":"W2889518945","doi":"10.1016/j.tcs.2018.08.024","title":"Constant query time (1 + ϵ)-approximate distance oracle for planar graphs","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oracle; Combinatorics; Mathematics; Binary logarithm; Time complexity; Graph; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.013018652046001375,"score_gpt":0.2536365564653466,"score_spread":0.24061790441934522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889518945","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.3313466,0.006178779,0.5703755,0.021660544,0.0008535778,0.00073535374,0.012092525,0.014708141,0.042049024],"genre_scores_gemma":[0.81153756,0.0015448191,0.16110232,0.0016511228,0.00071046053,0.00039477783,0.0069107763,0.0010626453,0.015085499],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99049497,0.0015158054,0.0006432681,0.0024392232,0.0030416423,0.0018651144],"domain_scores_gemma":[0.97036463,0.017044783,0.0017210573,0.007772183,0.0017104201,0.0013870465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036632018,0.0020830906,0.0046790545,0.0017550138,0.001902581,0.00668294,0.008853763,0.004426484,0.020740319],"category_scores_gemma":[0.027302133,0.001197408,0.0019042578,0.0058520213,0.002724134,0.02001591,0.0058450154,0.0064164945,0.0048967195],"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.012210315,0.0024094896,0.0109779285,0.0037031714,0.0006593425,0.00058611634,0.0012134777,0.28303328,0.038034726,0.15925325,0.085656464,0.4022624],"study_design_scores_gemma":[0.001356014,0.0006042723,0.0034404828,0.00013174883,0.000584368,0.0012743354,0.00075943506,0.64995766,0.019046972,0.3080487,0.014632228,0.00016382012],"about_ca_topic_score_codex":0.0056664865,"about_ca_topic_score_gemma":0.009139726,"teacher_disagreement_score":0.020740319,"about_ca_system_score_codex":0.0064939493,"about_ca_system_score_gemma":0.00647329,"threshold_uncertainty_score":0.06938332},"labels":[],"label_agreement":null},{"id":"W2891053194","doi":"10.1016/j.tcs.2018.09.005","title":"Population protocols with faulty interactions: The impact of a leader","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Impossibility; Mathematical proof; Computer science; Focus (optics); Theoretical computer science; Population; Distributed computing; State (computer science); Algorithm; Mathematics","score_opus":0.019973799382233298,"score_gpt":0.34060739758259034,"score_spread":0.32063359820035703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891053194","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.6525756,0.0012679796,0.28594518,0.009855659,0.0008734445,0.00021614978,0.00026125705,0.000732036,0.04827273],"genre_scores_gemma":[0.98830146,0.00023906071,0.0074376664,0.00023141254,0.00015874761,0.00006773238,0.000033044835,0.00007466281,0.0034561784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720746,0.0014343136,0.00006551355,0.000317105,0.0004952191,0.00048031527],"domain_scores_gemma":[0.9600351,0.02888827,0.0024350763,0.0043515665,0.002272215,0.0020178598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004555863,0.0005143603,0.0010956806,0.0007936425,0.0018058496,0.0023215793,0.0028208846,0.002667156,0.005893465],"category_scores_gemma":[0.044554684,0.0004640854,0.00057909044,0.00063287024,0.0030255918,0.005586682,0.0026667933,0.0026095705,0.0005169149],"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.0012689673,0.0005468086,0.00484875,0.00028426744,0.00016388677,0.0012493867,0.0012730624,0.45759484,0.0065554525,0.48294857,0.010508623,0.032757524],"study_design_scores_gemma":[0.00020888394,0.00033290248,0.0007609934,0.00002686607,0.0000864853,0.00031152292,0.0004518342,0.7690278,0.0014898964,0.22504467,0.0022178488,0.000040233783],"about_ca_topic_score_codex":0.0018592328,"about_ca_topic_score_gemma":0.0014081113,"teacher_disagreement_score":0.005893465,"about_ca_system_score_codex":0.0013789429,"about_ca_system_score_gemma":0.002011365,"threshold_uncertainty_score":0.024093986},"labels":[],"label_agreement":null},{"id":"W2895157742","doi":"10.1016/j.tcs.2019.08.013","title":"Stochastic chemical reaction networks for robustly approximating arbitrary probability distributions","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"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":"Army Research Office; National Science Foundation; European Research Council; Banff International Research Station for Mathematical Innovation and Discovery; European Commission; American Institute of Mathematics","keywords":"Ergodic theory; Mathematics; Limit (mathematics); Probability distribution; Probability mass function; Lattice (music); Applied mathematics; Statistical physics; Discrete mathematics; Pure mathematics; Mathematical analysis; Statistics; Physics","score_opus":0.007422290535116712,"score_gpt":0.2276371222684539,"score_spread":0.2202148317333372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895157742","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.05041078,0.00013335748,0.94736135,0.00016884384,0.0000141079345,0.00001887807,0.00006734397,0.00017809618,0.001647349],"genre_scores_gemma":[0.85904104,0.00033041905,0.1377627,0.00009385897,0.000023560378,0.00013595299,0.00019019563,0.000091489346,0.0023308299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944586,0.00021801086,0.000021538455,0.00010286227,0.00015484914,0.00005680258],"domain_scores_gemma":[0.99809235,0.0011689457,0.00030070494,0.00021142652,0.00013281136,0.00009380644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015561271,0.00076369935,0.00064604473,0.00066405005,0.0003531306,0.0010800039,0.0010126826,0.0008336663,0.0013987003],"category_scores_gemma":[0.0073421933,0.0005187559,0.0004916921,0.0005596224,0.0014659201,0.0020458107,0.0014000182,0.0012452429,0.00027625216],"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.0000283332,0.000010338931,0.00036325803,0.000016877882,0.000009949758,0.00002226882,0.000024936091,0.92005897,0.0017880945,0.07421334,0.00010068574,0.003363018],"study_design_scores_gemma":[0.0000017348067,0.000004106865,0.000031848318,0.0000017163118,8.8169213e-7,0.0000040990235,0.0000019410468,0.98194844,0.0002769679,0.017609518,0.0001163138,0.0000023572115],"about_ca_topic_score_codex":0.0030919488,"about_ca_topic_score_gemma":0.0024289421,"teacher_disagreement_score":0.0030919488,"about_ca_system_score_codex":0.001629945,"about_ca_system_score_gemma":0.0007811986,"threshold_uncertainty_score":0.011826158},"labels":[],"label_agreement":null},{"id":"W2897193193","doi":"10.1016/j.tcs.2018.10.021","title":"Path queries on functions","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico","keywords":"Ackermann function; Combinatorics; Successor cardinal; Element (criminal law); Inverse; Mathematics; Range (aeronautics); Path (computing); Function (biology); Discrete mathematics; Graph; Computer science","score_opus":0.00960591139529451,"score_gpt":0.24773992844400522,"score_spread":0.2381340170487107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897193193","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.20216979,0.005462445,0.6803957,0.008284636,0.0008894463,0.00047300052,0.0071148546,0.008519204,0.08669083],"genre_scores_gemma":[0.77522427,0.00269478,0.1631532,0.0017621462,0.00070763804,0.0004312018,0.007957407,0.0018513482,0.04621802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660873,0.0006992087,0.0002214033,0.00064573827,0.001342018,0.00048283214],"domain_scores_gemma":[0.9920379,0.0044036563,0.00026967123,0.0023160714,0.00072537264,0.0002473437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018577246,0.0009833978,0.0013764454,0.0021910071,0.0012891114,0.003946181,0.0016424998,0.0021324423,0.019318426],"category_scores_gemma":[0.011607271,0.0005553973,0.0008329338,0.004412052,0.0023392485,0.012874832,0.004828991,0.003249291,0.003770488],"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.0008720001,0.00011217988,0.0011755617,0.00033036873,0.000044645865,0.00018443656,0.0004123635,0.009077893,0.0039204806,0.79338205,0.03741874,0.15306929],"study_design_scores_gemma":[0.00006308462,0.000087101376,0.0002655055,0.00005378118,0.00003189765,0.00028259764,0.00013266639,0.02997785,0.004069501,0.93763596,0.027376946,0.000023150042],"about_ca_topic_score_codex":0.0011394834,"about_ca_topic_score_gemma":0.000842839,"teacher_disagreement_score":0.019318426,"about_ca_system_score_codex":0.0023640224,"about_ca_system_score_gemma":0.0014889175,"threshold_uncertainty_score":0.064626575},"labels":[],"label_agreement":null},{"id":"W2897485334","doi":"10.1016/j.tcs.2018.10.015","title":"On extensions of the deterministic online model for bipartite matching and max-sat","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Deterministic algorithm; Submodular set function; Monotone polygon; Binary logarithm; Matching (statistics); Combinatorics; Approximation algorithm; Simple (philosophy); Online algorithm; Discrete mathematics; Greedy algorithm; Algorithm; Graph","score_opus":0.02794348708303992,"score_gpt":0.290670138379534,"score_spread":0.2627266512964941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897485334","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.07048134,0.0022842302,0.85387135,0.0067553534,0.0006258209,0.0003631956,0.0015683221,0.0009879998,0.06306238],"genre_scores_gemma":[0.7081681,0.0031401005,0.23660381,0.0036239217,0.0021019154,0.000933998,0.0031975983,0.0012154209,0.041015256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99138004,0.0045070522,0.00035218784,0.0014890274,0.0010605875,0.0012111712],"domain_scores_gemma":[0.961237,0.026544923,0.0019371916,0.0070468825,0.0014681936,0.0017656606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008635842,0.0024535027,0.0037115118,0.0022293017,0.0028398037,0.005904211,0.00849321,0.004413276,0.019680198],"category_scores_gemma":[0.03315513,0.0019893649,0.005040175,0.004495654,0.004379003,0.023500971,0.010137716,0.010746005,0.0019925865],"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.0004940207,0.00039354115,0.00077082636,0.00022188993,0.00008185294,0.00012916423,0.00024606034,0.09698513,0.00047001563,0.8763553,0.008294996,0.015557242],"study_design_scores_gemma":[0.000052850726,0.00003558864,0.00012328575,0.00003131248,0.000030293459,0.000052336763,0.00004792639,0.23418161,0.00013432652,0.7630229,0.002265926,0.000021708081],"about_ca_topic_score_codex":0.0063263555,"about_ca_topic_score_gemma":0.010656547,"teacher_disagreement_score":0.019680198,"about_ca_system_score_codex":0.005985463,"about_ca_system_score_gemma":0.0051681357,"threshold_uncertainty_score":0.06583685},"labels":[],"label_agreement":null},{"id":"W2897693141","doi":"10.1016/j.tcs.2018.10.012","title":"Perennial secure multi-party computation of universal Turing machine","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Ben-Gurion University of the Negev; Israel Science Foundation","keywords":"Turing machine; Computer science; Computation; Theoretical computer science; Universal Turing machine; Set (abstract data type); Time hierarchy theorem; Model of computation; Super-recursive algorithm; Non-deterministic Turing machine; Theory of computation; Time complexity; Algorithm; Programming language","score_opus":0.011466911643908808,"score_gpt":0.258196179037084,"score_spread":0.24672926739317516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897693141","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.3092169,0.0010980784,0.6181961,0.0035065047,0.0006485139,0.00016728039,0.00042922643,0.001157533,0.06557991],"genre_scores_gemma":[0.95858335,0.00018474724,0.029040013,0.00016183197,0.0001155118,0.000074847085,0.00012468632,0.00006718475,0.01164778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873334,0.00038363787,0.00007762683,0.00024406564,0.0003063985,0.00025486478],"domain_scores_gemma":[0.99875355,0.00035261753,0.00007843642,0.0005725988,0.00012713204,0.00011562473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011579677,0.00034686498,0.0007664151,0.0005805417,0.0014216657,0.001651228,0.0010492296,0.0011059453,0.004468711],"category_scores_gemma":[0.003148208,0.0002443388,0.0006835939,0.00048298918,0.001410421,0.0032605848,0.0036431039,0.0017669778,0.00083667604],"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.00031972866,0.00006488722,0.0007835288,0.00013419415,0.000035887548,0.00019565228,0.0002530116,0.013100564,0.007850007,0.9527506,0.0027626096,0.021749415],"study_design_scores_gemma":[0.000044210305,0.00007717336,0.00047613945,0.000033901324,0.00003819954,0.00021734464,0.000048276408,0.19265571,0.013897508,0.7859566,0.0065220403,0.00003278861],"about_ca_topic_score_codex":0.0002177204,"about_ca_topic_score_gemma":0.0003261294,"teacher_disagreement_score":0.004468711,"about_ca_system_score_codex":0.00088164525,"about_ca_system_score_gemma":0.000978324,"threshold_uncertainty_score":0.014949322},"labels":[],"label_agreement":null},{"id":"W2898623953","doi":"10.1016/j.tcs.2018.10.033","title":"Off-line and on-line algorithms for closed string factorization","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Substring; Combinatorics; Mathematics; Factorization; Prefix; Suffix; String (physics); Line (geometry); Algorithm; Integer (computer science); Discrete mathematics; Data structure; Computer science","score_opus":0.033646803485844784,"score_gpt":0.3082231752536396,"score_spread":0.2745763717677948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898623953","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.01364161,0.00081329106,0.97122306,0.00061095686,0.00027112328,0.00017149128,0.00034002084,0.003690087,0.009238261],"genre_scores_gemma":[0.13076238,0.00065614044,0.8464438,0.00048189846,0.0004377604,0.00037353058,0.00195722,0.0012918897,0.017595472],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99480057,0.0014264977,0.00043893946,0.00089075713,0.0018176817,0.00062557886],"domain_scores_gemma":[0.9862316,0.006482122,0.00055001123,0.0049461746,0.0014050279,0.00038510395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00228466,0.0019773073,0.0019446505,0.002449389,0.001657717,0.0049987943,0.0034872834,0.002976361,0.027670803],"category_scores_gemma":[0.015584121,0.0007729977,0.0016101634,0.0038549954,0.0016704862,0.0088145705,0.0047802464,0.0038630075,0.011121017],"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.0012025437,0.00060499477,0.00087959843,0.00028107088,0.00007044069,0.00018501465,0.00031054704,0.037038114,0.0068668323,0.0871265,0.022631489,0.84280276],"study_design_scores_gemma":[0.0002641849,0.0003411015,0.0004834834,0.00010237135,0.000065906264,0.00064782216,0.00035003154,0.65589005,0.01783529,0.30395308,0.019993063,0.00007361931],"about_ca_topic_score_codex":0.0019311816,"about_ca_topic_score_gemma":0.0034910864,"teacher_disagreement_score":0.027670803,"about_ca_system_score_codex":0.0015090649,"about_ca_system_score_gemma":0.0025153283,"threshold_uncertainty_score":0.09256804},"labels":[],"label_agreement":null},{"id":"W2898948556","doi":"10.1016/j.tcs.2018.12.014","title":"State complexity of pattern matching in regular languages","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Sigma; Alphabet; Word (group theory); Kappa; Mathematics; State (computer science); Matching (statistics); Discrete mathematics; Physics; Algorithm; Geometry; Statistics; Philosophy; Linguistics","score_opus":0.019041264832982706,"score_gpt":0.2783483248492058,"score_spread":0.2593070600162231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898948556","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.8266851,0.00044055143,0.1523949,0.0041868533,0.00009959434,0.00010851666,0.0016324347,0.0007398701,0.013712252],"genre_scores_gemma":[0.9886901,0.00014093936,0.0073652123,0.00012785303,0.00009172525,0.00007125152,0.00064635015,0.000120430705,0.0027462116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964141,0.000924526,0.00024135868,0.00079234486,0.0009851675,0.00064247946],"domain_scores_gemma":[0.96344966,0.029961748,0.0017052706,0.0025303473,0.0013763658,0.0009765673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023815574,0.00051817973,0.0015059857,0.0013838368,0.0013152475,0.0059486916,0.0020979075,0.0022332263,0.010491943],"category_scores_gemma":[0.024266537,0.00073759374,0.0014084384,0.0016832559,0.0023234554,0.010542687,0.0028651352,0.0029315853,0.00070338463],"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.0017821598,0.00042332168,0.008990993,0.0005185021,0.00014620657,0.00043633778,0.0013876616,0.12745558,0.009460224,0.80236185,0.0062547075,0.040782444],"study_design_scores_gemma":[0.00006402301,0.000043823427,0.00074684597,0.000013639856,0.000042804702,0.00006858292,0.00010207886,0.30154482,0.0020695678,0.69485337,0.00042505618,0.000025410773],"about_ca_topic_score_codex":0.0021236907,"about_ca_topic_score_gemma":0.00187896,"teacher_disagreement_score":0.010491943,"about_ca_system_score_codex":0.0025531615,"about_ca_system_score_gemma":0.0023530403,"threshold_uncertainty_score":0.03509903},"labels":[],"label_agreement":null},{"id":"W2904368314","doi":"10.1016/j.tcs.2018.10.019","title":"A simple linear-space data structure for constant-time range minimum query","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Data structure; Range (aeronautics); Simple (philosophy); Range query (database); Set (abstract data type); Mathematics; Linear space; Query optimization; Space (punctuation); Constant (computer programming); Computer science; Discrete mathematics; Algorithm; Sargable; Data mining; Web search query; Search engine; Information retrieval","score_opus":0.01974509309859996,"score_gpt":0.2915802183371953,"score_spread":0.2718351252385953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904368314","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.06425414,0.0021128615,0.9069362,0.0016380156,0.0005059042,0.0005526023,0.0032273165,0.011465008,0.009307893],"genre_scores_gemma":[0.34957877,0.0005752276,0.6336101,0.00084828085,0.00030982826,0.00065926055,0.003805342,0.00076964457,0.009843548],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851865,0.0001597321,0.0001764189,0.0002836807,0.00067348307,0.00018808355],"domain_scores_gemma":[0.99707925,0.000519292,0.00021797908,0.001552718,0.0004523209,0.00017850807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008679301,0.0006453223,0.0015877049,0.0015842431,0.0011047439,0.0020153336,0.002790368,0.001091082,0.010341222],"category_scores_gemma":[0.0043746703,0.00054267095,0.00067708973,0.004816783,0.0010380677,0.004596612,0.003922134,0.0015274348,0.0031435008],"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.0028969948,0.0008506981,0.0021728093,0.0010564316,0.00013065636,0.00024061796,0.0006069866,0.03013575,0.06351103,0.14034706,0.06848599,0.6895649],"study_design_scores_gemma":[0.0018439528,0.0024657384,0.0023871877,0.00021162737,0.0003072601,0.0015146281,0.00051644037,0.45310634,0.07029644,0.3465109,0.12046847,0.0003709599],"about_ca_topic_score_codex":0.0017509685,"about_ca_topic_score_gemma":0.0028411124,"teacher_disagreement_score":0.010341222,"about_ca_system_score_codex":0.0014960762,"about_ca_system_score_gemma":0.0021652058,"threshold_uncertainty_score":0.034594834},"labels":[],"label_agreement":null},{"id":"W2907265589","doi":"10.1016/j.tcs.2018.12.016","title":"The number of valid factorizations of Fibonacci prefixes","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Prefix; Fibonacci polynomials; Mathematics; Sequence (biology); Pisano period; Combinatorics; Lucas sequence; Recurrence relation; Arithmetic; Word (group theory); Lucas number; Discrete mathematics; Linguistics","score_opus":0.007265641520229918,"score_gpt":0.2561661758688777,"score_spread":0.24890053434864778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907265589","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.82475865,0.0014695579,0.14827764,0.0017383742,0.000315872,0.00015712647,0.0027417762,0.0005712957,0.01996964],"genre_scores_gemma":[0.9459987,0.00062960957,0.044540875,0.00020563236,0.00024534969,0.00020539617,0.0024771541,0.0002477735,0.0054493076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906722,0.0024605196,0.0012058408,0.001778562,0.0023917002,0.0014910745],"domain_scores_gemma":[0.90914154,0.06876633,0.005724425,0.008153159,0.005464635,0.002749951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052410783,0.00087278907,0.0018485166,0.0022196115,0.005230496,0.0071981996,0.0023613765,0.0035162636,0.012803572],"category_scores_gemma":[0.04271392,0.001706386,0.0020198366,0.002092917,0.0038746307,0.01230334,0.0027174733,0.002196443,0.0019898138],"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.0045769336,0.00046306092,0.029563272,0.0010141339,0.00041717157,0.0019344834,0.0033511024,0.0237032,0.03735697,0.80043226,0.010183308,0.08700404],"study_design_scores_gemma":[0.00017729221,0.0002645052,0.0037279062,0.00015533778,0.00022175799,0.0032705797,0.0008586584,0.05962786,0.017333252,0.90656143,0.0076505113,0.00015091448],"about_ca_topic_score_codex":0.00052828295,"about_ca_topic_score_gemma":0.00065386354,"teacher_disagreement_score":0.012803572,"about_ca_system_score_codex":0.0015517769,"about_ca_system_score_gemma":0.0024080216,"threshold_uncertainty_score":0.042832255},"labels":[],"label_agreement":null},{"id":"W2907458073","doi":"10.1016/j.tcs.2018.12.025","title":"Syntactic complexity of bifix-free regular languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Narodowe Centrum Nauki","keywords":"Injective function; Cardinality (data modeling); Mathematics; Regular language; Alphabet; Upper and lower bounds; Combinatorics; Discrete mathematics; Function (biology); Semigroup; Computer science; Theoretical computer science; Linguistics; Automaton","score_opus":0.011359170030102426,"score_gpt":0.24601496610541337,"score_spread":0.23465579607531095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907458073","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.8798993,0.0005275708,0.07848339,0.002665353,0.00006378628,0.000045336106,0.000737776,0.00031399186,0.037263427],"genre_scores_gemma":[0.98993355,0.00019246571,0.0053241244,0.00014009618,0.00011206048,0.000050454495,0.0004878905,0.000063007705,0.0036963427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744093,0.0005847839,0.00016890577,0.0004008929,0.00096059573,0.00044380804],"domain_scores_gemma":[0.9865307,0.010481297,0.00086919527,0.00067871925,0.0008231844,0.0006167748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017354484,0.0004241788,0.0011192268,0.0024277004,0.002050969,0.005933108,0.0017242949,0.0013964395,0.008997649],"category_scores_gemma":[0.0076290574,0.0006892282,0.0011790858,0.0020002383,0.0032035888,0.010903891,0.0025459633,0.0029529175,0.0006403658],"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.00015299655,0.00007550894,0.0016942163,0.00009430412,0.000020180923,0.00020128326,0.00086414866,0.00385859,0.0023377743,0.983712,0.0009412519,0.006047817],"study_design_scores_gemma":[0.000020367263,0.000016536926,0.00085423054,0.000010938155,0.00001816952,0.00012637429,0.00016986167,0.012278633,0.001003352,0.9847281,0.00075126963,0.000022170403],"about_ca_topic_score_codex":0.0012096518,"about_ca_topic_score_gemma":0.0009917227,"teacher_disagreement_score":0.008997649,"about_ca_system_score_codex":0.0020741285,"about_ca_system_score_gemma":0.0011173998,"threshold_uncertainty_score":0.030100107},"labels":[],"label_agreement":null},{"id":"W2910240168","doi":"10.1016/j.tcs.2019.10.006","title":"Some further results on squarefree arithmetic progressions in infinite words","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Square-free integer; Arithmetic; Mathematics; Combinatorics","score_opus":0.016454798319736685,"score_gpt":0.27484793513718514,"score_spread":0.25839313681744847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910240168","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.27905017,0.009906266,0.27056286,0.010126897,0.002703536,0.0001495352,0.001157255,0.0010043954,0.42533898],"genre_scores_gemma":[0.8135463,0.0048042135,0.041118678,0.0023876198,0.0033365332,0.00019415027,0.0013146822,0.00044657898,0.13285115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926144,0.00014461794,0.000061221945,0.00018712561,0.00021877178,0.0001267084],"domain_scores_gemma":[0.9965263,0.0025122107,0.00013487962,0.00027470972,0.0002811937,0.00027079965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012391112,0.0016198425,0.001054908,0.0026572442,0.0022261813,0.0036157642,0.0012572393,0.0012346726,0.023902126],"category_scores_gemma":[0.003991641,0.0006962409,0.0020745718,0.0033349048,0.0034728649,0.0084957,0.0031618043,0.0048904526,0.0026529017],"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.00015481032,0.0001095801,0.0003983952,0.00032779347,0.000021904923,0.0004534168,0.0010390388,0.0019606238,0.0038409582,0.96816885,0.0046777925,0.018846804],"study_design_scores_gemma":[0.000020999814,0.000030442046,0.00031097088,0.000024747696,0.000021145572,0.0001632979,0.00012180641,0.0020522755,0.0011947562,0.9861363,0.009906531,0.000016748563],"about_ca_topic_score_codex":0.0008657046,"about_ca_topic_score_gemma":0.0010341569,"teacher_disagreement_score":0.023902126,"about_ca_system_score_codex":0.0012591796,"about_ca_system_score_gemma":0.0008338713,"threshold_uncertainty_score":0.079960525},"labels":[],"label_agreement":null},{"id":"W2911989380","doi":"10.1016/j.tcs.2006.06.021","title":"Coloring octrees","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Octree; Partition (number theory); Unit cube; Cube (algebra); Mathematics; Combinatorics; Computer science; Hypercube; Algorithm","score_opus":0.003326963702036951,"score_gpt":0.1764818607435589,"score_spread":0.17315489704152195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911989380","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.2619148,0.00067958527,0.5125948,0.001308951,0.0006942742,0.00039018228,0.0033494907,0.0018245633,0.21724325],"genre_scores_gemma":[0.6138742,0.00095046265,0.26800695,0.0008178558,0.0002152316,0.0003073805,0.0046746843,0.0010498282,0.11010345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955314,0.00010043008,0.000017073382,0.0000979589,0.00011181775,0.00011962797],"domain_scores_gemma":[0.9987174,0.00040433204,0.00009734945,0.0004012333,0.000214683,0.00016497499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028989956,0.00058585784,0.00046901518,0.001310144,0.0012878488,0.0019329682,0.00077739195,0.0005638661,0.022501878],"category_scores_gemma":[0.0014803305,0.00041423066,0.00056393596,0.0016511745,0.00058528665,0.0018561205,0.001096739,0.0016906502,0.0026944715],"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.00048452814,0.00024950766,0.0012883098,0.00020581998,0.00004684955,0.00024549468,0.00028323833,0.015735187,0.01193658,0.77704525,0.036631316,0.15584794],"study_design_scores_gemma":[0.00008520973,0.00011892505,0.0012093611,0.00006600612,0.000052667987,0.0004786497,0.00029329924,0.057339206,0.012226264,0.85475236,0.07334604,0.000031987125],"about_ca_topic_score_codex":0.0015589226,"about_ca_topic_score_gemma":0.003546655,"teacher_disagreement_score":0.022501878,"about_ca_system_score_codex":0.00096825825,"about_ca_system_score_gemma":0.000645528,"threshold_uncertainty_score":0.075276315},"labels":[],"label_agreement":null},{"id":"W2912094370","doi":"10.1016/s0304-3975(01)00212-2","title":"Palindrome complexity","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst; University of Alberta","keywords":"Palindrome; Mathematics; Morphism; Sequence (biology); Combinatorics; Upper and lower bounds; Discrete mathematics; Class (philosophy); Computer science","score_opus":0.019404880997357755,"score_gpt":0.2512589619389404,"score_spread":0.2318540809415826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912094370","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.20754342,0.0042343214,0.17297661,0.008316202,0.0008291545,0.00008222615,0.00085733697,0.00079110864,0.60436964],"genre_scores_gemma":[0.8987065,0.0014895825,0.019087259,0.00083843654,0.0008564433,0.00007740797,0.0006839642,0.00019101478,0.07806949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994856,0.00008671862,0.00002787184,0.00017431717,0.00015780808,0.00006768083],"domain_scores_gemma":[0.99902797,0.00048115174,0.00006368547,0.00020228587,0.00012973919,0.00009518981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037669894,0.00047363667,0.00079104444,0.0011157623,0.0014466777,0.0025856232,0.0008776155,0.0008593112,0.020924581],"category_scores_gemma":[0.001799382,0.00035892375,0.00071080716,0.0012948872,0.0017649444,0.007339383,0.0017356375,0.0029466515,0.0026422045],"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.000014702101,0.000012786449,0.00006814761,0.000026001522,0.0000034081443,0.00002823456,0.00009197774,0.000232033,0.00037932934,0.99179745,0.0018865635,0.005459447],"study_design_scores_gemma":[0.0000050426393,0.000007125912,0.00008279864,0.000004761898,0.0000044817116,0.000077645454,0.000025160163,0.0010737092,0.0002950105,0.9923746,0.0060456917,0.000004044686],"about_ca_topic_score_codex":0.00030463887,"about_ca_topic_score_gemma":0.00028562848,"teacher_disagreement_score":0.020924581,"about_ca_system_score_codex":0.0010183229,"about_ca_system_score_gemma":0.00046069565,"threshold_uncertainty_score":0.069999635},"labels":[],"label_agreement":null},{"id":"W2912588130","doi":"10.1016/j.tcs.2011.12.024","title":"Relativized codes","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Canada Research Chairs","keywords":"Prefix code; Alphabet; Prefix; Mathematics; Class (philosophy); Factorization; Discrete mathematics; Block code; Word (group theory); Code (set theory); Set (abstract data type); Computer science; Combinatorics; Decoding methods; Linear code; Algorithm; Programming language; Linguistics","score_opus":0.018758539228213668,"score_gpt":0.230878302459858,"score_spread":0.21211976323164433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912588130","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.08985206,0.0033116394,0.50664926,0.008332244,0.0029264078,0.000176673,0.0021788818,0.0029431363,0.38362974],"genre_scores_gemma":[0.81221753,0.0015578304,0.071838,0.0024719385,0.002268493,0.00027789953,0.0019857073,0.001232869,0.10614968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668807,0.0008343017,0.00017769204,0.0008337409,0.0009645368,0.0005015805],"domain_scores_gemma":[0.99589854,0.0013331575,0.00027710682,0.0013646637,0.00084908545,0.00027741672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011578525,0.0009260781,0.0012492411,0.0025961527,0.002944247,0.0048740436,0.0014414247,0.002292869,0.023723373],"category_scores_gemma":[0.0064185136,0.00065471814,0.0014497028,0.002498328,0.0040301955,0.008189955,0.0040951814,0.004309179,0.0067468584],"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.000016677086,0.000004389552,0.000032626405,0.000013833149,0.0000032012124,0.000011727889,0.000066523025,0.0002594526,0.00012990067,0.9946239,0.0018073834,0.0030304093],"study_design_scores_gemma":[0.0000058600576,0.000005879112,0.000033507866,0.0000118087755,0.000005891089,0.00003783034,0.000024386842,0.0013416102,0.00040685668,0.98935,0.008765313,0.000010873754],"about_ca_topic_score_codex":0.0012819933,"about_ca_topic_score_gemma":0.000811093,"teacher_disagreement_score":0.023723373,"about_ca_system_score_codex":0.0021868204,"about_ca_system_score_gemma":0.001569966,"threshold_uncertainty_score":0.07936257},"labels":[],"label_agreement":null},{"id":"W2912680787","doi":"10.1016/j.tcs.2003.06.004","title":"Packing arrays","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Alphabet; Upper and lower bounds; Row; Packing problems; Row and column spaces; Set (abstract data type); Equivalence (formal languages); Matching (statistics); Class (philosophy); Discrete mathematics; Computer science","score_opus":0.005519304663409126,"score_gpt":0.19487625343632034,"score_spread":0.1893569487729112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912680787","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.0756596,0.0018055161,0.5212143,0.0012551778,0.0015513308,0.00019612284,0.00148073,0.004543788,0.39229333],"genre_scores_gemma":[0.6026168,0.0018798774,0.19648638,0.0015767686,0.0009865585,0.0004485144,0.0038004369,0.001488273,0.19071639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992423,0.0001364763,0.000039117374,0.00017387698,0.0002688779,0.00013947404],"domain_scores_gemma":[0.99887925,0.00027229363,0.000098868426,0.0004085363,0.00022563174,0.00011541607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023443202,0.0008524022,0.0009896858,0.0015979671,0.0013387653,0.0024160396,0.0008785932,0.001262414,0.047024433],"category_scores_gemma":[0.0021117267,0.000669764,0.00054296275,0.0024514345,0.0006175596,0.002599407,0.0020867148,0.0015772338,0.016578121],"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.0005028359,0.000214756,0.00067792437,0.00027256008,0.00004923632,0.00034107087,0.00024629507,0.017883811,0.04054887,0.6137228,0.054748956,0.27079096],"study_design_scores_gemma":[0.00010797036,0.00035504324,0.0010507362,0.0001020615,0.00006171074,0.0012428489,0.00033415022,0.138679,0.0666508,0.6162025,0.17512347,0.000089796384],"about_ca_topic_score_codex":0.00023565607,"about_ca_topic_score_gemma":0.00029146424,"teacher_disagreement_score":0.047024433,"about_ca_system_score_codex":0.00048575507,"about_ca_system_score_gemma":0.00035501225,"threshold_uncertainty_score":0.1573124},"labels":[],"label_agreement":null},{"id":"W2913061818","doi":"10.1016/j.tcs.2019.08.005","title":"Refining the r-index","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","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":"Dalhousie University","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Japan Society for the Promotion of Science","keywords":"Index (typography); Computer science; Parsing; Matching (statistics); Lemma (botany); Product (mathematics); Data mining; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Statistics; Programming language; Biology","score_opus":0.014765413942284405,"score_gpt":0.2647630129646452,"score_spread":0.24999759902236082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913061818","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.057168253,0.005346621,0.84691536,0.003556373,0.001421861,0.00017137991,0.0008059629,0.0018512439,0.08276293],"genre_scores_gemma":[0.52271044,0.0032912537,0.4357877,0.0021577973,0.0024958076,0.0002970928,0.0015241725,0.0020556392,0.029680137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934034,0.0023493252,0.00052088045,0.0012511482,0.0019540666,0.00052117807],"domain_scores_gemma":[0.98066163,0.007280044,0.0009510822,0.0073943287,0.0031896373,0.0005232412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054894253,0.0011524458,0.0019403212,0.0043954463,0.0017425184,0.0051518455,0.002503444,0.002193115,0.011222406],"category_scores_gemma":[0.03274025,0.0005885617,0.0009436601,0.0032674833,0.0033118718,0.009722671,0.0057970523,0.0036110173,0.0070532043],"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.00045391207,0.00008759081,0.0010529237,0.00022155035,0.00003788263,0.00015135201,0.0002508374,0.0094946185,0.0066700303,0.81950045,0.012647334,0.14943156],"study_design_scores_gemma":[0.000055475462,0.00015062345,0.00035257725,0.00011691086,0.000036968933,0.00040526438,0.00010347914,0.08246705,0.0077947676,0.87932587,0.02913786,0.00005310166],"about_ca_topic_score_codex":0.00097243965,"about_ca_topic_score_gemma":0.0010016522,"teacher_disagreement_score":0.011222406,"about_ca_system_score_codex":0.0017022946,"about_ca_system_score_gemma":0.0017333373,"threshold_uncertainty_score":0.03754264},"labels":[],"label_agreement":null},{"id":"W2913376930","doi":"10.1016/j.tcs.2009.05.010","title":"Predictable semiautomata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science","score_opus":0.005467650429001623,"score_gpt":0.2282123256084742,"score_spread":0.22274467517947258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913376930","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.22017759,0.0011162806,0.58191574,0.0022274253,0.0006901643,0.00013103119,0.0008056582,0.002464197,0.19047193],"genre_scores_gemma":[0.92343307,0.00041211466,0.025022684,0.0002846075,0.00026102609,0.00011923698,0.0004471453,0.000277416,0.04974279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990746,0.00018192476,0.0000622023,0.00026952638,0.00029160987,0.00012022072],"domain_scores_gemma":[0.9979759,0.0010408312,0.00014145878,0.00038445333,0.00029597708,0.00016136144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066713104,0.00054638716,0.00060429657,0.0009813658,0.0015804266,0.002200289,0.00066030177,0.0007090745,0.012275727],"category_scores_gemma":[0.0027160572,0.00049413857,0.0008906171,0.0007937196,0.0023938902,0.0039136005,0.0019547737,0.0019303225,0.0019816426],"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.0000136441695,0.000008957448,0.0001040856,0.000015757647,0.0000036546314,0.00006919235,0.00018801473,0.00040984794,0.0006337792,0.9933947,0.0009771106,0.0041812323],"study_design_scores_gemma":[0.000007296545,0.00001113259,0.00010092002,0.0000049853966,0.0000053228882,0.00010913221,0.000053668085,0.003874318,0.0008758527,0.9897043,0.005246178,0.000006930547],"about_ca_topic_score_codex":0.00042783492,"about_ca_topic_score_gemma":0.0004084113,"teacher_disagreement_score":0.012275727,"about_ca_system_score_codex":0.000715939,"about_ca_system_score_gemma":0.00066431024,"threshold_uncertainty_score":0.04106641},"labels":[],"label_agreement":null},{"id":"W2914651966","doi":"10.1016/j.tcs.2005.11.006","title":"Uniqueness logic","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linear logic; Uniqueness; Type theory; Mathematics; Equivalence (formal languages); Computer science; Intuitionistic logic; Programming language; Algebra over a field; Theoretical computer science; Discrete mathematics; Calculus (dental); Type (biology); Pure mathematics","score_opus":0.018186929450197606,"score_gpt":0.2621283830519768,"score_spread":0.24394145360177916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914651966","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.0161945,0.00513385,0.46252742,0.008019629,0.0015615782,0.00012591033,0.0013608395,0.00097134686,0.50410485],"genre_scores_gemma":[0.57881063,0.0053334655,0.16437835,0.0065321038,0.0022692448,0.00037136776,0.0025594602,0.0010033204,0.23874211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983979,0.0004227226,0.00011100742,0.0005216235,0.00037852803,0.00016821029],"domain_scores_gemma":[0.99839467,0.000571613,0.000095594914,0.00040545495,0.00039715035,0.00013550636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017484773,0.0008460629,0.0009533878,0.0017627229,0.003393792,0.0048392215,0.0016082029,0.0016485136,0.02390567],"category_scores_gemma":[0.0037792083,0.0006958748,0.0014337233,0.001490818,0.0045452914,0.010904945,0.004131984,0.0055855187,0.0056339027],"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.000010331839,0.0000053352405,0.00008130093,0.000022603383,0.000004399133,0.000016897762,0.00006295038,0.00006325735,0.00013280236,0.99069536,0.0030873427,0.005817474],"study_design_scores_gemma":[0.000007641705,0.0000063224134,0.00007955925,0.000020252495,0.00001282626,0.000120280034,0.00006660655,0.0006733025,0.0005298367,0.9655313,0.032944515,0.000007664456],"about_ca_topic_score_codex":0.0007746997,"about_ca_topic_score_gemma":0.00076737464,"teacher_disagreement_score":0.02390567,"about_ca_system_score_codex":0.0014706287,"about_ca_system_score_gemma":0.0012990916,"threshold_uncertainty_score":0.07997239},"labels":[],"label_agreement":null},{"id":"W2914993520","doi":"10.1016/s0304-3975(02)00589-3","title":"Euclidean strings","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Euclidean geometry; String (physics); Euclidean algorithm; Euclidean domain; Discrete mathematics; Graph; Prime (order theory); Euclidean distance matrix; Euclidean space","score_opus":0.008417326049985073,"score_gpt":0.23900861291711745,"score_spread":0.23059128686713237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914993520","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.052435502,0.0056243315,0.5292533,0.004026788,0.0039807684,0.00024151028,0.0060388283,0.0030287628,0.39537024],"genre_scores_gemma":[0.43000054,0.0046944157,0.24157767,0.0028331126,0.0016725658,0.0004416854,0.0097420355,0.001865382,0.3071727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983631,0.000320926,0.00013648605,0.00040264847,0.00060531107,0.00017153964],"domain_scores_gemma":[0.99867755,0.00034178174,0.000121383746,0.00045284056,0.00029640444,0.000109984496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056577806,0.00089109194,0.00091214513,0.0024541775,0.0011361062,0.0028874427,0.0011699297,0.001642927,0.0523133],"category_scores_gemma":[0.00456998,0.0003485599,0.00065999164,0.003488566,0.0013322363,0.0039600483,0.0024512317,0.002302281,0.02179417],"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.00018328938,0.000034354423,0.0001647893,0.00017275453,0.000016835522,0.000104182865,0.0000844208,0.0017122317,0.0023486875,0.8487523,0.021865498,0.12456055],"study_design_scores_gemma":[0.00004331446,0.00009727962,0.00033219485,0.00013336857,0.000029172395,0.000640055,0.00011482406,0.008798864,0.008137259,0.7829262,0.19869979,0.000047735866],"about_ca_topic_score_codex":0.0002521843,"about_ca_topic_score_gemma":0.00024266858,"teacher_disagreement_score":0.0523133,"about_ca_system_score_codex":0.000834306,"about_ca_system_score_gemma":0.0005597365,"threshold_uncertainty_score":0.17500544},"labels":[],"label_agreement":null},{"id":"W2916766399","doi":"10.1016/j.tcs.2013.05.025","title":"The 2-surviving rate of planar graphs without 6-cycles","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Planar graph; Planar; Mathematics; Graph; Computer science; Discrete mathematics; Computer graphics (images)","score_opus":0.01347688049830958,"score_gpt":0.27745239259162785,"score_spread":0.26397551209331827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916766399","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.9151591,0.001419629,0.039272178,0.0018136668,0.000129625,0.00007455183,0.0017320899,0.00055473245,0.039844386],"genre_scores_gemma":[0.98079795,0.0013940712,0.0068513863,0.00020172817,0.00018346864,0.00014736835,0.0012731551,0.00029302025,0.008857893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998845,0.00032485178,0.000052174135,0.00020649601,0.00023362898,0.0003378694],"domain_scores_gemma":[0.9865118,0.008249137,0.0014910755,0.0013011657,0.00093132653,0.0015155022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020272494,0.000996152,0.0011540882,0.003382886,0.0018714773,0.0032259815,0.0026388504,0.0019004894,0.0089561185],"category_scores_gemma":[0.017680801,0.00069963787,0.0009639982,0.001987236,0.0021368617,0.0051493365,0.001906855,0.0021037553,0.0013171554],"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.0009787945,0.0001817709,0.0089771105,0.0005047107,0.0001146887,0.00053078047,0.0014683347,0.07265884,0.012657317,0.8413435,0.0165403,0.04404392],"study_design_scores_gemma":[0.00011348475,0.00015227529,0.0043556597,0.00012605803,0.0001238965,0.0009172225,0.0007398907,0.13471656,0.006930353,0.84444654,0.007282396,0.0000955292],"about_ca_topic_score_codex":0.001656231,"about_ca_topic_score_gemma":0.001084417,"teacher_disagreement_score":0.0089561185,"about_ca_system_score_codex":0.001206207,"about_ca_system_score_gemma":0.0008872244,"threshold_uncertainty_score":0.029961169},"labels":[],"label_agreement":null},{"id":"W2922342170","doi":"10.1016/j.tcs.2019.03.005","title":"Edit distance neighbourhoods of input-driven pushdown automata","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"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":"Deterministic pushdown automaton; Pushdown automaton; Neighbourhood (mathematics); Embedded pushdown automaton; Context-free language; Automaton; Discrete mathematics; Nondeterministic algorithm; Nested word; Deterministic context-free grammar; Mathematics; Computer science; Combinatorics; Regular language; Theoretical computer science; Automata theory; Nondeterministic finite automaton; Quantum finite automata; Context-free grammar; Rule-based machine translation; Artificial intelligence","score_opus":0.004905713422251415,"score_gpt":0.22424705956990149,"score_spread":0.21934134614765008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922342170","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.4888016,0.00081446854,0.49088052,0.0004313916,0.00014475893,0.0001121522,0.00064013136,0.00088120415,0.01729382],"genre_scores_gemma":[0.9510328,0.00025744038,0.03871734,0.00006872048,0.00008096519,0.00012022339,0.0004417397,0.00017009766,0.009110583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985555,0.0003791728,0.00012506904,0.0003927192,0.00042953985,0.00011797519],"domain_scores_gemma":[0.98816174,0.007638594,0.000915747,0.0012440229,0.0011322421,0.00090759655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011741599,0.00046875485,0.0011930655,0.0017318684,0.0012895382,0.0026832114,0.0016930132,0.0013467458,0.0046334616],"category_scores_gemma":[0.012206362,0.00045126956,0.00087531755,0.0011863105,0.0015632936,0.0038195455,0.0024234613,0.001383456,0.00070055487],"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.00045208912,0.0001550128,0.0019133607,0.00025495628,0.000068653215,0.00080477394,0.0014468867,0.061277673,0.009621055,0.8856877,0.0015313907,0.03678643],"study_design_scores_gemma":[0.00003959025,0.00009940097,0.0005322045,0.000023103716,0.000029697629,0.00026042844,0.00014679377,0.2418838,0.0032543328,0.7515362,0.0021592046,0.000035204845],"about_ca_topic_score_codex":0.0007363692,"about_ca_topic_score_gemma":0.00068072334,"teacher_disagreement_score":0.0046334616,"about_ca_system_score_codex":0.00078739953,"about_ca_system_score_gemma":0.00047371906,"threshold_uncertainty_score":0.015500426},"labels":[],"label_agreement":null},{"id":"W2942613632","doi":"10.1016/j.tcs.2019.05.010","title":"Palindromic Ziv–Lempel and Crochemore factorizations of m-bonacci infinite words","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Research in Fundamental Sciences; Fonds De La Recherche Scientifique - FNRS","keywords":"Palindrome; Fibonacci number; Word (group theory); Factorization; Variation (astronomy); Mathematics; Computer science; Combinatorics; Algorithm; Physics","score_opus":0.010676924602460596,"score_gpt":0.25030753162492947,"score_spread":0.23963060702246888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942613632","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.60349184,0.0027860461,0.17710494,0.002124446,0.0006534322,0.00014553092,0.0008505595,0.00054739544,0.21229574],"genre_scores_gemma":[0.93913203,0.00033114236,0.021079214,0.00031570176,0.0002804409,0.00009333852,0.00036472155,0.00014323943,0.038260154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944395,0.00011059922,0.000031447096,0.00013095736,0.000108009175,0.00017496277],"domain_scores_gemma":[0.9993067,0.00025032306,0.00010555001,0.00008061772,0.0001275973,0.00012920474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005325523,0.00066295324,0.0007051183,0.0020228154,0.0024231835,0.0025148988,0.0006523675,0.0009895369,0.013648738],"category_scores_gemma":[0.0022512153,0.00047530487,0.00090404396,0.0009117351,0.0017865917,0.0025249657,0.0012097618,0.0015204789,0.0022630426],"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.00007965099,0.000015954965,0.00018590175,0.000037795795,0.000004410993,0.00015786637,0.00042396892,0.0004218491,0.0015757931,0.991774,0.00094855466,0.0043742526],"study_design_scores_gemma":[0.000019157358,0.000023262277,0.00032854237,0.000030582643,0.000007477978,0.00018590248,0.00018043701,0.003399527,0.000847034,0.98854464,0.006414036,0.000019455534],"about_ca_topic_score_codex":0.0015698748,"about_ca_topic_score_gemma":0.0016680944,"teacher_disagreement_score":0.013648738,"about_ca_system_score_codex":0.001450423,"about_ca_system_score_gemma":0.0005797554,"threshold_uncertainty_score":0.0456596},"labels":[],"label_agreement":null},{"id":"W2946240107","doi":"10.1016/j.tcs.2019.04.007","title":"Ranking and unranking fixed-density necklaces and Lyndon words","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ranking (information retrieval); Prefix; Combinatorics; Mathematics; Time complexity; Running time; Algorithm; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.003989916041867961,"score_gpt":0.20771983853182152,"score_spread":0.20372992248995356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946240107","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.56613123,0.00112106,0.37316835,0.0012744361,0.0002549339,0.00012654865,0.00067339814,0.0012354574,0.0560145],"genre_scores_gemma":[0.9161835,0.00037065477,0.047286365,0.00026144422,0.00018983867,0.00015711244,0.0006471289,0.00030374725,0.03460028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771774,0.00062666397,0.00019357589,0.00049973826,0.00053467497,0.0004275854],"domain_scores_gemma":[0.9866535,0.007972287,0.0012817367,0.0014304561,0.0015716586,0.0010905078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002151082,0.0006635209,0.0020151378,0.0035126333,0.003170922,0.005450133,0.0019056539,0.0020665044,0.011268772],"category_scores_gemma":[0.016684398,0.00093499065,0.0011442892,0.0027791313,0.004281277,0.008344762,0.0026631104,0.0020110158,0.0016711575],"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.0001121922,0.000035031455,0.0004377076,0.000079057914,0.000012748463,0.00012428971,0.00046017865,0.0032495253,0.0010305577,0.9842748,0.001347386,0.008836433],"study_design_scores_gemma":[0.000019684061,0.000023516784,0.0001395618,0.000015803893,0.000010292973,0.000084207204,0.00012542901,0.011837801,0.0005871752,0.98558784,0.0015472005,0.000021519854],"about_ca_topic_score_codex":0.0022218896,"about_ca_topic_score_gemma":0.0029158844,"teacher_disagreement_score":0.011268772,"about_ca_system_score_codex":0.0018716236,"about_ca_system_score_gemma":0.0011157459,"threshold_uncertainty_score":0.037697792},"labels":[],"label_agreement":null},{"id":"W2946472266","doi":"10.1016/j.tcs.2019.05.016","title":"Polygon simplification by minimizing convex corners","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Saskatchewan; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Simple polygon; Mathematics; Combinatorics; Convex polygon; Rectilinear polygon; Polygon covering; Regular polygon; Equiangular polygon; Star-shaped polygon; Convex set; Geometry; Convex optimization; Computer science","score_opus":0.0056026312033588856,"score_gpt":0.228981535080546,"score_spread":0.22337890387718712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946472266","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.033120085,0.00021988025,0.9534369,0.00016115559,0.000083033665,0.00009027629,0.00011012402,0.00057707576,0.012201418],"genre_scores_gemma":[0.42551887,0.00041480546,0.5595519,0.00011433257,0.000072640316,0.000111556634,0.00043034868,0.0012538729,0.012531653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941087,0.00009583469,0.000024749654,0.00011477636,0.00027305319,0.00008065197],"domain_scores_gemma":[0.999355,0.00026488464,0.00006085813,0.00017714789,0.00010018196,0.000041881507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041426756,0.0010013107,0.0013915143,0.001188194,0.0005005605,0.0014412187,0.001376134,0.001076353,0.0068081026],"category_scores_gemma":[0.002455975,0.00083706644,0.0009921602,0.0010028124,0.0009519106,0.0011454277,0.0017936741,0.0016282169,0.0015965117],"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.00037241649,0.00014585932,0.0012308015,0.0004166025,0.000115335155,0.00036146,0.000351753,0.539374,0.046814103,0.06786236,0.011643037,0.33131233],"study_design_scores_gemma":[0.000030164463,0.000078899146,0.00024605423,0.000028548793,0.000029988407,0.00016953253,0.000065005974,0.9553084,0.014237038,0.024428396,0.0053619067,0.000016057702],"about_ca_topic_score_codex":0.0015736686,"about_ca_topic_score_gemma":0.002570186,"teacher_disagreement_score":0.0068081026,"about_ca_system_score_codex":0.00058332516,"about_ca_system_score_gemma":0.0005446429,"threshold_uncertainty_score":0.022775352},"labels":[],"label_agreement":null},{"id":"W2949692144","doi":"10.1016/j.tcs.2015.02.015","title":"Influence diffusion in social networks under time window constraints","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cardinality (data modeling); Bounded function; Set (abstract data type); Node (physics); Combinatorics; Mathematics; Time complexity; Integer (computer science); Discrete mathematics; Interval (graph theory); Graph; Cardinal number (linguistics); Computer science; Data mining","score_opus":0.009222613740755411,"score_gpt":0.2639103993097142,"score_spread":0.2546877855689588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949692144","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.46756634,0.003185996,0.507659,0.005812018,0.00026710654,0.00016129398,0.0009934026,0.00026415545,0.014090752],"genre_scores_gemma":[0.97169614,0.0021311755,0.012607071,0.0002267569,0.00048589893,0.00022413027,0.00034797654,0.00010381123,0.012177073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844825,0.00058500504,0.00007294693,0.0003682817,0.00023430493,0.0002911104],"domain_scores_gemma":[0.9470083,0.044330355,0.0040222136,0.0012879304,0.001537453,0.0018136662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053499327,0.0009464858,0.002696343,0.0021871096,0.00142514,0.0035660265,0.0030737256,0.0032557826,0.0069224327],"category_scores_gemma":[0.046635,0.0014347689,0.0011240275,0.0022092476,0.0022193613,0.008656302,0.002158,0.0026885697,0.0005327823],"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.00036097367,0.00013260054,0.0048559224,0.000283298,0.00018458706,0.00052990747,0.0005328431,0.31843442,0.0018544946,0.65458506,0.003909313,0.0143366335],"study_design_scores_gemma":[0.00004353951,0.00003149776,0.0012900226,0.000023134246,0.000044798646,0.0000617936,0.000076223965,0.83495045,0.00017751528,0.1624573,0.00081846287,0.000025266281],"about_ca_topic_score_codex":0.011368942,"about_ca_topic_score_gemma":0.006763649,"teacher_disagreement_score":0.011368942,"about_ca_system_score_codex":0.0022695744,"about_ca_system_score_gemma":0.0011655865,"threshold_uncertainty_score":0.02829349},"labels":[],"label_agreement":null},{"id":"W2950599253","doi":"10.1016/j.tcs.2016.06.045","title":"Simultaneous visibility representations of plane st-graphs using L-shapes","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Combinatorics; Visibility; Vertex (graph theory); Mathematics; Visibility graph; Plane (geometry); Embedding; Representation (politics); Geometry; Graph; Computer science; Physics; Artificial intelligence; Optics; Regular polygon","score_opus":0.01628924726108992,"score_gpt":0.2906817391612559,"score_spread":0.27439249190016596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950599253","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.04032786,0.00007750934,0.9487973,0.00008949579,0.00003646601,0.000040302613,0.00022255063,0.0008415859,0.00956687],"genre_scores_gemma":[0.6207096,0.0002906808,0.36920816,0.00009015238,0.000044261982,0.000101997844,0.00076299836,0.00083714223,0.007954961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977535,0.000037682268,0.000011229604,0.000044039996,0.00008593724,0.000045853518],"domain_scores_gemma":[0.99931824,0.00023217141,0.000076468095,0.00017820513,0.0001319086,0.000063053616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021211761,0.00061161246,0.0005660006,0.0011153718,0.00036945843,0.0018827826,0.001065465,0.0010148131,0.008900702],"category_scores_gemma":[0.0017174475,0.00044655794,0.00082296407,0.0009277973,0.00059013587,0.0019276977,0.0016937638,0.0013646361,0.0014716674],"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.00039514987,0.000121721736,0.0010161832,0.00028197243,0.000050513278,0.00049916806,0.0008474696,0.22745566,0.033644903,0.48617736,0.00690547,0.24260445],"study_design_scores_gemma":[0.00002972899,0.000042063963,0.00019272222,0.00004378209,0.000015239819,0.00013790467,0.00018648754,0.8310633,0.0070820707,0.15383965,0.007342718,0.000024329855],"about_ca_topic_score_codex":0.0017379574,"about_ca_topic_score_gemma":0.002840464,"teacher_disagreement_score":0.008900702,"about_ca_system_score_codex":0.0004504974,"about_ca_system_score_gemma":0.00040362542,"threshold_uncertainty_score":0.029775798},"labels":[],"label_agreement":null},{"id":"W2950744132","doi":"10.1016/j.tcs.2018.02.020","title":"Scheduling maintenance jobs in networks","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Einstein Stiftung Berlin; Deutsche Forschungsgemeinschaft; Alexander von Humboldt-Stiftung","keywords":"Preemption; Scheduling (production processes); Computer science; Time complexity; Mathematical optimization; Job shop scheduling; Simple (philosophy); Distributed computing; Mathematics; Algorithm; Computer network","score_opus":0.01711956884023272,"score_gpt":0.27661183589703037,"score_spread":0.2594922670567976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950744132","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.39046213,0.002244542,0.58429587,0.0028887193,0.0005637896,0.00026990776,0.00041484548,0.000884214,0.017975938],"genre_scores_gemma":[0.94377923,0.0005321001,0.046322975,0.00012000343,0.00020402062,0.00006903729,0.00022736541,0.00016584371,0.008579433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999516,0.00014848581,0.000021259175,0.00011896799,0.00007244243,0.00012285452],"domain_scores_gemma":[0.9981964,0.0012066708,0.00015037984,0.00016501415,0.00013870177,0.00014273582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010881724,0.0007577658,0.0009441157,0.0006334761,0.00079429476,0.0015391514,0.0013319179,0.0014150775,0.0054490343],"category_scores_gemma":[0.005752567,0.0005869799,0.00042219987,0.0009256635,0.0007108312,0.0018474488,0.00075935613,0.0010280601,0.00049781246],"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.0015014987,0.00021993447,0.0015804128,0.00050751324,0.000076752556,0.00016899104,0.00019572015,0.8278246,0.0063305744,0.044657685,0.011448501,0.10548774],"study_design_scores_gemma":[0.000040525705,0.00007936825,0.00033545104,0.000013869653,0.000024628278,0.000038509843,0.000053714924,0.9584247,0.0014602909,0.037843477,0.0016785555,0.0000069560588],"about_ca_topic_score_codex":0.0027990404,"about_ca_topic_score_gemma":0.002493368,"teacher_disagreement_score":0.0054490343,"about_ca_system_score_codex":0.0010383342,"about_ca_system_score_gemma":0.0010441099,"threshold_uncertainty_score":0.018228829},"labels":[],"label_agreement":null},{"id":"W2951107219","doi":"10.1016/j.tcs.2019.05.004","title":"Approximability of covering cells with line segments","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; United States-Israel Binational Science Foundation","keywords":"Parameterized complexity; Line segment; Line (geometry); Combinatorics; Cover (algebra); Plane (geometry); Orientation (vector space); Set (abstract data type); Mathematics; Computer science; Geometry","score_opus":0.011110302829467116,"score_gpt":0.2442435876333809,"score_spread":0.23313328480391377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951107219","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.40467092,0.0005251477,0.58018106,0.00033737038,0.00006444786,0.000056896573,0.00033560066,0.0005823287,0.013246252],"genre_scores_gemma":[0.90690625,0.0002998903,0.08728076,0.00007239925,0.000046643116,0.00006425201,0.0006669563,0.00022401467,0.0044388995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926823,0.00021118182,0.000037675654,0.00013423355,0.00024272362,0.00010595248],"domain_scores_gemma":[0.9954608,0.0032592618,0.0002620137,0.00046484577,0.0003319522,0.00022114723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008388894,0.00066504884,0.00075390434,0.001171659,0.0004098866,0.0017305771,0.0011825135,0.0009873215,0.00569877],"category_scores_gemma":[0.008327316,0.0004166712,0.0007112859,0.0009214784,0.0010977283,0.0015870814,0.0019792947,0.001370343,0.0004920212],"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.0009758089,0.00017814239,0.006749475,0.00048759885,0.00010859421,0.0003483959,0.00085426675,0.51868784,0.018453984,0.34406212,0.0045309938,0.1045628],"study_design_scores_gemma":[0.000022983699,0.00006772261,0.00047399607,0.000030726093,0.000021029788,0.00012992299,0.0000863435,0.8944701,0.0036206192,0.09900691,0.0020609188,0.000008688052],"about_ca_topic_score_codex":0.0018883231,"about_ca_topic_score_gemma":0.00095316616,"teacher_disagreement_score":0.00569877,"about_ca_system_score_codex":0.0010098991,"about_ca_system_score_gemma":0.00031794983,"threshold_uncertainty_score":0.019064307},"labels":[],"label_agreement":null},{"id":"W2951631472","doi":"10.1016/j.tcs.2020.06.034","title":"Gathering in the plane of location-aware robots in the presence of spies","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","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":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Computer science; Trajectory; Cartesian coordinate system; Mobile robot; Set (abstract data type); Adversary; Competitive analysis; Upper and lower bounds; Artificial intelligence; Distributed computing; Mathematics; Computer security; Geometry","score_opus":0.03225027025388177,"score_gpt":0.2892882062314384,"score_spread":0.25703793597755664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951631472","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.30850798,0.00087064883,0.6709558,0.0011369792,0.00007675206,0.00010993229,0.00031011272,0.0002506565,0.017781096],"genre_scores_gemma":[0.91531336,0.00074524625,0.07446315,0.00012212878,0.00009157987,0.00010125199,0.00032119686,0.00006676245,0.008775375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991454,0.00029984838,0.000028379067,0.00020866994,0.00018034164,0.00013737722],"domain_scores_gemma":[0.99747854,0.0013930663,0.00051618146,0.00016856939,0.00021126808,0.00023228765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010192989,0.0009888512,0.0013842368,0.0011705725,0.0014197194,0.0025553217,0.0016021056,0.0021937222,0.0018627119],"category_scores_gemma":[0.006124258,0.0010307236,0.00080905017,0.0012611726,0.0019765378,0.003306768,0.0037908433,0.001493443,0.0004215715],"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.00066300365,0.00011466005,0.0023822845,0.00019602604,0.00012638794,0.00061338616,0.0005709808,0.8874967,0.0066318014,0.079383254,0.0024429068,0.019378552],"study_design_scores_gemma":[0.000026012,0.000087906286,0.00054351083,0.000015887796,0.000019735004,0.00013039929,0.0002259116,0.96379495,0.0008480965,0.033338685,0.0009497584,0.000019183613],"about_ca_topic_score_codex":0.0064198086,"about_ca_topic_score_gemma":0.0036533265,"teacher_disagreement_score":0.0064198086,"about_ca_system_score_codex":0.000943728,"about_ca_system_score_gemma":0.00077280885,"threshold_uncertainty_score":0.012764871},"labels":[],"label_agreement":null},{"id":"W2951748104","doi":"10.1016/j.tcs.2018.10.018","title":"Gathering in dynamic rings","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"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":"Rendezvous; Traverse; Computer science; Constructive; Focus (optics); Characterization (materials science); Class (philosophy); Interval (graph theory); Time complexity; Set (abstract data type); Network topology; Topology (electrical circuits); Theoretical computer science; Mathematics; Algorithm; Combinatorics; Artificial intelligence; Computer network; Process (computing)","score_opus":0.008158914473346624,"score_gpt":0.26923965560583335,"score_spread":0.26108074113248675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951748104","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.2166945,0.0017096543,0.67964447,0.0035350139,0.00026509658,0.00025936493,0.0006130201,0.001086069,0.09619282],"genre_scores_gemma":[0.8655599,0.0011729723,0.082474075,0.00029487026,0.00032387604,0.00018034257,0.0004994232,0.00026858642,0.04922602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982552,0.00065656705,0.000072876785,0.00034640633,0.00033956644,0.0003294303],"domain_scores_gemma":[0.9946142,0.002829487,0.00065312505,0.000925084,0.00038028823,0.0005979624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020509015,0.0006087965,0.001455119,0.0018785862,0.0030069835,0.0033603914,0.0015037261,0.001208578,0.014392539],"category_scores_gemma":[0.008887503,0.0007418798,0.0010376737,0.002078633,0.002120072,0.0079231,0.004108587,0.0024512236,0.0017996038],"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.00018839525,0.00006268435,0.00037040736,0.00012230597,0.0000291845,0.00008698719,0.00030381005,0.021400359,0.0011953504,0.951996,0.005121669,0.019123018],"study_design_scores_gemma":[0.000047648722,0.0000768352,0.0002756565,0.000036762678,0.00003812854,0.0001879656,0.0001896877,0.1186953,0.0013456601,0.86821854,0.010862661,0.00002515945],"about_ca_topic_score_codex":0.0008323979,"about_ca_topic_score_gemma":0.00078373635,"teacher_disagreement_score":0.014392539,"about_ca_system_score_codex":0.0013928781,"about_ca_system_score_gemma":0.0008740116,"threshold_uncertainty_score":0.048147798},"labels":[],"label_agreement":null},{"id":"W2951933371","doi":"10.1016/j.tcs.2019.05.025","title":"Quantifying sequential subsumption","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Ulster University; Queen's University Belfast; European Commission","keywords":"Subsequence; Extension (predicate logic); Intension; Multiset; Computer science; Relation (database); Set (abstract data type); Intersection (aeronautics); Interpretation (philosophy); Theoretical computer science; Representation (politics); Domain (mathematical analysis); Axiom; Artificial intelligence; Algorithm; Mathematics; Data mining; Discrete mathematics","score_opus":0.03138973070649824,"score_gpt":0.2808420414297092,"score_spread":0.24945231072321095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951933371","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.15098001,0.0010400868,0.80790174,0.00088728894,0.00016039392,0.00009894963,0.000331741,0.00045204526,0.038147736],"genre_scores_gemma":[0.83498985,0.0004204897,0.1548041,0.0002133661,0.0001539541,0.00008324223,0.00036936882,0.0001733113,0.008792368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942906,0.0014264614,0.0004656922,0.0012491556,0.002071952,0.0004960658],"domain_scores_gemma":[0.98883575,0.005279803,0.00082322926,0.0024973762,0.00216106,0.00040280342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045595337,0.00087914494,0.001037774,0.0038480742,0.0014284063,0.003519366,0.0014936805,0.0011321203,0.007856011],"category_scores_gemma":[0.0159532,0.00071999873,0.001649319,0.003604781,0.0031814852,0.011982915,0.0035482934,0.0018891322,0.00074561033],"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.00007066112,0.00004061161,0.0015363239,0.00010821719,0.000085735766,0.0001379083,0.000477001,0.005745111,0.0024311002,0.95053035,0.0007136554,0.038123388],"study_design_scores_gemma":[0.000004662815,0.000029160614,0.00066316704,0.000024271329,0.000052615404,0.00012656723,0.00015455724,0.02372831,0.0028144242,0.9695895,0.002797923,0.000014910682],"about_ca_topic_score_codex":0.0018183715,"about_ca_topic_score_gemma":0.0017999378,"teacher_disagreement_score":0.007856011,"about_ca_system_score_codex":0.001804809,"about_ca_system_score_gemma":0.0011633338,"threshold_uncertainty_score":0.026281},"labels":[],"label_agreement":null},{"id":"W2955563424","doi":"10.1016/j.tcs.2019.05.031","title":"On the complexity of the k-kernel problem on cyclically k-partite digraphs","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Digraph; Combinatorics; Mathematics; Kernel (algebra); Integer (computer science); Vertex (graph theory); Discrete mathematics; Bipartite graph; Graph; Computer science","score_opus":0.025252963076736835,"score_gpt":0.27816583279390467,"score_spread":0.2529128697171678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955563424","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.8312812,0.0015796168,0.10779051,0.012282023,0.00028336816,0.0002873484,0.0052415244,0.0010941932,0.040160142],"genre_scores_gemma":[0.9605656,0.00090590207,0.023491913,0.00061535876,0.00047509215,0.00018683715,0.003329141,0.00045319885,0.009976934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966904,0.0009875405,0.00017031426,0.0007171415,0.0006156722,0.00081891846],"domain_scores_gemma":[0.94127995,0.05021984,0.0026154679,0.0025457577,0.0012683631,0.0020705767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020789674,0.0012152119,0.0028918474,0.0017858597,0.0025993006,0.008460234,0.0049157673,0.0037023793,0.019715343],"category_scores_gemma":[0.026654758,0.0012980298,0.0018144093,0.003501002,0.003472058,0.018367704,0.0043607587,0.0053206324,0.0014826823],"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.002899533,0.0011759438,0.01084963,0.0017029298,0.00036352943,0.0007972913,0.0019187033,0.3183009,0.0057859183,0.5598463,0.04055957,0.055799805],"study_design_scores_gemma":[0.000244794,0.000082195525,0.0015763273,0.00006071119,0.00009267484,0.0002663206,0.0004430086,0.36659414,0.0011936311,0.62761444,0.0017723403,0.000059323596],"about_ca_topic_score_codex":0.007880896,"about_ca_topic_score_gemma":0.008788554,"teacher_disagreement_score":0.019715343,"about_ca_system_score_codex":0.0044901557,"about_ca_system_score_gemma":0.0032398384,"threshold_uncertainty_score":0.06595439},"labels":[],"label_agreement":null},{"id":"W2962987831","doi":"10.1016/j.tcs.2011.05.057","title":"The growth function of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>S</mml:mi></mml:math>-recognizable sets","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scroll; Function (biology); Mathematics; Computer science; Algorithm; Computer graphics (images); Theology; Philosophy; Biology","score_opus":0.014901754697260744,"score_gpt":0.22520454045590907,"score_spread":0.21030278575864833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962987831","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.5407336,0.0019259037,0.3135529,0.006696017,0.00044038068,0.0001717995,0.005360069,0.0029972843,0.1281221],"genre_scores_gemma":[0.91733545,0.0011760629,0.028160471,0.00031889183,0.00029226427,0.00030034207,0.0025198206,0.0008721665,0.049024418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871266,0.00026376988,0.000051998148,0.00030013407,0.0003741957,0.0002972202],"domain_scores_gemma":[0.97401506,0.018869504,0.0010826341,0.0010356392,0.0033241394,0.0016730181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019595453,0.00086116075,0.00073209376,0.0035121108,0.0011416385,0.004094612,0.00141369,0.0014501238,0.02057665],"category_scores_gemma":[0.02353553,0.00039552973,0.00080472406,0.0013846825,0.0026524023,0.005083904,0.0013649826,0.00197795,0.005281081],"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.00028799052,0.0000572693,0.004002753,0.0002928174,0.000026279025,0.00021837738,0.0007931255,0.013494865,0.005823605,0.9214525,0.013258074,0.04029233],"study_design_scores_gemma":[0.000049508,0.0001057748,0.005349116,0.0002136549,0.00004960488,0.0009555315,0.0005216548,0.12711361,0.014914102,0.82876,0.021865804,0.00010155931],"about_ca_topic_score_codex":0.0017823117,"about_ca_topic_score_gemma":0.00092292164,"teacher_disagreement_score":0.02057665,"about_ca_system_score_codex":0.0030933614,"about_ca_system_score_gemma":0.0012989808,"threshold_uncertainty_score":0.068835795},"labels":[],"label_agreement":null},{"id":"W2963350743","doi":"10.1016/j.tcs.2018.10.004","title":"Hyperopic Cops and Robbers","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; St. Francis Xavier University; Acadia University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Swedish Foundation for International Cooperation in Research and Higher Education; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Countable set; Graph; Discrete mathematics","score_opus":0.049682151329604775,"score_gpt":0.36727250725716903,"score_spread":0.31759035592756424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963350743","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.32894337,0.001975258,0.48051566,0.0036684813,0.00046241592,0.0001413819,0.00024219631,0.00020110322,0.18385026],"genre_scores_gemma":[0.9197426,0.00078659947,0.027793642,0.0003325993,0.00030897855,0.00019882033,0.00012642948,0.00009109085,0.050619185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988593,0.00049881125,0.000039430266,0.00018137059,0.00024114517,0.0001799811],"domain_scores_gemma":[0.9964868,0.002073064,0.00038048314,0.00025636217,0.0002703652,0.0005328907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012255692,0.0006879548,0.0011760489,0.0012929868,0.001309062,0.0023956012,0.0010516704,0.0015399635,0.015897162],"category_scores_gemma":[0.007551003,0.00044165188,0.0006379772,0.0009092552,0.0033262987,0.003931766,0.0027438474,0.0019906424,0.00079562754],"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.0000370142,0.00001905168,0.00016818252,0.000055707576,0.000015052445,0.0000701568,0.00013202975,0.007440729,0.0003702838,0.98366076,0.0016673828,0.0063637043],"study_design_scores_gemma":[0.000013298827,0.000024967736,0.0002705993,0.000021341355,0.000006993969,0.000059316324,0.00009394335,0.026553323,0.00013122131,0.97024506,0.0025710159,0.000008892355],"about_ca_topic_score_codex":0.0011685215,"about_ca_topic_score_gemma":0.00089580467,"teacher_disagreement_score":0.015897162,"about_ca_system_score_codex":0.00081359525,"about_ca_system_score_gemma":0.0006920495,"threshold_uncertainty_score":0.05318129},"labels":[],"label_agreement":null},{"id":"W2963812988","doi":"10.1016/j.tcs.2013.09.024","title":"Adaptive and optimal online linear regression on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>-balls","year":2013,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Agence Nationale de la Recherche; European Commission","keywords":"Regret; Ball (mathematics); Dimension (graph theory); Mathematics; Linear regression; Minimax; Algorithm; Discrete mathematics; Applied mathematics; Computer science; Combinatorics; Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.030323114225871677,"score_gpt":0.2978322730377435,"score_spread":0.2675091588118718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963812988","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.012286816,0.0014850802,0.9597219,0.0033742746,0.00040530023,0.000106125495,0.0012124721,0.0020706537,0.01933735],"genre_scores_gemma":[0.41665262,0.0029641395,0.4654971,0.0017330076,0.0013867882,0.00081869133,0.0065190736,0.0018111275,0.1026174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644476,0.0016532838,0.0001900465,0.00060982845,0.0007405353,0.00036154958],"domain_scores_gemma":[0.9817837,0.013550331,0.0006372107,0.0019764495,0.0015576847,0.00049475126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004282832,0.0019485108,0.0025585275,0.0011821064,0.00080375385,0.002557537,0.0021963636,0.001789942,0.023425082],"category_scores_gemma":[0.031166887,0.0009913287,0.0014327624,0.0019261616,0.001694988,0.0038256901,0.0033367025,0.0045854766,0.008130963],"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.00079971505,0.0003733263,0.0015057796,0.00052469503,0.00016213338,0.00026366385,0.00018426513,0.38168943,0.0017994515,0.32516798,0.08989715,0.19763239],"study_design_scores_gemma":[0.00006405408,0.000055957695,0.00049507973,0.000059901336,0.000025317155,0.000047375463,0.000027384764,0.8523829,0.0007496527,0.13956605,0.006506323,0.000019972606],"about_ca_topic_score_codex":0.00840398,"about_ca_topic_score_gemma":0.014024514,"teacher_disagreement_score":0.023425082,"about_ca_system_score_codex":0.0023127638,"about_ca_system_score_gemma":0.0033767747,"threshold_uncertainty_score":0.07836467},"labels":[],"label_agreement":null},{"id":"W2963943201","doi":"10.1016/j.tcs.2018.06.039","title":"Constructing de Bruijn sequences by concatenating smaller universal cycles","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Disjoint sets; De Bruijn graph; Set (abstract data type); Combinatorics; Mathematics; Discrete mathematics; Algorithm; Computer science","score_opus":0.010244523004723291,"score_gpt":0.2417172559699828,"score_spread":0.23147273296525953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963943201","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.28682733,0.0006326654,0.6785478,0.00053820806,0.00041393252,0.00028156687,0.00032637012,0.002259827,0.030172346],"genre_scores_gemma":[0.58148605,0.00048706934,0.40206197,0.00034081048,0.0001268252,0.00026829186,0.0005989464,0.0008268417,0.013803193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920577,0.00023966128,0.000071787945,0.00019906096,0.00015884348,0.00012485508],"domain_scores_gemma":[0.9979588,0.0009872675,0.00012558348,0.0006119519,0.00019066845,0.00012572392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006724406,0.0006854437,0.0007600594,0.0013960699,0.0008821826,0.0010687374,0.00081118307,0.00083137886,0.0064906674],"category_scores_gemma":[0.0039694957,0.0006643653,0.0007230076,0.0012478039,0.000984618,0.0023092907,0.0021127318,0.0012975131,0.0017862014],"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.0005881865,0.00033907226,0.0016381685,0.00055961224,0.00009176021,0.0005627661,0.0010674619,0.039975945,0.085540675,0.52435,0.0045732646,0.34071302],"study_design_scores_gemma":[0.00012113003,0.0004752062,0.0008266809,0.00024154731,0.00012727387,0.0007432434,0.00043240667,0.15501924,0.10916843,0.67447263,0.058241475,0.00013066227],"about_ca_topic_score_codex":0.0003683738,"about_ca_topic_score_gemma":0.0007995516,"teacher_disagreement_score":0.0064906674,"about_ca_system_score_codex":0.00044928503,"about_ca_system_score_gemma":0.0007617638,"threshold_uncertainty_score":0.021713495},"labels":[],"label_agreement":null},{"id":"W2963945095","doi":"10.1016/j.tcs.2019.07.018","title":"Energy-optimal broadcast and exploration in a tree using mobile agents","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"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","keywords":"Tree (set theory); Node (physics); Computer science; Enhanced Data Rates for GSM Evolution; Mobile agent; Root (linguistics); Set (abstract data type); Broadcasting (networking); Energy (signal processing); Algorithm; Mathematics; Combinatorics; Theoretical computer science; Distributed computing; Computer network; Artificial intelligence","score_opus":0.023103416894729476,"score_gpt":0.2757461246963497,"score_spread":0.2526427078016202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963945095","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.2401027,0.0008275246,0.749135,0.0007560819,0.000094100935,0.000103722894,0.00013951532,0.0003535709,0.008487774],"genre_scores_gemma":[0.8766828,0.00030558812,0.11702478,0.00008018711,0.000044908968,0.000102108235,0.000095927666,0.00009953148,0.0055640005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996278,0.00013958428,0.000017132252,0.000057737157,0.000063395,0.00009423943],"domain_scores_gemma":[0.9971692,0.0021751404,0.0001527412,0.00012016093,0.0001750864,0.00020771411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009253761,0.000501026,0.0014210877,0.00092928356,0.0008438323,0.0010205528,0.0013419323,0.0016984871,0.002202085],"category_scores_gemma":[0.004865237,0.0005882717,0.0006885651,0.0011430542,0.0010599479,0.0016941185,0.0016395727,0.0009840815,0.000277086],"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.00038416297,0.00009910363,0.00057431305,0.000084839645,0.000038074504,0.00008505457,0.00017667148,0.94449097,0.0028024276,0.029599948,0.0011779701,0.020486495],"study_design_scores_gemma":[0.000024136216,0.000032206197,0.000057792804,0.0000064318415,0.0000072998273,0.000013182967,0.000024370589,0.98982286,0.00025646196,0.009559068,0.00019236493,0.0000038996773],"about_ca_topic_score_codex":0.0038924299,"about_ca_topic_score_gemma":0.0038752896,"teacher_disagreement_score":0.0038924299,"about_ca_system_score_codex":0.0008763949,"about_ca_system_score_gemma":0.00086133025,"threshold_uncertainty_score":0.007739544},"labels":[],"label_agreement":null},{"id":"W2963996369","doi":"10.1016/j.tcs.2017.08.018","title":"Compressed cliques graphs, clique coverings and positive zero forcing","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Clique problem; Clique graph; Clique-sum; Clique; Uniqueness; Discrete mathematics; Split graph; Vertex (graph theory); Forcing (mathematics); Chordal graph; Graph; Line graph; 1-planar graph; Voltage graph; Mathematical analysis","score_opus":0.014143678941328121,"score_gpt":0.30547091327431436,"score_spread":0.29132723433298624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963996369","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.5405872,0.0012276114,0.34882087,0.008341766,0.00043436294,0.00012053624,0.0015470069,0.00093584607,0.097984865],"genre_scores_gemma":[0.9551351,0.0003581105,0.026161104,0.00069371506,0.00039330559,0.00012700583,0.00079590897,0.00023743341,0.016098242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869555,0.00038420036,0.000039430535,0.000316028,0.0003080443,0.00025681328],"domain_scores_gemma":[0.9900427,0.006571151,0.00088636414,0.0012341865,0.00051933073,0.00074636284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011204488,0.00051110616,0.0010819415,0.0014893387,0.0027630972,0.0026656839,0.0014477238,0.0014431147,0.013242354],"category_scores_gemma":[0.009781233,0.00067673717,0.00086040044,0.0017788681,0.0042641447,0.005123146,0.0034122472,0.002861991,0.000732406],"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.00014106618,0.000031707717,0.00039928406,0.00006581788,0.000012281004,0.00006727457,0.00022869761,0.006792284,0.0012635309,0.9811608,0.0032646614,0.006572574],"study_design_scores_gemma":[0.000028111155,0.000011230427,0.00022729607,0.00001284793,0.000007764793,0.000077886994,0.0000721843,0.016838713,0.00047342712,0.9804613,0.0017774424,0.000011906509],"about_ca_topic_score_codex":0.0017949783,"about_ca_topic_score_gemma":0.002785781,"teacher_disagreement_score":0.013242354,"about_ca_system_score_codex":0.0016131734,"about_ca_system_score_gemma":0.0011183688,"threshold_uncertainty_score":0.04430014},"labels":[],"label_agreement":null},{"id":"W2967821251","doi":"10.1016/j.tcs.2019.08.017","title":"Perfect Roman domination in graphs","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Science and Engineering Research Board","keywords":"Combinatorics; Mathematics; Chordal graph; Interval graph; Bipartite graph; Vertex (graph theory); Minimum weight; Discrete mathematics; Dominating set; Strong perfect graph theorem; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.007997550992975874,"score_gpt":0.27476650948472203,"score_spread":0.26676895849174614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967821251","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.64803135,0.00095715467,0.06554311,0.002735148,0.00021291699,0.00008530567,0.00047892434,0.0003521785,0.28160393],"genre_scores_gemma":[0.9761553,0.00032677475,0.0049979617,0.00022766371,0.00010567575,0.000041169587,0.00019541274,0.00006551721,0.017884657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979842,0.00076065504,0.00006505821,0.00029371932,0.0004235993,0.00047273762],"domain_scores_gemma":[0.99450123,0.0030782612,0.00064088893,0.0005568458,0.0005162967,0.00070640666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015233257,0.00045138935,0.0009258245,0.0021986386,0.003150885,0.0046086246,0.0010695114,0.0011038292,0.009441176],"category_scores_gemma":[0.008377557,0.00061265967,0.00052989525,0.00232281,0.00375551,0.004542018,0.0023170754,0.0018392692,0.0010245182],"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.000071964045,0.000015308986,0.00043473838,0.000035228622,0.0000070442793,0.000066938424,0.00032518336,0.0009962508,0.00039416444,0.9913856,0.0015926473,0.0046749855],"study_design_scores_gemma":[0.000028986147,0.000011622363,0.00035168882,0.000015256401,0.000009297916,0.00013078724,0.0001310547,0.0043466915,0.00047237118,0.9917259,0.0027667389,0.0000096863],"about_ca_topic_score_codex":0.0013429711,"about_ca_topic_score_gemma":0.0014372434,"teacher_disagreement_score":0.009441176,"about_ca_system_score_codex":0.0012592287,"about_ca_system_score_gemma":0.0008773283,"threshold_uncertainty_score":0.031583846},"labels":[],"label_agreement":null},{"id":"W2969288761","doi":"10.1016/j.tcs.2020.11.015","title":"Bounding game temperature using confusion intervals","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Concordia University of Edmonton","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Upper and lower bounds; Combinatorics; Confusion; Mathematics; Bounded function; Interval (graph theory); Bounding overwatch; Closure (psychology); Class (philosophy); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.052806332973846626,"score_gpt":0.33198652342372825,"score_spread":0.2791801904498816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969288761","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.035537552,0.0004780292,0.9539565,0.00056218164,0.0001582253,0.00006980332,0.00014095857,0.0008715356,0.008225167],"genre_scores_gemma":[0.88324267,0.00026003897,0.111623496,0.00025726322,0.00014707832,0.00021011375,0.00018943567,0.0004863366,0.0035835055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921193,0.003199634,0.00026451692,0.0013135354,0.001982672,0.0011202279],"domain_scores_gemma":[0.94177705,0.04664777,0.0019835925,0.0042641005,0.0030656364,0.0022618514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054641077,0.002081249,0.0023921167,0.002095109,0.0013709553,0.0042109406,0.004066285,0.0019682935,0.006028857],"category_scores_gemma":[0.062297422,0.0011305489,0.0013025407,0.0013443852,0.0034440886,0.007822989,0.0064910087,0.006534385,0.00087188225],"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.00094131945,0.00018018305,0.002343592,0.00019913865,0.00010181779,0.000099899604,0.00045039662,0.5740392,0.0048437393,0.3675863,0.0040007755,0.04521351],"study_design_scores_gemma":[0.000015985315,0.000025962321,0.0001537273,0.000018277231,0.000011693322,0.000016494349,0.000019732264,0.8731347,0.0009835747,0.12512916,0.00047448502,0.000016123233],"about_ca_topic_score_codex":0.00404638,"about_ca_topic_score_gemma":0.0027385056,"teacher_disagreement_score":0.006028857,"about_ca_system_score_codex":0.0034188922,"about_ca_system_score_gemma":0.0021602744,"threshold_uncertainty_score":0.028897285},"labels":[],"label_agreement":null},{"id":"W2970627438","doi":"10.1016/j.tcs.2019.08.031","title":"Searching for a non-adversarial, uncooperative agent on a cycle","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Perimeter; Position (finance); RADIUS; Computer science; Upper and lower bounds; Constant (computer programming); Turning radius; Mobile robot; Mathematics; Algorithm; Artificial intelligence; Engineering; Geometry; Computer network","score_opus":0.01357223503755122,"score_gpt":0.28620262882830155,"score_spread":0.2726303937907503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970627438","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.36771703,0.00027291852,0.60488427,0.0035434999,0.00015802891,0.00033663245,0.00023785543,0.0006041425,0.022245584],"genre_scores_gemma":[0.8899217,0.0001336606,0.09615696,0.0002767199,0.000043849595,0.00015529347,0.00013583926,0.000096481024,0.013079485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995209,0.00013202861,0.000016540771,0.00014287274,0.00006930321,0.00011829304],"domain_scores_gemma":[0.997974,0.0012092994,0.00015057677,0.00018984034,0.00015652296,0.00031972642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008348985,0.00072017446,0.0012044695,0.00067107857,0.0013199251,0.0014334884,0.0023069135,0.0028989634,0.0072995117],"category_scores_gemma":[0.0049817734,0.00048686133,0.00066696823,0.0005194769,0.0013981296,0.0026106343,0.002456531,0.0015527309,0.0006870757],"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.0011539472,0.0003786109,0.0028761667,0.00026419494,0.00019876119,0.00070786965,0.00034232138,0.78600913,0.006609943,0.14584854,0.0056832246,0.049927264],"study_design_scores_gemma":[0.000051015588,0.0001390544,0.000113953305,0.000016393595,0.000018158362,0.00005918578,0.00006627936,0.9577328,0.0009371787,0.039926343,0.0009278954,0.00001177798],"about_ca_topic_score_codex":0.002515271,"about_ca_topic_score_gemma":0.0029321916,"teacher_disagreement_score":0.0072995117,"about_ca_system_score_codex":0.0008735841,"about_ca_system_score_gemma":0.002200978,"threshold_uncertainty_score":0.024419308},"labels":[],"label_agreement":null},{"id":"W2974488648","doi":"10.1016/j.tcs.2019.09.020","title":"Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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","keywords":"Computer science; Synchronization (alternating current); Parallel computing; Clock synchronization; Channel (broadcasting); Real-time computing; Task (project management); Computer network","score_opus":0.015206644522195873,"score_gpt":0.2740966418056096,"score_spread":0.2588899972834137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974488648","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.34624237,0.0002455984,0.6487606,0.00031183148,0.00013644362,0.00006265417,0.00004847684,0.0006347487,0.0035572203],"genre_scores_gemma":[0.976096,0.00006801287,0.021975832,0.00003692492,0.000015379408,0.000032612897,0.000016173342,0.00002602665,0.0017330059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995054,0.00014803925,0.000028387207,0.00010062028,0.00012696037,0.00009057212],"domain_scores_gemma":[0.99806803,0.0010931675,0.0001657613,0.00030734795,0.00023724792,0.00012849981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006493707,0.00035947884,0.00083487114,0.00042488764,0.0009626371,0.00088758505,0.0009317993,0.00096701545,0.0014032766],"category_scores_gemma":[0.0032055,0.00028891533,0.00028649168,0.00055744586,0.0009301995,0.0014000022,0.0012697642,0.00087379635,0.00018012228],"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.0013116206,0.00013843113,0.0017252365,0.00012194121,0.00009344503,0.00076635473,0.0004569367,0.80817366,0.05102879,0.08824274,0.0013751717,0.046565715],"study_design_scores_gemma":[0.00003451403,0.00006339982,0.00014260145,0.000003222719,0.000008554846,0.000028991251,0.000022962528,0.98738074,0.002641162,0.0094252825,0.00023782633,0.000010826681],"about_ca_topic_score_codex":0.00203621,"about_ca_topic_score_gemma":0.0019571371,"teacher_disagreement_score":0.00203621,"about_ca_system_score_codex":0.0004848389,"about_ca_system_score_gemma":0.00061056495,"threshold_uncertainty_score":0.004694402},"labels":[],"label_agreement":null},{"id":"W2975694009","doi":"10.1016/j.tcs.2019.09.026","title":"Priority evacuation from a disk: The case of n = 1,2,3","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Robot; Servant; Queen (butterfly); Computer science; Position (finance); Simulation; Mathematics; Artificial intelligence; Business; Programming language","score_opus":0.010608038022033667,"score_gpt":0.2689961043936256,"score_spread":0.25838806637159195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975694009","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.88528496,0.0011384629,0.04899035,0.005767156,0.00063658674,0.00015319108,0.00077027513,0.00032926467,0.056929786],"genre_scores_gemma":[0.9874391,0.00016084553,0.006719235,0.00013011615,0.000055111566,0.00001885894,0.00008856175,0.00004089494,0.005347465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999171,0.00017828561,0.000025951254,0.00009863893,0.00009637942,0.00042972306],"domain_scores_gemma":[0.9941555,0.0033911252,0.0004203908,0.00041451058,0.00068756595,0.0009308446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016761484,0.0003803763,0.0009470495,0.00070662104,0.0024553475,0.0020852864,0.0017541784,0.0022519105,0.007708245],"category_scores_gemma":[0.01197753,0.00030879257,0.00050345314,0.000856659,0.0012429056,0.002121316,0.0013776158,0.0009661125,0.00057554076],"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.008374516,0.0009537897,0.01807249,0.0011005565,0.0001460004,0.014658483,0.0016899451,0.6033843,0.0073336605,0.24560769,0.056115195,0.04256345],"study_design_scores_gemma":[0.00034340797,0.00030838218,0.00227042,0.00004814643,0.00007088834,0.0015742595,0.0020106062,0.8800585,0.0024095154,0.10547747,0.0053545497,0.000073875904],"about_ca_topic_score_codex":0.009414132,"about_ca_topic_score_gemma":0.008676839,"teacher_disagreement_score":0.009414132,"about_ca_system_score_codex":0.0011377914,"about_ca_system_score_gemma":0.001467277,"threshold_uncertainty_score":0.025786698},"labels":[],"label_agreement":null},{"id":"W2984492834","doi":"10.1016/j.tcs.2019.11.011","title":"Finitely distinguishable erasing pattern languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Ministry of Education - Singapore","keywords":"Decidability; Alphabet; Mathematical proof; Equivalence (formal languages); Mathematics; Regular language; Discrete mathematics; Decision problem; Object (grammar); Dimension (graph theory); Theoretical computer science; Combinatorics; Computer science; Artificial intelligence; Algorithm; Linguistics; Automaton","score_opus":0.0051199541038309685,"score_gpt":0.2525612319938292,"score_spread":0.2474412778899982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984492834","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.27044997,0.0006955303,0.64243746,0.0038355999,0.00058210525,0.000116146024,0.0011887127,0.0029428273,0.07775154],"genre_scores_gemma":[0.8767048,0.00032382054,0.08565909,0.0012291104,0.00029919983,0.00016848267,0.0014221225,0.0008475247,0.03334595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953126,0.0010160903,0.0004445303,0.0012066659,0.0011609629,0.00085910066],"domain_scores_gemma":[0.9812165,0.011511439,0.0011078326,0.0037631,0.0013787489,0.0010224431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023389738,0.0008311416,0.0011484846,0.0015642444,0.0020641014,0.005082207,0.0027686805,0.002736108,0.015167025],"category_scores_gemma":[0.014083722,0.0011643448,0.0016216045,0.0014668237,0.0038733776,0.012754563,0.0069625564,0.0077821272,0.0030519613],"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.00016228486,0.000055365294,0.0004356807,0.000080051184,0.000015208694,0.0002326085,0.00044917004,0.0009905816,0.0028510988,0.97931427,0.0014432091,0.013970606],"study_design_scores_gemma":[0.000026275246,0.000030180128,0.00012788367,0.00002106135,0.000014237795,0.0003438694,0.00009377564,0.0055185794,0.0028394037,0.9878421,0.003120535,0.000022170965],"about_ca_topic_score_codex":0.00024650863,"about_ca_topic_score_gemma":0.00032709152,"teacher_disagreement_score":0.015167025,"about_ca_system_score_codex":0.0011044844,"about_ca_system_score_gemma":0.0011500792,"threshold_uncertainty_score":0.050738752},"labels":[],"label_agreement":null},{"id":"W2985287154","doi":"10.1016/j.tcs.2019.10.048","title":"Palindromization and construction of Markoff triples","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Diophantine equation; Mathematics; Set (abstract data type); Monoid; Palindrome; Free monoid; Resolution (logic); Combinatorics; Pure mathematics; Algebra over a field; Computer science","score_opus":0.003379876228543957,"score_gpt":0.19893721235105163,"score_spread":0.19555733612250767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985287154","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.33794668,0.00043167773,0.5136884,0.0009669976,0.0004501041,0.00015691422,0.0003730914,0.0011974958,0.1447887],"genre_scores_gemma":[0.8942136,0.00021285328,0.080077894,0.00021154358,0.00011095031,0.0001297508,0.00041961911,0.00034472664,0.024279129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942505,0.00011775754,0.00004807707,0.00014416472,0.00013373054,0.00013124495],"domain_scores_gemma":[0.999326,0.00024284462,0.00006361582,0.00015819284,0.00010717081,0.00010214837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006158143,0.0004244897,0.000549597,0.0013834613,0.0025724876,0.0018230017,0.00090854464,0.0009335655,0.009732243],"category_scores_gemma":[0.0014907009,0.00048394012,0.0008781943,0.0009547653,0.0016555925,0.0032332204,0.0023489795,0.0016078377,0.0018707803],"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.00004274323,0.00002319722,0.00012147927,0.00002749085,0.0000038139524,0.00014063876,0.00040946522,0.00027793652,0.003977606,0.9869126,0.00061804446,0.0074450714],"study_design_scores_gemma":[0.000014926541,0.000035229496,0.00019329453,0.000018511177,0.000012498083,0.00026387797,0.0002854366,0.0027027095,0.007537144,0.97928154,0.009630983,0.000023902801],"about_ca_topic_score_codex":0.00035337644,"about_ca_topic_score_gemma":0.00042823254,"teacher_disagreement_score":0.009732243,"about_ca_system_score_codex":0.0005608786,"about_ca_system_score_gemma":0.0004255583,"threshold_uncertainty_score":0.032557607},"labels":[],"label_agreement":null},{"id":"W2985478892","doi":"10.1016/j.tcs.2019.11.015","title":"A modular analysis of adaptive (non-)convex optimization: Optimism, composite objectives, variance reduction, and variational bounds","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta; Engineering and Physical Sciences Research Council; Alberta Machine Intelligence Institute","keywords":"Mathematical proof; Mathematical optimization; Regret; Computer science; Generalization; Convex optimization; Modular design; Mathematics; Convex analysis; Regular polygon; Algorithm; Machine learning","score_opus":0.021383389473001273,"score_gpt":0.33536394111611845,"score_spread":0.31398055164311717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985478892","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.0072171576,0.0003797577,0.9887876,0.00034703233,0.00003713594,0.000012326394,0.000022486267,0.000026013204,0.003170523],"genre_scores_gemma":[0.6341818,0.0018411007,0.3494898,0.00038283053,0.00069874345,0.0002142201,0.00013471619,0.00029500696,0.012761718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863404,0.00071074395,0.00004212888,0.00019975104,0.0003136525,0.00009961218],"domain_scores_gemma":[0.9971208,0.0017860092,0.0002745553,0.00031302942,0.0003608096,0.00014484987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040598945,0.0013318413,0.0010238517,0.0013027287,0.00040474068,0.0014401452,0.0016837472,0.0010087067,0.0032283864],"category_scores_gemma":[0.009301642,0.00069966953,0.0018654836,0.0009785425,0.0023990248,0.003227716,0.0032628465,0.0028518846,0.00037568618],"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.00003757511,0.000038082373,0.00038098812,0.00011795508,0.00009419565,0.000044742526,0.00009121366,0.15486372,0.0028669727,0.81744236,0.0013367113,0.022685567],"study_design_scores_gemma":[0.00000650022,0.000031216267,0.00025489263,0.000019527337,0.000022855977,0.000020761207,0.000011447541,0.6532216,0.00042518685,0.34517527,0.0007995201,0.000011139019],"about_ca_topic_score_codex":0.00085157854,"about_ca_topic_score_gemma":0.0008564428,"teacher_disagreement_score":0.0040598945,"about_ca_system_score_codex":0.0010226488,"about_ca_system_score_gemma":0.0008557983,"threshold_uncertainty_score":0.021471024},"labels":[],"label_agreement":null},{"id":"W2991381026","doi":"10.1016/j.tcs.2019.11.022","title":"Unique decipherability in formal languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chomsky hierarchy; Undecidable problem; Unique factorization domain; Combinatorics; Mathematics; Context (archaeology); Multiset; Factorization; Regular language; Word (group theory); Hierarchy; Context-free language; Formal language; Discrete mathematics; Philosophy of language; Computer science; Decidability; Artificial intelligence; Rule-based machine translation; Automaton; Philosophy; Algorithm","score_opus":0.004845414963894193,"score_gpt":0.2447670603921896,"score_spread":0.23992164542829542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991381026","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.47493434,0.0017411748,0.4784334,0.0026584268,0.000396272,0.000093738025,0.0003387177,0.0012552288,0.04014882],"genre_scores_gemma":[0.9740355,0.00035657524,0.019229116,0.00024006247,0.00016523706,0.000069002286,0.000116485746,0.0001854438,0.0056025037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959894,0.0010405175,0.00038852345,0.0012015568,0.00075575465,0.00062433095],"domain_scores_gemma":[0.9734361,0.018236458,0.0019642196,0.0037556726,0.0016418807,0.00096557324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002714149,0.00060901034,0.0015918162,0.0023423366,0.002720081,0.0052677216,0.0014924593,0.0019754076,0.0051360237],"category_scores_gemma":[0.01755955,0.0010889854,0.0013222522,0.0018102481,0.0072235186,0.013822989,0.005029008,0.004597838,0.00067529525],"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.00005894945,0.000017134455,0.00034369715,0.000064198124,0.000008611514,0.00017585483,0.00084300584,0.0014400133,0.00088808325,0.98726386,0.00044967042,0.008446898],"study_design_scores_gemma":[0.000009665426,0.000012321168,0.00006838885,0.000013471508,0.000010036411,0.00018468866,0.00011449548,0.0029673213,0.0011363124,0.9945977,0.00087085593,0.000014770506],"about_ca_topic_score_codex":0.00040484063,"about_ca_topic_score_gemma":0.00027183953,"teacher_disagreement_score":0.0052677216,"about_ca_system_score_codex":0.0013793634,"about_ca_system_score_gemma":0.0010603853,"threshold_uncertainty_score":0.017181695},"labels":[],"label_agreement":null},{"id":"W2991631715","doi":"10.1016/j.tcs.2022.01.005","title":"The weighted k-center problem in trees for fixed k","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Center (category theory); Combinatorics; Mathematics; Computer science; Discrete mathematics; Crystallography; Chemistry","score_opus":0.014145522927294412,"score_gpt":0.28492772715649867,"score_spread":0.27078220422920424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991631715","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.5265925,0.0029301876,0.41218475,0.011262809,0.0004675082,0.00037489302,0.0042308713,0.0015420754,0.04041441],"genre_scores_gemma":[0.79061484,0.0019122605,0.17813194,0.0011913524,0.0006120334,0.00042537376,0.0031935314,0.0012291437,0.022689441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978574,0.00046188966,0.00011090162,0.0006928593,0.00025320548,0.00062378263],"domain_scores_gemma":[0.9842568,0.0100993775,0.0012833962,0.0016138643,0.0011686804,0.0015779781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002231939,0.0011367016,0.0035839123,0.0017649948,0.0038728644,0.0063419286,0.0061284797,0.0052453936,0.016486954],"category_scores_gemma":[0.019001959,0.0012637773,0.0014802339,0.0038619745,0.0032718596,0.014329034,0.004162819,0.0051912027,0.002099581],"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.0024059042,0.00066710514,0.0023022231,0.0015404484,0.00020931104,0.00038718188,0.001192668,0.113721,0.008631308,0.7492141,0.045265127,0.074463665],"study_design_scores_gemma":[0.00021235751,0.00007135575,0.00058448606,0.00009168222,0.00006717101,0.00027183382,0.00049117755,0.12814245,0.0030934121,0.8621147,0.004813153,0.00004624726],"about_ca_topic_score_codex":0.005150758,"about_ca_topic_score_gemma":0.0054238816,"teacher_disagreement_score":0.016486954,"about_ca_system_score_codex":0.0033630705,"about_ca_system_score_gemma":0.0024510534,"threshold_uncertainty_score":0.055154324},"labels":[],"label_agreement":null},{"id":"W2999574320","doi":"10.1016/j.tcs.2018.05.036","title":"On store languages of language acceptors","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pushdown automaton; Computer science; Nondeterministic algorithm; Regular language; Programming language; Nondeterministic finite automaton; Set (abstract data type); Finite-state machine; Theoretical computer science; Automaton; Automata theory","score_opus":0.005652122416816928,"score_gpt":0.2664795864860257,"score_spread":0.26082746406920876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999574320","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.21717438,0.0016203948,0.6883136,0.00652625,0.0008741674,0.00023027278,0.0013374359,0.0019142708,0.08200912],"genre_scores_gemma":[0.85035706,0.0013380819,0.07016833,0.0015763586,0.0009288221,0.00042461295,0.0015544329,0.0017628201,0.07188955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973701,0.0007408718,0.00022886878,0.0005125933,0.00060670363,0.00054075394],"domain_scores_gemma":[0.9863332,0.009063608,0.00057804555,0.0017303099,0.0015233903,0.00077143667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035773355,0.0011977684,0.0018572755,0.002610222,0.003711029,0.00837465,0.0027868159,0.0030200148,0.018646343],"category_scores_gemma":[0.014657131,0.0016184573,0.0026082278,0.0028645888,0.006767184,0.021204853,0.006835389,0.005665912,0.0026447137],"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.00006563926,0.000023840894,0.00017211227,0.000037607242,0.00000604132,0.000072248506,0.00058404537,0.0010472636,0.0004743492,0.993386,0.0010044081,0.003126513],"study_design_scores_gemma":[0.0000178892,0.000015567939,0.00005095202,0.000018240138,0.000012117872,0.000051750896,0.0001541176,0.0052085505,0.00034038693,0.99202526,0.0020918068,0.000013286521],"about_ca_topic_score_codex":0.0027247379,"about_ca_topic_score_gemma":0.0027282736,"teacher_disagreement_score":0.018646343,"about_ca_system_score_codex":0.0023498745,"about_ca_system_score_gemma":0.001983201,"threshold_uncertainty_score":0.062378168},"labels":[],"label_agreement":null},{"id":"W2999689452","doi":"10.1016/j.tcs.2019.12.007","title":"Corrigendum to “The orthogonal colouring game” [Theor. Comput. Sci. 795 (2019) 312–325]","year":2020,"lang":"en","type":"erratum","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Involution (esoterism); Upper and lower bounds; Isomorphism (crystallography); Discrete mathematics; Mathematical analysis","score_opus":0.02459413783598354,"score_gpt":0.28905575378499726,"score_spread":0.26446161594901374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999689452","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.0001926837,0.0039804,0.00216482,0.09155408,0.8578958,0.00006275295,0.0021341557,0.00065784133,0.041357394],"genre_scores_gemma":[0.009714102,0.010989617,0.004779069,0.076643504,0.20018475,0.000306422,0.0041312645,0.0015027229,0.6917485],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967008,0.00064127083,0.00031883075,0.00069527427,0.0013235941,0.00032018148],"domain_scores_gemma":[0.98897153,0.0030186642,0.0004392736,0.000857459,0.006086592,0.000626491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022789033,0.001930236,0.0019096715,0.002893132,0.0040251613,0.0040539047,0.003454899,0.0052339635,0.22490147],"category_scores_gemma":[0.025119096,0.00085563934,0.0018398287,0.0023974755,0.0022440858,0.0040689646,0.0026449854,0.0055608572,0.11511709],"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.000011699735,0.0000034482885,0.000016538197,0.00005022412,0.0000038949293,0.000034091045,0.000007984531,0.000025385829,0.000018873261,0.0022909571,0.99474806,0.0027888855],"study_design_scores_gemma":[0.000017450237,0.000013984186,0.00031152213,0.00014294374,0.000014621351,0.00011440189,0.000031582025,0.00022217692,0.00014879483,0.007460243,0.9914881,0.000034241908],"about_ca_topic_score_codex":0.017562957,"about_ca_topic_score_gemma":0.025089445,"teacher_disagreement_score":0.22490147,"about_ca_system_score_codex":0.005664419,"about_ca_system_score_gemma":0.0028642444,"threshold_uncertainty_score":0.75237036},"labels":[],"label_agreement":null},{"id":"W3003022945","doi":"10.1016/j.tcs.2020.01.024","title":"Theory versus practice in annealing-based quantum computing","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Quantum annealing; Computer science; Quantum computer; Theoretical computer science; Quantum information science; Quantum; Adiabatic quantum computation; Computation; Abstraction; Algorithm; Quantum entanglement","score_opus":0.014502515370097254,"score_gpt":0.27484250850672864,"score_spread":0.26033999313663136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003022945","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.043784812,0.016505476,0.78038985,0.041315768,0.0013419462,0.0001833992,0.00014026585,0.0004492002,0.11588925],"genre_scores_gemma":[0.8792371,0.0052029416,0.106227174,0.0017649726,0.00094892585,0.00042033466,0.000073464194,0.00022652076,0.0058986186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923401,0.0046769306,0.00031079978,0.0006548207,0.0016560038,0.00036142566],"domain_scores_gemma":[0.9784038,0.016051749,0.0005849766,0.003515994,0.0010593428,0.0003841133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009648936,0.00066187244,0.001816485,0.0016076517,0.002134572,0.0063669514,0.0035879486,0.0054291957,0.008115492],"category_scores_gemma":[0.033248764,0.00085994106,0.0009130503,0.0017059466,0.01727088,0.012113903,0.0031060777,0.005904527,0.000785749],"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.000011531642,0.000015138959,0.00008212887,0.000057720546,0.000006713876,0.0000079823585,0.00009428279,0.004233688,0.00007117931,0.99169284,0.00033268207,0.0033939637],"study_design_scores_gemma":[0.000011696929,0.000017150793,0.000052112755,0.00004746138,0.0000043409714,0.000013845282,0.00005583465,0.020670861,0.00013850586,0.977079,0.0019019009,0.0000074011054],"about_ca_topic_score_codex":0.0029207505,"about_ca_topic_score_gemma":0.0024688365,"teacher_disagreement_score":0.009648936,"about_ca_system_score_codex":0.0033593504,"about_ca_system_score_gemma":0.0037579192,"threshold_uncertainty_score":0.051029027},"labels":[],"label_agreement":null},{"id":"W3004640575","doi":"10.1016/j.tcs.2020.01.035","title":"A computational complexity analysis of tunable type inference for Generic Universe Types","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Type inference; Inference; Theoretical computer science; Reduction (mathematics); Time complexity; Type (biology); Boolean satisfiability problem; Programmer; Computational complexity theory; Mathematics; Algorithm; Programming language; Artificial intelligence","score_opus":0.053689186814185594,"score_gpt":0.2856643271098364,"score_spread":0.2319751402956508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004640575","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.08121905,0.00063189404,0.8853041,0.0053486237,0.0002453483,0.00020618098,0.00054478075,0.00106148,0.025438512],"genre_scores_gemma":[0.6978751,0.0006775376,0.28506935,0.0018004732,0.00092464045,0.00029125554,0.0008803799,0.00081139366,0.011669893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9882377,0.0036124843,0.00063847494,0.0025414543,0.003323983,0.0016459962],"domain_scores_gemma":[0.9170698,0.06469715,0.002983881,0.010959486,0.0027216468,0.0015681284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010609019,0.0011822404,0.0023560028,0.0036238644,0.0032552348,0.011276505,0.009216047,0.0038527036,0.016470099],"category_scores_gemma":[0.059599083,0.0019695687,0.007396797,0.004118252,0.007984164,0.03310148,0.009622372,0.013083069,0.0013016589],"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.00025665417,0.00016374254,0.0019280841,0.00019104377,0.00008870458,0.00013618327,0.00034513054,0.020322174,0.0016030137,0.9484451,0.003997177,0.022523042],"study_design_scores_gemma":[0.000034884983,0.000028581931,0.0005239949,0.000035331286,0.00009508531,0.000104011735,0.00009539512,0.123780414,0.0012648749,0.8723956,0.0015987413,0.00004311765],"about_ca_topic_score_codex":0.0038607332,"about_ca_topic_score_gemma":0.0040504215,"teacher_disagreement_score":0.016470099,"about_ca_system_score_codex":0.0067613204,"about_ca_system_score_gemma":0.0037649646,"threshold_uncertainty_score":0.056106508},"labels":[],"label_agreement":null},{"id":"W3009875838","doi":"10.1016/j.tcs.2021.05.014","title":"The game of Cops and Eternal Robbers","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Geology","score_opus":0.014841140689940763,"score_gpt":0.295436918663482,"score_spread":0.28059577797354124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009875838","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.43914977,0.00080040644,0.2743174,0.008528524,0.00041815074,0.00029331574,0.0008933735,0.00034142955,0.27525762],"genre_scores_gemma":[0.93722147,0.00027306224,0.021074835,0.00029723794,0.00010139308,0.0001218949,0.00023840842,0.00007611711,0.04059562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746275,0.0012909651,0.00010154231,0.0003180103,0.00035562858,0.0004710882],"domain_scores_gemma":[0.9956436,0.0027473364,0.00023543033,0.00047803964,0.00022084637,0.00067470095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017985795,0.00087703567,0.0011827191,0.0006859652,0.0024349634,0.004734077,0.0022610454,0.0032587857,0.019083077],"category_scores_gemma":[0.010180434,0.0007531515,0.0009127824,0.0008364716,0.0034326643,0.008119038,0.0030209667,0.0028389222,0.0012604557],"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.00031858662,0.000052023464,0.00032248718,0.00006507462,0.000027647957,0.00014565706,0.00032830244,0.016599173,0.00057270227,0.9710769,0.00466978,0.0058217505],"study_design_scores_gemma":[0.00006383541,0.000035582623,0.00022614811,0.00002443094,0.000015906888,0.00010274358,0.0002780741,0.07955038,0.0003652093,0.912121,0.0071961735,0.000020586436],"about_ca_topic_score_codex":0.0049764393,"about_ca_topic_score_gemma":0.0038355778,"teacher_disagreement_score":0.019083077,"about_ca_system_score_codex":0.0016170655,"about_ca_system_score_gemma":0.0012180065,"threshold_uncertainty_score":0.06383926},"labels":[],"label_agreement":null},{"id":"W3017628072","doi":"10.1016/j.tcs.2021.06.043","title":"General Cops and Robbers games with randomness","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Guidance and Control Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Randomness; Probabilistic logic; Computer science; Theoretical computer science; Adversary; Mathematical economics; Pursuit-evasion; Operations research; Mathematics; Computer security; Artificial intelligence; Statistics","score_opus":0.004000665585847534,"score_gpt":0.19184694153111784,"score_spread":0.1878462759452703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017628072","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.25489634,0.0031552475,0.5471035,0.009604415,0.0007349094,0.00026322043,0.0013933845,0.00027000788,0.18257892],"genre_scores_gemma":[0.8659143,0.0017367619,0.03446488,0.0010426791,0.0010503748,0.00046915718,0.00085222843,0.00025868163,0.094210915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972018,0.0013120605,0.00009528804,0.00037993857,0.000591717,0.00041911908],"domain_scores_gemma":[0.99520195,0.0031677526,0.0004480687,0.00043331747,0.0002754662,0.00047345215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023457813,0.0020139778,0.0025402228,0.0018716315,0.0021300935,0.004480757,0.0028284113,0.0038918215,0.013068374],"category_scores_gemma":[0.010737077,0.0012862417,0.0020707499,0.0016842932,0.0041109617,0.008087297,0.0036170941,0.004878896,0.00088923227],"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.000035886274,0.000020629855,0.00007540858,0.000038660295,0.000020008687,0.000047488305,0.000066254455,0.019511396,0.00014002586,0.9770676,0.0017850829,0.0011915049],"study_design_scores_gemma":[0.000027080694,0.000008945438,0.00008442923,0.000010525284,0.000006358261,0.000029250821,0.000023839128,0.04946453,0.000049794107,0.94908434,0.0011983586,0.0000125923],"about_ca_topic_score_codex":0.0033590135,"about_ca_topic_score_gemma":0.002719918,"teacher_disagreement_score":0.013068374,"about_ca_system_score_codex":0.002533144,"about_ca_system_score_gemma":0.0016972455,"threshold_uncertainty_score":0.0437181},"labels":[],"label_agreement":null},{"id":"W3017834538","doi":"10.1016/j.tcs.2020.04.009","title":"A linear-space data structure for range-LCP queries in poly-logarithmic time","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Ministry of Science and Technology, Taiwan; National Science Foundation","keywords":"Linear space; Data structure; Combinatorics; Mathematics; Binary logarithm; Space (punctuation); Logarithm; Log-log plot; Range query (database); Range (aeronautics); Suffix; Time complexity; Inverse; Discrete mathematics; Computer science; Search engine","score_opus":0.020610470389528217,"score_gpt":0.2714613027795172,"score_spread":0.25085083238998895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017834538","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.047779057,0.0019192778,0.8850842,0.0033162304,0.0005904362,0.0010744858,0.0073283142,0.035536155,0.017371818],"genre_scores_gemma":[0.28128988,0.00056892796,0.6838547,0.001689672,0.0004832734,0.0015332648,0.011912256,0.0030819478,0.015586011],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949114,0.0006741263,0.0005924583,0.00092057645,0.0022234854,0.0006780839],"domain_scores_gemma":[0.9875886,0.003313798,0.00057769276,0.0068433303,0.0011994926,0.00047704694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020197125,0.0015664286,0.0025091842,0.0035291002,0.0018613666,0.0044672815,0.003395681,0.0022217194,0.02835851],"category_scores_gemma":[0.010530001,0.0011148885,0.0016594051,0.010438956,0.002053944,0.011160557,0.007491876,0.0036154499,0.009491463],"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.003079851,0.0010591956,0.0025057665,0.0010419989,0.00018317577,0.00024274518,0.0006569671,0.02518052,0.04321457,0.106790505,0.13210768,0.683937],"study_design_scores_gemma":[0.0021968524,0.0012678577,0.0020383287,0.00030129385,0.00037136232,0.0011654984,0.00094005524,0.39969027,0.07098174,0.4280676,0.09264484,0.00033416634],"about_ca_topic_score_codex":0.0037473978,"about_ca_topic_score_gemma":0.004466397,"teacher_disagreement_score":0.02835851,"about_ca_system_score_codex":0.0037836956,"about_ca_system_score_gemma":0.004702066,"threshold_uncertainty_score":0.09486872},"labels":[],"label_agreement":null},{"id":"W3020479143","doi":"10.1016/j.tcs.2020.04.007","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:mi mathvariant=\"sans-serif\">NP</mml:mi></mml:math>-completeness of the game Kingdomino<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.svg\"><mml:msup><mml:mrow/><mml:mrow><mml:mtext mathvariant=\"italic\">TM</mml:mtext></mml:mrow></mml:msup></mml:math>","year":2020,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Compute Canada","funders":"Campus France; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Mathematics; Scalable Vector Graphics; Domino; Completeness (order theory); Combinatorics; Algebra over a field; Computer science; Artificial intelligence; Discrete mathematics; Pure mathematics; World Wide Web","score_opus":0.027275776130689044,"score_gpt":0.25469439900238244,"score_spread":0.2274186228716934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020479143","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.0013448123,0.00029282083,0.17186289,0.006921544,0.0011169203,0.00053063396,0.11541119,0.060796626,0.6417226],"genre_scores_gemma":[0.027230188,0.0014299804,0.11347071,0.0031172773,0.0007309917,0.0010655497,0.22471185,0.057758264,0.5704851],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885654,0.0002504466,0.0001480281,0.0001966723,0.00043171152,0.00011655228],"domain_scores_gemma":[0.99709666,0.00082754524,0.00017723504,0.00077608455,0.000866873,0.0002556077],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015133707,0.0017198274,0.0010597631,0.0017266481,0.001144891,0.006942414,0.0032026889,0.0027180356,0.48641184],"category_scores_gemma":[0.005507054,0.00122183,0.0011297895,0.0030483569,0.0008916814,0.006310369,0.0025874095,0.0032849,0.44905433],"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.00008957056,0.00005400949,0.00011601875,0.00024390123,0.000009733476,0.000061231,0.00014830565,0.0005365482,0.0015636879,0.056978013,0.902669,0.037529998],"study_design_scores_gemma":[0.00003701106,0.000013190987,0.00025038794,0.000040699513,0.000005203569,0.00007190913,0.000051726376,0.0017332886,0.002198235,0.017167317,0.9784037,0.000027432401],"about_ca_topic_score_codex":0.015061717,"about_ca_topic_score_gemma":0.019123478,"teacher_disagreement_score":0.48641184,"about_ca_system_score_codex":0.0028086316,"about_ca_system_score_gemma":0.0019717284,"threshold_uncertainty_score":0.7325711},"labels":[],"label_agreement":null},{"id":"W3021772469","doi":"10.1016/j.tcs.2020.03.013","title":"Makespan minimization on unrelated parallel machines with a few bags","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Minification; Combinatorics; Approximation algorithm; Time complexity; Mathematics; Schedule; Polynomial-time approximation scheme; Scheduling (production processes); Computer science; Polynomial; Algorithm; Discrete mathematics; Mathematical optimization","score_opus":0.008816355427615812,"score_gpt":0.2082529349930051,"score_spread":0.1994365795653893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021772469","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.33452922,0.00074777304,0.6514035,0.0007875538,0.00019355945,0.00026432204,0.00040394842,0.0007826463,0.010887491],"genre_scores_gemma":[0.786886,0.000325121,0.2048931,0.00019057725,0.0001651832,0.00023379002,0.0004037704,0.00040620746,0.006496296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904054,0.00031250768,0.00004217056,0.00023653565,0.00012761675,0.00024060818],"domain_scores_gemma":[0.9979954,0.0011565067,0.00019775631,0.00022022214,0.00016347815,0.00026676274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013775247,0.0011361511,0.0018732874,0.00073758315,0.0011593798,0.0012951498,0.0020809735,0.001002417,0.0025302519],"category_scores_gemma":[0.003728444,0.0011164338,0.00092845166,0.0018642313,0.000762643,0.0018043993,0.0011939865,0.0011457573,0.00038514368],"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.0010404583,0.00028655914,0.0007501491,0.00035180716,0.000118288095,0.00024512317,0.00011870542,0.93506694,0.008549754,0.013212864,0.0029191605,0.037340246],"study_design_scores_gemma":[0.000030854433,0.00017021286,0.00052977225,0.000011206687,0.00002657648,0.000051141542,0.000031899013,0.98048097,0.0015958302,0.016571142,0.00049063395,0.000009659349],"about_ca_topic_score_codex":0.0028783083,"about_ca_topic_score_gemma":0.0027742565,"teacher_disagreement_score":0.0028783083,"about_ca_system_score_codex":0.0010439885,"about_ca_system_score_gemma":0.0011196502,"threshold_uncertainty_score":0.008464515},"labels":[],"label_agreement":null},{"id":"W3022258227","doi":"10.1016/j.tcs.2018.03.016","title":"Swapping colored tokens on graphs","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Saskatchewan","funders":"Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Colored; Security token; Combinatorics; Vertex (graph theory); Parameterized complexity; Bipartite graph; Mathematics; Time complexity; Discrete mathematics; Computer science; Graph","score_opus":0.008224338296942463,"score_gpt":0.2485510264796883,"score_spread":0.24032668818274583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022258227","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.15498659,0.00023669504,0.82769305,0.00094570353,0.0002871531,0.00019515546,0.00048909785,0.0022486122,0.01291788],"genre_scores_gemma":[0.5486965,0.0003287121,0.4261919,0.00036933503,0.000102894504,0.00030038354,0.0009927232,0.0010231538,0.021994459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984328,0.0005344411,0.00007939138,0.0004136289,0.00025810607,0.00028158337],"domain_scores_gemma":[0.9921496,0.004916604,0.0003896376,0.0017086911,0.00036388007,0.00047158427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015763695,0.0009055992,0.0014798886,0.0017701287,0.0019918953,0.0024405096,0.0040317425,0.0020710651,0.01443223],"category_scores_gemma":[0.011120592,0.0010253296,0.0013682494,0.0037654154,0.0026220633,0.006448298,0.0045469813,0.0023880305,0.0018707196],"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.0007541329,0.00030226467,0.001230537,0.00029661204,0.00009561782,0.0004846403,0.0005472807,0.2192561,0.0077823717,0.6145309,0.009895526,0.14482394],"study_design_scores_gemma":[0.00007110083,0.000049847382,0.00014637358,0.000028002278,0.000042798172,0.00011808224,0.000126987,0.33367223,0.00526701,0.6556823,0.004770108,0.000025083466],"about_ca_topic_score_codex":0.0021246579,"about_ca_topic_score_gemma":0.0027058187,"teacher_disagreement_score":0.01443223,"about_ca_system_score_codex":0.0015476326,"about_ca_system_score_gemma":0.0014037638,"threshold_uncertainty_score":0.048280597},"labels":[],"label_agreement":null},{"id":"W3023452807","doi":"10.1016/j.tcs.2010.01.007","title":"Remembering without memory: Tree exploration by asynchronous oblivious robots","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Robot; Computer science; Asynchronous communication; Task (project management); Theoretical computer science; Node (physics); Tree (set theory); Swarm robotics; Graph; Mobile robot; Constructive; Self-reconfiguring modular robot; Computation; Distributed computing; Algorithm; Artificial intelligence; Mathematics; Robot control; Combinatorics","score_opus":0.013010429633134717,"score_gpt":0.25849732909190537,"score_spread":0.24548689945877064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023452807","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.44692576,0.0010743415,0.537434,0.0009363476,0.00012230265,0.00007304041,0.00011850508,0.0010552024,0.012260476],"genre_scores_gemma":[0.9624926,0.00019724932,0.034217514,0.00006570617,0.000025320658,0.00004585792,0.000050990362,0.00008103383,0.0028237607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963903,0.00012912955,0.000019482393,0.00007169514,0.00005866987,0.00008208584],"domain_scores_gemma":[0.99665904,0.0021291426,0.00020895757,0.0005956344,0.00017579235,0.00023141276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076142413,0.00039844547,0.0009033448,0.00037274213,0.00083512766,0.0011526698,0.0016785869,0.0010270845,0.0032988458],"category_scores_gemma":[0.006282762,0.00037205112,0.0004161393,0.0005574174,0.0010874217,0.003714463,0.0016714671,0.0011159749,0.0003135689],"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.0024613913,0.000266484,0.00243703,0.0004196312,0.00014660157,0.0004795704,0.0013101001,0.6440491,0.012436334,0.18594751,0.0056365994,0.14440973],"study_design_scores_gemma":[0.00007943734,0.0000994724,0.00016938958,0.000012399112,0.000030680752,0.00006259315,0.00009088526,0.83950436,0.0017748219,0.15721622,0.0009449671,0.00001477726],"about_ca_topic_score_codex":0.0012230602,"about_ca_topic_score_gemma":0.0012626859,"teacher_disagreement_score":0.0032988458,"about_ca_system_score_codex":0.00038918384,"about_ca_system_score_gemma":0.0006465344,"threshold_uncertainty_score":0.01103574},"labels":[],"label_agreement":null},{"id":"W3023624987","doi":"10.1016/j.tcs.2019.10.008","title":"Ranked document selection","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Selection (genetic algorithm); Computer science; Information retrieval; Mathematics; Natural language processing; Artificial intelligence","score_opus":0.004385236818466683,"score_gpt":0.23341579447857627,"score_spread":0.2290305576601096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023624987","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.11804845,0.012164762,0.7259176,0.0037569166,0.0031397757,0.0028729285,0.037135698,0.02572496,0.071238905],"genre_scores_gemma":[0.3565705,0.0032464305,0.46783057,0.0010149454,0.001963038,0.0010563681,0.054505467,0.0013751542,0.112437576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964173,0.0007505154,0.0003471356,0.0005536171,0.0015995053,0.00033202977],"domain_scores_gemma":[0.99567974,0.0012826711,0.0001332341,0.0007698775,0.0019193031,0.00021527629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019260756,0.0014133117,0.0018352423,0.007889655,0.001654636,0.0032682444,0.0015743647,0.0014702708,0.024577932],"category_scores_gemma":[0.0083856415,0.00043719375,0.0016711402,0.0061115907,0.00041706662,0.0017735427,0.0010375308,0.0011126397,0.020870099],"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.0010323228,0.00042959524,0.003760876,0.0005218659,0.00023929794,0.00032040972,0.00005429313,0.0050730277,0.019512491,0.00447071,0.08393536,0.88064975],"study_design_scores_gemma":[0.0008948585,0.002378646,0.020148274,0.0004193842,0.0013021866,0.0059143296,0.0007043546,0.5203539,0.15577151,0.051325403,0.24040361,0.00038348016],"about_ca_topic_score_codex":0.0029425665,"about_ca_topic_score_gemma":0.0070062927,"teacher_disagreement_score":0.024577932,"about_ca_system_score_codex":0.0007711392,"about_ca_system_score_gemma":0.003451458,"threshold_uncertainty_score":0.08222145},"labels":[],"label_agreement":null},{"id":"W3026005886","doi":"10.1016/j.tcs.2019.06.024","title":"State grammars with stores","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Embedded pushdown automaton; Rule-based machine translation; Tree-adjoining grammar; L-attributed grammar; Bounded function; State (computer science); Phrase structure grammar; Indexed grammar; Context-sensitive grammar; Terminal and nonterminal symbols; Context-free grammar; Mathematics; Definite clause grammar; Production (economics); Computer science; Algorithm; Artificial intelligence","score_opus":0.0037112011740026846,"score_gpt":0.20199407623767815,"score_spread":0.19828287506367548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026005886","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.03316611,0.0006734469,0.81715345,0.0028982498,0.00064456946,0.00024385945,0.0027037417,0.0074344995,0.13508208],"genre_scores_gemma":[0.6377265,0.0010989408,0.20953342,0.001068791,0.00055818475,0.00057386287,0.003592442,0.0039335713,0.14191423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797255,0.00047675887,0.00018983611,0.00061213115,0.00051035767,0.0002383641],"domain_scores_gemma":[0.9967777,0.0012642728,0.00010847162,0.0013005942,0.0004063113,0.000142702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001195146,0.0011435143,0.0012345356,0.0017802006,0.0025769817,0.0062264004,0.0017162896,0.0019571558,0.027763536],"category_scores_gemma":[0.0045984336,0.0015277293,0.0019965484,0.002806869,0.0045144577,0.012110593,0.0047697416,0.0038261316,0.010790139],"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.000026241605,0.000016608003,0.000092167706,0.000034535642,0.00000804795,0.00007763187,0.00031518575,0.00097010046,0.00058822933,0.9847162,0.0026401267,0.010515013],"study_design_scores_gemma":[0.000010713775,0.0000076168712,0.000028346703,0.000012925917,0.00001529222,0.00006635888,0.00006434718,0.0034048841,0.0011949596,0.9800552,0.015125497,0.000013908489],"about_ca_topic_score_codex":0.0019512055,"about_ca_topic_score_gemma":0.0017339843,"teacher_disagreement_score":0.027763536,"about_ca_system_score_codex":0.0014744399,"about_ca_system_score_gemma":0.0018188175,"threshold_uncertainty_score":0.09287834},"labels":[],"label_agreement":null},{"id":"W3026976675","doi":"10.1016/j.tcs.2020.10.029","title":"Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Characterization (materials science); Binary number; Mathematics; Least-squares function approximation; Combinatorics; Arithmetic; Statistics; Materials science; Nanotechnology","score_opus":0.012494494510200358,"score_gpt":0.23389598394775504,"score_spread":0.2214014894375547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026976675","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.934747,0.0004149621,0.04513185,0.0006188643,0.000099231394,0.00007936241,0.002504581,0.00039682435,0.016007287],"genre_scores_gemma":[0.969422,0.00015073105,0.021930607,0.00016731012,0.00015564113,0.00016298052,0.003026505,0.00021102653,0.004773227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865156,0.00019123494,0.00016972184,0.0004451583,0.00034481264,0.00019748346],"domain_scores_gemma":[0.98040134,0.010755552,0.0040119807,0.0010924963,0.0021079849,0.0016305773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000897165,0.00050869735,0.00045345927,0.0020286583,0.0012895942,0.0029269657,0.0011786114,0.0010433642,0.005711309],"category_scores_gemma":[0.009898516,0.0005701915,0.0003918667,0.001347078,0.0016425522,0.0021290032,0.0010212546,0.0010992651,0.0011052997],"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.0056316843,0.0006562256,0.059877377,0.0009907999,0.00015248435,0.0012944766,0.0038864536,0.019509122,0.17904727,0.6168911,0.0103798155,0.10168322],"study_design_scores_gemma":[0.00027504464,0.00094016205,0.045982134,0.00038530506,0.00024857835,0.0037282184,0.0028432934,0.18031672,0.1028283,0.61995846,0.04213898,0.000354828],"about_ca_topic_score_codex":0.0006788429,"about_ca_topic_score_gemma":0.00074567006,"teacher_disagreement_score":0.005711309,"about_ca_system_score_codex":0.0011530882,"about_ca_system_score_gemma":0.0012910787,"threshold_uncertainty_score":0.019106269},"labels":[],"label_agreement":null},{"id":"W3027490412","doi":"10.1016/j.tcs.2020.05.010","title":"Local search is a PTAS for feedback vertex set in minor-free graphs","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Vertex (graph theory); Minor (academic); Robertson–Seymour theorem; Local search (optimization); Mathematics; Feedback vertex set; Set (abstract data type); Combinatorics; Discrete mathematics; Mathematical optimization; Computer science; Graph; 1-planar graph; Chordal graph","score_opus":0.03530793057521974,"score_gpt":0.30885142335840005,"score_spread":0.2735434927831803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027490412","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.13484159,0.0005604257,0.8463516,0.0015438509,0.00018118734,0.0005216859,0.0010289925,0.0032233251,0.011747357],"genre_scores_gemma":[0.8029515,0.00033949706,0.18072943,0.00053932343,0.0001428222,0.0005382672,0.0009911547,0.00047712645,0.013290915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794513,0.0005966875,0.00010704324,0.0006201125,0.00039706693,0.0003338786],"domain_scores_gemma":[0.99198496,0.004365374,0.0005681493,0.0015914089,0.00077285885,0.000717181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016672178,0.0011611466,0.0028546536,0.0015493982,0.0024466314,0.0021184403,0.00400204,0.0023953312,0.008260837],"category_scores_gemma":[0.012599273,0.0007731956,0.0017957585,0.002253396,0.0017765437,0.004955013,0.003402774,0.0027503096,0.0013915123],"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.002437698,0.0008302955,0.002958122,0.0013102775,0.00031404622,0.00044514114,0.0008684104,0.34968713,0.01943117,0.36869717,0.034607813,0.21841276],"study_design_scores_gemma":[0.00013236258,0.00025000138,0.00028114606,0.000043778615,0.000100189325,0.00022033654,0.0001132277,0.7595786,0.0031002683,0.2335206,0.002625958,0.000033512333],"about_ca_topic_score_codex":0.0042124926,"about_ca_topic_score_gemma":0.0056072124,"teacher_disagreement_score":0.008260837,"about_ca_system_score_codex":0.0020136903,"about_ca_system_score_gemma":0.0035009456,"threshold_uncertainty_score":0.027635276},"labels":[],"label_agreement":null},{"id":"W3029537934","doi":"10.1016/j.tcs.2020.05.012","title":"Group sweep coverage with guaranteed approximation ratio","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Scalability; Computer science; Point of interest; Sweep frequency response analysis; Wireless sensor network; Mathematical optimization; Algorithm; Mathematics; Computer network; Electrical engineering; Engineering; Artificial intelligence; Database","score_opus":0.007776781844890055,"score_gpt":0.20037539231195914,"score_spread":0.19259861046706908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029537934","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.08055929,0.0019329477,0.8931385,0.0022436746,0.00019463577,0.0003124851,0.0012709263,0.0039628716,0.016384635],"genre_scores_gemma":[0.7559131,0.0010811536,0.23290095,0.0006228983,0.00032793582,0.00053157203,0.0015170232,0.0007660932,0.006339321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997086,0.00076320465,0.00009912908,0.0004700667,0.00093886076,0.00064278446],"domain_scores_gemma":[0.98255366,0.013042373,0.0006756434,0.0025620516,0.0005896356,0.0005767192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023030196,0.002480328,0.0038676255,0.0020280955,0.0012317472,0.0026095654,0.004025964,0.002979191,0.009401126],"category_scores_gemma":[0.018256947,0.0010284877,0.0015800295,0.003532321,0.0016311349,0.0051143942,0.0052742367,0.0032303173,0.0020725243],"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.003546708,0.00055651565,0.0029569436,0.00082170224,0.00034961398,0.00047090094,0.00053113146,0.73163116,0.011469061,0.057992116,0.028739449,0.1609347],"study_design_scores_gemma":[0.00022582768,0.0002385063,0.00040442054,0.000034554498,0.000074858275,0.0003378767,0.00009670276,0.94283205,0.002862921,0.05076511,0.0021103604,0.000016821867],"about_ca_topic_score_codex":0.002097108,"about_ca_topic_score_gemma":0.00163923,"teacher_disagreement_score":0.009401126,"about_ca_system_score_codex":0.0015666203,"about_ca_system_score_gemma":0.0016691922,"threshold_uncertainty_score":0.031449854},"labels":[],"label_agreement":null},{"id":"W3035317803","doi":"10.1016/j.tcs.2021.03.010","title":"The undirected repetition threshold and undirected pattern avoidance","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Conjecture; Infimum and supremum; Mathematics; Word (group theory); Repetition (rhetorical device); Binary number; Discrete mathematics; Arithmetic; Geometry; Philosophy","score_opus":0.008529589075174234,"score_gpt":0.23205111697758085,"score_spread":0.22352152790240662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035317803","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.65361285,0.00111559,0.2539766,0.0031113648,0.00025860156,0.000058330555,0.0002902845,0.0005830241,0.08699329],"genre_scores_gemma":[0.97860056,0.0002645827,0.013845121,0.0002069434,0.00014846386,0.000049625127,0.00010090763,0.00007126704,0.006712519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993125,0.00017541906,0.00003745642,0.00018353804,0.00018270694,0.00010840038],"domain_scores_gemma":[0.9931457,0.00473996,0.00055671146,0.0006966834,0.000407596,0.00045336864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067753415,0.0002822541,0.0006299072,0.0009825882,0.00090096885,0.0021678281,0.001082837,0.0013789278,0.0056627938],"category_scores_gemma":[0.0068604206,0.00033492426,0.00042767543,0.0007263778,0.0024068044,0.003942657,0.0014602982,0.0016495506,0.0005089195],"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.00007012442,0.000035578523,0.00080731953,0.000065710774,0.000011344836,0.00018548658,0.00026430425,0.00472042,0.0049582436,0.9759034,0.0018845898,0.011093527],"study_design_scores_gemma":[0.000012464727,0.000010886661,0.00031884926,0.0000071720624,0.0000067802,0.00016428017,0.00005600786,0.02102562,0.0010567202,0.9764221,0.00090918445,0.0000100282],"about_ca_topic_score_codex":0.0005858958,"about_ca_topic_score_gemma":0.0004705902,"teacher_disagreement_score":0.0056627938,"about_ca_system_score_codex":0.00054528285,"about_ca_system_score_gemma":0.00051300525,"threshold_uncertainty_score":0.018943965},"labels":[],"label_agreement":null},{"id":"W3037831187","doi":"10.1016/j.tcs.2022.08.001","title":"APX-hardness and approximation for the k-burning number problem","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; APX; Generalization; Approximation algorithm; Sequence (biology); Binary logarithm; Running time; Graph; Discrete mathematics; Physics; Algorithm; Chemistry","score_opus":0.008813310435495127,"score_gpt":0.2630747561018924,"score_spread":0.2542614456663973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037831187","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.21190785,0.005989849,0.65760106,0.032307085,0.0013532896,0.00052061584,0.0066982955,0.0028030428,0.08081897],"genre_scores_gemma":[0.7572981,0.003961702,0.17946742,0.0037337774,0.0019192684,0.0010629109,0.005753895,0.0014940879,0.045308735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566454,0.0012715125,0.00021527607,0.0011244544,0.00096511794,0.0007591049],"domain_scores_gemma":[0.96940595,0.023436768,0.0013703099,0.003591587,0.00092626875,0.0012691504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004168465,0.002362,0.0040005744,0.0017657786,0.003100789,0.0068959147,0.008051115,0.0048940065,0.022939805],"category_scores_gemma":[0.030182399,0.0014943598,0.0032774033,0.004019602,0.0047356924,0.021407329,0.007158541,0.012092596,0.0028876157],"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.0023904585,0.00074408005,0.0040648216,0.0018204147,0.00035896344,0.00044383766,0.0010096334,0.19208391,0.0032237002,0.65008914,0.062264666,0.081506394],"study_design_scores_gemma":[0.00013975265,0.00005570317,0.00050648017,0.00007777724,0.00005989743,0.00021099365,0.00016291905,0.16750443,0.00073498784,0.82647043,0.004047222,0.00002941213],"about_ca_topic_score_codex":0.0031708782,"about_ca_topic_score_gemma":0.0027116886,"teacher_disagreement_score":0.022939805,"about_ca_system_score_codex":0.004027318,"about_ca_system_score_gemma":0.0030976112,"threshold_uncertainty_score":0.07674128},"labels":[],"label_agreement":null},{"id":"W3040025217","doi":"10.1016/j.tcs.2021.02.023","title":"Squarefree words with interior disposable factors","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Square-free integer; Word (group theory); Mathematics; Combinatorics; Ternary operation; Position (finance); Symbol (formal); Property (philosophy); Arithmetic; Computer science; Geometry; Philosophy; Business","score_opus":0.009752978889501072,"score_gpt":0.23538600739585205,"score_spread":0.22563302850635097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040025217","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.4363451,0.0013349348,0.39325786,0.0013943632,0.0007791509,0.00014592754,0.0009837454,0.0016088713,0.16415004],"genre_scores_gemma":[0.8896844,0.00041473017,0.043957822,0.00028727576,0.00025549642,0.00011822289,0.0005597056,0.0004350822,0.06428736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992304,0.00012301201,0.00006393926,0.00025123663,0.00016113851,0.0001702324],"domain_scores_gemma":[0.99791867,0.0011426172,0.00014472376,0.00024943313,0.00028655498,0.00025799553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000630925,0.0010280586,0.00093868695,0.0012277161,0.0016563366,0.0037357325,0.0007474508,0.001149605,0.016593248],"category_scores_gemma":[0.0025938544,0.0010098697,0.0010039748,0.001136452,0.0027872913,0.006047938,0.002687579,0.0021720498,0.0035688877],"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.00017261376,0.000046023022,0.00044022652,0.00008524059,0.0000113949845,0.0006671594,0.0008207257,0.00062204123,0.0057859127,0.98143333,0.0017425184,0.008172988],"study_design_scores_gemma":[0.000034117318,0.000025266821,0.00020063452,0.000019134064,0.000017672084,0.00043512025,0.00021021144,0.0021780252,0.003530932,0.985466,0.0078619225,0.000020967856],"about_ca_topic_score_codex":0.00047788327,"about_ca_topic_score_gemma":0.00066873385,"teacher_disagreement_score":0.016593248,"about_ca_system_score_codex":0.0006800616,"about_ca_system_score_gemma":0.00048101906,"threshold_uncertainty_score":0.055509925},"labels":[],"label_agreement":null},{"id":"W3041213598","doi":"10.1016/j.tcs.2019.12.009","title":"Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst France","keywords":"Job shop scheduling; Combinatorics; Approximation algorithm; Bounded function; Mathematics; Intersection (aeronautics); Discrete mathematics; Conjecture; Minification; Algorithm; Computer science; Schedule; Mathematical optimization","score_opus":0.004419485381486819,"score_gpt":0.20785143527257327,"score_spread":0.20343194989108646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041213598","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.52594715,0.00052825816,0.46345538,0.0003449982,0.0000881567,0.00019172397,0.00032744816,0.0006998006,0.008417035],"genre_scores_gemma":[0.9143556,0.00018159987,0.0826826,0.00004907339,0.00006263086,0.00011813109,0.00022266638,0.00016740857,0.0021602786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989322,0.00036197642,0.000042202395,0.00020603975,0.00018406581,0.000273517],"domain_scores_gemma":[0.99780256,0.0013603801,0.00025203062,0.00019808048,0.00017119662,0.00021572785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012283225,0.0009908491,0.0014125556,0.0007609654,0.00106519,0.0012068765,0.0018898355,0.0007016135,0.0017026115],"category_scores_gemma":[0.0035528871,0.0008118462,0.0006927678,0.0017987953,0.0007950171,0.0015791707,0.0010684635,0.0007684485,0.00019172851],"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.00089678634,0.0002165084,0.0005281068,0.00024481333,0.00006380085,0.0001645357,0.00008294421,0.95603144,0.008261485,0.013048999,0.0012060791,0.019254552],"study_design_scores_gemma":[0.00002652965,0.00011471793,0.00041443747,0.0000056994445,0.000015548723,0.000023472563,0.000019763333,0.9865888,0.0016849929,0.010934797,0.00016437036,0.0000069162384],"about_ca_topic_score_codex":0.0022037076,"about_ca_topic_score_gemma":0.0025220588,"teacher_disagreement_score":0.0022037076,"about_ca_system_score_codex":0.0011277362,"about_ca_system_score_gemma":0.0014376281,"threshold_uncertainty_score":0.008182347},"labels":[],"label_agreement":null},{"id":"W3046970181","doi":"10.1016/j.tcs.2020.07.035","title":"Generating a Gray code for prefix normal words in amortized polylogarithmic time per word","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Prefix; Substring; Word (group theory); Amortized analysis; Gray code; Combinatorics; Prefix code; Mathematics; Arithmetic; Time complexity; Computer science; Discrete mathematics; Set (abstract data type); Algorithm; Data structure; Decoding methods; Linear code; Programming language; Linguistics","score_opus":0.013084670613608457,"score_gpt":0.2519275911630902,"score_spread":0.23884292054948175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046970181","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.2814513,0.00063162245,0.6844762,0.0021135055,0.00051995576,0.00050714676,0.0011562619,0.0077846423,0.021359378],"genre_scores_gemma":[0.6250413,0.00025580171,0.35436174,0.0007338035,0.0001946536,0.00056670234,0.0018840162,0.0013427358,0.015619318],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978903,0.00032331608,0.00015493788,0.0003924561,0.00086361956,0.00037545976],"domain_scores_gemma":[0.9948101,0.0025161742,0.0002675183,0.0014194581,0.0007759392,0.00021074752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076807657,0.0010199687,0.0010607137,0.0011747344,0.00095775194,0.0017953106,0.0013032648,0.001523882,0.009474707],"category_scores_gemma":[0.0073933983,0.00045275438,0.0010023286,0.0018839631,0.0016706914,0.0026871073,0.0036657627,0.0014189151,0.0027828563],"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.0022638382,0.00055851886,0.003829373,0.000628882,0.00016274626,0.0010095262,0.00079638057,0.10877846,0.092066154,0.2123016,0.03335883,0.5442456],"study_design_scores_gemma":[0.00041992337,0.00042266768,0.00088800245,0.0000951818,0.00012613533,0.00060423417,0.00020473267,0.5563811,0.06212835,0.36728743,0.011363913,0.00007832974],"about_ca_topic_score_codex":0.001948037,"about_ca_topic_score_gemma":0.0030829783,"teacher_disagreement_score":0.009474707,"about_ca_system_score_codex":0.0017351874,"about_ca_system_score_gemma":0.0024055338,"threshold_uncertainty_score":0.03169602},"labels":[],"label_agreement":null},{"id":"W3047376977","doi":"10.1016/j.tcs.2020.07.042","title":"Exact algorithms for the repetition-bounded longest common subsequence problem","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","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":"University of Alberta","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Hong Kong Polytechnic University","keywords":"Subsequence; Longest common subsequence problem; Algorithm; Combinatorics; Longest increasing subsequence; Bounded function; Sequence (biology); Constraint (computer-aided design); Upper and lower bounds; Symbol (formal); Mathematics; Function (biology); Exponential time hypothesis; Exponential function; Time complexity; Discrete mathematics; Computer science","score_opus":0.0279039761775633,"score_gpt":0.2783191148854392,"score_spread":0.2504151387078759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047376977","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.018838895,0.0017900657,0.9676908,0.0007119815,0.00022413046,0.00033080217,0.00055270287,0.0044041723,0.0054564746],"genre_scores_gemma":[0.13630223,0.0008423559,0.8544878,0.00046853305,0.0003004482,0.0005492117,0.0021352088,0.00090989703,0.0040043076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99292725,0.0013171778,0.0005693646,0.0023570056,0.0017794869,0.0010497211],"domain_scores_gemma":[0.98777616,0.007747887,0.0010322835,0.0021862695,0.000970401,0.00028692253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036023157,0.0028869156,0.0027582664,0.0019979,0.0017426701,0.0026726744,0.0054916334,0.0026040422,0.009239518],"category_scores_gemma":[0.019296693,0.0011701403,0.0019716215,0.0045763203,0.0018935907,0.008414712,0.0032344118,0.0036689742,0.00346685],"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.0014476305,0.00067542924,0.0021834879,0.0020816126,0.0003877573,0.00041020883,0.00077166833,0.37443322,0.011131636,0.12921524,0.032717973,0.44454417],"study_design_scores_gemma":[0.0003606501,0.00020784888,0.00033378453,0.00007927918,0.0000941014,0.00034489468,0.00018118584,0.76285994,0.004143566,0.22227728,0.009052931,0.000064625056],"about_ca_topic_score_codex":0.0035193812,"about_ca_topic_score_gemma":0.003927686,"teacher_disagreement_score":0.009239518,"about_ca_system_score_codex":0.0026216567,"about_ca_system_score_gemma":0.005093445,"threshold_uncertainty_score":0.0309093},"labels":[],"label_agreement":null},{"id":"W3084213112","doi":"10.1016/j.tcs.2006.06.012","title":"Preface","year":2006,"lang":"en","type":"article","venue":"Theoretical 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":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics","score_opus":0.006194485593333101,"score_gpt":0.2398046339403179,"score_spread":0.2336101483469848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084213112","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.0014420764,0.01476795,0.0212117,0.04901405,0.33600843,0.00049581734,0.010056449,0.0019379859,0.56506556],"genre_scores_gemma":[0.008624749,0.007215656,0.005547315,0.008153423,0.057650056,0.0002968695,0.0074104923,0.0013474044,0.90375406],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936277,0.0001065789,0.000039179595,0.00011377129,0.0003257882,0.000051845156],"domain_scores_gemma":[0.9947514,0.0008854198,0.00015927854,0.0005463181,0.0029269198,0.0007307156],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012540121,0.0010220911,0.0006801873,0.0034782076,0.0025117,0.00299914,0.0012421038,0.0009087057,0.3299962],"category_scores_gemma":[0.010845435,0.00029737753,0.0006201545,0.002356568,0.0006494488,0.002732696,0.0017727063,0.003208773,0.2160597],"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.000021916565,0.000019550076,0.00007028258,0.00007840813,0.0000020647942,0.000025315197,0.00003766019,0.00006908831,0.00012216187,0.008279907,0.9525173,0.0387564],"study_design_scores_gemma":[0.0000046971522,0.000012546003,0.00024480943,0.00010071824,0.0000027552553,0.00003902305,0.000048054637,0.00005966084,0.00014752561,0.008312597,0.99102134,0.0000062659615],"about_ca_topic_score_codex":0.0031599891,"about_ca_topic_score_gemma":0.004157065,"teacher_disagreement_score":0.6700038,"about_ca_system_score_codex":0.0019486982,"about_ca_system_score_gemma":0.0016495915,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3100079455","doi":"10.1016/j.tcs.2020.11.019","title":"Maximal unbordered factors of random strings","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Horizon 2020 Framework Programme; Israel Science Foundation; Danmarks Frie Forskningsfond; United States-Israel Binational Science Foundation","keywords":"Combinatorics; String (physics); Mathematics; Conjecture; Suffix; Prefix; Alphabet; Unary operation; Discrete mathematics","score_opus":0.014780486485901885,"score_gpt":0.23757626745817365,"score_spread":0.22279578097227176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100079455","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.55991685,0.0030684185,0.35133618,0.0020203174,0.0005133317,0.00017066995,0.0007569845,0.0012045737,0.08101259],"genre_scores_gemma":[0.9371785,0.00092263415,0.032930136,0.00038834036,0.00041195125,0.00015660589,0.00047811752,0.0005406658,0.02699302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699676,0.0009903682,0.00019349837,0.0006114512,0.0006175303,0.00059034297],"domain_scores_gemma":[0.9915249,0.005550348,0.00068620505,0.001098246,0.0005737511,0.0005665564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017168402,0.0010761879,0.0012953392,0.0020110875,0.0014483788,0.003800271,0.0010394447,0.0013934332,0.010075475],"category_scores_gemma":[0.013877164,0.0006152798,0.0009580567,0.001611975,0.00282361,0.005941024,0.0027218175,0.0019915542,0.0023078716],"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.00058504415,0.000060058363,0.0005293582,0.00012242666,0.000025751677,0.00024651678,0.0003897617,0.0027381063,0.0047206823,0.969753,0.002157265,0.018672027],"study_design_scores_gemma":[0.000055375323,0.000080517384,0.00031113334,0.00007183472,0.00003022355,0.00029421126,0.000093695046,0.011626858,0.0052178777,0.97633386,0.00585181,0.000032507927],"about_ca_topic_score_codex":0.0004125786,"about_ca_topic_score_gemma":0.00045242367,"teacher_disagreement_score":0.010075475,"about_ca_system_score_codex":0.001150151,"about_ca_system_score_gemma":0.0006110778,"threshold_uncertainty_score":0.03370583},"labels":[],"label_agreement":null},{"id":"W3101685628","doi":"10.1016/j.tcs.2020.11.018","title":"Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Lexicographical order; Sequence (biology); Combinatorics; Mathematics; Representation (politics); Construct (python library); Greedy algorithm; Simple (philosophy); Discrete mathematics; Algorithm; Computer science","score_opus":0.02492197415689523,"score_gpt":0.2510284939185019,"score_spread":0.22610651976160667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101685628","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.07766749,0.0018998979,0.59268945,0.008039417,0.0032821156,0.00015225825,0.0006223513,0.00084855687,0.31479844],"genre_scores_gemma":[0.7118185,0.0022098494,0.22920792,0.0031463786,0.0014530645,0.0002646578,0.0006233677,0.0012770334,0.04999928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958977,0.0015592147,0.00024768425,0.0005012704,0.0012925506,0.00050159445],"domain_scores_gemma":[0.993166,0.0030222256,0.00031068223,0.002238312,0.0009977465,0.00026505394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037295884,0.000850716,0.0008294711,0.0019254852,0.0033614184,0.0043779155,0.0018018965,0.0021911727,0.010549225],"category_scores_gemma":[0.013284634,0.0006886504,0.0010252359,0.0021911834,0.005116105,0.011271646,0.004175283,0.004992253,0.003737073],"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.000024567082,0.000010065699,0.000054423635,0.000024437419,0.0000019928268,0.000029715655,0.00012174068,0.00036531332,0.0005343903,0.99160236,0.00084740313,0.0063836453],"study_design_scores_gemma":[0.000009820821,0.000015024559,0.000054450826,0.000030786407,0.0000071882046,0.00015058865,0.00008663774,0.0024389161,0.0018083982,0.97823346,0.017145425,0.000019327585],"about_ca_topic_score_codex":0.000787902,"about_ca_topic_score_gemma":0.0010426417,"teacher_disagreement_score":0.010549225,"about_ca_system_score_codex":0.0011813776,"about_ca_system_score_gemma":0.0018621447,"threshold_uncertainty_score":0.03529066},"labels":[],"label_agreement":null},{"id":"W3108864434","doi":"10.1016/j.tcs.2020.11.022","title":"Automedian sets of permutations: direct sum and shuffle","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Combinatorics; Mathematics; Set (abstract data type); Separable space; Permutation (music); Function (biology); Discrete mathematics; Computer science","score_opus":0.015218746994989584,"score_gpt":0.27381356770253873,"score_spread":0.25859482070754913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108864434","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.024391988,0.0008096139,0.95270383,0.0005787327,0.00027197442,0.00008959267,0.0002887768,0.00028811413,0.020577375],"genre_scores_gemma":[0.330815,0.001812896,0.6082762,0.0011378793,0.0010214077,0.00064461475,0.0014927131,0.0010684775,0.053730816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934316,0.0028912406,0.00038901647,0.0012171591,0.0015094744,0.00056155404],"domain_scores_gemma":[0.98488164,0.009372659,0.0007036386,0.002984354,0.0012878038,0.000769929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051235226,0.0015093661,0.003035518,0.0037886058,0.0039189537,0.00628577,0.0047371336,0.0031815595,0.012618829],"category_scores_gemma":[0.026068542,0.0016342922,0.0034952909,0.004222728,0.0050293086,0.010906854,0.0070350673,0.006134425,0.0041303085],"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.00007575659,0.00006668068,0.00021225924,0.000063377935,0.00003188986,0.000059719405,0.0001595106,0.008756262,0.00027982515,0.9590817,0.0022698124,0.028943263],"study_design_scores_gemma":[0.0000054204124,0.000007672783,0.00002869959,0.0000134698785,0.0000070598485,0.000048275637,0.000017360875,0.018961499,0.00020303957,0.9794236,0.001269673,0.000014271068],"about_ca_topic_score_codex":0.0013732787,"about_ca_topic_score_gemma":0.0017964066,"teacher_disagreement_score":0.012618829,"about_ca_system_score_codex":0.0016038609,"about_ca_system_score_gemma":0.002141606,"threshold_uncertainty_score":0.042214215},"labels":[],"label_agreement":null},{"id":"W3116363031","doi":"10.1016/j.tcs.2020.12.028","title":"Decision problems and projection languages for restricted variants of two-dimensional automata","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic finite automaton; Deterministic automaton; Decidability; Mathematics; Nondeterministic algorithm; Discrete mathematics; Deterministic finite automaton; Büchi automaton; Decision problem; Regular language; Combinatorics; Two-way deterministic finite automaton; Quantum finite automata; Unary operation; Equivalence (formal languages); Deterministic pushdown automaton; Automata theory; Automaton; Finite-state machine; Computer science; Algorithm; Theoretical computer science","score_opus":0.017174068509438905,"score_gpt":0.27142118068754834,"score_spread":0.2542471121781094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116363031","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.32860506,0.00089827785,0.63977134,0.0030134802,0.0002493582,0.00032887235,0.0007165019,0.0004925855,0.025924554],"genre_scores_gemma":[0.87757623,0.0005667822,0.10762105,0.0004167011,0.00024618214,0.000514231,0.0010020346,0.00015245615,0.011904399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947778,0.0021117053,0.00053741434,0.001111472,0.00078682316,0.00067471433],"domain_scores_gemma":[0.9801333,0.015217634,0.000779572,0.0015313362,0.0012453914,0.001092768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048163943,0.00086925854,0.0015330826,0.0009985084,0.0017771663,0.00749638,0.0025560716,0.0021396494,0.006725824],"category_scores_gemma":[0.014612154,0.001095391,0.0027905486,0.0017208616,0.006124679,0.012358773,0.004843495,0.006252555,0.00066058536],"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.00013357963,0.00008954062,0.00029757374,0.00007983367,0.000025889023,0.0001332511,0.000527959,0.007329,0.00087886874,0.9842785,0.00063619216,0.0055897846],"study_design_scores_gemma":[0.000039533064,0.000024743502,0.000070816146,0.000012207684,0.000012658249,0.000065110915,0.00014110346,0.028095597,0.0004554552,0.9705183,0.00054455723,0.000019951043],"about_ca_topic_score_codex":0.0017373214,"about_ca_topic_score_gemma":0.0014825276,"teacher_disagreement_score":0.00749638,"about_ca_system_score_codex":0.0019253468,"about_ca_system_score_gemma":0.0024159155,"threshold_uncertainty_score":0.025471866},"labels":[],"label_agreement":null},{"id":"W3120172643","doi":"10.1016/j.tcs.2021.01.018","title":"Ostrowski-automatic sequences: Theory and applications","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Enumeration; Computation; Computer science; Algebra over a field; Order (exchange); Mathematics; Automated theorem proving; Theoretical computer science; Discrete mathematics; Algorithm; Pure mathematics","score_opus":0.007005801093417205,"score_gpt":0.2402572451134385,"score_spread":0.2332514440200213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120172643","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.17745696,0.02711677,0.64375746,0.00538445,0.0019225781,0.00014377688,0.00060983415,0.0006353472,0.14297277],"genre_scores_gemma":[0.7819529,0.012725884,0.14838488,0.00079749676,0.0018929287,0.0003552565,0.00056112075,0.00019562778,0.05313387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992766,0.00017842778,0.0000637306,0.00017982876,0.0002180989,0.00008333372],"domain_scores_gemma":[0.99757546,0.001235007,0.00038059347,0.00020425662,0.00039711714,0.00020763277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095735415,0.00070452184,0.0008020974,0.0039465595,0.0018013683,0.0027476482,0.0011758758,0.0014072628,0.006708866],"category_scores_gemma":[0.004708303,0.00051393127,0.00078929716,0.0042574666,0.0033094406,0.005573132,0.0020165835,0.002717949,0.0015083661],"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.000015101859,0.000011184754,0.00013817515,0.00005238813,0.0000035260505,0.000027067535,0.00015139475,0.00075214065,0.00039808502,0.9871516,0.00071137695,0.010587994],"study_design_scores_gemma":[0.0000087902135,0.000011165388,0.00014736789,0.000020621308,0.000005244093,0.000098869736,0.00006098988,0.0050696163,0.0004044306,0.9884637,0.005697629,0.000011485458],"about_ca_topic_score_codex":0.0007941308,"about_ca_topic_score_gemma":0.00081993797,"teacher_disagreement_score":0.006708866,"about_ca_system_score_codex":0.0015931217,"about_ca_system_score_gemma":0.0012020579,"threshold_uncertainty_score":0.022443354},"labels":[],"label_agreement":null},{"id":"W3128085259","doi":"10.1016/j.tcs.2021.02.003","title":"Improved hardness and approximation results for single allocation hub location problems","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Hardness of approximation; Mathematics; Clique; Graph; Node (physics); Metric (unit); Approximation algorithm; Discrete mathematics; Integer (computer science); Computer science; Physics","score_opus":0.01807884128422667,"score_gpt":0.25378342178509666,"score_spread":0.23570458050086998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128085259","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.07512045,0.006137659,0.8310179,0.013421319,0.0011817729,0.00043021515,0.002607816,0.0015125668,0.0685703],"genre_scores_gemma":[0.68857235,0.0054858956,0.25736317,0.0030804768,0.002854722,0.0011559575,0.003817169,0.0016660907,0.036004107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99310416,0.0023146647,0.00026034427,0.001420966,0.0016356427,0.0012642046],"domain_scores_gemma":[0.96213293,0.030380586,0.0012741996,0.0038021763,0.0013720744,0.0010380633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055911206,0.0041450644,0.0050209686,0.0032599058,0.002883715,0.00660354,0.010120299,0.004399029,0.019892922],"category_scores_gemma":[0.035333343,0.0021398256,0.0052936804,0.0058449483,0.0049400236,0.019406449,0.0064415196,0.01540871,0.002570021],"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.0018844032,0.0011482077,0.003336872,0.0018081992,0.00044936725,0.00042393172,0.0009395958,0.43192303,0.0028598476,0.4074554,0.058260035,0.08951109],"study_design_scores_gemma":[0.00018231997,0.000103389015,0.0008083721,0.000103817234,0.00015368438,0.0001357295,0.00020650103,0.49381685,0.0009262805,0.4978594,0.005651574,0.000052106185],"about_ca_topic_score_codex":0.006326814,"about_ca_topic_score_gemma":0.006772066,"teacher_disagreement_score":0.019892922,"about_ca_system_score_codex":0.0057161856,"about_ca_system_score_gemma":0.0043606055,"threshold_uncertainty_score":0.06654847},"labels":[],"label_agreement":null},{"id":"W3171062666","doi":"10.1016/j.tcs.2022.11.020","title":"Colouring graphs with no induced six-vertex path or diamond","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Tianjin City; Nankai University; KU Leuven; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Diamond; Perfect graph; Vertex (graph theory); Perfect graph theorem; Discrete mathematics; Graph; Line graph; Pathwidth; Chemistry","score_opus":0.01722655445675764,"score_gpt":0.27155464520713374,"score_spread":0.2543280907503761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171062666","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.6558185,0.0003985855,0.17585522,0.0017302927,0.0006580183,0.00032268307,0.002042576,0.0020374903,0.16113652],"genre_scores_gemma":[0.80091,0.00033790772,0.16245686,0.00074727123,0.00008185887,0.00018456929,0.0017528207,0.00051265873,0.033016093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993187,0.0001387812,0.000038315153,0.00018547243,0.00012309365,0.00019565706],"domain_scores_gemma":[0.9966858,0.0012914219,0.00029330893,0.0008324384,0.00040151304,0.0004954753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005845432,0.00073224865,0.00087177847,0.00090218836,0.0017609558,0.0019580538,0.0016198069,0.0016201686,0.013481245],"category_scores_gemma":[0.0024881563,0.00070069847,0.0007981841,0.0009988486,0.0014729026,0.002477899,0.0018308782,0.0022549338,0.0021907643],"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.0010568646,0.00029900065,0.002141284,0.0006291504,0.000070241476,0.000846763,0.00084139453,0.009707352,0.04638652,0.84691375,0.01912519,0.07198246],"study_design_scores_gemma":[0.00020427458,0.00016949403,0.0012248774,0.00010251617,0.00007624955,0.0006570825,0.00042563255,0.015839858,0.018118916,0.93827033,0.02484743,0.00006337861],"about_ca_topic_score_codex":0.0014268998,"about_ca_topic_score_gemma":0.002017551,"teacher_disagreement_score":0.013481245,"about_ca_system_score_codex":0.0009361954,"about_ca_system_score_gemma":0.0008031065,"threshold_uncertainty_score":0.045099318},"labels":[],"label_agreement":null},{"id":"W3177770101","doi":"10.1016/j.tcs.2021.06.038","title":"On synchronization and orientation in distributed barrier coverage with relocatable sensors","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Concordia University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orientation (vector space); Asynchronous communication; Visibility; Synchronization (alternating current); Position (finance); Range (aeronautics); Cover (algebra); Computer science; Focus (optics); Algorithm; Mathematics; Geometry; Telecommunications; Physics; Engineering; Aerospace engineering; Channel (broadcasting)","score_opus":0.00543839597750751,"score_gpt":0.23059370979311655,"score_spread":0.22515531381560905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177770101","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.09000363,0.0012529076,0.8996494,0.0007957922,0.00015067625,0.000080096084,0.00010364136,0.0001404571,0.007823477],"genre_scores_gemma":[0.9457477,0.0014677227,0.045333173,0.00017356778,0.00017818356,0.00015209761,0.00013865877,0.00015283101,0.006656018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908364,0.00039351193,0.000035543297,0.00015929142,0.00018203331,0.00014608748],"domain_scores_gemma":[0.9929743,0.005565479,0.00063313235,0.0002456697,0.00031982936,0.00026153174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019150841,0.0008003131,0.0014518235,0.0011289094,0.00073297817,0.0012159415,0.0016727438,0.001160978,0.002792168],"category_scores_gemma":[0.01369036,0.00061991985,0.0007271334,0.0017031286,0.0020453657,0.0023439997,0.0026289534,0.0011857236,0.00019807728],"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.00036062617,0.00005064327,0.0010840826,0.00012570948,0.00004541998,0.00011770388,0.00019235008,0.89630616,0.0021852974,0.08179559,0.0012960455,0.016440354],"study_design_scores_gemma":[0.00003365538,0.000055949044,0.00027506985,0.000010169914,0.000016917887,0.000020588215,0.000058675487,0.9776569,0.0003852279,0.021052472,0.00042376728,0.000010587328],"about_ca_topic_score_codex":0.006503136,"about_ca_topic_score_gemma":0.0032599168,"teacher_disagreement_score":0.006503136,"about_ca_system_score_codex":0.0012268405,"about_ca_system_score_gemma":0.0009391616,"threshold_uncertainty_score":0.012930572},"labels":[],"label_agreement":null},{"id":"W3188608413","doi":"10.1016/j.tcs.2021.07.038","title":"One-visibility cops and robber on trees","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Visibility; Computer science; Tree (set theory); Variation (astronomy); Mathematics; Theoretical computer science; Combinatorics; Geography","score_opus":0.027342755584197152,"score_gpt":0.2922411713208605,"score_spread":0.2648984157366634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188608413","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.46930557,0.001851275,0.29567498,0.005041931,0.0005618129,0.0001229092,0.0003922763,0.00046837862,0.2265809],"genre_scores_gemma":[0.92766714,0.00067732064,0.021273421,0.00028621554,0.00018961764,0.000047252077,0.00019091011,0.0002351578,0.049432985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.00013259592,0.000022993181,0.00012886898,0.00011715741,0.00019961045],"domain_scores_gemma":[0.9976088,0.001272878,0.00022115064,0.0002463333,0.00019125745,0.00045957265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005470359,0.0006106339,0.0016032441,0.0012039618,0.0026890875,0.0027131115,0.0015370124,0.002573595,0.012732474],"category_scores_gemma":[0.005686484,0.00077228906,0.0010156798,0.0011151943,0.0029395756,0.006134146,0.0030939248,0.0027852207,0.000915192],"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.000055545013,0.00002348172,0.00017214306,0.00004130945,0.000010142053,0.00012888727,0.0002788546,0.0054449467,0.00029143807,0.9874483,0.0023389808,0.0037661158],"study_design_scores_gemma":[0.000015482601,0.000012281714,0.00015988087,0.000012374193,0.000008153049,0.000072169314,0.000109220666,0.01820716,0.00010478396,0.97913945,0.002150261,0.000008831755],"about_ca_topic_score_codex":0.0046257228,"about_ca_topic_score_gemma":0.0045741834,"teacher_disagreement_score":0.012732474,"about_ca_system_score_codex":0.000949711,"about_ca_system_score_gemma":0.0007783863,"threshold_uncertainty_score":0.042594373},"labels":[],"label_agreement":null},{"id":"W3196411836","doi":"10.1016/j.tcs.2022.03.013","title":"Positive planar satisfiability problems under 3-connectivity constraints","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Bangladesh University of Engineering and Technology","keywords":"Combinatorics; Mathematics; Planar graph; Planarity testing; Satisfiability; Discrete mathematics; Planar; Matching (statistics); Graph; Time complexity; Computer science","score_opus":0.009563311863093891,"score_gpt":0.2284865948402183,"score_spread":0.2189232829771244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196411836","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.5199673,0.0011903718,0.39585912,0.010842222,0.00026919326,0.000350966,0.0025110508,0.0011422437,0.067867465],"genre_scores_gemma":[0.9071831,0.00072545605,0.075207196,0.0008234441,0.00031863345,0.00024956898,0.0019839269,0.00029571264,0.013212879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851006,0.0004956915,0.00011032487,0.00036162423,0.000296895,0.00022533828],"domain_scores_gemma":[0.98292714,0.014590468,0.0010926056,0.0004949503,0.0005152849,0.00037948755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014723886,0.0007968256,0.0011655616,0.0009151105,0.0013924197,0.004203074,0.0021095674,0.0025689797,0.011952411],"category_scores_gemma":[0.011564252,0.001076068,0.0014729622,0.0021167416,0.0023905446,0.009137537,0.0027914587,0.0034941616,0.00079515687],"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.00065364863,0.0002688421,0.0016932527,0.0009188994,0.00016893548,0.00095703994,0.0010127106,0.11455982,0.00771471,0.811934,0.012299788,0.047818337],"study_design_scores_gemma":[0.00014041683,0.00004976502,0.0003932278,0.000048703634,0.00006573244,0.00027322827,0.0004130815,0.07732577,0.0037422783,0.9143454,0.0031722994,0.000029992732],"about_ca_topic_score_codex":0.0018859018,"about_ca_topic_score_gemma":0.0024487076,"teacher_disagreement_score":0.011952411,"about_ca_system_score_codex":0.0014099913,"about_ca_system_score_gemma":0.0009416187,"threshold_uncertainty_score":0.039984763},"labels":[],"label_agreement":null},{"id":"W3201276541","doi":"10.1016/j.tcs.2021.08.025","title":"Symmetric PMC model of diagnosis, b-matchings in graphs and fault identification in t-diagnosable systems","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Bipartite graph; Hypercube; Matching (statistics); Combinatorics; Algorithm; Graph theory; Computer science; Identification (biology); Mathematics; Graph; Discrete mathematics; Statistics","score_opus":0.013057115727586714,"score_gpt":0.24194940384525296,"score_spread":0.22889228811766624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201276541","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.12390786,0.00030253196,0.8619658,0.0010224276,0.00010389717,0.00011154056,0.0004502868,0.00043501475,0.011700751],"genre_scores_gemma":[0.9600451,0.00021466377,0.032484118,0.00019317721,0.00007595638,0.00010080719,0.00020667652,0.000056848454,0.006622611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989404,0.00025823826,0.000056637033,0.0003357514,0.0002380491,0.00017085003],"domain_scores_gemma":[0.996482,0.0017162922,0.00062650954,0.0004515545,0.0005206374,0.00020293903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011114056,0.00059085595,0.0010096744,0.0010959848,0.0007481039,0.0020016695,0.0017394521,0.0019404135,0.005147429],"category_scores_gemma":[0.0061529195,0.00053284655,0.0008712328,0.0012017362,0.0015724777,0.003195624,0.0013332118,0.0014963142,0.000525984],"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.00026103377,0.000107277614,0.0011295725,0.00015285893,0.00006349439,0.0006713441,0.00027286468,0.19205633,0.005414293,0.782399,0.0018258624,0.015646106],"study_design_scores_gemma":[0.00003770151,0.000039043338,0.00022581742,0.0000106835105,0.000021577169,0.00017699985,0.000054208584,0.5911996,0.00097027415,0.40660673,0.00064544077,0.0000118485295],"about_ca_topic_score_codex":0.0043856977,"about_ca_topic_score_gemma":0.0022799238,"teacher_disagreement_score":0.005147429,"about_ca_system_score_codex":0.0015011408,"about_ca_system_score_gemma":0.0016634903,"threshold_uncertainty_score":0.017219841},"labels":[],"label_agreement":null},{"id":"W320810298","doi":"10.1016/j.tcs.2015.04.035","title":"Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamwidth; Omnidirectional antenna; Antenna (radio); Orientation (vector space); Computer science; Directional antenna; Algorithm; Mathematics; Telecommunications; Geometry","score_opus":0.013291151686099257,"score_gpt":0.2316010301662544,"score_spread":0.21830987848015515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W320810298","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.73041564,0.008573601,0.24160185,0.0023251341,0.000110318164,0.00007054574,0.0002707205,0.00025928454,0.016372913],"genre_scores_gemma":[0.9921085,0.0010935132,0.005424671,0.000041509436,0.00006701031,0.000025315281,0.000035460096,0.000042741034,0.0011613284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992261,0.00034756862,0.000032308002,0.00010590619,0.00015882778,0.00012939109],"domain_scores_gemma":[0.9810534,0.01610532,0.0013420966,0.0005337392,0.0005322636,0.0004331267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018965959,0.0006276832,0.0007629225,0.0012089123,0.00080048584,0.0012322535,0.0011303993,0.0012506727,0.0025934821],"category_scores_gemma":[0.018042514,0.0007028506,0.0003036014,0.0015774822,0.0018560418,0.004271758,0.0016009042,0.0007836101,0.00021013299],"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.00074209983,0.00015868882,0.0063923365,0.0003082333,0.000067230125,0.00038262756,0.0005316026,0.8275286,0.014208147,0.08944449,0.0015729788,0.05866293],"study_design_scores_gemma":[0.000050677936,0.00035771143,0.0037151133,0.000047107198,0.00005046938,0.0005056716,0.00041138817,0.89481455,0.0023170188,0.096542776,0.0011449046,0.000042635318],"about_ca_topic_score_codex":0.0009761722,"about_ca_topic_score_gemma":0.0015293063,"teacher_disagreement_score":0.0025934821,"about_ca_system_score_codex":0.0011795666,"about_ca_system_score_gemma":0.0002825115,"threshold_uncertainty_score":0.01003027},"labels":[],"label_agreement":null},{"id":"W4205114821","doi":"10.1016/j.tcs.2019.10.009","title":"Preface","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.004675915981703264,"score_gpt":0.21808375355248175,"score_spread":0.21340783757077847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205114821","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.0013351644,0.012073082,0.009279256,0.046336465,0.25923637,0.00041720644,0.009656881,0.0016320621,0.6600335],"genre_scores_gemma":[0.0056254985,0.003963224,0.002369373,0.00700159,0.027506288,0.00019641791,0.0052237213,0.00078641006,0.94732744],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991622,0.0001349088,0.00004333848,0.00013774306,0.0004457926,0.00007602072],"domain_scores_gemma":[0.9944699,0.0008279913,0.00017828676,0.00046671907,0.0030701063,0.000987039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014127116,0.0008302357,0.0006109841,0.0030439212,0.0023778216,0.0034979375,0.0011672331,0.000991222,0.4110943],"category_scores_gemma":[0.011263264,0.0002460702,0.00048394362,0.0020090567,0.0005971179,0.002578151,0.002031837,0.002911655,0.27134565],"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.00002299948,0.000015198468,0.0000676649,0.00006459185,0.0000013682247,0.000023475997,0.0000449416,0.000043709406,0.00010293566,0.006687543,0.95997214,0.032953463],"study_design_scores_gemma":[0.0000037445354,0.0000087876615,0.00017123602,0.00008152655,0.0000014301725,0.000027104972,0.000054452204,0.000028948542,0.00008924886,0.0042900145,0.99523973,0.0000038214534],"about_ca_topic_score_codex":0.0031275249,"about_ca_topic_score_gemma":0.0046119248,"teacher_disagreement_score":0.4110943,"about_ca_system_score_codex":0.001980481,"about_ca_system_score_gemma":0.0020794729,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4205118740","doi":"10.1016/s0304-3975(04)00130-6","title":"Deletion along trajectories*1","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Decidability; Closure (psychology); Regular language; Mathematical proof; Formal language; Mathematics; Inverse; Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Algorithm; Automaton","score_opus":0.007638670920687556,"score_gpt":0.24085453925113437,"score_spread":0.2332158683304468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205118740","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.31678072,0.0005468452,0.5752911,0.0020186275,0.00077834533,0.00024048124,0.0020604124,0.0027518577,0.099531665],"genre_scores_gemma":[0.69989806,0.0009821631,0.16747846,0.0005447976,0.00017337632,0.00032898656,0.005513215,0.0021579426,0.12292304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993831,0.000082992985,0.000034775017,0.0002225683,0.00016264386,0.00011392801],"domain_scores_gemma":[0.99817896,0.00060355704,0.000227356,0.0005088845,0.00029203529,0.00018917011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043018025,0.0008226983,0.0006628652,0.0009226684,0.002103309,0.0015294016,0.0013489261,0.0012741461,0.014314682],"category_scores_gemma":[0.0033352075,0.00040998642,0.0008949251,0.0012031634,0.0012275161,0.0020496235,0.0022449787,0.0020840971,0.0051275417],"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.00037364176,0.00010072595,0.002123168,0.0002301029,0.000026249434,0.0008919136,0.00057137426,0.016247673,0.034957685,0.8669386,0.010614044,0.06692476],"study_design_scores_gemma":[0.00007501021,0.00018456126,0.0010548076,0.000095838375,0.00005757241,0.0014001068,0.0004402977,0.065571055,0.064192705,0.78347194,0.08338523,0.00007094675],"about_ca_topic_score_codex":0.0014532614,"about_ca_topic_score_gemma":0.0010930804,"teacher_disagreement_score":0.014314682,"about_ca_system_score_codex":0.00065305084,"about_ca_system_score_gemma":0.0009399801,"threshold_uncertainty_score":0.047887385},"labels":[],"label_agreement":null},{"id":"W4205165567","doi":"10.1016/s0304-3975(03)00604-2","title":"Metrics for labelled Markov processes","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bisimulation; Probabilistic logic; Mathematics; Markov process; Metric (unit); Equivalence (formal languages); Markov chain; Property (philosophy); Markov property; Stochastic process; Discrete mathematics; Markov model; Statistics","score_opus":0.021845036099777202,"score_gpt":0.30266108810126563,"score_spread":0.2808160520014884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205165567","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.064587265,0.0021074556,0.9131174,0.0015624217,0.00026290037,0.00018241222,0.0011856208,0.0005906547,0.016403884],"genre_scores_gemma":[0.7493841,0.0023455843,0.22320351,0.0005890315,0.0006654581,0.00094344415,0.0033617553,0.0007687974,0.018738344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917543,0.003227957,0.0007883123,0.0014294687,0.0021074023,0.0006925795],"domain_scores_gemma":[0.9563954,0.027855866,0.005071226,0.0025679118,0.004803852,0.0033057148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075641396,0.0018590549,0.0020527402,0.007119039,0.0022327325,0.0059192986,0.0020313428,0.0030388734,0.008251169],"category_scores_gemma":[0.047604818,0.0010735457,0.0016575127,0.004560556,0.003826613,0.015455503,0.00413591,0.0031323794,0.0009443396],"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.000044622768,0.000017262413,0.0005874812,0.000088998924,0.000024549465,0.000043362703,0.00017355554,0.009822333,0.0003850366,0.9800945,0.0008923869,0.007825967],"study_design_scores_gemma":[0.000007531869,0.000021150236,0.00023654419,0.000035447116,0.000011810775,0.00002825616,0.000027571536,0.036970902,0.00019841248,0.96045905,0.0019859043,0.000017365335],"about_ca_topic_score_codex":0.002949027,"about_ca_topic_score_gemma":0.0023059926,"teacher_disagreement_score":0.008251169,"about_ca_system_score_codex":0.006725008,"about_ca_system_score_gemma":0.0020938753,"threshold_uncertainty_score":0.048793614},"labels":[],"label_agreement":null},{"id":"W4205520528","doi":"10.1016/j.tcs.2018.07.015","title":"Complexity of proper prefix-convex regular languages","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prefix; Regular language; Mathematics; Combinatorics; Regular polygon; Prefix code; Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; Linguistics","score_opus":0.017698645149661598,"score_gpt":0.26388378525127937,"score_spread":0.24618514010161777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205520528","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.78341216,0.00058377715,0.1827426,0.0045858067,0.00007530149,0.00009191793,0.0015250196,0.0004377538,0.026545756],"genre_scores_gemma":[0.97721434,0.00031282037,0.013320711,0.00019754544,0.00015720853,0.00010417282,0.0010299418,0.00012913135,0.0075340546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966266,0.0008099352,0.0002254486,0.0006842792,0.0011394696,0.0005141784],"domain_scores_gemma":[0.9750875,0.019738866,0.0014308457,0.0014078023,0.0010765966,0.0012583496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018204491,0.0006505489,0.0015615233,0.0014620788,0.001638963,0.008368483,0.0025574786,0.0017892391,0.011323509],"category_scores_gemma":[0.017673315,0.00079336466,0.0014599785,0.0021613087,0.003948374,0.016469542,0.003398519,0.0034814486,0.0007076339],"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.0003881647,0.0000982584,0.0021638342,0.00018958923,0.000042080886,0.00026065114,0.001242621,0.0220843,0.0023038555,0.9598319,0.0016366488,0.009758124],"study_design_scores_gemma":[0.00003568403,0.000023385246,0.00053126423,0.000011096276,0.000020669415,0.0001384655,0.00016611391,0.048539545,0.00091911206,0.948891,0.0007021468,0.00002153674],"about_ca_topic_score_codex":0.0019717896,"about_ca_topic_score_gemma":0.0015674416,"teacher_disagreement_score":0.011323509,"about_ca_system_score_codex":0.003233491,"about_ca_system_score_gemma":0.001867781,"threshold_uncertainty_score":0.037880898},"labels":[],"label_agreement":null},{"id":"W4205548359","doi":"10.1016/j.tcs.2006.01.028","title":"Sequential?","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université du Québec à Montréal","keywords":"Undecidable problem; Multiplicity (mathematics); Idempotence; Semiring; Automaton; Mathematics; Series (stratigraphy); Discrete mathematics; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Decidability; Theoretical computer science; Geometry","score_opus":0.00672751249240781,"score_gpt":0.22558577782933412,"score_spread":0.21885826533692632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205548359","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.02069809,0.00074387126,0.18814155,0.009543252,0.0017300854,0.00015983812,0.0017858921,0.0020309824,0.7751665],"genre_scores_gemma":[0.46778435,0.0009242526,0.06362705,0.0031824696,0.0012133193,0.00025747795,0.0020146156,0.001410951,0.45958552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982638,0.00033998254,0.000104045605,0.0007659958,0.0003246141,0.0002015848],"domain_scores_gemma":[0.99711525,0.0008351756,0.00019031663,0.0010374339,0.0005992821,0.0002225604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011919247,0.0008122242,0.0005828439,0.00066276686,0.0016991543,0.0033151205,0.0010000317,0.0011702073,0.11176799],"category_scores_gemma":[0.0056441133,0.0005442825,0.000757942,0.0008464802,0.0027196892,0.010486874,0.0024678186,0.001918129,0.023552895],"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.00007653906,0.000021803353,0.000305537,0.00007204064,0.000009005282,0.00009584688,0.00029194774,0.00022820156,0.0006569846,0.94987166,0.021689303,0.026681153],"study_design_scores_gemma":[0.00002148063,0.000019720721,0.00017982561,0.00002832859,0.000011446517,0.00027239745,0.00021944242,0.0015201399,0.0010233611,0.8562176,0.14047438,0.000011840916],"about_ca_topic_score_codex":0.0014554441,"about_ca_topic_score_gemma":0.0013078606,"teacher_disagreement_score":0.11176799,"about_ca_system_score_codex":0.0010362314,"about_ca_system_score_gemma":0.0010879522,"threshold_uncertainty_score":0.3739012},"labels":[],"label_agreement":null},{"id":"W4205574221","doi":"10.1016/j.tcs.2016.12.016","title":"The search for a reduction in combinatory logic equivalent to λβ-reduction, Part II","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Reduction (mathematics); Mathematics; Combinatory logic; Abstraction; Arithmetic; Algorithm; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Programming language; Epistemology","score_opus":0.024488078321077935,"score_gpt":0.29311052181205216,"score_spread":0.26862244349097425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205574221","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.33968568,0.004585264,0.28506607,0.032845013,0.0015011578,0.00039855266,0.000686225,0.0014081511,0.33382392],"genre_scores_gemma":[0.84966797,0.0021287529,0.099318765,0.004474656,0.0011186325,0.00021446824,0.0013210349,0.0005821679,0.04117359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985196,0.00039467582,0.00008002391,0.00039742986,0.00034907035,0.00025919487],"domain_scores_gemma":[0.9967098,0.002390674,0.00011958827,0.00032147375,0.00025924004,0.00019924412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017411206,0.0006832455,0.0012649562,0.0015911562,0.0021953501,0.004630911,0.0017446355,0.0019353402,0.015268204],"category_scores_gemma":[0.0066126296,0.0007110518,0.0027718144,0.0015630828,0.004561911,0.0073222136,0.0027133967,0.006203123,0.0015809867],"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.0001628275,0.000085717045,0.00047169699,0.00026240977,0.000034975987,0.00016495897,0.00025443087,0.0017812994,0.002072093,0.9743344,0.0045452123,0.015830014],"study_design_scores_gemma":[0.000030037194,0.00003225331,0.00027205647,0.000039511437,0.000022801178,0.00013699403,0.00015645716,0.004081433,0.0010903421,0.98864704,0.0054782564,0.00001282214],"about_ca_topic_score_codex":0.0014832112,"about_ca_topic_score_gemma":0.0013964063,"teacher_disagreement_score":0.015268204,"about_ca_system_score_codex":0.0020581784,"about_ca_system_score_gemma":0.0017025401,"threshold_uncertainty_score":0.051077247},"labels":[],"label_agreement":null},{"id":"W4205583413","doi":"10.1016/j.tcs.2006.05.005","title":"Preface","year":2006,"lang":"en","type":"article","venue":"Theoretical 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","funders":"","keywords":"Computer science; Mathematics; Philosophy","score_opus":0.006194485593333101,"score_gpt":0.2398046339403179,"score_spread":0.2336101483469848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205583413","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.0014420764,0.01476795,0.0212117,0.04901405,0.33600843,0.00049581734,0.010056449,0.0019379859,0.56506556],"genre_scores_gemma":[0.008624749,0.007215656,0.005547315,0.008153423,0.057650056,0.0002968695,0.0074104923,0.0013474044,0.90375406],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936277,0.0001065789,0.000039179595,0.00011377129,0.0003257882,0.000051845156],"domain_scores_gemma":[0.9947514,0.0008854198,0.00015927854,0.0005463181,0.0029269198,0.0007307156],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012540121,0.0010220911,0.0006801873,0.0034782076,0.0025117,0.00299914,0.0012421038,0.0009087057,0.3299962],"category_scores_gemma":[0.010845435,0.00029737753,0.0006201545,0.002356568,0.0006494488,0.002732696,0.0017727063,0.003208773,0.2160597],"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.000021916565,0.000019550076,0.00007028258,0.00007840813,0.0000020647942,0.000025315197,0.00003766019,0.00006908831,0.00012216187,0.008279907,0.9525173,0.0387564],"study_design_scores_gemma":[0.0000046971522,0.000012546003,0.00024480943,0.00010071824,0.0000027552553,0.00003902305,0.000048054637,0.00005966084,0.00014752561,0.008312597,0.99102134,0.0000062659615],"about_ca_topic_score_codex":0.0031599891,"about_ca_topic_score_gemma":0.004157065,"teacher_disagreement_score":0.6700038,"about_ca_system_score_codex":0.0019486982,"about_ca_system_score_gemma":0.0016495915,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4205676256","doi":"10.1016/s0304-3975(04)00194-x","title":"Families of languages defined by ciliate bio-operations*1","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Protist diversity and phylogeny","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Inversion (geology); Closure (psychology); Computer science; Ciliate; Closed loop; Mathematics; Biology; Combinatorics; Genetics; Programming language; Algorithm; Engineering","score_opus":0.004414630226866611,"score_gpt":0.22343872126900008,"score_spread":0.21902409104213347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205676256","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.5944932,0.0015572482,0.34537005,0.0014163202,0.00025204214,0.00022135841,0.0031842282,0.0022337981,0.051271807],"genre_scores_gemma":[0.93570286,0.0005319424,0.05506838,0.0003819001,0.00009270478,0.0003537588,0.002061825,0.00030571828,0.0055009723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987494,0.00026476322,0.0001439247,0.00030036244,0.000264558,0.00027699702],"domain_scores_gemma":[0.9964245,0.001895447,0.00044221227,0.00037111336,0.0005562614,0.00031041235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008346381,0.00047497108,0.0005040168,0.0023420078,0.0022301471,0.0033793,0.0009502002,0.0010239625,0.0038936592],"category_scores_gemma":[0.0035252823,0.00054237107,0.0011191831,0.0016947573,0.0019701405,0.0035485546,0.0016765536,0.0015110018,0.0008927669],"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.00011234938,0.000037850048,0.0027575628,0.00012960298,0.000025872143,0.00043953475,0.00231078,0.0011850615,0.0069995164,0.9602352,0.0026240852,0.023142504],"study_design_scores_gemma":[0.000032110976,0.00007582816,0.0029170199,0.00012195688,0.000060860068,0.0016880764,0.0017491749,0.013460086,0.0062965616,0.9441705,0.0293467,0.00008110185],"about_ca_topic_score_codex":0.00072727585,"about_ca_topic_score_gemma":0.0007271081,"teacher_disagreement_score":0.0038936592,"about_ca_system_score_codex":0.0010639,"about_ca_system_score_gemma":0.0010607152,"threshold_uncertainty_score":0.013025641},"labels":[],"label_agreement":null},{"id":"W4206036020","doi":"10.1016/j.tcs.2018.09.026","title":"Bounded disagreement","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bounded function; Mathematics; Impossibility; Task (project management); Set (abstract data type); Generalization; Object (grammar); Limit (mathematics); Discrete mathematics; Value (mathematics); Uniform consensus; Combinatorics; Consensus; Computer science; Artificial intelligence; Statistics; Multi-agent system","score_opus":0.009824130688016975,"score_gpt":0.2601939464758559,"score_spread":0.25036981578783896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206036020","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.04295195,0.0017655417,0.32307968,0.021524271,0.0012177248,0.0001576252,0.0012495448,0.000797417,0.60725623],"genre_scores_gemma":[0.85556746,0.0006169032,0.028634524,0.0040842844,0.001116083,0.00037124014,0.0012489146,0.0005199743,0.10784064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908875,0.003709009,0.00051178,0.0017445281,0.002226162,0.00092101685],"domain_scores_gemma":[0.9699827,0.017970461,0.0010521371,0.005152106,0.004170554,0.0016720043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006384805,0.00084711605,0.001739756,0.0021779651,0.004550879,0.006138729,0.0025269997,0.0038953458,0.041296363],"category_scores_gemma":[0.04647301,0.00070268416,0.0015061169,0.001852346,0.0062146415,0.013964441,0.006708908,0.0073294574,0.0053301724],"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.00002926339,0.000008555214,0.000078438985,0.000025310794,0.0000077047425,0.000022101049,0.00014010291,0.0002758468,0.00008435193,0.9936056,0.0029716669,0.0027510396],"study_design_scores_gemma":[0.000008276056,0.0000029177388,0.000035294932,0.000009488808,0.0000034466718,0.00001810248,0.000047413283,0.0013115982,0.00006643631,0.9953548,0.0031388968,0.000003185034],"about_ca_topic_score_codex":0.0012918438,"about_ca_topic_score_gemma":0.00096818944,"teacher_disagreement_score":0.041296363,"about_ca_system_score_codex":0.003145934,"about_ca_system_score_gemma":0.0018152196,"threshold_uncertainty_score":0.1381501},"labels":[],"label_agreement":null},{"id":"W4206036233","doi":"10.1016/s0304-3975(04)00125-2","title":"Packing arrays","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Alphabet; Disjoint sets; Upper and lower bounds; Row; Packing problems; Set (abstract data type); Row and column spaces; Equivalence (formal languages); Class (philosophy); Matching (statistics); Discrete mathematics; Computer science","score_opus":0.005519304663409126,"score_gpt":0.19487625343632034,"score_spread":0.1893569487729112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206036233","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.0756596,0.0018055161,0.5212143,0.0012551778,0.0015513308,0.00019612284,0.00148073,0.004543788,0.39229333],"genre_scores_gemma":[0.6026168,0.0018798774,0.19648638,0.0015767686,0.0009865585,0.0004485144,0.0038004369,0.001488273,0.19071639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992423,0.0001364763,0.000039117374,0.00017387698,0.0002688779,0.00013947404],"domain_scores_gemma":[0.99887925,0.00027229363,0.000098868426,0.0004085363,0.00022563174,0.00011541607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023443202,0.0008524022,0.0009896858,0.0015979671,0.0013387653,0.0024160396,0.0008785932,0.001262414,0.047024433],"category_scores_gemma":[0.0021117267,0.000669764,0.00054296275,0.0024514345,0.0006175596,0.002599407,0.0020867148,0.0015772338,0.016578121],"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.0005028359,0.000214756,0.00067792437,0.00027256008,0.00004923632,0.00034107087,0.00024629507,0.017883811,0.04054887,0.6137228,0.054748956,0.27079096],"study_design_scores_gemma":[0.00010797036,0.00035504324,0.0010507362,0.0001020615,0.00006171074,0.0012428489,0.00033415022,0.138679,0.0666508,0.6162025,0.17512347,0.000089796384],"about_ca_topic_score_codex":0.00023565607,"about_ca_topic_score_gemma":0.00029146424,"teacher_disagreement_score":0.047024433,"about_ca_system_score_codex":0.00048575507,"about_ca_system_score_gemma":0.00035501225,"threshold_uncertainty_score":0.1573124},"labels":[],"label_agreement":null},{"id":"W4206081855","doi":"10.1016/j.tcs.2015.10.044","title":"Preface","year":2015,"lang":"en","type":"article","venue":"Theoretical 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":"University of Regina; Simon Fraser University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.028209863694724245,"score_gpt":0.2886773331008409,"score_spread":0.2604674694061167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206081855","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.0015248113,0.01644831,0.024975892,0.055189714,0.3501654,0.00048508157,0.011406666,0.0020780652,0.5377261],"genre_scores_gemma":[0.010984067,0.008877981,0.007338087,0.010759075,0.07333397,0.0003754498,0.009224247,0.0017469007,0.87736017],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928766,0.00012256551,0.000043765263,0.00012846164,0.0003613322,0.000056286848],"domain_scores_gemma":[0.99415994,0.0010792793,0.0001819423,0.0006045058,0.0032090875,0.0007653215],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001310416,0.0010669037,0.0006905622,0.0035469667,0.002545507,0.0029839452,0.0012387979,0.0009336153,0.32202798],"category_scores_gemma":[0.012890125,0.00030144953,0.0006441051,0.002426586,0.0007070256,0.0027776684,0.0018933754,0.0035089816,0.21640685],"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.000021369602,0.000019543255,0.000072333605,0.00008703764,0.0000022888846,0.000027150854,0.00004153128,0.000076996446,0.000121244404,0.009765997,0.951889,0.037875604],"study_design_scores_gemma":[0.0000049732926,0.0000124467615,0.00024309076,0.00011926594,0.0000030107497,0.000044709504,0.000052436768,0.000064491745,0.00015500523,0.010880269,0.98841304,0.0000073687606],"about_ca_topic_score_codex":0.003159064,"about_ca_topic_score_gemma":0.004193716,"teacher_disagreement_score":0.677972,"about_ca_system_score_codex":0.0020317305,"about_ca_system_score_gemma":0.0017506424,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4206154636","doi":"10.1016/j.tcs.2010.12.052","title":"Preface","year":2010,"lang":"en","type":"article","venue":"Theoretical 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":"University of Regina","funders":"","keywords":"Mathematics; Philosophy; Computer science","score_opus":0.006793216343050369,"score_gpt":0.2597232525758913,"score_spread":0.25293003623284094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206154636","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.0014731189,0.016278805,0.023285668,0.05250172,0.34529188,0.0004649254,0.009890289,0.0018974511,0.54891616],"genre_scores_gemma":[0.010020168,0.00857511,0.0065135476,0.009346939,0.06678206,0.00032257207,0.0077371276,0.0014919735,0.8892104],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933285,0.00011320834,0.00004124182,0.000120215685,0.00033906839,0.000053392363],"domain_scores_gemma":[0.99474156,0.00093539944,0.00015963707,0.00054920034,0.0029083025,0.00070583046],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001274418,0.0010494236,0.0006859246,0.0034613947,0.0025448971,0.002967533,0.0012486356,0.00092821644,0.3111632],"category_scores_gemma":[0.011265214,0.0002993003,0.0006345868,0.0024314749,0.0006934528,0.0028111741,0.0018052781,0.0034082523,0.20316406],"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.000022148286,0.000019860508,0.00007204111,0.00008527438,0.0000022519255,0.000026633637,0.000041238516,0.00007597282,0.00012761878,0.009844862,0.9498824,0.039799746],"study_design_scores_gemma":[0.0000047298026,0.00001261579,0.0002422613,0.00010651759,0.0000029432501,0.000042230193,0.000050568327,0.00006261434,0.00015292801,0.009818983,0.9894967,0.0000067502738],"about_ca_topic_score_codex":0.0031470084,"about_ca_topic_score_gemma":0.0041244323,"teacher_disagreement_score":0.6888368,"about_ca_system_score_codex":0.0019966168,"about_ca_system_score_gemma":0.0016782688,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4206231269","doi":"10.1016/j.tcs.2012.12.010","title":"Preface","year":2012,"lang":"en","type":"article","venue":"Theoretical 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é de Montréal","funders":"","keywords":"Mathematics; Computer science","score_opus":0.01422251860748348,"score_gpt":0.2759455894990075,"score_spread":0.261723070891524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206231269","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.0014977411,0.016062737,0.023821186,0.053392336,0.3451142,0.00047633031,0.010225087,0.0019483814,0.54746217],"genre_scores_gemma":[0.010390359,0.008477664,0.0068204054,0.010022995,0.068597645,0.00034571532,0.008149135,0.0015825941,0.8856135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929714,0.00012065633,0.000042901298,0.00012635453,0.00035657562,0.00005636328],"domain_scores_gemma":[0.99450976,0.0009824114,0.00016868523,0.0005787283,0.003036003,0.00072448776],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013065297,0.0010657817,0.0006859181,0.0034800326,0.0026128017,0.003010478,0.0012580599,0.00094373117,0.3114037],"category_scores_gemma":[0.011986958,0.00030086294,0.000653401,0.0023973137,0.0007128844,0.0028234127,0.0018839199,0.0035220275,0.2049275],"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.000022353463,0.00002039596,0.00007405878,0.00008703152,0.0000023170942,0.000028131586,0.00004320939,0.00007879622,0.00012668301,0.010382402,0.9498642,0.039270338],"study_design_scores_gemma":[0.000004813008,0.000012703185,0.00024430247,0.000112601796,0.0000029503879,0.000043783104,0.00005257963,0.00006351163,0.00015466381,0.010464729,0.9888362,0.000007158856],"about_ca_topic_score_codex":0.0032733106,"about_ca_topic_score_gemma":0.0042203125,"teacher_disagreement_score":0.6885963,"about_ca_system_score_codex":0.0020401506,"about_ca_system_score_gemma":0.0017429861,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4206300419","doi":"10.1016/j.tcs.2012.10.017","title":"Preface","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"","field":"","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics","score_opus":0.01422251860748348,"score_gpt":0.2759455894990075,"score_spread":0.261723070891524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206300419","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.0014977411,0.016062737,0.023821186,0.053392336,0.3451142,0.00047633031,0.010225087,0.0019483814,0.54746217],"genre_scores_gemma":[0.010390359,0.008477664,0.0068204054,0.010022995,0.068597645,0.00034571532,0.008149135,0.0015825941,0.8856135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929714,0.00012065633,0.000042901298,0.00012635453,0.00035657562,0.00005636328],"domain_scores_gemma":[0.99450976,0.0009824114,0.00016868523,0.0005787283,0.003036003,0.00072448776],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013065297,0.0010657817,0.0006859181,0.0034800326,0.0026128017,0.003010478,0.0012580599,0.00094373117,0.3114037],"category_scores_gemma":[0.011986958,0.00030086294,0.000653401,0.0023973137,0.0007128844,0.0028234127,0.0018839199,0.0035220275,0.2049275],"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.000022353463,0.00002039596,0.00007405878,0.00008703152,0.0000023170942,0.000028131586,0.00004320939,0.00007879622,0.00012668301,0.010382402,0.9498642,0.039270338],"study_design_scores_gemma":[0.000004813008,0.000012703185,0.00024430247,0.000112601796,0.0000029503879,0.000043783104,0.00005257963,0.00006351163,0.00015466381,0.010464729,0.9888362,0.000007158856],"about_ca_topic_score_codex":0.0032733106,"about_ca_topic_score_gemma":0.0042203125,"teacher_disagreement_score":0.6885963,"about_ca_system_score_codex":0.0020401506,"about_ca_system_score_gemma":0.0017429861,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4206524171","doi":"10.1016/j.tcs.2018.07.013","title":"How to choose friends strategically","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Viral marketing; Product (mathematics); Set (abstract data type); Maximization; Computer science; Join (topology); Social network (sociolinguistics); Combinatorics; Alice (programming language); Time complexity; Mathematics; Contrast (vision); Discrete mathematics; Mathematical optimization; Artificial intelligence; Graph; Social media; World Wide Web","score_opus":0.009369950261705692,"score_gpt":0.2678645503272397,"score_spread":0.25849460006553404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206524171","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.5628956,0.0008402894,0.17011419,0.03277254,0.00069530593,0.00038591967,0.000930553,0.0007325145,0.23063311],"genre_scores_gemma":[0.9560008,0.00015899412,0.015504847,0.0006408385,0.00006945918,0.000079092446,0.00017341404,0.00008663292,0.027285932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874866,0.00059793156,0.000038655704,0.0002410196,0.00019507085,0.00017861811],"domain_scores_gemma":[0.99415636,0.003208975,0.00029107233,0.00085882196,0.0005879461,0.0008967797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013622222,0.00031003833,0.0005502263,0.000482087,0.0015883431,0.0023473161,0.0010939268,0.0020916446,0.025893413],"category_scores_gemma":[0.0123645775,0.00029365014,0.00042097393,0.0005989082,0.0007996545,0.005182856,0.0013923773,0.0019807364,0.0049363803],"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.0016421484,0.0009619496,0.026048528,0.0004348912,0.00029577367,0.0008023287,0.003869113,0.023032714,0.010890319,0.58866495,0.071539536,0.2718177],"study_design_scores_gemma":[0.00024769004,0.00030022077,0.005931412,0.00010561982,0.00021938412,0.00058859773,0.0096039,0.17264952,0.008594557,0.7368856,0.06475527,0.00011808402],"about_ca_topic_score_codex":0.0017210576,"about_ca_topic_score_gemma":0.0042583803,"teacher_disagreement_score":0.025893413,"about_ca_system_score_codex":0.00056241604,"about_ca_system_score_gemma":0.0009694282,"threshold_uncertainty_score":0.08662212},"labels":[],"label_agreement":null},{"id":"W4206956776","doi":"10.1016/j.tcs.2017.03.001","title":"Specular sets","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Conseil Régional, Île-de-France; Agence Nationale de la Recherche","keywords":"Generalization; Cardinality (data modeling); Specular reflection; Mathematics; Set (abstract data type); Combinatorics; Interval (graph theory); Natural (archaeology); Group (periodic table); Discrete mathematics; Computer science; Geography; Data mining; Mathematical analysis","score_opus":0.011435490035065918,"score_gpt":0.26523298001445667,"score_spread":0.2537974899793907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206956776","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.116838574,0.0015500757,0.299118,0.0035964309,0.0007187217,0.00012971763,0.002121077,0.0015710362,0.5743563],"genre_scores_gemma":[0.789759,0.0012062228,0.040399257,0.0012045199,0.00068061246,0.0001638961,0.003080007,0.0006868166,0.16281977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882287,0.00022080299,0.00007659934,0.0003353244,0.00033807187,0.00020634578],"domain_scores_gemma":[0.99819523,0.0005945989,0.00014230791,0.00042339702,0.00045342869,0.00019102199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008052932,0.00090119295,0.00088039227,0.001789527,0.0028342018,0.0047931285,0.0008886614,0.00092558865,0.028350785],"category_scores_gemma":[0.002720415,0.0005817442,0.0009441157,0.0020441583,0.0030163086,0.009871714,0.003293421,0.002617691,0.0064427922],"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.000023678387,0.0000107230735,0.00008941355,0.000022954344,0.000003835723,0.00003481294,0.00012607109,0.00014028465,0.00040240245,0.988967,0.0028810522,0.0072977534],"study_design_scores_gemma":[0.000008366359,0.000010678533,0.00010394022,0.000011890541,0.0000068930935,0.00012433456,0.00011843107,0.0009259388,0.000708559,0.9791296,0.018843768,0.000007584566],"about_ca_topic_score_codex":0.00048020683,"about_ca_topic_score_gemma":0.00043427292,"teacher_disagreement_score":0.028350785,"about_ca_system_score_codex":0.0011477651,"about_ca_system_score_gemma":0.0007989545,"threshold_uncertainty_score":0.09484285},"labels":[],"label_agreement":null},{"id":"W4210459942","doi":"10.1016/j.tcs.2008.02.008","title":"On fractional dynamic faults with thresholds","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","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":"Carleton University","funders":"","keywords":"Computer science; Hypercube; Broadcasting (networking); Chordal graph; Simple (philosophy); Time complexity; Constant (computer programming); Set (abstract data type); Enhanced Data Rates for GSM Evolution; Focus (optics); Theoretical computer science; Leader election; Distributed computing; Topology (electrical circuits); Computer network; Algorithm; Mathematics; Graph; Combinatorics; Parallel computing; Telecommunications","score_opus":0.007390070477403671,"score_gpt":0.23384963839680353,"score_spread":0.22645956791939986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210459942","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.3768953,0.0035717,0.529526,0.0049927835,0.0013734496,0.00007013306,0.0001956033,0.00062570104,0.0827494],"genre_scores_gemma":[0.9816383,0.0006719112,0.009500572,0.00033541827,0.00026330547,0.00002699981,0.000058108573,0.0000798127,0.0074255224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993248,0.00014599194,0.00003200882,0.00008986758,0.00022395095,0.00018339753],"domain_scores_gemma":[0.99524707,0.0031782922,0.00033090054,0.0005318003,0.00042718195,0.00028477027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000937633,0.0007268244,0.00088076486,0.0019063406,0.0011086124,0.0019872133,0.0010223162,0.0014027,0.005180706],"category_scores_gemma":[0.009348252,0.00031670672,0.00043023808,0.001437756,0.0029393225,0.004344052,0.0025486457,0.0019564377,0.0002982947],"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.00022278965,0.000030602147,0.00038227174,0.00007270917,0.000011130838,0.00021875175,0.00020846065,0.039464954,0.002657948,0.93885714,0.0016561984,0.016216952],"study_design_scores_gemma":[0.000021532682,0.000029686009,0.00017328474,0.000024610988,0.000010990174,0.00013085722,0.000079243815,0.11415291,0.0011552543,0.88272136,0.0014857997,0.000014389318],"about_ca_topic_score_codex":0.0010860943,"about_ca_topic_score_gemma":0.0005149988,"teacher_disagreement_score":0.005180706,"about_ca_system_score_codex":0.0016250313,"about_ca_system_score_gemma":0.00053838495,"threshold_uncertainty_score":0.017331243},"labels":[],"label_agreement":null},{"id":"W4210962357","doi":"10.1016/j.tcs.2010.12.002","title":"Preface","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.0060113087908003175,"score_gpt":0.244440654640883,"score_spread":0.23842934585008269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210962357","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.001633344,0.012606269,0.012728129,0.046595316,0.298755,0.0004997915,0.009522593,0.0016409256,0.61601865],"genre_scores_gemma":[0.007423093,0.0045761447,0.0032507773,0.007514316,0.034696266,0.00023727113,0.005298616,0.00084334944,0.93616015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992834,0.00010495423,0.000039870756,0.00012598917,0.00038151455,0.00006425312],"domain_scores_gemma":[0.9949957,0.000693568,0.00016433295,0.0004286961,0.0028657892,0.0008519422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012936784,0.0008543403,0.00059676915,0.0028180745,0.0023903113,0.0031082397,0.0011418577,0.0009297219,0.38139856],"category_scores_gemma":[0.010817015,0.00023648032,0.00047742474,0.001622078,0.00056755287,0.0022291574,0.001964637,0.0027555434,0.24360858],"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.000024081823,0.000019713241,0.00008979718,0.000068443274,0.0000016086555,0.000031476713,0.000050987634,0.00006563495,0.00012576835,0.0074822563,0.9521368,0.039903566],"study_design_scores_gemma":[0.0000038677485,0.000009910949,0.00019036084,0.0000819016,0.0000015947223,0.00003139985,0.000055007426,0.000038913146,0.00010474815,0.004607018,0.99487126,0.000004058328],"about_ca_topic_score_codex":0.0034125794,"about_ca_topic_score_gemma":0.004973599,"teacher_disagreement_score":0.38139856,"about_ca_system_score_codex":0.0020171239,"about_ca_system_score_gemma":0.0020919023,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4210967890","doi":"10.1016/s0304-3975(01)00052-4","title":"Foreword","year":2002,"lang":"en","type":"article","venue":"Theoretical 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":"Carleton University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.018197191207315742,"score_gpt":0.24800933253625662,"score_spread":0.22981214132894087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210967890","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.00051402155,0.01741822,0.0045272284,0.1257169,0.40281236,0.00018900618,0.002027401,0.0008641409,0.44593072],"genre_scores_gemma":[0.003500173,0.0061981906,0.0011297818,0.031704195,0.061162043,0.00014077328,0.0013475452,0.0006595725,0.8941578],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927527,0.00011114704,0.00004319541,0.00012334905,0.00036010233,0.00008684883],"domain_scores_gemma":[0.99678266,0.0005743175,0.0001463466,0.00030054586,0.0015923413,0.0006036685],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010070187,0.0010442322,0.0009164482,0.001997013,0.002066359,0.0039346335,0.0012338908,0.002614383,0.27224484],"category_scores_gemma":[0.0062807226,0.0002716056,0.0006234834,0.0012873858,0.0008782776,0.0032213952,0.001992647,0.003907133,0.270635],"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.0000116558585,0.0000064386213,0.000018326295,0.000061196806,0.000001459205,0.000012410697,0.000010222322,0.000009329356,0.000081338076,0.0048872405,0.97269416,0.022206167],"study_design_scores_gemma":[0.0000042564334,0.000009217073,0.00009587992,0.00008723225,0.0000030803126,0.00003389561,0.000017350232,0.000019240153,0.00009816704,0.0037342396,0.9958942,0.0000031985858],"about_ca_topic_score_codex":0.0019377716,"about_ca_topic_score_gemma":0.0030958564,"teacher_disagreement_score":0.7277552,"about_ca_system_score_codex":0.0018071737,"about_ca_system_score_gemma":0.0018801634,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211000163","doi":"10.1016/s0304-3975(00)00130-4","title":"Foreword","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"","field":"","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science; Philosophy","score_opus":0.012961758910863156,"score_gpt":0.27070829004078895,"score_spread":0.2577465311299258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211000163","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.0004918536,0.017006893,0.0045887837,0.1245087,0.40228552,0.00018943218,0.0020763518,0.00088657654,0.44796586],"genre_scores_gemma":[0.0034265583,0.0061383997,0.0011500113,0.031147512,0.061216284,0.0001438073,0.0014258453,0.0006772284,0.89467424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992398,0.000118367185,0.00004570038,0.00012610063,0.00038016646,0.00008992457],"domain_scores_gemma":[0.99653,0.0006205201,0.00015630721,0.00032287135,0.0017377759,0.0006325808],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010360641,0.0010341125,0.00091625657,0.0020704828,0.002071152,0.0039734584,0.0012477172,0.0026029043,0.28272197],"category_scores_gemma":[0.0066753877,0.0002765128,0.00062848505,0.0013518352,0.000882992,0.0032665734,0.0020213653,0.0039057136,0.28453115],"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.000011152815,0.000006003035,0.000017704919,0.000059462756,0.0000013948631,0.000011718854,0.000009793887,0.000008952116,0.00007638454,0.004513996,0.9739008,0.021382697],"study_design_scores_gemma":[0.0000041951325,0.000008834264,0.000094990595,0.000087322784,0.000003022214,0.000032849417,0.000017423332,0.000018792747,0.000095740455,0.0035678355,0.9960658,0.0000031847205],"about_ca_topic_score_codex":0.0019871132,"about_ca_topic_score_gemma":0.0032113271,"teacher_disagreement_score":0.717278,"about_ca_system_score_codex":0.0018182071,"about_ca_system_score_gemma":0.0018999858,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211066449","doi":"10.1016/j.tcs.2008.02.002","title":"Preface","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"","field":"","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mathematics","score_opus":0.017120368114107443,"score_gpt":0.2562859153566268,"score_spread":0.23916554724251937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211066449","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.0014462809,0.015286064,0.023013093,0.051554933,0.33379614,0.00046728592,0.009821837,0.0019303765,0.562684],"genre_scores_gemma":[0.009520917,0.007952598,0.0062559093,0.008981848,0.062868744,0.00031374936,0.007691528,0.0014849524,0.89492977],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993388,0.00011282714,0.000040278588,0.00011944137,0.00033532648,0.000053337717],"domain_scores_gemma":[0.99478334,0.0009360562,0.0001579043,0.00055261276,0.0028639839,0.0007059719],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012711649,0.0010408439,0.00069431873,0.003450766,0.0025342565,0.0030071507,0.0012550427,0.00092620566,0.31991446],"category_scores_gemma":[0.011175386,0.00030484368,0.0006319923,0.0023964515,0.0006899386,0.0028281654,0.0018038026,0.0034128616,0.21022491],"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.000020976153,0.00001897687,0.00006834551,0.0000799626,0.0000021348162,0.000024832994,0.000039316637,0.000072187446,0.000120474004,0.009607904,0.9518627,0.03808232],"study_design_scores_gemma":[0.000004775749,0.000012429431,0.00023964241,0.000106055275,0.000002887049,0.000041033185,0.000050360566,0.00006400775,0.000150256,0.009883705,0.9894382,0.000006703225],"about_ca_topic_score_codex":0.0030377256,"about_ca_topic_score_gemma":0.0039906804,"teacher_disagreement_score":0.68008554,"about_ca_system_score_codex":0.0019787806,"about_ca_system_score_gemma":0.0016441451,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211072247","doi":"10.1016/j.tcs.2007.04.022","title":"Preface","year":2007,"lang":"en","type":"article","venue":"Theoretical 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 en Outaouais","funders":"","keywords":"Mathematics; Computer science; Philosophy","score_opus":0.01017389285586698,"score_gpt":0.28046535832560554,"score_spread":0.27029146546973853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211072247","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.0014625756,0.014980495,0.022661263,0.0510436,0.33091724,0.00048425214,0.010346015,0.0019803524,0.5661242],"genre_scores_gemma":[0.009136076,0.007549262,0.0060528163,0.008640138,0.05925388,0.0003104425,0.007801517,0.001451453,0.89980435],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934906,0.00010930949,0.000039470902,0.00011847206,0.00033087877,0.000052853073],"domain_scores_gemma":[0.9947649,0.0009179111,0.00015891081,0.00054558535,0.0028930565,0.00071968284],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012467003,0.001038445,0.00068949687,0.0034221772,0.002505493,0.0030061302,0.0012439188,0.0009224895,0.33238134],"category_scores_gemma":[0.011115313,0.000300809,0.00062897697,0.002335747,0.0006694066,0.0027833064,0.00180163,0.0033140003,0.21870334],"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.000021516493,0.000019272056,0.00006926698,0.00007970375,0.0000021146104,0.000025496724,0.000038609025,0.000070350456,0.00012245141,0.009114224,0.9516939,0.038743075],"study_design_scores_gemma":[0.0000047731423,0.000012435126,0.00023840152,0.00010531412,0.000002832295,0.000041004252,0.000049463353,0.0000616643,0.00015061701,0.0093419505,0.989985,0.000006612577],"about_ca_topic_score_codex":0.0030228484,"about_ca_topic_score_gemma":0.0040426427,"teacher_disagreement_score":0.66761863,"about_ca_system_score_codex":0.0019505918,"about_ca_system_score_gemma":0.0016442094,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211076574","doi":"10.1016/j.tcs.2007.03.036","title":"Foreword","year":2007,"lang":"en","type":"article","venue":"Theoretical 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":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science","score_opus":0.010467206674651683,"score_gpt":0.28121235236990577,"score_spread":0.2707451456952541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211076574","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.00045837494,0.020384368,0.0045063654,0.14837402,0.47987497,0.00015442066,0.0017697506,0.0007364175,0.34374124],"genre_scores_gemma":[0.0044329884,0.008836496,0.0014566049,0.04789452,0.09721796,0.00016849916,0.0014537614,0.0008082809,0.8377309],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999164,0.00013180423,0.000050022525,0.00014624253,0.0004107051,0.00009726785],"domain_scores_gemma":[0.9963284,0.00069896906,0.0001638387,0.00032780913,0.0018230161,0.0006579637],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001125565,0.0010466813,0.0009093756,0.0019685267,0.0020452403,0.003891829,0.0013038962,0.00276998,0.23436427],"category_scores_gemma":[0.0074287034,0.00026999658,0.0006441023,0.0012467437,0.0010037443,0.003314027,0.0020992714,0.0044908547,0.228161],"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.00001106535,0.000005753525,0.00001749607,0.00006480183,0.0000015770024,0.00001277106,0.000010224187,0.000009766255,0.0000752522,0.005321605,0.9736921,0.020777594],"study_design_scores_gemma":[0.000004304924,0.000009128164,0.000087670785,0.000102475446,0.00000325108,0.0000395727,0.000016916456,0.000020128293,0.00009889086,0.0044897376,0.9951244,0.000003547793],"about_ca_topic_score_codex":0.0018732402,"about_ca_topic_score_gemma":0.0029047704,"teacher_disagreement_score":0.7656357,"about_ca_system_score_codex":0.0019845087,"about_ca_system_score_gemma":0.0020862839,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211137933","doi":"10.1016/j.tcs.2013.09.017","title":"Preface","year":2013,"lang":"en","type":"article","venue":"Theoretical 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":"University of Alberta","funders":"","keywords":"Computer science; Mathematics","score_opus":0.00829221122938674,"score_gpt":0.24383633507699598,"score_spread":0.23554412384760925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211137933","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.0015430705,0.016118418,0.02588402,0.054554317,0.33979788,0.00048415142,0.011163953,0.0020831483,0.54837096],"genre_scores_gemma":[0.011081142,0.0087883845,0.007488043,0.010375691,0.06967585,0.000372748,0.009072755,0.0017456799,0.8813998],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927276,0.00012599709,0.000044162247,0.00013145604,0.00036791293,0.000057685724],"domain_scores_gemma":[0.9942964,0.0010581426,0.00017642963,0.00060112774,0.003132013,0.00073599856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013121527,0.0010689476,0.0006971655,0.003520366,0.002586573,0.0029960177,0.0012637904,0.0009400827,0.3170182],"category_scores_gemma":[0.012674761,0.00030360057,0.00065047824,0.002433502,0.00072670326,0.00284896,0.0019010243,0.0035571677,0.21155578],"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.000022138458,0.000019968526,0.00007396939,0.00008906395,0.000002358766,0.000027951706,0.00004456441,0.00007839018,0.00012671862,0.010727407,0.9500161,0.03877137],"study_design_scores_gemma":[0.000004899634,0.00001258644,0.00024115523,0.00011721256,0.0000030408016,0.00004556979,0.00005444646,0.0000649209,0.00015934372,0.011273578,0.98801595,0.0000074558393],"about_ca_topic_score_codex":0.0031398465,"about_ca_topic_score_gemma":0.0040907264,"teacher_disagreement_score":0.3170182,"about_ca_system_score_codex":0.002031104,"about_ca_system_score_gemma":0.0017491482,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211175028","doi":"10.1016/j.tcs.2007.03.016","title":"Preface","year":2007,"lang":"en","type":"article","venue":"Theoretical 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.01017389285586698,"score_gpt":0.28046535832560554,"score_spread":0.27029146546973853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211175028","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.0014625756,0.014980495,0.022661263,0.0510436,0.33091724,0.00048425214,0.010346015,0.0019803524,0.5661242],"genre_scores_gemma":[0.009136076,0.007549262,0.0060528163,0.008640138,0.05925388,0.0003104425,0.007801517,0.001451453,0.89980435],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934906,0.00010930949,0.000039470902,0.00011847206,0.00033087877,0.000052853073],"domain_scores_gemma":[0.9947649,0.0009179111,0.00015891081,0.00054558535,0.0028930565,0.00071968284],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012467003,0.001038445,0.00068949687,0.0034221772,0.002505493,0.0030061302,0.0012439188,0.0009224895,0.33238134],"category_scores_gemma":[0.011115313,0.000300809,0.00062897697,0.002335747,0.0006694066,0.0027833064,0.00180163,0.0033140003,0.21870334],"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.000021516493,0.000019272056,0.00006926698,0.00007970375,0.0000021146104,0.000025496724,0.000038609025,0.000070350456,0.00012245141,0.009114224,0.9516939,0.038743075],"study_design_scores_gemma":[0.0000047731423,0.000012435126,0.00023840152,0.00010531412,0.000002832295,0.000041004252,0.000049463353,0.0000616643,0.00015061701,0.0093419505,0.989985,0.000006612577],"about_ca_topic_score_codex":0.0030228484,"about_ca_topic_score_gemma":0.0040426427,"teacher_disagreement_score":0.66761863,"about_ca_system_score_codex":0.0019505918,"about_ca_system_score_gemma":0.0016442094,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211219205","doi":"10.1016/j.tcs.2009.05.015","title":"Preface","year":2009,"lang":"en","type":"article","venue":"Theoretical 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":"University of Prince Edward Island","funders":"","keywords":"Mathematics; Computer science","score_opus":0.00905714772692766,"score_gpt":0.2675520916150978,"score_spread":0.2584949438881701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211219205","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.0014770417,0.016104141,0.02350399,0.051995367,0.3418372,0.0004658579,0.009851505,0.001901857,0.552863],"genre_scores_gemma":[0.009911423,0.008375086,0.0063338713,0.008897133,0.06446033,0.00031522263,0.0076008695,0.0014740643,0.89263195],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993293,0.000113171234,0.000041047835,0.00012144165,0.00034166218,0.000053313615],"domain_scores_gemma":[0.9947857,0.0009284003,0.00015738899,0.0005477361,0.0028765975,0.00070420845],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012740296,0.0010393491,0.0006931079,0.0034928718,0.0025386733,0.0029865748,0.0012464705,0.0009190229,0.31324512],"category_scores_gemma":[0.011282769,0.00030082796,0.0006339179,0.0024205407,0.0006942701,0.0028153611,0.0018270975,0.0034185331,0.20428888],"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.000021290029,0.000019514891,0.000070933944,0.00008305208,0.0000022325967,0.000026080039,0.000041597323,0.00007579073,0.00012457883,0.009984058,0.95001364,0.03953734],"study_design_scores_gemma":[0.0000047296935,0.000012408228,0.00024057798,0.00010826433,0.0000029792188,0.00004190542,0.000050876595,0.00006416308,0.00015184688,0.010087959,0.98922753,0.0000068440886],"about_ca_topic_score_codex":0.0031109657,"about_ca_topic_score_gemma":0.0040582754,"teacher_disagreement_score":0.6867549,"about_ca_system_score_codex":0.002023132,"about_ca_system_score_gemma":0.001669173,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211221730","doi":"10.1016/j.tcs.2008.06.018","title":"Foreword","year":2008,"lang":"en","type":"article","venue":"Theoretical 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":"McGill University","funders":"","keywords":"Mathematics; Philosophy; Computer science","score_opus":0.017611793333206265,"score_gpt":0.25693902478430847,"score_spread":0.2393272314511022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211221730","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.00046791672,0.019579122,0.004472018,0.15146536,0.4710319,0.00014843621,0.001707649,0.00072241406,0.35040522],"genre_scores_gemma":[0.0046842815,0.008586462,0.0014707127,0.049585756,0.097923845,0.00016747929,0.0014398738,0.00080320396,0.83533835],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914587,0.00013731429,0.00005095511,0.00014826925,0.00041800787,0.000099448],"domain_scores_gemma":[0.9963283,0.0007072622,0.00016404099,0.00033321817,0.0018158288,0.00065138895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011416934,0.0010218229,0.00090178306,0.0019409003,0.0020791206,0.00391734,0.0012946281,0.002767038,0.22850394],"category_scores_gemma":[0.0074701407,0.00026866107,0.0006363113,0.0012461869,0.0010279214,0.0033666221,0.002115624,0.004603839,0.22168316],"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.000011080832,0.0000056454223,0.000017854934,0.000064246364,0.0000015741792,0.000012787062,0.000010930638,0.000009584743,0.00007577185,0.0056980904,0.973955,0.020137377],"study_design_scores_gemma":[0.0000042999195,0.000009048696,0.000089178386,0.000100533776,0.0000032141272,0.000039641833,0.000018078907,0.00002053573,0.00009835788,0.0046948204,0.99491876,0.0000035456696],"about_ca_topic_score_codex":0.0018746154,"about_ca_topic_score_gemma":0.0028635196,"teacher_disagreement_score":0.22850394,"about_ca_system_score_codex":0.0019844312,"about_ca_system_score_gemma":0.0020828568,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4212817891","doi":"10.1016/j.tcs.2022.02.009","title":"Vertex coloring (4K1, hole-twin, 5-wheel)-free graphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Neighbourhood (mathematics); Chordal graph; Mathematics; Feedback vertex set; Vertex (graph theory); Wheel graph; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.016109313204729876,"score_gpt":0.27365762230865104,"score_spread":0.2575483091039212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212817891","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.80206853,0.00043270344,0.13023084,0.0012377627,0.00026792224,0.00017366164,0.002931435,0.0012139103,0.061443184],"genre_scores_gemma":[0.90114033,0.00033839745,0.0534732,0.00041080898,0.000062075844,0.0001326823,0.0034783722,0.0003915179,0.0405727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992824,0.0001168101,0.00003395415,0.00019153373,0.00010724046,0.00026809107],"domain_scores_gemma":[0.99798524,0.00056568335,0.00032551948,0.0003725389,0.00025599462,0.0004950456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005408373,0.0010280219,0.0010252915,0.000973521,0.002591652,0.0024675638,0.0020738868,0.0013409065,0.011545627],"category_scores_gemma":[0.0019252818,0.00084580574,0.0007858913,0.0014943726,0.0013716976,0.0019498662,0.0017034424,0.0016839324,0.0024626744],"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.0020394265,0.0005780902,0.009664239,0.0008912977,0.00021272388,0.002317256,0.0015998235,0.045618672,0.04111641,0.789056,0.040690005,0.06621618],"study_design_scores_gemma":[0.00052266684,0.00024655185,0.0074145016,0.00015524612,0.0003125369,0.0011524733,0.00099804,0.08985321,0.019984387,0.8401011,0.039117817,0.00014146836],"about_ca_topic_score_codex":0.0059208,"about_ca_topic_score_gemma":0.01003865,"teacher_disagreement_score":0.011545627,"about_ca_system_score_codex":0.0013472544,"about_ca_system_score_gemma":0.0013404984,"threshold_uncertainty_score":0.03862399},"labels":[],"label_agreement":null},{"id":"W4212834144","doi":"10.1016/s0304-3975(03)00311-6","title":"Reducing NFAs by invariant equivalences","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":33,"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":"Automaton; Merge (version control); Invariant (physics); Nondeterministic finite automaton; Mathematics; Equivalence (formal languages); Discrete mathematics; Combinatorics; Automata theory; Computer science; Theoretical computer science","score_opus":0.010824583969180577,"score_gpt":0.23935752065838203,"score_spread":0.22853293668920147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212834144","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.21451601,0.0008649015,0.66854537,0.002094232,0.00090916594,0.0002842351,0.0006412136,0.004721408,0.10742346],"genre_scores_gemma":[0.8368803,0.00063615805,0.12896027,0.00085174013,0.00047178625,0.00026128735,0.001216382,0.0013102636,0.029411815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681854,0.0007109426,0.0002483475,0.00063978543,0.0009164761,0.00066590164],"domain_scores_gemma":[0.99390393,0.003109328,0.00023816877,0.0017240748,0.0007491465,0.00027528958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014133643,0.00085712405,0.0012245551,0.0018216261,0.0019020704,0.0025462226,0.0018884452,0.0014945811,0.010665731],"category_scores_gemma":[0.0070708054,0.00080049725,0.0034310205,0.0013213634,0.0027245588,0.00814458,0.0052990466,0.004316393,0.001998693],"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.00012549946,0.00022782585,0.0005098657,0.00017689317,0.00006512639,0.00026057835,0.0011453466,0.0063503846,0.004809111,0.9165046,0.0047025685,0.065122224],"study_design_scores_gemma":[0.000022675187,0.000021307747,0.00013268193,0.000018427168,0.00005020875,0.00011406232,0.00018049544,0.0077383984,0.0029443149,0.98166543,0.0070941,0.000017909071],"about_ca_topic_score_codex":0.001727291,"about_ca_topic_score_gemma":0.0017929588,"teacher_disagreement_score":0.010665731,"about_ca_system_score_codex":0.0012735843,"about_ca_system_score_gemma":0.0007818077,"threshold_uncertainty_score":0.035680473},"labels":[],"label_agreement":null},{"id":"W4212973001","doi":"10.1016/j.tcs.2009.09.027","title":"Preface","year":2009,"lang":"en","type":"article","venue":"Theoretical 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":"Memorial University of Newfoundland; University of Regina","funders":"","keywords":"Computer science; Mathematics","score_opus":0.00905714772692766,"score_gpt":0.2675520916150978,"score_spread":0.2584949438881701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212973001","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.0014770417,0.016104141,0.02350399,0.051995367,0.3418372,0.0004658579,0.009851505,0.001901857,0.552863],"genre_scores_gemma":[0.009911423,0.008375086,0.0063338713,0.008897133,0.06446033,0.00031522263,0.0076008695,0.0014740643,0.89263195],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993293,0.000113171234,0.000041047835,0.00012144165,0.00034166218,0.000053313615],"domain_scores_gemma":[0.9947857,0.0009284003,0.00015738899,0.0005477361,0.0028765975,0.00070420845],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012740296,0.0010393491,0.0006931079,0.0034928718,0.0025386733,0.0029865748,0.0012464705,0.0009190229,0.31324512],"category_scores_gemma":[0.011282769,0.00030082796,0.0006339179,0.0024205407,0.0006942701,0.0028153611,0.0018270975,0.0034185331,0.20428888],"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.000021290029,0.000019514891,0.000070933944,0.00008305208,0.0000022325967,0.000026080039,0.000041597323,0.00007579073,0.00012457883,0.009984058,0.95001364,0.03953734],"study_design_scores_gemma":[0.0000047296935,0.000012408228,0.00024057798,0.00010826433,0.0000029792188,0.00004190542,0.000050876595,0.00006416308,0.00015184688,0.010087959,0.98922753,0.0000068440886],"about_ca_topic_score_codex":0.0031109657,"about_ca_topic_score_gemma":0.0040582754,"teacher_disagreement_score":0.6867549,"about_ca_system_score_codex":0.002023132,"about_ca_system_score_gemma":0.001669173,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4224095417","doi":"10.1016/j.tcs.2022.04.006","title":"Properties of a class of Toeplitz words","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toeplitz matrix; Uncountable set; Mathematics; Automaton; Class (philosophy); Permutation (music); Mathematical proof; Set (abstract data type); Discrete mathematics; Combinatorics; Algebra over a field; Theoretical computer science; Computer science; Pure mathematics; Artificial intelligence; Countable set; Programming language","score_opus":0.012783376803217462,"score_gpt":0.2203714539050505,"score_spread":0.20758807710183305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224095417","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.87380975,0.00038891204,0.1006861,0.00035763893,0.00009423199,0.00007404774,0.00034833254,0.00034502702,0.023895873],"genre_scores_gemma":[0.98645717,0.00015505728,0.006451599,0.00007672321,0.00011491744,0.000060177732,0.00028586303,0.000064009764,0.0063345293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939775,0.00008143779,0.000057807934,0.00016383687,0.00016323378,0.00013602413],"domain_scores_gemma":[0.99642205,0.0019565262,0.0004981967,0.00033924007,0.0004022326,0.00038182896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006414005,0.00063894043,0.000766353,0.0018515731,0.0019905611,0.0038990278,0.00078874116,0.0011373303,0.007516861],"category_scores_gemma":[0.0038835688,0.00045688587,0.00069070567,0.0016810658,0.0019114099,0.0036169223,0.0011564663,0.0012606899,0.0007470445],"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.0002377047,0.00009605256,0.0017975168,0.0000940791,0.00002222096,0.0007249608,0.00079625845,0.0020364826,0.012964388,0.9687057,0.0007647278,0.01175981],"study_design_scores_gemma":[0.000059660564,0.00014431572,0.0009881927,0.000020724196,0.000024106701,0.0011329378,0.0003632565,0.016574796,0.0056550927,0.9717449,0.0032512827,0.000040744762],"about_ca_topic_score_codex":0.0003934004,"about_ca_topic_score_gemma":0.00026652106,"teacher_disagreement_score":0.007516861,"about_ca_system_score_codex":0.00062771636,"about_ca_system_score_gemma":0.00055759464,"threshold_uncertainty_score":0.025146425},"labels":[],"label_agreement":null},{"id":"W4225162735","doi":"10.1016/j.tcs.2022.04.052","title":"A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Modular design; Mathematics; Orthogonality; Time complexity; Decomposition; Scheme (mathematics); Polynomial; Focus (optics); Discrete mathematics; Combinatorics; Algorithm; Computer science","score_opus":0.006917649435479797,"score_gpt":0.27963597498471354,"score_spread":0.27271832554923375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225162735","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.007676422,0.00013169074,0.9789909,0.0004714318,0.00017066525,0.00021237934,0.00024023218,0.00064788875,0.011458488],"genre_scores_gemma":[0.06940607,0.00036419753,0.91604644,0.00029081394,0.00023264473,0.00040225068,0.0008088132,0.0004847063,0.011964092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983734,0.0003243468,0.00017353683,0.0004833191,0.00045952766,0.00018582432],"domain_scores_gemma":[0.99757177,0.00089624507,0.00010911176,0.0008560659,0.00037123958,0.0001954723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022017835,0.0014714852,0.001217165,0.0025570907,0.002161069,0.005526945,0.0040646866,0.0020606588,0.01576367],"category_scores_gemma":[0.005702689,0.0010944341,0.0037080084,0.0038467278,0.0031033885,0.008265263,0.0077341036,0.0062153693,0.0043192874],"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.000050590028,0.00008344084,0.00027948848,0.00015467369,0.000019349696,0.0000915247,0.00028432492,0.0044765435,0.0033337495,0.91701037,0.0052508074,0.06896527],"study_design_scores_gemma":[0.000036930564,0.000039283146,0.00019547727,0.000047306767,0.00003790895,0.00016434987,0.00008687796,0.027022747,0.001520747,0.95544636,0.015367474,0.00003450846],"about_ca_topic_score_codex":0.0013680103,"about_ca_topic_score_gemma":0.0025046733,"teacher_disagreement_score":0.01576367,"about_ca_system_score_codex":0.0018852423,"about_ca_system_score_gemma":0.001526715,"threshold_uncertainty_score":0.052734733},"labels":[],"label_agreement":null},{"id":"W4226238874","doi":"10.1016/j.tcs.2022.01.010","title":"Efficient and compact representations of some non-canonical prefix-free codes","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Prefix code; Code word; Lexicographical order; Prefix; ENCODE; Word (group theory); Constant (computer programming); Mathematics; Code (set theory); Decoding methods; Encoding (memory); Combinatorics; Discrete mathematics; Alphabet; Universal code; Order (exchange); Computer science; Arithmetic; Algorithm; Code rate; Linear code; Systematic code; Block code","score_opus":0.01079473506623293,"score_gpt":0.26916367326847823,"score_spread":0.2583689382022453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226238874","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.27510437,0.0013694125,0.69271404,0.0013165047,0.00033248714,0.00013613036,0.0011250072,0.00076585636,0.02713613],"genre_scores_gemma":[0.8268398,0.0009829495,0.15752822,0.00028880368,0.00026340838,0.0002556511,0.0013467192,0.00027688858,0.012217707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998833,0.0002899984,0.00007386371,0.00014523565,0.00046454978,0.00019346691],"domain_scores_gemma":[0.99680895,0.0014303356,0.00030263272,0.00068207073,0.00061647117,0.00015949419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007198982,0.0007051925,0.00059000787,0.0010879413,0.00061196496,0.0017341939,0.00076983677,0.00096936076,0.003317043],"category_scores_gemma":[0.006077626,0.00028274485,0.00036731755,0.0015342553,0.0011106747,0.002090949,0.0015168281,0.0016339996,0.0009679413],"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.0003652752,0.000081669365,0.0005785084,0.00014194276,0.00001799396,0.0003563428,0.00034715887,0.03005708,0.011599844,0.86218363,0.0047195978,0.08955092],"study_design_scores_gemma":[0.000067423876,0.00014465362,0.00038048124,0.0000669443,0.000024951118,0.00068696775,0.00018313804,0.2439357,0.012088794,0.73284745,0.0095214,0.000052132644],"about_ca_topic_score_codex":0.0005003063,"about_ca_topic_score_gemma":0.00069863803,"teacher_disagreement_score":0.003317043,"about_ca_system_score_codex":0.0006011153,"about_ca_system_score_gemma":0.0012585128,"threshold_uncertainty_score":0.011096537},"labels":[],"label_agreement":null},{"id":"W4226482498","doi":"10.1016/j.tcs.2022.04.002","title":"An efficient oracle for counting shortest paths in planar graphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Combinatorics; Planar graph; Shortest path problem; Voronoi diagram; Vertex (graph theory); Mathematics; Discrete mathematics; Data structure; Computer science; Graph; Geometry","score_opus":0.010823555602555292,"score_gpt":0.2515598887280446,"score_spread":0.24073633312548928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226482498","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.08945737,0.0016344007,0.87531626,0.0028874855,0.0004106397,0.00043297934,0.005145281,0.012113653,0.01260204],"genre_scores_gemma":[0.43270382,0.00088424236,0.54740876,0.00068636495,0.00044282613,0.0005642464,0.009056839,0.0012246198,0.0070283166],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99418783,0.0012044233,0.00067155843,0.0013174998,0.0018799474,0.0007387847],"domain_scores_gemma":[0.9745364,0.016018962,0.0011414174,0.005526724,0.0016538597,0.0011226299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029340268,0.0019169452,0.003119596,0.0024771437,0.0012088576,0.0058699446,0.0064362935,0.0037412238,0.013326359],"category_scores_gemma":[0.023867024,0.0013127007,0.0014502883,0.006797458,0.0018894982,0.015122631,0.0059724296,0.004827236,0.0031242694],"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.0042238683,0.0013373496,0.006456416,0.0023231285,0.00024725802,0.0004554848,0.0006709159,0.09100002,0.036486078,0.12965338,0.051661786,0.67548424],"study_design_scores_gemma":[0.00090977544,0.00050169055,0.0025287222,0.00016237117,0.00030648985,0.00082847016,0.0005319267,0.6545379,0.020189198,0.30318677,0.016145471,0.00017119093],"about_ca_topic_score_codex":0.0033094988,"about_ca_topic_score_gemma":0.0048240987,"teacher_disagreement_score":0.013326359,"about_ca_system_score_codex":0.002546975,"about_ca_system_score_gemma":0.004513843,"threshold_uncertainty_score":0.044581056},"labels":[],"label_agreement":null},{"id":"W4250205828","doi":"10.1016/s0304-3975(04)00113-6","title":"The number of binary words avoiding abelian fourth powers grows exponentially","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Exponential growth; Abelian group; Binary number; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.00792064906453805,"score_gpt":0.24223702468757136,"score_spread":0.2343163756230333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250205828","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.7242743,0.002857546,0.12878352,0.011260673,0.0015514191,0.0001522728,0.0012636197,0.0017135689,0.12814307],"genre_scores_gemma":[0.9088398,0.0023889914,0.034128714,0.0016938999,0.0015232448,0.00046231732,0.0014100581,0.0006598692,0.048893005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980882,0.00042074407,0.00010165629,0.0003684007,0.0006754609,0.00034554157],"domain_scores_gemma":[0.97977865,0.01500271,0.0012876551,0.001943339,0.0012728433,0.0007147007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001322591,0.001103703,0.0016988396,0.0022066578,0.001807412,0.0045036785,0.0022923367,0.003242249,0.011479961],"category_scores_gemma":[0.015620419,0.0010575227,0.0010401079,0.0015316001,0.003775661,0.011379355,0.0030152847,0.004097389,0.0032943757],"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.0006176686,0.00015805388,0.0023355654,0.00063135935,0.00008008658,0.00038878265,0.00036699002,0.007691692,0.022371667,0.91221166,0.011397649,0.041748956],"study_design_scores_gemma":[0.00010126104,0.00008781834,0.0017790748,0.00012456936,0.00007811618,0.0012710182,0.00015690197,0.03723992,0.015332913,0.92981935,0.013937827,0.00007121465],"about_ca_topic_score_codex":0.00016304317,"about_ca_topic_score_gemma":0.00019768352,"teacher_disagreement_score":0.011479961,"about_ca_system_score_codex":0.0010752871,"about_ca_system_score_gemma":0.0007775394,"threshold_uncertainty_score":0.038404346},"labels":[],"label_agreement":null},{"id":"W4254341276","doi":"10.1016/j.tcs.2020.12.029","title":"Partial derivatives of regular expressions over alphabet-invariant and user-defined labels","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; St. Mary's University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Regular language; Prefix; Free monoid; Regular expression; Invariant (physics); Mathematics; Bounded function; Discrete mathematics; Word (group theory); Existential quantification; Combinatorics; Set (abstract data type); Alphabet; Combinatorics on words; Automaton; Monoid; Computer science; Theoretical computer science","score_opus":0.014049410970877715,"score_gpt":0.24079460233805858,"score_spread":0.22674519136718085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254341276","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.20959711,0.0007269955,0.7407072,0.0010435692,0.0005009746,0.00011218185,0.0010318805,0.004428759,0.041851293],"genre_scores_gemma":[0.89242095,0.00028604918,0.08640024,0.00020592152,0.0001822701,0.00007602874,0.00044801235,0.001139511,0.018841049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741095,0.0005888735,0.00021601761,0.0005520534,0.00088565436,0.0003464074],"domain_scores_gemma":[0.9947343,0.0023091533,0.00046576632,0.0012273906,0.00091169134,0.00035174988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002560358,0.00058607926,0.0007531759,0.0017881477,0.0011215018,0.003766242,0.0014808613,0.0011733035,0.0067519443],"category_scores_gemma":[0.009748189,0.0006262661,0.0009321207,0.001716208,0.0029074124,0.0068172626,0.0015106982,0.0018217926,0.0012952301],"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.00012939739,0.000041910866,0.0005310577,0.00007680974,0.000017906832,0.00051775196,0.00071641983,0.0048849788,0.0048370077,0.96624506,0.0013430887,0.0206587],"study_design_scores_gemma":[0.00003345331,0.00007455027,0.0004202587,0.00004609812,0.000048121063,0.00048999675,0.00020413249,0.039662037,0.014938377,0.9292012,0.014818691,0.00006303282],"about_ca_topic_score_codex":0.001161805,"about_ca_topic_score_gemma":0.0014576856,"teacher_disagreement_score":0.0067519443,"about_ca_system_score_codex":0.0018995806,"about_ca_system_score_gemma":0.0012638109,"threshold_uncertainty_score":0.022587538},"labels":[],"label_agreement":null},{"id":"W4256357822","doi":"10.1016/s0304-3975(04)00121-5","title":"The generalized Weil pairing and the discrete logarithm problem on elliptic curves","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Discrete logarithm; Mathematics; Elliptic curve; Pairing; Logarithm; TRACE (psycholinguistics); Generalization; Reduction (mathematics); Modulo; Edwards curve; Discrete mathematics; Pure mathematics; Simple (philosophy); Finite field; Combinatorics; Schoof's algorithm; Mathematical analysis; Computer science; Public-key cryptography; Quarter period; Geometry; Physics","score_opus":0.0056954008353222035,"score_gpt":0.22177431581755602,"score_spread":0.2160789149822338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256357822","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.71039474,0.011098457,0.11480216,0.032227322,0.0025763826,0.00010696544,0.0003858615,0.00028795813,0.12812024],"genre_scores_gemma":[0.9705258,0.0032626812,0.008257578,0.00047499736,0.0020642371,0.000070105285,0.00014660327,0.00005044797,0.015147604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811316,0.0007615841,0.00008677084,0.00027500995,0.00041968617,0.00034388687],"domain_scores_gemma":[0.9969303,0.0017176393,0.00040606124,0.00039396537,0.00016722654,0.00038483017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022474162,0.00112758,0.0021503312,0.0028371774,0.0038256303,0.0069382144,0.0013283037,0.0032652696,0.006092293],"category_scores_gemma":[0.008341937,0.0007955741,0.001029011,0.0035238,0.009955608,0.015856251,0.006283316,0.0060707973,0.0009464542],"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.00011149742,0.00003214018,0.0002821411,0.00004327174,0.000008395211,0.0001854064,0.00025166594,0.0022457368,0.00023182236,0.989876,0.0013169765,0.0054150247],"study_design_scores_gemma":[0.000016855129,0.000009373779,0.000058426995,0.00001230035,0.0000032455648,0.00006757559,0.000057853616,0.0024548522,0.00011952868,0.9960659,0.0011250923,0.000009010937],"about_ca_topic_score_codex":0.00055697263,"about_ca_topic_score_gemma":0.00038784198,"teacher_disagreement_score":0.0069382144,"about_ca_system_score_codex":0.0020854163,"about_ca_system_score_gemma":0.0012866742,"threshold_uncertainty_score":0.020380735},"labels":[],"label_agreement":null},{"id":"W4285773650","doi":"10.1016/j.tcs.2022.12.014","title":"The Maker-Breaker Largest Connected Subgraph game","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Agence Nationale de la Recherche; H2020 European Research Council; Providence Health Care; University for the Creative Arts","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Connected component; Induced subgraph; Graph; Discrete mathematics; Factor-critical graph; Planar graph; Distance-hereditary graph; Graph power; Line graph","score_opus":0.010715997083649407,"score_gpt":0.26696795117937877,"score_spread":0.2562519540957294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285773650","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.4215473,0.0005947669,0.4120096,0.010267903,0.0004155097,0.00060871115,0.0011560158,0.00062878884,0.15277147],"genre_scores_gemma":[0.9195304,0.0003965147,0.0455988,0.00063475064,0.0001224286,0.00023760578,0.00037453216,0.0001391595,0.032965887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801457,0.0010368859,0.000053568725,0.00033569385,0.00025328764,0.00030598883],"domain_scores_gemma":[0.99421895,0.0037752343,0.00034507332,0.00043149185,0.0002216914,0.0010075191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019322728,0.001133034,0.0019206747,0.00074368727,0.0021176382,0.0030833299,0.0033779768,0.004212869,0.016804269],"category_scores_gemma":[0.011240145,0.0006398924,0.0008400373,0.00089353294,0.0021935732,0.0050452584,0.0026138308,0.0033383807,0.0013034939],"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.0012373803,0.00032040811,0.0007635273,0.00031911663,0.00014922288,0.00059312826,0.00061244366,0.06338807,0.0051103625,0.88387793,0.018817939,0.024810452],"study_design_scores_gemma":[0.00030853358,0.00016013367,0.0002881598,0.000026563781,0.00005966441,0.0001982903,0.00027177302,0.16789314,0.0013716292,0.82307774,0.006311459,0.000032934866],"about_ca_topic_score_codex":0.0018580598,"about_ca_topic_score_gemma":0.0023063845,"teacher_disagreement_score":0.016804269,"about_ca_system_score_codex":0.0014900026,"about_ca_system_score_gemma":0.0019439221,"threshold_uncertainty_score":0.056215882},"labels":[],"label_agreement":null},{"id":"W4286796610","doi":"10.1016/j.tcs.2023.113760","title":"A simple certifying algorithm for 3-edge-connectivity","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Edge contraction; Algorithm; Connectivity; Graph; Mathematics; Computer science; Time complexity; Combinatorics; Line graph; Graph power","score_opus":0.039444340114994994,"score_gpt":0.3386094380291295,"score_spread":0.29916509791413454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286796610","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.04537516,0.00037795547,0.9262146,0.0012589303,0.00047734185,0.0003777976,0.0008101519,0.010282138,0.014825983],"genre_scores_gemma":[0.40327033,0.0003522668,0.58134764,0.00088462787,0.00035914805,0.0005509778,0.0031101834,0.001585327,0.008539439],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977297,0.00031594676,0.00018312558,0.00068116985,0.0007250674,0.00036500406],"domain_scores_gemma":[0.9911175,0.003570463,0.00041624735,0.0035803476,0.000885595,0.000429903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016292699,0.0015401277,0.002028196,0.0013495146,0.0016318626,0.0022563115,0.0037408096,0.0024028486,0.01589987],"category_scores_gemma":[0.009280649,0.00082247495,0.0019412099,0.0021779537,0.001731702,0.007033429,0.007432998,0.0051448653,0.003938618],"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.0009871636,0.0007289412,0.0022587115,0.0009931669,0.00017011959,0.00045704373,0.0005293782,0.03814986,0.027275432,0.16764909,0.05239599,0.708405],"study_design_scores_gemma":[0.0007068033,0.00048747036,0.0014306442,0.00010105192,0.00026378676,0.00096561946,0.00029930918,0.26711956,0.024747357,0.67778265,0.025934326,0.00016140199],"about_ca_topic_score_codex":0.000911997,"about_ca_topic_score_gemma":0.0011896738,"teacher_disagreement_score":0.01589987,"about_ca_system_score_codex":0.0010597198,"about_ca_system_score_gemma":0.0023166698,"threshold_uncertainty_score":0.05319035},"labels":[],"label_agreement":null},{"id":"W4288734880","doi":"10.1016/j.tcs.2022.07.029","title":"Improved algorithms for non-submodular function maximization problem","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Cardinality (data modeling); Maximization; Mathematical optimization; Monotone polygon; Mathematics; Constraint (computer-aided design); Function (biology); Greedy algorithm; Set function; Computer science; Set (abstract data type)","score_opus":0.013494570952473108,"score_gpt":0.2375044258966565,"score_spread":0.22400985494418338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288734880","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.0073243435,0.0005524388,0.98540896,0.00041728772,0.00016373552,0.000118096796,0.00016685366,0.00091069075,0.0049376064],"genre_scores_gemma":[0.0940563,0.00042709603,0.8966562,0.00039406688,0.00027159113,0.0004129055,0.00085524394,0.00057983055,0.0063467086],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977683,0.00077824586,0.00011608448,0.00047743245,0.0005718708,0.0002881279],"domain_scores_gemma":[0.9949569,0.0030498086,0.00023760507,0.0009341367,0.0006383827,0.00018327929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026713908,0.0019377392,0.002256943,0.0014690568,0.0009511268,0.0025881135,0.0048081027,0.0023486554,0.013084767],"category_scores_gemma":[0.009698653,0.00090659683,0.0016906415,0.0028131732,0.0010373169,0.005256986,0.0031128856,0.0047077043,0.0029258358],"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.00059735664,0.0007446911,0.0010818919,0.0007180075,0.00017582598,0.00013858243,0.00024975353,0.31616873,0.004347243,0.12579332,0.03504476,0.5149397],"study_design_scores_gemma":[0.00010606624,0.000053171403,0.0002680301,0.000027521342,0.000036778172,0.00006947906,0.00003086583,0.9215988,0.0010227829,0.072897986,0.0038710714,0.00001746699],"about_ca_topic_score_codex":0.0037464437,"about_ca_topic_score_gemma":0.0061225663,"teacher_disagreement_score":0.013084767,"about_ca_system_score_codex":0.002162644,"about_ca_system_score_gemma":0.0028346088,"threshold_uncertainty_score":0.043772936},"labels":[],"label_agreement":null},{"id":"W4294770181","doi":"10.1016/j.tcs.2022.08.024","title":"Flip-swap languages in binary reflected Gray code order","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Swap (finance); Prefix; Gray code; Combinatorics; Mathematics; Binary number; Arithmetic; Discrete mathematics; Computer science; Algorithm; Linguistics","score_opus":0.00985672457405275,"score_gpt":0.2807230356109046,"score_spread":0.2708663110368519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294770181","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.4483702,0.00048415246,0.47773412,0.0013815924,0.00031688224,0.00022342746,0.0005049059,0.0016240354,0.0693607],"genre_scores_gemma":[0.91453314,0.0002952692,0.060030278,0.0005973675,0.00010144837,0.00019018432,0.00025311485,0.0004474964,0.02355171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999172,0.0001942778,0.00006767863,0.00009733545,0.00025596828,0.0002128428],"domain_scores_gemma":[0.9978667,0.00095325796,0.00018303895,0.000490399,0.00036257206,0.00014408233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077027665,0.000332499,0.0004763826,0.0009437199,0.0009836362,0.0023572484,0.0007191498,0.0008342059,0.007168664],"category_scores_gemma":[0.0033991425,0.00027666337,0.0004907659,0.0011737953,0.0019729168,0.002975856,0.0013576432,0.0015561078,0.0010117013],"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.00011382866,0.00004031366,0.00014195661,0.00003508496,0.000004054567,0.000098565375,0.00021823912,0.006495161,0.0028372388,0.975037,0.0013650266,0.013613514],"study_design_scores_gemma":[0.000034373836,0.00007001604,0.00010489534,0.00003316151,0.000009678662,0.00013087332,0.000101066944,0.042066656,0.007007978,0.94567347,0.004737073,0.000030835967],"about_ca_topic_score_codex":0.00094250956,"about_ca_topic_score_gemma":0.0012385165,"teacher_disagreement_score":0.007168664,"about_ca_system_score_codex":0.0011227193,"about_ca_system_score_gemma":0.0012628452,"threshold_uncertainty_score":0.023981512},"labels":[],"label_agreement":null},{"id":"W4295763127","doi":"10.1016/j.tcs.2022.09.011","title":"On invertible and stably reversible non-uniform cellular automata","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Injective function; Cellular automaton; Invertible matrix; Mathematics; Equivalence (formal languages); Abelian group; Pure mathematics; Stochastic cellular automaton; Discrete mathematics; Algorithm","score_opus":0.0075284133935657705,"score_gpt":0.21716065134038054,"score_spread":0.20963223794681476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295763127","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.34988704,0.0023668273,0.5102312,0.001170637,0.00046742227,0.000103451006,0.00044252706,0.0007685536,0.13456231],"genre_scores_gemma":[0.94970053,0.0011216045,0.01965965,0.00017971994,0.00020964454,0.00008109965,0.00018771243,0.0001375154,0.028722502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934,0.00012584655,0.00004391138,0.00016594566,0.00018856689,0.00013566208],"domain_scores_gemma":[0.9977314,0.0013791372,0.00017972644,0.00029163915,0.00029939032,0.000118782875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164219,0.0006750038,0.00072052004,0.00084838516,0.0009559318,0.001818241,0.0010864902,0.00095794076,0.0071059666],"category_scores_gemma":[0.00391429,0.00039850187,0.00086685235,0.00064095686,0.0025351064,0.0022865748,0.0017473924,0.0015994878,0.00065640506],"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.000040620635,0.00001814887,0.00014018496,0.00004329714,0.0000064352257,0.00014057869,0.00022954764,0.010799646,0.0029139158,0.9779222,0.00035329553,0.0073920703],"study_design_scores_gemma":[0.000016948945,0.000031769694,0.00019865892,0.000016510565,0.000010183221,0.00010806575,0.00006889803,0.058650613,0.0020790678,0.93610495,0.0026937728,0.000020528967],"about_ca_topic_score_codex":0.0022247063,"about_ca_topic_score_gemma":0.0019661272,"teacher_disagreement_score":0.0071059666,"about_ca_system_score_codex":0.0011271031,"about_ca_system_score_gemma":0.0006420081,"threshold_uncertainty_score":0.023771882},"labels":[],"label_agreement":null},{"id":"W4317933801","doi":"10.1016/j.tcs.2023.113733","title":"Wait-free approximate agreement on graphs","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","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 Toronto","funders":"HORIZON EUROPE Marie Sklodowska-Curie Actions; H2020 European Research Council; H2020 Marie Skłodowska-Curie Actions; Horizon 2020; European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Indifference graph; Combinatorics; Mathematics; Longest path problem; Pathwidth; Maximal independent set; Discrete mathematics; Lemma (botany); Impossibility; Computer science; Graph; 1-planar graph; Line graph","score_opus":0.01361083066908813,"score_gpt":0.2486185129397474,"score_spread":0.23500768227065927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317933801","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.09163111,0.00008080825,0.90292513,0.00037499852,0.000030355997,0.00012524877,0.00018942163,0.0008206397,0.0038223132],"genre_scores_gemma":[0.7801536,0.00017282662,0.21242948,0.0001466699,0.000042322827,0.00024084149,0.0004752755,0.00021300573,0.006126088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976833,0.00059833814,0.00018828659,0.00060825906,0.00057012733,0.00035166406],"domain_scores_gemma":[0.98972064,0.0065065124,0.00071801955,0.0020474466,0.0006664505,0.0003408292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015519653,0.0005926755,0.0010188605,0.00053651334,0.001096483,0.0019064386,0.0018372516,0.0010886192,0.0032294577],"category_scores_gemma":[0.01030171,0.00045234693,0.001061934,0.0009732915,0.0019145792,0.0050897878,0.0028832038,0.0019671184,0.0005434277],"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.0005485495,0.00010463361,0.0016466887,0.00032184547,0.0000721553,0.0004785693,0.001706018,0.36870557,0.01642724,0.54390794,0.002352213,0.0637286],"study_design_scores_gemma":[0.000059207854,0.00007614614,0.00021251834,0.000020128557,0.000021944501,0.0001310508,0.00026918305,0.48543847,0.009694763,0.50007355,0.003977399,0.00002562958],"about_ca_topic_score_codex":0.0023490386,"about_ca_topic_score_gemma":0.0017476336,"teacher_disagreement_score":0.0032294577,"about_ca_system_score_codex":0.0012659006,"about_ca_system_score_gemma":0.0012189338,"threshold_uncertainty_score":0.01080364},"labels":[],"label_agreement":null},{"id":"W4318973256","doi":"10.1016/j.tcs.2023.113730","title":"Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Price of anarchy; Nash equilibrium; Price of stability; Epsilon-equilibrium; Inefficiency; Best response; Minimax; Mathematical economics; Mathematical optimization; Correlated equilibrium; Risk dominance; Computer science; Mathematics; Game theory; Equilibrium selection; Economics; Repeated game; Microeconomics","score_opus":0.02193142612724938,"score_gpt":0.24288567516401713,"score_spread":0.22095424903676775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318973256","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.5293446,0.0007667242,0.44178918,0.0020160654,0.00007047626,0.0002231049,0.00054130587,0.00026241815,0.024986107],"genre_scores_gemma":[0.9789337,0.0003013634,0.016480235,0.00011723564,0.00006699408,0.00013343111,0.00019590055,0.000101615085,0.0036696042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99165803,0.0052262577,0.00038260448,0.00075141893,0.00087090005,0.0011106682],"domain_scores_gemma":[0.8574981,0.12911125,0.004501509,0.0037549695,0.0031533646,0.0019808407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010744338,0.0013941481,0.003069275,0.0026503508,0.0010670201,0.004469655,0.0036910009,0.0018054689,0.006132768],"category_scores_gemma":[0.05620587,0.0013061017,0.0014371716,0.0025591808,0.00410926,0.0063621565,0.0022435926,0.0027191823,0.00042750427],"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.0009543773,0.00045275476,0.0034673167,0.00022526171,0.0001751027,0.00012014084,0.000372139,0.53366816,0.002162268,0.4444097,0.0016013974,0.01239131],"study_design_scores_gemma":[0.00011204059,0.00007255289,0.0010808333,0.000023124943,0.000050731145,0.000038186477,0.000088281486,0.7346458,0.0005996338,0.26302102,0.00023768176,0.000030133297],"about_ca_topic_score_codex":0.0061205127,"about_ca_topic_score_gemma":0.0045125484,"teacher_disagreement_score":0.010744338,"about_ca_system_score_codex":0.0047874316,"about_ca_system_score_gemma":0.0044146567,"threshold_uncertainty_score":0.05682212},"labels":[],"label_agreement":null},{"id":"W4328105802","doi":"10.1016/j.tcs.2023.113830","title":"On the average complexity of partial derivative transducers","year":2023,"lang":"en","type":"article","venue":"Theoretical 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":"Saint Mary's University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bounded function; Algebraic number; Partial derivative; Expression (computer science); Combinatorics; Discrete mathematics; Pure mathematics; Applied mathematics; Mathematical analysis; Computer science","score_opus":0.03271519382222329,"score_gpt":0.2632422958027282,"score_spread":0.23052710198050488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328105802","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.87653846,0.0007344199,0.11013557,0.0016884748,0.00005371775,0.000063089305,0.0014732006,0.0012410397,0.008072092],"genre_scores_gemma":[0.98066336,0.00027944834,0.015457497,0.00012324179,0.00005411575,0.0001162763,0.0012013201,0.0002707548,0.0018339388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951532,0.0010155325,0.00040588746,0.001274856,0.0012415005,0.00090906286],"domain_scores_gemma":[0.9394784,0.051518247,0.0017765103,0.0042496785,0.0018590842,0.0011181873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027917882,0.0005696065,0.0015115013,0.0012625373,0.0012797462,0.0045927274,0.0022390787,0.0016309781,0.006213326],"category_scores_gemma":[0.029641131,0.00068119256,0.0012352436,0.0017881019,0.0023966604,0.009478785,0.002704738,0.0022485135,0.0006680211],"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.0028766985,0.00035716975,0.026324447,0.0011957774,0.00032814394,0.00064170745,0.0018123577,0.5905762,0.049032953,0.20634747,0.0060119466,0.11449517],"study_design_scores_gemma":[0.000051273793,0.00016897882,0.002567148,0.000038548736,0.000108063345,0.00027673767,0.00022923722,0.8584896,0.01452265,0.12229401,0.0012008859,0.000052841093],"about_ca_topic_score_codex":0.0025574798,"about_ca_topic_score_gemma":0.003027232,"teacher_disagreement_score":0.006213326,"about_ca_system_score_codex":0.003093879,"about_ca_system_score_gemma":0.0031613864,"threshold_uncertainty_score":0.022447824},"labels":[],"label_agreement":null},{"id":"W4372233695","doi":"10.1016/j.tcs.2023.113936","title":"A refinement on the structure of vertex-critical (P5, gem)-free graphs","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; The King's University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Induced subgraph; Mathematics; Discrete mathematics; Chordal graph; Computer science; Graph","score_opus":0.019315533797664167,"score_gpt":0.3026259989599015,"score_spread":0.28331046516223735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372233695","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.6596393,0.0010430759,0.21879973,0.0031534638,0.00038452438,0.00018642397,0.0014731995,0.0012222829,0.114097975],"genre_scores_gemma":[0.93091714,0.00038100823,0.051970337,0.00057213346,0.00015430413,0.000055248078,0.0011442386,0.00027627728,0.014529351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996476,0.00008881115,0.000014857866,0.000101032034,0.00008078085,0.00006679925],"domain_scores_gemma":[0.99786085,0.0008963808,0.00016682247,0.00049369264,0.00035589506,0.00022642054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006521673,0.00048477974,0.0005183507,0.0018947419,0.0021332977,0.0016768554,0.0013582355,0.001022491,0.007327213],"category_scores_gemma":[0.004414074,0.00041545994,0.0005666337,0.0013369031,0.002107341,0.0028756792,0.0014450771,0.002090185,0.0008398867],"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.00017628174,0.000034588447,0.0012421194,0.00010830915,0.000010251457,0.00026232182,0.0007149413,0.002989884,0.005739255,0.9682363,0.0047382126,0.015747486],"study_design_scores_gemma":[0.00003934131,0.000043100725,0.000970956,0.000053876884,0.000019824527,0.00021880987,0.00028770682,0.011032796,0.0033173836,0.97262484,0.011374345,0.000017013397],"about_ca_topic_score_codex":0.0031500494,"about_ca_topic_score_gemma":0.0034025023,"teacher_disagreement_score":0.007327213,"about_ca_system_score_codex":0.0008910202,"about_ca_system_score_gemma":0.0008341578,"threshold_uncertainty_score":0.024511933},"labels":[],"label_agreement":null},{"id":"W4379614944","doi":"10.1016/j.tcs.2023.113999","title":"The nondeterministic state complexity of the site-directed deletion language operation","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Nondeterministic algorithm; Upper and lower bounds; Deterministic finite automaton; String (physics); Combinatorics; Nondeterministic finite automaton; Finite-state machine; Mathematics; Regular language; Prefix; Discrete mathematics; Computer science; Automaton; Algorithm; Data structure; Theoretical computer science; Automata theory; Programming language","score_opus":0.014637803432919032,"score_gpt":0.2707185309608592,"score_spread":0.25608072752794014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379614944","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.42283008,0.0005625396,0.5088347,0.008629445,0.00022149191,0.00012249326,0.0011261735,0.00083622226,0.05683684],"genre_scores_gemma":[0.97256315,0.00022063087,0.020375669,0.00027521348,0.00014931736,0.00010901416,0.0002989774,0.0001621038,0.0058459663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715257,0.00073113246,0.00018344112,0.0005489927,0.00093824626,0.00044564228],"domain_scores_gemma":[0.97499937,0.021027261,0.0007165328,0.0018982782,0.00096994004,0.0003886517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022880929,0.00042878723,0.0009420983,0.0007382333,0.0015079344,0.004879822,0.0017638853,0.001588945,0.007925301],"category_scores_gemma":[0.017111594,0.0006256904,0.0013129271,0.00091613433,0.0039078123,0.010327163,0.0021446366,0.004010488,0.00075678795],"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.00012369423,0.000041105675,0.00052390294,0.00006196457,0.000012535518,0.00010247641,0.00024705616,0.021741843,0.0017947451,0.96773326,0.0010182658,0.006599165],"study_design_scores_gemma":[0.000017349494,0.00001230092,0.00016799799,0.0000075568414,0.0000105845465,0.00005586797,0.000030180789,0.07348702,0.0016469558,0.9237992,0.00074662385,0.000018312558],"about_ca_topic_score_codex":0.0021778967,"about_ca_topic_score_gemma":0.0013856944,"teacher_disagreement_score":0.007925301,"about_ca_system_score_codex":0.0023165012,"about_ca_system_score_gemma":0.002592995,"threshold_uncertainty_score":0.026512802},"labels":[],"label_agreement":null},{"id":"W4379619578","doi":"10.1016/j.tcs.2023.113981","title":"The road problem and homomorphisms of directed graphs","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Generalization; Mathematics; Property (philosophy); Graph; Combinatorics; Product (mathematics); Graph theory; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.008747850501502908,"score_gpt":0.23457104465007958,"score_spread":0.22582319414857668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379619578","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.34002405,0.0032298279,0.5524176,0.00664267,0.0004632968,0.00017158862,0.0011799436,0.0005964544,0.095274635],"genre_scores_gemma":[0.8833797,0.002875494,0.07576003,0.00081382476,0.00053191674,0.00020196667,0.0012012483,0.0002668649,0.03496903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978904,0.0008166795,0.00013806114,0.00062936597,0.00026221192,0.00026320558],"domain_scores_gemma":[0.9904529,0.0066518816,0.0007057709,0.0009086153,0.000530145,0.00075067754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020964693,0.00053189765,0.0010117616,0.0020277018,0.002715843,0.0046925023,0.002572671,0.0024043096,0.009675273],"category_scores_gemma":[0.013720276,0.0009588115,0.0014242288,0.0025973767,0.0042190985,0.018442513,0.003921268,0.0040255454,0.0012021163],"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.000042147258,0.00002787975,0.00026213954,0.00006130542,0.000009844882,0.00007278859,0.00046575884,0.0014824457,0.00020930124,0.98861176,0.0012992304,0.007455248],"study_design_scores_gemma":[0.000009800153,0.00000706699,0.000065332264,0.000011635395,0.0000070451333,0.000066373825,0.00018012292,0.003587637,0.00015908107,0.9936924,0.0022061483,0.0000074566865],"about_ca_topic_score_codex":0.0023930124,"about_ca_topic_score_gemma":0.0013874652,"teacher_disagreement_score":0.009675273,"about_ca_system_score_codex":0.0014559736,"about_ca_system_score_gemma":0.0011525265,"threshold_uncertainty_score":0.03236699},"labels":[],"label_agreement":null},{"id":"W4382933733","doi":"10.1016/j.tcs.2023.114059","title":"On the g-extra connectivity of augmented cubes","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Hypercube; Social connectedness; Upper and lower bounds; Graph; Discrete mathematics; Graph power; Connected component; Hypercube graph; Line graph","score_opus":0.018132900117005232,"score_gpt":0.25192517906498535,"score_spread":0.2337922789479801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382933733","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.5608003,0.0020219886,0.28398117,0.0034288678,0.0006426859,0.00009854052,0.0008251625,0.00032799746,0.14787328],"genre_scores_gemma":[0.93821484,0.0017169381,0.03948281,0.0009820063,0.00038123556,0.00012919474,0.000802654,0.00015353656,0.018136704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996264,0.00015102226,0.000015972448,0.0000682465,0.00006920023,0.00006911996],"domain_scores_gemma":[0.99804926,0.0010802862,0.00027508836,0.00017800141,0.00020632581,0.00021104512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052681944,0.00065397384,0.0006954445,0.0014475507,0.0012017459,0.0015189818,0.0012074031,0.0011402478,0.010869063],"category_scores_gemma":[0.004024018,0.0004169593,0.0006114216,0.0013122002,0.0019443294,0.0034445387,0.0024137534,0.0022183678,0.00078496104],"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.00015994282,0.000025121166,0.0005383471,0.000091795686,0.000015341622,0.00018096661,0.00021235936,0.011858135,0.0013663301,0.9673264,0.0041593215,0.014065987],"study_design_scores_gemma":[0.00002308473,0.00003919239,0.00042525597,0.000031881213,0.000009975885,0.00012563099,0.00011875021,0.031215817,0.00031816136,0.964493,0.0031887116,0.00001049889],"about_ca_topic_score_codex":0.0013518597,"about_ca_topic_score_gemma":0.0014613542,"teacher_disagreement_score":0.010869063,"about_ca_system_score_codex":0.00053990044,"about_ca_system_score_gemma":0.00033888558,"threshold_uncertainty_score":0.03636062},"labels":[],"label_agreement":null},{"id":"W4384937916","doi":"10.1016/j.tcs.2023.114078","title":"On Simon's congruence closure of a string","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Ministry of Science, ICT and Future Planning","keywords":"Alphabet; Congruence (geometry); Mathematics; Combinatorics; String (physics); Closure (psychology); Regular language; Discrete mathematics; Computer science; Automaton; Linguistics; Theoretical computer science","score_opus":0.009520618453839953,"score_gpt":0.24837631272311528,"score_spread":0.23885569426927533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384937916","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.36412373,0.0017938503,0.17793402,0.006272655,0.0017044599,0.00015757364,0.00070192333,0.0011563355,0.44615546],"genre_scores_gemma":[0.95733166,0.00048125925,0.014354668,0.00048192838,0.0006785328,0.00008167612,0.00029437194,0.00024093351,0.026054928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727017,0.00059457065,0.0001894512,0.0005374319,0.0007137292,0.00069451996],"domain_scores_gemma":[0.9964025,0.0021834662,0.00028054597,0.00030596633,0.00037940202,0.00044814355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002173252,0.001025503,0.00228113,0.0027755548,0.0054668034,0.0048930543,0.0012594123,0.0021640284,0.013148931],"category_scores_gemma":[0.0067411545,0.0008175954,0.0019524104,0.0028154524,0.0069343946,0.010081232,0.004515109,0.003358292,0.0014834569],"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.00005825076,0.000011383825,0.000052552656,0.0000147660285,0.0000026917696,0.00008608797,0.00032925067,0.00019721226,0.00042645767,0.99691015,0.00046268327,0.0014486382],"study_design_scores_gemma":[0.000033214306,0.000017927276,0.00008571446,0.000009916815,0.000005522698,0.00006360841,0.00011835582,0.0010835573,0.00038667346,0.9951042,0.0030795387,0.000011741208],"about_ca_topic_score_codex":0.0030889944,"about_ca_topic_score_gemma":0.001589247,"teacher_disagreement_score":0.013148931,"about_ca_system_score_codex":0.0028376225,"about_ca_system_score_gemma":0.0012099036,"threshold_uncertainty_score":0.043987572},"labels":[],"label_agreement":null},{"id":"W4384938342","doi":"10.1016/j.tcs.2023.114076","title":"Approximate NFA universality and related problems motivated by information theory","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Universality (dynamical systems); Mathematics; Discrete mathematics; Automaton; Combinatorics; Computer science; Theoretical computer science","score_opus":0.005101673044156291,"score_gpt":0.2008103065029248,"score_spread":0.19570863345876852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384938342","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.18017283,0.0019706613,0.7974181,0.004644443,0.0001451956,0.00008854366,0.0003497084,0.000407405,0.014803102],"genre_scores_gemma":[0.9341843,0.0008081703,0.059483685,0.00044593046,0.00044758743,0.00012628088,0.0003372187,0.00017527147,0.0039916346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99397403,0.0020112603,0.00041986816,0.0015499259,0.001341683,0.00070330175],"domain_scores_gemma":[0.9428812,0.044847168,0.0021967543,0.0065337694,0.0021749362,0.0013661737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057936837,0.0006414323,0.00322395,0.0028959697,0.0033047413,0.0059945052,0.0038164805,0.0037309902,0.0047859303],"category_scores_gemma":[0.04724731,0.0012516791,0.0026837818,0.0044983607,0.009942725,0.023227349,0.0056433077,0.0056599244,0.0003311397],"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.00005985614,0.000037450587,0.00057663064,0.00008554174,0.000024297437,0.00007156993,0.0004788788,0.0070341234,0.00037814374,0.9843552,0.0004575703,0.0064407997],"study_design_scores_gemma":[0.0000074580134,0.0000066225743,0.0001029545,0.000012994806,0.000011609674,0.000055833254,0.000080772625,0.023314683,0.00021442321,0.97581416,0.0003695768,0.0000088636225],"about_ca_topic_score_codex":0.0023182118,"about_ca_topic_score_gemma":0.0015153324,"teacher_disagreement_score":0.0059945052,"about_ca_system_score_codex":0.0033649858,"about_ca_system_score_gemma":0.0014731116,"threshold_uncertainty_score":0.030640304},"labels":[],"label_agreement":null},{"id":"W4386071077","doi":"10.1016/j.tcs.2023.114138","title":"An integer linear programming approach to solving the Eternity Puzzle","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Image Processing and 3D Reconstruction","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eternity; Mathematics; Integer (computer science); Linear programming; Integer programming; Set (abstract data type); MATLAB; Algorithm; Computer science; Discrete mathematics; Programming language","score_opus":0.017190002250847543,"score_gpt":0.2769978860806397,"score_spread":0.25980788382979214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386071077","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.0069065327,0.0005656757,0.969376,0.0015870812,0.00021284241,0.000070580856,0.00016654127,0.00014341797,0.020971343],"genre_scores_gemma":[0.13298325,0.0009821742,0.85047823,0.00066906126,0.00037942966,0.00029090772,0.00037217207,0.00024167151,0.013603095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988667,0.00048472514,0.00005324982,0.00021356065,0.0002203484,0.0001614582],"domain_scores_gemma":[0.9972037,0.0023317148,0.000116155636,0.00009633278,0.00017466584,0.000077557925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016803538,0.0014190078,0.0012588564,0.0010705186,0.00095583475,0.0026255571,0.0022838763,0.0018282868,0.009890612],"category_scores_gemma":[0.0065986677,0.0009331262,0.0014955599,0.001697627,0.0018031191,0.0030624673,0.0019169862,0.004617214,0.0009022137],"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.000120141565,0.00021517304,0.0004661612,0.00025537045,0.00007251412,0.000196359,0.0001961393,0.50886387,0.0007129767,0.42118174,0.011371508,0.05634798],"study_design_scores_gemma":[0.000052883828,0.00003872722,0.00008276325,0.000040746723,0.000017510347,0.000046286277,0.00008503108,0.75125325,0.00023718411,0.24281517,0.0053123585,0.000018131133],"about_ca_topic_score_codex":0.005976015,"about_ca_topic_score_gemma":0.006512529,"teacher_disagreement_score":0.009890612,"about_ca_system_score_codex":0.0011283488,"about_ca_system_score_gemma":0.0017752986,"threshold_uncertainty_score":0.033087432},"labels":[],"label_agreement":null},{"id":"W4386376648","doi":"10.1016/j.tcs.2023.114161","title":"Communication costs in a geometric communication network","year":2023,"lang":"en","type":"article","venue":"Theoretical 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geometric networks; Convex hull; Mathematics; Asynchronous communication; Node (physics); Upper and lower bounds; Topology (electrical circuits); Computer science; Euclidean geometry; Graph; Discrete mathematics; Combinatorics; Theoretical computer science; Regular polygon; Graph theory; Geometry; Computer network","score_opus":0.01940915620891267,"score_gpt":0.2756832360992582,"score_spread":0.25627407989034556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386376648","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.1263842,0.0009941655,0.8483903,0.005231827,0.00018416837,0.00027323575,0.00079787965,0.0005503078,0.017193943],"genre_scores_gemma":[0.7551163,0.0016778935,0.23043083,0.00052491436,0.00026786746,0.000688118,0.0009914826,0.0002928576,0.010009681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995826,0.0013400851,0.00019571076,0.0008123211,0.0011750784,0.00065076543],"domain_scores_gemma":[0.98563564,0.010561173,0.0010327494,0.0016676292,0.0006721408,0.00043066597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002162497,0.0011312999,0.0012218353,0.0011071682,0.0015660184,0.0030155915,0.003032802,0.0020390344,0.007532269],"category_scores_gemma":[0.018173119,0.00060678663,0.00084339664,0.0023863884,0.0023532084,0.010055149,0.0025671937,0.002690922,0.00083576376],"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.00035954823,0.0001072208,0.0011046185,0.00025504726,0.000047786347,0.00017650481,0.00023860397,0.59337384,0.0026612636,0.3626125,0.00687476,0.032188345],"study_design_scores_gemma":[0.0000502831,0.00009778798,0.00047699502,0.00002802367,0.000032165353,0.00019161335,0.00015981097,0.7427501,0.0014729982,0.24910718,0.005608445,0.000024545905],"about_ca_topic_score_codex":0.00240306,"about_ca_topic_score_gemma":0.0020952376,"teacher_disagreement_score":0.007532269,"about_ca_system_score_codex":0.0036177079,"about_ca_system_score_gemma":0.0016358286,"threshold_uncertainty_score":0.026248395},"labels":[],"label_agreement":null},{"id":"W4386573223","doi":"10.1016/j.tcs.2023.114144","title":"Quantitative estimates for the size of an intersection of sparse automatic sets","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Intersection (aeronautics); Extension (predicate logic); Bounded function; Automaton; Mathematics; Natural number; Cellular automaton; Discrete mathematics; Fully automatic; Algorithm; Combinatorics; Computer science; Theoretical computer science","score_opus":0.025482411979982925,"score_gpt":0.3108738027439796,"score_spread":0.28539139076399667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386573223","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.49306968,0.00067256414,0.48479506,0.0018601615,0.00012313,0.000080860664,0.0007757358,0.00063777796,0.017985033],"genre_scores_gemma":[0.9492059,0.0002625619,0.04568905,0.0001232722,0.00030716715,0.00014317277,0.00056575675,0.0002186168,0.003484481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701536,0.0007369439,0.00014663045,0.00061910716,0.0011812667,0.00030069574],"domain_scores_gemma":[0.905062,0.077245906,0.004685026,0.0043616137,0.0042488547,0.00439659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004133552,0.00079754763,0.0012724361,0.0042520706,0.0014866833,0.003951717,0.0029393074,0.0017692896,0.008006228],"category_scores_gemma":[0.041525666,0.0011984651,0.00093710696,0.0016325605,0.0055510644,0.0100107435,0.0035895158,0.0034208617,0.00041437024],"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.0003117516,0.00012056647,0.005246352,0.0002547045,0.000067756446,0.00016139238,0.00075378624,0.031662907,0.015283822,0.9334185,0.0014574068,0.011261027],"study_design_scores_gemma":[0.000028042337,0.00015088264,0.00419872,0.00005971831,0.000045805788,0.00039884393,0.0004538165,0.2965422,0.0072050183,0.68898,0.0018663184,0.00007068875],"about_ca_topic_score_codex":0.0007091789,"about_ca_topic_score_gemma":0.00058489654,"teacher_disagreement_score":0.008006228,"about_ca_system_score_codex":0.0019289771,"about_ca_system_score_gemma":0.00078000943,"threshold_uncertainty_score":0.026783466},"labels":[],"label_agreement":null},{"id":"W4386786301","doi":"10.1016/j.tcs.2023.114186","title":"The one-visibility localization game","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Mathematics; Combinatorics; Visibility; Isoperimetric inequality; Constant (computer programming); Multiplicative function; Discrete mathematics; Tree (set theory); Treewidth; Order (exchange); Computer science; Pathwidth; Mathematical analysis; Graph","score_opus":0.02531236495019715,"score_gpt":0.317641038245972,"score_spread":0.29232867329577483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386786301","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.2974424,0.00068446575,0.5047828,0.013501174,0.00027892453,0.00026588602,0.00065799826,0.0006561997,0.18173015],"genre_scores_gemma":[0.9557155,0.00034080946,0.021725832,0.0005131419,0.0000683771,0.00011571481,0.00019539866,0.00008868118,0.021236746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849844,0.00063527905,0.000046908142,0.00026714877,0.00021471742,0.0003375319],"domain_scores_gemma":[0.9952276,0.0030368732,0.00023598594,0.00047446688,0.0002629221,0.0007622386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013661893,0.00085507974,0.0013070169,0.00061842427,0.0016758634,0.0040085907,0.002361291,0.0031087496,0.01005384],"category_scores_gemma":[0.007785265,0.0004484109,0.0006496908,0.0006571215,0.0030891339,0.0076112733,0.003712424,0.003412414,0.0010336367],"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.00020481262,0.000059617116,0.00024148112,0.00007759049,0.000017838716,0.0001389822,0.00021086173,0.0074989186,0.0010761344,0.9772543,0.0041154255,0.009103942],"study_design_scores_gemma":[0.000082812934,0.000034014796,0.00009014447,0.000016461145,0.000012947168,0.00010322447,0.00014500355,0.044246316,0.0005400478,0.95236075,0.0023531914,0.0000150614205],"about_ca_topic_score_codex":0.0018684755,"about_ca_topic_score_gemma":0.0013411676,"teacher_disagreement_score":0.01005384,"about_ca_system_score_codex":0.001558697,"about_ca_system_score_gemma":0.0015960678,"threshold_uncertainty_score":0.03363347},"labels":[],"label_agreement":null},{"id":"W4387618924","doi":"10.1016/j.tcs.2023.114254","title":"A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; National University's Basic Research Foundation of China; China Scholarship Council; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Mathematics; Combinatorics; Cardinality (data modeling); Approximation algorithm; Discrete mathematics; Infimum and supremum; Monotone polygon; Monotonic function; Maximization; Algorithm; Mathematical optimization; Computer science","score_opus":0.0218563223892489,"score_gpt":0.2614628641893752,"score_spread":0.2396065418001263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387618924","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.017154407,0.0011059326,0.9658512,0.0012175333,0.0002759992,0.0002885017,0.00044509914,0.0028764864,0.010784845],"genre_scores_gemma":[0.13116722,0.00036494204,0.86107737,0.0006905321,0.0002782084,0.00046269098,0.0007147679,0.0008766593,0.0043676617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619377,0.001352509,0.00018369606,0.0009940303,0.00074214645,0.00053382665],"domain_scores_gemma":[0.9929507,0.004345328,0.00031920444,0.001428026,0.00056591857,0.00039079302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036324402,0.002743233,0.0039104805,0.0016169884,0.0011101062,0.0033988247,0.0056658154,0.0024720032,0.014724102],"category_scores_gemma":[0.014747032,0.0013141856,0.0021887938,0.0030812537,0.001695072,0.008291806,0.0040985704,0.005138102,0.004688649],"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.0019606368,0.0009380863,0.001139312,0.0009394198,0.000262302,0.00020075386,0.00040134368,0.21623035,0.01026823,0.16200265,0.048429582,0.5572274],"study_design_scores_gemma":[0.00024518353,0.00020253847,0.00014269372,0.00004713597,0.00006297885,0.00015607676,0.00009209705,0.87457174,0.0023496242,0.11791745,0.004171727,0.000040665225],"about_ca_topic_score_codex":0.002400785,"about_ca_topic_score_gemma":0.003351457,"teacher_disagreement_score":0.014724102,"about_ca_system_score_codex":0.0025242164,"about_ca_system_score_gemma":0.0032959452,"threshold_uncertainty_score":0.04925704},"labels":[],"label_agreement":null},{"id":"W4388906604","doi":"10.1016/j.tcs.2023.114313","title":"Deterministic rendezvous in infinite trees","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Rendezvous; Computer science; Combinatorics; Node (physics); Tree (set theory); Mathematics; Discrete mathematics; Time complexity; Graph; Binary logarithm; Set (abstract data type); Algorithm","score_opus":0.02155835231924106,"score_gpt":0.28771762123303984,"score_spread":0.26615926891379876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388906604","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.47950968,0.0015877119,0.47962266,0.0016567041,0.00014960223,0.00007715109,0.0004400731,0.00092727685,0.036029153],"genre_scores_gemma":[0.9562811,0.0003933478,0.03151479,0.00011646992,0.000043460495,0.00006779676,0.00022119694,0.00024127423,0.011120567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881375,0.00035914226,0.00006108886,0.0002586536,0.00024156207,0.00026575298],"domain_scores_gemma":[0.98833627,0.009085203,0.00060447585,0.0009203326,0.00041987118,0.0006337249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00136147,0.00044325713,0.0014519771,0.0010528944,0.002191788,0.0027019135,0.0021027406,0.0018383372,0.006584801],"category_scores_gemma":[0.0141587015,0.0009825914,0.000735672,0.0013700083,0.003257925,0.005173117,0.003544029,0.0024003477,0.0007734074],"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.0003716151,0.00006646927,0.00085925584,0.00016676335,0.000043502652,0.000308825,0.00052929827,0.20962049,0.002596789,0.76829284,0.0025532185,0.014590873],"study_design_scores_gemma":[0.000043842647,0.00002310537,0.00014158127,0.00003080068,0.000018033837,0.00011430108,0.00015790362,0.37936053,0.0010592764,0.6172289,0.0018019398,0.00001985469],"about_ca_topic_score_codex":0.0029910668,"about_ca_topic_score_gemma":0.0037538798,"teacher_disagreement_score":0.006584801,"about_ca_system_score_codex":0.0017150595,"about_ca_system_score_gemma":0.000866532,"threshold_uncertainty_score":0.022028327},"labels":[],"label_agreement":null},{"id":"W4389719752","doi":"10.1016/j.tcs.2023.114343","title":"A note on the Lie complexity and beyond","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Simple Lie group; Lie theory; Representation of a Lie group; Adjoint representation of a Lie algebra; Prefix; Algebra over a field; Discrete mathematics; Pure mathematics; Lie group; Lie conformal algebra; Linguistics; Philosophy","score_opus":0.02409785001389637,"score_gpt":0.2646157875610625,"score_spread":0.24051793754716616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389719752","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.024428269,0.08135949,0.14270966,0.287172,0.02167237,0.00004450062,0.00047600735,0.0003342753,0.44180351],"genre_scores_gemma":[0.68164605,0.047006823,0.05816794,0.04614896,0.07061575,0.0002398331,0.00040223307,0.0005006855,0.09527175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998638,0.00057392655,0.000054885568,0.00023911337,0.0003840687,0.00011009116],"domain_scores_gemma":[0.99287134,0.0056832116,0.0001590283,0.00059532,0.0004514247,0.00023959375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002473897,0.0007032238,0.001417223,0.0019486219,0.0030544868,0.004107935,0.0017137342,0.0034916026,0.0101406295],"category_scores_gemma":[0.0070885303,0.0003799814,0.0010618439,0.0015877511,0.01289038,0.01956604,0.0045155142,0.009053673,0.0016833616],"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.0000050485883,0.0000037761224,0.000023068767,0.000016407046,0.000002294374,0.000022111975,0.00007151965,0.000090972106,0.00004333181,0.9939964,0.004225596,0.001499358],"study_design_scores_gemma":[0.000002418555,0.0000020499365,0.000018858831,0.00000808555,9.0259203e-7,0.0000133010635,0.000019166357,0.0001978796,0.000020730731,0.9898517,0.009860969,0.000003937461],"about_ca_topic_score_codex":0.0012739962,"about_ca_topic_score_gemma":0.0012691886,"teacher_disagreement_score":0.0101406295,"about_ca_system_score_codex":0.0017508967,"about_ca_system_score_gemma":0.00086350297,"threshold_uncertainty_score":0.033923805},"labels":[],"label_agreement":null},{"id":"W4390338595","doi":"10.1016/j.tcs.2023.114363","title":"Proving properties of some greedily-defined integer recurrences via automata theory","year":2023,"lang":"en","type":"article","venue":"Theoretical 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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Simple (philosophy); Conjecture; Automaton; Integer (computer science); Property (philosophy); Sequence (biology); Integer sequence; Discrete mathematics; Mathematics; Automata theory; Computer science; Combinatorics; Integer programming; Algorithm; Theoretical computer science; Generating function; Programming language","score_opus":0.01861407997515179,"score_gpt":0.2358628531487552,"score_spread":0.21724877317360342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390338595","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.24896379,0.0004921905,0.72463197,0.000986888,0.00014549296,0.00012018972,0.00018731548,0.0006626789,0.023809494],"genre_scores_gemma":[0.8703451,0.00027611354,0.12330064,0.00037874808,0.0000735137,0.00013445654,0.00015228194,0.00012767255,0.005211381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838734,0.0005034179,0.00015619419,0.00040612297,0.00034128613,0.00020560595],"domain_scores_gemma":[0.9928698,0.005014816,0.00060050003,0.0007463454,0.00056847365,0.00020006429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019949537,0.00046736433,0.0005358666,0.0013647517,0.0015367036,0.002216396,0.0010173125,0.0009010861,0.0030138132],"category_scores_gemma":[0.012213343,0.0004395359,0.0014275502,0.000875829,0.0033290882,0.005933212,0.0013510507,0.0023691787,0.0005391226],"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.00005651112,0.00003145005,0.0009215778,0.000062895335,0.000015914644,0.0001535755,0.0006412269,0.0044163275,0.005647637,0.9760449,0.00047940263,0.011528586],"study_design_scores_gemma":[0.000028417226,0.00007509775,0.00037926144,0.000030783012,0.00002969447,0.00023568743,0.00023911327,0.039918747,0.015616372,0.9390247,0.0043834574,0.000038685037],"about_ca_topic_score_codex":0.0011338022,"about_ca_topic_score_gemma":0.001041772,"teacher_disagreement_score":0.0030138132,"about_ca_system_score_codex":0.001580359,"about_ca_system_score_gemma":0.00082563824,"threshold_uncertainty_score":0.011466324},"labels":[],"label_agreement":null},{"id":"W4391247836","doi":"10.1016/j.tcs.2024.114416","title":"Edge searching and fast searching with constraints","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; City University of Hong Kong; Glaucoma Research Foundation","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Combinatorics; Algorithm; Artificial intelligence","score_opus":0.009893848445170378,"score_gpt":0.2657364047234484,"score_spread":0.255842556278278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391247836","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.011386048,0.0005609729,0.97913605,0.00025921877,0.00011969287,0.00009978631,0.00024447776,0.0008862842,0.007307398],"genre_scores_gemma":[0.11585894,0.000421725,0.8735668,0.00018507874,0.00007903616,0.00023060104,0.0006420271,0.00074945885,0.008266339],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876887,0.00030992282,0.00007187223,0.00022241707,0.0004969675,0.00012992875],"domain_scores_gemma":[0.9952205,0.002994722,0.00019085963,0.00089935143,0.0005441858,0.0001503278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011597605,0.0012609288,0.0015878938,0.0026099277,0.001146669,0.0016796131,0.002634752,0.0019949318,0.019313265],"category_scores_gemma":[0.011769775,0.0010717129,0.0009536889,0.003987037,0.0011723634,0.0045846235,0.0034114202,0.0024862706,0.002607728],"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.0010342953,0.00023071382,0.001172969,0.00066588435,0.000081852624,0.00029365797,0.00022137945,0.1454667,0.012404597,0.20831469,0.02301371,0.60709953],"study_design_scores_gemma":[0.000115432114,0.00012199155,0.00030217975,0.00007561672,0.00003300912,0.00021691296,0.00007140428,0.84087336,0.008055264,0.13789791,0.012197609,0.000039325256],"about_ca_topic_score_codex":0.0031705392,"about_ca_topic_score_gemma":0.004345626,"teacher_disagreement_score":0.019313265,"about_ca_system_score_codex":0.0005776877,"about_ca_system_score_gemma":0.0010768925,"threshold_uncertainty_score":0.06460935},"labels":[],"label_agreement":null},{"id":"W4392066353","doi":"10.1016/j.tcs.2024.114421","title":"The compatibility of the minimalist foundation with homotopy type theory","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","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":"Canadian Mennonite University; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Constructive; Axiom; Mathematics; Extensional definition; Constructive set theory; Type theory; Extensionality; Foundations of mathematics; Mathematical proof; Type (biology); Algebra over a field; Homotopy; Axiom of choice; Foundation (evidence); Interpretation (philosophy); Pure mathematics; Calculus (dental); Set (abstract data type); Computer science; Discrete mathematics; Set theory; Mathematics education; Programming language","score_opus":0.01414369110853793,"score_gpt":0.25969898968490757,"score_spread":0.24555529857636962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392066353","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.1425605,0.0023560103,0.6826132,0.0064143147,0.00063872396,0.00015007357,0.00080897304,0.00070642534,0.16375189],"genre_scores_gemma":[0.91106033,0.0006869672,0.07732898,0.00085926976,0.0006330685,0.00020828932,0.00039058478,0.00014634538,0.008686134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968786,0.00074107264,0.0002008328,0.0006746243,0.0010939148,0.00041091308],"domain_scores_gemma":[0.99643147,0.0017097353,0.00029043123,0.0006703073,0.00058504345,0.00031308457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028954411,0.00031303932,0.000973286,0.0018764721,0.0022315918,0.003719188,0.0010984715,0.001823281,0.0055519016],"category_scores_gemma":[0.006592014,0.00048773715,0.0014316809,0.00086643785,0.007081322,0.0071951263,0.00506721,0.003768039,0.00092767354],"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.000013235,0.000007216471,0.00019410517,0.000022914199,0.000006007151,0.00003623291,0.00011535864,0.00017546448,0.00024509805,0.9959468,0.0002925196,0.002945028],"study_design_scores_gemma":[0.000015287138,0.00003631618,0.0004890033,0.000031325744,0.000007806239,0.00014233869,0.00005608199,0.0018210874,0.00048325208,0.98972917,0.0071734823,0.000014859964],"about_ca_topic_score_codex":0.0011590432,"about_ca_topic_score_gemma":0.00086703163,"teacher_disagreement_score":0.0055519016,"about_ca_system_score_codex":0.0022155547,"about_ca_system_score_gemma":0.0016149284,"threshold_uncertainty_score":0.018572986},"labels":[],"label_agreement":null},{"id":"W4392245251","doi":"10.1016/j.tcs.2024.114469","title":"Two-stage BP maximization under p-matroid constraint","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Qinglan Project of Jiangsu Province of China; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Submodular set function; Matroid; Parameterized complexity; Maximization; Mathematics; Constraint (computer-aided design); Combinatorics; Monotonic function; Function (biology); Approximation algorithm; Discrete mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.016197485799270432,"score_gpt":0.274274897290326,"score_spread":0.25807741149105556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392245251","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.027319578,0.00030132386,0.9595979,0.0010281014,0.000096315314,0.00020732312,0.00048493448,0.0006469614,0.010317537],"genre_scores_gemma":[0.42351207,0.00033737445,0.554989,0.00052753714,0.0002672109,0.00042505912,0.0009398776,0.00059141,0.018410498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979534,0.000677441,0.00008405308,0.00044602357,0.00039871977,0.0004402668],"domain_scores_gemma":[0.9964887,0.0020009747,0.00015927227,0.0005310853,0.0005027836,0.00031716935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020135534,0.0011744307,0.002094822,0.00076399307,0.0010438418,0.0021422042,0.0036198567,0.0025770722,0.008422211],"category_scores_gemma":[0.0061900443,0.0011721947,0.001382748,0.0016988914,0.0009826593,0.004209535,0.0031970614,0.0024810655,0.001585559],"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.002090466,0.00083987194,0.0029595457,0.0017062457,0.0003441152,0.0010969802,0.00070790434,0.36071724,0.039870918,0.27076933,0.036216114,0.28268123],"study_design_scores_gemma":[0.00009316204,0.0001268879,0.0005022929,0.00002759422,0.000054303735,0.0002396999,0.000053493048,0.8736838,0.006930191,0.11570263,0.0025526036,0.000033179957],"about_ca_topic_score_codex":0.003129888,"about_ca_topic_score_gemma":0.004432934,"teacher_disagreement_score":0.008422211,"about_ca_system_score_codex":0.0013608088,"about_ca_system_score_gemma":0.0032758445,"threshold_uncertainty_score":0.028175175},"labels":[],"label_agreement":null},{"id":"W4392869357","doi":"10.1016/j.tcs.2024.114506","title":"Converting finite width AFAs to nondeterministic and universal finite automata","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic finite automaton; Mathematics; Deterministic finite automaton; Multiplicative function; Finite-state machine; Discrete mathematics; Combinatorics; Deterministic automaton; ω-automaton; String (physics); Automaton; Quantum finite automata; Algorithm; Automata theory; Computer science; Mathematical analysis; Theoretical computer science","score_opus":0.008332763396113298,"score_gpt":0.24151685799936656,"score_spread":0.23318409460325326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392869357","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.07873728,0.00032449237,0.89099026,0.0004926548,0.00044416427,0.0001076791,0.00044173698,0.004930906,0.023530869],"genre_scores_gemma":[0.69721735,0.00036392096,0.2879393,0.0003249749,0.00018993403,0.00014841008,0.0007287747,0.0017036531,0.011383665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986816,0.00025884117,0.00013958375,0.0003301854,0.0003770077,0.00021273266],"domain_scores_gemma":[0.9951066,0.0025527522,0.00019820046,0.0013184696,0.0006886517,0.00013531857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011087159,0.00047070862,0.00061492395,0.0009396895,0.0009126568,0.0034517713,0.0013663261,0.0010270639,0.0051627913],"category_scores_gemma":[0.008846097,0.0007066568,0.0013955649,0.00093418924,0.0018739775,0.0060271802,0.0028930686,0.0027821618,0.0015581948],"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.00017672191,0.000082108505,0.00070918543,0.00014480889,0.00002491172,0.0002341109,0.0008834898,0.013225986,0.009473276,0.8906321,0.0026642154,0.08174912],"study_design_scores_gemma":[0.000023059147,0.000026125601,0.00016258872,0.000040689105,0.00003543897,0.0001179002,0.00019694786,0.04898898,0.011527684,0.9266732,0.01218141,0.00002606612],"about_ca_topic_score_codex":0.0014527017,"about_ca_topic_score_gemma":0.001683284,"teacher_disagreement_score":0.0051627913,"about_ca_system_score_codex":0.0010735824,"about_ca_system_score_gemma":0.0008728298,"threshold_uncertainty_score":0.01727128},"labels":[],"label_agreement":null},{"id":"W4393132206","doi":"10.1016/j.tcs.2024.114476","title":"On the complexity of nucleolus computation for bipartite b-matching games","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Matching (statistics); Mathematics; Complement (music); Computation; Discrete mathematics; 3-dimensional matching; Bounded function; Simple (philosophy); Time complexity; Algorithm; Graph","score_opus":0.062216164890382175,"score_gpt":0.2716958774834759,"score_spread":0.20947971259309373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393132206","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.41423243,0.0016297185,0.51077676,0.0112208575,0.00039590453,0.00048341448,0.0023002648,0.0015098796,0.057450816],"genre_scores_gemma":[0.91490513,0.0008049548,0.07264883,0.00092481903,0.0003859054,0.000365648,0.0014626555,0.00052327575,0.007978874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945527,0.0024433334,0.00027953283,0.00093832583,0.0009071486,0.00087897066],"domain_scores_gemma":[0.92297167,0.06747692,0.0021584863,0.004220392,0.001579357,0.0015931731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039582374,0.0011255522,0.0032662894,0.001626415,0.002766254,0.007568601,0.0041143736,0.0034872782,0.019480068],"category_scores_gemma":[0.041652426,0.0011406993,0.002248396,0.0027959864,0.0038284895,0.01368346,0.0051708748,0.0051073725,0.0015989023],"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.0015250191,0.0004783091,0.0029644768,0.0005017041,0.00018191637,0.0002047757,0.00071518647,0.18082899,0.002437123,0.7549216,0.016117632,0.0391233],"study_design_scores_gemma":[0.000092763956,0.000031667652,0.00027302702,0.000024881912,0.000026538364,0.000038854156,0.00008395284,0.26864102,0.0003637374,0.7297276,0.00067178765,0.000024067946],"about_ca_topic_score_codex":0.006211453,"about_ca_topic_score_gemma":0.006147623,"teacher_disagreement_score":0.019480068,"about_ca_system_score_codex":0.003912686,"about_ca_system_score_gemma":0.004050268,"threshold_uncertainty_score":0.06516737},"labels":[],"label_agreement":null},{"id":"W4394913316","doi":"10.1016/j.tcs.2024.114580","title":"List homomorphisms to separable signed graphs","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Agence Nationale de la Recherche; Univerzita Karlova v Praze; HORIZON EUROPE Framework Programme; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura, Univerzita Karlova; European Commission","keywords":"Signed graph; Separable space; Homomorphism; Mathematics; Focus (optics); Combinatorics; Conjecture; Discrete mathematics; Chordal graph; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.013531344058050261,"score_gpt":0.3004726099934867,"score_spread":0.2869412659354364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394913316","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.3294753,0.0012216263,0.56994003,0.0031463248,0.0010094654,0.00019105869,0.00086281594,0.002469541,0.09168384],"genre_scores_gemma":[0.83811384,0.0014726821,0.072251104,0.0012085134,0.0008071326,0.00026549277,0.0008853081,0.0011032867,0.08389258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906117,0.0002534662,0.00006274087,0.00022047288,0.00023618077,0.00016594907],"domain_scores_gemma":[0.9969708,0.001334776,0.00038586376,0.00039086206,0.00041736648,0.0005002187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008905389,0.0008417631,0.0007124474,0.0033055046,0.0016534328,0.0035667652,0.0013831985,0.0010785557,0.014380368],"category_scores_gemma":[0.0047113094,0.00067891966,0.00091923913,0.003152681,0.0021666442,0.009113814,0.0041049826,0.003301735,0.002494635],"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.0000598729,0.000055025423,0.0001163669,0.000056122317,0.000006056899,0.000089560555,0.00046508602,0.0005432674,0.00097095076,0.97916794,0.0016948959,0.016774934],"study_design_scores_gemma":[0.000018592427,0.000022380897,0.000097203534,0.000016938708,0.000010731877,0.00009660846,0.00015065722,0.0031003226,0.0009076439,0.9906176,0.0049471036,0.000014131792],"about_ca_topic_score_codex":0.0006375111,"about_ca_topic_score_gemma":0.00070531183,"teacher_disagreement_score":0.014380368,"about_ca_system_score_codex":0.0015355772,"about_ca_system_score_gemma":0.00075953046,"threshold_uncertainty_score":0.048107088},"labels":[],"label_agreement":null},{"id":"W4399357727","doi":"10.1016/j.tcs.2024.114676","title":"The zero-visibility cops and robber game on graph products","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Partition (number theory); Vertex (graph theory); Graph; Graph partition; Discrete mathematics; Monotonic function; Zero (linguistics)","score_opus":0.01449946632246951,"score_gpt":0.2950471680457049,"score_spread":0.2805477017232354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399357727","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.508132,0.0006138951,0.37864095,0.002840506,0.00021041687,0.00027422456,0.000604671,0.000304249,0.10837906],"genre_scores_gemma":[0.9426005,0.00035177468,0.02879521,0.0001563862,0.00007542917,0.00013331363,0.0002554324,0.00010695269,0.027524984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985453,0.0005574066,0.000052465493,0.0002836612,0.00026128656,0.000299935],"domain_scores_gemma":[0.99647874,0.0020192647,0.0002797645,0.00035289742,0.00022134656,0.00064806826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011438902,0.0011367601,0.0016935654,0.0010139955,0.0015730057,0.003741544,0.0027125953,0.002873718,0.010649908],"category_scores_gemma":[0.006453891,0.0007729105,0.0007945679,0.0010743298,0.003391377,0.007037226,0.003085651,0.0025554614,0.00069898705],"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.0002734795,0.00011274309,0.00037898036,0.00013688269,0.000041718842,0.00022354959,0.0003683299,0.039356533,0.0013063381,0.9433677,0.004478812,0.009954764],"study_design_scores_gemma":[0.00006673989,0.000061115665,0.00024592507,0.00002997092,0.000022277469,0.00009592158,0.00017705347,0.15215208,0.0005535898,0.84366345,0.0029057655,0.000026117206],"about_ca_topic_score_codex":0.0045159794,"about_ca_topic_score_gemma":0.003540784,"teacher_disagreement_score":0.010649908,"about_ca_system_score_codex":0.001514074,"about_ca_system_score_gemma":0.0016799442,"threshold_uncertainty_score":0.035627544},"labels":[],"label_agreement":null},{"id":"W4399358836","doi":"10.1016/j.tcs.2024.114678","title":"Group encryption: Full dynamicity, message filtering and code-based instantiation","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Key Research and Development Program of China; Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Xi’an Jiaotong-Liverpool University; Shanghai Jiao Tong University; Ministry of Education - Singapore; University of Wollongong; Nanyang Technological University; University of Calgary","keywords":"Encryption; Computer science; Ciphertext; Theoretical computer science; Substring; Code (set theory); Group (periodic table); Group signature; Computer security; Programming language; Public-key cryptography; Data structure","score_opus":0.008000793048411788,"score_gpt":0.2405117744760298,"score_spread":0.23251098142761803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399358836","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.045002032,0.0004541242,0.9401731,0.0011718482,0.00013046262,0.00015758933,0.00020452532,0.0017856659,0.010920596],"genre_scores_gemma":[0.78000724,0.0005288163,0.20528708,0.00052824145,0.0002746264,0.00021644517,0.00046306296,0.00067302986,0.012021574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99499774,0.0012037973,0.00033037533,0.0009262442,0.0015109897,0.001030895],"domain_scores_gemma":[0.989047,0.002264917,0.0005640422,0.0067744963,0.0009682677,0.00038132514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032386635,0.0008153544,0.0016176616,0.0014521948,0.0017147027,0.0041365228,0.0020313621,0.002206992,0.0030180914],"category_scores_gemma":[0.010501486,0.0007617689,0.0013656158,0.0018520233,0.0033252256,0.010187144,0.0055951625,0.003137986,0.0015470181],"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.00052492257,0.00016621745,0.0009631756,0.00011469108,0.000044733788,0.0001872367,0.00040680732,0.02149095,0.009049082,0.87914073,0.0046614055,0.08324995],"study_design_scores_gemma":[0.00008018676,0.00012027704,0.00033787778,0.000057262747,0.00007362457,0.00053155434,0.00007421454,0.19208084,0.015309902,0.78032506,0.010945565,0.00006370819],"about_ca_topic_score_codex":0.0008529494,"about_ca_topic_score_gemma":0.0006999976,"teacher_disagreement_score":0.0041365228,"about_ca_system_score_codex":0.0018359562,"about_ca_system_score_gemma":0.002484742,"threshold_uncertainty_score":0.017127872},"labels":[],"label_agreement":null},{"id":"W4400571454","doi":"10.1016/j.tcs.2024.114728","title":"On suffix tree detection","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Generalized suffix tree; Suffix tree; Compressed suffix array; Suffix; String (physics); Time complexity; Mathematics; K-ary tree; Combinatorics; Tree (set theory); Data structure; Algorithm; Discrete mathematics; Binary tree; Tree structure; Computer science","score_opus":0.007287958903204772,"score_gpt":0.2471090558013316,"score_spread":0.23982109689812683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400571454","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.024636045,0.0035137855,0.95477724,0.0016637408,0.0008334602,0.00012253782,0.000437946,0.0026281148,0.011387157],"genre_scores_gemma":[0.24463281,0.0037223606,0.718825,0.001382364,0.0019660613,0.00024590502,0.0027275372,0.00079639803,0.025701605],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963337,0.00084814633,0.00026898235,0.0007197126,0.0015710017,0.0002583755],"domain_scores_gemma":[0.989555,0.005677189,0.00032491368,0.0024513905,0.0017628907,0.00022876168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020349217,0.0012310205,0.0020087126,0.0040789032,0.0016822818,0.002942049,0.0023557553,0.0024749846,0.007992485],"category_scores_gemma":[0.015881928,0.00089076767,0.0008859535,0.0061199297,0.0017019218,0.0062894667,0.0038423394,0.0021070354,0.004315663],"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.00058648706,0.00015487807,0.0019098944,0.00023345444,0.00010280763,0.00023744651,0.00018032773,0.02149893,0.015612981,0.06492753,0.0204623,0.87409294],"study_design_scores_gemma":[0.00006130202,0.0002071494,0.0015017586,0.00011450978,0.000106763146,0.0012160771,0.00015612453,0.6733366,0.024205118,0.26421666,0.03480858,0.00006929537],"about_ca_topic_score_codex":0.0021154245,"about_ca_topic_score_gemma":0.0024733031,"teacher_disagreement_score":0.007992485,"about_ca_system_score_codex":0.0009340967,"about_ca_system_score_gemma":0.0015648184,"threshold_uncertainty_score":0.026737511},"labels":[],"label_agreement":null},{"id":"W4401269927","doi":"10.1016/j.tcs.2024.114761","title":"Overcoming probabilistic faults in disoriented linear search","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences; Toronto Metropolitan University","keywords":"Probabilistic logic; Competitive analysis; Randomized algorithm; Deterministic algorithm; Mathematics; Algorithm; Path (computing); Constant (computer programming); Computer science; Leverage (statistics); Mathematical optimization; Upper and lower bounds; Artificial intelligence","score_opus":0.01692713087326652,"score_gpt":0.29772330390821694,"score_spread":0.2807961730349504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401269927","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.19795132,0.0014004975,0.7879021,0.0016928243,0.000263225,0.0000746209,0.00008665162,0.0023119473,0.00831677],"genre_scores_gemma":[0.90853506,0.00025691555,0.087717704,0.00027728404,0.00008216473,0.000058317157,0.00007318637,0.00022511666,0.0027742938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828607,0.00064837746,0.00011040621,0.0002255257,0.0005321427,0.00019734756],"domain_scores_gemma":[0.98532397,0.010134119,0.0010331685,0.0018759066,0.0012398176,0.0003930509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003036739,0.0005993802,0.001124984,0.0008022231,0.0006677388,0.0015405377,0.0020470445,0.0015568332,0.002731528],"category_scores_gemma":[0.026220087,0.00064203417,0.0004112102,0.0011505849,0.0019648755,0.003905209,0.0022920235,0.0020573784,0.00039188133],"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.000974144,0.00012734205,0.003676384,0.0002702694,0.00006441471,0.00025522872,0.00030142046,0.7384797,0.003002783,0.100004725,0.003341812,0.1495018],"study_design_scores_gemma":[0.000037846803,0.00010000778,0.00025471117,0.00001631611,0.000018526365,0.0000760761,0.00004299165,0.914182,0.0010222876,0.08337068,0.0008672763,0.000011261773],"about_ca_topic_score_codex":0.0023709023,"about_ca_topic_score_gemma":0.002698539,"teacher_disagreement_score":0.003036739,"about_ca_system_score_codex":0.0012635575,"about_ca_system_score_gemma":0.0016022079,"threshold_uncertainty_score":0.016059995},"labels":[],"label_agreement":null},{"id":"W4401560526","doi":"10.1016/j.tcs.2024.114780","title":"On the difference set of two transductions","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Mathematics; Combinatorics; Discrete mathematics; Computer science; Programming language","score_opus":0.015666242829783853,"score_gpt":0.26695198594823516,"score_spread":0.2512857431184513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401560526","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.5853982,0.0013335325,0.31689203,0.0029305222,0.00057481916,0.00007687651,0.00072878745,0.00042376865,0.09164146],"genre_scores_gemma":[0.949737,0.0004399155,0.033856124,0.00047319438,0.00022249631,0.00011251406,0.00076380855,0.0001441442,0.014250768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969361,0.00079929805,0.00023291666,0.00072351954,0.0008732776,0.00043484653],"domain_scores_gemma":[0.99145526,0.006081252,0.00042199995,0.00060500664,0.0007647848,0.00067156163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024518485,0.00074134977,0.0014262784,0.0034899635,0.0026287157,0.0061585405,0.00207558,0.0023024168,0.0077788024],"category_scores_gemma":[0.006782816,0.0010762669,0.0017286077,0.002121487,0.006292391,0.011233348,0.005648592,0.0042900895,0.0009168849],"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.000068775065,0.000023339051,0.0001940346,0.000020702351,0.000007178161,0.00007533608,0.0003210407,0.0006940801,0.0007534588,0.99448955,0.00027591136,0.0030766225],"study_design_scores_gemma":[0.000020511865,0.000026217218,0.00015586735,0.000015098215,0.000007757943,0.00009198375,0.000109660316,0.005495803,0.0004823324,0.992342,0.0012376291,0.000015101339],"about_ca_topic_score_codex":0.0010006179,"about_ca_topic_score_gemma":0.0005571061,"teacher_disagreement_score":0.0077788024,"about_ca_system_score_codex":0.002668482,"about_ca_system_score_gemma":0.0008390572,"threshold_uncertainty_score":0.026022673},"labels":[],"label_agreement":null},{"id":"W4402161717","doi":"10.1016/j.tcs.2024.114782","title":"Binary distinguishability operation","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Mathematics; Algorithm; Programming language","score_opus":0.008019538985371126,"score_gpt":0.2567818053675138,"score_spread":0.2487622663821427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402161717","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.06760219,0.0017720561,0.49111116,0.0082605565,0.0050136987,0.00021602746,0.001740324,0.0022742718,0.4220097],"genre_scores_gemma":[0.7473212,0.0011463497,0.07933542,0.0022694683,0.0019215281,0.0004287701,0.0015414227,0.0009878862,0.16504796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975539,0.00042327895,0.00018800721,0.00082145556,0.000574715,0.0004386558],"domain_scores_gemma":[0.9969976,0.0013727496,0.0001402261,0.0006919587,0.0004790135,0.00031853933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015808669,0.0007222287,0.00087323744,0.0019907742,0.0035092747,0.0049419557,0.0011112387,0.0017308556,0.028900454],"category_scores_gemma":[0.0037523909,0.0005412166,0.0010253702,0.0015770406,0.0047657616,0.010906127,0.0045879083,0.006583429,0.007656996],"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.000034691206,0.000018735625,0.000061314924,0.000023725897,0.0000031142893,0.000028422704,0.00011585127,0.00004631256,0.0014701065,0.9870936,0.001978321,0.009125737],"study_design_scores_gemma":[0.000017342358,0.0000311062,0.0001926934,0.000022575427,0.000015159212,0.00031226888,0.00011457357,0.000881983,0.008278975,0.9409839,0.04911933,0.000030039986],"about_ca_topic_score_codex":0.0003005135,"about_ca_topic_score_gemma":0.00024467777,"teacher_disagreement_score":0.028900454,"about_ca_system_score_codex":0.0011318986,"about_ca_system_score_gemma":0.0011675078,"threshold_uncertainty_score":0.096681595},"labels":[],"label_agreement":null},{"id":"W4402487352","doi":"10.1016/j.tcs.2024.114781","title":"On recursive tiling of some mathematical objects","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Western University","keywords":"Mathematics; Algebra over a field; Combinatorics; Computer science; Discrete mathematics; Theoretical computer science; Algorithm; Pure mathematics","score_opus":0.008791995234660378,"score_gpt":0.24765854332906326,"score_spread":0.2388665480944029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402487352","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.34255412,0.0010710636,0.54979926,0.0009060866,0.00047812294,0.00008627616,0.00023997549,0.000535555,0.10432956],"genre_scores_gemma":[0.854856,0.000709561,0.09994726,0.00044303728,0.00027533784,0.00011898473,0.00032886156,0.000537252,0.04278369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995715,0.00010900806,0.00002951536,0.0001118678,0.000083732004,0.00009430119],"domain_scores_gemma":[0.9990393,0.00048609526,0.000103345286,0.00018422674,0.00009988085,0.00008715277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006020471,0.0005547445,0.0008048974,0.0010650225,0.0015057735,0.0017699231,0.00082006096,0.0008283889,0.006965576],"category_scores_gemma":[0.0022418257,0.00040467258,0.0012231796,0.0009794001,0.0030194074,0.0031815683,0.0018325538,0.0019940804,0.0008272656],"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.000008778645,0.0000045147453,0.000063770785,0.000014439416,0.0000023970313,0.000046460245,0.00016114164,0.001016152,0.0005975632,0.99492127,0.00031779805,0.0028457216],"study_design_scores_gemma":[0.000005480421,0.000010057106,0.000097315344,0.000007406987,0.0000036426616,0.000055921195,0.00004429189,0.007197162,0.0005994813,0.9892236,0.0027480016,0.000007650262],"about_ca_topic_score_codex":0.0014473874,"about_ca_topic_score_gemma":0.0013925232,"teacher_disagreement_score":0.006965576,"about_ca_system_score_codex":0.0010300467,"about_ca_system_score_gemma":0.0003674268,"threshold_uncertainty_score":0.023302197},"labels":[],"label_agreement":null},{"id":"W4403268005","doi":"10.1016/j.tcs.2024.114900","title":"Algorithms for the thief orienteering problem on directed acyclic graphs","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada); Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Directed acyclic graph; Computer science; Combinatorics; Mathematics; Directed graph; Theoretical computer science; Algorithm; Mathematical optimization","score_opus":0.014807567598796405,"score_gpt":0.2794228516752325,"score_spread":0.2646152840764361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403268005","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.02034362,0.00045684265,0.9702138,0.00050321757,0.000091029855,0.00018086708,0.00027361966,0.00079557387,0.007141439],"genre_scores_gemma":[0.2079108,0.0007981289,0.7783681,0.00024586477,0.00015341298,0.00043111865,0.0014887125,0.00046428348,0.010139558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991818,0.00024165338,0.000041258125,0.00025292693,0.00013311823,0.0001492629],"domain_scores_gemma":[0.9958411,0.0031086984,0.00025952273,0.0003567934,0.00026461156,0.0001692216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015419627,0.0016111579,0.0016556501,0.0016265877,0.00095943786,0.0024371417,0.0034729822,0.0027184025,0.009199099],"category_scores_gemma":[0.0065142727,0.0011008562,0.0013397768,0.00247502,0.0011027718,0.0045716763,0.002576804,0.0028787341,0.0013323221],"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.000236686,0.00027721503,0.00082485576,0.00037958397,0.00007313704,0.00008973671,0.00021163067,0.6954941,0.0012366112,0.07868919,0.012556376,0.20993075],"study_design_scores_gemma":[0.0000523918,0.000030519495,0.00009540305,0.000021969166,0.000015573065,0.000022796177,0.00005003596,0.9474309,0.00031415478,0.05041807,0.0015397168,0.000008465701],"about_ca_topic_score_codex":0.008754856,"about_ca_topic_score_gemma":0.0095395325,"teacher_disagreement_score":0.009199099,"about_ca_system_score_codex":0.0016964434,"about_ca_system_score_gemma":0.0019831841,"threshold_uncertainty_score":0.030774117},"labels":[],"label_agreement":null},{"id":"W4403432281","doi":"10.1016/j.tcs.2024.114906","title":"Approximation algorithms for minimum ply covering of points with unit squares and unit disks","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unit (ring theory); Algorithm; Mathematics; Least-squares function approximation; Computer science; Combinatorics; Statistics","score_opus":0.02129523637690096,"score_gpt":0.2817064068411324,"score_spread":0.26041117046423146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403432281","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.15792626,0.001794907,0.82928586,0.00090669084,0.000063936335,0.00018038225,0.0007213364,0.0022904738,0.006830091],"genre_scores_gemma":[0.481663,0.0006784106,0.51252145,0.00017635766,0.000079667385,0.00022757925,0.001561163,0.00030378514,0.002788665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998863,0.00020819835,0.00007802317,0.00029145528,0.00033021453,0.00022914469],"domain_scores_gemma":[0.99694246,0.0016990036,0.0003815436,0.00063634786,0.0001811168,0.00015957077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009006145,0.0010728907,0.0017353516,0.0014094065,0.00093518844,0.0021375937,0.0029055579,0.0017114946,0.004044922],"category_scores_gemma":[0.007626993,0.0008220342,0.0010613742,0.0029208336,0.0009067294,0.0044124066,0.0026093966,0.0014688267,0.0008078387],"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.0011607732,0.00028215637,0.0046208664,0.00053500023,0.00014444877,0.0002415668,0.0007804002,0.6981837,0.008085816,0.052164376,0.013594183,0.22020671],"study_design_scores_gemma":[0.00007432745,0.00006581719,0.0004952345,0.000020833455,0.00001849918,0.0001747999,0.00010216253,0.9634304,0.001759193,0.03162042,0.002226795,0.00001141884],"about_ca_topic_score_codex":0.0038741927,"about_ca_topic_score_gemma":0.0043887575,"teacher_disagreement_score":0.004044922,"about_ca_system_score_codex":0.0021592807,"about_ca_system_score_gemma":0.00091204786,"threshold_uncertainty_score":0.015666783},"labels":[],"label_agreement":null},{"id":"W4403464505","doi":"10.1016/j.tcs.2024.114907","title":"Path partitions of phylogenetic networks","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Division of Mathematical Sciences; National University of Singapore","keywords":"Phylogenetic tree; Path (computing); Mathematics; Computer science; Combinatorics; Theoretical computer science; Biology; Genetics; Computer network; Gene","score_opus":0.00600925611002742,"score_gpt":0.23862277593828973,"score_spread":0.2326135198282623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403464505","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.17943114,0.003698712,0.7671165,0.0026946736,0.00025627672,0.0009781899,0.009096142,0.0016545419,0.035073854],"genre_scores_gemma":[0.57683283,0.0034835422,0.3804689,0.0009923484,0.00037581017,0.0011684366,0.021583993,0.0007198698,0.014374201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977108,0.00055667973,0.00014572614,0.0008210502,0.00051229796,0.000253485],"domain_scores_gemma":[0.9913025,0.0059246086,0.0007194501,0.00085524743,0.00077290554,0.0004253363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011546672,0.0010984249,0.0009219829,0.0028264606,0.0018860087,0.0033661998,0.001575515,0.0016842474,0.011557393],"category_scores_gemma":[0.011079477,0.0010290326,0.0014311594,0.0030116788,0.0022941828,0.008574793,0.002743524,0.002996928,0.0015475706],"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.0005080331,0.0001236033,0.0030371556,0.0009611993,0.00012336952,0.00044786753,0.0018998643,0.10334398,0.0059317136,0.77266335,0.016982205,0.09397775],"study_design_scores_gemma":[0.000041230513,0.000054265573,0.0007735253,0.000103397186,0.000041467385,0.00033996525,0.0002669614,0.10179143,0.001416626,0.8762212,0.018921794,0.000028113356],"about_ca_topic_score_codex":0.0022171647,"about_ca_topic_score_gemma":0.0024276034,"teacher_disagreement_score":0.011557393,"about_ca_system_score_codex":0.002713429,"about_ca_system_score_gemma":0.001147841,"threshold_uncertainty_score":0.038663328},"labels":[],"label_agreement":null},{"id":"W4403523031","doi":"10.1016/j.tcs.2024.114905","title":"On decision problems concerning contextual insertions and deletions","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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 Saskatchewan","funders":"Science and Engineering Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Decision problem; Theoretical computer science; Mathematics; Algorithm","score_opus":0.013864027546685878,"score_gpt":0.27067985772327147,"score_spread":0.2568158301765856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403523031","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.23729526,0.0015404491,0.72493094,0.01071175,0.0003947559,0.00054887554,0.0010341209,0.001046714,0.022497207],"genre_scores_gemma":[0.8240908,0.0009586912,0.1614901,0.0015638686,0.00060243567,0.00043676203,0.0010263885,0.0003380022,0.009493103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98883456,0.004149091,0.0008096383,0.0030701214,0.0015060859,0.0016305245],"domain_scores_gemma":[0.9210916,0.07154088,0.0023088262,0.0021853733,0.0018230848,0.0010502009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010059337,0.0010548065,0.0017240398,0.001301416,0.0030769946,0.005211424,0.0028028334,0.0032788415,0.005899265],"category_scores_gemma":[0.039314814,0.000980478,0.0034172921,0.0017262108,0.0072568078,0.0101818675,0.00401923,0.005916381,0.0005576135],"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.00079090294,0.00023734897,0.0023370052,0.000431285,0.00014174459,0.00084011565,0.0012427744,0.10455793,0.0038955754,0.8513842,0.004006397,0.030134587],"study_design_scores_gemma":[0.000100503494,0.000076221615,0.00029179855,0.00004640182,0.00006559069,0.00023684763,0.0002586003,0.12782826,0.0034839606,0.8647468,0.0028196957,0.0000453092],"about_ca_topic_score_codex":0.003923679,"about_ca_topic_score_gemma":0.0033208572,"teacher_disagreement_score":0.010059337,"about_ca_system_score_codex":0.0044788495,"about_ca_system_score_gemma":0.0036848355,"threshold_uncertainty_score":0.05319953},"labels":[],"label_agreement":null},{"id":"W4404635566","doi":"10.1016/j.tcs.2024.114976","title":"Finer-grained reductions in fine-grained hardness of approximation","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Environment Canada; Israel Science Foundation; European Commission","keywords":"Mathematics","score_opus":0.010950510299227204,"score_gpt":0.26394702072766935,"score_spread":0.2529965104284421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404635566","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.16013317,0.0021303783,0.769959,0.005853813,0.0007419385,0.00017907986,0.0009771202,0.0028196361,0.05720598],"genre_scores_gemma":[0.78113353,0.0007912397,0.196727,0.0016659386,0.00047728076,0.00028055027,0.0012296925,0.0017624691,0.015932146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672914,0.0006641353,0.00019434771,0.0007585889,0.0010702895,0.00058344833],"domain_scores_gemma":[0.9859532,0.0080007035,0.00039848473,0.0044895317,0.00071157765,0.00044663384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002856314,0.0011283993,0.0020203951,0.0017521256,0.0017735477,0.003642915,0.003705823,0.0020292096,0.015199466],"category_scores_gemma":[0.019460745,0.0010135073,0.003192932,0.0014778775,0.0045153857,0.009726225,0.0063359155,0.008683847,0.0015993988],"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.0004064717,0.00023508337,0.0014974787,0.00042602254,0.000106239655,0.00016766414,0.0005058154,0.11271245,0.0040012454,0.8281959,0.011364053,0.04038151],"study_design_scores_gemma":[0.000035851688,0.000029488627,0.00038944054,0.000029004108,0.000031986867,0.000045661513,0.000068398724,0.11671318,0.0009838893,0.8781149,0.0035420272,0.000016159096],"about_ca_topic_score_codex":0.0031226198,"about_ca_topic_score_gemma":0.00470812,"teacher_disagreement_score":0.015199466,"about_ca_system_score_codex":0.002989753,"about_ca_system_score_gemma":0.0013904169,"threshold_uncertainty_score":0.050847232},"labels":[],"label_agreement":null},{"id":"W4404734773","doi":"10.1016/j.tcs.2024.115006","title":"Sign-then-encrypt with security enhancement and compressed ciphertext","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Encryption; Sign (mathematics); Ciphertext; Semantic security; Computer science; Computer security; Mathematics; Attribute-based encryption; Public-key cryptography","score_opus":0.005328427276776619,"score_gpt":0.22753379544122562,"score_spread":0.222205368164449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404734773","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.095500104,0.00055013364,0.8712295,0.002639106,0.00094587146,0.0007024399,0.000570033,0.0026928096,0.02516988],"genre_scores_gemma":[0.8035392,0.00038692058,0.17377172,0.000416207,0.00042159774,0.00020087224,0.00060709665,0.0003098154,0.020346545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997542,0.00046796066,0.0001363954,0.00029319915,0.0010630831,0.0004973037],"domain_scores_gemma":[0.9965904,0.0007121022,0.00017848233,0.0017514881,0.00058586936,0.0001818381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014023468,0.0007460045,0.0010337313,0.000810094,0.0010024436,0.0014571811,0.00072533503,0.0013845612,0.0074282708],"category_scores_gemma":[0.005515956,0.00038488145,0.000998696,0.0008893463,0.001827702,0.0041839383,0.0028886292,0.002142821,0.002716574],"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.00270159,0.00058290764,0.0022120092,0.0005326952,0.00015805433,0.0024579414,0.00062326476,0.036697637,0.10526614,0.58250237,0.02114865,0.24511677],"study_design_scores_gemma":[0.00035320863,0.0006732262,0.0013135276,0.00012708092,0.00022480274,0.004733141,0.00022283431,0.4213053,0.25744808,0.28363866,0.029774625,0.00018562532],"about_ca_topic_score_codex":0.0005196708,"about_ca_topic_score_gemma":0.0006608476,"teacher_disagreement_score":0.0074282708,"about_ca_system_score_codex":0.0007684962,"about_ca_system_score_gemma":0.0022183815,"threshold_uncertainty_score":0.02485001},"labels":[],"label_agreement":null},{"id":"W4404905522","doi":"10.1016/j.tcs.2024.115012","title":"Self-similarity of communities of the ABCD model","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Similarity (geometry); Computer science; Mathematics; Natural language processing; Artificial intelligence","score_opus":0.011179257432995353,"score_gpt":0.2644708579249312,"score_spread":0.25329160049193583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404905522","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.7694123,0.00140433,0.20084447,0.002212678,0.0001357234,0.00013341878,0.0005871899,0.00021250673,0.025057495],"genre_scores_gemma":[0.985622,0.00040003695,0.008607776,0.00011861801,0.000081541686,0.00006551483,0.0001805059,0.000033070537,0.0048910063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925786,0.0003644951,0.000023116729,0.0001338498,0.00011679386,0.000103941435],"domain_scores_gemma":[0.99308217,0.0037277674,0.0007776732,0.00047235988,0.0008679113,0.0010721006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016997836,0.00038892752,0.0014055751,0.0022826043,0.00151315,0.002434931,0.0021811011,0.002208871,0.0052103144],"category_scores_gemma":[0.012162537,0.00049084943,0.00082351523,0.0010951713,0.0018511737,0.0034752404,0.0016383943,0.0009516031,0.00048678755],"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.00021560362,0.0001295552,0.0042801425,0.00016889806,0.000094901654,0.00027499517,0.00047716207,0.1572909,0.0015667536,0.8233352,0.004074432,0.008091516],"study_design_scores_gemma":[0.000041594696,0.000024689112,0.00070444605,0.00001853359,0.00002051677,0.00011326942,0.00013285369,0.66204715,0.00012964464,0.33584204,0.00090523297,0.000020093057],"about_ca_topic_score_codex":0.007445919,"about_ca_topic_score_gemma":0.004068961,"teacher_disagreement_score":0.007445919,"about_ca_system_score_codex":0.0012073381,"about_ca_system_score_gemma":0.0008174867,"threshold_uncertainty_score":0.017430246},"labels":[],"label_agreement":null},{"id":"W4406943783","doi":"10.1016/j.tcs.2025.115091","title":"A subquadratic certification scheme for P5-free graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical 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":"Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Certification; Scheme (mathematics); Mathematics; Programming language; Computer science; Discrete mathematics; Combinatorics; Calculus (dental); Medicine; Economics; Management","score_opus":0.021426337706722795,"score_gpt":0.31762652775782085,"score_spread":0.29620019005109804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406943783","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.1724101,0.0006829909,0.7897788,0.0020318073,0.00022990612,0.00063349697,0.001201932,0.010744606,0.02228638],"genre_scores_gemma":[0.81479263,0.00026864972,0.17439412,0.00050094276,0.00012538847,0.00039300928,0.0010057938,0.0005397185,0.007979645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953766,0.00076088443,0.00022356492,0.0013091146,0.0013084975,0.0010213716],"domain_scores_gemma":[0.97998476,0.0071553555,0.0014232573,0.008842466,0.0012522169,0.0013418698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036946447,0.00094291597,0.0015334185,0.0010692659,0.0023452444,0.0037749577,0.004188667,0.0019592629,0.013703844],"category_scores_gemma":[0.013450086,0.00073370116,0.0013676266,0.0018681171,0.0027511287,0.009525621,0.007888618,0.004182502,0.0027800987],"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.0051588686,0.0006793552,0.004335065,0.0013560947,0.00016514535,0.0006502749,0.0010668958,0.13504289,0.06352559,0.48275396,0.025091339,0.28017458],"study_design_scores_gemma":[0.0006591,0.000784451,0.0022590607,0.00016430057,0.00022768047,0.00079190155,0.00022878672,0.5114767,0.03572397,0.42598125,0.021493593,0.00020916133],"about_ca_topic_score_codex":0.0024498785,"about_ca_topic_score_gemma":0.0024929815,"teacher_disagreement_score":0.013703844,"about_ca_system_score_codex":0.0033603755,"about_ca_system_score_gemma":0.004163875,"threshold_uncertainty_score":0.04584396},"labels":[],"label_agreement":null},{"id":"W4408140300","doi":"10.1016/j.tcs.2025.115160","title":"On 1-planar graphs with bounded cop-number","year":2025,"lang":"en","type":"article","venue":"Theoretical 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Planar graph; Mathematics; Combinatorics; Planar; Discrete mathematics; 1-planar graph; Outerplanar graph; Pathwidth; Chordal graph; Graph; Computer science; Line graph; Mathematical analysis","score_opus":0.008572124148925313,"score_gpt":0.28842919260586986,"score_spread":0.2798570684569445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408140300","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.5566273,0.0034929342,0.3442279,0.0052800463,0.00023293211,0.00026053732,0.0024933086,0.0008882361,0.08649683],"genre_scores_gemma":[0.9003902,0.0044521624,0.06931291,0.0009849217,0.0005261421,0.00041386392,0.0028813537,0.0005549552,0.020483492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983485,0.00042099066,0.000058929574,0.00046152677,0.00032348582,0.00038666461],"domain_scores_gemma":[0.9899949,0.006306078,0.0015583234,0.00068430457,0.0005277588,0.0009286243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008070063,0.0020250336,0.0019639463,0.002627843,0.002295163,0.0034107035,0.002079359,0.0023222256,0.008253999],"category_scores_gemma":[0.008866628,0.0010259427,0.0015236514,0.0025639983,0.0037798998,0.007290326,0.003273045,0.003318981,0.0017403342],"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.00048428736,0.00015547904,0.0026458385,0.00049473846,0.00008435483,0.0009926655,0.0008555553,0.13557187,0.005801235,0.81887347,0.010294179,0.023746198],"study_design_scores_gemma":[0.000091588,0.00009643271,0.0011406983,0.00011325356,0.000053556814,0.00060846156,0.00025956854,0.1564032,0.001775469,0.8298399,0.009552745,0.00006512294],"about_ca_topic_score_codex":0.0036650423,"about_ca_topic_score_gemma":0.0028810962,"teacher_disagreement_score":0.008253999,"about_ca_system_score_codex":0.0034400013,"about_ca_system_score_gemma":0.00088258326,"threshold_uncertainty_score":0.027612329},"labels":[],"label_agreement":null},{"id":"W4408393303","doi":"10.1016/j.tcs.2025.115152","title":"The exact spanning ratio of the parallelogram Delaunay graph","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delaunay triangulation; Parallelogram; Combinatorics; Mathematics; Graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.006757272174536745,"score_gpt":0.2535937312630897,"score_spread":0.24683645908855295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408393303","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.52866626,0.0032239603,0.3858466,0.0012201848,0.00019180245,0.00007379838,0.0011911681,0.00087722327,0.07870894],"genre_scores_gemma":[0.93431747,0.0008369342,0.060591035,0.000083073115,0.00008109504,0.00004626291,0.00040701017,0.00021661217,0.0034205937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994029,0.00016312164,0.000021549136,0.00013304588,0.00022288559,0.000056504497],"domain_scores_gemma":[0.9982317,0.0011368335,0.0001579113,0.00019201344,0.00019539318,0.00008616362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068182644,0.00044708012,0.00048055325,0.0016944588,0.0004483265,0.0011442465,0.0011060549,0.00086248654,0.006572557],"category_scores_gemma":[0.008370362,0.0003440334,0.00024636622,0.0010050485,0.00093118695,0.0027126959,0.0010739205,0.00070719334,0.00081087317],"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.00038299582,0.00008376226,0.0036571568,0.00051195594,0.000062760766,0.00034125076,0.00037250278,0.2784272,0.012039184,0.5320539,0.009420195,0.16264711],"study_design_scores_gemma":[0.00002379766,0.00006942738,0.0022498986,0.000059977327,0.000030815616,0.000568492,0.00024189243,0.65318227,0.004682794,0.3329238,0.0059342883,0.0000325986],"about_ca_topic_score_codex":0.0010485947,"about_ca_topic_score_gemma":0.0009880451,"teacher_disagreement_score":0.006572557,"about_ca_system_score_codex":0.0005757089,"about_ca_system_score_gemma":0.000376455,"threshold_uncertainty_score":0.021987379},"labels":[],"label_agreement":null},{"id":"W4408421927","doi":"10.1016/j.tcs.2025.115183","title":"TCS Special Issue on Selected Papers from AlgoWin 2023","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"2D Materials and Applications","field":"Materials 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":"Carleton University; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Computer science; Mathematical economics","score_opus":0.005706109503703983,"score_gpt":0.24822863816442087,"score_spread":0.24252252866071689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408421927","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.0030875802,0.045830008,0.0037846565,0.028232215,0.54902464,0.0003048303,0.0056406683,0.001180644,0.36291477],"genre_scores_gemma":[0.0045172162,0.014775887,0.0009829856,0.002901535,0.07821779,0.00007376629,0.003367763,0.00096165854,0.8942014],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933547,0.00005447788,0.00003326798,0.00011055199,0.0003775936,0.00008855308],"domain_scores_gemma":[0.9979882,0.00021749182,0.000081065315,0.00009481111,0.0010360508,0.0005822998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078775076,0.001724881,0.0012718339,0.0039128605,0.0015439991,0.004033449,0.0009630536,0.0012250311,0.26157054],"category_scores_gemma":[0.0016439721,0.00034821083,0.0007592269,0.0034154723,0.00031759718,0.001617198,0.0016078094,0.001588539,0.13724342],"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.000046135923,0.000019238845,0.000042630236,0.00013960717,0.0000072407047,0.000036238933,0.000006212191,0.00008460048,0.0004395164,0.00049438834,0.9679166,0.030767545],"study_design_scores_gemma":[0.000010402134,0.000027221035,0.000378387,0.00008029662,0.000010034565,0.000048900532,0.00001464828,0.00016228919,0.00034279283,0.0005295601,0.9983895,0.0000060293487],"about_ca_topic_score_codex":0.0027481474,"about_ca_topic_score_gemma":0.009553482,"teacher_disagreement_score":0.26157054,"about_ca_system_score_codex":0.001917428,"about_ca_system_score_gemma":0.001824863,"threshold_uncertainty_score":0.87504065},"labels":[],"label_agreement":null},{"id":"W4408667083","doi":"10.1016/j.tcs.2025.115190","title":"Improved algorithms for optimal k sink location on path networks","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Science and Technology Agency; Research Grants Council, University Grants Committee; Japan Society for the Promotion of Science; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Path (computing); Sink (geography); Computer science; Mathematics; Computer network; Geography","score_opus":0.008280889676144442,"score_gpt":0.25603675457510383,"score_spread":0.2477558648989594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408667083","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.011940042,0.00031496005,0.9831049,0.00022430341,0.00011508355,0.00013605197,0.00015701893,0.001396604,0.0026110543],"genre_scores_gemma":[0.14110683,0.00031264185,0.8527394,0.00011696831,0.000109496395,0.00027010567,0.00046346668,0.00025569188,0.0046253833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979559,0.00057089824,0.00013971265,0.00046581653,0.00056136027,0.0003062371],"domain_scores_gemma":[0.995644,0.0024074402,0.00028947668,0.00083636335,0.00068609463,0.00013662674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001796285,0.0020437362,0.0021934279,0.0022581685,0.001448216,0.0021031518,0.0043124924,0.0022950864,0.009223234],"category_scores_gemma":[0.010580079,0.0011394254,0.0011520359,0.0034758502,0.0014471683,0.004668048,0.0043837745,0.002173558,0.0023095445],"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.00062813977,0.00019799557,0.0010578264,0.000284092,0.00008153007,0.00012388676,0.00033313088,0.67480546,0.004355006,0.03813416,0.009429536,0.27056918],"study_design_scores_gemma":[0.000077727775,0.00005204748,0.00017385698,0.000014522519,0.000022930799,0.0000485866,0.000049393966,0.9760543,0.0012443105,0.020727258,0.001516015,0.000019078152],"about_ca_topic_score_codex":0.009772519,"about_ca_topic_score_gemma":0.011713387,"teacher_disagreement_score":0.009772519,"about_ca_system_score_codex":0.002534735,"about_ca_system_score_gemma":0.0028613503,"threshold_uncertainty_score":0.030854762},"labels":[],"label_agreement":null},{"id":"W4408691154","doi":"10.1016/j.tcs.2025.115192","title":"A theory of fine-grained lineage for functions on structured objects","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Lineage (genetic); Mathematics; Theoretical computer science; Biology; Genetics; Gene","score_opus":0.05169957440451233,"score_gpt":0.3617755050164918,"score_spread":0.31007593061197947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408691154","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.0050490634,0.00040007458,0.98896515,0.0006019384,0.00005094485,0.00007114163,0.00008639737,0.0002002531,0.0045751194],"genre_scores_gemma":[0.21185423,0.001201378,0.7760132,0.00090383436,0.00037861735,0.00072290614,0.00046645984,0.00033471404,0.008124718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960224,0.0011558584,0.0003967701,0.000821546,0.0011995333,0.00040381434],"domain_scores_gemma":[0.9897653,0.0054255915,0.0008203621,0.002713427,0.0010073445,0.00026799712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007899488,0.00086469104,0.0009199998,0.0028560534,0.0032825228,0.006145902,0.0026543115,0.0031931521,0.0044206046],"category_scores_gemma":[0.015788628,0.001042677,0.0026244149,0.0030273427,0.010706069,0.018755887,0.0049442733,0.0038899784,0.00090095814],"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.000006850124,0.000005498798,0.0001598576,0.000032155353,0.0000057970706,0.00004921198,0.0002648128,0.0027398875,0.00038488684,0.9916741,0.00028842202,0.004388457],"study_design_scores_gemma":[0.000012581674,0.00003286368,0.00015083596,0.000046133817,0.000020910475,0.0001895327,0.0000786603,0.02686186,0.0011359476,0.9515738,0.019873023,0.000023845216],"about_ca_topic_score_codex":0.002637154,"about_ca_topic_score_gemma":0.0017676651,"teacher_disagreement_score":0.007899488,"about_ca_system_score_codex":0.0029855769,"about_ca_system_score_gemma":0.0023452211,"threshold_uncertainty_score":0.041777015},"labels":[],"label_agreement":null},{"id":"W4409252201","doi":"10.1016/j.tcs.2025.115234","title":"Vertex-critical graphs in co-gem-free graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","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 Prince Edward Island; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Chordal graph; Mathematics; Graph; Computer science; Discrete mathematics","score_opus":0.01258889013089405,"score_gpt":0.3244643890253385,"score_spread":0.31187549889444444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409252201","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.8990735,0.00038237864,0.09095636,0.0003424405,0.000024141938,0.00007503318,0.00050374004,0.00038572328,0.0082567325],"genre_scores_gemma":[0.9798023,0.00011359261,0.017411498,0.000081618884,0.000019242401,0.000050544084,0.0004902039,0.000042637505,0.001988329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993729,0.00007166211,0.000040348437,0.00022375122,0.00011894403,0.00017242318],"domain_scores_gemma":[0.994616,0.0033012545,0.00068722863,0.00057346164,0.00034694417,0.00047522195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055040093,0.00040110192,0.00041687302,0.0013630353,0.0011169161,0.001736469,0.0007705898,0.00056468416,0.002903304],"category_scores_gemma":[0.0034392755,0.00051090424,0.00060230674,0.00086144183,0.0022381193,0.0024071387,0.0017210748,0.0010965243,0.00020167588],"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.0013490714,0.00026299772,0.038163833,0.0009658404,0.00012494868,0.0013841623,0.0034684858,0.06313503,0.08074953,0.73871124,0.0043027536,0.06738214],"study_design_scores_gemma":[0.00014552461,0.000221017,0.0129946545,0.00010804379,0.00013840839,0.0017156828,0.0013196288,0.089529954,0.065890126,0.8110271,0.016817333,0.0000924858],"about_ca_topic_score_codex":0.0022450436,"about_ca_topic_score_gemma":0.0028282998,"teacher_disagreement_score":0.002903304,"about_ca_system_score_codex":0.0012900328,"about_ca_system_score_gemma":0.0007186154,"threshold_uncertainty_score":0.009712577},"labels":[],"label_agreement":null},{"id":"W4409359688","doi":"10.1016/j.tcs.2025.115248","title":"On the existence of EFX (and Pareto-optimal) allocations for binary chores","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Science and Technology Development Fund; National Natural Science Foundation of China","keywords":"Pareto optimal; Binary number; Pareto principle; Mathematics; Combinatorics; Mathematical economics; Mathematical optimization; Computer science; Multi-objective optimization; Arithmetic","score_opus":0.024383141185406566,"score_gpt":0.2482467532580235,"score_spread":0.22386361207261693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409359688","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.33459067,0.001261783,0.5604527,0.0054040104,0.00013470354,0.00034024823,0.0007050268,0.00041933008,0.09669156],"genre_scores_gemma":[0.89269656,0.0010808918,0.08909763,0.00058856973,0.00015099008,0.00063007313,0.00038664814,0.00019779947,0.015170846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942827,0.0032303466,0.00029310197,0.00060849823,0.0006140772,0.00097119116],"domain_scores_gemma":[0.938307,0.0516632,0.003451206,0.0026333982,0.0021660018,0.0017793349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009749235,0.0012837009,0.0031042562,0.0028075874,0.0035732193,0.006166984,0.0024727338,0.004641077,0.01474771],"category_scores_gemma":[0.06499473,0.0019590212,0.00149231,0.002619022,0.008143194,0.0124245575,0.0057487744,0.005055255,0.0015014132],"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.0001278782,0.000057737812,0.0003689102,0.00009125614,0.000016636055,0.000032948814,0.00028328763,0.017902456,0.00029709275,0.9730272,0.0012273743,0.0065672374],"study_design_scores_gemma":[0.000039316834,0.000017907396,0.00016882383,0.00003774858,0.0000065490885,0.000022706128,0.000114411036,0.03327576,0.00015148633,0.9655588,0.0005944446,0.000011935679],"about_ca_topic_score_codex":0.0026397917,"about_ca_topic_score_gemma":0.0020588767,"teacher_disagreement_score":0.01474771,"about_ca_system_score_codex":0.0036348416,"about_ca_system_score_gemma":0.004171789,"threshold_uncertainty_score":0.051559508},"labels":[],"label_agreement":null},{"id":"W4409371624","doi":"10.1016/j.tcs.2025.115228","title":"Stable finiteness of monoid algebras and surjunctivity","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mathematical and Theoretical Analysis","field":"Mathematics","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é de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Monoid; Syntactic monoid; Free monoid; Mathematics; Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.015474764524539412,"score_gpt":0.27954358104295857,"score_spread":0.2640688165184192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409371624","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.58611256,0.0046703387,0.26711407,0.0024518364,0.0004559608,0.000087706925,0.00074736675,0.00052309554,0.13783696],"genre_scores_gemma":[0.9792906,0.00070576655,0.009573098,0.00020711045,0.00023382256,0.00005221104,0.00038428773,0.00006899414,0.009484062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973774,0.00060053536,0.00025282387,0.0007663506,0.00063005823,0.00037292464],"domain_scores_gemma":[0.99159604,0.0044750497,0.0005738684,0.0010515193,0.0015265645,0.0007769402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033562419,0.00085062324,0.0012975748,0.0028870776,0.0034026045,0.006244709,0.0019156192,0.0011048544,0.00641848],"category_scores_gemma":[0.0058447327,0.0011556008,0.0018928571,0.002047697,0.0072094295,0.015029662,0.003985271,0.0033859806,0.00067019335],"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.00003937714,0.000021788657,0.0003620719,0.00004074809,0.000019658839,0.00007635576,0.0005158968,0.0002920555,0.00055178325,0.9953601,0.0002128438,0.002507252],"study_design_scores_gemma":[0.0000108234635,0.000014889363,0.00022493344,0.00000983441,0.0000146906705,0.00007844718,0.00013409361,0.0008117754,0.00061528286,0.9969643,0.0011092391,0.000011745802],"about_ca_topic_score_codex":0.0014767775,"about_ca_topic_score_gemma":0.0013556812,"teacher_disagreement_score":0.00641848,"about_ca_system_score_codex":0.0020796608,"about_ca_system_score_gemma":0.0011876227,"threshold_uncertainty_score":0.021471918},"labels":[],"label_agreement":null},{"id":"W4409449443","doi":"10.1016/j.tcs.2025.115258","title":"Approximation algorithms for maximum weighted throughput on unrelated machines","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Throughput; Algorithm; Computer science; Approximation algorithm; Mathematics","score_opus":0.009445664617846294,"score_gpt":0.2547615915623328,"score_spread":0.2453159269444865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409449443","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.011716444,0.00058280164,0.9827603,0.00047700896,0.00014673278,0.00010138122,0.00015194832,0.0006898941,0.0033735118],"genre_scores_gemma":[0.3552369,0.0013319568,0.63002914,0.00041923657,0.00050006673,0.000790622,0.0008428988,0.0009046973,0.009944432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596184,0.0016506916,0.00016725076,0.00064071745,0.0008882503,0.00069127243],"domain_scores_gemma":[0.98390204,0.0125692375,0.0007003171,0.0014393382,0.0008950378,0.00049399224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007815523,0.0028066477,0.0033955344,0.0024970768,0.0015491328,0.003773538,0.007396444,0.0031572431,0.009208735],"category_scores_gemma":[0.032628853,0.002110752,0.002144144,0.005717945,0.002078468,0.0072834487,0.0040089167,0.0048959274,0.0016384154],"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.0005099398,0.00022147952,0.00048322178,0.00026700145,0.000100116195,0.000052942098,0.00018647779,0.8538896,0.000949881,0.07291868,0.0058709243,0.06454971],"study_design_scores_gemma":[0.000029245446,0.00001862373,0.000046672314,0.000013024319,0.000017926142,0.000012261544,0.000014465195,0.9619652,0.00021848385,0.037280265,0.00037820265,0.000005578733],"about_ca_topic_score_codex":0.0058313184,"about_ca_topic_score_gemma":0.006321663,"teacher_disagreement_score":0.009208735,"about_ca_system_score_codex":0.005573751,"about_ca_system_score_gemma":0.0036930179,"threshold_uncertainty_score":0.04133296},"labels":[],"label_agreement":null},{"id":"W4410091070","doi":"10.1016/j.tcs.2025.115280","title":"Maximal universal width of an AFA is NP-hard","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Computer science; Algorithm; Discrete mathematics","score_opus":0.006597708026147521,"score_gpt":0.2374176688564213,"score_spread":0.23081996083027378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410091070","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.66078305,0.0020282173,0.27553108,0.009858514,0.00045765555,0.00042994745,0.006802767,0.0049366406,0.039172076],"genre_scores_gemma":[0.91591,0.0006860005,0.07037992,0.00093591434,0.00037377476,0.0002676251,0.0025479977,0.00063881045,0.008259919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974769,0.00033774722,0.0002473357,0.0009638812,0.0003452308,0.0006289834],"domain_scores_gemma":[0.97886294,0.01656619,0.0010182392,0.0013744022,0.0006998933,0.0014782606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020076232,0.001451742,0.0030634457,0.001215869,0.003199714,0.0074823685,0.0035892972,0.0029216032,0.011436132],"category_scores_gemma":[0.012986683,0.0017838301,0.003438844,0.0021248327,0.0029277536,0.016069027,0.0043563554,0.0058236136,0.0012457691],"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.004566738,0.0013298119,0.014501304,0.0039482345,0.0010458028,0.0017315705,0.004693275,0.10774555,0.040239155,0.6116365,0.033820674,0.17474134],"study_design_scores_gemma":[0.00026969519,0.00015146863,0.0010839205,0.00015978866,0.00032434208,0.0008631229,0.0010417423,0.10168655,0.008913507,0.87856,0.006866231,0.000079684956],"about_ca_topic_score_codex":0.0022714583,"about_ca_topic_score_gemma":0.0032414878,"teacher_disagreement_score":0.011436132,"about_ca_system_score_codex":0.0024482661,"about_ca_system_score_gemma":0.0022965248,"threshold_uncertainty_score":0.03825766},"labels":[],"label_agreement":null},{"id":"W4411137410","doi":"10.1016/j.tcs.2025.115395","title":"Sniffing helps to meet: Deterministic rendezvous of anonymous agents in the grid","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","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":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Università degli Studi di Milano-Bicocca; Université du Québec en Outaouais","keywords":"Sniffing; Rendezvous; Computer science; Grid; Computer security; Distributed computing; Mathematics; Psychology; Engineering","score_opus":0.021273114272894248,"score_gpt":0.31530384470650036,"score_spread":0.2940307304336061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411137410","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.47874448,0.00021336308,0.5064393,0.00072175777,0.00008459313,0.00013702904,0.00014922956,0.0005677793,0.012942435],"genre_scores_gemma":[0.9564727,0.00007272234,0.039758272,0.000044407796,0.000013884252,0.00005521903,0.000054286,0.00003906034,0.0034894326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872726,0.00037538138,0.00006301416,0.00024720904,0.00023816976,0.00034907734],"domain_scores_gemma":[0.9958502,0.001952758,0.0006823499,0.00078035373,0.00029813324,0.00043620978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011106853,0.00043164098,0.00077417423,0.00044984018,0.00186058,0.0012551042,0.001653702,0.0011404249,0.0022966966],"category_scores_gemma":[0.0067429524,0.0003705102,0.00084591424,0.0005496324,0.0022184374,0.0021658454,0.002788116,0.0008290202,0.00039699808],"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.0009907047,0.0001125181,0.00539578,0.000119051634,0.00009000581,0.0016310399,0.001139655,0.7625768,0.0079072965,0.19508368,0.0016739354,0.023279468],"study_design_scores_gemma":[0.000088221284,0.0001138386,0.0005388687,0.000012317289,0.000020935215,0.00026609722,0.00039652354,0.8961879,0.0029680845,0.09667609,0.0026981197,0.000033025044],"about_ca_topic_score_codex":0.0061316057,"about_ca_topic_score_gemma":0.004681176,"teacher_disagreement_score":0.0061316057,"about_ca_system_score_codex":0.0009792312,"about_ca_system_score_gemma":0.0009549409,"threshold_uncertainty_score":0.012191832},"labels":[],"label_agreement":null},{"id":"W4411146828","doi":"10.1016/j.tcs.2025.115392","title":"Full domain functional bootstrapping using the prime cyclotomic ring","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Chinese Academy of Sciences; Canadian Anesthesiologists' Society","keywords":"Bootstrapping (finance); Prime (order theory); Ring (chemistry); Domain (mathematical analysis); Mathematics; Computer science; Arithmetic; Discrete mathematics; Combinatorics; Econometrics","score_opus":0.01338887354693723,"score_gpt":0.24919515177760657,"score_spread":0.23580627823066933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411146828","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.3968428,0.0006512611,0.49943486,0.0013105548,0.00043344885,0.00011601181,0.00022675075,0.0011389903,0.09984522],"genre_scores_gemma":[0.9558007,0.00025721258,0.03346926,0.00021375794,0.0002003655,0.00004569104,0.00009193772,0.00017224404,0.009748765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995253,0.00013830024,0.000014870719,0.00008437628,0.0001331918,0.000103978186],"domain_scores_gemma":[0.9990847,0.00031833004,0.000060987542,0.00032957137,0.0001014935,0.00010498863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007420919,0.0004543408,0.0006816052,0.00084990787,0.0009864254,0.0012396927,0.00066097546,0.0007572702,0.006844786],"category_scores_gemma":[0.0027585877,0.0002525922,0.0006119856,0.00047443665,0.0020016627,0.0027248284,0.0018773155,0.0014647152,0.0011094438],"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.00012200471,0.000025909922,0.00014543917,0.00003521092,0.000007917173,0.0001218983,0.00008678228,0.0049587423,0.0034237502,0.97504616,0.0013467028,0.014679504],"study_design_scores_gemma":[0.00002979845,0.000057463272,0.00015349106,0.000014235873,0.000008923376,0.00017299333,0.00003808351,0.04860363,0.0044199964,0.94259596,0.0038822459,0.000023234094],"about_ca_topic_score_codex":0.0002791247,"about_ca_topic_score_gemma":0.00019870057,"teacher_disagreement_score":0.006844786,"about_ca_system_score_codex":0.00046016838,"about_ca_system_score_gemma":0.0004055962,"threshold_uncertainty_score":0.022898078},"labels":[],"label_agreement":null},{"id":"W4411149101","doi":"10.1016/j.tcs.2025.115393","title":"Cuts, cats, and complete graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Memorial University of Newfoundland","funders":"Memorial University of Newfoundland","keywords":"Combinatorics; Mathematics; Computer science; Discrete mathematics","score_opus":0.013954405158160247,"score_gpt":0.2940944799975862,"score_spread":0.28014007483942593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411149101","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.57103163,0.0032583892,0.3423673,0.0015746948,0.00017606447,0.00013077649,0.0004866839,0.00021576806,0.08075874],"genre_scores_gemma":[0.945852,0.0010274005,0.03862028,0.0002724891,0.000101050166,0.00006653959,0.0003159455,0.000054978704,0.013689362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999491,0.0001523126,0.000018975405,0.00009833722,0.00015663417,0.000082769555],"domain_scores_gemma":[0.99886024,0.00050805596,0.00021546794,0.0000855081,0.00011255275,0.00021810764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043939115,0.0004935718,0.0004065832,0.0011413166,0.0006479016,0.0012841743,0.00063810527,0.00083203625,0.0034821401],"category_scores_gemma":[0.0023108951,0.00028787818,0.00033832242,0.0009347305,0.0020949298,0.002438668,0.0009963518,0.0011657287,0.00027740028],"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.000037030662,0.000024936484,0.00087467994,0.000045300094,0.000014125102,0.00010241748,0.00020655994,0.013495149,0.0012717958,0.9730877,0.0016402189,0.009200023],"study_design_scores_gemma":[0.000012333918,0.000049856713,0.00089551817,0.000019240748,0.00001062335,0.0001562916,0.00016676408,0.028338486,0.0003343777,0.96363175,0.0063726734,0.000012104393],"about_ca_topic_score_codex":0.0022994317,"about_ca_topic_score_gemma":0.0039974065,"teacher_disagreement_score":0.0034821401,"about_ca_system_score_codex":0.0008521923,"about_ca_system_score_gemma":0.00031453752,"threshold_uncertainty_score":0.011648893},"labels":[],"label_agreement":null},{"id":"W4411274961","doi":"10.1016/j.tcs.2025.115414","title":"Parameterized complexity of weighted target set selection","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","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":"Artificial Intelligence in Medicine (Canada)","funders":"Exploratory Research for Advanced Technology; Japan Society for the Promotion of Science","keywords":"Parameterized complexity; Set (abstract data type); Selection (genetic algorithm); Mathematics; Computer science; Computational complexity theory; Algorithm; Theoretical computer science; Combinatorics; Artificial intelligence; Programming language","score_opus":0.010843718815755833,"score_gpt":0.260680608681841,"score_spread":0.24983688986608518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411274961","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.46580377,0.0011780214,0.507026,0.0044762315,0.00013305513,0.00044788257,0.0041024964,0.0030556312,0.013776871],"genre_scores_gemma":[0.83630973,0.00065524696,0.15284911,0.00042307458,0.00009919202,0.00043084254,0.004287192,0.00056935794,0.004376263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974947,0.0006261685,0.0001422414,0.00085720397,0.0003755963,0.0005040896],"domain_scores_gemma":[0.9897552,0.00721931,0.00081143226,0.0012392816,0.0005084491,0.00046632512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017865602,0.0014667384,0.0019494802,0.00074037584,0.0009944869,0.0031195278,0.0030705857,0.0014979915,0.0062099523],"category_scores_gemma":[0.010958869,0.0007184983,0.0015473481,0.0021403132,0.0012272713,0.0056378013,0.0022592118,0.0016801658,0.0007262366],"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.00096499914,0.00031944786,0.004920219,0.0007350605,0.00022107089,0.0004422875,0.00038570707,0.8272146,0.012704396,0.043047987,0.012953891,0.096090406],"study_design_scores_gemma":[0.00009887904,0.00007066971,0.0006538343,0.000018802108,0.000059740152,0.00017364476,0.00011688783,0.92661875,0.002201629,0.06836618,0.0016017146,0.000019267785],"about_ca_topic_score_codex":0.0051460858,"about_ca_topic_score_gemma":0.004876417,"teacher_disagreement_score":0.0062099523,"about_ca_system_score_codex":0.0030657246,"about_ca_system_score_gemma":0.0026310147,"threshold_uncertainty_score":0.02224344},"labels":[],"label_agreement":null},{"id":"W4412031854","doi":"10.1016/j.tcs.2025.115438","title":"Bike-assisted evacuation of robots on a line with asymmetric S/R communication","year":2025,"lang":"en","type":"article","venue":"Theoretical 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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Line (geometry); Computer science; Human–computer interaction; Artificial intelligence; Mathematics","score_opus":0.021304030791348322,"score_gpt":0.30058114467350033,"score_spread":0.27927711388215204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412031854","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.39733467,0.00030375476,0.58953834,0.0005408073,0.00006918888,0.00013963121,0.00014594829,0.0007034117,0.01122423],"genre_scores_gemma":[0.92722535,0.00012898241,0.066372596,0.00007307905,0.000017485729,0.00008640036,0.00018256587,0.00003271216,0.005880709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952245,0.00012600525,0.00001900043,0.000087064225,0.000076288925,0.00016930733],"domain_scores_gemma":[0.99885774,0.00052963063,0.00017384354,0.00014060888,0.00012075324,0.00017741437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005206299,0.00084407843,0.0012379823,0.00048192294,0.00096788,0.00065124,0.0018614597,0.0015594043,0.0026264675],"category_scores_gemma":[0.0018754016,0.0002820849,0.00065812987,0.0005318234,0.0008942381,0.0012421049,0.0023893623,0.00088489975,0.00049816014],"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.0008705377,0.00013620486,0.0011389077,0.00018434142,0.000051385217,0.00042088423,0.00024347786,0.94179887,0.011704582,0.016763322,0.0018360707,0.024851456],"study_design_scores_gemma":[0.000019558447,0.00007564045,0.00009812043,0.0000041351664,0.0000040861564,0.000055828048,0.000048081005,0.99592835,0.0012196491,0.0021982598,0.00034130766,0.000007062278],"about_ca_topic_score_codex":0.0039399574,"about_ca_topic_score_gemma":0.0036707504,"teacher_disagreement_score":0.0039399574,"about_ca_system_score_codex":0.00063518307,"about_ca_system_score_gemma":0.0008636589,"threshold_uncertainty_score":0.00878644},"labels":[],"label_agreement":null},{"id":"W4412453354","doi":"10.1016/j.tcs.2025.115455","title":"Path cover using only short paths","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Ministry of Science and Technology of the People's Republic of China; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Cover (algebra); Path (computing); Mathematics; Computer science; Algorithm; Combinatorics; Programming language; Engineering","score_opus":0.012300384372274155,"score_gpt":0.2775897903059699,"score_spread":0.26528940593369577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412453354","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.15422668,0.0017166886,0.82159066,0.0010946029,0.00017669481,0.00035038398,0.0013172756,0.0012130017,0.01831406],"genre_scores_gemma":[0.5884515,0.0015344247,0.39366826,0.00027506627,0.00015543659,0.00029038216,0.0025587785,0.0004892966,0.012576846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988985,0.00021909563,0.00004680251,0.00031071657,0.00027687172,0.00024795835],"domain_scores_gemma":[0.9965364,0.0022706348,0.00028578876,0.0005375553,0.0001784718,0.00019122577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007735706,0.0012528701,0.0012169263,0.0012071105,0.0012074215,0.0014151348,0.0015404174,0.0018269105,0.008651577],"category_scores_gemma":[0.0060467566,0.00073269533,0.0014679402,0.0024860518,0.0011032057,0.0047777863,0.0023089282,0.0017021933,0.0011521917],"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.000775746,0.00023036382,0.001751342,0.0006661112,0.00011820797,0.0005729866,0.00036339092,0.7192812,0.010171795,0.10376293,0.013031444,0.14927453],"study_design_scores_gemma":[0.0000906425,0.00029555376,0.00045613194,0.00007672946,0.000051652743,0.00051046856,0.00012024567,0.8405317,0.005991532,0.14099583,0.010852171,0.0000272516],"about_ca_topic_score_codex":0.0029257608,"about_ca_topic_score_gemma":0.0025584884,"teacher_disagreement_score":0.008651577,"about_ca_system_score_codex":0.0011902988,"about_ca_system_score_gemma":0.0009974061,"threshold_uncertainty_score":0.028942406},"labels":[],"label_agreement":null},{"id":"W4413019768","doi":"10.1016/j.tcs.2025.115502","title":"On the complexity of temporal arborescence reconfiguration","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","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é de Sherbrooke","funders":"","keywords":"Control reconfiguration; Computer science; Theoretical computer science; Mathematics; Combinatorics; Distributed computing; Embedded system","score_opus":0.02032966206416888,"score_gpt":0.2598789923358944,"score_spread":0.2395493302717255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413019768","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.50104356,0.0029261752,0.46010697,0.0062599415,0.0002528326,0.00053829345,0.0042241593,0.0023204247,0.022327535],"genre_scores_gemma":[0.8379368,0.0017400451,0.14864825,0.0005654986,0.00024599783,0.0003713493,0.003863663,0.0006367137,0.0059915567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690896,0.00077256555,0.00018805759,0.0008081333,0.00061550573,0.0007069266],"domain_scores_gemma":[0.98437077,0.011981708,0.0012125131,0.001390564,0.00051732943,0.00052706874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001669433,0.0012046827,0.0014615301,0.00086679455,0.0013439775,0.003419246,0.0024639561,0.0017295148,0.00984477],"category_scores_gemma":[0.01500447,0.00081078894,0.0020656215,0.0023968185,0.0013738365,0.006935097,0.0022508244,0.0027663023,0.00061767997],"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.00076890335,0.00028747332,0.0042703026,0.0010092547,0.00022546043,0.0006408662,0.0005173047,0.82900846,0.009380959,0.073919445,0.009140898,0.07083064],"study_design_scores_gemma":[0.00009754079,0.00008376519,0.0011947057,0.000056027333,0.000092035625,0.00039182248,0.0002205362,0.8629523,0.0027386965,0.12816456,0.0039754156,0.0000326784],"about_ca_topic_score_codex":0.005513079,"about_ca_topic_score_gemma":0.0053704637,"teacher_disagreement_score":0.00984477,"about_ca_system_score_codex":0.00303178,"about_ca_system_score_gemma":0.0016635474,"threshold_uncertainty_score":0.03293407},"labels":[],"label_agreement":null},{"id":"W4413388574","doi":"10.1016/j.tcs.2025.115518","title":"Hybrid encryption in correlated randomness model and KEM combiners","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Randomness; Encryption; Computer science; Cryptography; Mathematics; Theoretical computer science; Algorithm; Statistics; Computer security","score_opus":0.0050077255866025905,"score_gpt":0.2328723140003809,"score_spread":0.2278645884137783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413388574","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.15932238,0.0010494894,0.81806815,0.00049650186,0.00013404171,0.000095715375,0.00020643254,0.00027245097,0.020354811],"genre_scores_gemma":[0.95689243,0.00046386832,0.034029454,0.000113427835,0.000073786374,0.000057515437,0.00009076451,0.000037879923,0.008240938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891865,0.00034532615,0.000060693295,0.00018596908,0.00032086548,0.00016847387],"domain_scores_gemma":[0.9989491,0.00039161302,0.00014988292,0.0002739563,0.00017324985,0.00006215381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093765894,0.00058362295,0.0010387691,0.00071249687,0.0007309536,0.0017347959,0.0010675798,0.0011911206,0.0028923645],"category_scores_gemma":[0.0016968312,0.00034882498,0.0010483069,0.0010344288,0.0011146304,0.0026838328,0.0012907253,0.0009432035,0.00068296026],"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.00055375224,0.000092667615,0.0014961659,0.00019890688,0.00026626128,0.00093748287,0.00022976066,0.17100866,0.035774983,0.7669745,0.0014378226,0.021028966],"study_design_scores_gemma":[0.00006552361,0.00016024568,0.00057677296,0.000026917183,0.000109698216,0.00087516656,0.00006632279,0.8375405,0.012877422,0.14544713,0.0021597617,0.00009445996],"about_ca_topic_score_codex":0.0004273792,"about_ca_topic_score_gemma":0.00038988734,"teacher_disagreement_score":0.0028923645,"about_ca_system_score_codex":0.00064662535,"about_ca_system_score_gemma":0.00052837434,"threshold_uncertainty_score":0.00967598},"labels":[],"label_agreement":null},{"id":"W4413682904","doi":"10.1016/j.tcs.2025.115529","title":"Hypergraph burning, matchings, and zero forcing","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Forcing (mathematics); Zero (linguistics); Mathematics; Combinatorics; Computer science; Mathematical analysis; Linguistics","score_opus":0.0032420095419759543,"score_gpt":0.24814837774201168,"score_spread":0.24490636820003572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413682904","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.17872305,0.00064298627,0.806923,0.00079635874,0.00006840276,0.00016002278,0.00066014566,0.0011549699,0.010871042],"genre_scores_gemma":[0.68678826,0.0005079003,0.3050857,0.0003395553,0.00012245493,0.00023932473,0.0009424161,0.00034026912,0.005634056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760205,0.00042989408,0.00018384824,0.0007908678,0.00059858395,0.00039479102],"domain_scores_gemma":[0.99280214,0.0038207874,0.00081653555,0.0017003153,0.00047747706,0.00038281345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001885996,0.0007143636,0.0010135536,0.0014340961,0.0014115537,0.0025859824,0.001926026,0.0011533321,0.004809921],"category_scores_gemma":[0.008080063,0.00065217353,0.0015521973,0.0021740773,0.0036419046,0.0077326577,0.0028327936,0.00279515,0.00063298515],"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.0005915677,0.0001882509,0.0040304363,0.0004154196,0.00007668824,0.0002532712,0.00065763196,0.12914556,0.018706078,0.7545799,0.0030137268,0.0883415],"study_design_scores_gemma":[0.000039202117,0.000078272635,0.000737822,0.000050445895,0.00003237596,0.00019717883,0.0001421707,0.18272507,0.010110408,0.80251044,0.0033312764,0.000045406174],"about_ca_topic_score_codex":0.0018785774,"about_ca_topic_score_gemma":0.0024096866,"teacher_disagreement_score":0.004809921,"about_ca_system_score_codex":0.0024209586,"about_ca_system_score_gemma":0.001313528,"threshold_uncertainty_score":0.01756537},"labels":[],"label_agreement":null},{"id":"W4414001959","doi":"10.1016/j.tcs.2025.115537","title":"Succinct encodings of binary trees with application to AVL trees","year":2025,"lang":"en","type":"article","venue":"Theoretical 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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Weight-balanced tree; Binary tree; Binary number; Binary search tree; Mathematics; Random binary tree; Computer science; Combinatorics; Arithmetic","score_opus":0.004659458754043663,"score_gpt":0.24415116376089935,"score_spread":0.23949170500685568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414001959","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.08561357,0.00050767686,0.8987682,0.0010996137,0.00013572817,0.00012383047,0.0007757902,0.0016726309,0.011302907],"genre_scores_gemma":[0.6399019,0.0005861094,0.3509071,0.00048078207,0.00019773093,0.00034427646,0.0017725873,0.000608062,0.005201469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984465,0.00031745754,0.00011959392,0.00019937461,0.00071723026,0.00019977163],"domain_scores_gemma":[0.99300694,0.0032877156,0.0005279835,0.0020971622,0.0008350285,0.00024519232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013854576,0.00041783784,0.0006290223,0.0016455742,0.00076117023,0.0026115794,0.0014803164,0.00088717625,0.003791616],"category_scores_gemma":[0.01263096,0.00051724684,0.0006326974,0.0021879487,0.0015625703,0.0057173455,0.003175877,0.002088797,0.0010903348],"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.00028906693,0.00017943527,0.0011450463,0.00020441579,0.000016560007,0.00025764047,0.0007148948,0.0701222,0.021864701,0.7458237,0.00731133,0.15207098],"study_design_scores_gemma":[0.000054301614,0.000098718,0.00030167235,0.000101903635,0.000020338672,0.00031692826,0.00014566621,0.47932327,0.02287097,0.4848839,0.011837136,0.00004525117],"about_ca_topic_score_codex":0.0006895679,"about_ca_topic_score_gemma":0.0010903983,"teacher_disagreement_score":0.003791616,"about_ca_system_score_codex":0.0018045281,"about_ca_system_score_gemma":0.0009627045,"threshold_uncertainty_score":0.0130928755},"labels":[],"label_agreement":null},{"id":"W4415340732","doi":"10.1016/j.tcs.2025.115597","title":"Degrees are useless in Snort when measuring temperature","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Evolutionary Algorithms and Applications","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":"Memorial University of Newfoundland; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Degree (music); Graph; Measure (data warehouse); Simple (philosophy); Position (finance)","score_opus":0.013955894777330653,"score_gpt":0.2413300981591317,"score_spread":0.22737420338180106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415340732","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.6925572,0.00058249786,0.28031823,0.0015246511,0.00023779501,0.000074852,0.0002902798,0.00077498646,0.023639433],"genre_scores_gemma":[0.9690121,0.00017001838,0.026658352,0.00030145232,0.000039800263,0.00008291987,0.00011046113,0.00023489627,0.0033899355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996042,0.001178843,0.00019651825,0.00092116,0.0008636131,0.0007979258],"domain_scores_gemma":[0.97570544,0.014138964,0.002200906,0.004139629,0.0016773958,0.0021376826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028662523,0.0008467097,0.0010203443,0.001175359,0.0016048729,0.0035599286,0.0018356397,0.0012600259,0.002812586],"category_scores_gemma":[0.03307235,0.0008432106,0.0008756913,0.00075338513,0.005280169,0.0076475777,0.0028031373,0.0028604944,0.00050808094],"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.0015532401,0.00017904375,0.013111834,0.00024592847,0.00010893814,0.0005984908,0.0019927807,0.14173806,0.032930113,0.7816185,0.0030807373,0.022842307],"study_design_scores_gemma":[0.00008362193,0.00022138545,0.0036814273,0.00008991674,0.00007462455,0.00073303375,0.00062073383,0.3874147,0.018240575,0.5829808,0.005699854,0.00015935108],"about_ca_topic_score_codex":0.0015900022,"about_ca_topic_score_gemma":0.001295665,"teacher_disagreement_score":0.0035599286,"about_ca_system_score_codex":0.0018891429,"about_ca_system_score_gemma":0.0010473856,"threshold_uncertainty_score":0.015158355},"labels":[],"label_agreement":null},{"id":"W4415985875","doi":"10.1016/j.tcs.2025.115642","title":"Single machine controllable scheduling with bounded makespan","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","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 Alberta","funders":"Natural Science Foundation of Ningbo; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Job shop scheduling; Bounded function; Scheduling (production processes); Time complexity; Upper and lower bounds; Dynamic programming; Approximation algorithm","score_opus":0.005159755932363986,"score_gpt":0.21021545954933094,"score_spread":0.20505570361696696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415985875","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.0806795,0.000306132,0.9087835,0.00025766212,0.00011715997,0.0002057858,0.0003130104,0.0011835616,0.00815365],"genre_scores_gemma":[0.85998374,0.0002966362,0.1361601,0.000051440682,0.000065866145,0.0002707464,0.00038082537,0.0001783347,0.0026123624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988533,0.00024374067,0.000058714057,0.0002766676,0.0003158465,0.00025160663],"domain_scores_gemma":[0.9986304,0.0006380393,0.00023799068,0.00020537866,0.00014033607,0.00014782872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007561716,0.0011824758,0.0010297887,0.00045765648,0.0007476777,0.0011516014,0.0018419798,0.00052913185,0.0034152302],"category_scores_gemma":[0.0025721793,0.00042123185,0.00084956083,0.0010938044,0.0007424704,0.0012640596,0.0008732333,0.0008846443,0.00040934244],"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.00038958443,0.00013118121,0.00035725292,0.00036024177,0.00003995615,0.00021202498,0.00010705013,0.9064726,0.014991606,0.039975822,0.0020225132,0.034940273],"study_design_scores_gemma":[0.000031878677,0.00010282127,0.00010940195,0.000006498039,0.000006758129,0.000035589124,0.000015862115,0.9823429,0.0028528252,0.013481874,0.0010043726,0.000009242554],"about_ca_topic_score_codex":0.0026676306,"about_ca_topic_score_gemma":0.0029992827,"teacher_disagreement_score":0.0034152302,"about_ca_system_score_codex":0.0010817039,"about_ca_system_score_gemma":0.0018530956,"threshold_uncertainty_score":0.011425078},"labels":[],"label_agreement":null},{"id":"W4416683196","doi":"10.1016/j.tcs.2025.115656","title":"A tractability gap beyond nim-sums: It’s hard to tell whether a bunch of superstars are losers","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","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":"Mount Saint Vincent University","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Simons Foundation; National Science Foundation","keywords":"Blackout; Simple (philosophy); Intersection (aeronautics); Game theory; Coin flipping","score_opus":0.027934155587959867,"score_gpt":0.30095544958869885,"score_spread":0.273021294000739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416683196","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.09571383,0.003443506,0.73622286,0.03381686,0.0006701866,0.00032447738,0.001976187,0.0017722428,0.12605985],"genre_scores_gemma":[0.8154621,0.0024209856,0.14751491,0.0056317663,0.00094484707,0.0006481477,0.0020757376,0.0014752548,0.023826212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943452,0.001887395,0.00030158056,0.0014609981,0.0013376374,0.0006671952],"domain_scores_gemma":[0.97584677,0.01946341,0.0008120178,0.002446555,0.0008164323,0.0006149219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003750413,0.0015604433,0.0027622879,0.0010950206,0.0033293448,0.008465916,0.0031308671,0.0029898966,0.01937154],"category_scores_gemma":[0.03270392,0.0010084271,0.0029910281,0.0016846779,0.007615784,0.025890823,0.005637229,0.01014959,0.0030033763],"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.00012644265,0.000102116595,0.000924818,0.0003860384,0.00009195294,0.00015291233,0.00034715087,0.0126589015,0.0008832619,0.95494473,0.010417309,0.018964328],"study_design_scores_gemma":[0.000015765117,0.0000145785425,0.0001118864,0.000032822434,0.00001807733,0.00006978308,0.00007334164,0.01491976,0.0003129128,0.98150396,0.0029146145,0.000012532218],"about_ca_topic_score_codex":0.0026145966,"about_ca_topic_score_gemma":0.003310737,"teacher_disagreement_score":0.01937154,"about_ca_system_score_codex":0.0026551445,"about_ca_system_score_gemma":0.002282307,"threshold_uncertainty_score":0.064804256},"labels":[],"label_agreement":null},{"id":"W571512295","doi":"10.1016/j.tcs.2015.06.010","title":"Improved parameterized and exact algorithms for cut problems on trees","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Parameterized complexity; Algorithm; Mathematics; Computer science","score_opus":0.03578921010753701,"score_gpt":0.2855609249262834,"score_spread":0.24977171481874638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W571512295","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.012293928,0.000808822,0.97577083,0.0004083286,0.00017670222,0.00012857701,0.00028556623,0.001625427,0.0085017495],"genre_scores_gemma":[0.10749381,0.0007182254,0.88073295,0.00028516073,0.0002422356,0.00043644028,0.0012696948,0.0013116286,0.007509951],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701464,0.0006663697,0.0001999846,0.0005918649,0.001162375,0.00036471256],"domain_scores_gemma":[0.9900456,0.0056334157,0.00040844924,0.002629747,0.000938132,0.00034454511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024867367,0.0024603773,0.0023644282,0.002011476,0.0011487473,0.0039891982,0.0053979247,0.0026239667,0.017717484],"category_scores_gemma":[0.019626522,0.001450733,0.0024775101,0.004514278,0.0018491459,0.009101743,0.0047579356,0.0072000707,0.0031887705],"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.0007490947,0.000613853,0.0012067361,0.00072761613,0.00014102779,0.00013014249,0.00042845937,0.33386043,0.0070135607,0.19150564,0.023239134,0.44038424],"study_design_scores_gemma":[0.0001817823,0.000073996205,0.0003469272,0.000057503785,0.000057192,0.00008809569,0.00007879049,0.7756956,0.0020922297,0.21497029,0.0063266577,0.000030851916],"about_ca_topic_score_codex":0.004456788,"about_ca_topic_score_gemma":0.008925832,"teacher_disagreement_score":0.017717484,"about_ca_system_score_codex":0.0030209636,"about_ca_system_score_gemma":0.0029666529,"threshold_uncertainty_score":0.05927086},"labels":[],"label_agreement":null},{"id":"W613960602","doi":"10.1016/j.tcs.2015.06.019","title":"The decidability of the intensional fragment of classical linear logic","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decidability; Fragment (logic); Substructural logic; Mathematics; Sequent calculus; Linear logic; Sequent; Intermediate logic; Linear temporal logic; Propositional calculus; Natural deduction; Discrete mathematics; Zeroth-order logic; Algorithm; Programming language; Computer science; Description logic; Multimodal logic; Mathematical proof","score_opus":0.030566280566346672,"score_gpt":0.2724491367975593,"score_spread":0.2418828562312126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W613960602","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.4380279,0.004792174,0.41207114,0.017055064,0.000582962,0.00017019844,0.0018744243,0.0016638294,0.123762354],"genre_scores_gemma":[0.9553127,0.0007652926,0.029029123,0.0011416264,0.0005702683,0.00008466102,0.001071033,0.00017123211,0.01185387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99656963,0.0009427087,0.00017275957,0.0009327073,0.0008294603,0.000552752],"domain_scores_gemma":[0.98468727,0.012254851,0.00062588876,0.0010827814,0.00089308224,0.00045615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042071673,0.0006430746,0.0008969201,0.0012826102,0.0020901691,0.006428255,0.0038252124,0.001574439,0.0066638826],"category_scores_gemma":[0.011794404,0.0011463931,0.0022032252,0.0014617591,0.0075274226,0.015051631,0.0028040707,0.009225269,0.0006341418],"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.00021408251,0.000083064435,0.0006761588,0.00014685205,0.000043170265,0.0001489534,0.0007858322,0.0025418797,0.0015937759,0.9807099,0.00243736,0.010618937],"study_design_scores_gemma":[0.000058543497,0.000021613903,0.0003634293,0.00003282809,0.00004343511,0.0001088843,0.00013163347,0.014711457,0.0024932863,0.97910744,0.0029047308,0.00002272032],"about_ca_topic_score_codex":0.005647058,"about_ca_topic_score_gemma":0.0038638648,"teacher_disagreement_score":0.0066638826,"about_ca_system_score_codex":0.00514004,"about_ca_system_score_gemma":0.0026814458,"threshold_uncertainty_score":0.037293732},"labels":[],"label_agreement":null},{"id":"W646988672","doi":"10.1016/j.tcs.2015.05.034","title":"Competitive algorithms for unbounded one-way trading","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Hebei Province; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Competitive analysis; Upper and lower bounds; Value (mathematics); Online algorithm; Product (mathematics); Combinatorics; Mathematics; Integer (computer science); Function (biology); Revenue; Logarithm; Sequence (biology); Algorithm; Discrete mathematics; Computer science; Economics; Statistics; Finance","score_opus":0.06660840790346818,"score_gpt":0.31207445656924127,"score_spread":0.2454660486657731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W646988672","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.061464656,0.0031059273,0.88580406,0.002696049,0.00041800196,0.00018038785,0.00027802106,0.0008002197,0.045252685],"genre_scores_gemma":[0.74750584,0.00175692,0.22070555,0.0006767777,0.00045759606,0.00045683258,0.0004819588,0.00042630214,0.027532231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974306,0.001169655,0.00011226225,0.00035916432,0.000567897,0.0003604616],"domain_scores_gemma":[0.98578054,0.011106138,0.00046385927,0.0011378006,0.0006883382,0.00082343473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030757457,0.0015886832,0.003384467,0.001174156,0.0019823688,0.0050733346,0.0050131828,0.0039484454,0.013199486],"category_scores_gemma":[0.020456655,0.00079222466,0.0013989687,0.0025675492,0.0031298671,0.00809854,0.004315524,0.0055836625,0.0017010203],"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.0005392749,0.00031854075,0.00046207244,0.00030880948,0.00009406596,0.00012285948,0.00021216091,0.15044628,0.001006565,0.7751483,0.012973906,0.058367245],"study_design_scores_gemma":[0.00009984788,0.000046398738,0.00007360095,0.00002296742,0.000020546613,0.00005424298,0.000035179433,0.4708768,0.00022770188,0.52632606,0.0021988393,0.000017801853],"about_ca_topic_score_codex":0.0025679742,"about_ca_topic_score_gemma":0.0024243859,"teacher_disagreement_score":0.013199486,"about_ca_system_score_codex":0.0022099253,"about_ca_system_score_gemma":0.0021124773,"threshold_uncertainty_score":0.04415667},"labels":[],"label_agreement":null},{"id":"W7106241308","doi":"10.1016/j.tcs.2025.115658","title":"Distance-restricted firefighting on finite graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; Verafin (Canada); University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Neighbourhood (mathematics); Firefighting; Vertex (graph theory); Graph; Rest (music); Integer (computer science)","score_opus":0.013059116869591521,"score_gpt":0.29111173967843534,"score_spread":0.2780526228088438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106241308","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.4501226,0.00062196614,0.53516287,0.0013077147,0.000040458508,0.00017237612,0.00079306855,0.00050756964,0.011271409],"genre_scores_gemma":[0.93734086,0.00038509292,0.057164792,0.00017194619,0.000051941057,0.000110614696,0.0005224575,0.00008791002,0.00416438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983557,0.00062092644,0.0000937026,0.00039840335,0.00026667432,0.00026454378],"domain_scores_gemma":[0.9859282,0.011202151,0.0009648182,0.0009201729,0.00031843572,0.00066627644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017487819,0.00086613325,0.0011563771,0.0006997932,0.0006872909,0.0019775454,0.002663754,0.0013056882,0.0031823749],"category_scores_gemma":[0.013030667,0.0006518579,0.0009409837,0.0010302067,0.002983751,0.0062220115,0.0019234666,0.0022805734,0.00028946262],"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.000506313,0.00016542831,0.0021226644,0.0002787813,0.00006783883,0.00032739178,0.0006208413,0.73448724,0.0034290738,0.23856749,0.0020446556,0.017382296],"study_design_scores_gemma":[0.0000591486,0.00006352737,0.00038673988,0.000022313008,0.00001845067,0.00015844876,0.00014226775,0.59852403,0.0013966988,0.39808667,0.0011189089,0.000022822354],"about_ca_topic_score_codex":0.0038149,"about_ca_topic_score_gemma":0.0037409698,"teacher_disagreement_score":0.0038149,"about_ca_system_score_codex":0.002692645,"about_ca_system_score_gemma":0.00082887965,"threshold_uncertainty_score":0.019536555},"labels":[],"label_agreement":null},{"id":"W7116681940","doi":"10.1016/j.tcs.2025.115721","title":"A self-generating sequence","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Sequence (biology); Mathematical proof; Connection (principal bundle); Term (time); Property (philosophy)","score_opus":0.00951093124382479,"score_gpt":0.2583813853861232,"score_spread":0.24887045414229841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116681940","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.4217357,0.0007172932,0.35876533,0.0029481412,0.0016596813,0.00033074495,0.0014971724,0.0019406455,0.21040529],"genre_scores_gemma":[0.8308667,0.00047845818,0.054102194,0.0005750707,0.00054799684,0.0003870265,0.001316112,0.00043336645,0.11129304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994779,0.0001253468,0.00003497506,0.00012679523,0.00014234462,0.00009250943],"domain_scores_gemma":[0.9972754,0.0014762792,0.00012723124,0.00025606295,0.00060308696,0.0002619194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059300155,0.0006958267,0.00041737544,0.0017121516,0.0016809264,0.001712842,0.0005581979,0.0011819804,0.017145608],"category_scores_gemma":[0.0023729368,0.0003256624,0.00063102116,0.0008999085,0.0011647402,0.002299012,0.0012545664,0.001247539,0.0047635413],"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.000107263164,0.000114440605,0.00068912475,0.00011972829,0.000022270817,0.00052013324,0.000438256,0.00070689764,0.012994914,0.9537802,0.004876649,0.025630066],"study_design_scores_gemma":[0.000044500604,0.000100841535,0.00079518225,0.00003985719,0.000028157894,0.0013118937,0.00018092008,0.007494936,0.011564268,0.9508251,0.027581206,0.000033105032],"about_ca_topic_score_codex":0.0001269901,"about_ca_topic_score_gemma":0.000110307614,"teacher_disagreement_score":0.017145608,"about_ca_system_score_codex":0.00040383884,"about_ca_system_score_gemma":0.0005814653,"threshold_uncertainty_score":0.057357788},"labels":[],"label_agreement":null},{"id":"W7117429158","doi":"10.1016/j.tcs.2025.115729","title":"Border tracing in oriented adjacency graphs of polygonal tilings","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Adjacency list; Polygon mesh; Tracing; Regular polygon; Hexagonal crystal system; Hexagonal tiling; Adjacency matrix","score_opus":0.004747453472165628,"score_gpt":0.2541377186465959,"score_spread":0.24939026517443028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117429158","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.5793548,0.00014637747,0.40739217,0.00014585687,0.000038253955,0.000050461083,0.00016959175,0.0006874934,0.012014932],"genre_scores_gemma":[0.8766925,0.00012115418,0.11847408,0.0000415471,0.000010540729,0.000030979183,0.00023912673,0.00019798325,0.004192149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998093,0.00004152918,0.0000094580755,0.00006212297,0.00004430394,0.000033344408],"domain_scores_gemma":[0.99838984,0.00090493506,0.00022121196,0.00021597734,0.0001573677,0.000110720954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002741249,0.00022745547,0.0003456367,0.000794079,0.0006345792,0.0012952664,0.0006945715,0.0006214316,0.0031861675],"category_scores_gemma":[0.0027399892,0.00032681818,0.0002464057,0.00066303223,0.000840014,0.0012913432,0.0007977077,0.0005748648,0.0003382987],"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.0003858732,0.00014910671,0.0070693516,0.00018648882,0.000028785988,0.0006852373,0.0014006557,0.19644652,0.03294117,0.63222224,0.0034234072,0.1250612],"study_design_scores_gemma":[0.00002356771,0.000049016286,0.0013702097,0.000034943376,0.000012754693,0.00019117894,0.00034834488,0.7011551,0.011776233,0.28186613,0.00315609,0.000016367123],"about_ca_topic_score_codex":0.0026402136,"about_ca_topic_score_gemma":0.0028929985,"teacher_disagreement_score":0.0031861675,"about_ca_system_score_codex":0.0005821688,"about_ca_system_score_gemma":0.00031592447,"threshold_uncertainty_score":0.010658801},"labels":[],"label_agreement":null},{"id":"W847683642","doi":"10.1016/j.tcs.2015.07.006","title":"Operational state complexity of unary NFAs with finite nondeterminism","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Science Council","keywords":"Unary operation; Concatenation (mathematics); TRACE (psycholinguistics); Regular language; State (computer science); Discrete mathematics; Upper and lower bounds; Property (philosophy); Mathematics; Tree (set theory); Computer science; Combinatorics; Finite-state machine; Algorithm; Theoretical computer science; Automaton","score_opus":0.033405676861885426,"score_gpt":0.2602477206608893,"score_spread":0.22684204379900388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W847683642","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.815486,0.00041239604,0.16516769,0.0021548362,0.00006605303,0.00009217051,0.0008593757,0.00049766834,0.015263751],"genre_scores_gemma":[0.98978055,0.00011759011,0.007703299,0.00007538417,0.00006843871,0.000060544113,0.00034859544,0.000074032214,0.0017715162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993846,0.0013931884,0.0005198537,0.0011379197,0.0018101401,0.0012928027],"domain_scores_gemma":[0.9522688,0.038036413,0.0025567808,0.0036875973,0.0020452556,0.0014051751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034442425,0.00065209216,0.0018630667,0.0017435023,0.0017547599,0.008229125,0.002810506,0.0019465254,0.008083137],"category_scores_gemma":[0.023835838,0.000849807,0.0022940333,0.0016655735,0.0041021765,0.016054647,0.0032055597,0.0039018665,0.00046889094],"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.0005927876,0.00019885744,0.0038905744,0.00022112482,0.00009042547,0.000283244,0.0012710821,0.069534265,0.0035648106,0.9048467,0.0013192632,0.01418683],"study_design_scores_gemma":[0.00004595961,0.0000404443,0.00069062406,0.000020001227,0.00004691764,0.0000883298,0.00014036077,0.1481396,0.001701427,0.8485956,0.00045312862,0.000037507598],"about_ca_topic_score_codex":0.0035331422,"about_ca_topic_score_gemma":0.0028740745,"teacher_disagreement_score":0.008229125,"about_ca_system_score_codex":0.0039004765,"about_ca_system_score_gemma":0.0026929164,"threshold_uncertainty_score":0.028300107},"labels":[],"label_agreement":null},{"id":"W941738672","doi":"10.1016/j.tcs.2015.06.037","title":"Three overlapping squares: The general case characterized &amp; applications","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Computer science; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.033579848746125164,"score_gpt":0.29099748231754263,"score_spread":0.25741763357141745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W941738672","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.1872972,0.0006561394,0.74164623,0.0009779311,0.00018074799,0.00008202935,0.00016720856,0.00038350275,0.068609014],"genre_scores_gemma":[0.7925263,0.00030842112,0.18818238,0.00023972284,0.00012638699,0.00005819695,0.0001507362,0.00014289803,0.018264936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988764,0.00026173814,0.00005244917,0.00023660732,0.0003920983,0.00018077137],"domain_scores_gemma":[0.9973205,0.0011912042,0.00030533018,0.00048422642,0.000454283,0.00024452427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009823004,0.0006532385,0.0010076906,0.00065004785,0.0009596015,0.0018053856,0.0018959075,0.002570671,0.008255845],"category_scores_gemma":[0.006115977,0.00050168595,0.00063173246,0.0016236942,0.0019525682,0.0018462507,0.0021709558,0.0014590987,0.0011053655],"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.0009055433,0.00024632394,0.0058067203,0.00047466648,0.00012280302,0.0052963556,0.0008301289,0.1826773,0.02141781,0.61222804,0.007629694,0.16236466],"study_design_scores_gemma":[0.000067246794,0.000100814505,0.0015398532,0.000034311925,0.00004129232,0.00360441,0.00041102947,0.7178217,0.007550118,0.25749737,0.011255396,0.00007652781],"about_ca_topic_score_codex":0.0010389972,"about_ca_topic_score_gemma":0.0010233924,"teacher_disagreement_score":0.008255845,"about_ca_system_score_codex":0.0003918273,"about_ca_system_score_gemma":0.0006436761,"threshold_uncertainty_score":0.027618527},"labels":[],"label_agreement":null}]}