{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8176817,0.000030400413,0.17936552,0.0017275147,0.00008238194,0.00017857715,0.0000023263121,0.000041085772,0.0008904658],"genre_scores_gemma":[0.9975939,0.000009149767,0.0019758053,0.00040416062,0.000006616274,0.0000046924865,0.0000027138792,9.3019725e-7,0.000002081397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954736,0.000030029001,0.00017729215,0.00006649044,0.00011803037,0.00006077079],"domain_scores_gemma":[0.9993551,0.00012865663,0.00021900177,0.00021729704,0.000056476645,0.000023511338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004158218,0.000051675983,0.00006769312,0.000034908582,0.0003555002,0.00034929128,0.00021398222,0.0000208734,0.0000020507173],"category_scores_gemma":[0.00009031818,0.000035815057,0.000012975193,0.000030258163,0.00015009589,0.0017775631,0.00013774766,0.000046135436,0.000004374806],"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.0000032664173,0.000010567135,0.0005937556,0.00003214375,0.0000032584437,4.3171617e-8,0.0017176822,0.00025503823,0.00003105854,0.9221118,0.00007686875,0.07516451],"study_design_scores_gemma":[0.00015782173,0.000034388744,0.07885462,0.000023320623,0.0000010394532,0.0000017713056,0.0000743226,0.548423,0.00015725658,0.3721476,0.00008139492,0.000043501645],"about_ca_topic_score_codex":0.00004172675,"about_ca_topic_score_gemma":0.0000036008742,"teacher_disagreement_score":0.5499642,"about_ca_system_score_codex":0.000008142951,"about_ca_system_score_gemma":0.000013051821,"threshold_uncertainty_score":0.3368224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07549984,0.000032315776,0.9215442,0.00034945627,0.0002683986,0.000065205684,5.088412e-7,0.000115004725,0.002125078],"genre_scores_gemma":[0.9850583,0.0000045566835,0.014335175,0.0004999197,0.000050750255,0.0000021565174,0.000025441634,0.0000019164775,0.000021763968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922484,0.000036774705,0.0003006366,0.000108548185,0.0002024168,0.00012675789],"domain_scores_gemma":[0.99945056,0.000027554797,0.00015541882,0.00006827448,0.00023072567,0.000067472654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032622108,0.00008739917,0.00010962958,0.00009895214,0.000095708594,0.0004189466,0.00015569781,0.000043314187,0.0000029139833],"category_scores_gemma":[0.00003395044,0.000079647005,0.00003610477,0.00027089342,0.000016852839,0.0028189174,0.000075897835,0.00007507095,0.00007899755],"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.00001313085,0.00003600851,0.0003669996,0.000032214983,0.000051861927,0.000003131836,0.036611572,0.32884508,0.0000030507665,0.39922816,0.005354436,0.22945437],"study_design_scores_gemma":[0.0002880142,0.000035546454,0.0002313597,0.000010234644,0.0000048642783,0.000009938497,0.0004313835,0.9955456,0.00002052647,0.00047366667,0.0028468699,0.000101983394],"about_ca_topic_score_codex":0.00001932904,"about_ca_topic_score_gemma":0.0000051442953,"teacher_disagreement_score":0.9095585,"about_ca_system_score_codex":0.00003127878,"about_ca_system_score_gemma":0.000035709818,"threshold_uncertainty_score":0.4039912},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027192913,0.000002720989,0.97115225,0.015876617,0.000030091243,0.00019058636,0.0000012773419,0.0001439024,0.009883261],"genre_scores_gemma":[0.96476144,0.000023400491,0.029856412,0.0051333522,0.000010161923,0.000028905179,0.000008973089,0.0000031559462,0.0001741767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946076,0.000037103364,0.00014258566,0.000073430056,0.00019364606,0.00009247762],"domain_scores_gemma":[0.99953336,0.00010100511,0.00008542682,0.00010813913,0.0001321356,0.000039915732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019794876,0.00005991457,0.000040461317,0.000068249356,0.00014731217,0.00026429482,0.00014463182,0.000017890121,0.000019037507],"category_scores_gemma":[0.000015930083,0.000027691043,0.00000865626,0.00018904496,0.000030402918,0.0015629377,0.000038718626,0.000039485934,0.00013924486],"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.000014018514,0.00001145179,0.000049390754,0.00000875754,0.0000058637306,2.4343834e-7,0.0008852858,0.004908631,0.0000070543965,0.7381646,0.0041843555,0.25176033],"study_design_scores_gemma":[0.0012742662,0.00028232526,0.0011803408,0.00009380623,0.0000026396283,0.000018506864,0.000094704614,0.91950285,0.00014903703,0.033740524,0.043444827,0.00021618663],"about_ca_topic_score_codex":0.0000045036604,"about_ca_topic_score_gemma":0.0000025726563,"teacher_disagreement_score":0.96204215,"about_ca_system_score_codex":0.000014321424,"about_ca_system_score_gemma":0.000029611205,"threshold_uncertainty_score":0.2548601},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079639874,0.00019880256,0.9109529,0.0011368347,0.0005067182,0.00025706436,0.00004719714,0.00021489276,0.0070456862],"genre_scores_gemma":[0.97574633,0.00003777706,0.023885112,0.00016618294,0.00002914466,0.000007438762,0.00011336229,0.000003219237,0.000011442619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913406,0.00004427219,0.0003574011,0.00013282377,0.00023097312,0.000100446625],"domain_scores_gemma":[0.99846673,0.00006678093,0.00067988195,0.0005961899,0.00014722803,0.00004320098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002924918,0.00013159461,0.0002066762,0.00015478687,0.00012108692,0.00044273725,0.00075434113,0.00010660164,0.0000050246954],"category_scores_gemma":[0.00009385451,0.00012675508,0.000051230953,0.0000459073,0.000098202094,0.0012600437,0.0010160117,0.00016500104,0.0000145256345],"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.000015854563,0.00005392806,0.0002836765,0.00094545307,0.00006422475,0.000002886053,0.006828321,0.0029868064,0.00002914318,0.4489905,0.0019139443,0.53788525],"study_design_scores_gemma":[0.0005048102,0.000046713576,0.024054313,0.00021237857,0.00001597485,0.000019203277,0.00026062326,0.71149576,0.00034446354,0.26218173,0.00059111917,0.0002728956],"about_ca_topic_score_codex":0.00015090832,"about_ca_topic_score_gemma":0.000005915904,"teacher_disagreement_score":0.8961064,"about_ca_system_score_codex":0.00002165227,"about_ca_system_score_gemma":0.000071099035,"threshold_uncertainty_score":0.5168922},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029927058,0.000015008837,0.9671438,0.00045292673,0.0002112346,0.00021120723,0.0000050436315,0.00015741652,0.0018763065],"genre_scores_gemma":[0.97861797,0.000001081741,0.020834079,0.00029032107,0.000049331542,0.000042418476,0.00013110467,0.000002017357,0.00003169432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995262,0.000018150831,0.00020171294,0.000081009326,0.00008576674,0.00008712962],"domain_scores_gemma":[0.9996704,0.000033955814,0.00008784672,0.00007427566,0.00011022568,0.000023311995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017314477,0.00006309658,0.0000525738,0.00014396237,0.0002455474,0.00035536438,0.000074505435,0.000028626342,0.0000039099546],"category_scores_gemma":[0.000009995328,0.00006234157,0.000030701944,0.00019204617,0.000020120518,0.001678226,0.000020861857,0.000028392942,0.0000191086],"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.000023849741,0.00002904018,0.00014277027,0.000051253886,0.0000062622144,1.0555578e-7,0.00088428723,0.0017626712,0.00026685218,0.5119044,0.0045233495,0.48040515],"study_design_scores_gemma":[0.000764064,0.00016543425,0.009868255,0.000016036633,0.0000087077615,0.000013763913,0.0001585098,0.83968323,0.00029714752,0.10130831,0.047517072,0.00019946911],"about_ca_topic_score_codex":0.0000071054837,"about_ca_topic_score_gemma":0.0000020334385,"teacher_disagreement_score":0.9486909,"about_ca_system_score_codex":0.000011020619,"about_ca_system_score_gemma":0.00001727503,"threshold_uncertainty_score":0.3426787},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012706672,0.00002325369,0.98403823,0.000055333985,0.00016188844,0.00008896536,6.6401657e-7,0.000140259,0.002784748],"genre_scores_gemma":[0.90225035,0.0000068841064,0.097569175,0.0001247919,0.000011986066,0.0000055265223,0.000018443321,0.0000017077147,0.00001110528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994743,0.000027218592,0.00018526713,0.00008430855,0.000136023,0.00009291395],"domain_scores_gemma":[0.99968666,0.0000260788,0.000102749385,0.000060316397,0.000084316795,0.0000398976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001944419,0.000059789563,0.000050415234,0.00008101902,0.0001923338,0.0004115827,0.00007700154,0.000026870779,0.0000026219732],"category_scores_gemma":[0.000049629605,0.000055852826,0.000010711517,0.0001977474,0.0000068881404,0.0028027943,0.000038596572,0.000060356357,0.000015128284],"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.0000018928691,0.000018647052,0.0012042165,0.0000452079,0.000006021415,3.263847e-7,0.0020683806,0.022737253,0.000065812696,0.2949246,0.0005534595,0.6783742],"study_design_scores_gemma":[0.00025984365,0.000029826582,0.003166568,0.00002235265,0.0000014608207,0.000024292405,0.00006321479,0.96980345,0.00017267719,0.008047234,0.018304346,0.00010473627],"about_ca_topic_score_codex":0.00001663589,"about_ca_topic_score_gemma":0.000001226853,"teacher_disagreement_score":0.9470662,"about_ca_system_score_codex":0.00001954578,"about_ca_system_score_gemma":0.000022760118,"threshold_uncertainty_score":0.39689016},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20114812,0.0000401647,0.7957913,0.00072358054,0.000052174677,0.00007525602,1.6143095e-7,0.00020163455,0.0019676012],"genre_scores_gemma":[0.95453507,0.000014989223,0.045070607,0.0002533435,0.000033951444,0.000006040512,0.000010930263,0.0000016781162,0.00007340103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954027,0.000026689257,0.00013847205,0.00007298304,0.00013909124,0.00008252005],"domain_scores_gemma":[0.99976015,0.000022738912,0.00007160773,0.000046515906,0.000048450922,0.00005051134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015313111,0.000057499747,0.000049454266,0.00007217965,0.00017110801,0.00030759608,0.000057609228,0.000027196967,0.0000030096135],"category_scores_gemma":[0.000020083238,0.000050878993,0.000010188365,0.00009687349,0.000013863406,0.0015365863,0.00006275879,0.00010322668,0.00001775926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.2344476e-7,0.0000056252,0.00071732193,0.0000060059147,0.0000015913613,8.4369816e-8,0.0025877373,0.0069648563,0.000009070505,0.002861706,0.000075540636,0.98676956],"study_design_scores_gemma":[0.00024708285,0.00005065722,0.010313476,0.000012020501,0.000001112663,0.000008911304,0.00009569696,0.95835054,0.000015185898,0.00035754425,0.030477777,0.00006998705],"about_ca_topic_score_codex":0.000013289647,"about_ca_topic_score_gemma":7.82278e-7,"teacher_disagreement_score":0.9866995,"about_ca_system_score_codex":0.000009446446,"about_ca_system_score_gemma":0.000011259872,"threshold_uncertainty_score":0.2966156},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80595446,0.000096414486,0.18557282,0.000010518666,0.0018576244,0.00016031344,0.000012492501,0.00031516582,0.006020214],"genre_scores_gemma":[0.99968755,0.0000116858255,0.00009739483,0.000018477425,0.000055892666,0.000008917664,0.00011207688,0.0000040736704,0.0000039369556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995362,0.000027854523,0.00023073645,0.0000365277,0.00008844034,0.00008020852],"domain_scores_gemma":[0.99978954,0.0000390528,0.00004347122,0.0000445738,0.000043673674,0.00003971844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008054452,0.00007075266,0.000084651445,0.00007182396,0.00006175583,0.000118421645,0.00003144607,0.000054957993,0.000011064936],"category_scores_gemma":[0.000005197837,0.00007236569,0.000013810237,0.0001063048,0.000015811638,0.0005497597,0.000004932786,0.000047887574,0.000059256326],"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.00020582936,0.000047068417,0.023151323,0.00041855968,0.00029964323,0.000009391198,0.011205277,0.47834155,0.0017187567,0.30773282,0.010328128,0.16654164],"study_design_scores_gemma":[0.00146201,0.00003873964,0.0076443106,0.000054888944,0.00001453587,0.000042481308,0.0024400447,0.9646774,0.00015441842,0.009472918,0.013748053,0.00025022752],"about_ca_topic_score_codex":0.00004950764,"about_ca_topic_score_gemma":0.0000010691913,"teacher_disagreement_score":0.4863358,"about_ca_system_score_codex":0.000016013866,"about_ca_system_score_gemma":0.0000061535807,"threshold_uncertainty_score":0.29509872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98370486,0.000020935908,0.0123764975,0.0002963717,0.000040735165,0.00008434304,8.8196526e-7,0.000013477257,0.003461877],"genre_scores_gemma":[0.99810547,0.000013103748,0.0009334941,0.00073805556,0.00001814484,0.0000014574496,0.00017790831,7.891142e-7,0.000011596494],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996019,0.0000248468,0.00019124204,0.00006803192,0.00004558609,0.000068408604],"domain_scores_gemma":[0.99983656,0.0000056703857,0.00006099344,0.00003308904,0.00004342589,0.000020246287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016352216,0.00004883139,0.000047484606,0.000042680338,0.000034978715,0.000032516178,0.000028950222,0.00005922614,0.0000019104325],"category_scores_gemma":[0.000037420796,0.000044159337,0.000013447071,0.00006705123,0.000009311256,0.00002016453,0.000013123033,0.000031651038,0.000005130892],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010666572,0.000081901286,0.013327174,0.000021933822,0.0000065498893,7.5487844e-7,0.00036908052,0.0023508514,0.021605391,0.0022288277,0.0016722108,0.95822865],"study_design_scores_gemma":[0.0017889137,0.0007391438,0.923298,0.000024527077,0.000003879256,0.000025156187,0.00020085042,0.047229875,0.00797818,0.006744173,0.0116586555,0.00030865395],"about_ca_topic_score_codex":0.000005341134,"about_ca_topic_score_gemma":0.000002013237,"teacher_disagreement_score":0.95792,"about_ca_system_score_codex":0.000006945578,"about_ca_system_score_gemma":0.000008945065,"threshold_uncertainty_score":0.18007655},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13412724,0.000031482872,0.86374503,0.0013585889,0.00015113989,0.00006989025,7.642153e-7,0.00006307263,0.00045278153],"genre_scores_gemma":[0.939118,0.000009201936,0.06066627,0.00018281954,0.000014348284,0.0000015108296,0.0000046774353,0.0000012333238,0.0000018843386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944466,0.000019935424,0.00023229307,0.000058015412,0.00015118223,0.000093886796],"domain_scores_gemma":[0.999559,0.00006279893,0.00014890016,0.00009440036,0.000107454485,0.000027452063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020482781,0.000056974313,0.00006213435,0.000060639446,0.00027916583,0.00016729021,0.00016715929,0.000020633626,2.801212e-7],"category_scores_gemma":[0.000026313426,0.00004065846,0.000018719382,0.0002443521,0.0000754366,0.0005040687,0.000078882615,0.00006751547,0.0000057699112],"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.0000036007507,0.000010063731,0.00005344177,0.000018850453,0.000005969725,2.462811e-7,0.0030216961,0.1143641,0.000018009525,0.391871,0.000036597943,0.4905964],"study_design_scores_gemma":[0.00035510454,0.000051327,0.007423207,0.000021584483,0.000001270307,0.000018960944,0.000119416836,0.9135114,0.00022325973,0.07713838,0.0010638341,0.00007228493],"about_ca_topic_score_codex":0.00003642106,"about_ca_topic_score_gemma":0.000004336514,"teacher_disagreement_score":0.8049908,"about_ca_system_score_codex":0.0000129686505,"about_ca_system_score_gemma":0.00004700535,"threshold_uncertainty_score":0.2147146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1498044,0.000029123179,0.84869504,0.00040525466,0.00006915262,0.00013569012,5.851022e-7,0.000051343137,0.00080938987],"genre_scores_gemma":[0.9870726,0.0000119698025,0.01266381,0.00023232575,0.000004075452,0.0000026029745,0.0000087995595,0.0000015307047,0.0000023229832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932337,0.000043375232,0.0002511872,0.000068743255,0.00021548098,0.00009786389],"domain_scores_gemma":[0.999461,0.000093387076,0.00014749543,0.00013121814,0.00013802198,0.000028911245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030425633,0.000058417838,0.00006520959,0.00014193091,0.00016615241,0.00010087307,0.00020830576,0.000024642528,6.8577594e-7],"category_scores_gemma":[0.000026554975,0.000044855442,0.00002385365,0.00046805566,0.00006538474,0.0014719402,0.00007783275,0.00007393703,0.0000135798555],"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.000004447049,0.000009597201,0.00007387632,0.0000116335395,0.0000058765586,1.3705419e-7,0.0029859475,0.054572325,0.000080945734,0.6592419,0.000019394667,0.28299388],"study_design_scores_gemma":[0.0006981235,0.00008745702,0.0091024535,0.000023480423,0.0000025489373,0.00001674814,0.0003159095,0.6757287,0.0010673688,0.31254756,0.00031500694,0.000094659554],"about_ca_topic_score_codex":0.000014182936,"about_ca_topic_score_gemma":0.0000022812026,"teacher_disagreement_score":0.8372682,"about_ca_system_score_codex":0.00001859867,"about_ca_system_score_gemma":0.00003955463,"threshold_uncertainty_score":0.18291518},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072674096,0.0000238309,0.92098206,0.00023544075,0.00044094998,0.00015430302,5.1219837e-7,0.00019065116,0.0052981614],"genre_scores_gemma":[0.9665322,0.000010431071,0.033037942,0.00031379474,0.000058547594,0.0000046597775,0.00002854031,0.0000023530408,0.00001155217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898404,0.000025765115,0.00042219323,0.00012536449,0.0002766741,0.00016593713],"domain_scores_gemma":[0.9992904,0.000116145704,0.0002121364,0.0001113611,0.00019665141,0.00007332521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066420506,0.00009561386,0.00007327103,0.00021250952,0.00024682205,0.000293648,0.00013284698,0.000060118895,0.00000530601],"category_scores_gemma":[0.000030192447,0.00010469298,0.000023792574,0.00027694314,0.00004258663,0.0021087623,0.000051900217,0.000087022076,0.000058122103],"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.000006971489,0.00001777502,0.0003582583,0.000025668769,0.0000100568,4.888337e-7,0.0065005235,0.011049175,0.00017070638,0.27298978,0.00011199283,0.7087586],"study_design_scores_gemma":[0.0015068412,0.00011263308,0.07207811,0.00008290101,0.000011175682,0.000064418935,0.006961862,0.8917657,0.0064961542,0.016745398,0.0036927757,0.00048203973],"about_ca_topic_score_codex":0.000013689596,"about_ca_topic_score_gemma":7.596322e-7,"teacher_disagreement_score":0.8938581,"about_ca_system_score_codex":0.00008076976,"about_ca_system_score_gemma":0.00003659328,"threshold_uncertainty_score":0.4269256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63302577,0.000059149046,0.36603326,0.0004591754,0.00002415693,0.000054485092,4.770146e-7,0.00006746837,0.00027603254],"genre_scores_gemma":[0.9948283,0.000019266423,0.004422457,0.00071185036,0.0000062569366,0.0000013458634,0.0000075681082,8.864788e-7,0.0000021081714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996168,0.000019407535,0.00014782153,0.00006532842,0.00007472703,0.00007593101],"domain_scores_gemma":[0.99981827,0.000026871765,0.00005858481,0.000055899185,0.0000166718,0.000023697972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016422366,0.000050079907,0.000054216238,0.00011672975,0.00004715401,0.00016275197,0.00005898596,0.000025866828,8.8301726e-7],"category_scores_gemma":[0.000012939058,0.000048126476,0.000007050135,0.000113625916,0.0000066347593,0.0011150648,0.000022826747,0.000043316155,0.000002488974],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014741387,0.0000042140223,0.00095560605,0.00001027681,0.000001030185,0.0000013504211,0.0025623322,0.0003649391,0.000023085293,0.008036792,0.000011589571,0.98802733],"study_design_scores_gemma":[0.0005892296,0.00007536522,0.2671842,0.000050054456,0.0000014750127,0.000042873016,0.001407256,0.7173878,0.00023255934,0.012583486,0.0003005915,0.00014508545],"about_ca_topic_score_codex":0.00003095753,"about_ca_topic_score_gemma":0.0000058550254,"teacher_disagreement_score":0.9878822,"about_ca_system_score_codex":0.000008615622,"about_ca_system_score_gemma":0.000006949552,"threshold_uncertainty_score":0.19625407},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06378556,0.00001423288,0.93203336,0.00036232613,0.00004838862,0.0001533535,0.0000029104265,0.000048010843,0.003551847],"genre_scores_gemma":[0.95023173,0.000045124838,0.04926659,0.00040715237,0.0000037946506,0.0000040889427,0.000027787575,0.0000017887527,0.000011935337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994141,0.00006416132,0.00021235282,0.00007094437,0.00015717532,0.000081250095],"domain_scores_gemma":[0.99959636,0.000071966184,0.00009333768,0.00005747027,0.00012709822,0.000053786647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028575375,0.000053702544,0.00006340536,0.00017220703,0.00009172652,0.00012319842,0.00004709911,0.000025615198,0.0000073367846],"category_scores_gemma":[0.000065632936,0.000051193463,0.000010654945,0.0001854929,0.000023600503,0.0010908913,0.000022719816,0.00006120519,0.000010263977],"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.00001863313,0.00004997768,0.00010484752,0.00008432998,0.000012310506,3.5078173e-7,0.005183814,0.019506484,0.0001298209,0.14744297,0.000068920795,0.8273975],"study_design_scores_gemma":[0.00054234866,0.00015729146,0.0007268978,0.000023845334,0.0000014653831,0.000007139058,0.00015848166,0.98764753,0.00025920468,0.00971084,0.00069102494,0.00007390571],"about_ca_topic_score_codex":0.000008808095,"about_ca_topic_score_gemma":0.0000011390782,"teacher_disagreement_score":0.9681411,"about_ca_system_score_codex":0.000008533853,"about_ca_system_score_gemma":0.000032481803,"threshold_uncertainty_score":0.20876089},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117409624,0.000023618026,0.8754151,0.0007868879,0.0001041487,0.000079352954,0.000001431042,0.00020687778,0.0059729535],"genre_scores_gemma":[0.9700907,0.000006728866,0.027303189,0.0024789863,0.000027831677,0.0000047348312,0.000036929814,0.0000024513067,0.000048483802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994359,0.000059224472,0.00019466424,0.00008798741,0.00012808455,0.00009413342],"domain_scores_gemma":[0.9995391,0.00010758213,0.000114369126,0.00011124198,0.00008539024,0.000042330714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003149592,0.00007357595,0.000079935584,0.00008636193,0.00009766868,0.00022304167,0.00013283649,0.000036372072,0.000005020051],"category_scores_gemma":[0.00005238532,0.000066959976,0.000018233613,0.00015396936,0.000026687498,0.0017098848,0.00005602771,0.000049661896,0.00007426072],"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.0000031685909,0.0000064401224,0.00016617277,0.000014929733,0.000004946359,2.6381466e-7,0.0017572673,0.00012669245,0.000024247149,0.2095095,0.0008261736,0.78756016],"study_design_scores_gemma":[0.00067233015,0.00010394467,0.026475413,0.000031696043,0.0000042209554,0.000040190975,0.00057831506,0.90926826,0.000370318,0.046493262,0.01575716,0.00020486095],"about_ca_topic_score_codex":0.000019380828,"about_ca_topic_score_gemma":0.0000022734157,"teacher_disagreement_score":0.9091416,"about_ca_system_score_codex":0.0000111827085,"about_ca_system_score_gemma":0.00001965924,"threshold_uncertainty_score":0.27305487},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98726815,0.00011887976,0.01169582,0.000035559468,0.000023458322,0.00006233527,0.0000055961323,0.0000046089963,0.0007855997],"genre_scores_gemma":[0.9975954,0.000006727738,0.0021659916,0.00004359961,0.000027067454,0.0000010196695,0.00015123528,0.0000012168425,0.00000770548],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9995999,0.0000316867,0.00021321702,0.000036626032,0.000048843336,0.00006973417],"domain_scores_gemma":[0.99977154,0.000013375681,0.00011125195,0.000041266598,0.000042281015,0.00002031134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001938763,0.00004140776,0.0000757649,0.000048306167,0.000021186612,0.0000055325913,0.000031585467,0.000052580963,0.0000033753875],"category_scores_gemma":[0.000043656386,0.000037396418,0.000020946376,0.000059629223,0.000032468302,0.000018699355,0.00003610971,0.000024459263,0.0000016987968],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022081021,0.0002149987,0.10680958,0.0001863593,0.000046851765,2.2646663e-7,0.0017445722,0.0036608127,0.6913105,0.0030025006,0.0014484333,0.1913543],"study_design_scores_gemma":[0.0015805003,0.000376397,0.8052108,0.00008413917,0.000016221811,0.000019373447,0.0009264748,0.023988198,0.16115314,0.00026716865,0.006087317,0.00029022226],"about_ca_topic_score_codex":0.000016488268,"about_ca_topic_score_gemma":0.0000016214026,"teacher_disagreement_score":0.6984013,"about_ca_system_score_codex":0.000004074879,"about_ca_system_score_gemma":0.0000074332347,"threshold_uncertainty_score":0.15249817},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020656396,0.000011024969,0.9692508,0.00015768173,0.0001310915,0.0003184893,8.772699e-8,0.0002364725,0.009237969],"genre_scores_gemma":[0.5941372,0.0000032496343,0.40554103,0.00024128708,0.000010805661,0.00003916864,0.00000721517,0.0000017652121,0.000018294395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991226,0.00005344514,0.00035381241,0.00010840826,0.00021710471,0.0001446094],"domain_scores_gemma":[0.99924356,0.00009602614,0.00022373702,0.000120540615,0.0002747681,0.000041381565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028998396,0.00008694761,0.000071712515,0.000070832444,0.00019469942,0.00040782854,0.00017112188,0.000035975034,0.000009065259],"category_scores_gemma":[0.00034705363,0.000083061044,0.000013201844,0.00031403967,0.000031516767,0.00604104,0.00010271766,0.00009939989,0.00019709869],"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.0000018020032,0.000007725363,0.00029528132,0.00008253375,0.0000039190395,1.1224925e-7,0.0035948458,0.16440059,0.0001456888,0.15018585,0.00012367756,0.68115795],"study_design_scores_gemma":[0.00014562412,0.00008212324,0.008694226,0.000023681252,0.0000016253578,0.000010742861,0.00013145537,0.9771416,0.00013895916,0.0127554815,0.0007687983,0.00010565113],"about_ca_topic_score_codex":0.00005265085,"about_ca_topic_score_gemma":1.19207975e-7,"teacher_disagreement_score":0.81274104,"about_ca_system_score_codex":0.000041922514,"about_ca_system_score_gemma":0.000030007683,"threshold_uncertainty_score":0.43796083},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36647478,0.0000059529207,0.63257545,0.0001428096,0.00014667683,0.00010763833,9.4141296e-7,0.00002256883,0.0005231858],"genre_scores_gemma":[0.9152921,0.0000080406935,0.08450019,0.00017236317,0.00000911187,0.000011270411,0.000004428331,0.000001417225,0.0000011037639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993531,0.000045732257,0.0002802531,0.000073655945,0.00017801898,0.0000692532],"domain_scores_gemma":[0.9993702,0.0001424997,0.00017354025,0.0001518361,0.00013362772,0.000028301578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054100686,0.00006214172,0.000068290436,0.00007249418,0.00014580245,0.00012739921,0.00013745506,0.00004576361,0.0000022372187],"category_scores_gemma":[0.00015787565,0.00004437712,0.000014627781,0.00010281185,0.00005115329,0.0015426354,0.000067470166,0.00009915181,0.0000037481027],"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.00001723029,0.000009422106,0.000037897567,0.000019507917,0.0000029318699,4.7576258e-8,0.0021957778,0.010895877,0.0005689113,0.7812561,0.00002556859,0.20497073],"study_design_scores_gemma":[0.00016739842,0.00004200767,0.0007460368,0.000015984624,0.0000019398185,0.0000071716295,0.000094516465,0.9763339,0.0029548076,0.019416511,0.00016676036,0.000052932643],"about_ca_topic_score_codex":0.000008874968,"about_ca_topic_score_gemma":6.2292713e-7,"teacher_disagreement_score":0.96543807,"about_ca_system_score_codex":0.000004046285,"about_ca_system_score_gemma":0.000022672333,"threshold_uncertainty_score":0.18096463},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14335853,0.000071720315,0.837019,0.00012044237,0.00004110964,0.00012733319,0.000002068607,0.00009848657,0.019161275],"genre_scores_gemma":[0.9755042,0.000024668023,0.023757612,0.0005902327,0.000009334877,0.0000074819386,0.000019911135,0.0000032341677,0.00008331354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996332,0.00003924645,0.00016186069,0.000037453094,0.00005214568,0.00007607135],"domain_scores_gemma":[0.9996275,0.00013550822,0.000083745515,0.000038760387,0.000087844935,0.000026667742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019371616,0.00005107297,0.00006293358,0.000049964092,0.00008581588,0.000029607803,0.000019984056,0.000043089956,0.000037661375],"category_scores_gemma":[0.00045726198,0.000046812675,0.000009209294,0.00009633569,0.000020491354,0.00049541256,0.0000049584214,0.000049086688,0.000026740892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001653703,0.000016276066,0.00035379617,0.00020560015,0.000009319529,4.795185e-7,0.0032226916,0.00035107686,0.00000826909,0.9747045,0.0007848183,0.02032661],"study_design_scores_gemma":[0.00040898842,0.000027416136,0.00042651256,0.000026288248,0.000010944924,0.000045232562,0.0008529909,0.00421821,0.00035847328,0.975817,0.017702548,0.00010537467],"about_ca_topic_score_codex":3.8072875e-7,"about_ca_topic_score_gemma":5.293607e-7,"teacher_disagreement_score":0.8321457,"about_ca_system_score_codex":0.000012335905,"about_ca_system_score_gemma":0.000032267304,"threshold_uncertainty_score":0.19089656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54909915,0.0000073789906,0.448903,0.00016300817,0.00019006983,0.00011592358,0.000001343049,0.00006130159,0.0014588118],"genre_scores_gemma":[0.98210526,0.0000024886526,0.016831301,0.0010327713,0.00000954422,0.0000044663097,0.000003889133,0.000001917724,0.000008364006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937516,0.000044217522,0.0002512665,0.000086369146,0.00016075245,0.00008225906],"domain_scores_gemma":[0.99945617,0.000017146645,0.00012311673,0.00024494197,0.000108393244,0.000050250354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025731884,0.00006296927,0.00006841336,0.000089086985,0.00010489725,0.00008364008,0.00026115472,0.000029245326,0.000007868763],"category_scores_gemma":[0.00002176472,0.000043652064,0.000021838028,0.00027752217,0.000025123036,0.0014472901,0.00009354176,0.000041305113,0.000024466615],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053499716,0.00007733053,0.0008508578,0.000033731783,0.000010303573,6.4608065e-7,0.056080338,0.0023736723,0.0018478812,0.10091355,0.0012215998,0.8365366],"study_design_scores_gemma":[0.0005295539,0.00021063238,0.21858779,0.000063049454,0.0000063516077,0.000025937057,0.0010505787,0.7626751,0.0056999023,0.009500639,0.0014371434,0.00021331603],"about_ca_topic_score_codex":0.000031346644,"about_ca_topic_score_gemma":0.0000018992357,"teacher_disagreement_score":0.83632326,"about_ca_system_score_codex":0.000008342722,"about_ca_system_score_gemma":0.000023239902,"threshold_uncertainty_score":0.17800795},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36632055,0.000038932794,0.6328959,0.000050529543,0.000043930435,0.00002527769,3.0432707e-7,0.0000417967,0.00058279035],"genre_scores_gemma":[0.9897208,0.0000042343777,0.010207811,0.00003821256,0.00001132494,0.0000010472565,0.000008281303,0.00000106629,0.000007216921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995746,0.00003473614,0.0001894174,0.000026015872,0.00011275174,0.00006248205],"domain_scores_gemma":[0.9996387,0.0000562102,0.00018842662,0.000043539167,0.00005028731,0.000022873017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018174546,0.000038147053,0.00006855826,0.000087338136,0.000029102763,0.000025299445,0.00006010888,0.000017034883,0.0000055872233],"category_scores_gemma":[0.000032092557,0.000033738776,0.000014134318,0.00010540356,0.000011616107,0.0008942756,0.000031789416,0.00004545912,0.0000072863895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.0877345e-7,0.000010883247,0.017286988,0.00008630528,0.000004329638,3.4057628e-8,0.005248218,0.0020860273,0.00003684556,0.0029846341,0.000021364682,0.97223395],"study_design_scores_gemma":[0.00013567376,0.000038772854,0.09130234,0.000020385824,0.0000022077468,0.0000047593658,0.00034755658,0.9072977,0.0004576152,0.00007834457,0.0002728584,0.000041815194],"about_ca_topic_score_codex":0.00003116252,"about_ca_topic_score_gemma":1.7491834e-7,"teacher_disagreement_score":0.97219217,"about_ca_system_score_codex":0.0000034831962,"about_ca_system_score_gemma":0.000008417868,"threshold_uncertainty_score":0.13758273},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004619237,0.0000081456465,0.98373234,0.0009998495,0.000040081643,0.0001339957,4.0081989e-7,0.00023738264,0.010228558],"genre_scores_gemma":[0.8486655,0.00006290391,0.15007414,0.0010099751,0.0000140544835,0.000020376021,0.00004904262,0.0000029148866,0.00010109101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994467,0.000023795252,0.00016741313,0.00007505824,0.00020256224,0.00008449782],"domain_scores_gemma":[0.9995908,0.000020623524,0.000081327365,0.00007825348,0.00017531206,0.00005366744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008734732,0.000060491104,0.00005295633,0.00012609863,0.0001840265,0.00013933242,0.000085777065,0.000023348917,0.0000046826094],"category_scores_gemma":[0.000008685276,0.0000507628,0.000008734214,0.00028289066,0.000025445874,0.0051724017,0.000027395556,0.0000457,0.00006028014],"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.00004242999,0.000059032296,0.00086087774,0.00004570771,0.000017540006,0.0000047789126,0.023364142,0.12086536,0.000018971126,0.09097617,0.0053928145,0.75835216],"study_design_scores_gemma":[0.0005424248,0.00010026858,0.0028064423,0.000006793694,9.500577e-7,0.0000455363,0.0001621181,0.9913503,0.00004538295,0.0008338022,0.004014935,0.00009108137],"about_ca_topic_score_codex":0.000008694933,"about_ca_topic_score_gemma":0.0000036287906,"teacher_disagreement_score":0.8704849,"about_ca_system_score_codex":0.0000101393625,"about_ca_system_score_gemma":0.00004681483,"threshold_uncertainty_score":0.37498662},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91805124,0.00005201935,0.081128545,0.00005759553,0.000051119372,0.00008546791,0.0000060189013,0.000008318611,0.0005596722],"genre_scores_gemma":[0.9989186,0.000024583596,0.00060920184,0.00010187532,0.000018318064,0.0000022219983,0.00031769482,0.0000018563514,0.0000056702534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996148,0.000019555951,0.00017984101,0.000058846643,0.00006792807,0.000059069447],"domain_scores_gemma":[0.9996582,0.00000991284,0.00014167128,0.000059566693,0.000105174855,0.000025456036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009941671,0.00005427754,0.00007344374,0.00004318202,0.000039626197,0.000015450898,0.000053387146,0.000054760694,0.0000038510684],"category_scores_gemma":[0.000016772277,0.000044861037,0.000024273017,0.000069612346,0.000042647705,0.000030629297,0.000027130376,0.000024050367,0.0000014091476],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055306766,0.0007013708,0.13504775,0.00033863683,0.00019988319,0.0000011531462,0.003460127,0.03258987,0.11630985,0.029412199,0.00054575724,0.6808403],"study_design_scores_gemma":[0.0051057427,0.004155647,0.37555623,0.00014013851,0.00007749389,0.000039101415,0.0024542804,0.46231946,0.121964045,0.019879436,0.0074934466,0.0008149635],"about_ca_topic_score_codex":0.000011140701,"about_ca_topic_score_gemma":0.0000071945606,"teacher_disagreement_score":0.68002534,"about_ca_system_score_codex":0.0000023047473,"about_ca_system_score_gemma":0.000011614344,"threshold_uncertainty_score":0.18293801},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048111416,0.0000064014944,0.94992226,0.0005988821,0.00003060532,0.00025855328,9.713094e-7,0.00007443019,0.000996449],"genre_scores_gemma":[0.8524492,0.0000069990137,0.14728838,0.00018770131,0.0000051131474,0.000023758575,0.000022527396,0.0000020126874,0.000014313276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999404,0.000024000934,0.0002478946,0.00007181339,0.00016509883,0.00008716713],"domain_scores_gemma":[0.9994084,0.00003073727,0.00014133555,0.00008804868,0.0002766364,0.000054847358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010429022,0.00006560151,0.00006952539,0.00015387397,0.00008786787,0.00025959726,0.00007821161,0.000026962434,0.000010912481],"category_scores_gemma":[0.000011871751,0.00005370833,0.000011563335,0.00024433018,0.000034640198,0.0071696225,0.000037379217,0.000043156444,0.000029559742],"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.000013349713,0.00005386904,0.00019407652,0.000079644844,0.000019251938,0.0000045967663,0.02314336,0.24442393,0.000057748854,0.08299247,0.0005137766,0.64850396],"study_design_scores_gemma":[0.00041563215,0.00012289861,0.0006557199,0.000014475025,0.0000015795122,0.000068451125,0.0010009314,0.9954618,0.00012470482,0.001786116,0.0002650062,0.000082684535],"about_ca_topic_score_codex":0.000041537674,"about_ca_topic_score_gemma":0.000003867526,"teacher_disagreement_score":0.8043378,"about_ca_system_score_codex":0.000010488717,"about_ca_system_score_gemma":0.00003069963,"threshold_uncertainty_score":0.5197803},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03604937,0.00004319515,0.9608672,0.00007596471,0.00009309392,0.000100193814,0.0000017001302,0.000058965525,0.0027102777],"genre_scores_gemma":[0.92382777,0.000007640212,0.07588348,0.000231924,0.000005057846,0.000007363965,0.000030142854,0.0000014163536,0.0000051833276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994606,0.000044641594,0.00022683656,0.00007660257,0.00010702815,0.000084284526],"domain_scores_gemma":[0.99976814,0.000028475173,0.00007751732,0.000060694616,0.000036986792,0.000028179766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019293503,0.00005893694,0.00006307965,0.00012778219,0.00005298298,0.0000605971,0.00003915721,0.000023262002,0.0000031622083],"category_scores_gemma":[0.000021061605,0.000057560403,0.000009153223,0.0001885383,0.00001562111,0.0024061406,0.000023614717,0.0000436868,0.000025830179],"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.0000034731233,0.000012490151,0.0007527237,0.000025642199,0.000002411062,0.0000016727773,0.002026436,0.011010648,0.000022634526,0.44670966,0.000120479526,0.53931177],"study_design_scores_gemma":[0.0022553713,0.00014363456,0.029748615,0.00008793638,0.0000028758325,0.00012720254,0.0062659965,0.90023786,0.0014931316,0.00971283,0.049433544,0.0004910015],"about_ca_topic_score_codex":0.000044966924,"about_ca_topic_score_gemma":0.000018873083,"teacher_disagreement_score":0.8892272,"about_ca_system_score_codex":0.000032336255,"about_ca_system_score_gemma":0.000022545977,"threshold_uncertainty_score":0.2347245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029882377,0.00001464622,0.9683248,0.00013447429,0.0001383009,0.00014444838,0.0000097585025,0.00009963128,0.001251608],"genre_scores_gemma":[0.8625323,0.000009964051,0.13691828,0.000304759,0.0000115912235,0.000008838691,0.0002112204,0.0000014440743,0.0000015892292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992573,0.00003253709,0.0003890486,0.000058714064,0.0001850203,0.00007734182],"domain_scores_gemma":[0.99935246,0.000017189906,0.0002491526,0.00013258077,0.00020387668,0.000044745135],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00028841468,0.00007871263,0.00008936888,0.0001821189,0.000083302664,0.00009928387,0.00009549607,0.00003809036,0.0000022112288],"category_scores_gemma":[0.000043722066,0.000069038964,0.000018258756,0.0002143818,0.000031868545,0.014227729,0.00004379141,0.000048361733,0.000019348818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005865151,0.0000053813037,0.000004208564,0.00001639665,0.0000018602807,4.1544507e-8,0.0038370762,0.0029228309,0.000026585134,0.61523104,0.00000604028,0.37794265],"study_design_scores_gemma":[0.003716222,0.00095703354,0.024480624,0.00025017056,0.000018063985,0.00010423832,0.008653526,0.3619077,0.013921973,0.57065934,0.014554807,0.00077630056],"about_ca_topic_score_codex":0.0000511865,"about_ca_topic_score_gemma":0.000005271112,"teacher_disagreement_score":0.83264995,"about_ca_system_score_codex":0.000028204931,"about_ca_system_score_gemma":0.000069887355,"threshold_uncertainty_score":0.99955976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013401759,0.000028578672,0.98063403,0.0005125519,0.00013103835,0.00010998062,6.209683e-7,0.00016219457,0.005019269],"genre_scores_gemma":[0.95332795,0.000015856318,0.045861125,0.00073037297,0.000017020722,0.000005908109,0.000025188978,0.0000015784535,0.00001500962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944115,0.000044186807,0.0001594137,0.000046113564,0.00016130888,0.0001478497],"domain_scores_gemma":[0.9996434,0.000043751294,0.000057649602,0.00006488001,0.00009320451,0.00009710392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029096758,0.000049982962,0.00004601328,0.00015790711,0.00013400051,0.00023883935,0.00008895879,0.000024051014,0.000008460664],"category_scores_gemma":[0.000027745222,0.00004673434,0.000012978566,0.00026061764,0.000014974426,0.0039520687,0.000056713627,0.000060672068,0.00007820108],"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.0000045767088,0.00003294512,0.001902174,0.00003454121,0.00001060891,1.4935017e-7,0.011503231,0.012014662,0.000039904273,0.40355223,0.0011296098,0.56977534],"study_design_scores_gemma":[0.0003848782,0.000028320344,0.013014368,0.000007652571,0.0000011977568,0.000013561984,0.00017191087,0.97581303,0.00008060038,0.0034971263,0.00687607,0.00011130727],"about_ca_topic_score_codex":0.000007058308,"about_ca_topic_score_gemma":3.230006e-7,"teacher_disagreement_score":0.96379834,"about_ca_system_score_codex":0.000010816368,"about_ca_system_score_gemma":0.000017279448,"threshold_uncertainty_score":0.28651544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040841956,0.0000035004778,0.9543633,0.00016364572,0.000109608256,0.0009074347,2.4878474e-7,0.00011424287,0.0034960879],"genre_scores_gemma":[0.9920443,6.746203e-7,0.0070752343,0.0007319273,0.000042160507,0.000058337995,0.000011574753,0.0000016546871,0.000034097266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992161,0.000017564573,0.0003242322,0.00009340294,0.00021046108,0.00013827911],"domain_scores_gemma":[0.99954706,0.00003904695,0.00015085704,0.000058203535,0.00014624698,0.000058581063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000541085,0.000076395976,0.00008381391,0.00014097385,0.00011106415,0.0003420756,0.0001457519,0.000044113836,0.000007663154],"category_scores_gemma":[0.000025265845,0.00006941777,0.00003187834,0.00022046022,0.000014586948,0.0015143974,0.000052373787,0.00007064026,0.00011514059],"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.000015524465,0.000027750095,0.00010376156,0.000030311849,0.000014674124,0.000002916636,0.005647328,0.014029797,0.00001006036,0.46617225,0.0005474606,0.5133982],"study_design_scores_gemma":[0.00028046174,0.000063559506,0.0011505088,0.000017800428,0.0000019433487,0.00001788527,0.00015363631,0.99079967,0.00015713865,0.00034278224,0.006913078,0.000101567945],"about_ca_topic_score_codex":0.000009400624,"about_ca_topic_score_gemma":0.000005978118,"teacher_disagreement_score":0.97676986,"about_ca_system_score_codex":0.000020764368,"about_ca_system_score_gemma":0.000023560178,"threshold_uncertainty_score":0.3298643},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4893164,0.00000777783,0.509967,0.00015041146,0.000025458929,0.00007533073,0.0000042309644,0.000060316917,0.0003930109],"genre_scores_gemma":[0.973356,0.00000657996,0.02628871,0.00028121762,0.0000040920427,0.0000033687759,0.000043002907,0.0000016338093,0.000015407408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950826,0.000026616439,0.0001949103,0.000060783546,0.00014088796,0.000068553636],"domain_scores_gemma":[0.9996806,0.00002541674,0.00007821442,0.000100341145,0.0000830298,0.000032393527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009571309,0.000059310954,0.0000840947,0.0000829308,0.00011651736,0.000051478586,0.00009987493,0.000014826395,0.000004475038],"category_scores_gemma":[0.0000069605835,0.000049102597,0.0000124599,0.00018041323,0.000083161925,0.0013916094,0.000036721274,0.000038972375,0.000010605143],"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.00024223879,0.0002640479,0.003188106,0.00023624283,0.0000975445,0.000018754565,0.124978095,0.07889218,0.0009974986,0.5077166,0.0019037096,0.281465],"study_design_scores_gemma":[0.0010832625,0.00023738196,0.033810254,0.000021068887,0.0000032289963,0.000060236747,0.00045889575,0.9603531,0.0012294076,0.0024836052,0.00012831583,0.00013125705],"about_ca_topic_score_codex":0.00006149166,"about_ca_topic_score_gemma":0.000010335215,"teacher_disagreement_score":0.8814609,"about_ca_system_score_codex":0.000009605185,"about_ca_system_score_gemma":0.000038754693,"threshold_uncertainty_score":0.20023458},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018853894,0.000020478508,0.96971714,0.0001528925,0.00013770124,0.00013006617,8.166933e-7,0.000107057305,0.010879932],"genre_scores_gemma":[0.9953134,0.000002803206,0.0043460857,0.00023895151,0.000018132572,0.0000063557227,0.000021150649,0.0000015525782,0.00005155145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948204,0.000025843327,0.00019692708,0.0000812612,0.00013622445,0.00007773619],"domain_scores_gemma":[0.999674,0.000049593094,0.00008615257,0.000065862456,0.000078684265,0.00004566753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010305265,0.00006420706,0.00006078439,0.00010606921,0.00013779417,0.00012610356,0.00005449789,0.00004168123,0.0000051336083],"category_scores_gemma":[0.000017041737,0.000055818255,0.000012582415,0.000097662465,0.000025710604,0.0011833041,0.000032654887,0.000049419472,0.00003767101],"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.000003921772,0.000010946115,0.0009295166,0.00000875466,0.0000042824104,2.7690598e-7,0.0060963766,0.0008080286,5.3499485e-7,0.9514445,0.000059325575,0.04063356],"study_design_scores_gemma":[0.00041199377,0.00012858806,0.028146155,0.0000023001185,0.0000038205458,0.000020187921,0.00024470207,0.7546384,0.000018605462,0.21259199,0.0036603564,0.00013294669],"about_ca_topic_score_codex":0.000038792434,"about_ca_topic_score_gemma":0.000002638033,"teacher_disagreement_score":0.9764595,"about_ca_system_score_codex":0.000014485584,"about_ca_system_score_gemma":0.000020563422,"threshold_uncertainty_score":0.22762023},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035752453,0.000040713545,0.9592411,0.0031351408,0.00010273866,0.00014404127,0.0000020003426,0.00006953243,0.0015122836],"genre_scores_gemma":[0.98451793,0.000091389586,0.01505792,0.00031453054,0.0000058934684,0.0000016388258,0.0000067216793,7.2576046e-7,0.0000032570645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994357,0.000031772808,0.00026997895,0.00006688283,0.00012417028,0.000071473114],"domain_scores_gemma":[0.99953574,0.00006052597,0.00017512332,0.000074168696,0.00011738669,0.00003705882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017519596,0.00006212114,0.00006926864,0.00007454691,0.00019901508,0.00019941172,0.000050967108,0.000029010096,0.0000027838832],"category_scores_gemma":[0.00002840045,0.000049655624,0.000015037566,0.00012856691,0.00016657483,0.001086296,0.000019374342,0.000050785024,0.0000025740658],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037322093,0.0000022993536,0.0004122739,0.000004029826,0.000002588119,3.8251653e-8,0.0005293504,0.0005560817,0.000021745343,0.22171587,0.00005092119,0.7767011],"study_design_scores_gemma":[0.00041273647,0.000079611804,0.4422566,0.000011677832,0.0000035076544,0.00003480892,0.00034321428,0.5223083,0.0001160484,0.033729836,0.0006145247,0.000089137706],"about_ca_topic_score_codex":0.000015607664,"about_ca_topic_score_gemma":0.000011081273,"teacher_disagreement_score":0.94876546,"about_ca_system_score_codex":0.000012787635,"about_ca_system_score_gemma":0.000027091774,"threshold_uncertainty_score":0.20248976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21598513,0.000111658104,0.77827966,0.0011246139,0.00020967788,0.00009528724,0.0000047684084,0.00023110649,0.003958092],"genre_scores_gemma":[0.99329877,0.000008667033,0.006183512,0.0003754803,0.000023772342,0.000006265742,0.000060592243,0.0000016584776,0.00004128394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954754,0.000016467538,0.0001829474,0.00007281417,0.00009844534,0.00008180056],"domain_scores_gemma":[0.99971324,0.000047280413,0.00008422385,0.00006903197,0.000056469613,0.000029750914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009932659,0.00006381014,0.0000613439,0.00009910224,0.00016211584,0.0002550544,0.000066446475,0.000028444987,0.0000040504146],"category_scores_gemma":[0.000006790083,0.000062259234,0.000011579176,0.0001303168,0.00004071295,0.0018831148,0.000040253646,0.000036510024,0.000015502426],"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.0000027724031,0.000011205958,0.0006813312,0.000019776713,0.000003121689,6.465817e-7,0.0011108618,0.00046468465,0.000044779783,0.88458794,0.0025363045,0.11053656],"study_design_scores_gemma":[0.0009027613,0.000079601814,0.1322023,0.000023446924,0.000008877641,0.00008390478,0.00035020823,0.6078436,0.00026649196,0.20350012,0.054388188,0.00035050616],"about_ca_topic_score_codex":0.000053900545,"about_ca_topic_score_gemma":0.0000069866874,"teacher_disagreement_score":0.77731365,"about_ca_system_score_codex":0.000017890796,"about_ca_system_score_gemma":0.000018981329,"threshold_uncertainty_score":0.25388578},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05040921,0.00009642971,0.94698805,0.00010582944,0.0001853171,0.00039951535,0.0000020835882,0.00010117463,0.001712413],"genre_scores_gemma":[0.99388516,0.0000036894235,0.005914967,0.00005634359,0.000034890076,0.000031395306,0.00003667258,0.0000016260517,0.0000352568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994952,0.000016470833,0.00021862607,0.000092304996,0.000088479865,0.00008891675],"domain_scores_gemma":[0.9995166,0.00009822965,0.0001186773,0.000058754908,0.00017861408,0.00002912405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016925944,0.000065963904,0.00007265854,0.00007696254,0.00013527596,0.00039321237,0.00006156777,0.00003645767,2.8644624e-7],"category_scores_gemma":[0.000034620716,0.00005888106,0.000011728179,0.00010656017,0.000021990088,0.001341653,0.000025493266,0.000023643637,0.000006510223],"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.000008526627,0.00001751826,0.001244718,0.00019347927,0.000004269669,1.7563293e-7,0.0011479433,0.057383675,0.000018635119,0.83239734,0.00062844274,0.10695529],"study_design_scores_gemma":[0.00038998938,0.00004673967,0.011745099,0.000013256387,0.0000029616947,0.000009066227,0.0000355283,0.9671335,0.000011064171,0.017169427,0.003362321,0.0000810424],"about_ca_topic_score_codex":0.00004988892,"about_ca_topic_score_gemma":0.0000053959443,"teacher_disagreement_score":0.94347596,"about_ca_system_score_codex":0.000019548203,"about_ca_system_score_gemma":0.000022904247,"threshold_uncertainty_score":0.37917557},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35719565,0.00008023336,0.63969415,0.00032799577,0.000030064899,0.000053702894,0.0000017804142,0.00006202335,0.0025544344],"genre_scores_gemma":[0.98474014,0.000016386948,0.014799779,0.00042575822,0.000004779459,4.83381e-7,0.000008005588,5.01074e-7,0.000004195832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968946,0.000013175781,0.00013608857,0.000042849682,0.00007010207,0.00004832384],"domain_scores_gemma":[0.99978757,0.000029146619,0.000076638695,0.000050870858,0.000033970573,0.00002180283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012271461,0.000038321916,0.000058513153,0.000068951995,0.000037765727,0.000088432585,0.0000597375,0.000019678184,0.000001477111],"category_scores_gemma":[0.000008430462,0.000034214332,0.000006646528,0.000084228595,0.000012421324,0.0010853305,0.000021961723,0.000021799198,0.0000031368595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003867475,0.0000121655485,0.00020086998,0.000016417285,0.0000034612183,3.2235903e-7,0.0025034063,0.00037899773,0.0002604195,0.17260355,0.00015962384,0.8238569],"study_design_scores_gemma":[0.0005219078,0.00012628037,0.18284059,0.000029529527,0.0000030285619,0.000029402963,0.00035952515,0.7708479,0.0009381083,0.04382916,0.000366495,0.00010803054],"about_ca_topic_score_codex":0.000007607128,"about_ca_topic_score_gemma":3.0200889e-7,"teacher_disagreement_score":0.8237489,"about_ca_system_score_codex":0.0000030642323,"about_ca_system_score_gemma":0.000008298304,"threshold_uncertainty_score":0.139522},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031288307,0.000050983967,0.9609381,0.0018463321,0.00051153183,0.00061301957,0.000006169095,0.000085502004,0.004660035],"genre_scores_gemma":[0.9963989,0.000002824328,0.0009713589,0.0020965978,0.00021687643,0.00007771882,0.00020091361,0.0000025985923,0.00003220117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995264,0.0000023072732,0.00018643495,0.000041517247,0.00013279822,0.00011057738],"domain_scores_gemma":[0.9997511,0.000023882123,0.00006212936,0.00003964974,0.000115585535,0.00000769188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031276944,0.000058080637,0.000040916337,0.0000761219,0.00025278766,0.00015578672,0.00004075251,0.000016052041,0.000042096424],"category_scores_gemma":[0.000021952483,0.00004474121,0.000022412585,0.00011501783,0.000018065859,0.0009771772,0.000031368083,0.000025759262,0.00015822762],"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.000023207793,0.00005202174,0.00085500535,0.00027891912,0.000027929582,1.4608082e-8,0.0007017355,0.5265694,0.00000477856,0.28116065,0.008929086,0.18139723],"study_design_scores_gemma":[0.0002576959,0.000002589881,0.015101466,0.0000037620723,0.000012336612,3.6800495e-7,0.00043316744,0.826281,0.0000018977978,0.00082943577,0.15701503,0.00006122155],"about_ca_topic_score_codex":0.00006442087,"about_ca_topic_score_gemma":0.0000038685052,"teacher_disagreement_score":0.9651106,"about_ca_system_score_codex":0.00001426021,"about_ca_system_score_gemma":0.000004604305,"threshold_uncertainty_score":0.20337486},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027778435,0.000014100898,0.96511173,0.00027538894,0.0006272004,0.00037068556,0.000002260692,0.00014762576,0.005672561],"genre_scores_gemma":[0.98673296,0.0000017279293,0.012965633,0.00014343436,0.00005956586,0.000037937636,0.000024701096,0.0000015570378,0.000032466225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940556,0.000023460707,0.00023591204,0.00010597182,0.00011586007,0.00011325944],"domain_scores_gemma":[0.99938285,0.00012830339,0.00011620964,0.0001052205,0.00020679751,0.00006062961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032231823,0.000073105795,0.000089679146,0.000057037763,0.0001400673,0.000340344,0.00012094454,0.000053820473,0.000002187696],"category_scores_gemma":[0.00011558828,0.00005943388,0.000025894044,0.00010901562,0.000033148663,0.00089312054,0.00004162313,0.00007689473,0.00002872179],"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.0000060099346,0.000018025305,0.00008524159,0.000049855007,0.0000033263996,1.1692848e-7,0.0012390956,0.0005305954,0.000015587755,0.96838295,0.0005069797,0.029162193],"study_design_scores_gemma":[0.0005660416,0.00006993759,0.0061676754,0.0000065962677,0.0000036293275,0.000021758431,0.00017252093,0.9391295,0.000016973487,0.039746672,0.0139686745,0.0001300449],"about_ca_topic_score_codex":0.00000925142,"about_ca_topic_score_gemma":0.000007095441,"teacher_disagreement_score":0.9589545,"about_ca_system_score_codex":0.000016973165,"about_ca_system_score_gemma":0.0000409848,"threshold_uncertainty_score":0.3281945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25189474,0.0000021813835,0.74323756,0.00012939096,0.0000081560975,0.000048284946,0.000008122807,0.000009029897,0.004662537],"genre_scores_gemma":[0.99931955,8.0456357e-7,0.00060544285,0.000023536611,0.000012051707,0.000008159428,0.0000062782915,0.000001283478,0.000022894594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973154,0.000009095387,0.00014560368,0.000026083946,0.000051504063,0.000036149337],"domain_scores_gemma":[0.99977154,0.000055812583,0.00007939335,0.000037195136,0.00003835344,0.000017731621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009270685,0.000030027002,0.000043271975,0.000029664789,0.000029265875,0.000013096187,0.000023609982,0.000009037952,0.000100177735],"category_scores_gemma":[0.0000034567731,0.000019440635,0.000014239712,0.000037998678,0.000017166945,0.00018558354,0.00001096399,0.000011577186,0.000041592684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002455255,0.000006777458,0.00008152272,0.000004031317,0.0000034730504,2.1855633e-9,0.00028810697,0.0000026198904,0.00010318199,0.7907278,0.00003910097,0.20874096],"study_design_scores_gemma":[0.00022574796,0.00001431736,0.0009562948,0.000018502014,0.0000044912795,3.538187e-7,0.00040214692,0.0054393783,0.0006137708,0.9900214,0.0022648836,0.000038688882],"about_ca_topic_score_codex":0.0000014856015,"about_ca_topic_score_gemma":2.4687077e-8,"teacher_disagreement_score":0.7474248,"about_ca_system_score_codex":0.0000018994876,"about_ca_system_score_gemma":0.0000058188066,"threshold_uncertainty_score":0.1096876},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071893986,0.00005280951,0.98992324,0.00042385375,0.0001662245,0.00033821154,0.00000231456,0.00017207742,0.001731901],"genre_scores_gemma":[0.51020116,0.000028780427,0.48928016,0.00036153864,0.00002140135,0.00004380115,0.000026118254,0.0000027190958,0.000034314508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936676,0.00002511612,0.00027122739,0.000095556235,0.00014123534,0.0001001056],"domain_scores_gemma":[0.99931836,0.00010101138,0.00016321149,0.00010050721,0.0002813963,0.000035539873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023957016,0.00007302651,0.00006906344,0.00013944837,0.00015368266,0.00023102167,0.00012420732,0.0000439685,0.000005918521],"category_scores_gemma":[0.00018426566,0.00007182327,0.000015567193,0.0003228054,0.000014959163,0.003099735,0.00002827475,0.00003424335,0.000036022193],"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.0000097142265,0.000020881109,0.0000926215,0.00015248002,0.0000056080003,4.5479805e-8,0.0025688317,0.0048313877,0.000021974158,0.04762426,0.0008134797,0.94385874],"study_design_scores_gemma":[0.00044762855,0.000057785663,0.0009022747,0.00000952351,0.000002684489,0.000004247879,0.00003039938,0.9840585,0.00027184022,0.003631752,0.010489651,0.00009371329],"about_ca_topic_score_codex":0.0000022655902,"about_ca_topic_score_gemma":5.194583e-7,"teacher_disagreement_score":0.9792271,"about_ca_system_score_codex":0.000020390058,"about_ca_system_score_gemma":0.000013457388,"threshold_uncertainty_score":0.2928868},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23803557,0.000014630588,0.7608501,0.00015799025,0.00008917443,0.00012458129,0.000004515401,0.00004770486,0.0006757469],"genre_scores_gemma":[0.9599159,0.000042757132,0.039875295,0.000094464725,0.000005386328,0.000031136347,0.000024983236,0.0000016206643,0.000008459363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949694,0.000023150593,0.00020385718,0.000073759016,0.00012572193,0.00007655099],"domain_scores_gemma":[0.9995978,0.00004833888,0.00009288069,0.00007424632,0.000128778,0.000057948553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019385075,0.000054989432,0.00007411581,0.00008222977,0.00008575377,0.00013606618,0.00008496087,0.000027867136,0.000009514292],"category_scores_gemma":[0.000014459373,0.000054292734,0.00001044234,0.00013679237,0.000046729925,0.0020503758,0.00007058947,0.00007403917,0.0000036475824],"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.000015786505,0.00008867019,0.005527451,0.00016903902,0.000017700533,4.0237148e-7,0.008776342,0.063925594,0.0022681057,0.12738277,0.00014255993,0.7916856],"study_design_scores_gemma":[0.00048711157,0.00007413991,0.015117906,0.000014262495,0.0000018218398,0.000009573546,0.00024167655,0.97933954,0.0019559711,0.0005413324,0.002101244,0.000115417606],"about_ca_topic_score_codex":0.000024006562,"about_ca_topic_score_gemma":0.0000021369515,"teacher_disagreement_score":0.915414,"about_ca_system_score_codex":0.0000042433885,"about_ca_system_score_gemma":0.000020885831,"threshold_uncertainty_score":0.22139935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019069748,0.000037391972,0.97879523,0.00011363481,0.00021045275,0.00034465367,0.000012048422,0.0003044224,0.0011124406],"genre_scores_gemma":[0.9091993,0.000029574932,0.090068534,0.00020832758,0.000029509994,0.000048865524,0.0003881624,0.000013745713,0.000014004945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995037,0.000003995123,0.00023540638,0.00005410653,0.000092045026,0.0001107655],"domain_scores_gemma":[0.99976385,0.00001819704,0.000051539628,0.000037593745,0.00008804306,0.000040760206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092310984,0.00008828566,0.00007345309,0.00011011598,0.00009904124,0.00007454739,0.000022282491,0.000046474153,0.000004776191],"category_scores_gemma":[0.000008630896,0.00008918382,0.000021294847,0.00010596856,0.000012716,0.0006612324,0.000007741667,0.00004746192,0.000021763446],"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.0000034649706,0.0000052302566,0.000019532963,0.000117642376,0.00000704874,3.369171e-8,0.0013176095,0.96879995,0.00009187047,0.0054267356,0.00012215614,0.024088698],"study_design_scores_gemma":[0.0010856319,0.00002685421,0.0002284685,0.000049062823,0.00000470862,0.0000068014306,0.00011265916,0.9911222,0.00042205205,0.0014060329,0.005403754,0.00013180761],"about_ca_topic_score_codex":0.0000038093337,"about_ca_topic_score_gemma":0.0000018251005,"teacher_disagreement_score":0.8901295,"about_ca_system_score_codex":0.000031756088,"about_ca_system_score_gemma":0.000013226479,"threshold_uncertainty_score":0.36368108},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2627982,0.000027033402,0.7321746,0.0005910374,0.0004544833,0.00009384855,7.9631786e-7,0.0002870847,0.0035729534],"genre_scores_gemma":[0.99384844,0.0000032948242,0.0050472827,0.0009267452,0.00006124143,0.0000015266698,0.00005915505,0.0000015562013,0.000050747214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994728,0.000022276967,0.00016828932,0.00006757806,0.00016513403,0.000103944294],"domain_scores_gemma":[0.9997192,0.000065469765,0.00008750928,0.000044599245,0.000041917512,0.000041279756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026639336,0.00005997188,0.000046630536,0.00015577521,0.00022421005,0.000170735,0.000074100826,0.00002233766,0.0000030601236],"category_scores_gemma":[0.000025713838,0.00005643554,0.000016004784,0.00012795781,0.000013925305,0.0013734993,0.00003494434,0.00015640426,0.00008680779],"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.000011581838,0.000024623965,0.0007492849,0.000015428037,0.00001038869,0.0000023401415,0.0027288785,0.022481868,0.00011815375,0.20337583,0.000502119,0.7699795],"study_design_scores_gemma":[0.00049083686,0.00012273077,0.043940797,0.000014337101,0.000001590295,0.000021099124,0.00022479627,0.94763327,0.00024294113,0.002671472,0.004509069,0.00012707981],"about_ca_topic_score_codex":0.0000125259,"about_ca_topic_score_gemma":6.863483e-7,"teacher_disagreement_score":0.9251514,"about_ca_system_score_codex":0.00002165286,"about_ca_system_score_gemma":0.00001026756,"threshold_uncertainty_score":0.23013745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007302597,0.000014996958,0.99086326,0.00025316185,0.00012969975,0.00023245218,0.0000033154215,0.000069437236,0.0011310646],"genre_scores_gemma":[0.9273192,0.0000019297033,0.07246639,0.00012474904,0.000010845042,0.000014811412,0.00004671376,0.0000015669193,0.000013773004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945414,0.00002177908,0.00023403374,0.000054770808,0.00016707207,0.00006821998],"domain_scores_gemma":[0.9993957,0.000030752883,0.00013490388,0.000058850066,0.00033314846,0.00004661291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030337938,0.00004388071,0.00006744005,0.000106608284,0.000054360633,0.0002207404,0.00007191312,0.000024371993,1.3067526e-7],"category_scores_gemma":[0.000027607572,0.00004112409,0.00001699131,0.00014162537,0.000010873482,0.0030558433,0.000030689196,0.00002051855,0.0000038254375],"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.000039306968,0.00002499856,0.00010811262,0.00032303866,0.000013670867,2.0712929e-7,0.0073904945,0.37897646,0.000097953525,0.527002,0.001065934,0.084957875],"study_design_scores_gemma":[0.0005842192,0.00009141733,0.00022778836,0.00003160623,0.0000020179236,0.000007636576,0.0004543272,0.9963929,0.00022484193,0.0016548552,0.00027674533,0.000051638253],"about_ca_topic_score_codex":0.000011710924,"about_ca_topic_score_gemma":7.1956725e-7,"teacher_disagreement_score":0.92001665,"about_ca_system_score_codex":0.000044306573,"about_ca_system_score_gemma":0.00007593094,"threshold_uncertainty_score":0.22154126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009397312,0.0000314538,0.98665285,0.0007936696,0.00008367066,0.00055817916,0.000004042428,0.00011027859,0.0023685559],"genre_scores_gemma":[0.95110136,0.000006374371,0.048539996,0.0002145487,0.000028657838,0.00008003114,0.000016435382,0.0000026290663,0.00000994445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930423,0.000030005795,0.00023579338,0.00008745963,0.00020353677,0.00013897177],"domain_scores_gemma":[0.99932086,0.00022615363,0.0001334817,0.00009380203,0.00020344359,0.000022231847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052591553,0.00007193493,0.000060264967,0.000093189876,0.0003151383,0.00037168057,0.00012856255,0.000029062403,0.0000021977635],"category_scores_gemma":[0.000028139099,0.000052511736,0.000026975875,0.00020878586,0.00007244126,0.0015873589,0.00004263943,0.000069842965,0.0000075605776],"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.0000068677464,0.000002782664,0.00014083798,0.000014855412,0.0000036705992,5.5375644e-8,0.00034337438,0.0053155995,0.000027310649,0.5300096,0.00010543714,0.46402955],"study_design_scores_gemma":[0.0004622655,0.000037248108,0.01192595,0.000010280005,0.0000031316688,0.000014928755,0.00020031446,0.67609096,0.0001657375,0.30693763,0.0040661693,0.00008537693],"about_ca_topic_score_codex":0.00005651456,"about_ca_topic_score_gemma":0.000010243981,"teacher_disagreement_score":0.9417041,"about_ca_system_score_codex":0.000029498826,"about_ca_system_score_gemma":0.000045370838,"threshold_uncertainty_score":0.3584124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10489377,0.000030468338,0.8909437,0.00046624814,0.00012436521,0.00006755405,2.7399213e-7,0.00010400676,0.003369583],"genre_scores_gemma":[0.98551685,0.0000016479102,0.014176156,0.00016001631,0.000059440317,0.0000054354864,0.000025511134,0.0000013950979,0.00005352554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995428,0.00002534081,0.00014606249,0.00006702237,0.00013197401,0.00008682544],"domain_scores_gemma":[0.9997755,0.000022884313,0.000086628796,0.000043640073,0.000047565274,0.000023747738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013934348,0.000053979787,0.000046311518,0.000103464605,0.00013526864,0.00021317958,0.00006503161,0.00002231269,0.0000034299676],"category_scores_gemma":[0.000008720217,0.000050524253,0.000013510231,0.00015201214,0.000009316968,0.00061399426,0.000037173333,0.00007445907,0.00008144602],"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":[9.910004e-7,0.0000089156665,0.00057428196,0.00000833326,0.0000011283099,4.213449e-7,0.0014375967,0.08523058,0.0000047812987,0.012373021,0.0000839677,0.900276],"study_design_scores_gemma":[0.00017967154,0.000025760866,0.019854143,0.000005989359,8.6279914e-7,0.000008760415,0.00003686871,0.9670899,0.00002238568,0.00033067976,0.012380088,0.000064878455],"about_ca_topic_score_codex":0.00007052625,"about_ca_topic_score_gemma":6.1400186e-7,"teacher_disagreement_score":0.9002111,"about_ca_system_score_codex":0.000009894669,"about_ca_system_score_gemma":0.0000076063325,"threshold_uncertainty_score":0.20603192},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098627895,0.00015246044,0.89996904,0.00004444701,0.000060377966,0.000105315936,0.0000043636906,0.00008073826,0.0009553489],"genre_scores_gemma":[0.7530189,0.00006535174,0.24676551,0.00010439641,0.0000075346143,0.000007921097,0.000022076822,0.0000018167179,0.0000064848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950254,0.000019647221,0.0001979928,0.00008941994,0.00010642885,0.00008395679],"domain_scores_gemma":[0.99964106,0.000020730213,0.00013013063,0.00007573687,0.00008524064,0.000047081056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009469156,0.00008034357,0.0000895392,0.00006654457,0.00013151202,0.000089717985,0.000053498356,0.0000218209,0.000002169217],"category_scores_gemma":[0.0000025557938,0.000063053434,0.0000070582564,0.00009212851,0.000043651922,0.0031891055,0.0000366705,0.00004223802,0.000004838817],"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.000034710196,0.000020204596,0.00087871536,0.000106632884,0.000018539537,0.000001928294,0.018284006,0.02792094,0.000011465419,0.760306,0.000098283956,0.19231859],"study_design_scores_gemma":[0.00046268638,0.00007638219,0.00074806355,0.00002935518,0.0000033578124,0.0000333647,0.00037836577,0.992198,0.000112048576,0.0018439735,0.003986885,0.00012751209],"about_ca_topic_score_codex":0.000091644484,"about_ca_topic_score_gemma":0.0000054995926,"teacher_disagreement_score":0.9642771,"about_ca_system_score_codex":0.0000047019594,"about_ca_system_score_gemma":0.00001641021,"threshold_uncertainty_score":0.25712442},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25030616,0.00013971848,0.74334913,0.0004679605,0.00033201577,0.00016047798,0.0000014302699,0.00006925565,0.005173821],"genre_scores_gemma":[0.99671346,0.000008853742,0.0029534695,0.0002678416,0.00002773525,0.0000033029266,0.0000042677543,0.0000010700842,0.000019987383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955046,0.000036202677,0.00018561853,0.000047774523,0.00008076816,0.000099177065],"domain_scores_gemma":[0.99975723,0.00003870626,0.00006823255,0.000047197092,0.000042391006,0.000046234498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032725988,0.000050686922,0.00007000796,0.00009084817,0.00005233555,0.000099381155,0.00003811276,0.000035055757,0.0000041041794],"category_scores_gemma":[0.00001006571,0.000046650086,0.000008806982,0.000119746896,0.000013624242,0.0017896842,0.00003307397,0.00005010038,0.00004822103],"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.000058124264,0.00011530269,0.034176745,0.00015134817,0.000024716666,0.0000031663142,0.05296373,0.0076459087,0.00010606065,0.56139815,0.0042137005,0.33914304],"study_design_scores_gemma":[0.00042293122,0.00002977468,0.0140613355,0.00001955467,9.656824e-7,0.000045356446,0.00016661342,0.97976977,0.000016820806,0.0004565587,0.0049221157,0.00008818291],"about_ca_topic_score_codex":0.000032077805,"about_ca_topic_score_gemma":0.0000037285276,"teacher_disagreement_score":0.97212386,"about_ca_system_score_codex":0.000016577444,"about_ca_system_score_gemma":0.000008674728,"threshold_uncertainty_score":0.19023353},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23945703,0.000011047362,0.75978225,0.00009270703,0.00018889653,0.00009531406,0.0000023584846,0.000020786534,0.00034959152],"genre_scores_gemma":[0.9944777,0.0000055218266,0.005318783,0.00015409506,0.000021735905,0.0000034323791,0.000009350582,0.0000017876956,0.000007586715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993966,0.000011511963,0.00031504946,0.00004695234,0.00014313366,0.000086712134],"domain_scores_gemma":[0.9993218,0.00024716073,0.00021801231,0.00009147206,0.000103212704,0.00001833631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068429264,0.00005233076,0.000071511604,0.000061557075,0.000096016614,0.00006339115,0.00013890363,0.000027946524,0.0000042897154],"category_scores_gemma":[0.000019230709,0.000039153878,0.00003486376,0.00013222269,0.000031216525,0.000876549,0.00004564517,0.00003960619,0.0000027683727],"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.000028908487,0.000023506342,0.0004908181,0.00006442473,0.00001769829,1.1564756e-7,0.0070967684,0.00072890153,0.00010413711,0.04790017,0.00013204096,0.9434125],"study_design_scores_gemma":[0.000775888,0.00007223653,0.010430936,0.000041215164,0.000009697778,0.000012663733,0.0014960541,0.9746579,0.0024084013,0.008091282,0.0018955524,0.00010818038],"about_ca_topic_score_codex":0.000020638941,"about_ca_topic_score_gemma":0.0000025709282,"teacher_disagreement_score":0.973929,"about_ca_system_score_codex":0.000009751252,"about_ca_system_score_gemma":0.000016686494,"threshold_uncertainty_score":0.15966488},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004720277,0.000097183,0.98944837,0.0017943929,0.00080710114,0.00088414655,0.00003635282,0.00021268043,0.0019995258],"genre_scores_gemma":[0.88305444,0.00003391914,0.11536434,0.0006240198,0.00014214497,0.00016713607,0.00053051766,0.000009183022,0.000074303694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900913,0.00004102015,0.00037427133,0.00020952601,0.00020527706,0.00016074635],"domain_scores_gemma":[0.9985922,0.000109795365,0.00060898514,0.00039524393,0.00022788407,0.000065871995],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005214862,0.0001841064,0.0002513132,0.000140879,0.0003428609,0.0012695374,0.0005292969,0.00014360622,0.0000023508796],"category_scores_gemma":[0.000077029465,0.0001746421,0.00008516737,0.00004052464,0.00006751999,0.0015309611,0.00052548834,0.00016394597,0.000015478092],"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.000072783674,0.000035300734,0.000030967236,0.0006938706,0.000049455328,6.49143e-7,0.0040393663,0.009654651,0.000007857171,0.29124454,0.004980309,0.68919027],"study_design_scores_gemma":[0.0010489852,0.00003011593,0.00074868323,0.000073533534,0.000008305564,0.000005946127,0.000033664583,0.77111846,0.00010691356,0.22013162,0.006506957,0.00018681862],"about_ca_topic_score_codex":0.000030373589,"about_ca_topic_score_gemma":0.0000034480186,"teacher_disagreement_score":0.87833416,"about_ca_system_score_codex":0.000034859724,"about_ca_system_score_gemma":0.00010586142,"threshold_uncertainty_score":0.99976724},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13507317,0.00002692045,0.8615582,0.00024560376,0.00018000779,0.000075392694,7.0116283e-7,0.00008225984,0.0027577463],"genre_scores_gemma":[0.9739371,0.000006873061,0.025931055,0.000088373075,0.00001938085,0.0000054232237,0.000004261753,0.0000017218588,0.000005836318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940956,0.000013961324,0.00021984169,0.00009001444,0.00017606866,0.00009056748],"domain_scores_gemma":[0.9994503,0.000013967624,0.00016954953,0.00019427446,0.000132431,0.0000394522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018928919,0.00007099854,0.000080223195,0.000080598795,0.0003387008,0.0010149494,0.00030443555,0.000027134836,7.388855e-7],"category_scores_gemma":[0.000019850057,0.000059252554,0.000012787368,0.000044519948,0.000022173348,0.004906922,0.00008924445,0.00005749544,0.000016558983],"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.000009398315,0.000008067144,0.00039457396,0.000043599233,0.000010361459,0.0000010663372,0.004722738,0.22528242,0.0000059927816,0.025371073,0.000044093762,0.7441066],"study_design_scores_gemma":[0.00033653376,0.00003494179,0.00052224804,0.00004866436,0.0000018623117,0.000021557851,0.00013059846,0.9977042,0.000016692495,0.00093912106,0.0001580844,0.00008550141],"about_ca_topic_score_codex":0.000031327116,"about_ca_topic_score_gemma":0.0000050565404,"teacher_disagreement_score":0.8388639,"about_ca_system_score_codex":0.000015387166,"about_ca_system_score_gemma":0.000031364638,"threshold_uncertainty_score":0.97871804},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028347766,0.000039268063,0.9666452,0.0007421272,0.0002945493,0.0001388684,5.380327e-7,0.00014782668,0.0036438662],"genre_scores_gemma":[0.99693215,0.000011477653,0.0025202986,0.00047449372,0.000012694761,0.0000056376434,0.0000044623944,0.000001469356,0.00003730373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994364,0.000034379536,0.0001959238,0.000095407035,0.0001314603,0.000106434054],"domain_scores_gemma":[0.9996088,0.0000423029,0.00011168227,0.00009120031,0.000088845845,0.000057176014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019803409,0.000072871466,0.00008186913,0.00007040203,0.00013016826,0.00024811304,0.00009501638,0.00004085828,0.0000042857273],"category_scores_gemma":[0.000015855603,0.000049264345,0.000014928705,0.00008481609,0.00007701126,0.0014611407,0.00007178266,0.000031161555,0.00006567287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028082218,0.00000979176,0.0003434236,0.000014727609,0.000003508922,4.5184467e-7,0.00057477306,0.00000254026,0.000008190611,0.80189115,0.00019213371,0.1969565],"study_design_scores_gemma":[0.0017675642,0.0002728202,0.033885546,0.000012538836,0.000004712545,0.00006306538,0.00014672238,0.056033757,0.0000739054,0.8753798,0.03206558,0.0002939728],"about_ca_topic_score_codex":0.000016177333,"about_ca_topic_score_gemma":0.0000030602246,"teacher_disagreement_score":0.9685844,"about_ca_system_score_codex":0.000020273215,"about_ca_system_score_gemma":0.000019375311,"threshold_uncertainty_score":0.23925596},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016030384,0.0000072431035,0.9790093,0.0020906522,0.00010206721,0.00006836609,0.0000022477711,0.00018037415,0.0025093772],"genre_scores_gemma":[0.8855536,0.000018191766,0.11348429,0.0008533951,0.000030417596,0.00001215217,0.000015421085,0.0000020326204,0.00003048121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958986,0.000020312968,0.0001331257,0.00007477939,0.00009946284,0.000082466344],"domain_scores_gemma":[0.9996556,0.000060582315,0.00007480381,0.00007140196,0.000103387174,0.00003420074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008637387,0.0000533784,0.000048450253,0.00010286925,0.00008787307,0.000083876694,0.000084887346,0.000024691482,0.000010090169],"category_scores_gemma":[0.000007978251,0.00003473516,0.000009918739,0.00015115121,0.000038169597,0.0019437332,0.00003517844,0.000026861728,0.00007710772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069332987,0.000005433898,0.0000761485,0.000007742848,0.0000033791296,3.5695604e-7,0.0003689828,0.000018387273,0.000009212534,0.025402045,0.00018687172,0.9739145],"study_design_scores_gemma":[0.0057041994,0.0012047156,0.04646429,0.00033405222,0.000018949337,0.0005175377,0.0005402028,0.48280612,0.001530095,0.4060274,0.053860296,0.0009921432],"about_ca_topic_score_codex":0.000010366204,"about_ca_topic_score_gemma":0.0000027683607,"teacher_disagreement_score":0.9729224,"about_ca_system_score_codex":0.000011089784,"about_ca_system_score_gemma":0.00001767015,"threshold_uncertainty_score":0.14164586},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05918144,0.00003731483,0.9393523,0.000820134,0.0000746855,0.00013550879,0.000024011617,0.00020065732,0.00017395186],"genre_scores_gemma":[0.9619388,0.000034399425,0.03764168,0.00030846318,0.000019077343,0.0000092059245,0.00002937712,0.000003627031,0.000015347598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999219,0.00003297569,0.00029107655,0.0001349069,0.00018190587,0.00014013577],"domain_scores_gemma":[0.9993379,0.00016674187,0.00016412097,0.00018599513,0.00006176982,0.00008346703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021916676,0.00010528402,0.000115243645,0.00012338448,0.00015834803,0.00035445753,0.00020815102,0.000038338476,0.0000017506067],"category_scores_gemma":[0.000036653088,0.00007327677,0.000016043628,0.00010979541,0.00003245411,0.0029560765,0.00031705917,0.000049023012,0.00002136535],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045001507,0.000003965709,0.00024297101,0.000023043845,0.0000053469134,8.7594276e-7,0.0014954727,0.00007934416,0.0000127317835,0.008895049,0.00021767554,0.98901904],"study_design_scores_gemma":[0.0019091679,0.00009486603,0.014313,0.00014382612,0.000006313908,0.000033532182,0.00013340042,0.8910925,0.00016999828,0.08409957,0.0077123065,0.00029153813],"about_ca_topic_score_codex":0.000038542727,"about_ca_topic_score_gemma":0.0000022425525,"teacher_disagreement_score":0.9887275,"about_ca_system_score_codex":0.000015727255,"about_ca_system_score_gemma":0.000020400463,"threshold_uncertainty_score":0.3418042},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024310958,0.00008210936,0.9664227,0.00008622072,0.00007227381,0.00017482966,0.0000016867301,0.00013270506,0.030596398],"genre_scores_gemma":[0.9761586,0.000038288108,0.023274694,0.000396163,0.000028443852,0.000041509746,0.000025709498,0.0000019269835,0.00003465634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994938,0.000019724233,0.00019397256,0.000103330975,0.00009036772,0.00009881067],"domain_scores_gemma":[0.9996003,0.000028639633,0.00009958493,0.0000922124,0.00011306426,0.00006620248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011533624,0.00007612245,0.00006957349,0.00009803107,0.00020039857,0.00018496743,0.000109263034,0.0000435421,0.000009228129],"category_scores_gemma":[0.000013819937,0.00006950235,0.000014020768,0.00015991756,0.000048053233,0.0012026199,0.00007086067,0.000054540375,0.0000994518],"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.000002951927,0.000020804153,0.00023595779,0.000022377582,0.000004368632,3.0198066e-7,0.0029430788,0.000077965335,0.0000026783491,0.69708335,0.00022106452,0.29938507],"study_design_scores_gemma":[0.00076524186,0.00016982699,0.036482252,0.000016790087,0.000013026116,0.00009575059,0.00033899228,0.6130784,0.00007835913,0.335625,0.013008702,0.0003276417],"about_ca_topic_score_codex":0.000018752613,"about_ca_topic_score_gemma":0.0000031767843,"teacher_disagreement_score":0.9737275,"about_ca_system_score_codex":0.00001419718,"about_ca_system_score_gemma":0.00002549696,"threshold_uncertainty_score":0.28342235},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12285269,0.0000020809714,0.87290865,0.00075664493,0.00043733278,0.00016105216,0.0000024416174,0.0001514862,0.0027276427],"genre_scores_gemma":[0.97670543,6.5048897e-7,0.022481516,0.00066178374,0.00003377655,0.0000051171855,0.00009527517,0.0000031248258,0.000013329585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992462,0.00002849013,0.00027462316,0.00012744588,0.00021166974,0.00011157445],"domain_scores_gemma":[0.99927336,0.0001502217,0.00019434986,0.00016496351,0.00014837395,0.000068729074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043126955,0.0000973888,0.00007276778,0.00021336571,0.00027322813,0.00028707046,0.00010125857,0.000093423645,0.0000073217184],"category_scores_gemma":[0.00006136997,0.000095622236,0.000022693268,0.0002807383,0.000025719957,0.0014033896,0.000017701384,0.00021702884,0.00008740594],"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.00016390285,0.00009093454,0.003583449,0.0001121573,0.000014052306,0.00003876381,0.008275832,0.232189,0.0008122813,0.04531164,0.0031044928,0.7063035],"study_design_scores_gemma":[0.0005213178,0.00007682353,0.006262338,0.00001609492,0.000003333768,0.000099851044,0.00006522298,0.99119425,0.00013833199,0.0005345043,0.00097161415,0.00011633192],"about_ca_topic_score_codex":0.000016443508,"about_ca_topic_score_gemma":0.0000025637453,"teacher_disagreement_score":0.85385275,"about_ca_system_score_codex":0.000019126006,"about_ca_system_score_gemma":0.000063884145,"threshold_uncertainty_score":0.38993615},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2624485,0.000026846707,0.086313985,0.00034433897,0.0023164926,0.0003420604,0.000012878479,0.0009894293,0.6472055],"genre_scores_gemma":[0.95371073,0.00006645458,0.004347903,0.0009858086,0.028635245,0.000037831916,0.0020380437,0.00003915374,0.010138796],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996182,0.000008035747,0.00017051456,0.0000289578,0.000106080355,0.0000682619],"domain_scores_gemma":[0.99988955,0.0000064554206,0.000024838966,0.000026606087,0.000030930376,0.000021617423],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007835805,0.000052844858,0.000044255958,0.00008380656,0.000053092852,0.00007744485,0.000016917329,0.000033355074,0.0062577515],"category_scores_gemma":[0.0000023430925,0.000057522415,0.0000115763105,0.00004731241,0.000010448933,0.00063421973,0.0000036460485,0.00003412,0.013464996],"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.000001992775,0.000003022932,0.000017007014,0.00001192108,0.0000018944554,5.4082683e-8,0.00033899234,0.1086259,0.0000830727,0.000049504568,0.7793283,0.11153836],"study_design_scores_gemma":[0.0001936461,0.0000053313365,0.010799596,0.0000030395731,0.000002401923,0.0000018911763,0.00003764494,0.46199638,0.00002710291,0.00023965091,0.5266295,0.00006383719],"about_ca_topic_score_codex":6.753386e-7,"about_ca_topic_score_gemma":0.000003321887,"teacher_disagreement_score":0.6912623,"about_ca_system_score_codex":0.00003320655,"about_ca_system_score_gemma":0.000004998611,"threshold_uncertainty_score":0.99465066},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021023797,0.0000040373634,0.9224417,0.00064444495,0.0017196967,0.00009225916,0.000006665532,0.00016346814,0.0539039],"genre_scores_gemma":[0.9961641,0.00000386533,0.0032216453,0.00042970735,0.000055046225,0.0000047283024,0.0000701,0.0000014293383,0.000049393955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993627,0.000032148968,0.00022241552,0.000100210615,0.00019057348,0.00009196525],"domain_scores_gemma":[0.99949104,0.0000567462,0.00013196639,0.00011252856,0.00015507457,0.000052654857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028411506,0.000079713405,0.00006571686,0.00010018192,0.000096438984,0.00047382302,0.00027111085,0.000044804703,0.000028238292],"category_scores_gemma":[0.000032845015,0.00007235833,0.000019587389,0.00010269155,0.000026022737,0.0010764911,0.00005871833,0.00013973199,0.00018133681],"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.0000042070305,0.000010544324,0.00006427565,0.000004369014,0.0000055485602,3.0119108e-7,0.00081558066,0.00046754858,0.00003555036,0.7943659,0.00066231773,0.2035639],"study_design_scores_gemma":[0.0005091553,0.000061032362,0.0038996045,0.000019930372,0.0000018739964,0.000029459263,0.0001042767,0.93403184,0.00005334826,0.035270896,0.025854187,0.00016438417],"about_ca_topic_score_codex":0.000004810547,"about_ca_topic_score_gemma":8.399191e-7,"teacher_disagreement_score":0.9751403,"about_ca_system_score_codex":0.000008010996,"about_ca_system_score_gemma":0.000037671558,"threshold_uncertainty_score":0.45690864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20797922,0.000005116346,0.78861815,0.0003142045,0.00011674535,0.0015869294,0.000003670778,0.00018044072,0.0011955043],"genre_scores_gemma":[0.99118865,9.3774355e-7,0.008537802,0.00006866765,0.000011344185,0.00018147349,0.000007474339,0.0000015384858,0.0000020888451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999254,0.000033626795,0.00035977483,0.00009714875,0.00014658486,0.00010885207],"domain_scores_gemma":[0.99959844,0.000044222124,0.00016735193,0.00008254169,0.000073114694,0.000034301855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024699196,0.00006651701,0.00008670265,0.00011947629,0.00005968124,0.00017600835,0.00008415095,0.000038500202,0.0000012353288],"category_scores_gemma":[0.000030631734,0.00005044078,0.000013185174,0.00023291714,0.000009734851,0.002640803,0.000033562912,0.000032040727,0.000013813953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048139964,0.000011755471,0.12218329,0.000055266875,0.0000030918484,4.826063e-7,0.0012650965,0.00031937234,0.000024582185,0.097733505,0.00006872574,0.77833],"study_design_scores_gemma":[0.0026816356,0.00008345417,0.29644138,0.00045625598,0.0000020130074,0.00005316341,0.0005091414,0.68323666,0.00019244608,0.008047464,0.007874188,0.00042222213],"about_ca_topic_score_codex":0.00002355751,"about_ca_topic_score_gemma":0.000009198323,"teacher_disagreement_score":0.78320944,"about_ca_system_score_codex":0.00008397837,"about_ca_system_score_gemma":0.000022478158,"threshold_uncertainty_score":0.20569153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06290281,0.00006486051,0.93473715,0.00019323212,0.0003672738,0.00029276256,0.000020069645,0.000125999,0.0012958642],"genre_scores_gemma":[0.950083,0.000004775802,0.04913126,0.0004777325,0.000055410666,0.00003066337,0.00019936879,0.0000030277772,0.000014773386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992089,0.00003563255,0.00032578473,0.00009568906,0.00014945051,0.00018454515],"domain_scores_gemma":[0.99933916,0.00012012589,0.00022751898,0.00010119575,0.00013380944,0.000078189165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033148567,0.000097824006,0.00011013795,0.000101719226,0.00018645795,0.00018285224,0.00012370147,0.00005080846,6.6998234e-7],"category_scores_gemma":[0.000037075773,0.000086387096,0.000031253465,0.0001306334,0.000017670725,0.0036477756,0.00007525578,0.000047089106,0.000018139248],"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.0001667506,0.0001237894,0.00035596036,0.00007804953,0.000021521057,1.8296485e-7,0.032856185,0.0021992316,0.0010486325,0.10823384,0.008015941,0.8468999],"study_design_scores_gemma":[0.0015173289,0.00012747459,0.024910795,0.0000508869,0.000008153359,0.000013042357,0.0008104132,0.9492148,0.012490517,0.0026795669,0.007928288,0.00024872457],"about_ca_topic_score_codex":0.0000038801563,"about_ca_topic_score_gemma":1.9738555e-7,"teacher_disagreement_score":0.9470156,"about_ca_system_score_codex":0.000030911437,"about_ca_system_score_gemma":0.000018007564,"threshold_uncertainty_score":0.35227636},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96618545,0.000013474425,0.013565668,0.00032675444,0.00012588264,0.00007561041,0.0000024339163,0.000013821856,0.01969092],"genre_scores_gemma":[0.99859315,0.0000114663835,0.00037466758,0.0007797052,0.000077901204,0.0000020298698,0.00010196024,0.0000020304701,0.00005711688],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996587,0.000014628701,0.00011552921,0.000075111384,0.00006247155,0.00007358057],"domain_scores_gemma":[0.99968946,0.0000069152165,0.00012250507,0.00010654408,0.00004560208,0.000028998124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010775405,0.000060766317,0.000048039492,0.000018465274,0.0001943894,0.00014622007,0.000071197435,0.00006711173,0.0000028890936],"category_scores_gemma":[0.00006446001,0.000048677462,0.000022615806,0.000010203315,0.000026471902,0.000020995209,0.000051538424,0.000035979494,0.00002470797],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020213018,0.00004640677,0.008143306,0.000032147163,0.000035634013,0.0000010866819,0.00026373015,0.000955225,0.025865022,0.0027443664,0.003004193,0.95870674],"study_design_scores_gemma":[0.003131704,0.0018212715,0.7402784,0.00009330613,0.00002096554,0.00003472377,0.0005685471,0.05643503,0.03888333,0.002216372,0.15567398,0.0008423748],"about_ca_topic_score_codex":0.000004339878,"about_ca_topic_score_gemma":0.0000015751772,"teacher_disagreement_score":0.9578644,"about_ca_system_score_codex":0.0000037018583,"about_ca_system_score_gemma":0.000008788605,"threshold_uncertainty_score":0.19850093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07964881,0.00007275016,0.91499186,0.00014565549,0.0003611524,0.0002528073,1.216247e-7,0.00010995997,0.0044168946],"genre_scores_gemma":[0.99021494,0.0000048330216,0.009401759,0.0002466153,0.000069374575,0.0000109353905,0.000036897494,0.0000022360684,0.000012376995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992275,0.00010724932,0.00024365104,0.000109209854,0.00023116516,0.00008120644],"domain_scores_gemma":[0.9991482,0.000050610997,0.0001986075,0.00008601831,0.00047434794,0.000042249976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016571,0.00007435447,0.00006809444,0.000120012504,0.0002280935,0.00034891508,0.00007672947,0.000047722544,0.0000048781935],"category_scores_gemma":[0.00007877909,0.00006644284,0.000008243652,0.00023691972,0.0000563091,0.0018851146,0.00005451156,0.00004429215,0.000065371365],"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.000006789173,0.00000442649,0.00029526214,0.000018778335,0.0000047031604,7.597798e-8,0.00625156,0.00009873931,0.00005226755,0.32588017,0.00010134319,0.6672859],"study_design_scores_gemma":[0.0004033641,0.00019164718,0.0086565185,0.0000049316022,0.000006934543,0.000014211768,0.00048834534,0.7547539,0.00010447157,0.23347521,0.0017852172,0.000115276525],"about_ca_topic_score_codex":0.000038006478,"about_ca_topic_score_gemma":0.000008499543,"teacher_disagreement_score":0.91056615,"about_ca_system_score_codex":0.000027763923,"about_ca_system_score_gemma":0.000054770444,"threshold_uncertainty_score":0.33645964},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06999975,0.000012990294,0.92630625,0.0004799254,0.0005970377,0.0008371134,0.000011116205,0.00029594975,0.0014598891],"genre_scores_gemma":[0.6926795,0.000002973101,0.30484706,0.0022214102,0.0000862763,0.00004637895,0.00009217691,0.0000072043695,0.00001700998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834645,0.00004597262,0.0005900747,0.00031965357,0.0003528611,0.00034500225],"domain_scores_gemma":[0.9985057,0.00020943642,0.00025308836,0.00030562808,0.0005938007,0.00013234897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044967348,0.00021775455,0.0002617266,0.00025123885,0.00036214307,0.0006719335,0.0004023627,0.00009988681,0.0000075712323],"category_scores_gemma":[0.000031596992,0.00022196642,0.00007396209,0.00040065113,0.00011274999,0.0022160744,0.00026918954,0.00010017002,0.00012635531],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006648315,0.00014085535,0.0003043986,0.00016150104,0.000047693717,6.04488e-7,0.0041750744,0.007102861,0.00014286714,0.009000192,0.0075677643,0.9712897],"study_design_scores_gemma":[0.0011383919,0.00041778877,0.02587815,0.00001882153,0.000008410789,0.000016027534,0.00007266635,0.9473068,0.000092311726,0.014177803,0.010604233,0.00026859445],"about_ca_topic_score_codex":0.000044824163,"about_ca_topic_score_gemma":0.000006960984,"teacher_disagreement_score":0.9710211,"about_ca_system_score_codex":0.000074906624,"about_ca_system_score_gemma":0.00007394753,"threshold_uncertainty_score":0.9051528},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10032751,0.000013351699,0.8981115,0.00026520537,0.00026504873,0.00015979464,0.000002218439,0.00012512061,0.0007302093],"genre_scores_gemma":[0.90661085,0.0000033120116,0.09275766,0.0005450576,0.000025701354,0.00001719885,0.00002564306,0.0000017648405,0.000012842646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999617,0.0000055534992,0.00015352994,0.00006397969,0.0000871492,0.00007283559],"domain_scores_gemma":[0.99962664,0.00010677108,0.00007344624,0.00008370013,0.00007717016,0.000032257984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020487179,0.000049391572,0.00005160111,0.00007274916,0.00008649929,0.00022896627,0.0001143628,0.000036001256,0.0000039778424],"category_scores_gemma":[0.000035823447,0.000042365693,0.000016353291,0.00007808711,0.000013833225,0.0013242151,0.000035166388,0.000046629368,0.00002428946],"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.000002819205,0.0000056053937,0.000043293752,0.000016167733,0.0000018432302,6.4319025e-8,0.00095050846,0.00024631576,0.00029802194,0.13603252,0.0005886855,0.86181414],"study_design_scores_gemma":[0.00050717196,0.000044268767,0.0033427663,0.000010834375,0.000001677509,0.000014711977,0.000114303904,0.92551726,0.0005019735,0.048963267,0.020883938,0.000097843644],"about_ca_topic_score_codex":0.000004335298,"about_ca_topic_score_gemma":0.0000028463396,"teacher_disagreement_score":0.9252709,"about_ca_system_score_codex":0.0000034676978,"about_ca_system_score_gemma":0.000013794049,"threshold_uncertainty_score":0.2207927},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06294493,0.000008756488,0.9271913,0.0008825895,0.000088061526,0.000048743383,8.420421e-7,0.00011946313,0.008715277],"genre_scores_gemma":[0.97856164,0.0000015286655,0.021130309,0.0002280595,0.000030651656,0.0000025639727,0.000013067947,0.0000017448132,0.000030452771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996075,0.000016599733,0.00010055746,0.00007058113,0.00012628853,0.00007849259],"domain_scores_gemma":[0.9995625,0.000033601027,0.00017135366,0.00014622141,0.000051888914,0.000034460696],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00014888399,0.00005754049,0.000053304517,0.00004124611,0.00039141238,0.001157342,0.00019346728,0.000017048867,0.000003434664],"category_scores_gemma":[0.000059075533,0.00004531063,0.000008647238,0.000027146749,0.000021200842,0.0016414725,0.000068681795,0.00006456042,0.000016516913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014158784,0.0000032869375,0.008370945,0.000020430933,0.0000042009237,0.0000017703019,0.0027937724,0.0010646608,0.0000010744031,0.005283864,0.00007152435,0.9823831],"study_design_scores_gemma":[0.0003728168,0.00004621999,0.15422419,0.00003962814,0.0000026519085,0.000023701245,0.0002690236,0.84162366,0.00002515321,0.00066598435,0.0025818057,0.00012514276],"about_ca_topic_score_codex":0.00024071113,"about_ca_topic_score_gemma":0.000016526661,"teacher_disagreement_score":0.9822579,"about_ca_system_score_codex":0.000005821386,"about_ca_system_score_gemma":0.0000109712155,"threshold_uncertainty_score":0.99987954},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.984699,0.00006266981,0.014629863,0.00008672063,0.00002523442,0.000117973716,0.000007836935,0.0000039357287,0.00036677686],"genre_scores_gemma":[0.99940467,0.00003240036,0.00048980146,0.000028309787,0.000008300319,0.0000023666792,0.000027574077,0.0000010756174,0.0000055179553],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9996583,0.00001546665,0.0001847456,0.000054715987,0.000043410007,0.000043354587],"domain_scores_gemma":[0.99966294,0.0000041211388,0.00015037916,0.00006993635,0.00009583974,0.000016812639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001236944,0.000042704552,0.00006818416,0.000017756687,0.00009474046,0.000029638564,0.000044058695,0.00004449326,9.654652e-7],"category_scores_gemma":[0.00004351303,0.00003242011,0.000016766815,0.000013633674,0.00012621825,0.000025601514,0.00003439552,0.000020316495,2.51276e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014587937,0.00009112939,0.054205995,0.0005325242,0.000049909737,7.2041395e-8,0.0012713064,0.0016995909,0.720545,0.0009894413,0.00004776877,0.22042136],"study_design_scores_gemma":[0.0012977882,0.0008337704,0.8030571,0.00011468297,0.000026872729,0.0000109393,0.00041413947,0.031586934,0.1593596,0.001532694,0.0015369667,0.00022853324],"about_ca_topic_score_codex":0.000016760532,"about_ca_topic_score_gemma":0.000008118632,"teacher_disagreement_score":0.74885106,"about_ca_system_score_codex":0.0000015787047,"about_ca_system_score_gemma":0.0000130738745,"threshold_uncertainty_score":0.13220537},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0538359,0.0000293573,0.94183534,0.00023097124,0.00078156625,0.00018982124,0.000001941293,0.00014515212,0.0029499363],"genre_scores_gemma":[0.88423795,0.000013471119,0.11548323,0.0001798408,0.00004591498,0.0000097136435,0.000021284834,0.0000028985592,0.000005696194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991556,0.000054916713,0.00034134462,0.00011529083,0.00021268422,0.00012021237],"domain_scores_gemma":[0.9991142,0.000031767107,0.00039040466,0.00027684856,0.00013451843,0.000052242405],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00045797875,0.000097815406,0.00010462748,0.00014119477,0.0007025623,0.0016821558,0.00030096,0.0000693198,0.0000013967592],"category_scores_gemma":[0.00007472731,0.00009737728,0.000024294659,0.00007579689,0.000037250964,0.0065077213,0.000053493182,0.00009994721,0.000033580745],"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.000024902343,0.000011239426,0.0002496043,0.00016934382,0.000017536442,9.075675e-7,0.009574367,0.05540326,0.0002375733,0.20538941,0.00011941226,0.72880244],"study_design_scores_gemma":[0.00041400365,0.00002851557,0.015102608,0.000039280752,0.000003901421,0.000026492342,0.00012376209,0.9792852,0.00034349822,0.002658311,0.0018473698,0.00012710142],"about_ca_topic_score_codex":0.000050833445,"about_ca_topic_score_gemma":0.000001505817,"teacher_disagreement_score":0.9238819,"about_ca_system_score_codex":0.00002626796,"about_ca_system_score_gemma":0.000025317004,"threshold_uncertainty_score":0.9993542},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027097285,0.000025481844,0.95827895,0.0002398164,0.00019210481,0.00006664002,5.9935536e-7,0.00023827417,0.013860856],"genre_scores_gemma":[0.9647955,0.000007779603,0.034333084,0.0008186159,0.000005686275,0.000004472786,0.000008832393,0.0000014911735,0.000024596826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995511,0.000029108607,0.00015694046,0.000063922686,0.000115039315,0.000083890016],"domain_scores_gemma":[0.99972016,0.000032410266,0.00006646724,0.00010272636,0.000040032977,0.000038220573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020194142,0.000055204542,0.00005118402,0.000079141806,0.00008843455,0.00023249789,0.00009912835,0.00002507395,0.0000059853865],"category_scores_gemma":[0.000026462532,0.000051021372,0.000015617352,0.00015346397,0.000010864445,0.0019538475,0.000027158827,0.000032217882,0.00009767753],"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":[8.996964e-7,0.0000075700545,0.00005519853,0.000008167655,0.0000031470297,3.679655e-7,0.00077320286,0.00033140118,0.000012591021,0.59762055,0.0007433203,0.4004436],"study_design_scores_gemma":[0.0006953179,0.000043542557,0.0031942152,0.000010303386,0.0000023038565,0.00004829923,0.00015503893,0.89308196,0.0003512068,0.06465684,0.037604526,0.00015643645],"about_ca_topic_score_codex":0.0000029305895,"about_ca_topic_score_gemma":2.483504e-7,"teacher_disagreement_score":0.9376982,"about_ca_system_score_codex":0.000010017287,"about_ca_system_score_gemma":0.000021894673,"threshold_uncertainty_score":0.22419824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20494735,0.000049579925,0.7870558,0.00028312026,0.00005004173,0.00018673508,0.0000018375613,0.00013230772,0.0072932215],"genre_scores_gemma":[0.9962361,0.000008064491,0.0027760214,0.00091036246,0.000009794045,0.00000976904,0.000015701118,0.0000011923795,0.00003300061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997218,0.000009362812,0.00008631779,0.000061345025,0.000074057396,0.000047078338],"domain_scores_gemma":[0.9997788,0.000049439208,0.000046847188,0.0000782408,0.000022842562,0.000023850258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007370739,0.000041103605,0.000039503117,0.00006560909,0.00004871401,0.00013104908,0.00006093546,0.000019188254,0.0000045103066],"category_scores_gemma":[0.00000343862,0.000036345864,0.0000066149264,0.000075432115,0.000008887541,0.00075966644,0.00003204327,0.00003070129,0.000118990516],"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.0000014428206,0.0000044966055,0.00012260406,0.000014603692,0.000001799319,5.8514246e-8,0.0006518221,0.00042717005,0.000015815593,0.49519548,0.00015164926,0.5034131],"study_design_scores_gemma":[0.0008300374,0.00014912071,0.03185308,0.000032137574,0.0000033540234,0.00002491223,0.00083260395,0.88412637,0.0001717267,0.060041066,0.02169232,0.00024329309],"about_ca_topic_score_codex":0.0000031486295,"about_ca_topic_score_gemma":2.0250572e-7,"teacher_disagreement_score":0.8836992,"about_ca_system_score_codex":0.0000063402504,"about_ca_system_score_gemma":0.000006511489,"threshold_uncertainty_score":0.15294221},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16906804,0.000009821654,0.8275332,0.00002207982,0.00012428299,0.00024656107,0.0000012743723,0.000055041004,0.0029396845],"genre_scores_gemma":[0.7305338,0.0000019356391,0.26937234,0.00004944666,0.0000052352298,0.000012442939,0.000017656766,0.0000013439627,0.000005805949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926823,0.00005662141,0.00029780268,0.000098089055,0.00019762183,0.00008164158],"domain_scores_gemma":[0.9993884,0.00003909513,0.00023255884,0.00015423825,0.00015772152,0.000027999891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002961256,0.00006857622,0.00010025558,0.00011079316,0.000036560552,0.00008273175,0.00018208829,0.000043187694,0.0000018366319],"category_scores_gemma":[0.00004048585,0.0000625274,0.0000196838,0.00020578467,0.000029566298,0.0019284292,0.000069471695,0.000052347536,0.000020152529],"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.000023983122,0.000055723205,0.00082241173,0.0003501252,0.000009116632,8.395182e-8,0.004954129,0.08880579,0.00025894263,0.69363195,0.000034712055,0.21105304],"study_design_scores_gemma":[0.00029347354,0.00006826128,0.010914953,0.000013387902,0.0000019609317,0.000008565894,0.00015907422,0.9789839,0.00045884235,0.008873766,0.00014280235,0.00008104673],"about_ca_topic_score_codex":0.0000063389243,"about_ca_topic_score_gemma":5.3306195e-8,"teacher_disagreement_score":0.8901781,"about_ca_system_score_codex":0.000017432778,"about_ca_system_score_gemma":0.000031739903,"threshold_uncertainty_score":0.2549793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25607112,0.000005367093,0.7383963,0.00046475037,0.00019898305,0.0001108753,0.0000053833373,0.00009920737,0.004648058],"genre_scores_gemma":[0.9922208,0.000014816799,0.0074851164,0.00023633042,0.000011039079,0.000005873298,0.000015209986,0.0000015085036,0.000009300689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949944,0.000017734124,0.00021726638,0.00006938834,0.00013296625,0.0000631772],"domain_scores_gemma":[0.9994564,0.000038297498,0.00014994654,0.00025033945,0.000078642646,0.000026353622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001487461,0.000060388244,0.000073457944,0.00010084683,0.00031832283,0.00038627646,0.00023734331,0.000028507,0.0000017921261],"category_scores_gemma":[0.00006314464,0.00005498251,0.000017558192,0.000039010858,0.000044953988,0.0019221964,0.00007497891,0.000033671433,0.00002850103],"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.0000057499574,0.000019885812,0.000062983614,0.000025975249,0.00000486601,3.893568e-7,0.0012099608,0.006103086,0.000088939494,0.2801812,0.00011121203,0.71218574],"study_design_scores_gemma":[0.00031897123,0.00008428093,0.024045525,0.000027703061,0.0000024403598,0.0000062213594,0.00007987358,0.9688855,0.0004209249,0.0056302734,0.00042733815,0.00007096407],"about_ca_topic_score_codex":0.000025087222,"about_ca_topic_score_gemma":0.0000018716545,"teacher_disagreement_score":0.9627824,"about_ca_system_score_codex":0.000009125053,"about_ca_system_score_gemma":0.000023016466,"threshold_uncertainty_score":0.37248728},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021185962,0.000012228788,0.97462595,0.0016939344,0.00010476224,0.00020224204,0.0000065598265,0.00016707448,0.0020012741],"genre_scores_gemma":[0.9723319,0.000032598848,0.026763797,0.00063989544,0.000010005139,0.00001314651,0.000026713053,0.0000026090547,0.00017937006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991816,0.000050692233,0.0002760012,0.00012466371,0.00023131892,0.0001356721],"domain_scores_gemma":[0.99940187,0.00007357955,0.000103546816,0.00013506853,0.00018468757,0.00010123195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024186744,0.0000787512,0.00008015567,0.000095355805,0.00015371612,0.00024055406,0.00015275742,0.000044551067,0.000014870113],"category_scores_gemma":[0.000057072448,0.00005610393,0.000018636516,0.00019523145,0.000041282037,0.002708924,0.00007988635,0.000041489024,0.00013848269],"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.000018345798,0.00006721608,0.0047406605,0.00002389,0.000012446475,4.0451576e-7,0.0028493674,0.0059401053,0.00029732002,0.031422906,0.009286766,0.9453406],"study_design_scores_gemma":[0.0011856074,0.00012259226,0.007145034,0.000024496387,0.000002211328,0.000011422965,0.000056724362,0.97839,0.00033611598,0.002646806,0.009887941,0.00019104707],"about_ca_topic_score_codex":0.000008980813,"about_ca_topic_score_gemma":0.0000016156466,"teacher_disagreement_score":0.9724499,"about_ca_system_score_codex":0.00003511434,"about_ca_system_score_gemma":0.00005186162,"threshold_uncertainty_score":0.23196684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42388493,0.000022029762,0.5717287,0.00025323645,0.00018675489,0.0003873691,0.0000024637068,0.00015397849,0.0033805375],"genre_scores_gemma":[0.9901097,0.000014838726,0.009361736,0.0004264463,0.000011573034,0.000011864891,0.000014860951,0.0000036325669,0.00004535666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905425,0.000049831146,0.0002771295,0.00014435472,0.00030348165,0.00017093097],"domain_scores_gemma":[0.9993858,0.00009759344,0.00014357199,0.00015916605,0.00014348372,0.00007038694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029006097,0.00010008388,0.000094741474,0.00019571882,0.00010360212,0.00026318038,0.0001318788,0.000054161563,0.000028149203],"category_scores_gemma":[0.00002009427,0.00009791937,0.000025414754,0.00030611962,0.000039877646,0.0031213553,0.00008557224,0.00012992103,0.00028199787],"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.000025466261,0.000023060167,0.01306507,0.00015428652,0.00003103499,0.0000010576841,0.004359804,0.043096744,0.0008018491,0.36316702,0.0003657462,0.57490885],"study_design_scores_gemma":[0.0011606546,0.00015563816,0.12005191,0.000048528647,0.000004235085,0.000073709096,0.00026455484,0.824671,0.00033918585,0.048544366,0.004398162,0.0002880794],"about_ca_topic_score_codex":0.000015336656,"about_ca_topic_score_gemma":0.000003086663,"teacher_disagreement_score":0.78157425,"about_ca_system_score_codex":0.000041515043,"about_ca_system_score_gemma":0.00004267799,"threshold_uncertainty_score":0.39930362},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37914506,0.00016000296,0.6196299,0.00035906627,0.00018430229,0.00011294889,0.000008942253,0.00013323058,0.00026650334],"genre_scores_gemma":[0.87669885,0.00017616282,0.12154654,0.0012596744,0.000031020852,0.000016233987,0.00025039288,0.0000053069593,0.000015802627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989709,0.00010103247,0.0003639752,0.00020032749,0.00019456756,0.00016917025],"domain_scores_gemma":[0.99930876,0.000045060835,0.0002455151,0.00019155952,0.00011662075,0.00009245187],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035958682,0.00016743591,0.00020009949,0.00013640338,0.00012856236,0.001244398,0.0002038191,0.00010130599,0.0000072781686],"category_scores_gemma":[0.000017089671,0.00017347776,0.0000391793,0.00011626446,0.000058400852,0.0011648296,0.0006857901,0.00020629751,0.0000056200624],"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.000025908335,0.000039152827,0.0005394025,0.000441006,0.00006356971,0.000009428703,0.02139747,0.018284064,0.00005462333,0.063117035,0.00053441676,0.8954939],"study_design_scores_gemma":[0.00040667102,0.000018300883,0.01817189,0.00006034945,0.0000065418285,0.000046477653,0.0001847785,0.91501683,0.000086879656,0.065285645,0.0005030955,0.0002125484],"about_ca_topic_score_codex":0.00013412896,"about_ca_topic_score_gemma":0.0000093133,"teacher_disagreement_score":0.89673275,"about_ca_system_score_codex":0.000045934823,"about_ca_system_score_gemma":0.00012576388,"threshold_uncertainty_score":0.9997924},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065384716,0.00013686008,0.93220466,0.00024629262,0.0002915382,0.00006274419,0.000009704062,0.000067170215,0.001596305],"genre_scores_gemma":[0.98328364,0.000012812452,0.01635524,0.00020542377,0.000021251704,0.0000029765354,0.00009855746,0.0000013132216,0.000018756646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933064,0.00003580404,0.00029135906,0.00006626989,0.0001845329,0.00009138394],"domain_scores_gemma":[0.99947447,0.000034087985,0.00014535178,0.00009613202,0.00021417,0.000035776146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019670223,0.000056984452,0.000091015965,0.00007172174,0.00008307779,0.00016868723,0.000100266814,0.000030314834,0.000006306862],"category_scores_gemma":[0.000013794612,0.000055539105,0.000023983584,0.00016526024,0.00003975134,0.0024512566,0.00008639615,0.000039801987,0.000021752578],"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.00000541961,0.000015771355,0.00011583594,0.00006247738,0.00000931669,7.4766115e-7,0.0009115541,0.003654013,0.00013862512,0.8931116,0.00060195057,0.10137269],"study_design_scores_gemma":[0.00037125146,0.00003687431,0.014002613,0.000027823415,0.0000027658614,0.00007457559,0.00030274247,0.9653954,0.0004235306,0.016716186,0.0025552667,0.000091003596],"about_ca_topic_score_codex":0.000019960358,"about_ca_topic_score_gemma":8.3585945e-7,"teacher_disagreement_score":0.9617413,"about_ca_system_score_codex":0.000013914899,"about_ca_system_score_gemma":0.00005318229,"threshold_uncertainty_score":0.2264819},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90680665,0.00019586502,0.09257566,0.00013359354,0.000056082303,0.00004370903,0.0000014441334,0.000019686117,0.0001673056],"genre_scores_gemma":[0.99554133,0.00002082676,0.004332119,0.0000914336,0.0000041814505,0.0000011622825,0.0000045117954,9.207189e-7,0.000003500763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995709,0.00002439471,0.00020537435,0.00004870979,0.00010775442,0.000042858035],"domain_scores_gemma":[0.9996096,0.000021536265,0.000118378346,0.000052695847,0.00018072996,0.000017085698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008991336,0.00004449743,0.00008092971,0.000053428917,0.00003544297,0.00006547579,0.00005527895,0.000019688137,9.608128e-7],"category_scores_gemma":[0.000025192734,0.00003621963,0.000012094829,0.00008937315,0.00003842671,0.0009663024,0.000053691925,0.000021547816,5.516608e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023477744,0.000019461942,0.0033154846,0.0005685399,0.000035275032,0.0000012720449,0.02296382,0.0005984497,0.015395246,0.15418234,0.000058174523,0.80283844],"study_design_scores_gemma":[0.00066350127,0.0000765782,0.062325034,0.00010726491,0.00000780123,0.000066351044,0.0010027728,0.7076394,0.20671527,0.021175448,0.000067384695,0.00015317863],"about_ca_topic_score_codex":0.000009862889,"about_ca_topic_score_gemma":7.8429173e-7,"teacher_disagreement_score":0.80268526,"about_ca_system_score_codex":0.0000026848136,"about_ca_system_score_gemma":0.000028762346,"threshold_uncertainty_score":0.14769937},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025767842,0.00015310521,0.9600124,0.00073844823,0.00057652325,0.00046473098,0.000011531617,0.00017687296,0.012098598],"genre_scores_gemma":[0.9586927,0.00012567584,0.0397212,0.0008786339,0.000032056585,0.00015775822,0.00029594335,0.000009166708,0.00008686525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998673,0.000114680486,0.00040116912,0.00021240613,0.00041442143,0.0001842798],"domain_scores_gemma":[0.9992657,0.00009513508,0.0002093932,0.00027140017,0.00009786046,0.000060541133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053536607,0.00013857693,0.0001524931,0.0005892758,0.00013066905,0.00034595054,0.00047856025,0.000082953346,0.000027411968],"category_scores_gemma":[0.000035219568,0.00015443741,0.000039591047,0.00039846858,0.00003339781,0.001516104,0.001347553,0.0005164007,0.000031317228],"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.000018328134,0.000028974768,0.00048335895,0.00015984035,0.000011267091,0.0000055051914,0.0051773717,0.18274596,0.0000034785323,0.29545897,0.00039741976,0.51550955],"study_design_scores_gemma":[0.00037079805,0.000041264015,0.0053319745,0.000020656968,0.0000015433804,0.000008093246,0.00020523461,0.6136641,0.0000139520325,0.3758167,0.004318576,0.00020708477],"about_ca_topic_score_codex":0.000023508026,"about_ca_topic_score_gemma":0.0000041069366,"teacher_disagreement_score":0.93292487,"about_ca_system_score_codex":0.00010850201,"about_ca_system_score_gemma":0.00012015314,"threshold_uncertainty_score":0.62977743},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3500902,0.000019794652,0.6491033,0.00016693544,0.000107780725,0.00012544983,0.000004927389,0.00007485557,0.00030674468],"genre_scores_gemma":[0.99811447,0.000033629618,0.0015183802,0.00021595562,0.000014559487,0.000017758299,0.00007026542,0.0000018442659,0.000013166102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994562,0.000028284838,0.00021544786,0.000098663964,0.00008660464,0.000114754985],"domain_scores_gemma":[0.9997123,0.000098449644,0.000058160054,0.000059145805,0.000040474482,0.00003150073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016699033,0.00006691307,0.00009400341,0.000090216214,0.00006391924,0.00024903595,0.000054978053,0.000041792297,5.5203384e-7],"category_scores_gemma":[0.000017172573,0.00005903398,0.0000070773185,0.00033545136,0.000026691925,0.0016287015,0.000031975345,0.000055535864,0.000007766217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004288539,0.000019857558,0.006884346,0.00009329331,0.000013074211,0.000018669383,0.0028202564,0.037736937,0.000014510231,0.0052003083,0.0005546851,0.94660115],"study_design_scores_gemma":[0.00043662958,0.00007604827,0.11944546,0.000046099838,0.0000021558494,0.00004799348,0.0001594868,0.87837887,0.0000061239775,0.0008817783,0.00041353304,0.00010583555],"about_ca_topic_score_codex":0.000018631834,"about_ca_topic_score_gemma":0.000017069286,"teacher_disagreement_score":0.94649535,"about_ca_system_score_codex":0.000013935028,"about_ca_system_score_gemma":0.000017326338,"threshold_uncertainty_score":0.24073358},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8686088,0.000010151616,0.056174405,0.00044976815,0.00016838592,0.00018650435,0.000010842279,0.00017569475,0.07421548],"genre_scores_gemma":[0.99874663,0.0000020887633,0.0010408631,0.00011430668,0.000013494342,0.0000036078,0.000035301226,0.000002784247,0.00004091154],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99969655,0.000007020619,0.00011515229,0.000030931136,0.00009676981,0.000053570042],"domain_scores_gemma":[0.99961984,0.0000075567414,0.00018080803,0.00009293432,0.000070398775,0.000028483933],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010622039,0.000039066465,0.00003604046,0.000046347373,0.00033460345,0.00041922278,0.00005701811,0.000019663245,0.000011370851],"category_scores_gemma":[0.00005069006,0.00003778647,0.000008162473,0.000016452681,0.00003044798,0.0027449806,0.000028683326,0.00002833445,0.0015139492],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004582799,0.000015410273,0.007640318,0.00004281603,0.000014376163,3.4823242e-7,0.0041095195,0.004140614,0.000173326,0.018991373,0.007846864,0.9569792],"study_design_scores_gemma":[0.0010264679,0.000032484553,0.6095224,0.00001618005,0.000006711007,0.000011050144,0.00024998267,0.33639336,0.0003312411,0.0035447488,0.0487207,0.00014465522],"about_ca_topic_score_codex":0.000024040915,"about_ca_topic_score_gemma":0.0000032408284,"teacher_disagreement_score":0.95683455,"about_ca_system_score_codex":0.000012469008,"about_ca_system_score_gemma":0.0000105735435,"threshold_uncertainty_score":0.99926347},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04062268,0.00002070504,0.9562367,0.0014064814,0.0001256306,0.000052277628,4.569031e-7,0.00005587972,0.0014791435],"genre_scores_gemma":[0.96019065,0.000009339059,0.039617214,0.00015624029,0.00001112845,0.0000016651416,0.0000061554765,8.7089506e-7,0.000006733685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995718,0.00001946173,0.00017863873,0.00004057696,0.00012432016,0.00006521025],"domain_scores_gemma":[0.99965817,0.00004283918,0.00012388747,0.000068246634,0.000086584834,0.00002029898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020101212,0.000040186766,0.000045585995,0.000046356992,0.0002098038,0.00014007295,0.000115685325,0.000015251801,5.6274314e-7],"category_scores_gemma":[0.00003188167,0.00002919826,0.000012523179,0.00017885622,0.000046882942,0.0006412926,0.000044359433,0.000056888966,0.000010110876],"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.0000026446764,0.000007642372,0.00017213075,0.000015299916,0.000004137119,1.2844534e-7,0.002487921,0.034194417,0.000008326788,0.47750038,0.000042606036,0.48556438],"study_design_scores_gemma":[0.00050719525,0.00005989323,0.01766394,0.000019208463,0.0000015474922,0.000013982306,0.0002241149,0.91958654,0.00017489001,0.058862977,0.00280367,0.00008203709],"about_ca_topic_score_codex":0.00006569637,"about_ca_topic_score_gemma":0.0000039394004,"teacher_disagreement_score":0.91956794,"about_ca_system_score_codex":0.000010823573,"about_ca_system_score_gemma":0.00003221907,"threshold_uncertainty_score":0.16136624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09860898,0.000019051198,0.8994272,0.0002598106,0.00011718548,0.00020705842,0.000015373844,0.00008871169,0.0012566812],"genre_scores_gemma":[0.9822358,0.00000813487,0.017355936,0.00020448868,0.000005848951,0.0000106454745,0.00015301496,0.0000025374652,0.000023596014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991206,0.000057805377,0.00026965645,0.00010638609,0.0003577813,0.00008776798],"domain_scores_gemma":[0.99940485,0.000058336183,0.0002542774,0.000150967,0.000090060305,0.000041530355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014056152,0.000075563694,0.00011253941,0.0001873985,0.0002656245,0.00013442288,0.00017654122,0.00001444158,0.000022286822],"category_scores_gemma":[0.000007869286,0.000057327412,0.000019845993,0.00052853086,0.000028104636,0.0019297438,0.00011049118,0.00007062158,0.000002297102],"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.0005828349,0.00018603564,0.0035567114,0.000091015296,0.00006121425,0.000006575192,0.010342702,0.07857634,0.0001351185,0.07470022,0.005679307,0.82608193],"study_design_scores_gemma":[0.0015954652,0.0006035382,0.023925131,0.000016703712,0.000008244373,0.00008541302,0.0009828409,0.962475,0.0003466268,0.004870439,0.0049222107,0.00016840258],"about_ca_topic_score_codex":0.00010177251,"about_ca_topic_score_gemma":0.0000053214585,"teacher_disagreement_score":0.8838987,"about_ca_system_score_codex":0.00002247369,"about_ca_system_score_gemma":0.000061512386,"threshold_uncertainty_score":0.2337744},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05432789,0.00002666892,0.9428116,0.00024820768,0.00009732231,0.000050580093,3.9536195e-7,0.00018005192,0.0022572842],"genre_scores_gemma":[0.9841419,0.000025969277,0.015158255,0.000624032,0.000013208359,0.0000028850097,0.000017872771,0.0000011354532,0.000014737573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963784,0.000013323507,0.00013444437,0.000051630686,0.000102441554,0.00006030907],"domain_scores_gemma":[0.9997713,0.000020146525,0.000060167316,0.00006532182,0.000055123084,0.000027926668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000709567,0.000042972148,0.000039878894,0.000076474375,0.00013583846,0.0000800368,0.00007944115,0.000021100526,0.00000389681],"category_scores_gemma":[0.000010416355,0.000040673953,0.0000097101665,0.0001521465,0.000017761795,0.0021603422,0.00003496126,0.00002597061,0.00007742059],"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.0000023254497,0.000012265897,0.0004986495,0.00001478832,0.000004387151,0.0000015473028,0.0038178414,0.0029664743,0.000019020981,0.15766704,0.0016661985,0.83332944],"study_design_scores_gemma":[0.00021693265,0.000022040691,0.011263124,0.0000046660634,7.1435545e-7,0.00008072636,0.000041439875,0.97952604,0.000086266424,0.0056692297,0.0030155536,0.00007327765],"about_ca_topic_score_codex":0.0000046137397,"about_ca_topic_score_gemma":1.4430876e-7,"teacher_disagreement_score":0.9765596,"about_ca_system_score_codex":0.000011556544,"about_ca_system_score_gemma":0.000020840253,"threshold_uncertainty_score":0.16586357},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04265694,0.00010461553,0.9561564,0.00032359062,0.00009958234,0.00044040242,0.000020013289,0.00001809552,0.00018040853],"genre_scores_gemma":[0.936751,0.00008502136,0.0576246,0.0006649269,0.0001536191,0.0002052474,0.0044401693,0.000010226425,0.0000651645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999513,0.000029267085,0.0002001836,0.00009459247,0.000073556264,0.00008943493],"domain_scores_gemma":[0.9995445,0.000013573965,0.000099916935,0.00009874427,0.00021388655,0.000029389385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017469523,0.00007214755,0.000056136072,0.000025913572,0.00012818952,0.00012158952,0.00004504441,0.000057497884,0.0000038048029],"category_scores_gemma":[0.000011142933,0.00006035194,0.000028040888,0.000062002306,0.000020712474,0.000052725387,0.000021349146,0.00003334698,0.0000037733982],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020764975,0.00003743283,0.000051864696,0.000039739076,0.000030815758,6.834093e-8,0.0005246653,0.0017813711,0.015324601,0.00021059497,0.00046709157,0.981511],"study_design_scores_gemma":[0.00078388344,0.00019700159,0.0010391037,0.0000062863414,0.000020505242,0.000010592564,0.0008710055,0.96926117,0.013228852,0.0007868974,0.013677327,0.00011734795],"about_ca_topic_score_codex":0.0000051100665,"about_ca_topic_score_gemma":0.000007765423,"teacher_disagreement_score":0.98139364,"about_ca_system_score_codex":0.000009596788,"about_ca_system_score_gemma":0.000034585435,"threshold_uncertainty_score":0.24610807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5418651,0.000010599228,0.45724514,0.0004007596,0.00010999882,0.00011447999,0.000006920859,0.0001148295,0.00013215492],"genre_scores_gemma":[0.9770028,0.00005306707,0.022054033,0.0003853371,0.00003741658,0.000006240474,0.00041289482,0.0000040062623,0.000044223907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939275,0.000015952823,0.00028236315,0.00008355391,0.00013360142,0.00009179157],"domain_scores_gemma":[0.9996668,0.000033863264,0.00014015051,0.00008083772,0.000033099168,0.000045254972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015097672,0.0000726027,0.000086653185,0.00020633628,0.00010978627,0.00016059738,0.00010054289,0.000020102569,0.00001988072],"category_scores_gemma":[0.000004640789,0.00007199845,0.000016303273,0.00025465884,0.000014612149,0.0017174159,0.00012338256,0.000030077987,0.0000328087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014111771,0.000019880976,0.0018857647,0.000121780264,0.00004001441,0.0000010129621,0.0065533207,0.0010582829,0.005159075,0.009351014,0.002672602,0.97312313],"study_design_scores_gemma":[0.00065950776,0.0000548002,0.072836086,0.000036058755,0.000007652431,0.000007144597,0.00017792641,0.917722,0.0015607593,0.005733191,0.0010739203,0.00013094388],"about_ca_topic_score_codex":0.00006175382,"about_ca_topic_score_gemma":0.000002106256,"teacher_disagreement_score":0.9729922,"about_ca_system_score_codex":0.00000823225,"about_ca_system_score_gemma":0.000021508622,"threshold_uncertainty_score":0.29360116},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1615186,0.000021439011,0.83732706,0.00059002737,0.000032098258,0.00033135965,0.000013170124,0.000051491403,0.00011472998],"genre_scores_gemma":[0.9949886,0.000022934664,0.0047405064,0.00016924378,0.0000069136677,0.000041006133,0.00002680736,0.0000013729127,0.0000025954903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958086,0.000013506954,0.00020759249,0.00005230477,0.00009907756,0.000046675897],"domain_scores_gemma":[0.99927205,0.00041598495,0.00014414905,0.00008607,0.0000683582,0.000013412567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025381637,0.000041776435,0.00006620191,0.00009616891,0.000087074666,0.000045726694,0.000101798934,0.000014797897,6.4982095e-7],"category_scores_gemma":[0.000029300707,0.000028662007,0.000015662117,0.00019391782,0.000068477086,0.0004718001,0.000048841343,0.000020501919,0.0000029996547],"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.0000041591593,0.0000067862734,0.000021926113,0.00005081667,0.0000027653537,6.8821646e-9,0.00042075192,0.0019688285,0.000051857536,0.75759536,0.00019505703,0.23968169],"study_design_scores_gemma":[0.00013257477,0.000036375175,0.0037950515,0.000016318705,0.000001265219,9.882887e-7,0.000058302703,0.56951916,0.00016654428,0.42593592,0.0003134338,0.000024055838],"about_ca_topic_score_codex":0.0000050322124,"about_ca_topic_score_gemma":8.349118e-7,"teacher_disagreement_score":0.83347,"about_ca_system_score_codex":0.0000030962628,"about_ca_system_score_gemma":0.000009799295,"threshold_uncertainty_score":0.11688027},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051082703,0.00023008272,0.98902947,0.0007328171,0.00035658386,0.00016525222,0.0000036500517,0.00043035537,0.003943546],"genre_scores_gemma":[0.9505805,0.000021973274,0.048849843,0.00036685038,0.00007547596,0.000010616519,0.000076741286,0.000004110668,0.000013923088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991642,0.000041500618,0.00022024286,0.00016913206,0.00027922707,0.00012568058],"domain_scores_gemma":[0.9995927,0.000058210124,0.00006686413,0.00010017368,0.0001303664,0.000051634997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028016613,0.00010042342,0.00008133728,0.00013043536,0.00022776205,0.0009715519,0.00014868373,0.000034750985,0.0000032851615],"category_scores_gemma":[0.00002886227,0.000084614876,0.000027351109,0.00025272305,0.00003040202,0.002979398,0.00009007073,0.00013772414,0.00005178497],"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.0000055564815,0.00001246222,0.0000135677565,0.000031423777,0.0000075082316,0.0000014774073,0.005771714,0.0019718192,0.00001938765,0.18766633,0.00067162036,0.80382717],"study_design_scores_gemma":[0.00014359028,0.000073155876,0.00065116736,0.00012219725,0.0000023336456,0.000011460527,0.0005056337,0.96911484,0.000057935053,0.016478376,0.0127159245,0.00012338691],"about_ca_topic_score_codex":0.000071542694,"about_ca_topic_score_gemma":0.0000018226006,"teacher_disagreement_score":0.967143,"about_ca_system_score_codex":0.000072101335,"about_ca_system_score_gemma":0.000036745358,"threshold_uncertainty_score":0.9368698},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022571329,0.00008523376,0.97353345,0.0010327064,0.00049704284,0.00034053298,0.000038410846,0.00019948414,0.001701824],"genre_scores_gemma":[0.8307593,0.000051177096,0.15990888,0.006464164,0.00007183025,0.00004488574,0.0022420057,0.000010139373,0.0004476559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988095,0.000050831735,0.00038925774,0.00028149612,0.00030390723,0.00016496798],"domain_scores_gemma":[0.99910504,0.00009645724,0.00014531794,0.0004239561,0.00013936748,0.000089843634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000252688,0.00013612601,0.00013475669,0.00027008087,0.00030308304,0.00045501802,0.0005415784,0.000058324265,0.000010510354],"category_scores_gemma":[0.000035369634,0.0001315386,0.000018441504,0.0005111073,0.000018662424,0.0036060342,0.0013033138,0.00008599809,0.00009542368],"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.000042268883,0.000044162407,0.00033045388,0.000076436576,0.000023428745,0.0000010044394,0.0012886368,0.04023317,0.00016594976,0.017440645,0.0768488,0.86350507],"study_design_scores_gemma":[0.00054741,0.000033452478,0.015648643,0.000039997223,0.0000051978122,0.0000037140005,0.00003777316,0.91882396,0.00013828433,0.0016284953,0.06295101,0.00014203206],"about_ca_topic_score_codex":0.000054071366,"about_ca_topic_score_gemma":0.00000794787,"teacher_disagreement_score":0.8785908,"about_ca_system_score_codex":0.00006597987,"about_ca_system_score_gemma":0.00006443724,"threshold_uncertainty_score":0.5363989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044486113,0.000013800818,0.9802252,0.0015330478,0.000093992676,0.00014921554,0.0000023848959,0.00005214616,0.013481606],"genre_scores_gemma":[0.9860568,0.0000057372836,0.011612576,0.0022252398,0.0000020461391,0.000019683945,0.000022964796,0.0000011383469,0.000053807347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993491,0.000048851656,0.00026687962,0.00007215559,0.00018803269,0.00007498029],"domain_scores_gemma":[0.999333,0.00023000175,0.00010849806,0.00009552817,0.00020874476,0.000024224426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019695886,0.00006291613,0.00006957245,0.00017785578,0.00012110573,0.0001361553,0.0001544613,0.000029767749,0.000016818018],"category_scores_gemma":[0.000031289255,0.000047249716,0.00002385292,0.00035757018,0.000050521296,0.00058574404,0.000053409032,0.000050570998,0.000008955317],"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.0000034865295,0.000012871298,0.000011834715,0.0000058758405,0.0000061002906,4.142529e-8,0.0004464563,0.32369772,0.0000022290014,0.6415595,0.0008518139,0.033402104],"study_design_scores_gemma":[0.0003159728,0.00006256624,0.00080059824,0.000020969368,0.0000012441086,0.0000013911418,0.00011384149,0.9431921,0.00006524435,0.054295395,0.0010805959,0.000050045135],"about_ca_topic_score_codex":0.0000046891682,"about_ca_topic_score_gemma":4.5953496e-7,"teacher_disagreement_score":0.9816082,"about_ca_system_score_codex":0.000013588139,"about_ca_system_score_gemma":0.000076562734,"threshold_uncertainty_score":0.19267875},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034897685,0.00057427294,0.9567411,0.0040495414,0.0002911683,0.00033494018,0.0000028690854,0.00021144097,0.0028969983],"genre_scores_gemma":[0.99460536,0.00034768178,0.004476411,0.00039831645,0.00000617392,0.00002362524,0.000041251067,0.0000018694665,0.000099300305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992994,0.000034236327,0.00028734448,0.00012658193,0.00013192545,0.00012052816],"domain_scores_gemma":[0.999441,0.000097717784,0.00012391502,0.00016835709,0.00012785706,0.000041149025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026717145,0.00008283719,0.000068329886,0.000084963474,0.00043333715,0.00058800174,0.0002215507,0.000049352155,8.4986317e-7],"category_scores_gemma":[0.000030305013,0.00005888576,0.000011583316,0.00037196974,0.000077814846,0.0018789192,0.00015570472,0.00009479062,0.000013789338],"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.000004186257,0.000008050503,0.0003804143,0.000029525767,0.000010308069,5.727883e-7,0.0008106557,0.0016542149,0.000072599934,0.19084404,0.00072981114,0.8054556],"study_design_scores_gemma":[0.00032608522,0.000029481647,0.024887888,0.000050120627,0.0000035382182,0.00002464783,0.00007044735,0.93262374,0.00008857296,0.03215058,0.009644996,0.00009988468],"about_ca_topic_score_codex":0.000042208198,"about_ca_topic_score_gemma":0.0000042559736,"teacher_disagreement_score":0.9597077,"about_ca_system_score_codex":0.000020409032,"about_ca_system_score_gemma":0.000048192374,"threshold_uncertainty_score":0.5670114},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15844497,0.000021893973,0.8371097,0.00019393263,0.00011667876,0.000051696068,0.0000017116726,0.00006972078,0.003989735],"genre_scores_gemma":[0.9849246,0.00001776501,0.014808776,0.0002157046,0.000004794701,9.150696e-7,0.000009536936,7.399179e-7,0.000017171194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961454,0.00001735568,0.00017795734,0.00005773715,0.00008014007,0.0000522739],"domain_scores_gemma":[0.9996947,0.00006927371,0.00010337842,0.00006588274,0.00004973987,0.000017025774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012759831,0.00004491891,0.000061151535,0.00014984481,0.000060147853,0.000110281915,0.000093748946,0.000020622263,0.0000011626795],"category_scores_gemma":[0.000017249034,0.000044168133,0.000011051558,0.0001519442,0.000025370118,0.0011361433,0.00010225627,0.000028649743,0.0000019253591],"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.000006153461,0.00000829973,0.00031904035,0.00006299335,0.000010523016,3.6170303e-7,0.0014646836,0.0019552049,0.000045270408,0.26743203,0.00010954188,0.7285859],"study_design_scores_gemma":[0.0004362587,0.000022886266,0.0071308897,0.00003784655,0.00000323842,0.0000031700804,0.00012975535,0.98143345,0.00020823548,0.009828011,0.00072030094,0.000045942164],"about_ca_topic_score_codex":0.000023359067,"about_ca_topic_score_gemma":6.646109e-7,"teacher_disagreement_score":0.97947824,"about_ca_system_score_codex":0.0000073509445,"about_ca_system_score_gemma":0.000020952051,"threshold_uncertainty_score":0.18011242},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03739016,0.00009093558,0.9607361,0.00065627694,0.0001862204,0.00054451096,0.000012217419,0.00014047667,0.00024310533],"genre_scores_gemma":[0.9518858,0.000026196754,0.047070153,0.00068861287,0.000012337203,0.00014552419,0.000096179865,0.0000039278357,0.00007126527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991905,0.00004367686,0.00029472425,0.00013999382,0.00014839545,0.0001827077],"domain_scores_gemma":[0.9994346,0.00015942656,0.00010760962,0.00014143146,0.00010069709,0.00005623934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022270785,0.00009722135,0.00011594475,0.00027608383,0.00027141938,0.00029383518,0.00023373583,0.000040529983,7.9198054e-7],"category_scores_gemma":[0.00003951131,0.000092406626,0.000041426636,0.00030267081,0.00004510559,0.00227702,0.00011671047,0.00008397593,0.00000427177],"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.00013552062,0.000086713146,0.00014356416,0.0002961603,0.00006452578,3.2966028e-7,0.0017381343,0.05471307,0.005434761,0.1312685,0.010059979,0.7960587],"study_design_scores_gemma":[0.001454457,0.0000679173,0.00054726296,0.000046549452,0.0000040462396,0.0000023172886,0.000045647863,0.88178885,0.002140286,0.103855655,0.009903645,0.00014336158],"about_ca_topic_score_codex":0.0000059212334,"about_ca_topic_score_gemma":4.1698067e-7,"teacher_disagreement_score":0.91449565,"about_ca_system_score_codex":0.00002328738,"about_ca_system_score_gemma":0.000035941594,"threshold_uncertainty_score":0.37682328},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048846905,0.00009163579,0.9919647,0.00018737708,0.0001842433,0.00032937297,0.000009397089,0.00010806176,0.0022405498],"genre_scores_gemma":[0.92067367,0.000026940332,0.07887727,0.0001232374,0.000013774209,0.00002191588,0.00011631933,0.000004159646,0.00014271005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888736,0.00011067708,0.0005645099,0.00014200514,0.00019022165,0.00010523051],"domain_scores_gemma":[0.9990175,0.00019808159,0.00032692804,0.00021150867,0.00020455506,0.000041450698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006261023,0.0001074403,0.00016991136,0.0002735159,0.00013533521,0.00018400414,0.00016997258,0.00007427187,0.000001921213],"category_scores_gemma":[0.00019238605,0.00010684719,0.000020164965,0.0004022673,0.00006390894,0.0018349814,0.00008274496,0.00007520044,0.00003089291],"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.0001386964,0.000043232936,0.000078845456,0.00049667613,0.00004849774,1.680291e-7,0.0042395717,0.13383546,0.0010204866,0.45962664,0.0003073914,0.40016434],"study_design_scores_gemma":[0.000348786,0.000051039307,0.0044275457,0.000077514494,0.000009649749,0.0000043754776,0.00009080872,0.9925663,0.00015275594,0.0015794996,0.000592508,0.00009921218],"about_ca_topic_score_codex":0.000018023919,"about_ca_topic_score_gemma":1.4755788e-7,"teacher_disagreement_score":0.915789,"about_ca_system_score_codex":0.000041691546,"about_ca_system_score_gemma":0.000051216473,"threshold_uncertainty_score":0.4357102},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011327686,0.00009045679,0.9964991,0.00056642015,0.0003619785,0.0005935887,0.0000060423163,0.00010446574,0.0006451308],"genre_scores_gemma":[0.36225432,0.000042450058,0.63560075,0.0017286389,0.00006531214,0.00013196467,0.00009491613,0.000006507557,0.00007512736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924326,0.00002733033,0.00030734998,0.00011948127,0.00016683295,0.00013572676],"domain_scores_gemma":[0.9993301,0.00016685581,0.00014979497,0.00013975684,0.00018890877,0.000024599452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035728494,0.000098277094,0.00008783622,0.00014893505,0.00044104402,0.0005091534,0.00021368943,0.000045593737,0.000001574855],"category_scores_gemma":[0.000022150285,0.000078173834,0.000044128734,0.0003988551,0.000038067483,0.0016721492,0.00010062603,0.0000724948,0.0000051388147],"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.0000073090764,0.000017063885,0.00006373232,0.00012402733,0.000018408868,1.3056112e-7,0.001005031,0.020652197,0.0000059454765,0.113982856,0.00027024455,0.86385304],"study_design_scores_gemma":[0.00042351874,0.000024539118,0.0013893122,0.000044672663,0.000009287858,0.000006026008,0.00010714674,0.92892164,0.000049972194,0.065905705,0.003029667,0.00008853528],"about_ca_topic_score_codex":0.000020877907,"about_ca_topic_score_gemma":0.0000010114946,"teacher_disagreement_score":0.9082694,"about_ca_system_score_codex":0.000035354824,"about_ca_system_score_gemma":0.000064549946,"threshold_uncertainty_score":0.49097782},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025256483,0.000010354708,0.99105114,0.0030970944,0.000111677444,0.00032349024,0.000002773943,0.000060317205,0.0028175283],"genre_scores_gemma":[0.97895235,0.000002011075,0.017504305,0.003367969,0.0000071070936,0.00005875644,0.000015194013,0.000001327621,0.000090966125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995717,0.000023559494,0.00016882813,0.000070061804,0.000091238646,0.00007464578],"domain_scores_gemma":[0.9995645,0.00021025013,0.00006881616,0.00008074699,0.000059768572,0.000015881747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020319021,0.00006159614,0.000054063068,0.00006668568,0.00017593232,0.00023172378,0.00011600604,0.000018534638,0.0000011437945],"category_scores_gemma":[0.000025072419,0.000041433585,0.00001899008,0.000073819065,0.000011682662,0.00039847696,0.00003653064,0.000055250097,0.0000067146857],"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.0000109517305,0.0000123552145,0.000010017943,0.000029643052,0.0000072864714,7.415357e-8,0.0010058217,0.06464785,0.000001341477,0.5531566,0.0005594305,0.38055858],"study_design_scores_gemma":[0.00037417372,0.000058316826,0.00016439124,0.000020973146,0.0000025343027,0.0000011115749,0.000033767254,0.9346277,0.000010994549,0.06239126,0.0022700275,0.000044720306],"about_ca_topic_score_codex":0.000009882541,"about_ca_topic_score_gemma":9.151109e-7,"teacher_disagreement_score":0.9764267,"about_ca_system_score_codex":0.00001731072,"about_ca_system_score_gemma":0.000019515533,"threshold_uncertainty_score":0.22345178},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052712928,0.00002908674,0.98795944,0.000103995284,0.0003268293,0.00049506215,0.000009806662,0.00024053642,0.005563932],"genre_scores_gemma":[0.9585481,0.000048951373,0.04042206,0.00023705188,0.000029239685,0.00010011585,0.0005456299,0.00000953354,0.00005928954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994811,0.00000678823,0.0002787293,0.000057179423,0.00007542859,0.00010079888],"domain_scores_gemma":[0.99974436,0.000025719179,0.000052854688,0.00004437085,0.000109080145,0.000023615841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000135712,0.00008498899,0.000080792204,0.00018109518,0.00010300832,0.0001728139,0.00003374981,0.000058523405,0.0000045091997],"category_scores_gemma":[0.000009965564,0.00009095003,0.000022433098,0.00017854321,0.000011793234,0.00074488966,0.0000092011305,0.00004928166,0.000008058262],"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.0000067156843,0.000006611194,0.000051543087,0.00050784426,0.000024016475,2.33204e-8,0.0013411167,0.81067723,0.000096621014,0.005182772,0.0010864187,0.18101907],"study_design_scores_gemma":[0.0006153094,0.000016176098,0.00032882162,0.000053929034,0.000008680326,8.180062e-7,0.00011057425,0.986899,0.00034653788,0.0019785322,0.0095457705,0.00009582038],"about_ca_topic_score_codex":0.000003911531,"about_ca_topic_score_gemma":0.0000017387418,"teacher_disagreement_score":0.9532768,"about_ca_system_score_codex":0.000033724908,"about_ca_system_score_gemma":0.00001696262,"threshold_uncertainty_score":0.37088346},"labels":[],"label_agreement":null}]}