{"meta":{"query_hash":"e1e0608db5e6","filters":{"venue":"Information and Computation"},"cohort_total":93,"direct_labels_cover":0,"predictions_cover":93,"exported":93,"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/e1e0608db5e6","api":"https://metacan.xera.ac/api/v1/cohort?venue=Information+and+Computation"},"results":[{"id":"W1081471053","doi":"10.1016/j.ic.2017.09.002","title":"On the complexity and decidability of some problems involving shuffle","year":2017,"lang":"en","type":"article","venue":"Information and Computation","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":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Decidability; Combinatorics; Pushdown automaton; Discrete mathematics; Mathematics; Closure (psychology); Time complexity; Bounded function; Decision problem; Finite-state machine; Algorithm","score_opus":0.04185534428189584,"score_gpt":0.2631921773337993,"score_spread":0.22133683305190344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1081471053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42569104,0.0039994544,0.479607,0.037225857,0.0005213727,0.0005798713,0.0030445822,0.0013764405,0.047954366],"genre_scores_gemma":[0.8825103,0.0018670314,0.09682773,0.0018238575,0.0013728515,0.00047222208,0.0028867307,0.00049869076,0.011740707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9873768,0.0040988843,0.00093621894,0.003133518,0.0026324405,0.0018221763],"domain_scores_gemma":[0.77904886,0.20528063,0.00412148,0.0071967207,0.002103868,0.0022484765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010069774,0.0014270066,0.003178222,0.0030872193,0.005444186,0.012580476,0.006485983,0.005875914,0.011883032],"category_scores_gemma":[0.06829184,0.0020116973,0.0072394805,0.005058376,0.011565828,0.03408039,0.007122403,0.01458471,0.0007922167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008920531,0.0006931169,0.0044593406,0.00087899144,0.0002769851,0.00066486135,0.001960663,0.053910296,0.001979849,0.89244384,0.008645696,0.03319435],"study_design_scores_gemma":[0.00007902891,0.000026021258,0.0003735898,0.000030837422,0.000055612483,0.00013243944,0.00017024465,0.056200147,0.0010006281,0.94093925,0.0009590967,0.000033043616],"about_ca_topic_score_codex":0.0057160286,"about_ca_topic_score_gemma":0.0048029306,"teacher_disagreement_score":0.012580476,"about_ca_system_score_codex":0.0070225834,"about_ca_system_score_gemma":0.0057730055,"threshold_uncertainty_score":0.053254664},"labels":[],"label_agreement":null},{"id":"W1134720454","doi":"10.1016/j.ic.2015.08.003","title":"Analyzing anonymity attacks through noisy channels","year":2015,"lang":"en","type":"article","venue":"Information and Computation","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":3,"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 de recherche du Québec – Nature et technologies; King Fahd University of Petroleum and Minerals","keywords":"Anonymity; Computer science; Randomness; Protocol (science); Theoretical computer science; Channel (broadcasting); Computer security; Computer network; Mathematics","score_opus":0.028519580226922078,"score_gpt":0.2769915549784059,"score_spread":0.2484719747514838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1134720454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43118945,0.0003883982,0.56118864,0.0011676542,0.00005120924,0.00006231989,0.00013493009,0.00034437276,0.0054730712],"genre_scores_gemma":[0.9936832,0.00012592612,0.0052129533,0.000031510845,0.000032313557,0.000017145667,0.000029317773,0.000027264929,0.00084037695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99488056,0.0026602985,0.00012308963,0.00043189473,0.0011132471,0.0007908414],"domain_scores_gemma":[0.9559705,0.035724826,0.003339375,0.0029067525,0.0015379674,0.0005205088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004375254,0.00084489956,0.0013277782,0.0020668318,0.0012149202,0.0031162081,0.0012911754,0.001878167,0.0014202698],"category_scores_gemma":[0.031741668,0.0007729745,0.0008009631,0.001738098,0.0035772386,0.0055407714,0.00218148,0.0019677915,0.00021817465],"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.000609713,0.00012411963,0.0046763103,0.0000572063,0.000090659036,0.00023013477,0.00025222002,0.81451535,0.0035235009,0.15987316,0.00089639414,0.015151184],"study_design_scores_gemma":[0.000009518984,0.000019141877,0.00034728166,0.000004979253,0.00001271994,0.000038267528,0.000046716126,0.9419673,0.0011951142,0.05617501,0.00017393104,0.000009916602],"about_ca_topic_score_codex":0.0018302117,"about_ca_topic_score_gemma":0.0011310009,"teacher_disagreement_score":0.004375254,"about_ca_system_score_codex":0.0022639355,"about_ca_system_score_gemma":0.0014571415,"threshold_uncertainty_score":0.023138821},"labels":[],"label_agreement":null},{"id":"W1803135286","doi":"10.1016/j.ic.2016.06.007","title":"On the list update problem with advice","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search 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":"University of Waterloo","funders":"Villum Fonden","keywords":"Advice (programming); Computer science; Information retrieval; Programming language","score_opus":0.0087912005124182,"score_gpt":0.2228605443273354,"score_spread":0.2140693438149172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803135286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09645324,0.0038978076,0.84537697,0.012928919,0.0005552114,0.00025202765,0.0008519402,0.0011208741,0.038563043],"genre_scores_gemma":[0.57317185,0.0026964687,0.36594856,0.0018537791,0.0012813888,0.0003904994,0.0015656955,0.0009162216,0.05217557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787927,0.0008206102,0.00010513873,0.00035225778,0.00050450565,0.00033820324],"domain_scores_gemma":[0.9803812,0.016607834,0.00050149375,0.001043151,0.00092342106,0.00054300664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032799323,0.0011248956,0.0026671307,0.0015840206,0.001727199,0.003218284,0.0030180742,0.0047779335,0.015302625],"category_scores_gemma":[0.03166251,0.0009050593,0.00096450397,0.003174733,0.0028390733,0.008724076,0.00305159,0.0038421534,0.0012781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012697941,0.00047430774,0.002091864,0.00062805606,0.000120364675,0.00030408715,0.0005532758,0.21695961,0.0009304774,0.55412793,0.052066058,0.17047419],"study_design_scores_gemma":[0.00015962482,0.000052870306,0.0002510729,0.00005553346,0.00004083713,0.00006339544,0.00006416928,0.48738086,0.00032098015,0.5083214,0.003269065,0.00002027245],"about_ca_topic_score_codex":0.010017944,"about_ca_topic_score_gemma":0.009678677,"teacher_disagreement_score":0.015302625,"about_ca_system_score_codex":0.0020455741,"about_ca_system_score_gemma":0.0024207502,"threshold_uncertainty_score":0.051192403},"labels":[],"label_agreement":null},{"id":"W1859305636","doi":"10.1016/j.ic.2017.08.014","title":"Syntactic complexity of suffix-free languages","year":2017,"lang":"en","type":"preprint","venue":"Information and Computation","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; Narodowym Centrum Nauki; Narodowe Centrum Nauki","keywords":"Regular language; Cardinality (data modeling); Suffix; Semigroup; Alphabet; Discrete mathematics; Mathematics; Upper and lower bounds; State (computer science); Combinatorics; Automaton; Quotient; Computer science; Theoretical computer science; Algorithm; Linguistics","score_opus":0.032337632840797846,"score_gpt":0.2946075498334217,"score_spread":0.26226991699262386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1859305636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74536467,0.0015731594,0.17722009,0.009492397,0.00020723988,0.000075780445,0.0020688898,0.0005836927,0.06341411],"genre_scores_gemma":[0.9845271,0.00046419734,0.008077591,0.0003065712,0.00030916015,0.000074349446,0.00083629333,0.00013855271,0.005266329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962632,0.0009907095,0.00027624797,0.00063110224,0.001363294,0.00047541197],"domain_scores_gemma":[0.9787638,0.016469372,0.0011209467,0.00153668,0.0014617984,0.0006473463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021090163,0.0005357338,0.001284644,0.0021823863,0.0018686178,0.007305945,0.001798156,0.0019040847,0.0098081175],"category_scores_gemma":[0.01394542,0.00075154233,0.0013821813,0.0024928285,0.0040143444,0.014686656,0.0030254666,0.0034036718,0.00089589553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010581917,0.000045765573,0.0009587951,0.00011195636,0.000019652614,0.00012426275,0.0006325435,0.0047686845,0.001297361,0.98404145,0.0017843692,0.0061093373],"study_design_scores_gemma":[0.000007709124,0.0000053418585,0.00020504788,0.0000066115813,0.0000075641838,0.000039889594,0.000045852874,0.008602491,0.000353425,0.9901682,0.000548459,0.000009335167],"about_ca_topic_score_codex":0.0012297889,"about_ca_topic_score_gemma":0.00095297635,"teacher_disagreement_score":0.0098081175,"about_ca_system_score_codex":0.0027279297,"about_ca_system_score_gemma":0.0016552734,"threshold_uncertainty_score":0.032811463},"labels":[],"label_agreement":null},{"id":"W1964481900","doi":"10.1016/j.ic.2006.01.004","title":"Aperiodic propagation criteria for Boolean functions","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Coding theory and cryptography","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 Victoria","funders":"","keywords":"Aperiodic graph; Computer science; Boolean function; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.011230163330921864,"score_gpt":0.24283167020348362,"score_spread":0.23160150687256176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964481900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11397828,0.0016290307,0.79922616,0.0021195363,0.00034805242,0.00019381347,0.00031519574,0.00031643573,0.08187353],"genre_scores_gemma":[0.8563081,0.0021264208,0.10390006,0.0008024745,0.0010273122,0.0004082249,0.0005513394,0.0005097996,0.034366313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977386,0.000670764,0.00015644054,0.00026409124,0.0008698542,0.000300374],"domain_scores_gemma":[0.9805047,0.012805007,0.0012487938,0.0010752486,0.0030820477,0.0012841616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047453796,0.0012351549,0.0015447653,0.0056346664,0.0022530742,0.005104444,0.0022282454,0.002598522,0.009524456],"category_scores_gemma":[0.024052931,0.0007902959,0.0009344064,0.0027145168,0.0037711437,0.008792938,0.0025973,0.0035895377,0.0014177968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041131436,0.000012643766,0.000096623626,0.000034585377,0.0000057771454,0.00003968361,0.00007479273,0.0028359059,0.00077089935,0.99131835,0.0010124196,0.0037572284],"study_design_scores_gemma":[0.000016342547,0.000019407846,0.00009288399,0.000024223187,0.000007981731,0.00007970484,0.000040052055,0.04324646,0.0006755556,0.9541625,0.0016178105,0.00001698468],"about_ca_topic_score_codex":0.00076455966,"about_ca_topic_score_gemma":0.0005935644,"teacher_disagreement_score":0.009524456,"about_ca_system_score_codex":0.0026422408,"about_ca_system_score_gemma":0.0011173093,"threshold_uncertainty_score":0.031862497},"labels":[],"label_agreement":null},{"id":"W1964541472","doi":"10.1016/s0890-5401(03)00057-9","title":"Distinguishing string selection problems","year":2003,"lang":"en","type":"article","venue":"Information and Computation","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":236,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Substring; String (physics); String metric; String searching algorithm; Approximate string matching; Mathematics; Combinatorics; Commentz-Walter algorithm; Time complexity; Edit distance; Set (abstract data type); Hamming distance; Discrete mathematics; Algorithm; Computer science; Pattern matching; Artificial intelligence","score_opus":0.013085671571315597,"score_gpt":0.23607142253529467,"score_spread":0.22298575096397907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964541472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15124805,0.003092619,0.7624175,0.013838127,0.00090790616,0.00020781056,0.00097163534,0.0012279049,0.06608844],"genre_scores_gemma":[0.81705564,0.0017841479,0.14300962,0.0022675293,0.0019557646,0.00026817134,0.0033927704,0.00055196893,0.029714432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.994379,0.0019547008,0.00036026345,0.0013165217,0.0015060082,0.00048346218],"domain_scores_gemma":[0.96654344,0.026854027,0.00093724416,0.0038549935,0.0010647353,0.00074564805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004320655,0.00081675086,0.0014711281,0.002288539,0.0017305557,0.0046814135,0.0023855858,0.0042709876,0.01228019],"category_scores_gemma":[0.026235849,0.0006582581,0.0015439454,0.0033418683,0.0031394109,0.012302675,0.0054156897,0.00613305,0.002485572],"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.000423408,0.00016035543,0.001491378,0.00023541224,0.00004148676,0.00018994468,0.00023419989,0.0062504075,0.0016523569,0.8672848,0.013667797,0.1083686],"study_design_scores_gemma":[0.000029538505,0.00003701064,0.00026161096,0.000023743956,0.000015978381,0.00017363907,0.000057862606,0.028000064,0.0017970521,0.9642855,0.0053063724,0.000011583872],"about_ca_topic_score_codex":0.00020121317,"about_ca_topic_score_gemma":0.00018656149,"teacher_disagreement_score":0.01228019,"about_ca_system_score_codex":0.0011771708,"about_ca_system_score_gemma":0.0010112397,"threshold_uncertainty_score":0.04108137},"labels":[],"label_agreement":null},{"id":"W1966252274","doi":"10.1016/j.ic.2005.09.003","title":"Learning expressions and programs over monoids","year":2005,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","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":"McGill University; Université Laval","funders":"","keywords":"Aperiodic graph; Monoid; Learnability; Mathematics; Connection (principal bundle); Class (philosophy); Group (periodic table); Algebraic number; Discrete mathematics; Algebra over a field; Computer science; Combinatorics; Pure mathematics; Artificial intelligence","score_opus":0.007052188450019767,"score_gpt":0.25162136488855247,"score_spread":0.2445691764385327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966252274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058101386,0.0009807195,0.931017,0.0014048626,0.00008169143,0.00006491071,0.0004646105,0.0010313111,0.0068535157],"genre_scores_gemma":[0.61237025,0.0015240781,0.36998907,0.00056646625,0.0002672413,0.00026688777,0.0013844866,0.00042529663,0.013206246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736744,0.00097131863,0.00027320135,0.0006815804,0.00053731195,0.00016918803],"domain_scores_gemma":[0.98992467,0.0076795085,0.0005325364,0.0008140727,0.0008304772,0.00021871887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002510502,0.00062339014,0.0006820868,0.0018429812,0.0010114792,0.0036780143,0.0013980796,0.0010680987,0.0046012877],"category_scores_gemma":[0.017563688,0.00086934835,0.0010674502,0.0027829714,0.0026404131,0.011279286,0.0030378655,0.0022936196,0.00085358147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108555214,0.000038517064,0.0016802029,0.00019760939,0.000034356723,0.00011717843,0.0008323444,0.012357333,0.0011633398,0.8826859,0.0026045227,0.098180145],"study_design_scores_gemma":[0.0000105196195,0.000018737697,0.0001702158,0.000047608508,0.0000238793,0.00008452675,0.0001005965,0.03794035,0.0012533193,0.95529425,0.0050420025,0.000013987122],"about_ca_topic_score_codex":0.001403894,"about_ca_topic_score_gemma":0.0012101047,"teacher_disagreement_score":0.0046012877,"about_ca_system_score_codex":0.001400501,"about_ca_system_score_gemma":0.0010084127,"threshold_uncertainty_score":0.0153928995},"labels":[],"label_agreement":null},{"id":"W1972446935","doi":"10.1006/inco.2001.3044","title":"Quorum Systems Constructed from Combinatorial Designs","year":2001,"lang":"en","type":"article","venue":"Information and Computation","topic":"graph theory and CDMA systems","field":"Engineering","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 Waterloo","funders":"Army Research Office; Beijing Institute For Brain Disorders","keywords":"Combinatorial design; Rank (graph theory); Intersection (aeronautics); Computer science; Quorum sensing; Consistency (knowledge bases); Set (abstract data type); Mathematics; Theoretical computer science; Discrete mathematics; Combinatorics","score_opus":0.009540108577223393,"score_gpt":0.19348066349873738,"score_spread":0.18394055492151398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972446935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22510317,0.00080610724,0.7239157,0.0006721268,0.0003796285,0.00023301429,0.00033096285,0.0005138279,0.0480454],"genre_scores_gemma":[0.86575,0.0003616388,0.12080294,0.00027073512,0.00012967412,0.00036214443,0.0003103067,0.000095063704,0.011917578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923277,0.00033010214,0.00004715721,0.00012105633,0.00016759454,0.00010125406],"domain_scores_gemma":[0.99693704,0.0019778528,0.00022618502,0.0004165648,0.00028694,0.00015554337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089333626,0.00041219627,0.0008806679,0.0011721943,0.0011792055,0.0018086806,0.000732834,0.0014957943,0.0063124737],"category_scores_gemma":[0.005256592,0.00051879947,0.0004889796,0.0010143206,0.0012777202,0.0017168395,0.0013623552,0.0010728013,0.00065544236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072313655,0.00003691518,0.00021723047,0.00009612802,0.000012476298,0.00007367537,0.00012053934,0.017905273,0.0038507907,0.9636963,0.0010788691,0.012839617],"study_design_scores_gemma":[0.000072494884,0.000070942624,0.00019723545,0.000043679942,0.000020669379,0.00012015783,0.00007621048,0.1334339,0.002036385,0.8592226,0.00468204,0.000023761264],"about_ca_topic_score_codex":0.0003822367,"about_ca_topic_score_gemma":0.00061566697,"teacher_disagreement_score":0.0063124737,"about_ca_system_score_codex":0.00084890425,"about_ca_system_score_gemma":0.0007984666,"threshold_uncertainty_score":0.02111727},"labels":[],"label_agreement":null},{"id":"W1973178331","doi":"10.1016/j.ic.2009.02.009","title":"Minimality in template-guided recombination","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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 Manitoba","funders":"","keywords":"Template; Equivalence (formal languages); Decidability; Computer science; Formal language; Set (abstract data type); Closure (psychology); Programming language; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.019213371579834878,"score_gpt":0.28941344583506157,"score_spread":0.2702000742552267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973178331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14129166,0.0007151508,0.81831026,0.0009921421,0.00009451597,0.00006858187,0.00014626542,0.0006884221,0.03769307],"genre_scores_gemma":[0.86786604,0.00036042987,0.12135105,0.00021007094,0.00007183589,0.00015202409,0.0002569242,0.0003876381,0.009344008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919516,0.00028882653,0.00004047174,0.00014156936,0.00021847602,0.00011546006],"domain_scores_gemma":[0.9969085,0.0022522984,0.00011442523,0.0004306461,0.00017803993,0.00011610308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010112282,0.0003152974,0.0009811929,0.0005563765,0.00087279495,0.0015897788,0.001625839,0.0011218206,0.0037447123],"category_scores_gemma":[0.0058344016,0.0005605593,0.0007543356,0.0006173942,0.002156288,0.0022141796,0.0021002917,0.0020010998,0.0005819977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001178223,0.000032461296,0.00018948279,0.00007989777,0.00001294418,0.000051456853,0.00016157735,0.023720877,0.0042062537,0.95005924,0.0011094728,0.020258466],"study_design_scores_gemma":[0.000014682235,0.000018961884,0.000070399554,0.0000121913545,0.0000078549965,0.00004386701,0.000020535364,0.0592907,0.0024730912,0.9364752,0.0015631111,0.000009349513],"about_ca_topic_score_codex":0.00074239925,"about_ca_topic_score_gemma":0.00078309095,"teacher_disagreement_score":0.0037447123,"about_ca_system_score_codex":0.000798467,"about_ca_system_score_gemma":0.00055864337,"threshold_uncertainty_score":0.012527347},"labels":[],"label_agreement":null},{"id":"W1973682419","doi":"10.1016/j.ic.2004.04.001","title":"The query complexity of order-finding","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Quantum Computing Algorithms and Architecture","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 Calgary","funders":"","keywords":"Bounded function; Permutation (music); Constant (computer programming); Order (exchange); Mathematics; Combinatorics; Exponential function; Probabilistic logic; Time complexity; Polynomial; Discrete mathematics; Computer science; Statistics","score_opus":0.019177646412394434,"score_gpt":0.25577197056809226,"score_spread":0.2365943241556978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973682419","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4610665,0.007321529,0.42770365,0.03783026,0.00075360766,0.00037854436,0.0040320847,0.0016329739,0.0592808],"genre_scores_gemma":[0.94336265,0.002229917,0.04233414,0.00087865244,0.0009258942,0.00018193397,0.0013770664,0.0005241615,0.0081856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9891583,0.0032454391,0.00053314306,0.0015284013,0.003840241,0.0016946394],"domain_scores_gemma":[0.8746242,0.106603496,0.0028843305,0.010088702,0.003611973,0.002187313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072283857,0.0009981005,0.0037283497,0.002041149,0.0029375134,0.008686011,0.0055186953,0.0039245845,0.015551676],"category_scores_gemma":[0.07276886,0.0012126681,0.0017902112,0.005032846,0.0058009177,0.02717644,0.004275991,0.0058334083,0.001428369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028113439,0.00043475375,0.004985244,0.000691634,0.0002302139,0.0003174629,0.0010613635,0.14811532,0.0047817323,0.7264121,0.02975396,0.08040483],"study_design_scores_gemma":[0.00018488195,0.00007327074,0.0009476284,0.000034560053,0.00009310414,0.0002075829,0.00021534854,0.34972456,0.0015521034,0.6450539,0.0018662002,0.000046798337],"about_ca_topic_score_codex":0.007494465,"about_ca_topic_score_gemma":0.005164004,"teacher_disagreement_score":0.015551676,"about_ca_system_score_codex":0.0073934128,"about_ca_system_score_gemma":0.0063370327,"threshold_uncertainty_score":0.053643286},"labels":[],"label_agreement":null},{"id":"W1973873776","doi":"10.1016/j.ic.2004.03.005","title":"Computing the vertex separation of unicyclic graphs","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","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 Victoria","funders":"","keywords":"Combinatorics; Computer science; Vertex (graph theory); Mathematics; Discrete mathematics; Graph","score_opus":0.0162835703785676,"score_gpt":0.3142700028112472,"score_spread":0.2979864324326796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973873776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8089803,0.0007203073,0.17009044,0.0014738835,0.00015024825,0.00007971523,0.0017185196,0.002262319,0.014524237],"genre_scores_gemma":[0.9075339,0.00018082024,0.08534321,0.0001579912,0.000061388295,0.000040349067,0.0024530874,0.00023595731,0.0039933976],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992005,0.0001459372,0.000046700363,0.00022296736,0.00016435282,0.0002195493],"domain_scores_gemma":[0.9949799,0.002620815,0.00050906924,0.0008218202,0.00051855284,0.0005497822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006317198,0.0008694507,0.0013857814,0.0019747834,0.0012049696,0.0028023166,0.0017433173,0.0013539373,0.006573049],"category_scores_gemma":[0.008386495,0.0006414852,0.00058033393,0.0027195455,0.0012582211,0.004015801,0.002196601,0.0022999265,0.0011443001],"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.004644831,0.0008295171,0.015992342,0.0011467965,0.0003153173,0.000588462,0.0011451364,0.25385973,0.028975584,0.24183652,0.03864683,0.41201904],"study_design_scores_gemma":[0.0001803503,0.00018815411,0.0019148536,0.000055046497,0.0000918046,0.00018679048,0.00043698167,0.5166153,0.012763737,0.4630421,0.0044881417,0.000036701545],"about_ca_topic_score_codex":0.0028203214,"about_ca_topic_score_gemma":0.0066770385,"teacher_disagreement_score":0.006573049,"about_ca_system_score_codex":0.0014439251,"about_ca_system_score_gemma":0.0016416672,"threshold_uncertainty_score":0.021989048},"labels":[],"label_agreement":null},{"id":"W1976635413","doi":"10.1016/j.ic.2007.07.009","title":"Execution monitoring enforcement under memory-limitation constraints","year":2007,"lang":"en","type":"article","venue":"Information and Computation","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":45,"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; Université Laval","funders":"","keywords":"Computer science; Enforcement; Automaton; Class (philosophy); Security policy; Computer security; Bounded function; Theoretical computer science; Distributed computing; Artificial intelligence; Law","score_opus":0.030180698315048386,"score_gpt":0.2908001041920741,"score_spread":0.2606194058770257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976635413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23495902,0.0008480658,0.72589755,0.0030839164,0.00042476243,0.00028568934,0.0004786041,0.015001359,0.019020908],"genre_scores_gemma":[0.95250493,0.0001220527,0.044324383,0.00031431083,0.00008940141,0.00007829166,0.00014672214,0.00038932596,0.0020307323],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898477,0.0028858946,0.0009799547,0.0014027247,0.0033143822,0.001569345],"domain_scores_gemma":[0.94716,0.024746008,0.005494354,0.016548514,0.005014335,0.0010367322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071226833,0.00083080155,0.0009007835,0.0012569292,0.0013800584,0.0030887388,0.0027122626,0.0015596828,0.0030925968],"category_scores_gemma":[0.042451438,0.0008361186,0.0006629779,0.0009782973,0.0018945608,0.0048163924,0.0034851644,0.0027010336,0.00046286205],"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.004133313,0.00064975925,0.023711264,0.0010935334,0.00037089508,0.002691787,0.0024513523,0.17762707,0.060545,0.35050124,0.02434002,0.35188475],"study_design_scores_gemma":[0.00020570209,0.00015615043,0.0019806472,0.00019081369,0.00018512613,0.00044119943,0.00021493204,0.78367025,0.084464826,0.117445946,0.010976801,0.00006754924],"about_ca_topic_score_codex":0.0032936886,"about_ca_topic_score_gemma":0.0033029844,"teacher_disagreement_score":0.0071226833,"about_ca_system_score_codex":0.0011688743,"about_ca_system_score_gemma":0.003497391,"threshold_uncertainty_score":0.037668765},"labels":[],"label_agreement":null},{"id":"W1982678879","doi":"10.1016/j.ic.2008.06.007","title":"Detecting palindromes, patterns and borders in regular languages","year":2009,"lang":"en","type":"article","venue":"Information and Computation","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 Waterloo","funders":"","keywords":"Palindrome; Word (group theory); Regular language; Automaton; Computer science; Combinatorics on words; Combinatorics; Matching (statistics); Mathematics; Artificial intelligence; Biology","score_opus":0.00515848780118209,"score_gpt":0.2469158703377372,"score_spread":0.24175738253655513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982678879","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9139327,0.00010995906,0.08311388,0.00013352728,0.000021032738,0.000038619142,0.00018137485,0.0004543754,0.0020145634],"genre_scores_gemma":[0.9747277,0.00002482074,0.02429563,0.00003227309,0.0000095527075,0.000022637529,0.00017663371,0.000051056457,0.00065970566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923325,0.00014666021,0.00007694907,0.00030101568,0.00014312656,0.00009895205],"domain_scores_gemma":[0.9895551,0.006852038,0.0011831868,0.001306339,0.0007079362,0.00039546823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085453974,0.00027727283,0.0006766133,0.0008344297,0.0006605648,0.0015163508,0.0009073962,0.0011650964,0.001567135],"category_scores_gemma":[0.007943787,0.0004907369,0.0004333697,0.0004720501,0.0015155438,0.0030818412,0.0012522277,0.0009135024,0.00029655025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051901727,0.00072026224,0.097515665,0.0008721351,0.00014902597,0.004443833,0.0053336807,0.04286451,0.30394122,0.31071758,0.00304392,0.22520795],"study_design_scores_gemma":[0.0002398439,0.0007100016,0.012483683,0.000098175384,0.00012741919,0.0024108053,0.0025227645,0.3563802,0.14861712,0.47192934,0.0043588895,0.00012190551],"about_ca_topic_score_codex":0.0004947671,"about_ca_topic_score_gemma":0.0006456886,"teacher_disagreement_score":0.001567135,"about_ca_system_score_codex":0.00033840843,"about_ca_system_score_gemma":0.00041435362,"threshold_uncertainty_score":0.005242586},"labels":[],"label_agreement":null},{"id":"W1983335618","doi":"10.1016/s0890-5401(03)00081-6","title":"Searching and on-line recognition of star-shaped polygons","year":2003,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","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":"Polygon (computer graphics); Star (game theory); Competitive analysis; Combinatorics; Line (geometry); Rectilinear polygon; Visibility polygon; Polygon covering; Path (computing); Computer science; Upper and lower bounds; Mathematics; Artificial intelligence; Monotone polygon; Simple polygon; Geometry","score_opus":0.04476430482108747,"score_gpt":0.29182407910099006,"score_spread":0.2470597742799026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983335618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1674301,0.00020197811,0.82180583,0.00014793559,0.00004578786,0.000100675905,0.0002652563,0.0012912633,0.008711088],"genre_scores_gemma":[0.6165899,0.00018710464,0.37810197,0.00004529915,0.000020497762,0.000049206756,0.00071192445,0.00025222998,0.004041809],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994586,0.00011416503,0.000039507766,0.00015347092,0.00015974545,0.00007437033],"domain_scores_gemma":[0.9990101,0.0003584547,0.00012298395,0.0002285603,0.0002058233,0.0000741026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004087365,0.00047640028,0.0010818826,0.0008636284,0.00048453745,0.0018854198,0.0013592377,0.0010600686,0.0036495794],"category_scores_gemma":[0.0028958363,0.00040431012,0.0006753873,0.0011957791,0.0007972733,0.0021033469,0.0012814258,0.0006624316,0.0009356893],"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.00096301694,0.00024303318,0.005159124,0.00028269048,0.000064300606,0.0005909411,0.0006507833,0.37699586,0.032638613,0.05799201,0.0061876937,0.51823187],"study_design_scores_gemma":[0.000012369794,0.000048111146,0.00039446264,0.000011143144,0.000007542417,0.0001096147,0.00012506066,0.97322524,0.009069859,0.01512613,0.0018592004,0.000011272388],"about_ca_topic_score_codex":0.0025977027,"about_ca_topic_score_gemma":0.0023332303,"teacher_disagreement_score":0.0036495794,"about_ca_system_score_codex":0.00045167387,"about_ca_system_score_gemma":0.00054670253,"threshold_uncertainty_score":0.012209117},"labels":[],"label_agreement":null},{"id":"W1997591489","doi":"10.1016/j.ic.2014.08.005","title":"Conservative groupoids recognize only regular languages","year":2014,"lang":"en","type":"article","venue":"Information and Computation","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é Laval; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Class (philosophy); Mathematics; Double groupoid; Hierarchy; Semigroup; Associative property; Regular language; Property (philosophy); Context (archaeology); Conservative extension; Pure mathematics; Algebra over a field; Computer science; Discrete mathematics; Theoretical computer science; Artificial intelligence; Automaton","score_opus":0.006634479812632228,"score_gpt":0.2306338532912243,"score_spread":0.22399937347859206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997591489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5733172,0.00033131233,0.3849023,0.0006666578,0.0004992753,0.00021357957,0.0004504614,0.004780466,0.034838784],"genre_scores_gemma":[0.9525654,0.00009022732,0.03198397,0.00022970169,0.000089244626,0.00011147071,0.00053343613,0.00043155698,0.013965089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906,0.00014114553,0.000068353314,0.00033678033,0.00019107974,0.00020272301],"domain_scores_gemma":[0.99512404,0.0023375568,0.00039950953,0.0013260266,0.00050947105,0.00030330828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006270356,0.00063922646,0.001041313,0.0006498329,0.0010744112,0.0032133732,0.0008336886,0.0013167948,0.005626137],"category_scores_gemma":[0.003470636,0.0005071684,0.00077778543,0.0004687296,0.0021918393,0.005818751,0.0017294111,0.0014613868,0.0027509048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001078957,0.00022706049,0.0047874157,0.00037160437,0.00006233721,0.0008444507,0.006107574,0.0039910297,0.12110541,0.7698134,0.0070894216,0.08452135],"study_design_scores_gemma":[0.000058115747,0.00016859351,0.0008507604,0.000047825095,0.00005075587,0.00043487453,0.0014654554,0.015213488,0.06531334,0.90545154,0.010870868,0.00007444929],"about_ca_topic_score_codex":0.0005480019,"about_ca_topic_score_gemma":0.000694642,"teacher_disagreement_score":0.005626137,"about_ca_system_score_codex":0.0006224369,"about_ca_system_score_gemma":0.0007502954,"threshold_uncertainty_score":0.0188213},"labels":[],"label_agreement":null},{"id":"W2002626286","doi":"10.1016/j.ic.2012.04.003","title":"Deciding regularity of hairpin completions of regular languages in polynomial time","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Decidability; Regular language; DNA computing; Topological entropy; Formal language; Time complexity; Mathematics; Context (archaeology); Discrete mathematics; Exponential function; Computer science; Exponential growth; Growth function; Combinatorics; Algorithm; Theoretical computer science; Automaton","score_opus":0.009762622650934222,"score_gpt":0.26203966914840254,"score_spread":0.2522770464974683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002626286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7429628,0.0003887455,0.23071054,0.0039430615,0.00019900617,0.0004912943,0.0030739547,0.0048540947,0.013376555],"genre_scores_gemma":[0.91988975,0.00014937947,0.07115759,0.00056946214,0.00019081906,0.00014319833,0.0037584896,0.00061572425,0.0035255572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962728,0.00067198364,0.00028651155,0.0012277582,0.00080946356,0.0007314578],"domain_scores_gemma":[0.96766216,0.02564676,0.001507236,0.0023165534,0.0012530033,0.0016143542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024761374,0.00093751686,0.0019275814,0.0007910312,0.0015704556,0.00486011,0.002296679,0.0016711312,0.009640984],"category_scores_gemma":[0.016258063,0.0013973954,0.0027091017,0.0009561449,0.0033474362,0.009457078,0.003784386,0.005013295,0.0012564965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00843161,0.0019013732,0.024228651,0.0020737525,0.0005812201,0.0013615845,0.0036082512,0.15399358,0.07109416,0.5507744,0.032781146,0.14917025],"study_design_scores_gemma":[0.00062529894,0.00039940662,0.0017669449,0.000059620284,0.00013623969,0.0002746164,0.0009095188,0.15625943,0.019515544,0.8161401,0.0038088814,0.000104328356],"about_ca_topic_score_codex":0.002423573,"about_ca_topic_score_gemma":0.004453948,"teacher_disagreement_score":0.009640984,"about_ca_system_score_codex":0.0018075387,"about_ca_system_score_gemma":0.0024852362,"threshold_uncertainty_score":0.03225231},"labels":[],"label_agreement":null},{"id":"W2003520601","doi":"10.1016/j.ic.2013.02.002","title":"Testing probabilistic equivalence through Reinforcement Learning","year":2013,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","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é Laval","funders":"","keywords":"Equivalence (formal languages); Mathematics; Bisimulation; Decidability; Probabilistic logic; Discrete mathematics; Theoretical computer science; Computer science","score_opus":0.05048742108083468,"score_gpt":0.29907735545670067,"score_spread":0.248589934375866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003520601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12911746,0.00008604939,0.8649798,0.0010432855,0.00008765264,0.0001577597,0.000112948204,0.0011241697,0.0032908397],"genre_scores_gemma":[0.92997277,0.00003165222,0.068695806,0.00016544075,0.00003408656,0.00011881118,0.00015857581,0.00012513757,0.000697908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9768014,0.011944331,0.00089897384,0.0035798887,0.005215216,0.0015602802],"domain_scores_gemma":[0.8123876,0.16557613,0.0051396545,0.011012797,0.0042388365,0.0016449912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011903536,0.0013694069,0.0018849515,0.001401866,0.0009380445,0.0021001636,0.0034912159,0.0021435816,0.0055235336],"category_scores_gemma":[0.13867985,0.000871078,0.0017970187,0.00067636184,0.006685519,0.008585217,0.0055167954,0.0040635285,0.00046271714],"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.0019554687,0.0012650621,0.011830896,0.0004385509,0.0003142233,0.000396571,0.00046771424,0.5438135,0.0050272364,0.29261947,0.0022426404,0.13962865],"study_design_scores_gemma":[0.00013445875,0.00010895937,0.0003609817,0.000024329029,0.00002308709,0.000032404492,0.000037462898,0.7592206,0.0028087622,0.23699218,0.00023884294,0.00001795091],"about_ca_topic_score_codex":0.00327405,"about_ca_topic_score_gemma":0.0030706748,"teacher_disagreement_score":0.011903536,"about_ca_system_score_codex":0.002452075,"about_ca_system_score_gemma":0.0044833315,"threshold_uncertainty_score":0.0629527},"labels":[],"label_agreement":null},{"id":"W2005831808","doi":"10.1016/j.ic.2010.08.001","title":"On the consistency, expressiveness, and precision of partial modeling formalisms","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","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 Toronto","funders":"","keywords":"Rotation formalisms in three dimensions; Computer science; Consistency (knowledge bases); Model checking; Theoretical computer science; Logical consequence; Transition system; Succinctness; Expressive power; Class (philosophy); Interpretation (philosophy); Algorithm; Programming language; Mathematics; Artificial intelligence","score_opus":0.028999871383351854,"score_gpt":0.28762111789332434,"score_spread":0.2586212465099725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005831808","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.089826725,0.0020721878,0.8899511,0.0047172154,0.00018049053,0.00016213604,0.00043963117,0.0006623403,0.011988083],"genre_scores_gemma":[0.780152,0.0018448776,0.21352686,0.0007771752,0.00037224553,0.00032986,0.00073743716,0.00040551036,0.0018539478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9639562,0.01553646,0.0036967595,0.004074454,0.010634744,0.0021014425],"domain_scores_gemma":[0.75110793,0.18067145,0.008275899,0.051249396,0.0077504255,0.0009448616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04567955,0.0013053649,0.002923593,0.0036079786,0.002907755,0.009674834,0.0051354724,0.003345054,0.002386292],"category_scores_gemma":[0.18128052,0.0027651584,0.0040644626,0.0035407988,0.014546613,0.02493863,0.008761885,0.010606276,0.0003629499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019146307,0.00006412017,0.0012556377,0.00023991089,0.00009380425,0.00012001706,0.0011787579,0.035357304,0.0011402832,0.93984437,0.00053459266,0.019979825],"study_design_scores_gemma":[0.00005117264,0.000046706307,0.00021125602,0.00017225876,0.0000884054,0.00007059137,0.00015343339,0.035683088,0.0018194013,0.95988077,0.0017922517,0.00003066775],"about_ca_topic_score_codex":0.0034674942,"about_ca_topic_score_gemma":0.0022864975,"teacher_disagreement_score":0.04567955,"about_ca_system_score_codex":0.0032211703,"about_ca_system_score_gemma":0.0033845005,"threshold_uncertainty_score":0.24157947},"labels":[],"label_agreement":null},{"id":"W2016391167","doi":"10.1016/j.ic.2001.03.001","title":"De Bakker–Zucker processes revisited","year":2003,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Topology and Set Theory","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":"York University","funders":"","keywords":"Physics","score_opus":0.02019113736196648,"score_gpt":0.31063695594720087,"score_spread":0.2904458185852344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016391167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16761608,0.008649964,0.4648053,0.032351986,0.002521909,0.00014460225,0.00044048295,0.00039817212,0.32307136],"genre_scores_gemma":[0.8745961,0.0037710494,0.033761967,0.0021980715,0.0013701809,0.00014858916,0.00016232667,0.0001352236,0.083856545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870443,0.0004159611,0.00006447295,0.0002487431,0.0003764914,0.00018986574],"domain_scores_gemma":[0.9969279,0.0015288718,0.0002700725,0.0005872376,0.0004507194,0.00023502916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030281185,0.0010802072,0.0015105293,0.0021156722,0.0024975545,0.004007645,0.0022876519,0.0050551416,0.015495935],"category_scores_gemma":[0.009465492,0.00050076074,0.0011140184,0.0023726984,0.0045916424,0.013067069,0.003559105,0.0052613663,0.0018149733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051314405,0.0000026176763,0.000009694685,0.000005697831,0.0000015499754,0.000010250366,0.0000336467,0.00016254731,0.000063162996,0.9987803,0.00027788882,0.0006474771],"study_design_scores_gemma":[0.0000058154055,0.0000032130854,0.000022027632,0.0000039444963,0.0000022044453,0.000033704444,0.000026169886,0.0020762708,0.000112324466,0.9964837,0.001226682,0.000003919388],"about_ca_topic_score_codex":0.0010144709,"about_ca_topic_score_gemma":0.00048335607,"teacher_disagreement_score":0.015495935,"about_ca_system_score_codex":0.001591035,"about_ca_system_score_gemma":0.000927952,"threshold_uncertainty_score":0.051839054},"labels":[],"label_agreement":null},{"id":"W2018650645","doi":"10.1016/j.ic.2011.01.001","title":"An extension of the Lyndon–Schützenberger result to pseudoperiodic words","year":2011,"lang":"en","type":"article","venue":"Information and Computation","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":"Western University","funders":"","keywords":"Extension (predicate logic); Computer science; Combinatorics; Linguistics; Mathematics; Mathematical economics; Philosophy; Programming language","score_opus":0.017044988781471898,"score_gpt":0.23565237675886666,"score_spread":0.21860738797739476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018650645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121249296,0.0021970407,0.6828035,0.0035606301,0.0013353617,0.000089095636,0.00035443937,0.0005326365,0.18787804],"genre_scores_gemma":[0.85014915,0.0022802593,0.0875165,0.0017264084,0.0023395559,0.00018099138,0.00035875276,0.00031108846,0.055137306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993648,0.00013711391,0.00004484797,0.00019199579,0.00017749477,0.00008384428],"domain_scores_gemma":[0.9980513,0.0010054527,0.00013140497,0.00039178022,0.00028887775,0.00013123089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094185286,0.0004891859,0.0009134936,0.0014268183,0.0012919676,0.0018623839,0.0011608773,0.0011583577,0.011674624],"category_scores_gemma":[0.004055216,0.00039370204,0.001384674,0.0011581652,0.0024352819,0.0055117724,0.0025129546,0.0017350321,0.0015743761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027817661,0.000014148107,0.00008208981,0.000052650834,0.0000058520013,0.000119566816,0.00015545808,0.0010073837,0.001142944,0.9879032,0.0011526544,0.008336314],"study_design_scores_gemma":[0.000009018369,0.000017134109,0.00009430405,0.00001100647,0.00000573523,0.000093913186,0.000021150214,0.006319903,0.0004760317,0.98877233,0.0041677784,0.000011735874],"about_ca_topic_score_codex":0.0004919073,"about_ca_topic_score_gemma":0.00042785818,"teacher_disagreement_score":0.011674624,"about_ca_system_score_codex":0.0006954753,"about_ca_system_score_gemma":0.0006152713,"threshold_uncertainty_score":0.039055467},"labels":[],"label_agreement":null},{"id":"W2037750176","doi":"10.1016/j.ic.2012.07.001","title":"Automatic learning of subclasses of pattern languages","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","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":"","keywords":"Learnability; Class (philosophy); Alphabet; Computer science; Variable (mathematics); Abstract family of languages; Regular language; Constant (computer programming); Mathematics; Bounded function; Formal language; Discrete mathematics; Automaton; Artificial intelligence; Algorithm; Programming language; Second-generation programming language; Linguistics","score_opus":0.007190676344356576,"score_gpt":0.2644436623241567,"score_spread":0.2572529859798002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037750176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30621663,0.00087925926,0.6717965,0.0015215275,0.00016757495,0.00025722888,0.002351722,0.00817338,0.0086361235],"genre_scores_gemma":[0.71599275,0.0004070577,0.2707729,0.00038773118,0.00011880709,0.00021494912,0.0059921863,0.0010533874,0.005060273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883896,0.00024951153,0.00013406204,0.00040963554,0.00025959522,0.00010823737],"domain_scores_gemma":[0.9911712,0.0045166346,0.00057180645,0.0021007028,0.0012278651,0.00041182849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012352883,0.0005252496,0.0009756372,0.0020027624,0.00084285834,0.0019436069,0.0015887975,0.00094658084,0.003938964],"category_scores_gemma":[0.010080318,0.00078160287,0.001448003,0.0010831652,0.0008252469,0.005252472,0.0019514638,0.0023385799,0.00096868904],"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.000866498,0.0005143026,0.02871091,0.00080081687,0.0002135637,0.0007210161,0.000796436,0.021852087,0.03543212,0.11829561,0.023245787,0.7685509],"study_design_scores_gemma":[0.000085697786,0.00010449286,0.0044758697,0.00015089753,0.000091652546,0.0007426063,0.00041221845,0.6642105,0.016990092,0.30097973,0.011717902,0.00003836654],"about_ca_topic_score_codex":0.0014812188,"about_ca_topic_score_gemma":0.00377027,"teacher_disagreement_score":0.003938964,"about_ca_system_score_codex":0.0007882783,"about_ca_system_score_gemma":0.0011833964,"threshold_uncertainty_score":0.013177156},"labels":[],"label_agreement":null},{"id":"W2038319432","doi":"10.1016/j.ic.2008.07.005","title":"Tree exploration with advice","year":2008,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Advice (programming); Tree (set theory); Forestry; Computer science; Data science; Geography; Mathematics; Combinatorics","score_opus":0.024859649797871156,"score_gpt":0.24018585644940837,"score_spread":0.21532620665153723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038319432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05566914,0.001292468,0.8632355,0.0017768956,0.00039170033,0.00025711887,0.00096065394,0.012996445,0.063420214],"genre_scores_gemma":[0.39223894,0.00052153843,0.5683169,0.00062572135,0.00014233938,0.00022141011,0.0011529551,0.0022699798,0.03451031],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914885,0.00025963437,0.000041074996,0.00014035871,0.00029437133,0.000115800736],"domain_scores_gemma":[0.9974043,0.0014473023,0.00006138584,0.00068171055,0.00029687327,0.000108445754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008287797,0.0006257748,0.000892346,0.0010484284,0.00071938115,0.0011634812,0.0010414296,0.0011703332,0.017968144],"category_scores_gemma":[0.008084506,0.00041492085,0.00089491653,0.0010185286,0.00083554356,0.0020364579,0.0022231382,0.0019991724,0.0037364175],"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.0007990856,0.00024011718,0.0023049137,0.0005621138,0.00008597897,0.00034400856,0.0006897127,0.04065366,0.010990792,0.1484241,0.054109644,0.74079585],"study_design_scores_gemma":[0.00014211681,0.00015447378,0.00059648906,0.00017555864,0.000116266034,0.0003620338,0.00016340241,0.46194458,0.011855964,0.45874825,0.065704115,0.000036701447],"about_ca_topic_score_codex":0.001420307,"about_ca_topic_score_gemma":0.0036922689,"teacher_disagreement_score":0.017968144,"about_ca_system_score_codex":0.0004994836,"about_ca_system_score_gemma":0.0009252006,"threshold_uncertainty_score":0.060109437},"labels":[],"label_agreement":null},{"id":"W2044323336","doi":"10.1006/inco.2001.3035","title":"An Algebra of Discrete Channels That Involve Combinations of Three Basic Error Types","year":2001,"lang":"en","type":"article","venue":"Information and Computation","topic":"DNA and Biological Computing","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":"Saint Mary's University","funders":"","keywords":"Decidability; Channel (broadcasting); Computer science; Syntax; Substitution (logic); Expression (computer science); Class (philosophy); Code (set theory); Bounded function; Type (biology); Error detection and correction; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Programming language; Artificial intelligence","score_opus":0.024715105701297452,"score_gpt":0.27252821719270887,"score_spread":0.24781311149141141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044323336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06399894,0.0007625959,0.8299478,0.0017298774,0.0011276689,0.00026272677,0.0012789501,0.0016369125,0.09925447],"genre_scores_gemma":[0.79498464,0.0008568777,0.15852532,0.0011163563,0.0011039756,0.00052879285,0.0007934552,0.00040399024,0.041686546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951756,0.0009417482,0.0003995527,0.0008838279,0.0017298885,0.00086930353],"domain_scores_gemma":[0.99482346,0.0018798041,0.00057248096,0.00093678484,0.0011329963,0.0006544996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029811591,0.001166349,0.0013675784,0.0019470897,0.0033756946,0.0066460026,0.0023332804,0.0021013392,0.013396203],"category_scores_gemma":[0.0050677415,0.00084187795,0.0017652317,0.0021642898,0.005725432,0.009721826,0.0034050923,0.0043768557,0.0032347792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027270708,0.00002394644,0.000050311715,0.00001797317,0.00000699921,0.00007172216,0.00006501445,0.00047972242,0.000545762,0.99624544,0.0006117878,0.0018540057],"study_design_scores_gemma":[0.00003147087,0.000025453945,0.00004908567,0.000011394538,0.000017219929,0.0001998005,0.00005102316,0.006744753,0.0015038983,0.9864581,0.004872826,0.000034977955],"about_ca_topic_score_codex":0.0009826898,"about_ca_topic_score_gemma":0.0007222893,"teacher_disagreement_score":0.013396203,"about_ca_system_score_codex":0.001360766,"about_ca_system_score_gemma":0.0023974082,"threshold_uncertainty_score":0.044814765},"labels":[],"label_agreement":null},{"id":"W2044973122","doi":"10.1016/j.ic.2013.02.001","title":"Worst-case optimal exploration of terrains with obstacles","year":2013,"lang":"en","type":"article","venue":"Information and Computation","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":"Université du Québec en Outaouais","funders":"","keywords":"Terrain; Point (geometry); Artificial intelligence; Convex hull; Computer vision; Computer science; Robot; Mobile robot; Trajectory; Regular polygon; Algorithm; Mathematics; Geography; Geometry; Cartography","score_opus":0.02538619896032181,"score_gpt":0.2494876185426832,"score_spread":0.22410141958236138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044973122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28079155,0.0035555707,0.6863426,0.001963725,0.00015669431,0.00008787591,0.000661454,0.00042973465,0.026010854],"genre_scores_gemma":[0.93083346,0.00060042593,0.06355604,0.00011673461,0.00007511952,0.00006453292,0.00035269026,0.00017069289,0.00423032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849796,0.00059619645,0.00007047743,0.00018400353,0.00030334445,0.00034803865],"domain_scores_gemma":[0.99387395,0.0050124275,0.00029738445,0.0003157485,0.00025063066,0.00024996325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020037692,0.0010034284,0.0013738864,0.0009867037,0.00091024506,0.0022150192,0.0015335914,0.002225366,0.0028623776],"category_scores_gemma":[0.013387754,0.0009095164,0.0008357104,0.0012933434,0.0017291773,0.0028060835,0.0020935305,0.0011263421,0.00028208678],"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.00036906128,0.000044534507,0.00061107485,0.000103816164,0.000048202535,0.00012062471,0.00005096896,0.9760276,0.00066149264,0.012296771,0.001350603,0.008315207],"study_design_scores_gemma":[0.000017964738,0.000035327146,0.00015518544,0.000012728353,0.000016703858,0.00006215411,0.00003934505,0.97046846,0.00047006874,0.028375937,0.00033888876,0.0000071981617],"about_ca_topic_score_codex":0.0039232783,"about_ca_topic_score_gemma":0.004797625,"teacher_disagreement_score":0.0039232783,"about_ca_system_score_codex":0.0010479685,"about_ca_system_score_gemma":0.0012254588,"threshold_uncertainty_score":0.01059711},"labels":[],"label_agreement":null},{"id":"W2045841926","doi":"10.1016/s0890-5401(03)00017-8","title":"Incremental recomputation in local languages","year":2003,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Database Systems and Queries","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":"Recursion (computer science); Computer science; Transitive closure; Closure (psychology); Property (philosophy); Impossibility; Locality; Relation (database); SQL; Transitive relation; Theoretical computer science; Aggregate (composite); Programming language; Mathematics; Discrete mathematics; Linguistics; Database; Combinatorics","score_opus":0.008492860012480948,"score_gpt":0.25872772695770957,"score_spread":0.2502348669452286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045841926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11719739,0.0010858322,0.8396054,0.0011699894,0.0001997173,0.00024023009,0.00061744574,0.0220681,0.017815936],"genre_scores_gemma":[0.62735873,0.0003525261,0.35064602,0.0004825867,0.00014302472,0.00029080425,0.0011524588,0.0038031272,0.015770813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948137,0.0017936528,0.00039324816,0.0006621015,0.0015849231,0.0007523995],"domain_scores_gemma":[0.97526383,0.011710326,0.0005872717,0.010388353,0.0015536714,0.00049654883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048042503,0.00082307233,0.001659635,0.0013678578,0.0019832293,0.004635688,0.0043274835,0.0013568837,0.013061224],"category_scores_gemma":[0.024551734,0.0012829835,0.0013280628,0.0029158234,0.00306971,0.013120987,0.006577821,0.002840217,0.0021948854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024901864,0.00046846256,0.003997976,0.00083156396,0.0001708094,0.0007100294,0.0035523435,0.066707544,0.015583419,0.45424575,0.02792773,0.42331424],"study_design_scores_gemma":[0.0003908038,0.00018410166,0.00059725327,0.000102754726,0.0003008622,0.00032159188,0.0007751376,0.4630667,0.03380073,0.4748942,0.025458656,0.00010712493],"about_ca_topic_score_codex":0.0044848514,"about_ca_topic_score_gemma":0.0077170404,"teacher_disagreement_score":0.013061224,"about_ca_system_score_codex":0.0018123371,"about_ca_system_score_gemma":0.0021282446,"threshold_uncertainty_score":0.04369414},"labels":[],"label_agreement":null},{"id":"W2046619512","doi":"10.1016/j.ic.2004.07.003","title":"Towards an algebraic theory of information integration","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Database Systems and Queries","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":"Concordia University","funders":"","keywords":"Computer science; Algebraic number; Algebra over a field; Algebraic theory; Theoretical computer science; Calculus (dental); Mathematics; Pure mathematics","score_opus":0.01085730189325719,"score_gpt":0.24946845794978648,"score_spread":0.23861115605652927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046619512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008413746,0.0019816535,0.95388675,0.004747496,0.0003687856,0.000051480212,0.00016668315,0.00026365925,0.030119766],"genre_scores_gemma":[0.33951962,0.004521733,0.63423306,0.002017439,0.002124922,0.0003532572,0.000553483,0.00026892003,0.01640746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676895,0.0011462496,0.000282696,0.0004939625,0.0010737347,0.00023445176],"domain_scores_gemma":[0.9958246,0.0018998809,0.00030710164,0.00075440307,0.00097494194,0.0002390203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043354747,0.00092682225,0.0013144573,0.0036904255,0.003014879,0.008552858,0.00292212,0.0022288137,0.0052852333],"category_scores_gemma":[0.008699295,0.0012494059,0.0022380766,0.0043051643,0.010481136,0.02101252,0.005367999,0.0064630215,0.0012302236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030087565,0.0000046348564,0.000032597094,0.0000132453615,0.000003024966,0.00001113882,0.00006284404,0.00045650156,0.00004167021,0.99709356,0.00045623147,0.0018214684],"study_design_scores_gemma":[0.0000047455696,0.0000034380348,0.0000176992,0.000008403508,0.000004539271,0.000020697533,0.000025881072,0.0035651904,0.000047359375,0.9925585,0.0037391034,0.000004434787],"about_ca_topic_score_codex":0.0028180773,"about_ca_topic_score_gemma":0.002480721,"teacher_disagreement_score":0.008552858,"about_ca_system_score_codex":0.0034617386,"about_ca_system_score_gemma":0.0021232844,"threshold_uncertainty_score":0.025116742},"labels":[],"label_agreement":null},{"id":"W2053218689","doi":"10.1016/j.ic.2012.08.004","title":"Connected graph searching","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","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":"Carleton University; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Computer science; Graph; Vertex (graph theory); Conjecture; Theoretical computer science; Connected component; Mathematics; Discrete mathematics","score_opus":0.019700056029231056,"score_gpt":0.2710275313583589,"score_spread":0.2513274753291278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053218689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030215332,0.0021304227,0.89595884,0.0015093675,0.00034210726,0.0003188191,0.0008186461,0.001632529,0.06707399],"genre_scores_gemma":[0.325173,0.0015136586,0.6265388,0.00077964703,0.0002172262,0.0003967709,0.0022284398,0.0009110205,0.042241473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991862,0.00022946883,0.000030403377,0.0002791705,0.00021357111,0.00006113426],"domain_scores_gemma":[0.9984988,0.00070322526,0.00009418661,0.00042483342,0.00018463719,0.0000943973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063506624,0.0009125485,0.0013653049,0.0034086558,0.0014099537,0.0020878084,0.0023186412,0.0023192456,0.025620557],"category_scores_gemma":[0.005683406,0.0006036631,0.0012451267,0.003642443,0.0014170544,0.0040961127,0.002615552,0.0015473976,0.00373222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026057663,0.00022224688,0.0009411795,0.0006010411,0.00015083507,0.00018427515,0.0002016555,0.1113419,0.0036747742,0.4982992,0.032476757,0.35164553],"study_design_scores_gemma":[0.000070745264,0.00006539911,0.0003513628,0.00009174145,0.00007318425,0.00018145399,0.00009009778,0.4317009,0.0029346193,0.54353416,0.02088127,0.000025195552],"about_ca_topic_score_codex":0.0024360188,"about_ca_topic_score_gemma":0.003418689,"teacher_disagreement_score":0.025620557,"about_ca_system_score_codex":0.0011830785,"about_ca_system_score_gemma":0.0012996137,"threshold_uncertainty_score":0.085709274},"labels":[],"label_agreement":null},{"id":"W2056277260","doi":"10.1016/j.ic.2007.07.003","title":"Anonymity protocols as noisy channels","year":2007,"lang":"en","type":"article","venue":"Information and Computation","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":198,"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":"Anonymity; Computer science; Theoretical computer science; Probabilistic logic; Covert; Relation (database); Channel (broadcasting); Covert channel; Computer security; Data mining; Artificial intelligence; Computer network","score_opus":0.014673751319210105,"score_gpt":0.28555150654729194,"score_spread":0.27087775522808183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056277260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072835624,0.0013438247,0.8894809,0.0038482628,0.00028142883,0.0001213964,0.00027589945,0.00055966724,0.031253047],"genre_scores_gemma":[0.9356296,0.001032857,0.047054257,0.00039377232,0.00032003727,0.0001981642,0.00010029513,0.0001574626,0.015113629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98925215,0.0053722155,0.00044797655,0.0010097118,0.0030161159,0.00090176973],"domain_scores_gemma":[0.97178483,0.018652223,0.0021618858,0.0052581322,0.0014358067,0.0007070652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051956372,0.000977546,0.0018304278,0.0025911985,0.0024907899,0.009447038,0.0021851729,0.0037115682,0.0044754916],"category_scores_gemma":[0.022705179,0.001548927,0.0011503169,0.0032699178,0.008332499,0.013727827,0.0057300967,0.0049368725,0.0009121104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075379605,0.00001526823,0.00010714205,0.000027149703,0.000010650528,0.000055620676,0.00019697983,0.016327852,0.0004372121,0.9791692,0.00052234525,0.0030550922],"study_design_scores_gemma":[0.000016457268,0.000012118591,0.000038175174,0.000014841992,0.000014654578,0.00005524686,0.000045408484,0.07650601,0.0006314946,0.9207149,0.0019340344,0.000016747388],"about_ca_topic_score_codex":0.0006475155,"about_ca_topic_score_gemma":0.00046585317,"teacher_disagreement_score":0.009447038,"about_ca_system_score_codex":0.0026348773,"about_ca_system_score_gemma":0.0014896947,"threshold_uncertainty_score":0.027477443},"labels":[],"label_agreement":null},{"id":"W2066620717","doi":"10.1016/j.ic.2008.03.018","title":"State complexity of basic language operations combined with reversal","year":2008,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"State (computer science); Computer science; Theoretical computer science; Programming language; Algorithm","score_opus":0.016258325271429355,"score_gpt":0.2311490287129097,"score_spread":0.21489070344148037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066620717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5143172,0.00068038126,0.44843075,0.0022781682,0.00020527863,0.00016244267,0.0008420839,0.0011892015,0.031894553],"genre_scores_gemma":[0.97327393,0.00024065931,0.021917438,0.00010177958,0.00015594871,0.00010162071,0.000364672,0.00020455797,0.0036394605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720484,0.0007299404,0.00022850961,0.00046154315,0.0008870434,0.00048815753],"domain_scores_gemma":[0.953989,0.03498785,0.0016382922,0.0064444137,0.0018793684,0.0010609676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031009084,0.0006574638,0.0019932361,0.0015221881,0.001343486,0.005875134,0.0024884085,0.0020649433,0.012373181],"category_scores_gemma":[0.0276492,0.00086531416,0.0020450552,0.0018493015,0.0031589393,0.01541734,0.00281572,0.003935843,0.00086019427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046749445,0.00013456408,0.0012006154,0.00015025701,0.000028876679,0.00014406045,0.0003171711,0.03913746,0.004103403,0.93113613,0.0020465318,0.021133482],"study_design_scores_gemma":[0.000031960706,0.00004719056,0.00037371286,0.000011723537,0.00002840197,0.00009248799,0.00005498032,0.17651123,0.0030819466,0.81918347,0.0005471883,0.00003580884],"about_ca_topic_score_codex":0.001531146,"about_ca_topic_score_gemma":0.001352883,"teacher_disagreement_score":0.012373181,"about_ca_system_score_codex":0.002062082,"about_ca_system_score_gemma":0.0021936335,"threshold_uncertainty_score":0.041392386},"labels":[],"label_agreement":null},{"id":"W2068619585","doi":"10.1016/j.ic.2010.09.009","title":"A categorical outlook on relational modalities and simulations","year":2011,"lang":"en","type":"article","venue":"Information and Computation","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":"Queen's University; University of Ottawa","funders":"","keywords":"Categorical variable; Modal; Predicate (mathematical logic); Mathematics; Computer science; Similarity (geometry); Algebra over a field; Pure mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.04959146735645973,"score_gpt":0.25183778198308443,"score_spread":0.2022463146266247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068619585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015525257,0.021623125,0.69038445,0.049997564,0.0020367668,0.000056099056,0.0009066259,0.00054039404,0.21892975],"genre_scores_gemma":[0.68441284,0.020850733,0.22367257,0.010000535,0.0071050203,0.0005075045,0.0008784962,0.0004611016,0.052111145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816716,0.0008220793,0.00009570284,0.00029695645,0.00045022008,0.00016789867],"domain_scores_gemma":[0.9962095,0.0022664063,0.00017563197,0.0005845724,0.00048061498,0.00028322262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031532687,0.0006547294,0.0010659274,0.002542661,0.0026520656,0.0075134467,0.0025295971,0.0032641166,0.012291445],"category_scores_gemma":[0.0053753234,0.0006845529,0.0014122993,0.0024290057,0.013953768,0.016659422,0.0038953663,0.0070117763,0.0017996689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015689626,0.0000015008628,0.000011018788,0.000006351409,6.958725e-7,0.0000035384712,0.000029639634,0.00007469588,0.000016059237,0.9990251,0.0003195325,0.0005102133],"study_design_scores_gemma":[0.000002110632,0.0000024966728,0.00001571995,0.000008418111,8.809943e-7,0.000008446007,0.000026111353,0.00042934087,0.000021665266,0.9947594,0.0047228243,0.0000026325597],"about_ca_topic_score_codex":0.0027934904,"about_ca_topic_score_gemma":0.0019037222,"teacher_disagreement_score":0.012291445,"about_ca_system_score_codex":0.003416831,"about_ca_system_score_gemma":0.0013395337,"threshold_uncertainty_score":0.04111892},"labels":[],"label_agreement":null},{"id":"W2076946745","doi":"10.1016/j.ic.2009.05.003","title":"The complexity of constraint satisfaction games and QCSP","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"Constraint Satisfaction and Optimization","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":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Ministerio de Educación, Cultura y Deporte","keywords":"Constraint satisfaction problem; Complexity of constraint satisfaction; Constraint satisfaction; Local consistency; Constraint (computer-aided design); Constraint satisfaction dual problem; Mathematics; Predicate (mathematical logic); Surjective function; Sentence; Set (abstract data type); Computer science; Theoretical computer science; Discrete mathematics; Artificial intelligence","score_opus":0.017762250527346056,"score_gpt":0.24741021446436245,"score_spread":0.2296479639370164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076946745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31570804,0.002199328,0.59048855,0.01812725,0.00031489605,0.00042830477,0.0042489287,0.00074601354,0.06773878],"genre_scores_gemma":[0.89658767,0.0014167147,0.08329656,0.0009282341,0.0004296546,0.00042621625,0.0022513964,0.00027406943,0.014389459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956643,0.00153623,0.00022329835,0.00065079966,0.0012315452,0.00069381564],"domain_scores_gemma":[0.9707946,0.02437701,0.0013345242,0.0015135407,0.0011344462,0.0008457884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024810645,0.0009990932,0.0022843753,0.0011644767,0.0020910534,0.0064871996,0.0029191454,0.0025846052,0.015152443],"category_scores_gemma":[0.02515207,0.0010649713,0.0019221646,0.0032392426,0.0032780094,0.011448261,0.0030838386,0.0046940683,0.00067488285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002859222,0.00017084708,0.0012559317,0.0003162387,0.000112182395,0.00016800116,0.00037412075,0.174,0.0005428608,0.79410917,0.008458029,0.020206572],"study_design_scores_gemma":[0.00005042008,0.000012897086,0.00022772874,0.000015900008,0.000020683203,0.000036205733,0.00006834626,0.19877023,0.00013965658,0.7994757,0.0011658922,0.000016334354],"about_ca_topic_score_codex":0.016563294,"about_ca_topic_score_gemma":0.013407468,"teacher_disagreement_score":0.016563294,"about_ca_system_score_codex":0.0050456943,"about_ca_system_score_gemma":0.0048806765,"threshold_uncertainty_score":0.050689995},"labels":[],"label_agreement":null},{"id":"W2077748761","doi":"10.1016/j.ic.2006.09.003","title":"Subword conditions and subword histories","year":2006,"lang":"en","type":"article","venue":"Information and Computation","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":"Western University","funders":"","keywords":"Decidability; Computer science; Automaton; Characterization (materials science); Sequence (biology); Word (group theory); Event (particle physics); Inference; Natural language processing; Artificial intelligence; Theoretical computer science; Linguistics","score_opus":0.0045984480673415705,"score_gpt":0.20736270920620134,"score_spread":0.20276426113885976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077748761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17462514,0.0024236396,0.70364016,0.004148192,0.00096606085,0.00029605374,0.0016018439,0.0017395099,0.1105594],"genre_scores_gemma":[0.8674085,0.0015725719,0.08485999,0.0008714259,0.0010692973,0.0005005739,0.0014407196,0.0008061648,0.04147072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969049,0.0008828318,0.00036851707,0.00077377644,0.0006605087,0.00040943432],"domain_scores_gemma":[0.9839728,0.010763066,0.000675018,0.001980732,0.0017610114,0.00084733876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025808096,0.00081687735,0.0012881149,0.0028485158,0.0033888556,0.006229951,0.0014236368,0.0022941488,0.018102162],"category_scores_gemma":[0.012016461,0.0011478027,0.0013619472,0.002512337,0.0063863355,0.019723557,0.0038909488,0.003145626,0.00333823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006979105,0.000015667452,0.00018310637,0.000049357808,0.0000066591747,0.00021068299,0.0005566406,0.00028763083,0.0011145619,0.98954624,0.0008761171,0.007083472],"study_design_scores_gemma":[0.000009843101,0.000013550745,0.00007684022,0.000016228933,0.000010875606,0.000103600985,0.00014518909,0.0016596499,0.0014348103,0.9921416,0.004372428,0.000015329166],"about_ca_topic_score_codex":0.0011567897,"about_ca_topic_score_gemma":0.00094028015,"teacher_disagreement_score":0.018102162,"about_ca_system_score_codex":0.0017179555,"about_ca_system_score_gemma":0.0015920526,"threshold_uncertainty_score":0.060557783},"labels":[],"label_agreement":null},{"id":"W2078103992","doi":"10.1016/j.ic.2005.02.004","title":"Bisimulation and cocongruence for probabilistic systems","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":85,"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; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; University of Oxford","keywords":"Bisimulation; Mathematics; Equivalence (formal languages); Probabilistic logic; Event (particle physics); Characterization (materials science); Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.011050950264788953,"score_gpt":0.23722474774498226,"score_spread":0.2261737974801933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078103992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098370664,0.0018252314,0.8386015,0.0029833976,0.00040065564,0.00011532606,0.0004090401,0.0006825486,0.056611646],"genre_scores_gemma":[0.9131007,0.00083708746,0.07573026,0.0005329892,0.0005519935,0.00026618154,0.00038740083,0.00021630379,0.008377073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99164164,0.0025547538,0.00068851974,0.0015837328,0.0024417164,0.0010897736],"domain_scores_gemma":[0.97247756,0.01940642,0.0012071582,0.0034258687,0.002228999,0.0012540291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060151513,0.0009092557,0.0016186778,0.0029241005,0.003696901,0.0062814644,0.0024192757,0.00220852,0.007045334],"category_scores_gemma":[0.025780583,0.0011182884,0.0024920222,0.0022757428,0.008795652,0.011958765,0.0056765927,0.007188178,0.00074626826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024143234,0.000013870786,0.00011203746,0.000024228344,0.0000070745655,0.00004486936,0.00016618162,0.0011249298,0.00015530418,0.99580944,0.00022246425,0.0022954617],"study_design_scores_gemma":[0.000008147204,0.000007952422,0.00004088607,0.000008940431,0.000008218149,0.000051735773,0.00002289805,0.007320318,0.00024202891,0.991447,0.0008323439,0.00000964805],"about_ca_topic_score_codex":0.0024999576,"about_ca_topic_score_gemma":0.0018970132,"teacher_disagreement_score":0.007045334,"about_ca_system_score_codex":0.0029540928,"about_ca_system_score_gemma":0.0021391474,"threshold_uncertainty_score":0.031811535},"labels":[],"label_agreement":null},{"id":"W2084532813","doi":"10.1016/j.ic.2009.03.004","title":"Variants of codes and indecomposable languages","year":2009,"lang":"en","type":"article","venue":"Information and Computation","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":"Western University; Queen's University","funders":"","keywords":"Catenation; Extension (predicate logic); Indecomposable module; Computer science; Prefix code; Regular language; Code (set theory); Prime (order theory); Decomposition; Mathematics; Programming language; Discrete mathematics; Algebra over a field; Pure mathematics; Automaton; Combinatorics; Theoretical computer science; Algorithm; Decoding methods; Linear code; Set (abstract data type)","score_opus":0.005621339309925413,"score_gpt":0.243609034690517,"score_spread":0.23798769538059159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084532813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3220483,0.0047354535,0.53581107,0.0041674776,0.0014409975,0.00012622632,0.0010813894,0.00074866647,0.12984046],"genre_scores_gemma":[0.9034597,0.0013885226,0.058734033,0.00059427676,0.00089648296,0.00013444995,0.0006445417,0.00026806098,0.03387983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794716,0.0005035238,0.00014308323,0.0005297694,0.00058604457,0.00029044197],"domain_scores_gemma":[0.9956203,0.002186258,0.0003493621,0.00074057636,0.0007094084,0.0003940391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013385479,0.0008049561,0.00083194626,0.0016923606,0.0015280399,0.003948091,0.0015284205,0.0011763911,0.00501196],"category_scores_gemma":[0.005186462,0.000550413,0.0011038086,0.0017543824,0.004273669,0.0056113023,0.002368125,0.003412771,0.0008702327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018357992,0.0000057346842,0.000061821294,0.000012619092,0.0000021696421,0.00005061843,0.00014872663,0.0003896078,0.0003045822,0.99649435,0.0003484263,0.002163122],"study_design_scores_gemma":[0.000006661342,0.000007642986,0.000045889592,0.0000066697075,0.0000038024348,0.000091636146,0.000033785884,0.0020877125,0.00031729596,0.99484915,0.002541451,0.000008259972],"about_ca_topic_score_codex":0.0014842142,"about_ca_topic_score_gemma":0.0012009649,"teacher_disagreement_score":0.00501196,"about_ca_system_score_codex":0.0015347265,"about_ca_system_score_gemma":0.0010285137,"threshold_uncertainty_score":0.016766608},"labels":[],"label_agreement":null},{"id":"W2085731892","doi":"10.1016/j.ic.2012.08.003","title":"Efficient algorithms for the conditional covering problem","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Vertex cover; Algorithm; Vertex (graph theory); Time complexity; Upper and lower bounds; Computer science; Combinatorics; Facility location problem; 1-center problem; Cover (algebra); Stars; Point (geometry); Efficient algorithm; Mathematics; Graph; Mathematical optimization","score_opus":0.02781450298328289,"score_gpt":0.25034370785432913,"score_spread":0.22252920487104624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085731892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019579856,0.00053335895,0.9702876,0.00101625,0.00009286128,0.000096111646,0.000517252,0.0010361919,0.006840488],"genre_scores_gemma":[0.3383272,0.0006655552,0.64867276,0.00033371465,0.00023323148,0.00044048065,0.0027258995,0.00058443344,0.008016789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980932,0.0007314635,0.00007490307,0.00039273285,0.00034699362,0.00036064323],"domain_scores_gemma":[0.9895453,0.008261658,0.00036865807,0.0010726567,0.00045290095,0.0002988951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024239074,0.00147456,0.0021835153,0.0014529257,0.0012956496,0.0030242067,0.0038507732,0.0021225107,0.013452826],"category_scores_gemma":[0.012954609,0.0012292783,0.0016802641,0.003123046,0.0015828484,0.005352791,0.0038265188,0.003245007,0.0014508989],"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.00041009282,0.00033732253,0.0011789612,0.00030430406,0.0001119311,0.00011828741,0.00022723782,0.6014547,0.0008831321,0.20871243,0.020577382,0.16568427],"study_design_scores_gemma":[0.000054213706,0.000020082176,0.00015735142,0.000016987551,0.00001712278,0.00003125285,0.00003011051,0.86877096,0.00025230943,0.12917374,0.0014660201,0.000009841773],"about_ca_topic_score_codex":0.008859284,"about_ca_topic_score_gemma":0.009638831,"teacher_disagreement_score":0.013452826,"about_ca_system_score_codex":0.0030819261,"about_ca_system_score_gemma":0.0036744098,"threshold_uncertainty_score":0.04500419},"labels":[],"label_agreement":null},{"id":"W2087666725","doi":"10.1016/j.ic.2010.12.005","title":"A logical duality for underspecified probabilistic systems","year":2010,"lang":"en","type":"article","venue":"Information and Computation","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":"Université Laval","funders":"","keywords":"Probabilistic logic; Galois connection; Duality (order theory); Connection (principal bundle); Probabilistic automaton; Functor; Bisimulation; Mathematics; Automaton; Evidentiality; Simple (philosophy); Computer science; Theoretical computer science; Discrete mathematics; Artificial intelligence","score_opus":0.03267041144300124,"score_gpt":0.27589539379364997,"score_spread":0.2432249823506487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087666725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020997874,0.00076215,0.9315302,0.005183999,0.00038843392,0.0000644375,0.00037323756,0.0002891802,0.040410534],"genre_scores_gemma":[0.69402665,0.0010639507,0.28666168,0.0024689704,0.0013865593,0.00027681456,0.0007716709,0.0002480756,0.0130956285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925621,0.002734775,0.0006905625,0.0014311884,0.0019182017,0.00066318404],"domain_scores_gemma":[0.98662823,0.0071974043,0.0007876087,0.0026571935,0.0020047424,0.00072486047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008000167,0.00072368176,0.0013900183,0.0027583083,0.0028350628,0.008660678,0.0026536994,0.0028728505,0.009929375],"category_scores_gemma":[0.017695058,0.0011620501,0.003303413,0.0017490351,0.008674558,0.022345018,0.007711113,0.008871674,0.0012881726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007865699,0.000005740839,0.000043224605,0.000012222467,0.000003849133,0.000024720928,0.00007066489,0.0002811441,0.000083671315,0.99781114,0.00025600364,0.0013997116],"study_design_scores_gemma":[0.0000045613265,0.000003793059,0.000023246606,0.0000073007213,0.000005032631,0.00004003872,0.000021279457,0.0027030907,0.00011905549,0.99550146,0.0015660544,0.0000050433555],"about_ca_topic_score_codex":0.000888692,"about_ca_topic_score_gemma":0.000716402,"teacher_disagreement_score":0.009929375,"about_ca_system_score_codex":0.002353038,"about_ca_system_score_gemma":0.0017068384,"threshold_uncertainty_score":0.042309403},"labels":[],"label_agreement":null},{"id":"W2096204190","doi":"10.1016/j.ic.2016.02.008","title":"A mathematical theory of resources","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":313,"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","funders":"Ministero dello Sviluppo Economico; Institut Périmètre de physique théorique; Industry Canada; Government of Canada; John Templeton Foundation","keywords":"Resource (disambiguation); Computer science; Class (philosophy); Convertibility; Quantum entanglement; Resource dependence theory; Management science; Mathematical economics; Quantum; Mathematics; Economics; Artificial intelligence; Quantum mechanics; Physics","score_opus":0.009347383831875451,"score_gpt":0.23759509129461698,"score_spread":0.22824770746274153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096204190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014049653,0.006369123,0.7405571,0.015467311,0.0007475053,0.00007984582,0.00078261114,0.00023676292,0.22171006],"genre_scores_gemma":[0.6651026,0.009314484,0.21708116,0.0038251474,0.0023401605,0.00069328735,0.00084104214,0.00033345286,0.10046872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981217,0.00066150003,0.00012652502,0.00036607683,0.00050977845,0.00021449807],"domain_scores_gemma":[0.99765706,0.001105569,0.00016301428,0.00056796306,0.00034489724,0.00016140792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023100334,0.00095173146,0.0010687989,0.0024998114,0.0025101474,0.007172164,0.002725904,0.0031715173,0.012150946],"category_scores_gemma":[0.0052853213,0.0008596564,0.0015079014,0.0030942261,0.010301944,0.01942824,0.0036311976,0.0047586085,0.001922341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.451368e-7,9.4064893e-7,0.000006165401,0.000004526963,8.801969e-7,0.0000048865777,0.000015859123,0.00015355431,0.000019066374,0.99917245,0.00028014838,0.00034082774],"study_design_scores_gemma":[0.000002122619,0.0000015673259,0.000012402051,0.000006909486,0.0000020328907,0.000022834325,0.000015845546,0.0015136041,0.000029051927,0.99325824,0.0051321606,0.0000032097546],"about_ca_topic_score_codex":0.0033561077,"about_ca_topic_score_gemma":0.0024065697,"teacher_disagreement_score":0.012150946,"about_ca_system_score_codex":0.003300817,"about_ca_system_score_gemma":0.0020200086,"threshold_uncertainty_score":0.040648937},"labels":[],"label_agreement":null},{"id":"W2100893927","doi":"10.1006/inco.2001.2962","title":"Bisimulation for Labelled Markov Processes","year":2002,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":307,"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 chain; Markov process; State space; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.037638548441248657,"score_gpt":0.2940433828801528,"score_spread":0.25640483443890416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100893927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03061905,0.00021656821,0.9579888,0.00035645958,0.00007631912,0.0001377303,0.00019956184,0.00055031,0.009855207],"genre_scores_gemma":[0.75987124,0.0005379377,0.22447063,0.00042459354,0.00013335695,0.0010743145,0.0008176789,0.0005058799,0.012164356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99386805,0.0023990918,0.0004096803,0.0011175438,0.0013985094,0.0008071667],"domain_scores_gemma":[0.9836573,0.011823417,0.0011147034,0.0014629265,0.001356189,0.0005854107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045408276,0.0012665294,0.0015051994,0.001890072,0.0023054257,0.0037547182,0.0025244865,0.0021251927,0.0068764696],"category_scores_gemma":[0.019815084,0.0010377443,0.002436092,0.0016107736,0.004253785,0.0067286594,0.004241829,0.004198548,0.0011773283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103172664,0.00004304783,0.00012793035,0.00006154831,0.000023913703,0.000050741313,0.00021961083,0.021156492,0.00076994917,0.971307,0.00034266643,0.005793987],"study_design_scores_gemma":[0.00003340397,0.000021244197,0.000039319388,0.000023100087,0.000018134198,0.00001635288,0.000025703053,0.07419014,0.00097097264,0.9236257,0.001019965,0.000015864698],"about_ca_topic_score_codex":0.0045527024,"about_ca_topic_score_gemma":0.004086094,"teacher_disagreement_score":0.0068764696,"about_ca_system_score_codex":0.0042924085,"about_ca_system_score_gemma":0.0029110224,"threshold_uncertainty_score":0.031143785},"labels":[],"label_agreement":null},{"id":"W2108990830","doi":"10.1016/j.ic.2010.09.005","title":"Optimality and competitiveness of exploring polygons by mobile robots","year":2010,"lang":"en","type":"article","venue":"Information and Computation","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":"","keywords":"Polygon (computer graphics); Simple polygon; Mobile robot; Focus (optics); Robot; Trajectory; Computer science; Boundary (topology); Metric (unit); Square (algebra); Point (geometry); Convex polygon; Computer vision; Artificial intelligence; Algorithm; Mathematics; Regular polygon; Geometry; Engineering","score_opus":0.01863673248393834,"score_gpt":0.2608629734210505,"score_spread":0.24222624093711217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108990830","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7789997,0.0014196084,0.17147253,0.001700754,0.000100671685,0.00011908984,0.000585934,0.00025055496,0.045351245],"genre_scores_gemma":[0.95036215,0.00055345614,0.042743478,0.00009158396,0.00009606836,0.00011581041,0.00045110603,0.00024168934,0.005344614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986039,0.00050965935,0.00006025301,0.00021639811,0.00027011713,0.00033975893],"domain_scores_gemma":[0.99125564,0.006370353,0.0007130066,0.00043086064,0.00041001025,0.0008200374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016941662,0.00085511734,0.0025058922,0.001524149,0.0012949586,0.003564651,0.0018373214,0.0019333648,0.007170592],"category_scores_gemma":[0.013566041,0.00086850504,0.0013695394,0.0018651063,0.0034319826,0.0036019133,0.002627467,0.0017116104,0.00061055686],"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.0016473712,0.00024578246,0.008892687,0.00035725464,0.00011374592,0.00032013812,0.00062327116,0.537872,0.0050213602,0.4017516,0.0052507655,0.03790394],"study_design_scores_gemma":[0.00020382673,0.00031821424,0.003857065,0.00005531053,0.00007120534,0.00023006451,0.00045267385,0.59197223,0.0025901382,0.397096,0.0031151723,0.000038019116],"about_ca_topic_score_codex":0.005262135,"about_ca_topic_score_gemma":0.004626542,"teacher_disagreement_score":0.007170592,"about_ca_system_score_codex":0.001444381,"about_ca_system_score_gemma":0.0016263027,"threshold_uncertainty_score":0.023988008},"labels":[],"label_agreement":null},{"id":"W2116455242","doi":"10.1016/j.ic.2004.10.001","title":"Fast approximate PCPs for multidimensional bin-packing problems","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Packing Problems","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Computer science; Bin packing problem; Bin; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.012181791405063412,"score_gpt":0.21943732164037733,"score_spread":0.2072555302353139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116455242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023990626,0.001463641,0.96163857,0.0006930277,0.00027273936,0.00022630714,0.0006199686,0.0016157448,0.009479407],"genre_scores_gemma":[0.24345596,0.0011809049,0.7453016,0.00034285535,0.00029995816,0.0006931729,0.0017975783,0.0005624482,0.0063655525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981,0.00045615376,0.00010400036,0.00017804596,0.0009134253,0.0002483985],"domain_scores_gemma":[0.995644,0.0022208,0.00024248323,0.0009841131,0.0006918791,0.00021683055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018495586,0.0014371831,0.0026606596,0.0017021933,0.0011382484,0.002918016,0.0022431945,0.0019578973,0.012561251],"category_scores_gemma":[0.0123042455,0.0011282563,0.0013846562,0.0051604947,0.000879887,0.0042729895,0.0029671676,0.0027782102,0.002394724],"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.000851569,0.00028276898,0.00082771404,0.0006042233,0.000095141775,0.00014055519,0.00016412348,0.56496555,0.002758859,0.08124566,0.028027361,0.32003653],"study_design_scores_gemma":[0.000061538165,0.000038919046,0.000104532,0.000018443765,0.000011025979,0.00004250345,0.000026522799,0.9539722,0.00060555455,0.04268269,0.002427831,0.000008224039],"about_ca_topic_score_codex":0.0070873764,"about_ca_topic_score_gemma":0.011856081,"teacher_disagreement_score":0.012561251,"about_ca_system_score_codex":0.0017659125,"about_ca_system_score_gemma":0.0030137429,"threshold_uncertainty_score":0.042021632},"labels":[],"label_agreement":null},{"id":"W2126472279","doi":"10.1016/j.ic.2007.06.002","title":"Some natural conditions on incremental learning","year":2007,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","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 Alberta","funders":"National University of Singapore","keywords":"Natural (archaeology); Computer science; Artificial intelligence; Geology","score_opus":0.006486232717059994,"score_gpt":0.26785870355440244,"score_spread":0.26137247083734244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126472279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049156085,0.002474113,0.85381126,0.011475575,0.0008779618,0.0003092945,0.0019835266,0.0010770968,0.07883509],"genre_scores_gemma":[0.7274346,0.003503174,0.22934982,0.0043637636,0.004181703,0.0017387394,0.0041007902,0.00088144775,0.024446007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651825,0.0010894368,0.00037600345,0.0008348471,0.00083938165,0.00034207987],"domain_scores_gemma":[0.95070225,0.038766604,0.001269214,0.0037515515,0.0041712956,0.0013389932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065548373,0.00096173736,0.0016336845,0.0027695089,0.002557628,0.004742908,0.002814384,0.0030622345,0.020155713],"category_scores_gemma":[0.0536829,0.00093370466,0.0021205996,0.003159761,0.004989357,0.018089214,0.0049789073,0.005471168,0.0017319856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061980834,0.000037840204,0.00029085303,0.0000896477,0.000011286138,0.00008986812,0.00015342642,0.00096473884,0.00025392926,0.98511827,0.0042204885,0.008707814],"study_design_scores_gemma":[0.00002794795,0.00001913284,0.00015100194,0.000027842416,0.000012542058,0.000104640974,0.000057711462,0.011242614,0.00041564403,0.9852149,0.002713113,0.000012838824],"about_ca_topic_score_codex":0.0013773718,"about_ca_topic_score_gemma":0.001424825,"teacher_disagreement_score":0.020155713,"about_ca_system_score_codex":0.0016737378,"about_ca_system_score_gemma":0.001724249,"threshold_uncertainty_score":0.067427516},"labels":[],"label_agreement":null},{"id":"W2127629365","doi":"10.1016/j.ic.2015.07.005","title":"Position discovery for a system of bouncing robots","year":2015,"lang":"en","type":"article","venue":"Information and Computation","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":"Carleton University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Agence Nationale de la Recherche; Royal Society","keywords":"Robot; Position (finance); Computer science; Mobile robot; Point (geometry); Line segment; Artificial intelligence; Constant (computer programming); Task (project management); Computer vision; Line (geometry); Ring (chemistry); Algorithm; Topology (electrical circuits); Mathematics; Geometry; Combinatorics; Engineering","score_opus":0.02835690603338894,"score_gpt":0.26699115665965323,"score_spread":0.23863425062626428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127629365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17480731,0.00050575915,0.8159691,0.0016917319,0.00009443189,0.0001119247,0.00024914273,0.0005189256,0.0060516493],"genre_scores_gemma":[0.87807137,0.00020067435,0.113200895,0.00009549752,0.00005655823,0.0000877717,0.0002072007,0.000057969806,0.0080220895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993845,0.0001303592,0.000052129682,0.000194658,0.00012852899,0.00010976477],"domain_scores_gemma":[0.9972523,0.0017611595,0.00029756466,0.00016349184,0.00031517245,0.0002103309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014091952,0.0007237673,0.0013700031,0.0012378573,0.0021385858,0.0021735707,0.0020139145,0.0033551578,0.0052338145],"category_scores_gemma":[0.007863876,0.0008896646,0.00081655715,0.00127352,0.0020001992,0.0024485723,0.0026502586,0.0012669234,0.00057899195],"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.00065889,0.00008495448,0.0024449467,0.00018063986,0.00007001854,0.0002906675,0.0002608555,0.9290506,0.0027733438,0.036151882,0.0009912862,0.02704196],"study_design_scores_gemma":[0.000031921336,0.000053242456,0.0002279018,0.000007128736,0.000015171334,0.000037917325,0.000032198062,0.9888748,0.00047555196,0.00998437,0.0002463804,0.000013398069],"about_ca_topic_score_codex":0.013612907,"about_ca_topic_score_gemma":0.0076710964,"teacher_disagreement_score":0.013612907,"about_ca_system_score_codex":0.0015363552,"about_ca_system_score_gemma":0.0017060603,"threshold_uncertainty_score":0.027067304},"labels":[],"label_agreement":null},{"id":"W2131358503","doi":"10.1016/j.ic.2006.09.005","title":"Towards a dichotomy theorem for the counting constraint satisfaction problem","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":137,"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; Discrete mathematics; Counting problem; Homomorphism; Complexity of constraint satisfaction; Combinatorics; Time complexity; Class (philosophy); Constraint (computer-aided design); Constraint graph; Set (abstract data type); Constraint satisfaction dual problem; Constraint satisfaction; Local consistency; Computer science","score_opus":0.013618246427346062,"score_gpt":0.27892914844829203,"score_spread":0.265310902020946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131358503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05266651,0.0016356864,0.8016187,0.03392016,0.0010289212,0.00018081092,0.00088466995,0.00081314065,0.10725129],"genre_scores_gemma":[0.650587,0.0023842154,0.29181367,0.015785892,0.0041702,0.0010091225,0.0025852956,0.0008948838,0.030769618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994609,0.0017652626,0.00022207003,0.001130785,0.0015434169,0.00072944065],"domain_scores_gemma":[0.977019,0.01903363,0.0005684256,0.001344159,0.0012973112,0.0007375108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060974983,0.0011300601,0.0027381384,0.003144052,0.0038674616,0.008166187,0.0050026644,0.0050992835,0.014618913],"category_scores_gemma":[0.027027113,0.0012083742,0.0025843976,0.0039508357,0.0072388714,0.01845817,0.009088867,0.01744456,0.0018212821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052960924,0.00005362959,0.00017076703,0.00007373542,0.00001614176,0.00003599775,0.00012065656,0.0017841113,0.00032902398,0.9842934,0.0057480233,0.007321541],"study_design_scores_gemma":[0.000019017649,0.000007373025,0.000046899084,0.000015027206,0.0000064195615,0.000016886232,0.00002202447,0.0117965145,0.0001209131,0.9866506,0.0012919507,0.000006293223],"about_ca_topic_score_codex":0.0019505213,"about_ca_topic_score_gemma":0.001709836,"teacher_disagreement_score":0.014618913,"about_ca_system_score_codex":0.0039725266,"about_ca_system_score_gemma":0.0026221853,"threshold_uncertainty_score":0.048905075},"labels":[],"label_agreement":null},{"id":"W2138395462","doi":"10.1016/j.ic.2006.02.004","title":"Mind change efficient learning","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Class (philosophy); Order (exchange); Set (abstract data type); Computer science; Point (geometry); Property (philosophy); Artificial intelligence; Mathematics; Theoretical computer science; Epistemology; Pure mathematics","score_opus":0.009672202445510066,"score_gpt":0.23670760446161604,"score_spread":0.22703540201610597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138395462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080358006,0.0016058928,0.74345386,0.008222717,0.0010943873,0.00010670506,0.00033255824,0.0016167572,0.1632092],"genre_scores_gemma":[0.8034432,0.0008068418,0.12573919,0.0012483235,0.000439522,0.000112544505,0.0003226181,0.0004952931,0.067392476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947613,0.000118178374,0.000017814125,0.00017942264,0.00014806047,0.00006027976],"domain_scores_gemma":[0.9979388,0.00075360946,0.00011683741,0.00073125376,0.0003290725,0.0001304597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006962619,0.0003887615,0.0004077239,0.0005355273,0.0005628464,0.0016274258,0.00092473655,0.00096083054,0.017786503],"category_scores_gemma":[0.0063832863,0.00029955577,0.00046271778,0.00045358308,0.001219472,0.0035465707,0.0013496687,0.0018487216,0.0026159536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011027777,0.00010729175,0.0010399104,0.0001359303,0.0000752255,0.000097400385,0.00026292086,0.013007574,0.006393201,0.77088726,0.01743826,0.1904447],"study_design_scores_gemma":[0.000018292012,0.000037917293,0.0012009359,0.000015061816,0.000030293912,0.000121740195,0.00007025573,0.069752835,0.0029623625,0.90565044,0.020126265,0.00001361215],"about_ca_topic_score_codex":0.00052758754,"about_ca_topic_score_gemma":0.00065513194,"teacher_disagreement_score":0.017786503,"about_ca_system_score_codex":0.0006534119,"about_ca_system_score_gemma":0.0004857303,"threshold_uncertainty_score":0.059501767},"labels":[],"label_agreement":null},{"id":"W2140884424","doi":"10.1016/j.ic.2011.08.001","title":"Modelling concurrency with comtraces and generalized comtraces","year":2011,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Database Systems and Queries","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 Toronto; McMaster University","funders":"","keywords":"Concurrency; Algebraic number; Mathematics; Computer science; Algebra over a field; Order (exchange); Pure mathematics; Programming language; Mathematical analysis","score_opus":0.033065042588781735,"score_gpt":0.2357557416152679,"score_spread":0.20269069902648618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140884424","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.019777842,0.00058372784,0.9699423,0.0005409085,0.00017243347,0.00009379902,0.00009714787,0.00045428524,0.00833757],"genre_scores_gemma":[0.62774354,0.0010826292,0.34848168,0.00039471997,0.00042874264,0.0004715715,0.0003227689,0.0007220795,0.020352243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99215525,0.0030075097,0.0007583883,0.000989655,0.0020636593,0.0010255642],"domain_scores_gemma":[0.9810488,0.010333962,0.0011567225,0.00520949,0.0014853858,0.0007656319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00593775,0.0014975778,0.0016187053,0.001980664,0.001924177,0.0073703346,0.004178258,0.0029941353,0.009448541],"category_scores_gemma":[0.022151794,0.0017287049,0.0026970739,0.003343795,0.006154208,0.017712306,0.007698135,0.005363039,0.0010434536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045915058,0.000017721899,0.00033398424,0.00005577323,0.000024701427,0.00017783637,0.00032207716,0.027177392,0.00056399574,0.9651257,0.00043006247,0.005724803],"study_design_scores_gemma":[0.000044174427,0.000028973118,0.000070846414,0.00003272019,0.00004611647,0.00017807321,0.00012920295,0.1518203,0.0015269121,0.8358615,0.010230089,0.00003106717],"about_ca_topic_score_codex":0.005368592,"about_ca_topic_score_gemma":0.0044606677,"teacher_disagreement_score":0.009448541,"about_ca_system_score_codex":0.0018465724,"about_ca_system_score_gemma":0.0026278682,"threshold_uncertainty_score":0.031608462},"labels":[],"label_agreement":null},{"id":"W2156839950","doi":"10.1016/j.ic.2012.10.011","title":"Range majority in constant time and linear space","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"Interconnection Networks and Systems","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 Waterloo; Dalhousie University; University of Manitoba","funders":"","keywords":"Range (aeronautics); Range query (database); Linear space; Upper and lower bounds; Constant (computer programming); Logarithm; Mathematics; Space (punctuation); Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Search engine; Sargable; Web search query; Information retrieval","score_opus":0.010948765977663364,"score_gpt":0.23301614964241424,"score_spread":0.22206738366475087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156839950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0996931,0.00395467,0.7916876,0.00891772,0.000936194,0.00027980033,0.0010271504,0.005334227,0.08816953],"genre_scores_gemma":[0.7658703,0.0015245562,0.1498967,0.002081435,0.0011406704,0.00047829445,0.0007399895,0.0014398751,0.07682819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99482346,0.0012763215,0.00023711302,0.0011389982,0.0013599223,0.001164232],"domain_scores_gemma":[0.9833107,0.010878952,0.0006352421,0.0032953115,0.0011619586,0.0007177863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028494843,0.001519501,0.002424221,0.0014789293,0.003091029,0.005962445,0.0030900973,0.0021724985,0.019350106],"category_scores_gemma":[0.017343909,0.00081222726,0.0013444576,0.0024539523,0.0040325965,0.016587483,0.005985332,0.004565507,0.0039537903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014401504,0.00018614753,0.00058137416,0.000532905,0.00010386928,0.00016710475,0.0006870504,0.042678684,0.006132907,0.8052534,0.027628982,0.11460742],"study_design_scores_gemma":[0.00013667821,0.000091367576,0.00014085327,0.00004235349,0.00007005609,0.00012519436,0.00014302772,0.0941569,0.0043814844,0.8923277,0.008347589,0.00003675197],"about_ca_topic_score_codex":0.0021349734,"about_ca_topic_score_gemma":0.0034389829,"teacher_disagreement_score":0.019350106,"about_ca_system_score_codex":0.0029141314,"about_ca_system_score_gemma":0.0028421301,"threshold_uncertainty_score":0.06473255},"labels":[],"label_agreement":null},{"id":"W2159509242","doi":"10.1016/j.ic.2007.02.004","title":"Exponential lower bounds for the number of words of uniform length avoiding a pattern","year":2007,"lang":"en","type":"article","venue":"Information and Computation","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":"Simon Fraser University","funders":"","keywords":"Alphabet; Exponential growth; Mathematics; Exponential function; Combinatorics; Combinatorics on words; Finite set; Upper and lower bounds; Word length; Discrete mathematics; Word (group theory); Computer science; Natural language processing; Linguistics; Mathematical analysis; Geometry","score_opus":0.01120924040276972,"score_gpt":0.26443390570068526,"score_spread":0.25322466529791554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159509242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32002833,0.009981264,0.5339245,0.019084362,0.001552552,0.0003791672,0.004710548,0.0034103007,0.10692896],"genre_scores_gemma":[0.852554,0.004190317,0.09999193,0.002512694,0.002632023,0.0010775744,0.0033585636,0.001735812,0.031947244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906881,0.001708113,0.00067865226,0.0020855975,0.0027765047,0.0020630811],"domain_scores_gemma":[0.88502765,0.094589524,0.0035928898,0.009810133,0.0037526027,0.0032270777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006647013,0.0028881566,0.0035851286,0.0040373565,0.0033988147,0.011011535,0.008425167,0.004852858,0.02370249],"category_scores_gemma":[0.058933835,0.0021252048,0.0028139413,0.0043785037,0.0066107535,0.025655566,0.007196305,0.00834576,0.0041339993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00442238,0.0006970793,0.005272193,0.0016545,0.00031112524,0.00065427227,0.001189439,0.06909447,0.019455573,0.79440635,0.02477756,0.07806503],"study_design_scores_gemma":[0.00020336635,0.0001376409,0.0009469728,0.00014778702,0.00018551307,0.000637572,0.00013137105,0.14441681,0.0066871764,0.840969,0.005432974,0.0001037475],"about_ca_topic_score_codex":0.0010004529,"about_ca_topic_score_gemma":0.001529787,"teacher_disagreement_score":0.02370249,"about_ca_system_score_codex":0.0055110715,"about_ca_system_score_gemma":0.0030758216,"threshold_uncertainty_score":0.079292774},"labels":[],"label_agreement":null},{"id":"W2170001390","doi":"10.1016/j.ic.2017.06.003","title":"Space proof complexity for random 3-CNFs","year":2017,"lang":"en","type":"preprint","venue":"Information and Computation","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 Toronto","funders":"European Research Council; Seventh Framework Programme; Sapienza Università di Roma; European Commission; Simons Foundation","keywords":"Lemma (botany); Mathematics; Combinatorics; Omega; Bipartite graph; Resolution (logic); Monomial; Upper and lower bounds; Discrete mathematics; Space (punctuation); Algebraic number; Disjoint sets; Physics; Computer science; Mathematical analysis; Graph","score_opus":0.03906740328881324,"score_gpt":0.29528677347701904,"score_spread":0.2562193701882058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170001390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33335438,0.0024885032,0.59984744,0.012446426,0.0005023463,0.00046700053,0.003961657,0.0026046704,0.044327527],"genre_scores_gemma":[0.9252646,0.00068113056,0.058859173,0.0008119564,0.0003554452,0.0003252917,0.0014731319,0.0005850604,0.011644174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99135685,0.0024387978,0.0004723688,0.001308906,0.0029785235,0.0014444411],"domain_scores_gemma":[0.95100117,0.038234703,0.0016395039,0.0056287744,0.0021738664,0.0013219701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004919099,0.0010823405,0.0021901296,0.0016290118,0.0023657435,0.0070055034,0.003166006,0.0029367427,0.025940761],"category_scores_gemma":[0.031899855,0.0009165294,0.002519627,0.002221178,0.0034981822,0.014525372,0.0043548536,0.00450438,0.001906025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006758948,0.00017438205,0.0017195649,0.00047832634,0.00009756978,0.00018405246,0.00071326544,0.04944695,0.0028305422,0.8967043,0.010677001,0.036298085],"study_design_scores_gemma":[0.00006797593,0.000021367354,0.00018653163,0.000028875282,0.000036823058,0.00006825806,0.00005692475,0.08275544,0.0011008284,0.9141338,0.0015210727,0.00002217078],"about_ca_topic_score_codex":0.0044975723,"about_ca_topic_score_gemma":0.0057116454,"teacher_disagreement_score":0.025940761,"about_ca_system_score_codex":0.005395846,"about_ca_system_score_gemma":0.006568772,"threshold_uncertainty_score":0.08678043},"labels":[],"label_agreement":null},{"id":"W2190677066","doi":"10.1016/j.ic.2016.12.009","title":"Modeling concurrency with interval traces","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"Petri Nets in System Modeling","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Concurrency; Interval (graph theory); Programming language; Distributed computing; Theoretical computer science; Parallel computing; Mathematics; Combinatorics","score_opus":0.03399494561031575,"score_gpt":0.28593125966659894,"score_spread":0.2519363140562832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2190677066","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.016411332,0.000104524006,0.98006743,0.000103760256,0.000027953818,0.000026495487,0.00005025247,0.00025881216,0.0029494567],"genre_scores_gemma":[0.76531166,0.0004094939,0.22838365,0.00006403364,0.00007531117,0.00015077116,0.0002292997,0.00016095044,0.005214879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806756,0.00067959377,0.00015794166,0.0003134605,0.00055170443,0.00022980377],"domain_scores_gemma":[0.99262446,0.0051287217,0.00052580226,0.0009655179,0.00047127667,0.00028415155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026877783,0.00088657415,0.0007765641,0.0014362924,0.00073160446,0.0029199189,0.0019455502,0.0010545735,0.0036396247],"category_scores_gemma":[0.0124956705,0.0008248963,0.0014320653,0.0015990136,0.0021965955,0.006082706,0.0024264522,0.0022488066,0.00039791767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011887578,0.00006559856,0.001155347,0.00006699542,0.000042275286,0.00025888442,0.00034085807,0.32107913,0.001260325,0.6581187,0.000324284,0.017168734],"study_design_scores_gemma":[0.00001520115,0.000019925912,0.0000667219,0.00002200154,0.000028750997,0.00003684927,0.000046354806,0.7146444,0.0012333322,0.2823978,0.0014767665,0.000011863533],"about_ca_topic_score_codex":0.0053844987,"about_ca_topic_score_gemma":0.003978363,"teacher_disagreement_score":0.0053844987,"about_ca_system_score_codex":0.0010939565,"about_ca_system_score_gemma":0.0015997833,"threshold_uncertainty_score":0.014214516},"labels":[],"label_agreement":null},{"id":"W2229623334","doi":"10.1016/j.ic.2015.12.013","title":"Bounded Combinatory Logic and lower complexity","year":2016,"lang":"en","type":"article","venue":"Information and Computation","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":"Northwestern Polytechnic","funders":"","keywords":"Bounded function; Class (philosophy); Mathematics; Distributivity; Discrete mathematics; Linear logic; Combinatory logic; Characterization (materials science); Complexity class; Polynomial; Computer science; Time complexity; Pure mathematics; Artificial intelligence; Distributive property","score_opus":0.030731191472301824,"score_gpt":0.2548828748145271,"score_spread":0.22415168334222527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2229623334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15209591,0.017538654,0.544486,0.043302316,0.00071095256,0.000087699875,0.0013701839,0.0011438439,0.23926443],"genre_scores_gemma":[0.9072625,0.0052303504,0.05471795,0.0029547126,0.0015416363,0.00022110791,0.0009637419,0.0004656717,0.026642233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942644,0.0016972603,0.00029766647,0.0010691765,0.0019259744,0.00074563205],"domain_scores_gemma":[0.96776575,0.025034787,0.0009915123,0.003616579,0.0015640946,0.0010272424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041412674,0.0010717518,0.0019814388,0.0028815167,0.0026037176,0.010390927,0.0032167,0.00241505,0.013553222],"category_scores_gemma":[0.017628074,0.000843393,0.002109773,0.0040455004,0.01051339,0.019278515,0.0048346333,0.010160178,0.0015170887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019226976,0.000016030152,0.00015510894,0.000047985934,0.000008440669,0.000018804954,0.0000771986,0.0010407629,0.00009937504,0.9944569,0.0011803391,0.0028797507],"study_design_scores_gemma":[0.000004450545,0.0000019184229,0.000051849678,0.0000081474245,0.0000046650384,0.000012305658,0.000010749299,0.0018878297,0.00006651044,0.9969235,0.0010240535,0.0000039415318],"about_ca_topic_score_codex":0.0036119265,"about_ca_topic_score_gemma":0.0034690418,"teacher_disagreement_score":0.013553222,"about_ca_system_score_codex":0.00765625,"about_ca_system_score_gemma":0.0024580315,"threshold_uncertainty_score":0.055550218},"labels":[],"label_agreement":null},{"id":"W2251394987","doi":"10.1016/j.ic.2016.01.005","title":"Topology recognition with advice","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Complexity and Algorithms in Graphs","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":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Advice (programming); Topology (electrical circuits); Oracle; Computer science; Node (physics); Network topology; Computation; Upper and lower bounds; Graph; Logical topology; Theoretical computer science; Mathematics; Computer network; Combinatorics; Algorithm","score_opus":0.015775602856260954,"score_gpt":0.2353759725628819,"score_spread":0.21960036970662095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2251394987","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.03338823,0.0002676296,0.88337743,0.0009889926,0.0005119851,0.00021126568,0.0015644176,0.025503667,0.054186314],"genre_scores_gemma":[0.4436649,0.00030048573,0.4990744,0.00049935136,0.00024168943,0.0001964182,0.0041980967,0.0029780234,0.048846606],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860114,0.00020235087,0.00010346362,0.00041100095,0.0005269785,0.00015510089],"domain_scores_gemma":[0.99685353,0.00076026144,0.00011218595,0.0014343486,0.00066608,0.00017359635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006894942,0.00087644934,0.0009766147,0.0018852575,0.0009888465,0.002622325,0.0015690207,0.0015158786,0.025422817],"category_scores_gemma":[0.0076248646,0.00050191075,0.0010984773,0.001313516,0.0009876057,0.0039475285,0.0025362002,0.0018302534,0.011287697],"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.0005005954,0.0001888522,0.0026819573,0.00034271742,0.000060073595,0.0004796485,0.0004581205,0.027819734,0.015955066,0.1627736,0.055374794,0.7333649],"study_design_scores_gemma":[0.00006182738,0.00008265057,0.0009083898,0.00010392838,0.000071230024,0.00047457687,0.00023046571,0.34956667,0.03488508,0.52280915,0.09073944,0.000066556415],"about_ca_topic_score_codex":0.002586024,"about_ca_topic_score_gemma":0.004383812,"teacher_disagreement_score":0.025422817,"about_ca_system_score_codex":0.0007806207,"about_ca_system_score_gemma":0.0010040714,"threshold_uncertainty_score":0.08504778},"labels":[],"label_agreement":null},{"id":"W2258074816","doi":"10.1016/j.ic.2016.02.001","title":"Approximate matching between a context-free grammar and a finite-state automaton","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Science and Technology; National Research Foundation of Korea","keywords":"Edit distance; Affine transformation; Automaton; Deterministic finite automaton; Computer science; Deterministic automaton; Finite-state machine; Nondeterministic finite automaton; Context (archaeology); Matching (statistics); Context-free language; Grammar; Theoretical computer science; State (computer science); Büchi automaton; Time complexity; State diagram; Algorithm; Mathematics; Automata theory; Artificial intelligence; Rule-based machine translation; Pure mathematics","score_opus":0.012152801788875315,"score_gpt":0.23359991260595894,"score_spread":0.22144711081708363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258074816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07982592,0.00019577076,0.9155418,0.00027424408,0.0000780832,0.00006990701,0.00034282636,0.0019545762,0.0017168707],"genre_scores_gemma":[0.6845078,0.00013884957,0.31103396,0.00016722328,0.000051974275,0.00014642392,0.000894751,0.0003720667,0.002686982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974753,0.000617101,0.00022154236,0.00068641035,0.00079192343,0.0002077357],"domain_scores_gemma":[0.99064356,0.0063446327,0.00032826056,0.0019590317,0.0005986823,0.00012570409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014801275,0.00045790043,0.0013353557,0.0014539799,0.0008549755,0.0017007086,0.0018853488,0.0019636585,0.0032715346],"category_scores_gemma":[0.016894769,0.0005397728,0.0011513069,0.0019459983,0.0014913568,0.0042484202,0.0021215566,0.0012303822,0.0007668092],"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.0009832468,0.00027885608,0.0037075013,0.00039286743,0.0002115165,0.0009871289,0.0008253571,0.43156964,0.018909132,0.24328536,0.0042534615,0.29459596],"study_design_scores_gemma":[0.00003224006,0.00005712172,0.00034840556,0.000022657143,0.000038253496,0.00014740156,0.00007876665,0.7704337,0.0075653144,0.21995471,0.0013036041,0.000017718367],"about_ca_topic_score_codex":0.003932812,"about_ca_topic_score_gemma":0.0038984078,"teacher_disagreement_score":0.003932812,"about_ca_system_score_codex":0.0012603716,"about_ca_system_score_gemma":0.002011301,"threshold_uncertainty_score":0.010944307},"labels":[],"label_agreement":null},{"id":"W2309824995","doi":"10.1016/j.ic.2011.10.004","title":"Intuitionistic Modal Logic and Applications (IMLA 2008)","year":2011,"lang":"en","type":"article","venue":"Information and Computation","topic":"Logic, Reasoning, and Knowledge","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":"McGill University","funders":"","keywords":"Normal modal logic; Modal logic; Intuitionistic logic; Computer science; Modal; Multimodal logic; Accessibility relation; Dynamic logic (digital electronics); Mathematics; Programming language; Description logic; Propositional calculus; Engineering; Materials science","score_opus":0.023205470046829255,"score_gpt":0.23611807894244424,"score_spread":0.21291260889561497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2309824995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004840124,0.06713815,0.6584534,0.017767455,0.0032536017,0.00011025408,0.0011515763,0.0017545312,0.24553092],"genre_scores_gemma":[0.24679679,0.042569008,0.5404297,0.008879428,0.0060262326,0.0005389262,0.0023050082,0.0009996052,0.15145534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992275,0.0002401289,0.00005529214,0.00016897127,0.00025116233,0.00005690586],"domain_scores_gemma":[0.999328,0.00030869627,0.00003648533,0.00012358955,0.0001672814,0.000036055524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016494595,0.0008689604,0.00088549516,0.0018392745,0.0015095939,0.005310646,0.0013447873,0.002362154,0.018343465],"category_scores_gemma":[0.002927098,0.0008547548,0.0011728001,0.0029157263,0.0028243593,0.007968442,0.002505157,0.005879806,0.007136998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002134112,0.00003124018,0.00009088085,0.00015209302,0.000017252034,0.000048504142,0.00024100569,0.00051786524,0.0003174096,0.9046459,0.03818995,0.05572645],"study_design_scores_gemma":[0.000005927248,0.000005280795,0.000119736025,0.00008836969,0.000012181911,0.0001182833,0.00004568289,0.001628932,0.00034165784,0.9023666,0.09525419,0.000013233356],"about_ca_topic_score_codex":0.001825524,"about_ca_topic_score_gemma":0.0019037313,"teacher_disagreement_score":0.018343465,"about_ca_system_score_codex":0.0025378691,"about_ca_system_score_gemma":0.0014016811,"threshold_uncertainty_score":0.061365068},"labels":[],"label_agreement":null},{"id":"W2348095904","doi":"","title":"Non-Classification Case Retrieval Based on Rank Correlation","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Rank (graph theory); Correlation; Case-based reasoning; Rank correlation; Set (abstract data type); Computer science; Data mining; Artificial intelligence; Pattern recognition (psychology); Machine learning; Mathematics","score_opus":0.013450460459999003,"score_gpt":0.24655326903728855,"score_spread":0.23310280857728954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2348095904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0949163,0.000845474,0.8931742,0.00027626802,0.00009252037,0.00062263716,0.00029200793,0.0020814862,0.007699076],"genre_scores_gemma":[0.6867769,0.000462132,0.30942574,0.00006939656,0.00009661608,0.0003964067,0.0007680946,0.00010830605,0.0018964331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98700655,0.0040959837,0.0013306306,0.0012873965,0.005705288,0.00057427515],"domain_scores_gemma":[0.97702926,0.012071496,0.0023367014,0.0024418226,0.005709669,0.000411086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050846883,0.0007535585,0.0012315044,0.007921099,0.00087012816,0.0030682173,0.0014471317,0.00062899466,0.0035318546],"category_scores_gemma":[0.03742598,0.00028632293,0.0007446997,0.0066934125,0.00092339475,0.0035536303,0.0013208034,0.0007266073,0.0015483386],"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.0005403657,0.00038231415,0.019423392,0.0005024219,0.00019992008,0.00027714545,0.0006510044,0.020115223,0.013021118,0.023028744,0.005938167,0.9159201],"study_design_scores_gemma":[0.00012062411,0.00059562456,0.018831937,0.00009256,0.00027419106,0.0012614459,0.0006050268,0.911683,0.033029646,0.025972145,0.0073751267,0.00015863878],"about_ca_topic_score_codex":0.0032391853,"about_ca_topic_score_gemma":0.0025075783,"teacher_disagreement_score":0.007921099,"about_ca_system_score_codex":0.0011415809,"about_ca_system_score_gemma":0.002070417,"threshold_uncertainty_score":0.026890755},"labels":[],"label_agreement":null},{"id":"W2432980989","doi":"10.1016/j.ic.2006.08.002","title":"Special Issue: TIME 2005","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Human auditory perception and evaluation","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 Waterloo","funders":"","keywords":"Computer science","score_opus":0.007372972299875939,"score_gpt":0.22424641025266462,"score_spread":0.21687343795278868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2432980989","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.0026034124,0.010079415,0.004089303,0.022523439,0.63183254,0.0004624999,0.0068842885,0.0022505498,0.31927457],"genre_scores_gemma":[0.0065274835,0.004510349,0.00067425123,0.0026753328,0.116738796,0.00014031604,0.00398616,0.0009508643,0.86379635],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891734,0.00010564391,0.00010185792,0.00025411512,0.00043386265,0.00018735378],"domain_scores_gemma":[0.9959781,0.00056546385,0.00026446534,0.0004441341,0.0016482191,0.0010996168],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002055931,0.0029627937,0.0034523504,0.0040929047,0.0022922135,0.009705589,0.0019870487,0.003852083,0.34381706],"category_scores_gemma":[0.004461767,0.0006756877,0.0015256717,0.003409417,0.00089074305,0.0029387553,0.0016899158,0.002340404,0.21710947],"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.00016650424,0.000041163625,0.00012844567,0.00025802432,0.000013580979,0.00007136667,0.000012276603,0.00014237041,0.00031714537,0.0017783595,0.97175467,0.02531611],"study_design_scores_gemma":[0.000034051864,0.0000809026,0.0011643472,0.00012163429,0.000019662408,0.00007218707,0.00002018276,0.00042134503,0.00028485755,0.0011379686,0.9966293,0.000013556642],"about_ca_topic_score_codex":0.0024023673,"about_ca_topic_score_gemma":0.0060037067,"teacher_disagreement_score":0.34381706,"about_ca_system_score_codex":0.002597978,"about_ca_system_score_gemma":0.002127538,"threshold_uncertainty_score":0.9359653},"labels":[],"label_agreement":null},{"id":"W2520045024","doi":"10.1016/j.ic.2010.05.003","title":"19th International Conference on Concurrency Theory","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"Distributed and Parallel Computing 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":"University of Toronto; York University","funders":"","keywords":"Concurrency; Computer science; Programming language","score_opus":0.017340031835381055,"score_gpt":0.2734475153341772,"score_spread":0.25610748349879614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520045024","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.007439002,0.036202148,0.7470508,0.015322902,0.046200804,0.0002903345,0.0009097903,0.0022408934,0.14434335],"genre_scores_gemma":[0.23955159,0.031356413,0.34762043,0.0047159754,0.016976593,0.0008732492,0.0035274401,0.0024303673,0.35294798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99667054,0.00094908825,0.00030418375,0.00062228896,0.001052368,0.0004016371],"domain_scores_gemma":[0.99450654,0.0017133367,0.00015300862,0.0019406133,0.0011280335,0.0005583649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050845337,0.0011508222,0.0027345677,0.002288671,0.0022423838,0.007977169,0.0029891643,0.0019026806,0.05672544],"category_scores_gemma":[0.009526898,0.0010094927,0.001939242,0.0027131618,0.0034449627,0.005746502,0.0044496995,0.005015655,0.010011093],"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.00029017217,0.00015163064,0.0008348582,0.00033898014,0.00012485696,0.00015813066,0.00029324117,0.0046108416,0.0022869466,0.64641416,0.11920017,0.22529596],"study_design_scores_gemma":[0.00007505166,0.00007423638,0.00048637282,0.00026332372,0.00011269372,0.0002529392,0.0001379594,0.02734697,0.0021248471,0.4529501,0.5161287,0.00004685183],"about_ca_topic_score_codex":0.004859222,"about_ca_topic_score_gemma":0.0046915985,"teacher_disagreement_score":0.05672544,"about_ca_system_score_codex":0.0029905944,"about_ca_system_score_gemma":0.004853754,"threshold_uncertainty_score":0.18976551},"labels":[],"label_agreement":null},{"id":"W2560396680","doi":"10.1016/j.ic.2016.12.002","title":"Constructing self-stabilizing oscillators in population protocols","year":2016,"lang":"en","type":"article","venue":"Information and Computation","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Engineering and Physical Sciences Research Council; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Computer science; Self-stabilization; Population; Distributed computing; Sociology; Demography","score_opus":0.012148811611680278,"score_gpt":0.2649389643486553,"score_spread":0.252790152736975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560396680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10628767,0.00013910365,0.8855791,0.00044360562,0.00009225097,0.00007201807,0.000025053527,0.0003690405,0.0069922097],"genre_scores_gemma":[0.8761548,0.0002034158,0.118818924,0.00015362071,0.00004421724,0.00019570424,0.000044659428,0.00014035053,0.004244319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960726,0.0001833836,0.000022680739,0.00006222217,0.000080791455,0.000043770706],"domain_scores_gemma":[0.99832994,0.0010302677,0.000112826056,0.00026008152,0.00014955779,0.00011734851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010111015,0.0003181327,0.0004977754,0.00043681797,0.000739734,0.00087583356,0.001330764,0.0011312374,0.002131578],"category_scores_gemma":[0.0057247537,0.00045199756,0.00040453102,0.00036063007,0.0014953278,0.0014049856,0.0022696243,0.0012836136,0.00040243767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014635384,0.00011156332,0.0012132227,0.000100761485,0.00004358537,0.0001722287,0.00055280677,0.39330834,0.015345849,0.5323138,0.0016704737,0.055021003],"study_design_scores_gemma":[0.000048234004,0.00004715951,0.000083694365,0.000012891722,0.00001567997,0.000035166395,0.00007034598,0.79421675,0.0034803997,0.20044103,0.0015350614,0.000013535788],"about_ca_topic_score_codex":0.00039601096,"about_ca_topic_score_gemma":0.00065464986,"teacher_disagreement_score":0.002131578,"about_ca_system_score_codex":0.0005091871,"about_ca_system_score_gemma":0.00054873625,"threshold_uncertainty_score":0.0071308613},"labels":[],"label_agreement":null},{"id":"W2568552169","doi":"10.1016/j.ic.2012.10.008","title":"Generic expression hardness results for primitive positive formula comparison","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","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; Ministerio de Ciencia e Innovación","keywords":"Trichotomy (philosophy); Equivalence (formal languages); Mathematics; Expression (computer science); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.02384311133039244,"score_gpt":0.2827658495853759,"score_spread":0.2589227382549834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568552169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16087373,0.0019556151,0.7168034,0.009911763,0.0006638365,0.0003895692,0.0020740826,0.002654932,0.10467303],"genre_scores_gemma":[0.8577325,0.0012498231,0.108734146,0.0022865478,0.0011077182,0.0005233453,0.002379927,0.0011021985,0.024883887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992156,0.0013715385,0.00048495378,0.0022657998,0.002726665,0.0009950137],"domain_scores_gemma":[0.9752435,0.017948594,0.0007690315,0.004292362,0.0010851395,0.00066133455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037627583,0.0016111617,0.003162228,0.002110254,0.003543448,0.0061817537,0.0071316184,0.0035891642,0.021810409],"category_scores_gemma":[0.019691568,0.0013923721,0.004621562,0.0044456185,0.00725595,0.02938908,0.008487346,0.012290577,0.001847892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036719485,0.00016308071,0.00069279526,0.0004357664,0.00008886913,0.00023447369,0.00054023066,0.0077952114,0.0020041058,0.956744,0.007204612,0.02372961],"study_design_scores_gemma":[0.00004156823,0.000029172887,0.00023535098,0.00002389502,0.000069180656,0.00014058877,0.00005671266,0.013000552,0.0012475852,0.9820701,0.0030607379,0.000024571915],"about_ca_topic_score_codex":0.0013537317,"about_ca_topic_score_gemma":0.0015582955,"teacher_disagreement_score":0.021810409,"about_ca_system_score_codex":0.004001747,"about_ca_system_score_gemma":0.0021335313,"threshold_uncertainty_score":0.07296312},"labels":[],"label_agreement":null},{"id":"W2573386179","doi":"10.1016/j.ic.2017.01.009","title":"Further remarks on DNA overlap assembly","year":2017,"lang":"en","type":"article","venue":"Information and Computation","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Western University; National Science Foundation","keywords":"Iterated function; Decidability; String (physics); Completeness (order theory); Computer science; Closure (psychology); Formal language; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.012628625070501309,"score_gpt":0.2728790361605946,"score_spread":0.2602504110900933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573386179","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.01662364,0.0054496536,0.3481313,0.13746946,0.02028858,0.00022625527,0.0012122665,0.0015734521,0.46902543],"genre_scores_gemma":[0.42302668,0.0060069812,0.13995767,0.03855525,0.015224116,0.00095021323,0.0013175544,0.0018710603,0.37309045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984415,0.00033865758,0.0000689961,0.0002692816,0.00062118884,0.00026028926],"domain_scores_gemma":[0.9985097,0.0006727677,0.000066985376,0.00033547689,0.00028229773,0.00013264635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014548142,0.0011617866,0.0013395847,0.0013742901,0.003599758,0.0027718933,0.0030929246,0.0030402578,0.043427043],"category_scores_gemma":[0.0046063396,0.00037764528,0.0012576687,0.00091500586,0.004181628,0.010119038,0.0036261498,0.003938416,0.0072489665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040133164,0.00001789315,0.000062376916,0.00010731325,0.0000064998676,0.00020245735,0.00018895157,0.00057207997,0.0008020175,0.96489376,0.02594821,0.00715825],"study_design_scores_gemma":[0.00001674093,0.000015548452,0.00014692907,0.00004077642,0.0000058514142,0.00016635246,0.00017766724,0.002590958,0.001478573,0.9012227,0.09411538,0.000022534474],"about_ca_topic_score_codex":0.0027698562,"about_ca_topic_score_gemma":0.0014356874,"teacher_disagreement_score":0.043427043,"about_ca_system_score_codex":0.0013371342,"about_ca_system_score_gemma":0.0005832813,"threshold_uncertainty_score":0.14527798},"labels":[],"label_agreement":null},{"id":"W2581306138","doi":"10.1016/j.ic.2018.03.001","title":"Incorporating quotation and evaluation into Church's type theory","year":2018,"lang":"en","type":"article","venue":"Information and Computation","topic":"Logic, programming, and type systems","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","keywords":"Lisp; Syntax; Semantics (computer science); Type (biology); Programming language; Computer science; Discrete mathematics; Mathematics; Algebra over a field; Arithmetic; Algorithm; Artificial intelligence; Pure mathematics","score_opus":0.024472175461943763,"score_gpt":0.288568371789825,"score_spread":0.2640961963278812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581306138","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.0046941633,0.0010077019,0.93089145,0.0070850966,0.0012111091,0.000074852585,0.00019400108,0.0005882791,0.054253377],"genre_scores_gemma":[0.4272386,0.0017133747,0.5325659,0.0023948236,0.0023857942,0.00032882724,0.0003273482,0.0016311619,0.03141414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9855057,0.008564123,0.00089278945,0.0014910101,0.0027922415,0.0007541386],"domain_scores_gemma":[0.97154003,0.016174374,0.0008985335,0.005987465,0.0048077195,0.00059191446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017475465,0.00093100907,0.0020968386,0.004625685,0.0045590797,0.010834923,0.0038022103,0.0027804372,0.015389051],"category_scores_gemma":[0.04708398,0.0016555318,0.0022175268,0.0059110215,0.0149280215,0.039818224,0.0073828623,0.005568998,0.0030887357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009464743,0.0000051998604,0.000060602233,0.000032576892,0.0000047550293,0.000011635184,0.0003189193,0.00031523535,0.000060721584,0.99162674,0.00086954853,0.006684721],"study_design_scores_gemma":[0.00000563801,0.000004209057,0.00002957576,0.000029524048,0.000008118695,0.000015152046,0.00007614552,0.0021759395,0.0001769989,0.9898666,0.0075981114,0.0000138753185],"about_ca_topic_score_codex":0.005383743,"about_ca_topic_score_gemma":0.006395446,"teacher_disagreement_score":0.017475465,"about_ca_system_score_codex":0.0049161357,"about_ca_system_score_gemma":0.0035355522,"threshold_uncertainty_score":0.09242022},"labels":[],"label_agreement":null},{"id":"W2600505170","doi":"10.1016/j.ic.2018.07.003","title":"Non computable Mandelbrot-like sets for a one-parameter complex family","year":2018,"lang":"en","type":"article","venue":"Information and Computation","topic":"Computability, Logic, AI 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 Toronto","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Universidad Andrés Bello; Natural Sciences and Engineering Research Council of Canada; Universidad de Chile","keywords":"Mandelbrot set; Computable number; Mathematics; Turing; Julia set; Bifurcation; Combinatorics; Discrete mathematics; Pure mathematics; Computable function; Computer science; Computable analysis; Mathematical analysis; Fractal; Nonlinear system; Physics","score_opus":0.0496507009125985,"score_gpt":0.29658564745839183,"score_spread":0.24693494654579334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600505170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5348224,0.0010886427,0.39540595,0.0026174723,0.00019513535,0.00009947376,0.0004916022,0.0006679461,0.06461132],"genre_scores_gemma":[0.9359712,0.00028363813,0.053629342,0.00030826143,0.00011589818,0.00016513474,0.00033458415,0.00013839669,0.00905354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983546,0.00035054813,0.00012665887,0.00048418748,0.00046248222,0.00022146461],"domain_scores_gemma":[0.99568754,0.002435198,0.00042080221,0.0006889835,0.00034408705,0.00042343474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020139883,0.0007726527,0.001436138,0.0026094425,0.00395788,0.0046714637,0.001785999,0.0025947022,0.0067796204],"category_scores_gemma":[0.007656051,0.0007488735,0.001736788,0.0014184451,0.0050525526,0.008946593,0.003540708,0.0030402,0.0005803995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023760353,0.000007923839,0.00013390288,0.000022396696,0.000005859015,0.000050167724,0.00010659645,0.00069024554,0.00036461026,0.9973469,0.00018137683,0.0010661841],"study_design_scores_gemma":[0.000013233309,0.000011179659,0.0001839545,0.000017229442,0.000009209486,0.00011686382,0.00005452188,0.00986453,0.0006887641,0.9877828,0.0012393848,0.000018420544],"about_ca_topic_score_codex":0.00068943866,"about_ca_topic_score_gemma":0.0007434449,"teacher_disagreement_score":0.0067796204,"about_ca_system_score_codex":0.0029606647,"about_ca_system_score_gemma":0.00080894685,"threshold_uncertainty_score":0.022680044},"labels":[],"label_agreement":null},{"id":"W2676854164","doi":"10.1016/j.ic.2010.11.009","title":"Decision problems for convex languages","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","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 Waterloo","funders":"","keywords":"Prefix; Suffix; Regular language; Mathematics; Computer science; Combinatorics; Abstract family of languages; Time complexity; Discrete mathematics; Linguistics; Automaton; Artificial intelligence; Programming language","score_opus":0.006772956264340065,"score_gpt":0.2565013127934235,"score_spread":0.2497283565290834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2676854164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12920013,0.0032089828,0.7877523,0.015085619,0.00040694722,0.00040699184,0.0017367691,0.0004716728,0.061730668],"genre_scores_gemma":[0.78841615,0.002780691,0.15001094,0.0015918917,0.001089582,0.0009148442,0.0024890215,0.00042593773,0.05228095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99522567,0.0021729486,0.00027122677,0.0009957224,0.00074663345,0.00058777555],"domain_scores_gemma":[0.96127856,0.033909533,0.0010492245,0.0011404968,0.0012794714,0.0013427986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050142007,0.0014122354,0.003041721,0.0013915363,0.00215059,0.007819025,0.002777567,0.0032175973,0.016063403],"category_scores_gemma":[0.025506904,0.0015036953,0.0024778023,0.0024966695,0.005716682,0.013622303,0.0035789062,0.007820068,0.0012096456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012013301,0.00008897795,0.00017718259,0.00014474565,0.000038529895,0.00007359618,0.000232194,0.017325785,0.0002655963,0.96766484,0.004802042,0.009066434],"study_design_scores_gemma":[0.000030067886,0.000014162528,0.000039642782,0.000015167102,0.000010369722,0.000021924601,0.00005104847,0.039030004,0.00015701004,0.95962596,0.0009951184,0.000009415115],"about_ca_topic_score_codex":0.0037617306,"about_ca_topic_score_gemma":0.0031431452,"teacher_disagreement_score":0.016063403,"about_ca_system_score_codex":0.005540713,"about_ca_system_score_gemma":0.0034009363,"threshold_uncertainty_score":0.053737402},"labels":[],"label_agreement":null},{"id":"W2753140668","doi":"10.1016/j.ic.2017.08.003","title":"Distinguishing pattern languages with membership examples","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","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; Canada Research Chairs","keywords":"Computer science; Artificial intelligence; Linguistics; Natural language processing; Programming language; Philosophy","score_opus":0.016559403679376257,"score_gpt":0.2783609530920439,"score_spread":0.26180154941266764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753140668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1983896,0.00021437445,0.7867647,0.0019494824,0.00009381059,0.00013758735,0.0004385597,0.0014764734,0.010535355],"genre_scores_gemma":[0.85702413,0.00015059956,0.13599859,0.00039924722,0.00013653812,0.00014202905,0.0009517976,0.00027581907,0.0049213152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995514,0.001410683,0.0004260981,0.0010655515,0.0011541203,0.00042968127],"domain_scores_gemma":[0.97631663,0.015836181,0.0010953017,0.004360332,0.0015858406,0.0008056355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030615155,0.00050224835,0.0008519807,0.0018278403,0.0011682131,0.0040808385,0.0021108566,0.0019232781,0.0059484127],"category_scores_gemma":[0.031361956,0.0006435154,0.001219561,0.0016511603,0.0029129789,0.015734917,0.0056054546,0.0037542935,0.0011564366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007852305,0.0002705036,0.009126002,0.00036404058,0.00006782496,0.00064740423,0.0018732575,0.008499128,0.008400723,0.7834919,0.0051998394,0.18127419],"study_design_scores_gemma":[0.000027412152,0.00005270695,0.0005557378,0.000038755556,0.000026049813,0.00042854616,0.0003164197,0.06094267,0.0056420066,0.9286122,0.003335074,0.00002242204],"about_ca_topic_score_codex":0.00040151642,"about_ca_topic_score_gemma":0.00051067956,"teacher_disagreement_score":0.0059484127,"about_ca_system_score_codex":0.00069126906,"about_ca_system_score_gemma":0.0008821565,"threshold_uncertainty_score":0.019899487},"labels":[],"label_agreement":null},{"id":"W2756098802","doi":"10.1016/j.ic.2017.09.004","title":"Transducer descriptions of DNA code properties and undecidability of antimorphic problems","year":2017,"lang":"en","type":"article","venue":"Information and Computation","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":"Saint Mary's University; University of Waterloo; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Western University","keywords":"Undecidable problem; Decidability; Property (philosophy); Permutation (music); Discrete mathematics; Involution (esoterism); Mathematics; Regular language; Computer science; Automaton; Theoretical computer science","score_opus":0.05689885418023543,"score_gpt":0.2635822840208109,"score_spread":0.20668342984057547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756098802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15583931,0.00043048896,0.80773336,0.003359541,0.00025178012,0.00013717577,0.00093904044,0.0015027489,0.02980659],"genre_scores_gemma":[0.91899455,0.00033800997,0.068422586,0.00091330096,0.0002779774,0.00039956087,0.0010896766,0.0005666438,0.0089976685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963797,0.0009801022,0.00035338514,0.0006008476,0.0011753725,0.00051055965],"domain_scores_gemma":[0.97303605,0.021281123,0.0008245736,0.0020837842,0.0022160814,0.0005583496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002703366,0.00068638794,0.0009898396,0.0019788162,0.0013613974,0.0042043794,0.002460012,0.0023783827,0.0070560244],"category_scores_gemma":[0.01678852,0.0009323708,0.002140187,0.0013690875,0.004086292,0.008646728,0.003017753,0.0054287636,0.00075751456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005740555,0.000040173953,0.00024916127,0.00005913129,0.00001179084,0.000103694154,0.0002737976,0.0054137274,0.0016811955,0.9870384,0.00079541735,0.0042761606],"study_design_scores_gemma":[0.000017844563,0.0000142085655,0.000063610576,0.000010165353,0.000011562857,0.000049560334,0.000051532432,0.043658346,0.001701728,0.9538077,0.00060031726,0.000013506494],"about_ca_topic_score_codex":0.0013782372,"about_ca_topic_score_gemma":0.001454058,"teacher_disagreement_score":0.0070560244,"about_ca_system_score_codex":0.0019352067,"about_ca_system_score_gemma":0.0016861663,"threshold_uncertainty_score":0.02360475},"labels":[],"label_agreement":null},{"id":"W2767753763","doi":"10.1016/j.ic.2017.11.001","title":"Handling infinitely branching well-structured transition systems","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","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é de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Branching (polymer chemistry); Transition (genetics); Computer science; Theoretical computer science; Statistical physics; Biological system; Chemistry; Physics; Biology","score_opus":0.0246912400431496,"score_gpt":0.2898175308023667,"score_spread":0.2651262907592171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767753763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048555885,0.00016360066,0.94716066,0.00034846712,0.00006173538,0.000048999893,0.000085222615,0.0011742308,0.0024011463],"genre_scores_gemma":[0.7492532,0.0002811322,0.24497858,0.00018095416,0.000096124924,0.0001227596,0.0003365681,0.000413275,0.0043374817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949202,0.0013720478,0.0005182018,0.0008533375,0.0015816108,0.0007546418],"domain_scores_gemma":[0.97023624,0.023252334,0.0013132446,0.0028533186,0.0016670806,0.00067789323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054234215,0.0007975237,0.0011010976,0.0013358747,0.0018259916,0.0044673556,0.0026726325,0.0022333653,0.003952887],"category_scores_gemma":[0.021467932,0.0011350731,0.0018805653,0.0013271398,0.0052578314,0.011784377,0.006096507,0.004820574,0.00048417455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021706315,0.000070311595,0.0013921225,0.00027691433,0.000056370423,0.0011769234,0.0013918782,0.092409655,0.009243797,0.8687634,0.0007308917,0.024270631],"study_design_scores_gemma":[0.00003178613,0.000021054879,0.00008057624,0.00003348526,0.00003964258,0.00010946607,0.000113578266,0.15303573,0.0064069363,0.8385032,0.0016010851,0.000023534469],"about_ca_topic_score_codex":0.0021660721,"about_ca_topic_score_gemma":0.002553871,"teacher_disagreement_score":0.0054234215,"about_ca_system_score_codex":0.0017791044,"about_ca_system_score_gemma":0.0021873333,"threshold_uncertainty_score":0.028682172},"labels":[],"label_agreement":null},{"id":"W2912608078","doi":"10.1016/s0890-5401(03)00090-7","title":"Follow automata","year":2003,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","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":"Nondeterministic finite automaton; Regular expression; Automaton; Nondeterministic algorithm; Quotient; Combinatorics; Computer science; Mathematics; Discrete mathematics; Equivalence relation; Deterministic automaton; Equivalence (formal languages); Theoretical computer science; Automata theory; Programming language","score_opus":0.009556904921695659,"score_gpt":0.22470565894381395,"score_spread":0.21514875402211828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912608078","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.017733505,0.0011569883,0.2367877,0.0053742747,0.0021398664,0.00042258803,0.0069146776,0.0070628687,0.7224075],"genre_scores_gemma":[0.22674902,0.0015867553,0.04239464,0.0017977996,0.000626042,0.0005152268,0.0052045095,0.0020225737,0.71910346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995073,0.00006999625,0.00003060985,0.0001883804,0.00013487498,0.00006885673],"domain_scores_gemma":[0.9984389,0.00037864942,0.000059439248,0.0005903817,0.00043987628,0.00009277158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038490767,0.00081172516,0.0006378587,0.0011477005,0.0020146451,0.0041275183,0.0009579354,0.0012218748,0.11928343],"category_scores_gemma":[0.0028307538,0.00047547385,0.0009156168,0.0010902747,0.0012680467,0.0067997985,0.0019568764,0.0021569785,0.07109369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058549274,0.000042381922,0.0002563539,0.00008137426,0.000010998565,0.00012077448,0.00032352813,0.00034926762,0.0015194993,0.88835025,0.056923445,0.05196361],"study_design_scores_gemma":[0.000024326146,0.000023713257,0.00021868304,0.00002955562,0.000018589759,0.00019500422,0.00015541163,0.0018120188,0.003065414,0.6641359,0.33030298,0.000018382627],"about_ca_topic_score_codex":0.0015355598,"about_ca_topic_score_gemma":0.0017573518,"teacher_disagreement_score":0.11928343,"about_ca_system_score_codex":0.0011108138,"about_ca_system_score_gemma":0.000933457,"threshold_uncertainty_score":0.39904284},"labels":[],"label_agreement":null},{"id":"W2922460544","doi":"10.1016/j.ic.2019.03.003","title":"On store languages and applications","year":2019,"lang":"en","type":"article","venue":"Information and Computation","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":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Nondeterministic algorithm; Pushdown automaton; Bounded function; Reachability; Set (abstract data type); Successor cardinal; Finite-state machine; Automaton; Theoretical computer science; Deterministic pushdown automaton; Decidability; Programming language; Algorithm; Nondeterministic finite automaton; Mathematics; Automata theory","score_opus":0.003813228071605732,"score_gpt":0.23946662207938194,"score_spread":0.2356533940077762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922460544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049323104,0.032183703,0.60254216,0.02174392,0.0028062568,0.0001446103,0.000937379,0.0014633103,0.2888556],"genre_scores_gemma":[0.6396429,0.024846187,0.10229879,0.005002037,0.004700315,0.00055094104,0.001151088,0.0012563019,0.22055155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873334,0.00038520404,0.00009479191,0.00029044412,0.0003516379,0.00014461472],"domain_scores_gemma":[0.9969944,0.0017229464,0.000084014595,0.0006464433,0.00040977573,0.0001424184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012759416,0.0009566552,0.0014023809,0.0029798185,0.002793837,0.0059577045,0.0017399424,0.0024030746,0.021811917],"category_scores_gemma":[0.0059286435,0.00081376237,0.0013385452,0.005440186,0.005366991,0.015383308,0.0044773445,0.0036405933,0.004274377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000132397845,0.00001102413,0.000048215385,0.0000421216,0.000004507571,0.000032086777,0.0002295102,0.00043698793,0.00016275843,0.98531586,0.0036802446,0.010023461],"study_design_scores_gemma":[0.0000039556553,0.0000053420013,0.000028194123,0.000026968473,0.0000059678737,0.000057848272,0.00008081239,0.002032692,0.0001915477,0.9797269,0.017834352,0.0000054610746],"about_ca_topic_score_codex":0.0021491314,"about_ca_topic_score_gemma":0.0016237267,"teacher_disagreement_score":0.021811917,"about_ca_system_score_codex":0.0017328588,"about_ca_system_score_gemma":0.0012045295,"threshold_uncertainty_score":0.072968185},"labels":[],"label_agreement":null},{"id":"W2944100452","doi":"10.1016/j.ic.2019.04.002","title":"Expressiveness of probabilistic modal logics: A gradual approach","year":2019,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki; Agence Nationale de la Recherche; Alan Turing Institute","keywords":"Bisimulation; Mathematical proof; Probabilistic logic; Characterization (materials science); Computer science; Modal; Theoretical computer science; Modal logic; Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.022157233803333017,"score_gpt":0.26529203065534646,"score_spread":0.24313479685201345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944100452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011350028,0.00056334905,0.9722181,0.0017779024,0.000061355444,0.000071821865,0.0001599514,0.00024328324,0.013554151],"genre_scores_gemma":[0.59819216,0.001577766,0.39048955,0.00063349074,0.00042407308,0.0003817096,0.0003841275,0.00031224964,0.0076048174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924821,0.0024812238,0.00059399573,0.0014889551,0.0024387885,0.0005147841],"domain_scores_gemma":[0.9743817,0.017230904,0.0011639725,0.0050835162,0.0014716546,0.000668171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009711919,0.0012097296,0.0013548732,0.00261793,0.0020447264,0.0064449687,0.0066882116,0.00279223,0.004973465],"category_scores_gemma":[0.02703765,0.0024169325,0.004455931,0.0017998487,0.01076132,0.021112002,0.010416981,0.009784448,0.0006342364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014831725,0.000012798177,0.00006762279,0.00005504997,0.000015294261,0.00006459705,0.00023180815,0.0034496603,0.00066080067,0.9928341,0.0001344641,0.0024589507],"study_design_scores_gemma":[0.000012868284,0.000016362972,0.000049029946,0.000023253324,0.000024480898,0.000069297916,0.00005308433,0.015925659,0.00073924504,0.9809625,0.0021077995,0.00001628004],"about_ca_topic_score_codex":0.0012924598,"about_ca_topic_score_gemma":0.00141056,"teacher_disagreement_score":0.009711919,"about_ca_system_score_codex":0.0025559184,"about_ca_system_score_gemma":0.0013614849,"threshold_uncertainty_score":0.051362157},"labels":[],"label_agreement":null},{"id":"W2949687231","doi":"10.1016/j.ic.2017.07.009","title":"Deletion operations on deterministic families of automata","year":2017,"lang":"en","type":"article","venue":"Information and Computation","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":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Bounded function; Deterministic pushdown automaton; Quotient; Computer science; Regular language; Discrete mathematics; Mathematics; Automaton; Nondeterministic finite automaton; Combinatorics; Theoretical computer science; Automata theory","score_opus":0.015235780528646823,"score_gpt":0.27170826713596813,"score_spread":0.2564724866073213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949687231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22566898,0.0013001377,0.7447724,0.0012881899,0.00025260955,0.00007881065,0.00071694946,0.0009928957,0.02492911],"genre_scores_gemma":[0.88168114,0.0008097375,0.09866607,0.0003356291,0.00023112987,0.00026576538,0.00080264994,0.0003797428,0.016828217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623615,0.0010648256,0.00044408417,0.001004756,0.00083987263,0.00041039454],"domain_scores_gemma":[0.97898453,0.015217971,0.001123308,0.0024083955,0.0015078139,0.0007580449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026870626,0.0008536218,0.0011109965,0.0021878944,0.0029925273,0.0039555556,0.0019072235,0.001623283,0.0062717837],"category_scores_gemma":[0.010208678,0.0010963634,0.0018336897,0.0019738465,0.004496879,0.011534764,0.0032569151,0.0021733174,0.0011531804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010177259,0.000024421668,0.00039717043,0.00006493883,0.000013206906,0.00024072677,0.0006272958,0.0026387756,0.0022913283,0.98289907,0.00086783676,0.009833565],"study_design_scores_gemma":[0.000024392304,0.00003108594,0.00017448886,0.000022683587,0.000026780892,0.00041317998,0.00018831475,0.013217976,0.0029608982,0.9779449,0.0049633402,0.00003200952],"about_ca_topic_score_codex":0.0006503787,"about_ca_topic_score_gemma":0.0005962268,"teacher_disagreement_score":0.0062717837,"about_ca_system_score_codex":0.0015535968,"about_ca_system_score_gemma":0.0010285842,"threshold_uncertainty_score":0.020981193},"labels":[],"label_agreement":null},{"id":"W2963114728","doi":"10.1016/j.ic.2016.09.005","title":"Mutual visibility by luminous robots without collisions","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","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":"Carleton University; University of Ottawa","funders":"","keywords":"Visibility; Robot; Computer science; Convergence (economics); Computer vision; Plane (geometry); Artificial intelligence; Point (geometry); Topology (electrical circuits); Mathematics; Physics; Geometry; Optics; Combinatorics; Economics","score_opus":0.012703689453455598,"score_gpt":0.2644667625921533,"score_spread":0.25176307313869767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963114728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2665323,0.0006249535,0.71692944,0.00097467285,0.000098583245,0.000053667365,0.00010689144,0.00022725461,0.0144521445],"genre_scores_gemma":[0.96448344,0.00015764115,0.02931669,0.00010223782,0.000057738318,0.000056786706,0.0000680181,0.00008938473,0.0056681125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828255,0.0005999012,0.00006342747,0.0003503953,0.00035188164,0.00035190428],"domain_scores_gemma":[0.9903674,0.0067333635,0.0012338803,0.0006685582,0.00039050242,0.00060628017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017387037,0.0008715608,0.002027507,0.0010073723,0.0016001839,0.0027648387,0.0021068198,0.002858772,0.0031521672],"category_scores_gemma":[0.01678981,0.001451728,0.0011088232,0.0012412972,0.0031381247,0.0048764125,0.0068169236,0.001860683,0.000416534],"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.0015801153,0.00016155308,0.0032879114,0.00029657708,0.00022875372,0.0006985832,0.0012277665,0.5632069,0.00536092,0.38608593,0.0026894382,0.035175495],"study_design_scores_gemma":[0.00007925597,0.00010534715,0.00070291106,0.000026447911,0.00003830157,0.0001697622,0.00017206285,0.7393546,0.0014744112,0.25672716,0.001112565,0.00003708232],"about_ca_topic_score_codex":0.0024256965,"about_ca_topic_score_gemma":0.001434801,"teacher_disagreement_score":0.0031521672,"about_ca_system_score_codex":0.0010184491,"about_ca_system_score_gemma":0.00091498275,"threshold_uncertainty_score":0.010545015},"labels":[],"label_agreement":null},{"id":"W2967773100","doi":"10.1016/j.ic.2019.104437","title":"Constraint Satisfaction Problems over semilattice block Mal'tsev algebras","year":2019,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semilattice; Constraint satisfaction problem; Mathematics; Conjecture; Mathematical proof; Block (permutation group theory); Class (philosophy); Quotient; Universal algebra; Algebraic structure; Algebra over a field; Discrete mathematics; Combinatorics; Computer science; Pure mathematics; Artificial intelligence","score_opus":0.011934858479193766,"score_gpt":0.26601027037520286,"score_spread":0.2540754118960091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967773100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2380049,0.001202015,0.7171957,0.0031262469,0.00019446298,0.00021854391,0.0016455117,0.00046707923,0.037945542],"genre_scores_gemma":[0.83007,0.00092903373,0.14692199,0.00039811296,0.00027619486,0.0002716658,0.0020323743,0.00023075799,0.018869827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775225,0.0008578506,0.0001744156,0.00027463667,0.00065143034,0.00028941402],"domain_scores_gemma":[0.99416167,0.004131043,0.00038438707,0.00034615098,0.00061786285,0.00035893725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002311666,0.0005954159,0.0013905077,0.0010985459,0.0017230797,0.0042337477,0.0018370452,0.0013489845,0.00915926],"category_scores_gemma":[0.0075022327,0.0007399057,0.0013436441,0.0031259048,0.0020511847,0.006930954,0.0019593514,0.002508665,0.00075886736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014619819,0.000060912396,0.00032929122,0.00015960516,0.000036990397,0.00009913286,0.00023128306,0.027029805,0.0012380412,0.95579505,0.0023337218,0.012539848],"study_design_scores_gemma":[0.000035583227,0.000016583885,0.000087727916,0.000013280867,0.000010380207,0.00004102187,0.00014420185,0.060185775,0.00076450285,0.9368785,0.001809045,0.00001351485],"about_ca_topic_score_codex":0.0053676656,"about_ca_topic_score_gemma":0.006038168,"teacher_disagreement_score":0.00915926,"about_ca_system_score_codex":0.0022914067,"about_ca_system_score_gemma":0.0020230734,"threshold_uncertainty_score":0.03064078},"labels":[],"label_agreement":null},{"id":"W2995334287","doi":"10.1016/j.ic.2021.104689","title":"Maximal state complexity and generalized de Bruijn words","year":2021,"lang":"en","type":"preprint","venue":"Information and Computation","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":"De Bruijn sequence; Generalization; Word (group theory); State (computer science); Mathematics; Word length; Combinatorics; Computer science; Discrete mathematics; Algorithm; Natural language processing","score_opus":0.024555745477797198,"score_gpt":0.2641879211985905,"score_spread":0.23963217572079332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995334287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6742356,0.0023255001,0.22876401,0.0051817787,0.00023728854,0.00009438174,0.0013347158,0.00036264624,0.08746408],"genre_scores_gemma":[0.9788047,0.0004775754,0.011886727,0.0001651135,0.0002513096,0.00008123417,0.00041193608,0.00007396709,0.007847428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771047,0.00065499643,0.00014701099,0.0005360383,0.0005955734,0.00035596755],"domain_scores_gemma":[0.98460096,0.012321145,0.0007428019,0.0010760317,0.0007024241,0.00055657484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001612331,0.00061757164,0.0013764467,0.0019689072,0.001964406,0.007002456,0.0013832848,0.0016735721,0.009071774],"category_scores_gemma":[0.009597116,0.0007087607,0.0010646482,0.0025861643,0.0044379365,0.011096188,0.0021505952,0.0028867468,0.0005810457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048006914,0.000021569762,0.0002684711,0.00004050066,0.000008545284,0.000047102894,0.00021741475,0.0030794975,0.000501828,0.9925632,0.00055646495,0.0026474039],"study_design_scores_gemma":[0.0000057623906,0.0000035367375,0.00010235554,0.000004943196,0.000004555063,0.000023266193,0.000025299521,0.00682328,0.00028060065,0.9922874,0.00043233577,0.000006676533],"about_ca_topic_score_codex":0.0012359729,"about_ca_topic_score_gemma":0.0010949444,"teacher_disagreement_score":0.009071774,"about_ca_system_score_codex":0.0025952638,"about_ca_system_score_gemma":0.0010818265,"threshold_uncertainty_score":0.030348063},"labels":[],"label_agreement":null},{"id":"W3119265231","doi":"10.1016/j.ic.2021.104686","title":"Descriptional Complexity of Formal Systems (DCFS 2019)","year":2021,"lang":"en","type":"article","venue":"Information and Computation","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":"Saint Mary's University","funders":"","keywords":"Modulo; Alphabet; Congruence (geometry); Computer science; Arithmetic; Mathematics; Combinatorics; Discrete mathematics; Linguistics; Philosophy","score_opus":0.02873548115125589,"score_gpt":0.24258239689671604,"score_spread":0.21384691574546016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119265231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10263013,0.019148689,0.6246566,0.039151613,0.0032444943,0.00028612022,0.0075554,0.0015860264,0.2017409],"genre_scores_gemma":[0.85521144,0.0063850465,0.09107051,0.0018895972,0.0026674161,0.00046072557,0.0048436765,0.0006183608,0.036853246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755377,0.0004926322,0.00017514439,0.0005588119,0.0010103212,0.00020928642],"domain_scores_gemma":[0.99311525,0.0043341094,0.0003119046,0.0011534975,0.0008119135,0.00027331652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019785657,0.0006406234,0.0008569827,0.002314289,0.001552813,0.005495398,0.0012463067,0.0016571278,0.012513871],"category_scores_gemma":[0.010563141,0.0007098426,0.0015485332,0.0035085732,0.00345429,0.009424535,0.0037824644,0.005261012,0.0021067797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002344699,0.0000117177,0.00019325587,0.00008508471,0.000010186952,0.000020470516,0.00016554346,0.0022372666,0.00026760902,0.9714488,0.006911377,0.018625269],"study_design_scores_gemma":[0.0000062458416,0.0000057798097,0.00015761884,0.000029644018,0.0000060763045,0.000047494363,0.000031446663,0.0061270525,0.00034588244,0.97466904,0.018559415,0.000014279868],"about_ca_topic_score_codex":0.004336074,"about_ca_topic_score_gemma":0.0019868598,"teacher_disagreement_score":0.012513871,"about_ca_system_score_codex":0.005327865,"about_ca_system_score_gemma":0.0022147368,"threshold_uncertainty_score":0.041863084},"labels":[],"label_agreement":null},{"id":"W3120287019","doi":"10.1016/j.ic.2021.104690","title":"Structural properties of NFAs and growth rates of nondeterminism measures","year":2021,"lang":"en","type":"article","venue":"Information and Computation","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":"Mathematics; String (physics); Computation; Nondeterministic algorithm; Combinatorics; Bounded function; Polynomial; Discrete mathematics; Bounding overwatch; Tree (set theory); GF(2); Exponential function; Path (computing); Nondeterministic finite automaton; Finite field; Automaton; Algorithm; Computer science; Automata theory; Theoretical computer science","score_opus":0.022265722468154052,"score_gpt":0.23524108675770072,"score_spread":0.21297536428954666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120287019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.659701,0.0011551449,0.31377643,0.0020772826,0.000104959436,0.00013963484,0.0012148675,0.0007100635,0.021120649],"genre_scores_gemma":[0.9675688,0.0004905333,0.027447753,0.00010205215,0.00017146711,0.00021197992,0.00043071737,0.00023302542,0.0033436255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960496,0.00096204726,0.00037497166,0.0009959273,0.0010460197,0.0005714708],"domain_scores_gemma":[0.8531241,0.117554694,0.010017699,0.008499309,0.00634117,0.0044629937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060829744,0.0007487979,0.0014357934,0.0041647526,0.001948905,0.0062411083,0.002268548,0.0020010476,0.008232515],"category_scores_gemma":[0.056801148,0.001355902,0.0015321121,0.0024823416,0.0049589407,0.01333436,0.0018903887,0.0037793913,0.0006894042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001279903,0.00005530921,0.0024337969,0.00010235855,0.00002159142,0.00009151687,0.00073442486,0.008378841,0.0037703381,0.97681385,0.00045510652,0.007014902],"study_design_scores_gemma":[0.000025583624,0.000035694018,0.0011532141,0.00003892044,0.000024079634,0.00024654606,0.00018316734,0.053901054,0.0029767381,0.94036037,0.0010136369,0.000041082665],"about_ca_topic_score_codex":0.0010899844,"about_ca_topic_score_gemma":0.0009278919,"teacher_disagreement_score":0.008232515,"about_ca_system_score_codex":0.0031537197,"about_ca_system_score_gemma":0.0016907742,"threshold_uncertainty_score":0.032170177},"labels":[],"label_agreement":null},{"id":"W3159778435","doi":"10.1016/j.ic.2022.104954","title":"Beyond PCSP(1-in-3,NAE)","year":2022,"lang":"en","type":"preprint","venue":"Information and Computation","topic":"Advanced Graph Theory Research","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":"H2020 European Research Council; Horizon 2020; European Research Council; Natural Sciences and Engineering Research Council of Canada; European Commission; Royal Society","keywords":"Constraint satisfaction problem; Tuple; Backtracking; Constraint satisfaction; Template; Combinatorics; Mathematics; Constraint (computer-aided design); Computer science; Boolean function; Relaxation (psychology); Discrete mathematics; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.019636919936389,"score_gpt":0.3090241625789866,"score_spread":0.28938724264259763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159778435","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.04059719,0.0026590624,0.44242525,0.02320166,0.006121133,0.00038917564,0.009751389,0.013135687,0.46171948],"genre_scores_gemma":[0.49516565,0.0018418216,0.28219864,0.007312666,0.0020779525,0.00058226474,0.007900704,0.0066489116,0.19627143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842286,0.00038623993,0.00007509198,0.0004603905,0.0003804557,0.00027491353],"domain_scores_gemma":[0.99614185,0.0008617776,0.00017103888,0.0019405518,0.0005908443,0.00029399354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016867234,0.0007460073,0.000976905,0.0012069908,0.002819879,0.0058924705,0.0022956105,0.0024894478,0.049668714],"category_scores_gemma":[0.008592291,0.00044767503,0.0012435113,0.001610621,0.002160475,0.008171732,0.00461252,0.00516073,0.026205609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017651834,0.000069211535,0.00034062983,0.00017444222,0.00001729607,0.00007140186,0.00010870614,0.0019871234,0.00095321133,0.8663985,0.08253544,0.047167648],"study_design_scores_gemma":[0.000016102353,0.000009584831,0.00010005813,0.000033956458,0.0000080491145,0.00006823821,0.00002579748,0.0061329175,0.0010944797,0.9407324,0.0517653,0.000013172886],"about_ca_topic_score_codex":0.0025900898,"about_ca_topic_score_gemma":0.004472501,"teacher_disagreement_score":0.049668714,"about_ca_system_score_codex":0.0019196594,"about_ca_system_score_gemma":0.00270168,"threshold_uncertainty_score":0.16615838},"labels":[],"label_agreement":null},{"id":"W3164441574","doi":"10.1016/j.ic.2023.105010","title":"Deterministic size discovery and topology recognition in radio networks with short labels","year":2023,"lang":"en","type":"article","venue":"Information and Computation","topic":"Distributed systems and fault tolerance","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; Narodowe Centrum Nauki","keywords":"Topology (electrical circuits); Computer science; Network topology; Node (physics); Graph; Theoretical computer science; Binary number; Algorithm; Mathematics; Computer network; Combinatorics","score_opus":0.01295393487565469,"score_gpt":0.24168620107471656,"score_spread":0.22873226619906187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164441574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12005972,0.0004075293,0.8740035,0.000960759,0.00014528548,0.00008376928,0.00026344508,0.0008007806,0.0032751225],"genre_scores_gemma":[0.84065247,0.0003197563,0.15370198,0.0002238793,0.00021775832,0.00016741533,0.0004103587,0.00023147711,0.0040749125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970458,0.00092359283,0.0001977495,0.0007434105,0.00074841705,0.0003409156],"domain_scores_gemma":[0.9487937,0.036816508,0.0048109693,0.006444475,0.0018661983,0.0012681806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033067758,0.00053208193,0.0012983333,0.001981535,0.0013257065,0.0027327428,0.0030912256,0.0020386814,0.0017930306],"category_scores_gemma":[0.034151528,0.0009521968,0.00083255407,0.0017849037,0.0031232925,0.0067890575,0.0029519266,0.0020858888,0.00042037238],"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.0010696218,0.00020680661,0.0058974656,0.00029375716,0.00006756665,0.00028213573,0.0005898582,0.46774578,0.012557945,0.39836973,0.0054449146,0.10747443],"study_design_scores_gemma":[0.000026666288,0.000050190964,0.000509348,0.000017456437,0.000012139428,0.00008939864,0.000066249864,0.7706147,0.0036705825,0.22409135,0.0008231007,0.000028705444],"about_ca_topic_score_codex":0.0016594968,"about_ca_topic_score_gemma":0.0020431888,"teacher_disagreement_score":0.0033067758,"about_ca_system_score_codex":0.0020264788,"about_ca_system_score_gemma":0.0011238455,"threshold_uncertainty_score":0.017488122},"labels":[],"label_agreement":null},{"id":"W4205574731","doi":"10.1016/j.ic.2017.08.005","title":"Preface","year":2017,"lang":"en","type":"article","venue":"Information and Computation","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","score_opus":0.02071341823739041,"score_gpt":0.2965942795056569,"score_spread":0.2758808612682665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205574731","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.001383314,0.017678486,0.05235649,0.051535502,0.25406343,0.0006245822,0.017896501,0.0027488193,0.60171294],"genre_scores_gemma":[0.012673509,0.009247817,0.013052512,0.010448842,0.055135228,0.0004254336,0.012977035,0.0026736716,0.8833659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915206,0.00016697575,0.000051071216,0.00015607357,0.00040887707,0.00006484922],"domain_scores_gemma":[0.9934321,0.0016107109,0.00016588549,0.0008377387,0.003339432,0.0006141215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014305129,0.0012483716,0.0008048211,0.003465544,0.0023778398,0.0035022967,0.0012637747,0.0010953065,0.41193685],"category_scores_gemma":[0.016455444,0.0003670989,0.00078309915,0.0027845176,0.00090685213,0.003575952,0.0019543914,0.0036722685,0.28377217],"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.000018752193,0.00001905006,0.000062654544,0.00010964716,0.0000029848138,0.00002426839,0.000040725015,0.000104300285,0.00010054039,0.016914284,0.94375503,0.038847726],"study_design_scores_gemma":[0.000005090245,0.000010101424,0.00017938,0.0001544765,0.000003758613,0.000041707917,0.00004974362,0.000113680704,0.00018933607,0.023272473,0.97597116,0.000008985918],"about_ca_topic_score_codex":0.0036496213,"about_ca_topic_score_gemma":0.0042984514,"teacher_disagreement_score":0.41193685,"about_ca_system_score_codex":0.0020616925,"about_ca_system_score_gemma":0.0020404719,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4206159874","doi":"10.1016/s0890-5401(04)00057-4","title":"The query complexity of order-finding","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bounded function; Permutation (music); Constant (computer programming); Order (exchange); Mathematics; Exponential function; Probabilistic logic; Polynomial; Combinatorics; Discrete mathematics; Time complexity; Computer science; Statistics","score_opus":0.020841465448893905,"score_gpt":0.27322877145194907,"score_spread":0.25238730600305515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206159874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33911428,0.008020194,0.55912083,0.037111014,0.0008366237,0.0005540997,0.0061464435,0.0030843192,0.046012253],"genre_scores_gemma":[0.87970185,0.0030101666,0.09934044,0.0014233611,0.0013095165,0.00029651562,0.0032624546,0.0012298967,0.010425955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98277986,0.00509733,0.0010570302,0.002550109,0.006142001,0.0023736353],"domain_scores_gemma":[0.8132134,0.15983947,0.004352678,0.014320602,0.0051411246,0.0031326371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009242981,0.0014386881,0.005155914,0.002954718,0.0034219578,0.010799346,0.0067441785,0.0048096203,0.021704355],"category_scores_gemma":[0.1010285,0.0016878761,0.0026766122,0.007647126,0.005764675,0.031961836,0.0052658753,0.0065641813,0.0021984035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00517512,0.00080389774,0.010109422,0.001482017,0.00047467384,0.00059226004,0.0017396612,0.22397687,0.005790438,0.500606,0.06221617,0.18703347],"study_design_scores_gemma":[0.0003122988,0.0001129643,0.0011081673,0.000053529828,0.0001857886,0.000371243,0.00034185586,0.47540528,0.0018533946,0.51751053,0.0026852314,0.00005978544],"about_ca_topic_score_codex":0.0102596795,"about_ca_topic_score_gemma":0.0072457865,"teacher_disagreement_score":0.021704355,"about_ca_system_score_codex":0.0077568833,"about_ca_system_score_gemma":0.0074743913,"threshold_uncertainty_score":0.07260829},"labels":[],"label_agreement":null},{"id":"W4206998859","doi":"10.1016/j.ic.2022.104867","title":"Compact representation of graphs with bounded bandwidth or treedepth","year":2022,"lang":"en","type":"article","venue":"Information and Computation","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oracle; Bounded function; Combinatorics; Bandwidth (computing); Adjacency list; Constant (computer programming); Binary logarithm; Discrete mathematics; Mathematics; Complement (music); Computer science; Graph; Computer network","score_opus":0.01989807263903853,"score_gpt":0.26926125506010395,"score_spread":0.24936318242106542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206998859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069578335,0.0008789836,0.9173163,0.0005423494,0.00012896075,0.00007782265,0.0018178623,0.0017400854,0.007919314],"genre_scores_gemma":[0.62005824,0.0013492681,0.36597025,0.00025015883,0.00011620382,0.00020089999,0.0034446588,0.0005350149,0.008075311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997713,0.000045454606,0.000015467496,0.00004937732,0.00007976733,0.000038615584],"domain_scores_gemma":[0.99894613,0.0003505381,0.0001176643,0.00035445456,0.000169071,0.00006218979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021072567,0.00053079886,0.0005821824,0.0012952838,0.00030726873,0.001638729,0.00087591365,0.00074508897,0.005774547],"category_scores_gemma":[0.0027734332,0.00026318664,0.00030603938,0.0020675117,0.00043430974,0.0027260105,0.00087674294,0.0009909931,0.0011134725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006326727,0.00013507878,0.00087868486,0.00054637174,0.000038012455,0.00037829086,0.0005434279,0.16027889,0.028662538,0.42672053,0.017400878,0.36378458],"study_design_scores_gemma":[0.000047786034,0.00009282817,0.00047132146,0.00010612488,0.00003184888,0.00032203633,0.00019137787,0.5315364,0.009151731,0.43908414,0.018936342,0.000028095068],"about_ca_topic_score_codex":0.001166143,"about_ca_topic_score_gemma":0.00179461,"teacher_disagreement_score":0.005774547,"about_ca_system_score_codex":0.00056891004,"about_ca_system_score_gemma":0.00040740546,"threshold_uncertainty_score":0.019317806},"labels":[],"label_agreement":null},{"id":"W4211050463","doi":"10.1016/j.ic.2008.03.005","title":"Synchronization","year":2008,"lang":"en","type":"article","venue":"Information and Computation","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Synchronizing; Synchronization (alternating current); Computer science; Automaton; Coding (social sciences); Conjecture; Sequence (biology); Connection (principal bundle); Theoretical computer science; Mathematics; Discrete mathematics; Computer network; Telecommunications; Transmission (telecommunications)","score_opus":0.009007121495195454,"score_gpt":0.21169090798816587,"score_spread":0.20268378649297042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211050463","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.04264586,0.00065256964,0.4542088,0.0021307133,0.0013588921,0.0004475387,0.001204776,0.00378003,0.49357086],"genre_scores_gemma":[0.7449858,0.0005151598,0.04169646,0.0009371465,0.00047323064,0.000566266,0.0015639699,0.0010303073,0.2082316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898154,0.00018367998,0.000056455632,0.0003735465,0.00024122414,0.00016346516],"domain_scores_gemma":[0.9979165,0.0004739476,0.00013302779,0.0008784868,0.0004102999,0.0001877573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007907448,0.00064693077,0.00063976523,0.0012601754,0.0014975601,0.0020018932,0.0010558451,0.00082319084,0.056868583],"category_scores_gemma":[0.004450475,0.0003374815,0.00059455476,0.0009066987,0.001307119,0.0035730428,0.002936839,0.0013034305,0.011217868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021437356,0.000047148194,0.00047191902,0.00012103365,0.000029924437,0.00017741388,0.00048440153,0.0020870054,0.012689416,0.91845685,0.015259322,0.04996115],"study_design_scores_gemma":[0.0001184691,0.00014786002,0.0011021225,0.00006331815,0.00006786519,0.000504924,0.0004720255,0.02391809,0.022889912,0.8088174,0.14184664,0.000051415223],"about_ca_topic_score_codex":0.00053229625,"about_ca_topic_score_gemma":0.00049183506,"teacher_disagreement_score":0.056868583,"about_ca_system_score_codex":0.00078925095,"about_ca_system_score_gemma":0.0011587335,"threshold_uncertainty_score":0.19024438},"labels":[],"label_agreement":null},{"id":"W4244198405","doi":"10.1016/j.ic.2021.104784","title":"An improved approximation algorithm for the minimum common integer partition problem","year":2021,"lang":"en","type":"article","venue":"Information and Computation","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiset; Partition (number theory); Mathematics; Partition problem; Combinatorics; Integer (computer science); Approximation algorithm; Cardinality (data modeling); Discrete mathematics; Algorithm; Computer science","score_opus":0.009168018734978614,"score_gpt":0.2545742650991512,"score_spread":0.2454062463641726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244198405","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.034681406,0.00062955223,0.95067036,0.0009467639,0.00022831287,0.00023711208,0.00048300176,0.0016920164,0.0104313865],"genre_scores_gemma":[0.14266178,0.00026369467,0.8500208,0.00031605584,0.00012110091,0.0003594537,0.001341408,0.0003522018,0.004563493],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848586,0.00035064036,0.00006526713,0.00035428163,0.00044728073,0.00029666454],"domain_scores_gemma":[0.99752814,0.0013320645,0.00013711263,0.000523147,0.00032236916,0.00015715514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001279174,0.0013613967,0.002073269,0.0015466639,0.0012619621,0.002716769,0.0038200135,0.0021501337,0.010051819],"category_scores_gemma":[0.0065941494,0.0006810361,0.0013818692,0.0033163938,0.0010518819,0.0041539846,0.0025192664,0.0031843763,0.0018204725],"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.0012964072,0.00063564896,0.0012233183,0.00042244288,0.00014091161,0.00020667283,0.00038599237,0.42500275,0.00757902,0.09455636,0.027595544,0.4409549],"study_design_scores_gemma":[0.00025240926,0.000097286735,0.0002696126,0.000026845326,0.000044665536,0.00011428685,0.000093034076,0.9373463,0.0013889715,0.05516514,0.005179984,0.000021409493],"about_ca_topic_score_codex":0.006317106,"about_ca_topic_score_gemma":0.0087158205,"teacher_disagreement_score":0.010051819,"about_ca_system_score_codex":0.0024184564,"about_ca_system_score_gemma":0.0032847389,"threshold_uncertainty_score":0.033626676},"labels":[],"label_agreement":null},{"id":"W4360604354","doi":"10.1016/j.ic.2023.105027","title":"New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines","year":2023,"lang":"en","type":"article","venue":"Information and Computation","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Computer science; Turing machine; Pushdown automaton; Bounded function; Deterministic pushdown automaton; Deterministic context-free grammar; Model checking; Embedded pushdown automaton; Class (philosophy); Reachability problem; Automaton; Discrete mathematics; Theoretical computer science; Mathematics; Algorithm; Rule-based machine translation; Automata theory; Context-free grammar; Artificial intelligence","score_opus":0.0070638480504548636,"score_gpt":0.230268096332771,"score_spread":0.22320424828231614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360604354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3045437,0.0034393638,0.62322575,0.003419158,0.0005267215,0.00017364885,0.0008945234,0.0011895819,0.06258758],"genre_scores_gemma":[0.93045324,0.0007635949,0.053665806,0.00050585176,0.0007305216,0.00028359832,0.00077813957,0.00031481445,0.01250447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793005,0.00041917522,0.00018628925,0.00056772365,0.0005535425,0.00034323],"domain_scores_gemma":[0.9826775,0.011424735,0.0013279993,0.0016330363,0.0016724349,0.0012643248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021238695,0.0010216073,0.000984007,0.0024590876,0.0015482715,0.005320337,0.002698212,0.0020066097,0.008445926],"category_scores_gemma":[0.01363318,0.00065060507,0.0012702371,0.0016929093,0.0049898187,0.011701268,0.003817073,0.004898237,0.0010489533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001174989,0.00005297636,0.0008032043,0.00008443176,0.00000958374,0.00012527463,0.00048777708,0.0016824955,0.0025666861,0.9855827,0.0012823595,0.0072049843],"study_design_scores_gemma":[0.00002700602,0.00004072557,0.0006907785,0.000041379135,0.000020427447,0.00032771117,0.00027148033,0.027428385,0.002505861,0.9629916,0.005624455,0.000030124205],"about_ca_topic_score_codex":0.00023976823,"about_ca_topic_score_gemma":0.00029871476,"teacher_disagreement_score":0.008445926,"about_ca_system_score_codex":0.001580213,"about_ca_system_score_gemma":0.0009120948,"threshold_uncertainty_score":0.02825439},"labels":[],"label_agreement":null},{"id":"W4386143380","doi":"10.1016/j.ic.2023.105080","title":"On the complexity of decision problems for some classes of machines and applications","year":2023,"lang":"en","type":"article","venue":"Information and Computation","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Decision problem; Discrete mathematics; Regular language; Automaton; Mathematics; Bounded function; NP; Equivalence (formal languages); Theoretical computer science; Computer science; Time complexity; Turing machine; Algorithm","score_opus":0.036784323443912706,"score_gpt":0.2845674218857239,"score_spread":0.24778309844181123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386143380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4526488,0.008726509,0.4234035,0.033375766,0.00054682733,0.0006280846,0.0043142703,0.00078635267,0.0755698],"genre_scores_gemma":[0.90912044,0.0031702227,0.070550576,0.0011844771,0.0012371064,0.0006349288,0.0023945607,0.00028906774,0.011418654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922363,0.0028279347,0.00051238865,0.0013596046,0.0020651645,0.0009986483],"domain_scores_gemma":[0.8373725,0.14987755,0.003726307,0.004106905,0.0025112403,0.0024055683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068243267,0.0014365577,0.0033150762,0.0032281594,0.0027551898,0.009942505,0.004008823,0.0041900342,0.016247846],"category_scores_gemma":[0.059594624,0.0014715785,0.0034900699,0.0042613414,0.005963186,0.020187616,0.0045315735,0.009050392,0.0007677375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050951476,0.0003487616,0.002676113,0.00052319025,0.00013168847,0.00018027097,0.00068004295,0.07113148,0.0007357732,0.8905919,0.008645212,0.02384609],"study_design_scores_gemma":[0.000060196846,0.000024625559,0.00050324126,0.000030251991,0.000027497956,0.00009770688,0.00011164766,0.12764002,0.00017663871,0.87013113,0.0011763124,0.000020670339],"about_ca_topic_score_codex":0.0036762375,"about_ca_topic_score_gemma":0.0028691387,"teacher_disagreement_score":0.016247846,"about_ca_system_score_codex":0.0057158605,"about_ca_system_score_gemma":0.002894753,"threshold_uncertainty_score":0.05435443},"labels":[],"label_agreement":null},{"id":"W4403427149","doi":"10.1016/j.ic.2024.105230","title":"Perspective on complexity measures targeting read-once branching programs","year":2024,"lang":"en","type":"article","venue":"Information and Computation","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":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal","keywords":"Perspective (graphical); Branching (polymer chemistry); Computer science; Psychology; Artificial intelligence; Chemistry","score_opus":0.03311892894640224,"score_gpt":0.29883273690946316,"score_spread":0.26571380796306093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403427149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020310469,0.0070343073,0.897003,0.014453137,0.0007904424,0.000065520755,0.0002363229,0.0005456078,0.05956117],"genre_scores_gemma":[0.62044245,0.011512035,0.3229016,0.0044187,0.006238308,0.00041532514,0.00050869957,0.0010728894,0.032489963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557036,0.0013280461,0.00018158548,0.0006692613,0.0018971141,0.00035367897],"domain_scores_gemma":[0.97682536,0.01547542,0.0011088854,0.0034059677,0.0024269314,0.0007573098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004078967,0.0015275525,0.0019114383,0.0034577241,0.0015849672,0.0061220294,0.003443881,0.0041164453,0.008281402],"category_scores_gemma":[0.019113837,0.0007455489,0.0012415532,0.0037838486,0.0061254455,0.018357566,0.0031443331,0.008233917,0.0015985933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001416841,0.000022007316,0.00007376215,0.000041246567,0.0000049277173,0.000013710444,0.000033965633,0.0035864154,0.00041473587,0.98737633,0.0011214032,0.007297409],"study_design_scores_gemma":[0.000005199689,0.000023206983,0.00008123635,0.000027591635,0.0000065318677,0.000038992206,0.000024080455,0.020549903,0.0008849737,0.97390443,0.004442166,0.000011644569],"about_ca_topic_score_codex":0.0011300488,"about_ca_topic_score_gemma":0.0007381053,"teacher_disagreement_score":0.008281402,"about_ca_system_score_codex":0.0044541527,"about_ca_system_score_gemma":0.0015524043,"threshold_uncertainty_score":0.03231728},"labels":[],"label_agreement":null},{"id":"W4406796286","doi":"10.1016/j.ic.2024.105165","title":"Preface to “Computation over Compressed Data” at DCC 2022","year":2025,"lang":"en","type":"article","venue":"Information and Computation","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":"","keywords":"Computer science; Computation; Algorithm","score_opus":0.016247767896694177,"score_gpt":0.2959883687082094,"score_spread":0.2797406008115152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406796286","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.0007903055,0.023866799,0.02463601,0.07817178,0.6665556,0.00036142435,0.0019669246,0.0010145111,0.20263666],"genre_scores_gemma":[0.012960247,0.012662082,0.007322351,0.024941443,0.38971418,0.00030508227,0.001815194,0.0019981344,0.5482813],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99756205,0.00045435442,0.00009037042,0.000394648,0.0013426312,0.00015599634],"domain_scores_gemma":[0.9938869,0.0013275982,0.0001772709,0.000503195,0.003128021,0.0009771286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026216991,0.0019917835,0.0011614154,0.004055424,0.0027115326,0.004762992,0.0012796822,0.0030776819,0.10330568],"category_scores_gemma":[0.012490758,0.0004950511,0.0008945893,0.0025750592,0.0012333919,0.0029797095,0.0019739293,0.0061612586,0.05469986],"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.00003371266,0.000022045064,0.000036239286,0.000073516494,0.0000050223116,0.000025408293,0.000010576137,0.0002514747,0.00020915136,0.008495999,0.9710419,0.01979503],"study_design_scores_gemma":[0.000018722649,0.000033988254,0.00028812233,0.00019767205,0.000008524863,0.00007201513,0.000015536536,0.0012137902,0.00055728055,0.011853081,0.9857178,0.000023601448],"about_ca_topic_score_codex":0.00521026,"about_ca_topic_score_gemma":0.0060661524,"teacher_disagreement_score":0.10330568,"about_ca_system_score_codex":0.0051039862,"about_ca_system_score_gemma":0.0021398733,"threshold_uncertainty_score":0.34559196},"labels":[],"label_agreement":null},{"id":"W4407263581","doi":"10.1016/j.ic.2025.105280","title":"On the computational power of energy-constrained mobile robots","year":2025,"lang":"en","type":"article","venue":"Information and Computation","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":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Japan Society for the Promotion of Science London","keywords":"Computer science; Energy (signal processing); Mobile robot; Power (physics); Robot; Human–computer interaction; Artificial intelligence; Physics","score_opus":0.008253946251145946,"score_gpt":0.24746364461184642,"score_spread":0.23920969836070047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407263581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20027342,0.010479206,0.65999675,0.010844142,0.0005684757,0.00006173744,0.00038262934,0.00025679532,0.11713684],"genre_scores_gemma":[0.95698786,0.0026457596,0.030552747,0.00035896813,0.00022300913,0.00006803269,0.00008695408,0.00011709122,0.008959631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948955,0.0001853416,0.000019998062,0.000071920316,0.00015534493,0.0000777693],"domain_scores_gemma":[0.99407226,0.005206847,0.00015027357,0.0002895933,0.00016927597,0.000111770576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091059256,0.00059920194,0.0008752992,0.00062448275,0.00067500956,0.0015401087,0.0012697454,0.00095240545,0.0067618974],"category_scores_gemma":[0.0100988345,0.00037625874,0.00042701716,0.0011692167,0.0023291593,0.0033695914,0.0022872384,0.0012098962,0.00050761236],"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.0002474833,0.000042347758,0.00063418166,0.00019966319,0.00004491893,0.00012936175,0.00015263181,0.5307868,0.0018794878,0.42388982,0.0032061327,0.038787175],"study_design_scores_gemma":[0.000020096439,0.00002216065,0.00021392723,0.000030191184,0.000010539581,0.000029861107,0.000047276993,0.7533325,0.0005135375,0.24361391,0.002157749,0.000008303961],"about_ca_topic_score_codex":0.0019679393,"about_ca_topic_score_gemma":0.0015467368,"teacher_disagreement_score":0.0067618974,"about_ca_system_score_codex":0.00053327665,"about_ca_system_score_gemma":0.0004931307,"threshold_uncertainty_score":0.022620857},"labels":[],"label_agreement":null},{"id":"W4411089206","doi":"10.1016/j.ic.2025.105313","title":"The longest subsequence-duplicated subsequence and related problems","year":2025,"lang":"en","type":"article","venue":"Information and Computation","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":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Longest increasing subsequence; Subsequence; Longest common subsequence problem; Combinatorics; Computer science; Mathematics","score_opus":0.007996093520544739,"score_gpt":0.2384342259044898,"score_spread":0.23043813238394506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411089206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04200187,0.028651997,0.90679467,0.007366955,0.0023385156,0.00016490136,0.0011403625,0.0005227367,0.0110179745],"genre_scores_gemma":[0.5103266,0.034366734,0.41216084,0.0020318553,0.011956126,0.0005089959,0.004281737,0.0006754139,0.023691606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99513996,0.0010944277,0.00058701745,0.0013458657,0.0015782494,0.00025446923],"domain_scores_gemma":[0.97573495,0.017083053,0.0019287601,0.0028283258,0.0020618308,0.0003630586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045766854,0.001127116,0.0026747608,0.0048307693,0.0025233172,0.0034204037,0.0047583063,0.00414265,0.0052395947],"category_scores_gemma":[0.03251399,0.0008432693,0.0017107445,0.014101676,0.0044773063,0.01052,0.0030002967,0.0030561148,0.0012929154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005445187,0.0002581743,0.0038574855,0.0015233251,0.00023261805,0.0017130962,0.00046573064,0.10462529,0.0019456442,0.48129496,0.031461097,0.37207803],"study_design_scores_gemma":[0.000046294226,0.00006601371,0.000609779,0.00011772267,0.000084800056,0.0012943846,0.00018922887,0.18411489,0.0022753952,0.801076,0.0100757,0.000049886963],"about_ca_topic_score_codex":0.0019460281,"about_ca_topic_score_gemma":0.0009711102,"teacher_disagreement_score":0.0052395947,"about_ca_system_score_codex":0.0017475021,"about_ca_system_score_gemma":0.0020014504,"threshold_uncertainty_score":0.024204075},"labels":[],"label_agreement":null},{"id":"W4413160469","doi":"10.1016/j.ic.2025.105337","title":"Existential and universal width of alternating finite automata","year":2025,"lang":"en","type":"article","venue":"Information and Computation","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; Yonsei University","keywords":"Existentialism; Automaton; Finite-state machine; Mathematics; Computer science; Philosophy; Algorithm; Theoretical computer science; Epistemology","score_opus":0.006225159939000734,"score_gpt":0.2358706380819668,"score_spread":0.22964547814296604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413160469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5371708,0.0024714014,0.41834015,0.0018879086,0.000249651,0.00006960149,0.0012166979,0.0010136161,0.037580077],"genre_scores_gemma":[0.96385205,0.00048730592,0.030044693,0.0001914959,0.00019458165,0.00010500117,0.0004146197,0.00026265657,0.0044474984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970829,0.00069033005,0.00036739858,0.0008920871,0.00044719398,0.0005201382],"domain_scores_gemma":[0.9813467,0.013006074,0.0011268513,0.0021341639,0.0011128499,0.0012733374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036165027,0.0008972004,0.0014636382,0.0021923282,0.0018755185,0.0059490805,0.0025914514,0.0014716071,0.0067922603],"category_scores_gemma":[0.01891855,0.0014258329,0.001620407,0.0019144007,0.00494122,0.018954454,0.004840485,0.0043771383,0.00071981625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023326035,0.000041234587,0.0008407689,0.00009658534,0.00002371433,0.00006996081,0.0011045692,0.0018402862,0.0019794917,0.9853365,0.00048201755,0.007951594],"study_design_scores_gemma":[0.000022230943,0.000025491572,0.00040247975,0.00003541045,0.000044136144,0.00009389357,0.00022342858,0.008585792,0.0015765054,0.9876488,0.0013179202,0.000023834586],"about_ca_topic_score_codex":0.0010205178,"about_ca_topic_score_gemma":0.0008882623,"teacher_disagreement_score":0.0067922603,"about_ca_system_score_codex":0.001489065,"about_ca_system_score_gemma":0.0010332828,"threshold_uncertainty_score":0.022722304},"labels":[],"label_agreement":null},{"id":"W4414056840","doi":"10.1016/j.ic.2025.105355","title":"Polynomial Turing compressions for some graph problems parameterized by modular-width","year":2025,"lang":"en","type":"article","venue":"Information and Computation","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":"Université de Sherbrooke","funders":"China Scholarship Council","keywords":"Parameterized complexity; Turing machine; Oracle; Time complexity; Polynomial; Set (abstract data type); Turing; Kernelization","score_opus":0.015192233473038146,"score_gpt":0.2912174323092757,"score_spread":0.27602519883623755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414056840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5436698,0.0038047202,0.3436227,0.028147088,0.0006474069,0.00080187427,0.0038646967,0.006650961,0.06879069],"genre_scores_gemma":[0.9125418,0.0009656089,0.069023795,0.0014181051,0.0007964573,0.00063380104,0.0019434923,0.0012326769,0.011444391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948395,0.0012538541,0.00028059538,0.0011751864,0.0011499354,0.0013010142],"domain_scores_gemma":[0.9473732,0.041008566,0.002200941,0.006203622,0.0011167516,0.0020970497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004726615,0.0019871613,0.003105248,0.0024958146,0.0035619657,0.00681691,0.0059111,0.00433733,0.01951833],"category_scores_gemma":[0.045758374,0.0013998295,0.0037284635,0.004870409,0.005719181,0.02109109,0.005881699,0.010900893,0.0020617838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028454503,0.0010316541,0.0035762852,0.000970311,0.00022540631,0.00033787222,0.001438474,0.11207621,0.0063572344,0.7612882,0.029343927,0.08050904],"study_design_scores_gemma":[0.00026944105,0.000110296016,0.0007477332,0.00007744798,0.00012458346,0.00019048667,0.00021376017,0.18810229,0.0039317757,0.8036875,0.0024844585,0.00006020861],"about_ca_topic_score_codex":0.0017414229,"about_ca_topic_score_gemma":0.0036390855,"teacher_disagreement_score":0.01951833,"about_ca_system_score_codex":0.0067947763,"about_ca_system_score_gemma":0.004718922,"threshold_uncertainty_score":0.0652954},"labels":[],"label_agreement":null},{"id":"W4415401143","doi":"10.1016/j.ic.2025.105368","title":"Finite-time safety and reach-avoid verification of stochastic discrete-time systems","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","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":"Institute of Software, Chinese Academy of Sciences; Canadian Anesthesiologists' Society","keywords":"Complement (music); Bounding overwatch; Upper and lower bounds; Set (abstract data type); Work (physics); Stochastic process","score_opus":0.009379646626617956,"score_gpt":0.2623910646279248,"score_spread":0.25301141800130683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415401143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060530875,0.00006987951,0.93544996,0.00029122128,0.000036046302,0.00007447131,0.0001366362,0.0007182925,0.0026926904],"genre_scores_gemma":[0.95734555,0.00006858981,0.040561877,0.000113450486,0.000022346225,0.00018009005,0.000150826,0.00010557024,0.0014517785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933961,0.0015313621,0.00039490638,0.0009127283,0.0028880893,0.000876839],"domain_scores_gemma":[0.97450835,0.018616157,0.0017684516,0.0023163646,0.0022086892,0.0005820067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004653917,0.0009909879,0.0012015044,0.0010190197,0.0010690948,0.0022864235,0.0019306671,0.001308832,0.0026825366],"category_scores_gemma":[0.026865037,0.0007099004,0.0026380885,0.0005801437,0.0044766855,0.0026134616,0.0034698462,0.0026412068,0.00031652593],"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.00062078494,0.00011798006,0.0024420896,0.00027999736,0.00016808616,0.0005311899,0.0007150978,0.4880888,0.010353283,0.47918472,0.0005866036,0.016911384],"study_design_scores_gemma":[0.000065349035,0.000068169946,0.00026469742,0.000033659337,0.000039592178,0.0000490769,0.00004510483,0.7527908,0.007596477,0.2384632,0.0005584785,0.000025376863],"about_ca_topic_score_codex":0.0058162413,"about_ca_topic_score_gemma":0.004104963,"teacher_disagreement_score":0.0058162413,"about_ca_system_score_codex":0.002023631,"about_ca_system_score_gemma":0.005338395,"threshold_uncertainty_score":0.024612546},"labels":[],"label_agreement":null},{"id":"W4416091488","doi":"10.1016/j.ic.2025.105378","title":"Approximation algorithms for the maximum path cover problem using long paths","year":2025,"lang":"en","type":"article","venue":"Information and Computation","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 Alberta","funders":"Research Grants Council, University Grants Committee; 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":"Approximation algorithm; Path (computing); Cover (algebra); Matching (statistics); Approximation theory; Stability (learning theory)","score_opus":0.026057032211216403,"score_gpt":0.27926336159475795,"score_spread":0.25320632938354154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416091488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091149054,0.0024744142,0.89132756,0.001085391,0.00011508472,0.00028423118,0.00085692,0.0029758809,0.009731424],"genre_scores_gemma":[0.47789398,0.0012711753,0.5114144,0.00028946085,0.0001485777,0.000522349,0.002637023,0.00052751676,0.005295605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983284,0.00037427864,0.00008007362,0.00043867496,0.0003856331,0.00039292808],"domain_scores_gemma":[0.9971782,0.0018317872,0.0002740518,0.00041654622,0.00015131518,0.00014818033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012492101,0.0015969343,0.0015390627,0.001625644,0.0011703862,0.0018067705,0.002952926,0.0018504524,0.005668368],"category_scores_gemma":[0.0070792637,0.00083691295,0.0013443545,0.0038000925,0.00083813077,0.00541265,0.0023247644,0.0020688805,0.0010504548],"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.0009106859,0.0003809153,0.0016430919,0.0006251417,0.00017224958,0.0002599754,0.00043576377,0.72374254,0.0048928475,0.04980725,0.014918557,0.20221101],"study_design_scores_gemma":[0.00013998052,0.00009675089,0.00026746918,0.000043142518,0.00003514798,0.00019031722,0.00007568975,0.9266437,0.0014993369,0.067611665,0.0033790562,0.000017860251],"about_ca_topic_score_codex":0.0049760896,"about_ca_topic_score_gemma":0.005442983,"teacher_disagreement_score":0.005668368,"about_ca_system_score_codex":0.002511418,"about_ca_system_score_gemma":0.0017261246,"threshold_uncertainty_score":0.018962622},"labels":[],"label_agreement":null},{"id":"W4416715375","doi":"10.1016/j.ic.2025.105383","title":"On the containment problem for deterministic multicounter machine models","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Containment (computer programming); Selection (genetic algorithm); Work (physics); Mathematical model; Control (management)","score_opus":0.009763061285680595,"score_gpt":0.25988773795508324,"score_spread":0.25012467666940263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416715375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022021089,0.0009291162,0.9629188,0.0018091153,0.00007429159,0.0001330414,0.00039980022,0.0008410705,0.010873637],"genre_scores_gemma":[0.6196556,0.0015250482,0.36040077,0.0013582103,0.0004950962,0.0011148455,0.0019900578,0.00083056267,0.012629874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99094135,0.0027877227,0.00064608356,0.0024342237,0.0023223558,0.000868315],"domain_scores_gemma":[0.95482767,0.03842204,0.0020619642,0.0029403563,0.0012041574,0.0005438884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004521655,0.001256037,0.0020793027,0.0018265429,0.002210571,0.00409708,0.0039628157,0.0030827394,0.0060470947],"category_scores_gemma":[0.027753621,0.0014847768,0.003313838,0.0022081672,0.006050297,0.011687974,0.0054507223,0.006100146,0.0009173782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006692106,0.00006290814,0.00051758054,0.00021936418,0.00003797544,0.0003887665,0.00077540963,0.042380843,0.0012776994,0.9406313,0.0015132305,0.012128042],"study_design_scores_gemma":[0.000021627575,0.000024202245,0.000086985994,0.000045862573,0.000026333419,0.00018585949,0.00007457077,0.14967012,0.0017080357,0.8447351,0.0033984028,0.000022865304],"about_ca_topic_score_codex":0.003876886,"about_ca_topic_score_gemma":0.0025228085,"teacher_disagreement_score":0.0060470947,"about_ca_system_score_codex":0.0035760351,"about_ca_system_score_gemma":0.002263455,"threshold_uncertainty_score":0.02594608},"labels":[],"label_agreement":null},{"id":"W4417122901","doi":"10.1016/j.ic.2025.105397","title":"Approximation algorithms for non-sequential star packing problems","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Packing Problems","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":"China Scholarship Council; Ministry of Science and Technology of the People's Republic of China; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Approximation algorithm; Star (game theory); Approximation theory; Generalization; Matching (statistics); Greedy algorithm","score_opus":0.014712424126904844,"score_gpt":0.24836205613343604,"score_spread":0.2336496320065312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417122901","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.04658424,0.0021296793,0.93243605,0.0011298874,0.00027292667,0.0002765861,0.00067443924,0.0024897787,0.014006341],"genre_scores_gemma":[0.3520847,0.0017788244,0.6311391,0.00056477654,0.00026118354,0.0005660961,0.0024039324,0.00060635904,0.010594991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979724,0.0005003252,0.00014610031,0.00046618373,0.00045875055,0.00045624858],"domain_scores_gemma":[0.99674416,0.0018085083,0.00036891384,0.0005606239,0.00028698082,0.00023078654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019631165,0.002290101,0.0020129269,0.0013936543,0.0012875452,0.0024916418,0.0035440102,0.0018737547,0.0070925117],"category_scores_gemma":[0.0067442805,0.0008799973,0.0018981565,0.0033407772,0.00098919,0.004117276,0.0020537407,0.0021921739,0.0018483081],"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.0009878052,0.00066138286,0.0015026183,0.00063945283,0.00016085581,0.00018834883,0.0003287041,0.75169915,0.003260432,0.04960602,0.019622697,0.1713425],"study_design_scores_gemma":[0.00009192536,0.00008538448,0.00015081414,0.000022235077,0.000023539073,0.000083125924,0.000052308103,0.967607,0.0008021219,0.028803406,0.0022697619,0.000008406958],"about_ca_topic_score_codex":0.0050531924,"about_ca_topic_score_gemma":0.007043266,"teacher_disagreement_score":0.0070925117,"about_ca_system_score_codex":0.0025895354,"about_ca_system_score_gemma":0.0025306768,"threshold_uncertainty_score":0.023726821},"labels":[],"label_agreement":null}]}