{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":797,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":797,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"b418dfbd2b2b","filters":{"venue":"Theoretical Computer Science"}},"results":[{"id":"W2015179126","doi":"10.1016/j.tcs.2014.05.025","title":"Quantum cryptography: Public key distribution and coin tossing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":3914,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Coin flipping; Quantum cryptography; Quantum key distribution; Computer science; Cryptography; Computer security; Theoretical computer science; Quantum channel; Channel (broadcasting); Key (lock); Adversary; Quantum information; Quantum; Mathematics; Computer network; Quantum mechanics; Physics","authors":[{"name":"Charles H. Bennett","is_ca":false},{"name":"Gilles Brassard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008955706879752091,"gpt":0.2367619103129184,"spread":0.2278062034331663,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004406786,0.001336633,0.001624586,0.002043152,0.002022741,0.004702548,0.002354441,0.005451653,0.007117673],"category_scores_gemma":[0.01336094,0.0009106312,0.00092992,0.003914515,0.009003717,0.01197706,0.004476018,0.004751439,0.003843898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003649553,"about_ca_system_score_gemma":0.002451505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007255794,"about_ca_topic_score_gemma":0.0004086067,"domain_scores_codex":[0.9940194,0.002405608,0.0002017695,0.0006864308,0.002150538,0.0005362508],"domain_scores_gemma":[0.9958834,0.001963049,0.0003387926,0.001246946,0.0004209102,0.0001468522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003468941,0.00002847169,0.00004599976,0.00008324994,0.000007183033,0.0000361267,0.0000575924,0.003863955,0.0004388759,0.974551,0.004362927,0.01648999],"study_design_scores_gemma":[0.00002383857,0.00001693785,0.00004064889,0.00005005491,0.000006676375,0.0001495099,0.00001593441,0.02305362,0.0007374377,0.9637854,0.01209876,0.00002128216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00856031,0.01102056,0.8904546,0.00833404,0.001061526,0.0003601066,0.000235744,0.0007246275,0.07924835],"genre_scores_gemma":[0.6653095,0.01731362,0.2513641,0.002877922,0.004192398,0.001161245,0.0004151966,0.0003825872,0.05698351],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007117673,"threshold_uncertainty_score":0.02647942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102729564","doi":"10.1016/j.tcs.2004.10.033","title":"Data exchange: semantics and query answering","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1203,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Data exchange; Schema (genetic algorithms); Theoretical computer science; Semantics (computer science); Information retrieval; Database; Programming language","authors":[{"name":"Ronald Fagin","is_ca":false},{"name":"Phokion G. Kolaitis","is_ca":false},{"name":"Renée J. Miller","is_ca":true},{"name":"Lucian Popa","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02259862416624663,"gpt":0.2786496916886596,"spread":0.256051067522413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01068228,0.001351953,0.002815471,0.003893861,0.002878559,0.01515261,0.003410239,0.004461256,0.004599086],"category_scores_gemma":[0.03031478,0.001455226,0.002298429,0.008585234,0.00794145,0.04401869,0.005126921,0.005090503,0.001499494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002885172,"about_ca_system_score_gemma":0.002660145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002592677,"about_ca_topic_score_gemma":0.001204707,"domain_scores_codex":[0.9886181,0.004556892,0.001664678,0.001697678,0.002859619,0.0006029936],"domain_scores_gemma":[0.9833879,0.009370795,0.001128562,0.003626441,0.001977766,0.0005084925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000102184,0.0000394654,0.0003324628,0.0002502491,0.00003064209,0.000083347,0.0005067583,0.00253094,0.000391001,0.9603865,0.004545911,0.03080057],"study_design_scores_gemma":[0.00002440022,0.00001420613,0.00008998936,0.00006196852,0.00003859767,0.0002085319,0.0001817956,0.01496426,0.0006290415,0.9704724,0.01329495,0.00001971938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01148317,0.009430942,0.9594916,0.008982442,0.0005868182,0.0001350526,0.0005212281,0.0008704953,0.008498204],"genre_scores_gemma":[0.4480446,0.01394609,0.5140966,0.002632444,0.003467558,0.0006963182,0.003346367,0.0007620567,0.01300794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01515261,"threshold_uncertainty_score":0.05649394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142971854","doi":"10.1016/j.tcs.2009.01.016","title":"Exploration–exploitation tradeoff using variance estimates in multi-armed bandits","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":566,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Variance (accounting); Stochastic game; Upper and lower bounds; Logarithm; Mathematical optimization; Computer science; Multi-armed bandit; Interval (graph theory); Mathematics; Mathematical economics; Machine learning; Economics","authors":[{"name":"Jean-Yves Audibert","is_ca":false},{"name":"Rémi Munos","is_ca":false},{"name":"Csaba Szepesvári","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2025090972907981,"gpt":0.4631392662511002,"spread":0.2606301689603022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01741206,0.001801049,0.003292357,0.001939547,0.001008865,0.004078803,0.00246353,0.004149533,0.002009197],"category_scores_gemma":[0.08031216,0.001942511,0.001007089,0.001705955,0.002668021,0.006750336,0.003856997,0.003234298,0.0004377603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001378395,"about_ca_system_score_gemma":0.001663079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001100996,"about_ca_topic_score_gemma":0.0008045105,"domain_scores_codex":[0.9900691,0.007260599,0.0004701544,0.0006379086,0.001006346,0.0005558263],"domain_scores_gemma":[0.9136565,0.07833941,0.002657933,0.00258174,0.002190966,0.0005735562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005399436,0.00009468298,0.00171695,0.0002333121,0.0002439849,0.00007355642,0.0001621639,0.8388136,0.001278294,0.111198,0.0009046881,0.04474088],"study_design_scores_gemma":[0.0000448597,0.0000698111,0.0002316226,0.00003990339,0.00002981559,0.00003173484,0.00001833976,0.9476445,0.0004835272,0.05120246,0.0001807996,0.00002271905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03525495,0.001214849,0.959457,0.0008320826,0.00005525736,0.0000427771,0.00005216048,0.000178787,0.002912093],"genre_scores_gemma":[0.8497404,0.0009737169,0.1452886,0.000284409,0.0002174992,0.0003045098,0.0001220478,0.0002014138,0.002867379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01741206,"threshold_uncertainty_score":0.09208488,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988245022","doi":"10.1016/s0304-3975(99)00127-9","title":"Extended capabilities for visual cryptography","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":436,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Set (abstract data type); Visual cryptography; Contrast (vision); Pixel; TRACE (psycholinguistics); Transparency (behavior); Scheme (mathematics); Image (mathematics); Computer science; Mathematics; Cryptography; ENCODE; Construct (python library); Theoretical computer science; Computer vision; Combinatorics; Algorithm; Secret sharing; Biology; Computer network; Linguistics","authors":[{"name":"Giuseppe Ateniese","is_ca":false},{"name":"Carlo Blundo","is_ca":false},{"name":"Alfredo De Santis","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009916927238760042,"gpt":0.277172667654482,"spread":0.2672557404157219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004964441,0.0008620392,0.0004721381,0.001108036,0.0006745842,0.002375091,0.0007413893,0.0008884527,0.01342899],"category_scores_gemma":[0.00236402,0.0002945743,0.0004789738,0.000898149,0.001592884,0.006253307,0.003167282,0.002427707,0.004211416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005373737,"about_ca_system_score_gemma":0.0003952461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002561075,"about_ca_topic_score_gemma":0.0001650892,"domain_scores_codex":[0.9993321,0.0001314712,0.00004241635,0.000103103,0.0002744278,0.0001164338],"domain_scores_gemma":[0.9988612,0.000418703,0.00008961592,0.0003797424,0.0001716609,0.00007901806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000890212,0.00001527707,0.00006656865,0.000092087,0.00000842342,0.00008855988,0.00009346725,0.001297843,0.004016901,0.9355931,0.004769695,0.05386902],"study_design_scores_gemma":[0.00002177987,0.00004057162,0.00008889817,0.00007518029,0.00001305,0.0002629551,0.00002393611,0.00564138,0.004478598,0.9231228,0.06621048,0.00002034452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03909801,0.01253074,0.6792307,0.003587791,0.001327729,0.0001315891,0.0005583874,0.002389808,0.2611453],"genre_scores_gemma":[0.7614955,0.008221183,0.1202119,0.0009298295,0.001632585,0.0002463991,0.0005865127,0.0004771894,0.106199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01342899,"threshold_uncertainty_score":0.04492444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092910894","doi":"10.1016/s0304-3975(98)00223-0","title":"Power consumption in packet radio networks","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":424,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec; Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Bounded function; Network packet; Constant (computer programming); Approximation algorithm; Mathematics; Assignment problem; Range (aeronautics); Generalized assignment problem; Node (physics); Path (computing); Mathematical optimization; Dynamic programming; Combinatorics; Discrete mathematics; Computer science; Computer network","authors":[{"name":"Lefteris M. Kirousis","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":true},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007225679416192487,"gpt":0.2328950077014554,"spread":0.2256693282852629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005207947,0.0004012612,0.0004675023,0.0005424452,0.0003260277,0.0009298898,0.0006237803,0.0004706422,0.003057515],"category_scores_gemma":[0.003603642,0.0003561513,0.0001503769,0.001070222,0.0004121372,0.001349171,0.0003870357,0.000386612,0.0004122446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000711805,"about_ca_system_score_gemma":0.0002546063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001047891,"about_ca_topic_score_gemma":0.0007728817,"domain_scores_codex":[0.9994986,0.0001378132,0.00001821893,0.0000600082,0.0002051399,0.0000801645],"domain_scores_gemma":[0.9986154,0.001034012,0.00006485952,0.0001082687,0.0001449688,0.00003246335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003004211,0.0001099328,0.00382476,0.0001854387,0.00005057761,0.000215434,0.000153708,0.8007951,0.01143977,0.05808122,0.00319083,0.1216528],"study_design_scores_gemma":[0.0000125672,0.00007055303,0.002471751,0.00001494768,0.00002793058,0.0001883225,0.00008850092,0.9461772,0.004127826,0.04302721,0.003780666,0.00001254703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3544423,0.007324516,0.6013944,0.00178365,0.0003690559,0.00006505358,0.0003919,0.0008790328,0.0333501],"genre_scores_gemma":[0.9830777,0.001168319,0.008236516,0.00006307635,0.00008040282,0.00002458212,0.0001176747,0.0001024643,0.007129283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003057515,"threshold_uncertainty_score":0.0102284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010017329","doi":"10.1016/j.tcs.2005.01.001","title":"Gathering of asynchronous robots with limited visibility","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":396,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Visibility; Asynchronous communication; Robot; Computer science; Orientation (vector space); Mobile robot; Convergence (economics); Computation; Protocol (science); Point (geometry); Artificial intelligence; Distributed computing; Computer vision; Theoretical computer science; Algorithm; Mathematics; Telecommunications; Geography; Geometry","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true},{"name":"Peter Widmayer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01010129519343213,"gpt":0.2481306823814104,"spread":0.2380293871879783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041735,0.0009478357,0.0014558,0.001333656,0.001524076,0.001606748,0.00199931,0.001528063,0.003324182],"category_scores_gemma":[0.008131398,0.0009887179,0.0008747936,0.001019353,0.001377421,0.002749164,0.003015001,0.001043032,0.0004162323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007348095,"about_ca_system_score_gemma":0.0006722859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001870432,"about_ca_topic_score_gemma":0.001705719,"domain_scores_codex":[0.9994592,0.0001429362,0.00002887385,0.0001322097,0.0001164187,0.0001204592],"domain_scores_gemma":[0.9936596,0.003969991,0.0008669955,0.0004322065,0.0003969592,0.0006743584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001408846,0.0002119456,0.00240741,0.000364104,0.0001172489,0.0007184198,0.0005417521,0.8388005,0.01247786,0.1103693,0.001988305,0.03059415],"study_design_scores_gemma":[0.0000849385,0.0001272756,0.0003204925,0.00001071597,0.00002469408,0.00005283003,0.00007206877,0.9548174,0.0009741313,0.04298267,0.0005186253,0.00001417052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4133667,0.0003882577,0.5761545,0.0004456305,0.00009391135,0.00009278255,0.0001252468,0.0002751942,0.009057682],"genre_scores_gemma":[0.9575259,0.0002310366,0.03553186,0.0000464704,0.00007049714,0.00009972924,0.0001219087,0.00006429185,0.00630832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003324182,"threshold_uncertainty_score":0.0111205,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015172530","doi":"10.1016/j.tcs.2003.09.013","title":"Metrics for labelled Markov processes","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":309,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Bisimulation; Probabilistic logic; Markov process; Metric (unit); Mathematics; Equivalence (formal languages); Markov chain; Property (philosophy); Markov property; Stochastic process; Discrete mathematics; Markov model; Statistics","authors":[{"name":"Josée Desharnais","is_ca":true},{"name":"Vineet Gupta","is_ca":false},{"name":"Radha Jagadeesan","is_ca":false},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02381291476889642,"gpt":0.3019455865412595,"spread":0.2781326717723631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007560621,0.001861256,0.002029256,0.007120518,0.00227676,0.005986439,0.002030024,0.002997371,0.008142412],"category_scores_gemma":[0.04725746,0.001071416,0.001664881,0.004540347,0.003889611,0.01558932,0.004171124,0.00312206,0.0009311129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006737899,"about_ca_system_score_gemma":0.002100351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003003439,"about_ca_topic_score_gemma":0.002347891,"domain_scores_codex":[0.9919155,0.00313528,0.0007850719,0.001405511,0.002073091,0.0006855302],"domain_scores_gemma":[0.9573455,0.02712356,0.00503763,0.002509865,0.004723776,0.003259646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004298691,0.00001631409,0.0005755942,0.00008494331,0.00002334022,0.00004246431,0.0001751784,0.009355995,0.0003692221,0.9809223,0.0008396423,0.007551921],"study_design_scores_gemma":[0.000007441325,0.00002068881,0.0002286826,0.00003452288,0.00001159857,0.00002752312,0.00002806096,0.03527883,0.0001940919,0.9622076,0.001943786,0.00001718243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06462575,0.002073241,0.9133915,0.001515365,0.000256728,0.0001806808,0.001145508,0.0005855879,0.01622568],"genre_scores_gemma":[0.7512827,0.002301487,0.2218906,0.0005625503,0.0006418175,0.0009317848,0.003270275,0.0007461575,0.01837265],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008142412,"threshold_uncertainty_score":0.04888713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997048861","doi":"10.1016/j.tcs.2010.12.005","title":"On the complexity of reconfiguration problems","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":258,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Control reconfiguration; Mathematics; Time complexity; Transformation (genetics); PSPACE; NP-complete; Computer science; Computational complexity theory; Combinatorics; Theoretical computer science; Algorithm","authors":[{"name":"Takehiro Ito","is_ca":false},{"name":"Erik D. Demaine","is_ca":false},{"name":"Nicholas J. A. Harvey","is_ca":true},{"name":"Christos H. Papadimitriou","is_ca":false},{"name":"Martha Sideri","is_ca":false},{"name":"Ryuhei Uehara","is_ca":false},{"name":"Yushi Uno","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04184605298491346,"gpt":0.2974343397464628,"spread":0.2555882867615493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004062533,0.001642264,0.002962803,0.002851429,0.002764161,0.007450954,0.004152395,0.004008743,0.02262225],"category_scores_gemma":[0.04520302,0.001434578,0.002688102,0.004500631,0.005984047,0.0214689,0.005302838,0.009148328,0.001504845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004300901,"about_ca_system_score_gemma":0.002205377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002486323,"about_ca_topic_score_gemma":0.00216789,"domain_scores_codex":[0.9938813,0.002261596,0.0002983935,0.0009184551,0.001719614,0.0009205737],"domain_scores_gemma":[0.9151074,0.07522281,0.00265537,0.003563008,0.001654019,0.001797492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000501069,0.0002471372,0.001857828,0.0005782003,0.0001197939,0.0002672756,0.0005620129,0.07956664,0.0009215256,0.8589684,0.01901561,0.03739452],"study_design_scores_gemma":[0.00006089878,0.00002290867,0.0003259715,0.00002908485,0.0000272859,0.00008306509,0.00009457588,0.05641767,0.0001665702,0.9409225,0.001833452,0.00001608961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3688124,0.009878537,0.3570459,0.0449677,0.001105902,0.0003928645,0.002913579,0.001227183,0.213656],"genre_scores_gemma":[0.9109624,0.004972836,0.05435118,0.00196491,0.001856541,0.0004638374,0.002643329,0.0005967304,0.02218812],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02262225,"threshold_uncertainty_score":0.075679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083770519","doi":"10.1016/s0304-3975(03)00090-2","title":"The ring of k-regular sequences, II","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":227,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Ring (chemistry); Mathematics; State (computer science); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm","authors":[{"name":"Jean‐Paul Allouche","is_ca":false},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007250582662101844,"gpt":0.2241170024500957,"spread":0.2168664197879939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634659,0.0002773802,0.0005482268,0.0008620934,0.001054478,0.003616972,0.0004940616,0.00039078,0.004026213],"category_scores_gemma":[0.001405398,0.0002620719,0.000452995,0.0009402175,0.003014373,0.005375158,0.0009565377,0.001549389,0.001308977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009831791,"about_ca_system_score_gemma":0.0005267918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004241717,"about_ca_topic_score_gemma":0.0002161725,"domain_scores_codex":[0.9995438,0.0001001817,0.00003343253,0.0001561973,0.00009890053,0.00006741183],"domain_scores_gemma":[0.9993514,0.0002674634,0.00008833234,0.0001089395,0.00009243792,0.00009139183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004000812,0.000006069088,0.0001410723,0.00004596604,0.000004237303,0.00002357995,0.0002102756,0.0003598346,0.0007423646,0.9896743,0.002338892,0.006413431],"study_design_scores_gemma":[0.000008964042,0.00002290002,0.000327869,0.00001815711,0.000005897517,0.0001113097,0.0001113946,0.001089405,0.000535933,0.9764758,0.02128357,0.000008809115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2528693,0.0428872,0.2001099,0.01141221,0.003491667,0.0000976608,0.001768286,0.0007859623,0.4865778],"genre_scores_gemma":[0.9087186,0.005452738,0.02654158,0.0006878597,0.001546531,0.00007417869,0.0004335712,0.00008556744,0.05645942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004026213,"threshold_uncertainty_score":0.01346898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975531816","doi":"10.1016/j.tcs.2008.07.026","title":"Arbitrary pattern formation by asynchronous, anonymous, oblivious robots","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":224,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Robot; Task (project management); Asynchronous communication; Set (abstract data type); Computer science; Mobile robot; Compass; Point (geometry); Artificial intelligence; Mathematics; Engineering; Geography; Geometry; Programming language","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true},{"name":"Peter Widmayer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01135423358031027,"gpt":0.2296839927461103,"spread":0.2183297591658001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156999,0.0003738559,0.0006703352,0.0004687843,0.0008078068,0.0009565131,0.00182793,0.0009046169,0.002309531],"category_scores_gemma":[0.006495263,0.0004439388,0.0005124789,0.0006595819,0.001456472,0.002005101,0.002417689,0.0008617369,0.0004716648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004936854,"about_ca_system_score_gemma":0.0008313282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007232275,"about_ca_topic_score_gemma":0.0009088113,"domain_scores_codex":[0.9990056,0.0003081476,0.00005579116,0.0002113711,0.0002564069,0.0001627301],"domain_scores_gemma":[0.9964223,0.001527522,0.0005377168,0.0009343752,0.0002662643,0.0003118234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001057744,0.0001940332,0.002547722,0.00020251,0.00009988248,0.000467809,0.0005550447,0.5667864,0.02004783,0.3166039,0.003568062,0.08786912],"study_design_scores_gemma":[0.0001112765,0.0001263959,0.0003437907,0.0000090078,0.00002232269,0.0001266144,0.00008815787,0.827382,0.005252087,0.1644569,0.002063507,0.00001795508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2088098,0.0001164988,0.7793878,0.000470522,0.00007969046,0.0001160041,0.00009944763,0.000623357,0.01029684],"genre_scores_gemma":[0.9206671,0.00008738089,0.07088132,0.0000800151,0.00002542027,0.0001398035,0.00007945278,0.00007702561,0.007962399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002309531,"threshold_uncertainty_score":0.007726133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001527002","doi":"10.1016/j.tcs.2014.09.018","title":"Using quantum key distribution for cryptographic purposes: A survey","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":218,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Quantum key distribution; Computer science; Cryptography; Key (lock); Cryptographic primitive; Computer security; Key exchange; Quantum cryptography; Context (archaeology); Cipher; Key distribution; Key management; Cryptographic protocol; Public-key cryptography; Encryption; Quantum; Quantum information; Physics","authors":[{"name":"Romain Alléaume","is_ca":false},{"name":"Cyril Branciard","is_ca":false},{"name":"Jan Bouda","is_ca":false},{"name":"Thierry Debuisschert","is_ca":false},{"name":"Mehrdad Dianati","is_ca":false},{"name":"Nicolas Gisin","is_ca":false},{"name":"M. S. Godfrey","is_ca":false},{"name":"Philippe Grangier","is_ca":false},{"name":"Thomas Länger","is_ca":false},{"name":"Norbert Lütkenhaus","is_ca":true},{"name":"Christian Monyk","is_ca":false},{"name":"Philippe Painchault","is_ca":false},{"name":"Momtchil Peev","is_ca":false},{"name":"Andreas Poppe","is_ca":false},{"name":"Thomas Pornin","is_ca":false},{"name":"John Rarity","is_ca":false},{"name":"Renato Renner","is_ca":false},{"name":"G. Ribordy","is_ca":false},{"name":"Michel Riguidel","is_ca":false},{"name":"Louis Salvail","is_ca":true},{"name":"A. J. Shields","is_ca":false},{"name":"Harald Weinfurter","is_ca":false},{"name":"Anton Zeilinger","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02072302315177952,"gpt":0.2736636665856934,"spread":0.2529406434339138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004435401,0.001082358,0.002148932,0.003493639,0.00115871,0.004155171,0.002770887,0.002793722,0.006049626],"category_scores_gemma":[0.007571657,0.00146233,0.001009834,0.007369062,0.003148802,0.01154303,0.003638214,0.003567108,0.002218719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00133036,"about_ca_system_score_gemma":0.001510336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004324179,"about_ca_topic_score_gemma":0.0003536433,"domain_scores_codex":[0.9967314,0.001044398,0.0002812328,0.000490722,0.001239797,0.00021244],"domain_scores_gemma":[0.9928145,0.004980522,0.0003345048,0.001149665,0.0005884946,0.0001323004],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002158988,0.0002708582,0.002182995,0.006888452,0.0001078553,0.0001162158,0.0002688142,0.004605217,0.003282866,0.2779492,0.007919328,0.6961922],"study_design_scores_gemma":[0.0001354344,0.000704672,0.002758983,0.002898519,0.0002080401,0.003727622,0.0006121619,0.03718134,0.01681451,0.3687277,0.566004,0.0002270585],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.009837314,0.7236854,0.2309475,0.004009796,0.0007302287,0.0001886171,0.00016659,0.0002642623,0.03017035],"genre_scores_gemma":[0.1345237,0.7648021,0.08931866,0.001576986,0.002182597,0.0002343307,0.0003380056,0.0001749392,0.00684873],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.006049626,"threshold_uncertainty_score":0.02345693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044712489","doi":"10.1016/s0304-3975(01)00303-6","title":"Searching games with errors—fifty years of coping with liars","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":211,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Interactivity; Theoretical computer science; Computation; Algorithm; Multimedia","authors":[{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01614613090359288,"gpt":0.2451831090415628,"spread":0.2290369781379699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005793731,0.0007389262,0.0008743478,0.001066066,0.00177649,0.004648072,0.002391724,0.003585358,0.003234327],"category_scores_gemma":[0.02724425,0.0004301251,0.0006114682,0.0009897499,0.008140598,0.009659651,0.003309438,0.003390028,0.0004574127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001961897,"about_ca_system_score_gemma":0.001603818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002717821,"about_ca_topic_score_gemma":0.003802077,"domain_scores_codex":[0.997265,0.001594458,0.0001222666,0.0002565935,0.0004048216,0.0003569208],"domain_scores_gemma":[0.9849764,0.01044162,0.001079693,0.001185783,0.001149722,0.001166835],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003697485,0.0004352718,0.007635623,0.0004996833,0.0002081504,0.000348612,0.01061513,0.03241645,0.0006416409,0.7094334,0.02206654,0.2153297],"study_design_scores_gemma":[0.0000884793,0.0002080276,0.00216169,0.0006734286,0.00006077614,0.0002541746,0.007640851,0.05296816,0.0005727761,0.8289468,0.106329,0.00009589775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3458794,0.1103029,0.2323319,0.153579,0.00239343,0.0001779062,0.0001572356,0.0005019087,0.1546763],"genre_scores_gemma":[0.9160962,0.02484183,0.03500925,0.005196786,0.001278476,0.0001717822,0.00009622345,0.0001330818,0.01717634],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005793731,"threshold_uncertainty_score":0.03064054,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144182788","doi":"10.1016/j.tcs.2007.09.032","title":"Gathering asynchronous oblivious mobile robots in a ring","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Snapshot (computer storage); Robot; Asynchronous communication; Computer science; Mobile robot; Node (physics); Ring (chemistry); Algorithm; Topology (electrical circuits); Mathematics; Combinatorics; Computer network; Artificial intelligence; Engineering; Operating system","authors":[{"name":"Ralf Klasing","is_ca":false},{"name":"Ευριπίδης Μάρκου","is_ca":true},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009868126200166685,"gpt":0.2698464193739304,"spread":0.2599782931737638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001635154,0.0006313457,0.001336256,0.0008419569,0.00157175,0.001338108,0.001883936,0.001102525,0.004044795],"category_scores_gemma":[0.006606077,0.0005923327,0.000592298,0.0009184346,0.001286731,0.003667078,0.003879284,0.001114571,0.0007695107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006270033,"about_ca_system_score_gemma":0.000665208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004759983,"about_ca_topic_score_gemma":0.0006236786,"domain_scores_codex":[0.9991102,0.0002879667,0.00005471195,0.0001959064,0.0001639452,0.0001873588],"domain_scores_gemma":[0.9946828,0.00306725,0.0007197742,0.0007898108,0.000294697,0.0004456404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002490449,0.0003408027,0.002689067,0.0006353147,0.0001779139,0.0006582446,0.0009722957,0.6791614,0.0334267,0.2191378,0.004123767,0.05618636],"study_design_scores_gemma":[0.000128915,0.0003624801,0.0002649779,0.00001802082,0.00005033999,0.0001287076,0.0002026789,0.9247347,0.005638298,0.06632079,0.002125144,0.00002502541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3239764,0.0003534922,0.6653677,0.000863163,0.000104846,0.000185556,0.0001425592,0.0006171737,0.008389221],"genre_scores_gemma":[0.9026564,0.0002355241,0.08685754,0.00007969287,0.00007364582,0.0002077653,0.00008067811,0.00007383189,0.00973498],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004044795,"threshold_uncertainty_score":0.01353121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118223706","doi":"10.1016/j.tcs.2005.09.011","title":"The complexity of partition functions","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Constraint satisfaction problem; Adjacency matrix; Homomorphism; Partition (number theory); Counting problem; Discrete mathematics; Time complexity; Equivalence (formal languages); Graph","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true},{"name":"Martin Grohe","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04045361536678201,"gpt":0.3106491400712147,"spread":0.2701955247044327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003201347,0.001094156,0.002753211,0.003418571,0.003023327,0.01047362,0.004139638,0.003963979,0.01411941],"category_scores_gemma":[0.03620664,0.001503896,0.001773402,0.004699309,0.007716201,0.02666851,0.004552566,0.008126996,0.001334546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004726346,"about_ca_system_score_gemma":0.001832561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001989656,"about_ca_topic_score_gemma":0.001542984,"domain_scores_codex":[0.9955283,0.00142172,0.000170598,0.0007235969,0.00148632,0.0006694092],"domain_scores_gemma":[0.9477097,0.04373525,0.002099811,0.003519109,0.001351517,0.001584642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001135512,0.00004329123,0.001024214,0.00007478799,0.0000221987,0.00004599384,0.0002720108,0.007485757,0.0003302486,0.9799163,0.003558496,0.007113116],"study_design_scores_gemma":[0.00001901553,0.000006089757,0.0003508464,0.00001009851,0.00001065899,0.00004728551,0.00004329874,0.01504957,0.0001343451,0.9835235,0.0007946072,0.0000107259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6649363,0.004320522,0.1788,0.02888606,0.0004504453,0.0001111809,0.002127273,0.0005551264,0.119813],"genre_scores_gemma":[0.9715989,0.001659351,0.01170771,0.0007998447,0.0009226816,0.0001757881,0.001035055,0.0002488716,0.01185181],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01411941,"threshold_uncertainty_score":0.04723418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044141959","doi":"10.1016/s0304-3975(02)00138-x","title":"Two-way finite automata with quantum and classical states","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":183,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum finite automata; Deterministic finite automaton; Deterministic automaton; Probabilistic automaton; Nondeterministic finite automaton; ω-automaton; Finite-state machine; Discrete mathematics; Nested word; Quantum; Computer science; Mathematics; Automaton; Automata theory; Theoretical computer science; Algorithm; Quantum mechanics; Physics","authors":[{"name":"Andris Ambainis","is_ca":false},{"name":"John Watrous","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008223849374187228,"gpt":0.2207880449097986,"spread":0.2125641955356113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002264171,0.001073937,0.001375767,0.001130664,0.00307742,0.007307446,0.003018552,0.004044886,0.00533114],"category_scores_gemma":[0.01140494,0.0008763711,0.002235103,0.001317398,0.006308303,0.01215857,0.0054408,0.003299166,0.001372037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002016831,"about_ca_system_score_gemma":0.002597653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002398403,"about_ca_topic_score_gemma":0.00268164,"domain_scores_codex":[0.9959356,0.001355342,0.0003961788,0.0008254154,0.0008620718,0.0006254784],"domain_scores_gemma":[0.9897714,0.005685096,0.0004828234,0.002327835,0.001059197,0.0006735607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001431394,0.00006638288,0.000359309,0.00005383139,0.00001932576,0.0001539411,0.0005008793,0.008885993,0.001356299,0.9815762,0.0006519512,0.006232773],"study_design_scores_gemma":[0.0000684278,0.00003866278,0.00009321627,0.0000287546,0.00004049368,0.0001078841,0.0001320928,0.0735791,0.003020701,0.9190844,0.0037429,0.00006331803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1351822,0.0005633601,0.8267872,0.001972804,0.0005094941,0.0001970843,0.0004588618,0.001691372,0.03263765],"genre_scores_gemma":[0.8293363,0.0003208269,0.1530979,0.0004051941,0.000153875,0.0004982133,0.0003543092,0.0002106709,0.0156227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007307446,"threshold_uncertainty_score":0.01783442,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039936247","doi":"10.1016/j.tcs.2005.07.014","title":"Graph exploration by a finite automaton","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":176,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Combinatorics; Planar graph; Mathematics; Graph; Discrete mathematics; Butterfly graph; Robot; Regular graph; Upper and lower bounds; Voltage graph; Computer science; Line graph; Artificial intelligence","authors":[{"name":"Pierre Fraigniaud","is_ca":false},{"name":"David Ilcinkas","is_ca":false},{"name":"Guy Peer","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"David Peleg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01346512824973406,"gpt":0.2579631548572839,"spread":0.2444980266075498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004871408,0.0003641258,0.0007016008,0.0007656249,0.001114587,0.001388597,0.001161636,0.001375167,0.006801763],"category_scores_gemma":[0.004452002,0.0004094943,0.001352633,0.0007514482,0.001745728,0.002304768,0.001599216,0.001275118,0.0004251634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009321412,"about_ca_system_score_gemma":0.0008770557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002739653,"about_ca_topic_score_gemma":0.003243069,"domain_scores_codex":[0.9995484,0.0001641647,0.00002514828,0.000128284,0.00007610532,0.00005782294],"domain_scores_gemma":[0.9963966,0.002808359,0.0001102875,0.0003787628,0.0001588907,0.0001470409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004877019,0.0001531003,0.002215046,0.0002692413,0.0001108679,0.0004406645,0.0006469222,0.3159089,0.01079239,0.6163535,0.002936012,0.04968576],"study_design_scores_gemma":[0.0000488735,0.00005487637,0.0001749536,0.00002080918,0.00002911042,0.00007525997,0.00005852701,0.6549804,0.001765682,0.3411914,0.001583179,0.00001700004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.348976,0.0004381552,0.6217843,0.001460793,0.0001515614,0.0001126739,0.0003558214,0.001845948,0.02487486],"genre_scores_gemma":[0.8981665,0.0001519779,0.09494936,0.0001126499,0.00002340291,0.0001373034,0.0001485573,0.0001637725,0.00614637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006801763,"threshold_uncertainty_score":0.02275413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983244685","doi":"10.1016/s0304-3975(00)00382-0","title":"Restriction categories I: categories of partial maps","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":165,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Coproduct; Mathematics; Closed category; Limit (mathematics); 2-category; Context (archaeology); Distributive property; Concrete category; Enriched category; Category theory; Derived category; Triangulated category; Dual (grammatical number); Pure mathematics; Algebra over a field; Linguistics; Functor","authors":[{"name":"J.R.B. Cockett","is_ca":true},{"name":"Stephen Lack","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02829764923079037,"gpt":0.2807743840024217,"spread":0.2524767347716313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008827594,0.0007299366,0.0007395582,0.002417798,0.001474981,0.004789932,0.001461326,0.001180501,0.01185803],"category_scores_gemma":[0.002374635,0.0005281367,0.0006923124,0.00259877,0.003752641,0.008230569,0.003348443,0.002766104,0.002253709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008427776,"about_ca_system_score_gemma":0.0005186225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006394605,"about_ca_topic_score_gemma":0.0002693576,"domain_scores_codex":[0.9989963,0.0002275393,0.00006362456,0.0003034348,0.0002777099,0.0001314029],"domain_scores_gemma":[0.9986872,0.0004790553,0.0001534915,0.0002783735,0.0001955666,0.0002062597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001297591,0.00001026457,0.000281569,0.00006905814,0.000007324101,0.00004594318,0.000344663,0.0001258946,0.0008111623,0.9900541,0.002252884,0.005984197],"study_design_scores_gemma":[0.000008752309,0.0000263905,0.0006793917,0.00002607419,0.00001434022,0.0003597008,0.0002727122,0.001156475,0.001334213,0.9663386,0.02976893,0.0000145027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1875082,0.009649508,0.5535073,0.004432333,0.001139273,0.0002809245,0.003743137,0.002449722,0.2372895],"genre_scores_gemma":[0.8681155,0.004685839,0.07059744,0.001348455,0.001259208,0.0004867548,0.003420874,0.0004422777,0.04964353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01185803,"threshold_uncertainty_score":0.03966904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050063944","doi":"10.1016/j.tcs.2005.12.016","title":"Asynchronous deterministic rendezvous in graphs","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":162,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Graph; Upper and lower bounds; Mathematics; Node (physics); Topology (electrical circuits); Combinatorics; Algorithm; Discrete mathematics","authors":[{"name":"Gianluca De Marco","is_ca":false},{"name":"Luisa Gargano","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"Ugo Vaccaro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007596805078787223,"gpt":0.243354161246824,"spread":0.2357573561680368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001033327,0.0006181714,0.001219893,0.001182729,0.001680353,0.001909195,0.001926925,0.001288489,0.006782087],"category_scores_gemma":[0.008050895,0.0007115147,0.0005908607,0.001291523,0.00207829,0.003512762,0.002347523,0.001592332,0.0007692908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001362539,"about_ca_system_score_gemma":0.0008635049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003849365,"about_ca_topic_score_gemma":0.004861058,"domain_scores_codex":[0.9990409,0.0003107656,0.00004222905,0.0002446468,0.000167003,0.0001943717],"domain_scores_gemma":[0.9920123,0.005486273,0.0006036684,0.0008919088,0.0004222637,0.0005835127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000657915,0.00009299114,0.0008483667,0.000211513,0.0000518865,0.0002638728,0.0005464999,0.251047,0.005551977,0.7132396,0.00408684,0.02340152],"study_design_scores_gemma":[0.0001010907,0.00004347918,0.0002234965,0.00001887601,0.00003017799,0.00007955058,0.000168951,0.4525864,0.002192582,0.5420845,0.002447014,0.00002384506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4130693,0.0009755725,0.5517805,0.001639573,0.0002017426,0.0001376992,0.000417665,0.001238476,0.03053942],"genre_scores_gemma":[0.9591584,0.0003283233,0.02908006,0.0001216957,0.00005603696,0.00009243631,0.0001587544,0.0001966129,0.01080767],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006782087,"threshold_uncertainty_score":0.02268833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1802748673","doi":"10.1016/j.tcs.2015.09.018","title":"Autonomous mobile robots with lights","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; Ministry of Education, Culture, Sports, Science and Technology; Agence Nationale de la Recherche","keywords":"Asynchronous communication; Robot; Computer science; Mobile robot; Distributed computing; Artificial intelligence","authors":[{"name":"Shantanu Das","is_ca":false},{"name":"Paola Flocchini","is_ca":true},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true},{"name":"Masafumi Yamashita","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01615962641213541,"gpt":0.2576801945142401,"spread":0.2415205681021047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001460619,0.00033565,0.0004045887,0.0003304235,0.000653077,0.0008827308,0.0005781722,0.0007018155,0.004169195],"category_scores_gemma":[0.0007058558,0.0003180869,0.0003946413,0.000306432,0.0008744968,0.001177617,0.001928995,0.0008138038,0.000848605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003207618,"about_ca_system_score_gemma":0.0003035557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008212614,"about_ca_topic_score_gemma":0.0008590385,"domain_scores_codex":[0.9998355,0.00003537724,0.000004152518,0.00004177484,0.00005677375,0.00002636963],"domain_scores_gemma":[0.9997743,0.00008795151,0.00002682994,0.0000354947,0.00003383371,0.00004160022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007468097,0.0001663013,0.001841517,0.0003963845,0.00008349364,0.0004558153,0.0004342249,0.2674364,0.07333029,0.4053531,0.01098801,0.2387677],"study_design_scores_gemma":[0.00008610415,0.0002557535,0.0007175678,0.00003241082,0.00003316497,0.000195273,0.0001744901,0.7273858,0.01006474,0.2359438,0.02506311,0.00004783067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1333601,0.001292687,0.8097931,0.001009572,0.0004949393,0.00007541559,0.0001396909,0.001185924,0.05264858],"genre_scores_gemma":[0.8973924,0.0006000262,0.07558684,0.0002304737,0.0001079909,0.00008710266,0.00008585479,0.0001167922,0.02579262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004169195,"threshold_uncertainty_score":0.01394737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063972032","doi":"10.1016/j.tcs.2004.09.035","title":"A behavioural pseudometric for probabilistic transition systems","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Probabilistic logic; Mathematics; Coalgebra; Functor; Equivalence (formal languages); Metric space; Modal logic; Discrete mathematics; Metric (unit); Algebra over a field; Pure mathematics; Modal; Statistics","authors":[{"name":"Franck van Breugel","is_ca":true},{"name":"James Worrell","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01971950583662881,"gpt":0.2498040748160415,"spread":0.2300845689794127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007874497,0.001020909,0.001519345,0.004270452,0.002471063,0.005357291,0.002980613,0.002943746,0.006075034],"category_scores_gemma":[0.03580166,0.0008884658,0.002289972,0.003673066,0.005316569,0.014863,0.006914367,0.007152298,0.001254287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002922508,"about_ca_system_score_gemma":0.002483765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001169902,"about_ca_topic_score_gemma":0.0007377815,"domain_scores_codex":[0.9896175,0.003708705,0.001069448,0.001932547,0.002972467,0.0006994571],"domain_scores_gemma":[0.9729859,0.0146324,0.002268667,0.00251806,0.00429988,0.003295182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004571658,0.00003574558,0.0003771833,0.00006215736,0.00001018786,0.00003801078,0.0002047125,0.002190304,0.00073154,0.9836802,0.0008987761,0.01172545],"study_design_scores_gemma":[0.00001918258,0.00009754345,0.0003641936,0.00003306088,0.00001715375,0.0001674026,0.00007383322,0.04030931,0.0006359988,0.9526153,0.00562766,0.00003943428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03471328,0.0005471348,0.9493998,0.002437674,0.0003931813,0.0001196182,0.0004556216,0.0004151306,0.01151854],"genre_scores_gemma":[0.5722201,0.001448166,0.4035078,0.001186437,0.00188759,0.001067016,0.001520846,0.0004972063,0.01666465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007874497,"threshold_uncertainty_score":0.04164487,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2616737215","doi":"10.1016/s0304-3975(02)00737-5","title":"Scalar aggregation in inconsistent databases","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Scalar (mathematics); Database; Computer science; Mathematics; Set (abstract data type); Characterization (materials science); Theoretical computer science; Programming language","authors":[{"name":"Marcelo Arenas","is_ca":true},{"name":"Leopoldo Bertossi","is_ca":true},{"name":"Jan Chomicki","is_ca":false},{"name":"Xin He","is_ca":false},{"name":"Vijay Raghavan","is_ca":false},{"name":"Jeremy Spinrad","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0173094157674278,"gpt":0.2560617708558215,"spread":0.2387523550883937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01411701,0.0005084894,0.002052038,0.00321822,0.002605929,0.007421826,0.002476498,0.001797007,0.003713013],"category_scores_gemma":[0.04577315,0.001249733,0.00118699,0.006771742,0.002782952,0.0155936,0.004942082,0.002540907,0.0005400417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554138,"about_ca_system_score_gemma":0.001674355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001689756,"about_ca_topic_score_gemma":0.001554157,"domain_scores_codex":[0.9888111,0.003783127,0.001725289,0.001337334,0.003753764,0.0005893234],"domain_scores_gemma":[0.9633762,0.0194973,0.003058318,0.008567402,0.004844104,0.0006567057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005505206,0.0001003134,0.00518444,0.0003378697,0.0001118554,0.0005878178,0.0009965589,0.01902268,0.001370371,0.8864556,0.004892553,0.08038944],"study_design_scores_gemma":[0.00005936218,0.00004510944,0.0005172955,0.0000630635,0.0001345362,0.0005083852,0.0003515616,0.1182129,0.002528851,0.8703769,0.007166809,0.00003517324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09529568,0.002561873,0.8892129,0.002717274,0.0002658154,0.0001037252,0.0003953112,0.001051322,0.008395994],"genre_scores_gemma":[0.6912352,0.001354842,0.3000718,0.0004679625,0.0004570077,0.0001197551,0.0008930016,0.0002352077,0.005165121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01411701,"threshold_uncertainty_score":0.07465881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970322539","doi":"10.1016/j.tcs.2008.10.005","title":"Gathering few fat mobile robots in the plane","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council","keywords":"Robot; Asynchronous communication; Mobile robot; Computer science; Plane (geometry); Artificial intelligence; Combinatorics; Mathematics; Geometry; Telecommunications","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Leszek Gąsieniec","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02041441354726885,"gpt":0.260438264394177,"spread":0.2400238508469081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004700526,0.0006374381,0.001123053,0.0007466933,0.001178149,0.001070096,0.001052337,0.00138574,0.002866735],"category_scores_gemma":[0.003019142,0.0006287172,0.0005384134,0.0008049204,0.001089318,0.001978071,0.002350956,0.0009019708,0.0006192573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003704657,"about_ca_system_score_gemma":0.0002699976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001107614,"about_ca_topic_score_gemma":0.0009591486,"domain_scores_codex":[0.9997866,0.00004726197,0.000009983813,0.00005998795,0.00004318809,0.00005307774],"domain_scores_gemma":[0.9989104,0.0006510846,0.0001620881,0.00009148665,0.00008390476,0.0001010301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002770823,0.0001916875,0.006224934,0.0006548898,0.0003485903,0.001632531,0.001070874,0.7431161,0.04455502,0.1120185,0.004306701,0.08310929],"study_design_scores_gemma":[0.0001589559,0.0002909328,0.001059744,0.00004996835,0.00005929471,0.0003920922,0.0005772076,0.9208407,0.004455372,0.06977876,0.002311287,0.00002561583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4746212,0.0007211096,0.5152678,0.001059159,0.00008363174,0.00006899011,0.0001830744,0.000233889,0.007761154],"genre_scores_gemma":[0.8295758,0.0005757834,0.1622955,0.0001451816,0.00005909083,0.00008996598,0.0002258817,0.00005740705,0.006975352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002866735,"threshold_uncertainty_score":0.009590209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998843748","doi":"10.1016/s0304-3975(98)00116-9","title":"Competitive analysis of randomized paging algorithms","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Paging; Competitive analysis; Computer science; Online algorithm; Cache; Algorithm; Randomized algorithm; CPU cache; Demand paging; Page fault; Cache algorithms; Deterministic algorithm; Virtual memory; Memory management; Parallel computing; Upper and lower bounds; Mathematics; Operating system","authors":[{"name":"Dimitris Achlioptas","is_ca":true},{"name":"Marek Chrobák","is_ca":false},{"name":"John Noga","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008541897466011434,"gpt":0.2632950407095936,"spread":0.2547531432435822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008456368,0.002406974,0.00476499,0.003563574,0.002733937,0.007423846,0.009463843,0.004494741,0.02226106],"category_scores_gemma":[0.06645808,0.001708159,0.002090433,0.006116815,0.004191719,0.01081479,0.004107141,0.005101203,0.002277697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006764665,"about_ca_system_score_gemma":0.006212964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0067073,"about_ca_topic_score_gemma":0.004054929,"domain_scores_codex":[0.9885252,0.005698818,0.0003221056,0.000980611,0.002509626,0.001963657],"domain_scores_gemma":[0.9249324,0.06067259,0.002746909,0.005265438,0.003708574,0.002673969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002407546,0.001123172,0.002236378,0.0006929151,0.0001835694,0.0001359528,0.0003554326,0.3282477,0.002218177,0.5733449,0.03212961,0.05692457],"study_design_scores_gemma":[0.0002310109,0.000180212,0.00044807,0.00003816268,0.00006339152,0.00007469674,0.0000705042,0.8181441,0.0004476228,0.1779513,0.002317937,0.0000328262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2553874,0.007309391,0.6126179,0.00976996,0.0007297846,0.0008840784,0.001825225,0.002229596,0.1092467],"genre_scores_gemma":[0.9041083,0.002380236,0.06945737,0.001152954,0.001317957,0.0007147567,0.001298212,0.0008247545,0.01874549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02226106,"threshold_uncertainty_score":0.07447064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077525424","doi":"10.1016/j.tcs.2009.02.023","title":"On the similarity metric and the distance metric","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Division of Mathematical Sciences; National University of Singapore","keywords":"Metric (unit); Similarity (geometry); Mathematics; String metric; Measure (data warehouse); Fisher information metric; Metric space; Equivalence of metrics; Convex metric space; Discrete mathematics; Artificial intelligence; Computer science; Data mining; Image (mathematics)","authors":[{"name":"Shihyen Chen","is_ca":true},{"name":"Bin Ma","is_ca":true},{"name":"Kaizhong Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01072900924257724,"gpt":0.2432926968346178,"spread":0.2325636875920406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00540539,0.001113589,0.001802843,0.005258288,0.002140143,0.00491518,0.00238135,0.003835793,0.005255201],"category_scores_gemma":[0.03098715,0.000858757,0.001360026,0.007168953,0.008810005,0.02189553,0.005965634,0.004614572,0.00123374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002330721,"about_ca_system_score_gemma":0.001025475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002166518,"about_ca_topic_score_gemma":0.001079237,"domain_scores_codex":[0.9940065,0.002681767,0.0004896652,0.001048206,0.00152076,0.0002531588],"domain_scores_gemma":[0.9810619,0.01312816,0.001052296,0.002139559,0.00203272,0.0005853337],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001943297,0.000007101019,0.0001765345,0.0000507328,0.00001120963,0.00003271528,0.0001228497,0.001423508,0.0001768541,0.9853908,0.001262547,0.01132573],"study_design_scores_gemma":[0.0000047072,0.0000144046,0.0001212162,0.00002512139,0.000007376764,0.00007345388,0.00003852878,0.00555686,0.00009606339,0.9873863,0.006663509,0.00001243275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03210872,0.0219803,0.8826845,0.009421506,0.001147182,0.0000716135,0.0003172877,0.0001293943,0.05213948],"genre_scores_gemma":[0.5836945,0.0236038,0.3570256,0.002846043,0.004805563,0.0004196988,0.00124731,0.0003329702,0.02602441],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00540539,"threshold_uncertainty_score":0.0285868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115404543","doi":"10.1016/j.tcs.2004.06.029","title":"Computationally universal P systems without priorities: two catalysts are sufficient","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":122,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Catalysis; Symbol (formal); Reduction (mathematics); P system; Power (physics); Mathematics; Computer science; Membrane computing; Chemistry; Theoretical computer science; Algorithm; Physics; Quantum mechanics","authors":[{"name":"Rudolf Freund","is_ca":false},{"name":"Lila Kari","is_ca":true},{"name":"Marion Oswald","is_ca":false},{"name":"Petr Sosı́k","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008116660906839171,"gpt":0.2500124413008852,"spread":0.241895780394046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00393289,0.0008754711,0.001433651,0.001163233,0.002079382,0.00435049,0.002550323,0.003357817,0.01451935],"category_scores_gemma":[0.0295164,0.00110746,0.00123871,0.001009608,0.005181774,0.01103745,0.005474306,0.005095872,0.002096116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001300819,"about_ca_system_score_gemma":0.003370016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001168053,"about_ca_topic_score_gemma":0.001209632,"domain_scores_codex":[0.9968728,0.0007158411,0.0002338277,0.0006820293,0.0005973991,0.0008980731],"domain_scores_gemma":[0.9784168,0.0133381,0.0007581531,0.004546063,0.001422667,0.00151824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002642704,0.00004974623,0.0004807472,0.0001501536,0.00001849362,0.0001232049,0.0002149833,0.003949285,0.001208431,0.9792948,0.002526776,0.01171925],"study_design_scores_gemma":[0.00006642602,0.00002647001,0.00008470209,0.00002086455,0.00001428746,0.00008244577,0.00007172262,0.02084872,0.001544457,0.9753115,0.001908257,0.00002015096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2237018,0.001338887,0.6623636,0.01119105,0.0007322385,0.0003957996,0.001176278,0.002953844,0.09614651],"genre_scores_gemma":[0.9298352,0.000335623,0.06132489,0.0009328731,0.0001938253,0.000248982,0.0002840445,0.0003070711,0.006537395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01451935,"threshold_uncertainty_score":0.04857212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009538436","doi":"10.1016/j.tcs.2008.12.046","title":"Parallelizing quantum circuits","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Engineering and Physical Sciences Research Council","keywords":"Rewriting; Computer science; Logarithm; Qubit; Electronic circuit; Polynomial; Quantum circuit; Quantum; Quantum computer; Constant (computer programming); Quantum algorithm; Algorithm; Translation (biology); Theoretical computer science; Mathematics; Quantum error correction; Quantum mechanics; Physics; Mathematical analysis","authors":[{"name":"Anne Broadbent","is_ca":true},{"name":"Elham Kashefi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009636575686006338,"gpt":0.2453413383062421,"spread":0.2357047626202357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000516072,0.0006334661,0.0008416028,0.0005792975,0.001115263,0.001395006,0.001008415,0.00109016,0.01689365],"category_scores_gemma":[0.002713955,0.000433623,0.0006607374,0.000805342,0.001569483,0.002619437,0.001811931,0.002230993,0.001456792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009715572,"about_ca_system_score_gemma":0.0006733346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006159481,"about_ca_topic_score_gemma":0.0007951618,"domain_scores_codex":[0.9995131,0.0001330953,0.00001517664,0.00008399431,0.0001778745,0.00007677445],"domain_scores_gemma":[0.9990269,0.0004750321,0.00004020773,0.0002915935,0.0001120807,0.00005416003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001024757,0.00005932579,0.0001337228,0.00008370268,0.00002120052,0.00004054826,0.00008490396,0.0185714,0.004410565,0.9476494,0.004146384,0.02469642],"study_design_scores_gemma":[0.00004147442,0.0000355213,0.000123407,0.00001600588,0.00001612924,0.0000455127,0.00002982101,0.08843332,0.004584356,0.8976171,0.009046104,0.00001118112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1779388,0.001588313,0.5144306,0.005336177,0.001854735,0.0002661948,0.0002470645,0.002199173,0.296139],"genre_scores_gemma":[0.8499258,0.001066352,0.09644703,0.0007818268,0.0007210636,0.000203093,0.0002414104,0.0005636747,0.05004968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01689365,"threshold_uncertainty_score":0.05651492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092520161","doi":"10.1016/s0304-3975(01)00164-5","title":"Frozen development in graph coloring","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Graph coloring; Complete coloring; Combinatorics; Fractional coloring; Edge coloring; Mathematics; List coloring; Discrete mathematics; Random graph; Greedy coloring; Dense graph; Graph; Line graph; Graph power; 1-planar graph","authors":[{"name":"Joseph Culberson","is_ca":true},{"name":"Ian P. Gent","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01116320134667742,"gpt":0.2351134554278947,"spread":0.2239502540812173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445383,0.0004556748,0.0006879354,0.001104064,0.002016953,0.001979734,0.001886952,0.001041661,0.005671616],"category_scores_gemma":[0.00737329,0.001170016,0.0009073137,0.001300613,0.003399248,0.004085622,0.002313615,0.004225223,0.0006187739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002354253,"about_ca_system_score_gemma":0.001740627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008003358,"about_ca_topic_score_gemma":0.009883406,"domain_scores_codex":[0.9992889,0.0002824976,0.00002024637,0.0001476259,0.0001332327,0.0001275564],"domain_scores_gemma":[0.995194,0.002950264,0.0002299271,0.0007137834,0.0004981724,0.0004138191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003220181,0.00002489966,0.0003751514,0.00004311483,0.000008680847,0.00008475257,0.0003123827,0.01044266,0.0007102333,0.9755335,0.003053887,0.009378545],"study_design_scores_gemma":[0.00001113268,0.000008394944,0.0001271021,0.00001381154,0.000008784027,0.00004465507,0.00006740895,0.03067218,0.0005082307,0.9653815,0.003149294,0.000007516615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1828933,0.001937332,0.7157581,0.003036109,0.0003053532,0.0001728259,0.0003214754,0.0007700644,0.0948054],"genre_scores_gemma":[0.8206178,0.001319633,0.1312893,0.0006408255,0.0001643031,0.000210597,0.0005522372,0.0005213948,0.04468382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008003358,"threshold_uncertainty_score":0.01897347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2236520910","doi":"10.1016/j.tcs.2016.01.002","title":"Solving the Many to Many assignment problem by improving the Kuhn–Munkres algorithm with backtracking","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Backtracking; Algorithm; Task (project management); Assignment problem; Computer science; Mathematics; Process (computing); Mathematical optimization","authors":[{"name":"Haibin Zhu","is_ca":true},{"name":"Dongning Liu","is_ca":false},{"name":"Siqin Zhang","is_ca":false},{"name":"Yu Zhu","is_ca":true},{"name":"Luyao Teng","is_ca":false},{"name":"Shaohua Teng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004772503037445953,"gpt":0.1974227877428128,"spread":0.1926502847053669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001489414,0.00134993,0.002208692,0.001773705,0.001741948,0.00148588,0.002806198,0.002129215,0.009872815],"category_scores_gemma":[0.004587865,0.0008909812,0.00110336,0.002581757,0.001571948,0.003413467,0.002041216,0.002961449,0.002199804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000956195,"about_ca_system_score_gemma":0.002537266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005335957,"about_ca_topic_score_gemma":0.008517401,"domain_scores_codex":[0.9986456,0.0004243233,0.00006977042,0.0003145785,0.0003110817,0.000234714],"domain_scores_gemma":[0.9980747,0.0009990002,0.0001629583,0.0003892288,0.0002695038,0.0001045696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005836113,0.0006550357,0.000830241,0.0003931663,0.0001415642,0.0001377384,0.0002657947,0.5490047,0.006565154,0.07543793,0.01136854,0.3546165],"study_design_scores_gemma":[0.00009334731,0.00008017963,0.0001340452,0.00001575314,0.00002654868,0.00005663064,0.00004363583,0.9378957,0.001737589,0.05716009,0.00273481,0.00002159323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01958455,0.0002957716,0.9725213,0.0003156834,0.0001275362,0.00009392527,0.00005315282,0.001112216,0.00589592],"genre_scores_gemma":[0.147031,0.0001934563,0.8449433,0.0002103006,0.00008381631,0.0001208042,0.0001835601,0.0003446858,0.006889129],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009872815,"threshold_uncertainty_score":0.03302789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912094370","doi":"10.1016/s0304-3975(01)00212-2","title":"Palindrome complexity","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst; University of Alberta","keywords":"Palindrome; Mathematics; Morphism; Sequence (biology); Combinatorics; Upper and lower bounds; Discrete mathematics; Class (philosophy); Computer science","authors":[{"name":"Jean‐Paul Allouche","is_ca":false},{"name":"Michael Baake","is_ca":false},{"name":"Julien Cassaigne","is_ca":false},{"name":"David Damanik","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01940488099735775,"gpt":0.2512589619389404,"spread":0.2318540809415826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003766989,0.0004736367,0.0007910444,0.001115762,0.001446678,0.002585623,0.0008776155,0.0008593112,0.02092458],"category_scores_gemma":[0.001799382,0.0003589237,0.0007108072,0.001294887,0.001764944,0.007339383,0.001735638,0.002946652,0.002642205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018323,"about_ca_system_score_gemma":0.0004606956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003046389,"about_ca_topic_score_gemma":0.0002856285,"domain_scores_codex":[0.9994856,0.00008671862,0.00002787184,0.0001743172,0.0001578081,0.00006768083],"domain_scores_gemma":[0.999028,0.0004811517,0.00006368547,0.0002022859,0.0001297392,0.00009518981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000147021,0.00001278645,0.00006814761,0.00002600152,0.000003408144,0.00002823456,0.00009197774,0.000232033,0.0003793293,0.9917974,0.001886563,0.005459447],"study_design_scores_gemma":[0.000005042639,0.000007125912,0.00008279864,0.000004761898,0.000004481712,0.00007764545,0.00002516016,0.001073709,0.0002950105,0.9923746,0.006045692,0.000004044686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2075434,0.004234321,0.1729766,0.008316202,0.0008291545,0.00008222615,0.000857337,0.0007911086,0.6043696],"genre_scores_gemma":[0.8987065,0.001489582,0.01908726,0.0008384365,0.0008564433,0.00007740797,0.0006839642,0.0001910148,0.07806949],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02092458,"threshold_uncertainty_score":0.06999964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998068293","doi":"10.1016/j.tcs.2009.04.008","title":"Two non-holonomic lattice walks in the quarter plane","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":115,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Random walk; Iterated function; Conjecture; Lattice (music); Combinatorics; Plane (geometry); Discrete mathematics; Mathematical analysis; Geometry; Statistics; Physics","authors":[{"name":"Marni Mishna","is_ca":true},{"name":"Andrew Rechnitzer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01690291130505945,"gpt":0.3131132280734893,"spread":0.2962103167684298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002641074,0.0004805102,0.0007123727,0.001012506,0.002267986,0.00316695,0.0009562046,0.002341444,0.00738663],"category_scores_gemma":[0.0009848526,0.0004389572,0.0004904638,0.0007523061,0.001702593,0.001912484,0.001437679,0.001543449,0.001169786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007137596,"about_ca_system_score_gemma":0.000664415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009662745,"about_ca_topic_score_gemma":0.0009224109,"domain_scores_codex":[0.9996712,0.00008036789,0.00001526576,0.00005248289,0.00009766068,0.00008296508],"domain_scores_gemma":[0.9994659,0.00008978346,0.00006790959,0.00004560504,0.00005665105,0.0002742175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007987908,0.0003018335,0.001198555,0.00007627637,0.00002618447,0.001824521,0.0005529385,0.007043139,0.008686236,0.9683025,0.002100405,0.009088694],"study_design_scores_gemma":[0.0005088524,0.0003930907,0.002389828,0.00008089736,0.00003293481,0.001472094,0.002153503,0.08883292,0.005726368,0.8862684,0.01204584,0.00009532031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9106589,0.0002599267,0.02768068,0.001069497,0.0004991399,0.00006628463,0.000182859,0.0001743545,0.05940837],"genre_scores_gemma":[0.963805,0.0001255883,0.01449359,0.0001596335,0.00003867495,0.00003794807,0.0001295851,0.00005646993,0.02115348],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00738663,"threshold_uncertainty_score":0.02471071,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2313440826","doi":"10.1016/j.tcs.2011.08.039","title":"WITHDRAWN: Quantum cryptography: Public key distribution and coin tossing","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","cited_by":114,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Coin flipping; Public-key cryptography; Cryptography; Key (lock); Computer security; Computer science; Quantum key distribution; Quantum cryptography; Theoretical computer science; Mathematics; Quantum; Encryption; Statistics; Physics; Quantum information; Quantum mechanics","authors":[{"name":"Charles H. Bennett","is_ca":false},{"name":"Gilles Brassard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04614077629257694,"gpt":0.2645989169087647,"spread":0.2184581406161878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005187298,0.001416362,0.002380694,0.002762812,0.005190796,0.006748751,0.004694899,0.0181988,0.03525434],"category_scores_gemma":[0.0527458,0.0007949838,0.001932606,0.003734093,0.00226831,0.00447655,0.001729772,0.008544367,0.01973736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006271956,"about_ca_system_score_gemma":0.01119923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01664168,"about_ca_topic_score_gemma":0.01719253,"domain_scores_codex":[0.9923304,0.0008284926,0.0006426478,0.0006584027,0.004686616,0.00085339],"domain_scores_gemma":[0.9663608,0.007405201,0.001701401,0.00224377,0.01996761,0.002321226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000173992,0.0000386922,0.0003565827,0.0002214858,0.00002720935,0.000150907,0.00004235217,0.0001444409,0.0005250211,0.02682719,0.9571903,0.01430186],"study_design_scores_gemma":[0.0002238735,0.000104255,0.00352704,0.0002163964,0.0001012175,0.0003361668,0.00008324022,0.001291451,0.002328923,0.04023013,0.9514551,0.00010223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.00586415,0.01326251,0.007038735,0.6007869,0.2860934,0.0003475893,0.01235605,0.001892098,0.07235864],"genre_scores_gemma":[0.1178833,0.009306681,0.008944198,0.3292084,0.1476091,0.0005232159,0.008423395,0.0006886895,0.3774131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03525434,"threshold_uncertainty_score":0.1179375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032897227","doi":"10.1016/j.tcs.2004.03.041","title":"Quantum computing without entanglement","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Quantum entanglement; Quantum; Quantum computer; Computer science; Theoretical computer science; Theoretical physics; Quantum mechanics; Mathematics; Physics","authors":[{"name":"Eli Biham","is_ca":false},{"name":"Gilles Brassard","is_ca":true},{"name":"Dan Kenigsberg","is_ca":false},{"name":"Tal Mor","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008001504721208781,"gpt":0.2507749841629514,"spread":0.2427734794417426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009690293,0.000498689,0.0008684766,0.001062554,0.002193205,0.003160826,0.0008270965,0.001973294,0.01118101],"category_scores_gemma":[0.003740895,0.000478557,0.0005206518,0.0009442753,0.006721878,0.007472297,0.002554703,0.004134243,0.00186962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001451856,"about_ca_system_score_gemma":0.001102063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006446507,"about_ca_topic_score_gemma":0.0004283462,"domain_scores_codex":[0.9990901,0.0002727847,0.00002815567,0.0001336392,0.0003738779,0.0001015136],"domain_scores_gemma":[0.9986964,0.0005090381,0.00005392229,0.0004587403,0.0001827553,0.00009917969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002358757,0.000002462002,0.000008255925,0.000006628326,0.00000124403,0.000002338699,0.00001586661,0.0001399817,0.00006834238,0.9982316,0.0005498977,0.0009710405],"study_design_scores_gemma":[0.000002137006,0.000002223966,0.00001640978,0.000005900169,0.000001483565,0.000009100911,0.00000661169,0.001124291,0.0001390196,0.9944932,0.004196997,0.000002631331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05600055,0.009370404,0.3000175,0.02872077,0.004278045,0.0001449315,0.0004261087,0.0004783459,0.6005633],"genre_scores_gemma":[0.8542204,0.003988585,0.04018168,0.003073185,0.002516828,0.0002053963,0.0002229033,0.0002990825,0.09529189],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01118101,"threshold_uncertainty_score":0.03740418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057923867","doi":"10.1016/j.tcs.2005.06.030","title":"A representation theorem for Boolean contact algebras","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Representation theorem; Stone's representation theorem for Boolean algebras; Mathematics; Axiom; Connection (principal bundle); Discrete mathematics; Representation (politics); Transitive relation; Free Boolean algebra; Automated theorem proving; Complete Boolean algebra; Class (philosophy); Boolean algebras canonically defined; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Two-element Boolean algebra; Algorithm; Artificial intelligence; Algebra representation","authors":[{"name":"Ivo Düntsch","is_ca":true},{"name":"Michael Winter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01831742266785005,"gpt":0.2810696077821045,"spread":0.2627521851142545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001263539,0.0005860534,0.0009283441,0.001955203,0.002000272,0.004375838,0.001482399,0.001659062,0.01598196],"category_scores_gemma":[0.003441152,0.0003985404,0.001946463,0.002559104,0.002173325,0.008472851,0.002333747,0.003557431,0.001998098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001595095,"about_ca_system_score_gemma":0.000838376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00124704,"about_ca_topic_score_gemma":0.0005973376,"domain_scores_codex":[0.9991731,0.0001486184,0.00006115457,0.0002059032,0.0002740593,0.0001371356],"domain_scores_gemma":[0.9988606,0.0005065912,0.000102809,0.0001903099,0.0002313337,0.0001083806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006376733,0.000007770522,0.00001922874,0.00001401681,0.000003930473,0.00001451182,0.00008013619,0.0002069255,0.0001789712,0.9955884,0.0008832742,0.002996591],"study_design_scores_gemma":[0.000008638747,0.0000075406,0.00002837056,0.000008005444,0.000007274076,0.00004779164,0.00003447687,0.00326558,0.0001851133,0.993359,0.003040988,0.000007100755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05076929,0.001229287,0.830099,0.003232746,0.0005269955,0.0001381254,0.0009017467,0.000670363,0.1124323],"genre_scores_gemma":[0.7957326,0.001695311,0.1505889,0.001923342,0.001211353,0.0003866304,0.001504932,0.0003279719,0.04662907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01598196,"threshold_uncertainty_score":0.05346495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001156795","doi":"10.1016/j.tcs.2009.07.007","title":"Optimal movement of mobile sensors for barrier coverage of a planar region","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Fence (mathematics); Polygon (computer graphics); Computer science; Wireless sensor network; Planar; Intrusion; Perimeter; Simple (philosophy); Simple polygon; Intrusion detection system; Computer network; Computer security; Mathematics; Regular polygon; Computer graphics (images)","authors":[{"name":"Binay Bhattacharya","is_ca":true},{"name":"Mike Burmester","is_ca":false},{"name":"Yuzhuang Hu","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Qiaosheng Shi","is_ca":true},{"name":"Andreas Wiese","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007139911694959688,"gpt":0.2310666929667581,"spread":0.2239267812717984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004334213,0.0006338515,0.0007500384,0.0006451243,0.0003625816,0.0005237283,0.000961736,0.0008814441,0.001227065],"category_scores_gemma":[0.003426527,0.0004084051,0.0004724406,0.0004865964,0.0006594427,0.0006775916,0.00117937,0.0005635056,0.0001902701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006037853,"about_ca_system_score_gemma":0.0005664223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00270153,"about_ca_topic_score_gemma":0.002096422,"domain_scores_codex":[0.999773,0.00006900935,0.000007973616,0.00004167268,0.00004877687,0.00005957915],"domain_scores_gemma":[0.999292,0.0004228737,0.0001056379,0.00004839528,0.000056581,0.00007447156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006617722,0.00008545192,0.001036539,0.0001270266,0.00003548089,0.0001866251,0.0001515518,0.9272837,0.01793843,0.02871992,0.001080486,0.02269302],"study_design_scores_gemma":[0.00004058183,0.00007646644,0.0002530556,0.000007239949,0.000008749969,0.00003636192,0.00003381784,0.9931753,0.001260941,0.004787597,0.0003117007,0.000008206598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2249813,0.0004368619,0.7688559,0.0004630382,0.00004013229,0.00008788148,0.0001357731,0.000199464,0.004799644],"genre_scores_gemma":[0.9229048,0.0002513624,0.07406814,0.00004142912,0.00001414872,0.0001101984,0.00009252753,0.00003916066,0.002478018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00270153,"threshold_uncertainty_score":0.005371571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053806044","doi":"10.1016/s0304-3975(99)00186-3","title":"Scheduling in the dark","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Parallelizable manifold; Computer science; Scheduling (production processes); Multiprocessing; Parallel computing; Multiprocessor scheduling; Partition (number theory); Upper and lower bounds; Distributed computing; Job shop scheduling; Algorithm; Mathematical optimization; Flow shop scheduling; Mathematics; Operating system","authors":[{"name":"Jeff Edmonds","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01300710459324179,"gpt":0.2663847769236825,"spread":0.2533776723304407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002157527,0.0005005825,0.0008530652,0.0008170027,0.002871542,0.005543649,0.001546702,0.001762668,0.04235214],"category_scores_gemma":[0.008047921,0.0005724495,0.0003263036,0.001704247,0.003414476,0.007480376,0.002237791,0.004814642,0.007430482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003703878,"about_ca_system_score_gemma":0.005115736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008506688,"about_ca_topic_score_gemma":0.009450621,"domain_scores_codex":[0.9987757,0.0004020596,0.00002908352,0.0002826046,0.0002213424,0.0002893086],"domain_scores_gemma":[0.9960194,0.001020534,0.0002275562,0.001178326,0.0004954814,0.001058637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003596444,0.00009250343,0.0003272789,0.0001136619,0.00002185807,0.00005526299,0.000368445,0.007527024,0.001455973,0.8687327,0.07015382,0.05079189],"study_design_scores_gemma":[0.00005900426,0.00004263932,0.0002260545,0.00006013159,0.000009144482,0.00003770206,0.0005415659,0.01502808,0.000639244,0.7859958,0.1973367,0.00002395757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.06504212,0.01328686,0.1758276,0.1099782,0.008519281,0.0001378421,0.001047491,0.002082491,0.624078],"genre_scores_gemma":[0.7453877,0.006523222,0.03707034,0.01035203,0.003130341,0.0001224013,0.0006229333,0.001308887,0.1954821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04235214,"threshold_uncertainty_score":0.141682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025521996","doi":"10.1016/j.tcs.2004.02.032","title":"On the state complexity of reversals of regular languages","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Regular language; Variety (cybernetics); Finite-state machine; State (computer science); Deterministic finite automaton; Nondeterministic finite automaton; Mathematics; Automaton; Finite state; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automata theory","authors":[{"name":"Arto Salomaa","is_ca":false},{"name":"Derick Wood","is_ca":false},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01521811981985313,"gpt":0.2520598938413013,"spread":0.2368417740214482,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003786319,0.000705508,0.00207307,0.001865988,0.001848933,0.006591196,0.002713078,0.002592255,0.01001211],"category_scores_gemma":[0.04039308,0.001134144,0.001687006,0.001844581,0.004753659,0.01686279,0.003822509,0.0054285,0.0005952989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002648927,"about_ca_system_score_gemma":0.001699215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002006033,"about_ca_topic_score_gemma":0.001832304,"domain_scores_codex":[0.9965854,0.001097128,0.000245697,0.000516514,0.0009078889,0.0006474087],"domain_scores_gemma":[0.8886279,0.09863131,0.003861961,0.004793499,0.0020269,0.002058438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009230719,0.000227215,0.004350541,0.0002416503,0.00007244809,0.0002622679,0.0009823656,0.0680748,0.003483574,0.9012039,0.003033128,0.01714503],"study_design_scores_gemma":[0.0000663212,0.00006126729,0.0009641165,0.00001972465,0.0000379036,0.00008500362,0.0001371177,0.1377611,0.0009102997,0.8593513,0.0005663488,0.0000394384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.838025,0.001278409,0.1233501,0.004877187,0.0001564797,0.0001175293,0.0009531145,0.0005041488,0.03073814],"genre_scores_gemma":[0.9880474,0.0004011449,0.007271347,0.000165956,0.0001712905,0.00007287613,0.0004305629,0.0001401365,0.003299396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01001211,"threshold_uncertainty_score":0.03349388,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970529854","doi":"10.1016/s0304-3975(02)00135-4","title":"Strand design for biomolecular computation","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":101,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"DNA computing; DNA; Computation; Computer science; Theoretical computer science; Computational biology; Algorithm; Biology; Genetics","authors":[{"name":"Arwen Brenneman","is_ca":true},{"name":"Anne Condon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01792685408095541,"gpt":0.2842121613217367,"spread":0.2662853072407813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005394508,0.0005447078,0.0004459713,0.0003897478,0.0006082391,0.0007803381,0.0008218376,0.0007456445,0.01162871],"category_scores_gemma":[0.00146286,0.0003210859,0.0003208882,0.0004403331,0.0005348664,0.001224965,0.0009005849,0.0006821976,0.003061502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004126423,"about_ca_system_score_gemma":0.0004357346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001853715,"about_ca_topic_score_gemma":0.0003332746,"domain_scores_codex":[0.9997618,0.00009467421,0.00001375478,0.00004895822,0.00005182378,0.00002902416],"domain_scores_gemma":[0.9995809,0.0001702992,0.00002451405,0.0001240899,0.00006978052,0.00003032068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000692082,0.00009710302,0.000356766,0.0006196112,0.0000564376,0.0001141064,0.0002255804,0.06306222,0.06429718,0.6164868,0.01025728,0.2437349],"study_design_scores_gemma":[0.00009662852,0.0002131972,0.00006510232,0.00008803985,0.00003993045,0.00008555703,0.0000605395,0.187796,0.0556281,0.6776496,0.07824631,0.0000310276],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03098935,0.001357746,0.9368671,0.00054572,0.0004046974,0.0001121808,0.000174201,0.001765413,0.02778353],"genre_scores_gemma":[0.4625018,0.001506021,0.4984477,0.0005611511,0.0001412484,0.0005652336,0.000469846,0.0008096793,0.03499724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01162871,"threshold_uncertainty_score":0.03890193,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070767505","doi":"10.1016/s0304-3975(01)00375-9","title":"PSPACE has constant-round quantum interactive proof systems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"PSPACE; Gas meter prover; Computer-assisted proof; Constant (computer programming); Computer science; Quantum computer; Proof complexity; Mathematics; Proof assistant; Quantum; Discrete mathematics; Theoretical computer science; Automated theorem proving; Algorithm; Mathematical proof; Computational complexity theory; Quantum mechanics; Programming language; Physics; Geometry","authors":[{"name":"John Watrous","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0127800864432951,"gpt":0.2474901808504944,"spread":0.2347100944071993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00348589,0.001430674,0.002129329,0.001376337,0.004570652,0.008791039,0.003929468,0.002981556,0.02653053],"category_scores_gemma":[0.01658579,0.002306309,0.002100792,0.002620727,0.005002581,0.01897178,0.006971479,0.008930879,0.003938201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004288801,"about_ca_system_score_gemma":0.004238784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003136933,"about_ca_topic_score_gemma":0.003458187,"domain_scores_codex":[0.9943326,0.001169039,0.0002941687,0.001335966,0.001729117,0.001139127],"domain_scores_gemma":[0.9749467,0.01625449,0.001078286,0.004792738,0.001763309,0.001164406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004126964,0.00007566966,0.0003833314,0.0001865477,0.0000542676,0.00008681977,0.0003536319,0.006945849,0.001363458,0.9761485,0.004924911,0.009064349],"study_design_scores_gemma":[0.0001122147,0.00002222942,0.0001673055,0.0000162462,0.00004281981,0.00006098844,0.00004333964,0.01639152,0.002410816,0.9766378,0.004065586,0.0000290382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1432529,0.00114637,0.6809675,0.007976549,0.0003488746,0.0004320748,0.00233089,0.005948422,0.1575965],"genre_scores_gemma":[0.8977663,0.0006514011,0.06304701,0.001008399,0.0002991455,0.0003357579,0.001061212,0.0008995406,0.03493124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02653053,"threshold_uncertainty_score":0.08875346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3023452807","doi":"10.1016/j.tcs.2010.01.007","title":"Remembering without memory: Tree exploration by asynchronous oblivious robots","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Université du Québec en Outaouais; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Robot; Computer science; Asynchronous communication; Task (project management); Theoretical computer science; Node (physics); Tree (set theory); Swarm robotics; Graph; Mobile robot; Constructive; Self-reconfiguring modular robot; Computation; Distributed computing; Algorithm; Artificial intelligence; Mathematics; Robot control; Combinatorics","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"David Ilcinkas","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01301042963313472,"gpt":0.2584973290919054,"spread":0.2454868994587706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007614241,0.0003984455,0.0009033448,0.0003727421,0.0008351277,0.00115267,0.001678587,0.001027085,0.003298846],"category_scores_gemma":[0.006282762,0.0003720511,0.0004161393,0.0005574174,0.001087422,0.003714463,0.001671467,0.001115975,0.0003135689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003891838,"about_ca_system_score_gemma":0.0006465344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00122306,"about_ca_topic_score_gemma":0.001262686,"domain_scores_codex":[0.999639,0.0001291295,0.00001948239,0.00007169514,0.00005866987,0.00008208584],"domain_scores_gemma":[0.996659,0.002129143,0.0002089576,0.0005956344,0.0001757923,0.0002314128],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002461391,0.000266484,0.00243703,0.0004196312,0.0001466016,0.0004795704,0.0013101,0.6440491,0.01243633,0.1859475,0.005636599,0.1444097],"study_design_scores_gemma":[0.00007943734,0.0000994724,0.0001693896,0.00001239911,0.00003068075,0.00006259315,0.00009088526,0.8395044,0.001774822,0.1572162,0.0009449671,0.00001477726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4469258,0.001074341,0.537434,0.0009363476,0.0001223026,0.00007304041,0.0001185051,0.001055202,0.01226048],"genre_scores_gemma":[0.9624926,0.0001972493,0.03421751,0.00006570617,0.00002532066,0.00004585792,0.00005099036,0.00008103383,0.002823761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003298846,"threshold_uncertainty_score":0.01103574,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013195357","doi":"10.1016/j.tcs.2004.03.042","title":"Classifying RNA pseudoknotted structures","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Protein secondary structure; Nucleic acid secondary structure; Simple (philosophy); Algorithm; Generality; Class (philosophy); Computer science; Sequence (biology); Function (biology); Data structure; Base (topology); Mathematics; Theoretical computer science; RNA; Artificial intelligence; Biology; Programming language","authors":[{"name":"Anne Condon","is_ca":true},{"name":"B. Davy","is_ca":true},{"name":"Baharak Rastegari","is_ca":true},{"name":"Shelly Zhao","is_ca":true},{"name":"Finbarr Tarrant","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009692261270437333,"gpt":0.2472509920357312,"spread":0.2375587307652939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004566847,0.0003923041,0.0005031526,0.002024805,0.001149635,0.002533926,0.001068928,0.00204425,0.003240062],"category_scores_gemma":[0.003760341,0.0003127956,0.0004939745,0.001273042,0.001589369,0.002877708,0.0008795304,0.001060414,0.0004044957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008634655,"about_ca_system_score_gemma":0.0003397461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005332347,"about_ca_topic_score_gemma":0.0007006717,"domain_scores_codex":[0.9994785,0.00009001693,0.00004078135,0.0001122408,0.0001932498,0.00008519999],"domain_scores_gemma":[0.996157,0.001893766,0.0005855545,0.0005604657,0.0005141837,0.0002890877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008110138,0.0002187818,0.01612522,0.0003114652,0.0000472037,0.001229264,0.0007095998,0.08265989,0.03554691,0.7793909,0.004444515,0.0785051],"study_design_scores_gemma":[0.00002900717,0.00008801081,0.002659093,0.00003476308,0.0000194785,0.0004402694,0.0002807384,0.4229637,0.009526713,0.5608507,0.003077537,0.00002997022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8313388,0.0003887587,0.1564805,0.0005887236,0.0001042202,0.00008103029,0.0003755204,0.0004347082,0.01020776],"genre_scores_gemma":[0.9701926,0.0001774218,0.02614659,0.0001019306,0.00008079225,0.00004156636,0.0008356107,0.00008027177,0.002343166],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003240062,"threshold_uncertainty_score":0.01083905,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114650657","doi":"10.1016/j.tcs.2006.05.011","title":"A PTAS for the minimization of polynomials of fixed degree over the simplex","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Degree (music); Simplex; Combinatorics; Discrete mathematics; Upper and lower bounds; Polynomial; Integer (computer science); Mathematical analysis","authors":[{"name":"Etienne de Klerk","is_ca":true},{"name":"Monique Laurent","is_ca":false},{"name":"Pablo A. Parrilo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05602989794902363,"gpt":0.3618705996515992,"spread":0.3058407017025756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008469187,0.001180546,0.001103933,0.0007235842,0.0005892172,0.001381742,0.001726278,0.001419503,0.01462688],"category_scores_gemma":[0.003678152,0.0004182822,0.001339627,0.001175561,0.001050165,0.001703928,0.002478021,0.003177544,0.003206528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008996444,"about_ca_system_score_gemma":0.001139114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001622012,"about_ca_topic_score_gemma":0.002206514,"domain_scores_codex":[0.9992085,0.0002539079,0.00003109753,0.0001644154,0.0002759105,0.00006621215],"domain_scores_gemma":[0.9994214,0.0002450737,0.00003948392,0.0001078532,0.0001148774,0.00007150358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002743711,0.0001540028,0.0003940194,0.0004152607,0.00009989532,0.0001401126,0.0001571306,0.1504178,0.007209299,0.6311409,0.02475117,0.1848461],"study_design_scores_gemma":[0.00005635156,0.0001386753,0.0001498479,0.00005702005,0.00003347471,0.0001353403,0.00005834775,0.643398,0.001734999,0.3388901,0.01532304,0.00002482347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006729953,0.00025719,0.9763463,0.0005108336,0.0002257406,0.00007255332,0.0001875794,0.0003234946,0.01534631],"genre_scores_gemma":[0.2351114,0.0009587191,0.7109519,0.0005338066,0.0004833005,0.0004558319,0.000623218,0.0009657037,0.04991623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01462688,"threshold_uncertainty_score":0.04893184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054220885","doi":"10.1016/j.tcs.2007.04.015","title":"State complexity of combined operations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Queen's University","funders":"","keywords":"State (computer science); Intersection (aeronautics); Combined operations; Star (game theory); Computer science; Theoretical computer science; Computational complexity theory; Mathematics; Algorithm; Engineering; Political science","authors":[{"name":"Arto Salomaa","is_ca":false},{"name":"Kai Salomaa","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01896866439580035,"gpt":0.2679945130767457,"spread":0.2490258486809453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001905198,0.0005659639,0.001477771,0.00188845,0.00170461,0.007728068,0.001926194,0.001902531,0.01246029],"category_scores_gemma":[0.01621721,0.0007860365,0.001739207,0.002239801,0.003161974,0.0153263,0.003432479,0.003849751,0.0007162648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002522371,"about_ca_system_score_gemma":0.001642885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001736362,"about_ca_topic_score_gemma":0.00155006,"domain_scores_codex":[0.9965952,0.0007610429,0.0002104499,0.0006092298,0.00124283,0.0005813547],"domain_scores_gemma":[0.9659581,0.02693775,0.001365397,0.002797299,0.001801539,0.001139924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004421741,0.0001279348,0.001816361,0.0001089185,0.00004682431,0.0001390726,0.000680519,0.0282535,0.002781167,0.9516364,0.001287607,0.01267954],"study_design_scores_gemma":[0.00003410183,0.00003704903,0.0006940136,0.00001196056,0.00003778733,0.0000631021,0.0001089513,0.1183684,0.00199878,0.877999,0.0006202644,0.00002650372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7962264,0.0004388911,0.1703231,0.001672201,0.00006850754,0.00008707926,0.0008685769,0.0004010206,0.02991424],"genre_scores_gemma":[0.9875305,0.0001434392,0.007756694,0.00006188558,0.00007091036,0.00008299249,0.0003955453,0.00007798385,0.003880116],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01246029,"threshold_uncertainty_score":0.04168385,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073076713","doi":"10.1016/j.tcs.2008.03.006","title":"Self-deployment of mobile sensors on a ring","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Software deployment; Ring (chemistry); Computer science; Visibility; Mathematical proof; Simple (philosophy); Impossibility; RADIUS; Coordinate system; Cover (algebra); Distributed computing; Topology (electrical circuits); Mathematics; Geometry; Physics; Computer network; Combinatorics; Artificial intelligence; Engineering","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01555006412774927,"gpt":0.2578851609787024,"spread":0.2423350968509531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032043,0.000466151,0.0009357004,0.0005074694,0.0006771868,0.0009676155,0.001464159,0.001104107,0.001202766],"category_scores_gemma":[0.00445529,0.0006575349,0.0004198374,0.0005643747,0.0008527141,0.002185135,0.002111168,0.0005850301,0.0004727812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004389583,"about_ca_system_score_gemma":0.0003523019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007115747,"about_ca_topic_score_gemma":0.0006714592,"domain_scores_codex":[0.9992862,0.0002250509,0.00002990853,0.0002056012,0.0001115352,0.0001417041],"domain_scores_gemma":[0.9976773,0.0009296681,0.0004349209,0.0004391877,0.000257878,0.0002611374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009836461,0.0002155028,0.006262548,0.0001824709,0.0001253834,0.000674492,0.000282443,0.8581746,0.04236504,0.03801845,0.002216298,0.05049913],"study_design_scores_gemma":[0.00002116264,0.0002339512,0.0007086617,0.000007128438,0.00002086768,0.0001327224,0.00009490112,0.9871621,0.005318219,0.005387182,0.0008992897,0.0000138631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.380212,0.0006227565,0.612715,0.0005631623,0.0001420909,0.0000697666,0.0001077226,0.0003735475,0.005193933],"genre_scores_gemma":[0.9645006,0.0002451222,0.0309179,0.00004644967,0.0000398154,0.00004029595,0.00004578793,0.00002453049,0.004139549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001464159,"threshold_uncertainty_score":0.005457997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977986119","doi":"10.1016/j.tcs.2007.07.041","title":"Optimal lower bounds for rank and select indexes","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Eidgenössische Technische Hochschule Zürich","keywords":"Rank (graph theory); Data structure; Upper and lower bounds; Computer science; Word (group theory); Combinatorics; Binary logarithm; Space (punctuation); Index (typography); Order (exchange); Algorithm; Mathematics; Discrete mathematics","authors":[{"name":"Alexander Golynski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007316668029087797,"gpt":0.2601985053427479,"spread":0.2528818373136601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01631416,0.006812792,0.007296803,0.01087173,0.003961644,0.01826018,0.009000503,0.006094439,0.02574082],"category_scores_gemma":[0.1021297,0.003071447,0.002546411,0.01382264,0.006767613,0.02295343,0.011351,0.0108116,0.007769041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009002999,"about_ca_system_score_gemma":0.00962744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002294021,"about_ca_topic_score_gemma":0.005243991,"domain_scores_codex":[0.97544,0.006419869,0.001144629,0.002092703,0.01058443,0.004318424],"domain_scores_gemma":[0.8910767,0.0842495,0.003703729,0.0117876,0.00628616,0.002896284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002705854,0.0007409448,0.001755313,0.001510445,0.00025358,0.0001910012,0.0006986848,0.1426874,0.005925396,0.5695769,0.04872957,0.225225],"study_design_scores_gemma":[0.0002419067,0.0003184174,0.0007097223,0.0003201412,0.0002129251,0.0003676135,0.0002995322,0.372339,0.006349754,0.6064754,0.01224538,0.0001201752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03202162,0.01836236,0.8754501,0.009395971,0.001074449,0.0004251556,0.003488718,0.003302239,0.05647928],"genre_scores_gemma":[0.3998834,0.0147456,0.5270165,0.003595388,0.005308063,0.001770717,0.005759505,0.003554504,0.03836636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02574082,"threshold_uncertainty_score":0.08627856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080745503","doi":"10.1016/j.tcs.2007.05.011","title":"Map construction of unknown graphs by multiple agents","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Rendezvous; Traverse; Graph; Computer science; Theoretical computer science; Combinatorics; Mathematics; Discrete mathematics; Algorithm","authors":[{"name":"Shantanu Das","is_ca":true},{"name":"Paola Flocchini","is_ca":true},{"name":"Shay Kutten","is_ca":false},{"name":"Amiya Nayak","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01071225163422513,"gpt":0.2594873612681509,"spread":0.2487751096339258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008256288,0.0006884001,0.001150495,0.001125678,0.00139287,0.001585904,0.001853961,0.001693157,0.004549738],"category_scores_gemma":[0.005589243,0.0008316221,0.001569051,0.000967614,0.001328665,0.003458294,0.003849061,0.001737979,0.0007190696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000947457,"about_ca_system_score_gemma":0.0009235571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003594287,"about_ca_topic_score_gemma":0.002834304,"domain_scores_codex":[0.9992675,0.000295102,0.00002270778,0.0001792568,0.0001455165,0.00008978465],"domain_scores_gemma":[0.997456,0.001425932,0.0001388193,0.0005692996,0.0002190356,0.0001909867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004445642,0.0001941455,0.001687524,0.0003695046,0.0001620273,0.0005961861,0.0009511271,0.6354782,0.01082665,0.2089498,0.004895991,0.1354443],"study_design_scores_gemma":[0.00002816709,0.00004208845,0.0002262436,0.00001393349,0.00003198279,0.00006619877,0.0001198257,0.8822056,0.004172571,0.1107432,0.002331692,0.00001849466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05908406,0.0001058356,0.9348127,0.0003297611,0.00004481294,0.00008392001,0.0001052996,0.0006207251,0.004812852],"genre_scores_gemma":[0.5845117,0.0002327641,0.4052987,0.00009206539,0.00004207253,0.0001771298,0.0003223293,0.0003066784,0.009016654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004549738,"threshold_uncertainty_score":0.0152204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147012241","doi":"10.1016/s0304-3975(01)00154-2","title":"Rigorous results for random (2+p)-SAT","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Random variable; Set (abstract data type); Order (exchange); Discrete mathematics; Statistics; Computer science","authors":[{"name":"Dimitris Achlioptas","is_ca":false},{"name":"Lefteris M. Kirousis","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01110638169363145,"gpt":0.2534107792008292,"spread":0.2423043975071978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01696531,0.003548099,0.005039928,0.005773493,0.003707191,0.009318782,0.008497845,0.005176124,0.01856445],"category_scores_gemma":[0.07568291,0.003035038,0.00618188,0.006634406,0.0102271,0.02279756,0.009837535,0.0142493,0.002694862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006504861,"about_ca_system_score_gemma":0.004138731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002749557,"about_ca_topic_score_gemma":0.00349174,"domain_scores_codex":[0.9822827,0.007352474,0.0009067158,0.002781889,0.004964584,0.00171161],"domain_scores_gemma":[0.9202651,0.06267099,0.003106731,0.008023372,0.003794156,0.002139741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001348592,0.0001132232,0.000591401,0.0003342895,0.0001124859,0.00007676298,0.0001185701,0.02122524,0.0006215302,0.9593572,0.007586017,0.00972849],"study_design_scores_gemma":[0.00005395112,0.00003026646,0.0002477053,0.00004928602,0.00004193027,0.00006893974,0.00002577638,0.06377093,0.0002940527,0.9332407,0.00214599,0.00003046367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02901089,0.004605602,0.895347,0.008639239,0.0007777481,0.0002574941,0.001569448,0.001243001,0.05854959],"genre_scores_gemma":[0.6676254,0.00747767,0.2647198,0.007109929,0.004976833,0.001968028,0.004431999,0.00284077,0.03884954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01856445,"threshold_uncertainty_score":0.08972222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984264511","doi":"10.1016/j.tcs.2005.09.028","title":"H-Coloring dichotomy revisited","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Greedy coloring; Complete coloring; Combinatorics; Discrete mathematics; Complexity of constraint satisfaction; Computational complexity theory; Automaton; Constraint (computer-aided design); Fractional coloring; List coloring; Constraint satisfaction; Graph coloring; Time complexity; Computer science; Local consistency; Theoretical computer science; Algorithm; Graph","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01505732805158794,"gpt":0.2993394964102967,"spread":0.2842821683587087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001389995,0.0003333347,0.0008916006,0.001176266,0.003186648,0.003764231,0.001444487,0.002599878,0.0190301],"category_scores_gemma":[0.00391567,0.0004408901,0.0006167561,0.001556617,0.004351932,0.006795334,0.002245805,0.00553334,0.001391628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001471828,"about_ca_system_score_gemma":0.001028695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008113076,"about_ca_topic_score_gemma":0.0007937995,"domain_scores_codex":[0.999206,0.0002876858,0.0000194268,0.0001793177,0.0001290281,0.0001786203],"domain_scores_gemma":[0.9969285,0.001902016,0.0001416859,0.0004310772,0.0002372084,0.0003595216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000155884,0.0000122795,0.00008604467,0.00002044062,0.000002868711,0.00002229447,0.00006392608,0.0001643035,0.0001075084,0.9909804,0.005635703,0.002888463],"study_design_scores_gemma":[0.00001335416,0.000003803266,0.00008452366,0.000007949367,0.000002299755,0.00003692801,0.00007304137,0.0007978551,0.00005999276,0.9966241,0.002293525,0.000002502651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.220037,0.003839396,0.1239408,0.07611137,0.003432746,0.00009810358,0.0008611215,0.0007437592,0.5709359],"genre_scores_gemma":[0.9428965,0.00140375,0.01605689,0.009131542,0.00185877,0.0001057059,0.0002914864,0.0001461826,0.02810908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0190301,"threshold_uncertainty_score":0.06366199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993886628","doi":"10.1016/j.tcs.2008.12.049","title":"Affine systems of equations and counting infinitary logic","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Unary operation; Discrete mathematics; Constraint satisfaction problem; Affine transformation; Counting problem; Abelian group; Datalog; Algebra over a field; Pure mathematics; Computer science; Theoretical computer science","authors":[{"name":"Albert Atserias","is_ca":false},{"name":"Andreǐ A. Bulatov","is_ca":true},{"name":"Anuj Dawar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01276918873415195,"gpt":0.2434179504003676,"spread":0.2306487616662157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039905,0.0008810688,0.001133365,0.001912889,0.001832207,0.004107565,0.002358862,0.001157745,0.008438068],"category_scores_gemma":[0.009257187,0.0009706828,0.001760885,0.003053572,0.005059506,0.00669776,0.002557627,0.004855818,0.0007158185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002863691,"about_ca_system_score_gemma":0.001273843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005451149,"about_ca_topic_score_gemma":0.00757418,"domain_scores_codex":[0.9978412,0.0007934657,0.0002020841,0.0003692349,0.000546118,0.0002478008],"domain_scores_gemma":[0.9950051,0.003409301,0.0004131534,0.0004300272,0.0005496006,0.0001928063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008165184,0.000009310947,0.0001398678,0.00001893795,0.000006587255,0.00002076104,0.00007687166,0.001689819,0.00009583699,0.9948884,0.0004591623,0.002586298],"study_design_scores_gemma":[0.000004293147,0.00000215269,0.00004296275,0.000004225049,0.000005198133,0.00001118753,0.00001303727,0.005703676,0.00009415795,0.9933974,0.000716875,0.000004910452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1320812,0.002734862,0.7881167,0.003441198,0.0003947101,0.00008405562,0.0004892545,0.0005816194,0.07207637],"genre_scores_gemma":[0.8458491,0.001390946,0.1257193,0.0006491707,0.0005800841,0.0001363258,0.0007620943,0.0001691449,0.02474379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008438068,"threshold_uncertainty_score":0.02822816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014679376","doi":"10.1016/j.tcs.2012.10.029","title":"On the exploration of time-varying networks","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computability; Computer science; Exploit; Class (philosophy); Node (physics); Focus (optics); Upper and lower bounds; Theoretical computer science; Mathematics; Computer security; Artificial intelligence","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Bernard Mans","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0262796194452426,"gpt":0.2461781794776854,"spread":0.2198985600324428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001844757,0.0008522299,0.001351617,0.001324224,0.000885561,0.002056829,0.001551394,0.001599497,0.004712994],"category_scores_gemma":[0.01820684,0.0005918572,0.0007471698,0.002096739,0.002519562,0.004341627,0.002936776,0.001599261,0.0002325899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001157239,"about_ca_system_score_gemma":0.0009103618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003129167,"about_ca_topic_score_gemma":0.002147104,"domain_scores_codex":[0.9991415,0.0005176314,0.00002588027,0.0000919067,0.0001262213,0.0000968618],"domain_scores_gemma":[0.9869002,0.01159901,0.0004819969,0.0002916048,0.0002937625,0.0004334982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001491108,0.00004032338,0.0008531145,0.0001595227,0.00005569315,0.0001099857,0.0002756279,0.433564,0.0003528543,0.5459429,0.002546345,0.01595044],"study_design_scores_gemma":[0.00002041703,0.00002010659,0.0001121699,0.00002749485,0.00001013796,0.00003239318,0.00005834448,0.6199023,0.00005819184,0.3778011,0.001948755,0.000008616356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1366866,0.008602601,0.8100235,0.005978842,0.0003118596,0.0000880357,0.0003453136,0.0001888993,0.03777435],"genre_scores_gemma":[0.9082024,0.008438459,0.06705366,0.0005241972,0.0004852042,0.0001854866,0.0002739901,0.0001309698,0.01470563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004712994,"threshold_uncertainty_score":0.01576656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037872771","doi":"10.1016/s0304-3975(00)00292-9","title":"Minimal cover-automata for finite languages","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Deterministic automaton; Deterministic finite automaton; Nondeterministic finite automaton; Cover (algebra); Two-way deterministic finite automaton; Büchi automaton; DFA minimization; ω-automaton; Regular language; Quantum finite automata; Finite-state machine; Nested word; Automaton; Mathematics; Discrete mathematics; Computer science; Timed automaton; Automata theory; Theoretical computer science; Algorithm","authors":[{"name":"Cezar Câmpeanu","is_ca":true},{"name":"Nicolae Sântean","is_ca":true},{"name":"S. Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0108842540742893,"gpt":0.2659373913081476,"spread":0.2550531372338584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009460466,0.0009874104,0.001682845,0.001862156,0.002880252,0.004486844,0.001537513,0.002042355,0.008827207],"category_scores_gemma":[0.004923667,0.00109944,0.002052828,0.001912631,0.002939269,0.008575628,0.002706598,0.003608861,0.001082774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002134868,"about_ca_system_score_gemma":0.0009888456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001347221,"about_ca_topic_score_gemma":0.001888459,"domain_scores_codex":[0.9986602,0.0002769654,0.00009828229,0.0003225842,0.0004357743,0.0002061214],"domain_scores_gemma":[0.9937237,0.004780998,0.0002812959,0.0004844447,0.0003709378,0.0003586038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001225765,0.00004471388,0.0003886566,0.0001147158,0.00002915832,0.000167238,0.0009094427,0.002699685,0.001859059,0.9827291,0.002038885,0.00889665],"study_design_scores_gemma":[0.0000173487,0.00001120157,0.0001078194,0.00001170802,0.00001675705,0.00007281653,0.00007497179,0.007618218,0.0005443098,0.9897639,0.001751396,0.000009596938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3125212,0.003507225,0.6133115,0.004274701,0.0003190455,0.0001913345,0.002053621,0.002220005,0.06160133],"genre_scores_gemma":[0.9179646,0.000933816,0.06260452,0.0004572382,0.0003987619,0.0003407906,0.002337421,0.0003716567,0.01459129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008827207,"threshold_uncertainty_score":0.02952993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}