{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":83,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":83,"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":"c43675f49fc6","filters":{"venue":"Theory of Computing Systems"}},"results":[{"id":"W1971393213","doi":"10.1007/s00224-007-1345-z","title":"An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","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":"Carleton University","funders":"","keywords":"Parameterized complexity; Feedback vertex set; Combinatorics; Undirected graph; Mathematics; Vertex (graph theory); Algorithm; Bounded function; Running time; Exponential function; Vertex cover; Function (biology); Time complexity; Binary logarithm; Graph; Exponential time hypothesis; Set (abstract data type); Discrete mathematics; Computer science","authors":[{"name":"Frank Dehne","is_ca":true},{"name":"Michael R. Fellows","is_ca":false},{"name":"Michael A. Langston","is_ca":false},{"name":"Frances Rosamond","is_ca":false},{"name":"Kim Stevens","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02914474183978229,"gpt":0.3172132712211289,"spread":0.2880685293813466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001249853,0.002086299,0.002226448,0.001338477,0.001681886,0.002987751,0.003660266,0.003370347,0.02428181],"category_scores_gemma":[0.008026271,0.0007462287,0.001803744,0.002232946,0.001101559,0.005462582,0.002799505,0.00333856,0.00546517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003031914,"about_ca_system_score_gemma":0.003377664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006444945,"about_ca_topic_score_gemma":0.009393606,"domain_scores_codex":[0.9977512,0.0003905673,0.000106005,0.0007564813,0.0006009813,0.0003947318],"domain_scores_gemma":[0.995402,0.002923643,0.0002318828,0.0008582156,0.0003340772,0.0002502535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001785937,0.0009778644,0.001240583,0.001020441,0.0002323014,0.0003249203,0.000286747,0.1339455,0.01166467,0.04502906,0.07401678,0.7294751],"study_design_scores_gemma":[0.001191485,0.0002845545,0.001039607,0.0001230643,0.0002004806,0.000508047,0.0002415227,0.8070819,0.00563415,0.1687423,0.01487401,0.00007891982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04740681,0.001397523,0.8925188,0.004169851,0.0008341281,0.0008919765,0.002239704,0.01304086,0.03750029],"genre_scores_gemma":[0.2272948,0.0004057469,0.7500528,0.001091476,0.0003381636,0.00103231,0.003343868,0.001238046,0.01520267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02428181,"threshold_uncertainty_score":0.0812307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041354954","doi":"10.1007/s00224-005-1263-x","title":"Algebraic Results on Quantum Automata","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université de Sherbrooke; University of Waterloo","funders":"","keywords":"Class (philosophy); Automaton; Construct (python library); Quantum finite automata; Algebraic number; Computer science; Algebraic theory; Quantum; Algebra over a field; Cellular automaton; Quantum cellular automaton; Regular language; Theoretical computer science; Boolean function; Discrete mathematics; Mathematics; Automata theory; Pure mathematics; Programming language; Algorithm; Artificial intelligence; Physics; Quantum mechanics","authors":[{"name":"Andris Ambainis","is_ca":true},{"name":"Martin Beaudry","is_ca":true},{"name":"Marats Golovkins","is_ca":false},{"name":"Arnolds Ķikusts","is_ca":true},{"name":"Mark Mercer","is_ca":true},{"name":"Denis Thérien","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01856083936426342,"gpt":0.2465511724309238,"spread":0.2279903330666604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001864862,0.001032287,0.001705156,0.003579676,0.004083213,0.004912531,0.001799087,0.001508989,0.01094024],"category_scores_gemma":[0.005104671,0.0008613261,0.001756255,0.003518874,0.007454019,0.01379355,0.004033673,0.005375017,0.001152601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003594064,"about_ca_system_score_gemma":0.001359352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0021508,"about_ca_topic_score_gemma":0.00155059,"domain_scores_codex":[0.9980965,0.0004653974,0.0001220447,0.0003706459,0.0007258297,0.0002195652],"domain_scores_gemma":[0.9952126,0.002906669,0.0002379421,0.0005047807,0.0007763768,0.0003616118],"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.000004384145,0.000006192289,0.00002038546,0.0000141634,0.000002174724,0.000007173672,0.00005871865,0.0001708925,0.00006059859,0.9985163,0.0004042411,0.0007348131],"study_design_scores_gemma":[0.000005752952,0.000003246895,0.00003411033,0.000004421318,0.000003955915,0.00001001672,0.0000190307,0.0009562444,0.00005894923,0.9968887,0.002011306,0.000004250736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1357517,0.0103585,0.4303502,0.01588246,0.002947485,0.00013477,0.0009234856,0.0005948551,0.4030566],"genre_scores_gemma":[0.9016817,0.005607364,0.04250741,0.002261242,0.004086036,0.0002594196,0.0005695635,0.000245083,0.0427822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01094024,"threshold_uncertainty_score":0.0365988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049954052","doi":"10.1007/s00224-005-1223-5","title":"Rendezvous and Election of Mobile Agents: Impact of Sense of Direction","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"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; Leader election; Correctness; Computer science; Constructive proof; Node (physics); Context (archaeology); Asynchronous communication; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Protocol (science); Theoretical computer science; Computer network; Distributed computing; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence","authors":[{"name":"Lali Barrière","is_ca":false},{"name":"Paola Flocchini","is_ca":true},{"name":"Pierre Fraigniaud","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0150854146727756,"gpt":0.2905820463513931,"spread":0.2754966316786175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001622623,0.000447385,0.0008093397,0.0008483988,0.001122009,0.002897526,0.0008662739,0.001189801,0.004969195],"category_scores_gemma":[0.02702788,0.000460121,0.0004686059,0.0008057077,0.001633584,0.003821985,0.00173478,0.001093954,0.0005488775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007353461,"about_ca_system_score_gemma":0.001388494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003388579,"about_ca_topic_score_gemma":0.00392812,"domain_scores_codex":[0.9991276,0.0003362665,0.00002671829,0.0001705717,0.0001347104,0.0002041904],"domain_scores_gemma":[0.9881109,0.00781979,0.001249145,0.0009775521,0.0008416027,0.001000943],"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.004225736,0.000460825,0.02556846,0.0003636634,0.0003092044,0.0004540901,0.001106652,0.6017683,0.01832698,0.2632562,0.004661586,0.07949835],"study_design_scores_gemma":[0.0003196949,0.0005517068,0.01003099,0.00003511126,0.0001441442,0.0004053918,0.001507663,0.8274857,0.004226942,0.1516384,0.003586933,0.00006730016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9226852,0.001467405,0.04988167,0.001772641,0.0002327059,0.00003405525,0.0001138156,0.0001488295,0.02366356],"genre_scores_gemma":[0.9972926,0.0002278197,0.001410877,0.00002318404,0.00001881826,0.000006390531,0.000028141,0.00001888143,0.0009733557],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004969195,"threshold_uncertainty_score":0.01662368,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1533036729","doi":"10.1007/s00224-013-9515-7","title":"Quotient Complexity of Closed Languages","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":56,"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; University of Waterloo","funders":"","keywords":"Suffix; Concatenation (mathematics); Prefix; Closure (psychology); Regular language; Complement (music); Subsequence; Formal language; Abstract family of languages; Mathematics; Quotient; Computer science; Discrete mathematics; Transitive closure; Word (group theory); Combinatorics; Theoretical computer science; Algorithm; Automaton; Linguistics; Programming language","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Galina Jirásková","is_ca":false},{"name":"Chenglong Zou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02442731279508152,"gpt":0.2479190127007407,"spread":0.2234916999056592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001699195,0.0006749138,0.001434543,0.002188575,0.001780798,0.00602391,0.001924048,0.00114501,0.00910635],"category_scores_gemma":[0.008268035,0.0004948904,0.001388275,0.00189536,0.004562197,0.01630747,0.00332341,0.003919006,0.0005316997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003602619,"about_ca_system_score_gemma":0.001149795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00224263,"about_ca_topic_score_gemma":0.001339143,"domain_scores_codex":[0.9976497,0.0006245903,0.0001432817,0.0004355269,0.0008154596,0.0003313573],"domain_scores_gemma":[0.9925992,0.005041363,0.0003533943,0.0006538259,0.0007293176,0.0006228182],"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.00003711844,0.0000149038,0.0002420385,0.00002400284,0.000006457863,0.00003075361,0.0002606743,0.0009822876,0.00025551,0.9955984,0.0004324141,0.0021154],"study_design_scores_gemma":[0.000007987701,0.000004875739,0.0001015279,0.000003170991,0.000004726178,0.00002127999,0.00003510077,0.004811764,0.0001602015,0.9942075,0.0006367349,0.000005080285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5508351,0.002960683,0.3051485,0.008036699,0.0003066286,0.00009697003,0.0009273144,0.0005535056,0.1311344],"genre_scores_gemma":[0.9770799,0.0005510002,0.0103908,0.0002482936,0.0003157193,0.00008974211,0.0004616666,0.00008979776,0.01077293],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00910635,"threshold_uncertainty_score":0.03046376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068458312","doi":"10.1007/s00224-010-9263-x","title":"Randomness on Computable Probability Spaces—A Dynamical Point of View","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Randomness; Ergodic theory; Mathematics; Pointwise; Point (geometry); Mixing (physics); Computable analysis; Discrete mathematics; Pure mathematics; Computable function; Mathematical analysis","authors":[{"name":"Péter Gács","is_ca":false},{"name":"Mathieu Hoyrup","is_ca":false},{"name":"Cristóbal Rojas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01555738778436423,"gpt":0.2465730864953659,"spread":0.2310156987110017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003196489,0.000943844,0.001829352,0.002492735,0.002010487,0.005719862,0.003109734,0.003123122,0.004502142],"category_scores_gemma":[0.01057096,0.0008909051,0.002475508,0.001357956,0.009231799,0.01379128,0.003588254,0.004428363,0.0004342905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003171015,"about_ca_system_score_gemma":0.001356717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00139428,"about_ca_topic_score_gemma":0.0007266174,"domain_scores_codex":[0.9972265,0.00113033,0.0001481403,0.0004419452,0.0008009283,0.0002521502],"domain_scores_gemma":[0.9902773,0.006521599,0.0005870553,0.001223768,0.0008807837,0.0005095665],"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.000003670829,0.000004480153,0.00005027374,0.00001528247,0.000006727098,0.0000168192,0.00003749784,0.002489598,0.0001223782,0.9966885,0.0001286701,0.0004360521],"study_design_scores_gemma":[0.000007586554,0.000009451088,0.00007533401,0.000007560906,0.000004472551,0.00002369559,0.00001658123,0.01295259,0.0000777084,0.9859877,0.0008276447,0.00000964221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07934009,0.005214769,0.8445097,0.01629121,0.0008202509,0.00008787474,0.0005315621,0.0002487766,0.05295586],"genre_scores_gemma":[0.9279361,0.003751659,0.04776796,0.001303992,0.002864732,0.000294563,0.000394168,0.0001985217,0.01548832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005719862,"threshold_uncertainty_score":0.02300739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975859913","doi":"10.1007/s00224-013-9455-2","title":"Linear-Space Data Structures for Range Mode Query in Arrays","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Range (aeronautics); Mode (computer interface); Space (punctuation); Range query (database); Computer science; Information retrieval; Web search query; Sargable; Engineering; Aerospace engineering; Search engine","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Stéphane Durocher","is_ca":true},{"name":"Kasper Green Larsen","is_ca":false},{"name":"Jason Morrison","is_ca":true},{"name":"Bryan T. Wilkinson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0389336755502249,"gpt":0.2943412708216168,"spread":0.2554075952713918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001563429,0.0006271959,0.001069386,0.00164716,0.001049042,0.003108534,0.001900144,0.00106563,0.01150344],"category_scores_gemma":[0.01074902,0.0005175883,0.0006905168,0.00412854,0.001447554,0.006744019,0.003308381,0.001996042,0.003024039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001341651,"about_ca_system_score_gemma":0.001660068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00165899,"about_ca_topic_score_gemma":0.002389533,"domain_scores_codex":[0.9976279,0.0004556311,0.0002867585,0.0002692478,0.001087258,0.0002732271],"domain_scores_gemma":[0.9929661,0.002657422,0.0004087281,0.002745682,0.001057644,0.0001644361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001869353,0.0004588304,0.003220138,0.0007805437,0.0001116084,0.000185676,0.001142474,0.03714845,0.02245801,0.3399626,0.06224879,0.5304136],"study_design_scores_gemma":[0.0003048484,0.0005027092,0.0009500705,0.0001975508,0.0001070749,0.0004859223,0.0006334764,0.3464732,0.04581266,0.5704105,0.03398467,0.0001373089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02962,0.001697306,0.9517245,0.00133195,0.0001986225,0.0001872978,0.001309935,0.006959034,0.006971383],"genre_scores_gemma":[0.3948421,0.001021621,0.5876059,0.001052206,0.000372718,0.0006714187,0.00288458,0.001200182,0.01034932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01150344,"threshold_uncertainty_score":0.03848279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046773087","doi":"10.1007/s00224-011-9341-8","title":"Searching for Black Holes in Subways","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Government of Canada; University of Ottawa","funders":"","keywords":"Computer science","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Matthew Kellett","is_ca":true},{"name":"Peter C. Mason","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07450081417601022,"gpt":0.2626419194833614,"spread":0.1881411053073511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001506826,0.0005445331,0.001572269,0.001465368,0.00254674,0.003680699,0.002587455,0.002554673,0.008570745],"category_scores_gemma":[0.01618391,0.001041388,0.001036373,0.001705232,0.003169397,0.008643508,0.003927844,0.001983308,0.0005107448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00121904,"about_ca_system_score_gemma":0.001291176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003319189,"about_ca_topic_score_gemma":0.003959463,"domain_scores_codex":[0.9989009,0.0004457995,0.00004050522,0.000197827,0.0001664904,0.0002485444],"domain_scores_gemma":[0.9894924,0.007067375,0.0008900506,0.001219764,0.0005760854,0.0007542366],"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.000439424,0.0001000603,0.002727063,0.0001711261,0.00007087667,0.0002365809,0.0006907252,0.1031981,0.001023847,0.8637097,0.006434777,0.02119767],"study_design_scores_gemma":[0.00004578122,0.00002992649,0.000229384,0.00003018693,0.00002523473,0.000080561,0.0005246651,0.2511713,0.0005581509,0.7438564,0.003430801,0.00001759012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4033147,0.001357737,0.5604635,0.004006244,0.0002720672,0.0001884777,0.000409668,0.0004352231,0.02955234],"genre_scores_gemma":[0.9128241,0.0007360769,0.07428595,0.0003483164,0.00008987156,0.0001019666,0.0002343071,0.0001297006,0.01124971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008570745,"threshold_uncertainty_score":0.02867198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068006581","doi":"10.1007/s00224-005-1269-4","title":"A Simple 3-Edge-Connected Component Algorithm","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Simple (philosophy); Component (thermodynamics); Enhanced Data Rates for GSM Evolution; Algorithm; Computer science; Mathematics; Artificial intelligence; Physics","authors":[{"name":"Yung H. Tsin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01438137595860442,"gpt":0.238066302380063,"spread":0.2236849264214586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000441894,0.0009880385,0.001201825,0.0009969805,0.0008268893,0.001296613,0.00221931,0.001473883,0.01702251],"category_scores_gemma":[0.002342482,0.0004676727,0.0006606867,0.00162192,0.000473067,0.002126337,0.001554534,0.0008879149,0.004810193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005658179,"about_ca_system_score_gemma":0.001268137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002055538,"about_ca_topic_score_gemma":0.003163586,"domain_scores_codex":[0.9995776,0.00008468075,0.00003196274,0.0001036516,0.0001454775,0.00005660246],"domain_scores_gemma":[0.999446,0.0001357765,0.0000254224,0.0001690506,0.0001755459,0.00004834562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007771446,0.0003188823,0.0006545711,0.0003520195,0.0001031464,0.0001447848,0.00009993337,0.1042044,0.01167157,0.06791379,0.0241256,0.789634],"study_design_scores_gemma":[0.0003355856,0.0001611946,0.0004604451,0.00003749021,0.00007709913,0.0002215179,0.00003706213,0.8967828,0.006871607,0.07532586,0.01964813,0.00004119167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01599122,0.0002765879,0.9709132,0.000263293,0.0002235696,0.0002107556,0.0001924185,0.002381534,0.009547544],"genre_scores_gemma":[0.09815446,0.0001844486,0.8917364,0.0001545126,0.00007709881,0.0002386976,0.0004803778,0.0003976453,0.008576305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01702251,"threshold_uncertainty_score":0.05694598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963052257","doi":"10.1007/s00224-016-9718-9","title":"From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back","year":2016,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":38,"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":"Computer science; Consistency (knowledge bases); Database; Causality (physics); Database theory; Representation (politics); Information retrieval; Database design; Artificial intelligence","authors":[{"name":"Leopoldo Bertossi","is_ca":true},{"name":"Babak Salimi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1368537231830043,"gpt":0.3660417987277245,"spread":0.2291880755447202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006818383,0.001507493,0.001919656,0.005109684,0.001927652,0.005993974,0.00308904,0.003044334,0.00972133],"category_scores_gemma":[0.07469455,0.001619947,0.003487842,0.002270832,0.003495733,0.00891729,0.003397268,0.004505808,0.0008034192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002894863,"about_ca_system_score_gemma":0.004867907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008765169,"about_ca_topic_score_gemma":0.006807606,"domain_scores_codex":[0.9913373,0.001963625,0.0006345873,0.001575391,0.003502642,0.0009864374],"domain_scores_gemma":[0.9141699,0.06005299,0.005804638,0.01110726,0.007292335,0.001572731],"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.001850118,0.0005611446,0.04443633,0.001100957,0.0004647179,0.003177299,0.002403753,0.1902009,0.002945123,0.5959363,0.02482493,0.1320983],"study_design_scores_gemma":[0.0001118052,0.00007624362,0.003872178,0.0001530716,0.0002344747,0.0009333822,0.0008090629,0.4004423,0.003189098,0.5866736,0.003405364,0.000099383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1490228,0.002875354,0.8150089,0.01254689,0.0007912345,0.0003702088,0.002502455,0.003812316,0.01306976],"genre_scores_gemma":[0.9298996,0.0009443932,0.06212519,0.0006403194,0.0003682221,0.0001398208,0.0009689857,0.0004138767,0.004499647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00972133,"threshold_uncertainty_score":0.0360595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976011284","doi":"10.1007/s00224-007-9085-7","title":"A Randomized Algorithm for Online Unit Clustering","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":38,"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":"Competitive analysis; Online algorithm; Randomized algorithm; Cluster analysis; Partition (number theory); Upper and lower bounds; Extension (predicate logic); Computer science; Set (abstract data type); Mathematics; Combinatorics; Unit (ring theory); Algorithm; Artificial intelligence","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Hamid Zarrabi-Zadeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04092833779722757,"gpt":0.3136730632364606,"spread":0.272744725439233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00311664,0.001678146,0.003782192,0.002057724,0.002373384,0.002385453,0.007577334,0.003874513,0.01230139],"category_scores_gemma":[0.01458292,0.001351229,0.001775382,0.00391075,0.001811219,0.004698691,0.004733569,0.003171691,0.003653806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003366675,"about_ca_system_score_gemma":0.005099775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007180906,"about_ca_topic_score_gemma":0.009716865,"domain_scores_codex":[0.9964185,0.001289284,0.0002028971,0.0009005191,0.0007314594,0.0004573569],"domain_scores_gemma":[0.9924453,0.003962278,0.0004523789,0.001737393,0.0008917018,0.00051099],"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.002075175,0.0008811692,0.0009051385,0.000424417,0.0002138383,0.0001028334,0.0002492089,0.4342021,0.004632124,0.08764973,0.03520968,0.4334545],"study_design_scores_gemma":[0.0002788893,0.0001096304,0.0001366304,0.00001538485,0.00003111631,0.00005177766,0.00003453471,0.9602669,0.001036153,0.03614939,0.001862604,0.00002711961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01013534,0.0003188179,0.9832882,0.0005108789,0.000183234,0.0002738194,0.0002441803,0.002224922,0.002820555],"genre_scores_gemma":[0.1344178,0.0001792085,0.856681,0.0003560139,0.0001776903,0.0007316752,0.000850927,0.0004617096,0.006144099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01230139,"threshold_uncertainty_score":0.04115224,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045637260","doi":"10.1007/s002240010006","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","year":2000,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":37,"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":"Wireless ad hoc network; Computer network; Computer science; Mobile ad hoc network; Wireless; Ad hoc wireless distribution service; Vehicular ad hoc network; Telecommunications; Optimized Link State Routing Protocol","authors":[{"name":"Micah Adler","is_ca":true},{"name":"Christian Scheideler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01325314377154978,"gpt":0.2421604035834294,"spread":0.2289072598118796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009256741,0.001175813,0.0008484461,0.00108335,0.0007169928,0.001791474,0.001448687,0.001090111,0.003937468],"category_scores_gemma":[0.004598788,0.0004686746,0.0003221983,0.001247499,0.0008318508,0.002782678,0.001144953,0.000973854,0.0007764702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007401282,"about_ca_system_score_gemma":0.0007680857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006805048,"about_ca_topic_score_gemma":0.000776522,"domain_scores_codex":[0.9991622,0.0003448659,0.00004382844,0.0000716582,0.0002670741,0.0001103611],"domain_scores_gemma":[0.9981132,0.001327527,0.0001028874,0.0001531867,0.0002343689,0.00006883568],"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.0001430067,0.0001151386,0.0002579122,0.0004219515,0.00006551747,0.0001268732,0.0002357924,0.2802888,0.005818352,0.5147197,0.010744,0.1870629],"study_design_scores_gemma":[0.00004555718,0.000107491,0.0001207206,0.00005099676,0.00003823574,0.000134425,0.0001193501,0.5889863,0.001610308,0.3976958,0.01107158,0.0000193061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01612165,0.003627412,0.9645264,0.0006923394,0.0002005663,0.000148412,0.00007276461,0.0001965278,0.014414],"genre_scores_gemma":[0.7266725,0.007969845,0.2378691,0.00037132,0.0004489002,0.0007095652,0.0002579523,0.000164973,0.02553593],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003937468,"threshold_uncertainty_score":0.01317209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965378629","doi":"10.1007/s00224-011-9349-0","title":"Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"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":"Speedup; Multiprocessing; Competitive analysis; Scaling; Parallel computing; Computer science; Upper and lower bounds; Constant (computer programming); Omega; Randomized algorithm; Mathematics; Algorithm; Physics; Mathematical analysis; Geometry","authors":[{"name":"Ho-Leung Chan","is_ca":false},{"name":"Jeff Edmonds","is_ca":true},{"name":"Kirk Pruhs","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05319425553936011,"gpt":0.251091094211444,"spread":0.1978968386720839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005257269,0.0004703818,0.0004057093,0.0009074088,0.0005386124,0.0009294757,0.0007009069,0.0006662882,0.004836311],"category_scores_gemma":[0.00731083,0.0003139922,0.0002572219,0.0009414168,0.0007857404,0.001742514,0.0006803825,0.0007820787,0.0004439462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005597995,"about_ca_system_score_gemma":0.0004677387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000968451,"about_ca_topic_score_gemma":0.000630558,"domain_scores_codex":[0.999691,0.00007825029,0.00001323296,0.00004981957,0.00007774025,0.00008998448],"domain_scores_gemma":[0.9972275,0.001596899,0.0001415492,0.0004536354,0.000384334,0.00019605],"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.003047938,0.0004390214,0.007451206,0.0003523614,0.00008607133,0.0004620269,0.0007816049,0.647944,0.08355566,0.1274373,0.01013984,0.1183031],"study_design_scores_gemma":[0.00007873023,0.000163868,0.002148125,0.00001489811,0.00001945189,0.00008157687,0.0001086265,0.9506412,0.01496399,0.03008961,0.001669721,0.0000201936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9198286,0.0009667928,0.06084091,0.0009898494,0.0001550723,0.00004797126,0.0001441849,0.001578116,0.01544844],"genre_scores_gemma":[0.9862488,0.0002218133,0.01171982,0.00004426672,0.00003761327,0.00002929934,0.0000670593,0.0001420287,0.001489393],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004836311,"threshold_uncertainty_score":0.01617908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062214685","doi":"10.1007/s00224-007-1329-z","title":"A Faster FPT Algorithm for the Maximum Agreement Forest Problem","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Partition (number theory); Combinatorics; Cardinality (data modeling); Phylogenetic tree; Mathematics; Time complexity; Order (exchange); Binary number; Running time; Set (abstract data type); Algorithm; Pairwise comparison; Computer science; Statistics; Chemistry; Data mining","authors":[{"name":"Michael Hallett","is_ca":true},{"name":"Catherine McCartin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01855616429137116,"gpt":0.2557037684314387,"spread":0.2371476041400675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001729523,0.001222399,0.001929566,0.001720665,0.001464745,0.002718903,0.002967382,0.002370287,0.01994482],"category_scores_gemma":[0.01117188,0.0006384304,0.001541752,0.003103167,0.0009874564,0.005887378,0.002880448,0.004250621,0.005304136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001529674,"about_ca_system_score_gemma":0.002443458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003444994,"about_ca_topic_score_gemma":0.00443009,"domain_scores_codex":[0.9979852,0.0003483838,0.0001285736,0.0004829428,0.0007682714,0.0002864877],"domain_scores_gemma":[0.9943141,0.003133643,0.0001914639,0.001397442,0.0007137817,0.0002496524],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008908182,0.0004343576,0.0007187941,0.0004695907,0.00008878247,0.0002037368,0.0002008572,0.05156026,0.009205783,0.07323705,0.05485438,0.8081356],"study_design_scores_gemma":[0.0005331786,0.000169416,0.000543571,0.00008711022,0.0001015669,0.000562217,0.0001580017,0.6431124,0.007221957,0.324354,0.02310523,0.00005140488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01945277,0.001122265,0.9571615,0.002146893,0.0006410961,0.0003171523,0.001057915,0.005038374,0.01306202],"genre_scores_gemma":[0.1249423,0.0003815228,0.8621234,0.0006085573,0.0004985108,0.0004183502,0.002503133,0.0009397857,0.007584363],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01994482,"threshold_uncertainty_score":0.06672204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978605527","doi":"10.1007/s00224-003-1109-3","title":"Nesting Until and Since in Linear Temporal Logic","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Decidability; Linear temporal logic; Nesting (process); Characterization (materials science); Temporal logic; Hierarchy; Property (philosophy); Interval temporal logic; Class (philosophy); Mathematics; Computation tree logic; Algebraic number; Semigroup; Discrete mathematics; Substitution (logic); Computer science; Algebra over a field; Pure mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Programming language","authors":[{"name":"Denis Th�rien","is_ca":true},{"name":"Thomas Wilke","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02136815477456146,"gpt":0.2464909145574841,"spread":0.2251227597829226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004275755,0.0008174595,0.001346006,0.00146068,0.003878002,0.006537159,0.002237586,0.001620053,0.005591105],"category_scores_gemma":[0.01053681,0.001694685,0.001737006,0.00236193,0.007977165,0.02039082,0.003403565,0.004566599,0.001216459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002611342,"about_ca_system_score_gemma":0.002284008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00439486,"about_ca_topic_score_gemma":0.005438241,"domain_scores_codex":[0.9965944,0.001522722,0.0002930555,0.0006871937,0.0005502396,0.0003522873],"domain_scores_gemma":[0.9913224,0.00580027,0.0006195341,0.001173902,0.0006677289,0.0004161226],"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.00004276682,0.00001339094,0.0001312657,0.00003618272,0.000005229394,0.00005271321,0.0005957673,0.0007672935,0.0002583088,0.9902269,0.000716261,0.007153849],"study_design_scores_gemma":[0.000009368611,0.000008701232,0.00002272452,0.00001317364,0.00001550425,0.00004132206,0.0000567212,0.003624971,0.0002492163,0.9929718,0.002975048,0.00001139263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05003611,0.004286488,0.8929422,0.004173083,0.000815633,0.0001006522,0.0003855676,0.001548827,0.04571149],"genre_scores_gemma":[0.7428765,0.002267926,0.2259919,0.001391,0.0008713469,0.0001777425,0.0004686583,0.0006993565,0.02525559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006537159,"threshold_uncertainty_score":0.02261263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036493899","doi":"10.1007/s00224-014-9591-3","title":"On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Manitoba; Dalhousie University","funders":"","keywords":"Minimum spanning tree; Spanning tree; Mathematics; Parameterized complexity; Disjoint sets; Euclidean minimum spanning tree; Minimum weight; Combinatorics; Connected dominating set; Euclidean geometry; Steiner tree problem; Approximation algorithm; Set (abstract data type); Point (geometry); Mathematical proof; Kruskal's algorithm; Mathematical optimization; Computer science","authors":[{"name":"Reza Dorrigiv","is_ca":true},{"name":"Robert Fraser","is_ca":true},{"name":"Meng He","is_ca":true},{"name":"Shahin Kamali","is_ca":true},{"name":"Akitoshi Kawamura","is_ca":false},{"name":"Alejandro López-Ortíz","is_ca":true},{"name":"Diego Seco","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01034062075288837,"gpt":0.2233376238070862,"spread":0.2129970030541978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001160411,0.0007371742,0.001312756,0.001501986,0.001110541,0.001610063,0.002130556,0.001400742,0.004885531],"category_scores_gemma":[0.01311143,0.0006715895,0.0007630185,0.002169394,0.00132411,0.004765002,0.00241797,0.001541991,0.0005161852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001044506,"about_ca_system_score_gemma":0.0006378223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001152233,"about_ca_topic_score_gemma":0.002028908,"domain_scores_codex":[0.9993699,0.0002331322,0.0000344247,0.0001137748,0.0001814181,0.00006727635],"domain_scores_gemma":[0.9958665,0.002944653,0.0002744294,0.0002793621,0.0004406759,0.0001942734],"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.0002292361,0.00008387415,0.0008624844,0.0002722685,0.00003976929,0.0001273997,0.000323263,0.1586316,0.002107784,0.7551854,0.007540195,0.07459666],"study_design_scores_gemma":[0.00002374925,0.00004292322,0.0003118607,0.00005074598,0.00002195842,0.0001251096,0.000108377,0.3477725,0.0004993333,0.6472992,0.003731295,0.00001291089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09481899,0.002956775,0.8767856,0.001647645,0.0002192251,0.00009571218,0.0003175888,0.0001909846,0.02296728],"genre_scores_gemma":[0.6371682,0.003966077,0.3433277,0.0004123252,0.0004678632,0.0002191656,0.0007413537,0.0002940462,0.01340325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004885531,"threshold_uncertainty_score":0.01634371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028556486","doi":"10.1007/s00224-011-9333-8","title":"The Complexity of the List Homomorphism Problem for Graphs","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Concordia University; McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Constraint satisfaction problem; Homomorphism; Combinatorics; Mathematics; Algebraic number; Discrete mathematics; Computational complexity theory; Graph; Computer science; Algorithm","authors":[{"name":"László Egri","is_ca":true},{"name":"Andrei Krokhin","is_ca":false},{"name":"Benoît Larose","is_ca":true},{"name":"Pascal Tesson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09207204870786918,"gpt":0.2876164445971816,"spread":0.1955443958893124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003277341,0.001174372,0.002782082,0.001982537,0.003345001,0.01116969,0.005640374,0.00473228,0.02155034],"category_scores_gemma":[0.03572892,0.001421949,0.00209412,0.004488461,0.004646433,0.03287236,0.004825827,0.007651328,0.002158305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005304914,"about_ca_system_score_gemma":0.004026383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005426764,"about_ca_topic_score_gemma":0.004683965,"domain_scores_codex":[0.9943113,0.001967827,0.0002625806,0.001099062,0.001311222,0.001048093],"domain_scores_gemma":[0.9401779,0.05118098,0.002067924,0.003156691,0.001531927,0.00188467],"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.001831694,0.0007348203,0.005048492,0.001256622,0.0002192459,0.0004312247,0.001682693,0.09243888,0.002989737,0.780683,0.05098648,0.06169703],"study_design_scores_gemma":[0.0001279274,0.00003601535,0.0005771401,0.00003483265,0.00005519955,0.0001468481,0.0002545954,0.08144329,0.0007004593,0.9145451,0.002039259,0.00003934087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5650511,0.005297372,0.2872186,0.04927946,0.0008511633,0.0003500008,0.006727438,0.002032561,0.08319226],"genre_scores_gemma":[0.9281599,0.002470081,0.04367787,0.001595624,0.00157005,0.0003233699,0.004295817,0.0007125908,0.01719475],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02155034,"threshold_uncertainty_score":0.07209301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005304136","doi":"10.1007/s00224-013-9448-1","title":"Tight Bounds for Adopt-Commit Objects","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Commit; Upper and lower bounds; Binary logarithm; Combinatorics; Log-log plot; Matching (statistics); Mathematics; Deterministic algorithm; Discrete mathematics; Class (philosophy); Computer science; Statistics; Database","authors":[{"name":"James Aspnes","is_ca":false},{"name":"Faith Ellen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01309922025277097,"gpt":0.2289366031529144,"spread":0.2158373829001435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01917101,0.004010202,0.00625254,0.005788418,0.007660802,0.01814042,0.01242842,0.00619735,0.02218757],"category_scores_gemma":[0.1340762,0.003640142,0.002909951,0.008608595,0.008486587,0.04554308,0.02019237,0.01849109,0.00474192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007633778,"about_ca_system_score_gemma":0.008747517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004453254,"about_ca_topic_score_gemma":0.005820249,"domain_scores_codex":[0.9724069,0.005137572,0.001399202,0.00297157,0.01043991,0.007645009],"domain_scores_gemma":[0.7899123,0.130809,0.007236492,0.04898118,0.01446053,0.008600454],"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.002551729,0.0005483066,0.002933694,0.0006987946,0.0001726304,0.0002239097,0.001368137,0.06070402,0.003231699,0.8368468,0.02586702,0.06485341],"study_design_scores_gemma":[0.0001365273,0.0001526651,0.0005335953,0.0001418932,0.0001859915,0.0001401175,0.0002869155,0.1270786,0.002548655,0.8601403,0.008586924,0.00006788156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08127271,0.008339074,0.8253571,0.01152322,0.001331613,0.00042635,0.001560846,0.005046725,0.06514242],"genre_scores_gemma":[0.8036525,0.004203445,0.1454614,0.00340889,0.00242387,0.001127987,0.002425373,0.004396099,0.03290052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02218757,"threshold_uncertainty_score":0.1013872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152951955","doi":"10.1007/s00224-002-1066-2","title":"Bulk Synchronous Parallel Algorithms for the External Memory Model","year":2002,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"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":"Computer science; Parallel computing; Algorithm","authors":[{"name":"Dehne","is_ca":true},{"name":"Dittrich","is_ca":true},{"name":"Hutchinson","is_ca":true},{"name":"Maheshwari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0385649866126264,"gpt":0.26619390324245,"spread":0.2276289166298236,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007831032,0.0005461195,0.000815947,0.0003953049,0.0004584203,0.001171944,0.001408561,0.0007912597,0.007462522],"category_scores_gemma":[0.002572886,0.0003114871,0.0004491621,0.0006406787,0.0007585121,0.003230751,0.001431163,0.001733521,0.00111434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000651191,"about_ca_system_score_gemma":0.0006356821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008747014,"about_ca_topic_score_gemma":0.001187359,"domain_scores_codex":[0.9997365,0.00008276683,0.00001384135,0.00004334135,0.00007780106,0.00004572676],"domain_scores_gemma":[0.9992281,0.0003558322,0.00004988106,0.0002023021,0.0001099908,0.00005394565],"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.0003539885,0.00008939372,0.0002607055,0.000151266,0.00003362356,0.00009723874,0.00008674638,0.1751999,0.00318636,0.7732651,0.008804151,0.03847159],"study_design_scores_gemma":[0.00005614154,0.0000178282,0.00004673383,0.000005962013,0.00001116193,0.00001795223,0.00001039172,0.6950166,0.0008350779,0.301999,0.001976398,0.000006799437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03449458,0.0007877256,0.9431067,0.000802185,0.0002548236,0.00003732334,0.0001368346,0.0007131142,0.01966667],"genre_scores_gemma":[0.7246121,0.001100053,0.2436018,0.0004550749,0.0004288889,0.0002165174,0.0003750451,0.0006851893,0.02852542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007462522,"threshold_uncertainty_score":0.02496463,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071784365","doi":"10.1007/s00224-004-1190-2","title":"Complete Classifications for the Communication Complexity of Regular Languages","year":2004,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Linguistics; Philosophy","authors":[{"name":"Pascal Tesson","is_ca":true},{"name":"Denis Thérien","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0637492406813639,"gpt":0.2897090998430529,"spread":0.225959859161689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005276739,0.001690074,0.002648789,0.00545179,0.003815507,0.01068184,0.004598754,0.00417109,0.01895952],"category_scores_gemma":[0.02926161,0.001212297,0.00251945,0.004697707,0.006186601,0.03081274,0.005119076,0.008994316,0.002292264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004525538,"about_ca_system_score_gemma":0.001673778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00107418,"about_ca_topic_score_gemma":0.0007878926,"domain_scores_codex":[0.9935554,0.001552958,0.0005005086,0.001201791,0.002311561,0.0008776598],"domain_scores_gemma":[0.9460571,0.04130314,0.002352277,0.005250106,0.003327566,0.001709926],"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.00005668983,0.00003008665,0.0003438765,0.00007923065,0.00001087559,0.00002076795,0.0002989651,0.002178759,0.0002248724,0.9862889,0.003525697,0.006941205],"study_design_scores_gemma":[0.00001124748,0.000008308208,0.0001901397,0.00002137683,0.000009871351,0.00003233985,0.000065867,0.009814542,0.0001784453,0.9878761,0.00177631,0.00001542525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2182079,0.005327296,0.6529282,0.010592,0.0007595194,0.0002569432,0.00400098,0.001121832,0.1068053],"genre_scores_gemma":[0.8860229,0.002846201,0.07046929,0.001472594,0.002433514,0.001157315,0.004736301,0.0006987969,0.03016304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01895952,"threshold_uncertainty_score":0.0634259,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006913132","doi":"10.1007/s00224-013-9486-8","title":"The Coolest Way to Generate Binary Strings","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Lexicographical order; De Bruijn sequence; Combinatorics; Binary number; Mathematics; Order (exchange); String (physics); Discrete mathematics; Type (biology); Arithmetic","authors":[{"name":"Brett Stevens","is_ca":true},{"name":"Aaron Williams","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01250921817159821,"gpt":0.2153810577082891,"spread":0.2028718395366909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001527847,0.001043697,0.001021925,0.001400774,0.001994828,0.004283038,0.00160044,0.002042077,0.01696088],"category_scores_gemma":[0.01177677,0.0007549857,0.001164585,0.0009416384,0.002970023,0.006777338,0.004402344,0.004117448,0.007623525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008718744,"about_ca_system_score_gemma":0.001065479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003028585,"about_ca_topic_score_gemma":0.000413802,"domain_scores_codex":[0.9971777,0.0009555341,0.0001390165,0.000462301,0.0009709094,0.0002945506],"domain_scores_gemma":[0.9957427,0.001429184,0.0001726403,0.001782164,0.0006602734,0.0002130542],"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.0004343587,0.00007656388,0.000521063,0.0003691449,0.00007890128,0.0001191781,0.0005260593,0.004168249,0.01273489,0.8401235,0.02391277,0.1169354],"study_design_scores_gemma":[0.00005826642,0.00009508744,0.0001799697,0.000150038,0.00005001218,0.0002766518,0.00008837356,0.01467869,0.01139692,0.9296115,0.0433523,0.00006226941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0379985,0.002026466,0.887639,0.005856147,0.002326572,0.0002535383,0.0008073543,0.002758955,0.06033336],"genre_scores_gemma":[0.4689147,0.001598003,0.4387054,0.004189793,0.001332623,0.0008748176,0.001323581,0.003231722,0.07982937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01696088,"threshold_uncertainty_score":0.05673981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065138042","doi":"10.1007/s00224-008-9153-7","title":"The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete","year":2008,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Quadratic equation; Mathematics; NP-complete; Combinatorics; Group (periodic table); Applied mathematics; Time complexity; Physics; Geometry","authors":[{"name":"Olga Kharlampovich","is_ca":true},{"name":"Igor Lysenok","is_ca":false},{"name":"Alexei Myasnikov","is_ca":true},{"name":"Nicholas Touikan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08172012897673582,"gpt":0.302626261127527,"spread":0.2209061321507912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149164,0.001239057,0.00258692,0.0009648674,0.003482674,0.006293274,0.003013059,0.003201277,0.0134032],"category_scores_gemma":[0.01087873,0.001243216,0.003020316,0.002297012,0.004340957,0.01432328,0.00337842,0.00925469,0.001313397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003055158,"about_ca_system_score_gemma":0.00331136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006520438,"about_ca_topic_score_gemma":0.007382953,"domain_scores_codex":[0.9974456,0.0004434336,0.0001642066,0.0008085497,0.000625276,0.0005128705],"domain_scores_gemma":[0.9740472,0.02285464,0.0009229654,0.0009104683,0.0007382097,0.0005263987],"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.001567079,0.001056365,0.006870938,0.00325245,0.0006775832,0.001441751,0.00316672,0.09599845,0.006337708,0.7155402,0.06620884,0.0978819],"study_design_scores_gemma":[0.0003417358,0.00004561547,0.0005397218,0.00004820661,0.0000922117,0.0002597923,0.0003858776,0.04933795,0.001750899,0.9423467,0.004807775,0.00004347394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5612833,0.003286734,0.3081833,0.05747391,0.0009813068,0.0006847311,0.01034065,0.002258608,0.05550739],"genre_scores_gemma":[0.9049553,0.001719074,0.06261037,0.002304347,0.00141374,0.0003661847,0.006373834,0.0004469421,0.01981012],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0134032,"threshold_uncertainty_score":0.04483819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993150073","doi":"10.1007/s00224-001-0008-8","title":"A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders","year":2001,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Row; Combinatorics; Time complexity; Grid; Vertex (graph theory); Partition (number theory); Mathematics; Minimum weight; Dynamic programming; Running time; Graph; Algorithm; Discrete mathematics; Computer science","authors":[{"name":"Ruben Becker","is_ca":true},{"name":"Isabella Lari","is_ca":false},{"name":"M. Lucertini","is_ca":false},{"name":"Bruno Simeone","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.015498261918101,"gpt":0.245272595252124,"spread":0.229774333334023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006863761,0.001022838,0.001295841,0.0014229,0.001023826,0.001681797,0.002135293,0.0009001164,0.0109538],"category_scores_gemma":[0.002963174,0.0009078005,0.0008496613,0.00218082,0.0007507213,0.002729017,0.002530827,0.001403912,0.002942512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001315589,"about_ca_system_score_gemma":0.001467246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002350696,"about_ca_topic_score_gemma":0.004642892,"domain_scores_codex":[0.9993654,0.0001151109,0.00005208903,0.0001301239,0.0001927939,0.0001445165],"domain_scores_gemma":[0.9985994,0.0005720785,0.0001012276,0.000369942,0.0002100992,0.0001473343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009703039,0.0002669379,0.0009888608,0.0006865377,0.00008079626,0.0001041761,0.0004360153,0.0768435,0.02849793,0.05837017,0.02718794,0.8055669],"study_design_scores_gemma":[0.0003728312,0.0003488128,0.001090091,0.0001371992,0.0001022136,0.0003736634,0.0004773278,0.683127,0.02498955,0.2640815,0.02482331,0.00007652541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0286798,0.0003683321,0.9597318,0.0003494949,0.00006956494,0.0002423354,0.0006428284,0.00308266,0.006833078],"genre_scores_gemma":[0.1151512,0.0001887251,0.8772628,0.0001212306,0.00003065879,0.000166389,0.001526945,0.0004139647,0.005138119],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0109538,"threshold_uncertainty_score":0.03664416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2947749495","doi":"10.1007/s00224-019-09929-9","title":"Additive Number Theory via Automata Theory","year":2019,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"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","keywords":"Fibonacci number; Natural number; Palindrome; Mathematics; Base (topology); Basis (linear algebra); Automaton; Mathematical proof; Discrete mathematics; Representation (politics); Combinatorics; Computer science; Theoretical computer science","authors":[{"name":"Aayush Rajasekaran","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true},{"name":"Tim Smith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007762103394063058,"gpt":0.2280083916079614,"spread":0.2202462882138984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001610245,0.001374397,0.001798804,0.003825588,0.001986549,0.006126656,0.001799946,0.001317435,0.006976853],"category_scores_gemma":[0.003441083,0.0007632563,0.001746663,0.003294598,0.006682737,0.01169524,0.003713482,0.004906516,0.001412619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002564547,"about_ca_system_score_gemma":0.001008681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001096406,"about_ca_topic_score_gemma":0.000846671,"domain_scores_codex":[0.997907,0.0006842556,0.0001292325,0.0004263867,0.0006845392,0.0001686263],"domain_scores_gemma":[0.9976315,0.0015151,0.0001038491,0.0002565605,0.0003470777,0.0001459268],"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.000004081063,0.00000453216,0.00002226612,0.00002294919,0.000003768364,0.000009140254,0.00005883654,0.0003409097,0.00008829816,0.9969035,0.0003689014,0.002172802],"study_design_scores_gemma":[0.000004127255,0.000004444173,0.00002619846,0.000007758747,0.000005567956,0.00001564737,0.0000122387,0.001439651,0.00008879035,0.9955341,0.002856494,0.000005116426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02620545,0.01055405,0.8280747,0.004803271,0.001375322,0.00006933333,0.0003403609,0.0005072518,0.1280701],"genre_scores_gemma":[0.7346615,0.008468191,0.2078349,0.001896644,0.003665359,0.0004025548,0.0005148136,0.0003211446,0.0422349],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006976853,"threshold_uncertainty_score":0.02333987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096141465","doi":"10.1007/s00224-014-9601-5","title":"Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines","year":2015,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Copula (linguistics); Upper and lower bounds; Computer science; Scheduling (production processes); Randomized algorithm; Mathematical optimization; Mathematics; Algorithm; Econometrics","authors":[{"name":"Xujin Chen","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Luis F. Zuluaga","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1348223110732241,"gpt":0.4017495056858833,"spread":0.2669271946126592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01779364,0.002031755,0.006148949,0.001712461,0.00227763,0.006161332,0.008103325,0.004209801,0.008596208],"category_scores_gemma":[0.05794774,0.002364504,0.002526751,0.002811639,0.004264362,0.008325658,0.004651682,0.005105383,0.001144297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004393611,"about_ca_system_score_gemma":0.005620002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001688354,"about_ca_topic_score_gemma":0.001811113,"domain_scores_codex":[0.9869397,0.00773478,0.0006483711,0.00166464,0.001303705,0.001708847],"domain_scores_gemma":[0.9487278,0.03646955,0.004433316,0.006101478,0.0021132,0.002154565],"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.001601377,0.0007060548,0.000465745,0.0003871795,0.000216202,0.0001807908,0.0003364782,0.5258795,0.002128501,0.4354245,0.004959347,0.0277143],"study_design_scores_gemma":[0.0001783474,0.000123583,0.00008650545,0.00002481698,0.00003968838,0.00003558518,0.00002193051,0.8093188,0.0003523649,0.18941,0.000376777,0.0000316315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04919033,0.0003767331,0.9435964,0.0009824774,0.0002083497,0.0003294406,0.0001534766,0.0007804331,0.004382409],"genre_scores_gemma":[0.8112393,0.0003563923,0.1809317,0.0004001503,0.0002761238,0.0006961837,0.000203713,0.0002861079,0.00561039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01779364,"threshold_uncertainty_score":0.09410292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W199219868","doi":"10.1007/s00224-016-9687-z","title":"Stable Marriage with General Preferences","year":2016,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Stable marriage problem; Generalization; Mathematics; Transitive relation; Matching (statistics); Combinatorics; Partition (number theory); Class (philosophy); Time complexity; Linear programming; Mathematical economics; Mathematical optimization; Computer science","authors":[{"name":"Linda Farczadi","is_ca":false},{"name":"Konstantinos Georgiou","is_ca":true},{"name":"Jochen Könemann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03372601474166294,"gpt":0.2064812948759029,"spread":0.17275528013424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002101941,0.0004994303,0.001596267,0.001225164,0.002548517,0.004214489,0.001820537,0.002444619,0.01296099],"category_scores_gemma":[0.0153412,0.0005980879,0.00110483,0.00203731,0.003423305,0.006786116,0.00215573,0.002621159,0.001116114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001533499,"about_ca_system_score_gemma":0.001226025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002833458,"about_ca_topic_score_gemma":0.002156692,"domain_scores_codex":[0.9975179,0.00128979,0.00008299712,0.0004114539,0.0003441618,0.000353713],"domain_scores_gemma":[0.9902929,0.006058129,0.0008365901,0.001163374,0.0009458388,0.0007031535],"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.0000193584,0.00001508332,0.0001923859,0.00001394347,0.000009091043,0.00003896119,0.0001436412,0.002244743,0.00007734804,0.9941902,0.0007295164,0.00232581],"study_design_scores_gemma":[0.00001110908,0.00000490823,0.00007930287,0.000002748272,0.00000281503,0.00002137747,0.00004332272,0.01118582,0.00002046565,0.9881374,0.0004867891,0.000004009152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.365337,0.001332182,0.5153518,0.007393514,0.0002348115,0.000147581,0.0006680467,0.000258299,0.1092767],"genre_scores_gemma":[0.9618019,0.0004783476,0.01629006,0.0003951893,0.0002178308,0.000109617,0.0002612404,0.00004549508,0.02040029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01296099,"threshold_uncertainty_score":0.04335886,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124257703","doi":"10.1007/s00224-004-1210-2","title":"A Note on MODp - MODm Circuits","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Electronic circuit; Constant (computer programming); Prime (order theory); Mathematics; Layer (electronics); Prime power; Computer science; Discrete mathematics; Arithmetic; Combinatorics; Physics; Nanotechnology; Materials science; Quantum mechanics","authors":[{"name":"Howard Straubing","is_ca":false},{"name":"Denis Thérien","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02779862653046497,"gpt":0.2622752652652693,"spread":0.2344766387348044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001664234,0.001083308,0.001392686,0.002111753,0.003111711,0.003619255,0.002438736,0.002429545,0.01504453],"category_scores_gemma":[0.006260954,0.0006156024,0.001361421,0.003000841,0.005223293,0.01320514,0.004012515,0.008613964,0.002834766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002647751,"about_ca_system_score_gemma":0.000859357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008870723,"about_ca_topic_score_gemma":0.001214264,"domain_scores_codex":[0.998647,0.0003630524,0.00005331686,0.0003269257,0.0004493334,0.0001604325],"domain_scores_gemma":[0.9963565,0.002542928,0.00009121498,0.0006066023,0.0002727735,0.0001299774],"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.00001638013,0.000007281189,0.00005421207,0.00006028358,0.000004637112,0.0000353111,0.0000405939,0.000294348,0.0001632783,0.9681829,0.01985005,0.01129069],"study_design_scores_gemma":[0.000004909682,0.00000784315,0.00006346954,0.00001727086,0.000004846992,0.00007651479,0.00001339702,0.0008338639,0.0002156844,0.9565008,0.04225472,0.000006682824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02432669,0.03532423,0.2005221,0.1021787,0.02512723,0.0001343081,0.001093395,0.0008685093,0.6104248],"genre_scores_gemma":[0.5627427,0.03240059,0.1386903,0.03077866,0.04251773,0.0005297886,0.001070551,0.001098124,0.1901715],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01504453,"threshold_uncertainty_score":0.05032903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973664142","doi":"10.1007/s00224-012-9382-7","title":"(Approximate) Uncertain Skylines","year":2012,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Skyline; Point (geometry); Probability distribution; Set (abstract data type); Simple (philosophy); Computer science; Lying; Construct (python library); Mathematical optimization; Algorithm; Mathematics; Data mining; Statistics; Geometry","authors":[{"name":"Peyman Afshani","is_ca":true},{"name":"Pankaj K. Agarwal","is_ca":false},{"name":"Lars Arge","is_ca":false},{"name":"Kasper Green Larsen","is_ca":false},{"name":"Jeff M. Phillips","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03110128148239794,"gpt":0.2640454652165077,"spread":0.2329441837341097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00183029,0.0007874168,0.001353054,0.002093358,0.0006880626,0.002805951,0.001958159,0.002057564,0.006634775],"category_scores_gemma":[0.02025803,0.0008924336,0.000833068,0.003119976,0.001525117,0.006845,0.001811058,0.002036271,0.0007414579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001543488,"about_ca_system_score_gemma":0.0006945921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00391163,"about_ca_topic_score_gemma":0.003728577,"domain_scores_codex":[0.9985159,0.0004114282,0.00009060532,0.0003852815,0.0004689754,0.0001278237],"domain_scores_gemma":[0.9932809,0.004041898,0.0006774959,0.0009672609,0.0008358039,0.0001965646],"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.0003326747,0.00002924564,0.003366154,0.0003452144,0.00008827267,0.0001838564,0.000171477,0.7182695,0.001402675,0.2175755,0.006311838,0.05192364],"study_design_scores_gemma":[0.00001262359,0.00001566714,0.0004761118,0.00002079028,0.00001245895,0.00009597195,0.00003515693,0.876193,0.000361111,0.1203706,0.002393709,0.00001275817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03489337,0.001113995,0.9576448,0.0008227365,0.0001241681,0.00003148847,0.0009452645,0.0003627452,0.004061527],"genre_scores_gemma":[0.7780836,0.001966416,0.209887,0.0002658138,0.0004351903,0.0001185958,0.002203912,0.0001836154,0.006855916],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006634775,"threshold_uncertainty_score":0.02219552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004793105","doi":"10.1007/s00224-010-9264-9","title":"Tilings and Submonoids of Metabelian Groups","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":15,"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":"Undecidable problem; Mathematics; Rank (graph theory); Group (periodic table); Combinatorics; Wreath product; Free product; Pure mathematics; Discrete mathematics; Product (mathematics); Physics; Decidability","authors":[{"name":"Markus Lohrey","is_ca":false},{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008176804284704712,"gpt":0.2212271870205408,"spread":0.2130503827358361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004562704,0.0004715341,0.0007772027,0.001454841,0.001189772,0.002238181,0.0007498122,0.0007521061,0.005670965],"category_scores_gemma":[0.001600979,0.0003447541,0.0007453919,0.0008636083,0.002349277,0.00271339,0.001542282,0.0008288772,0.0005719278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007274346,"about_ca_system_score_gemma":0.0003512031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007614441,"about_ca_topic_score_gemma":0.0007580486,"domain_scores_codex":[0.9995541,0.0001116654,0.00003854352,0.0001173324,0.000104637,0.00007378442],"domain_scores_gemma":[0.9991099,0.0003632307,0.0001469892,0.0001209423,0.00009820303,0.0001606301],"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.00001722397,0.000006591202,0.0001643015,0.00002407267,0.000005428687,0.0000623916,0.000352279,0.0005640061,0.001197792,0.9921238,0.0003747504,0.005107373],"study_design_scores_gemma":[0.000009669686,0.00001367429,0.0001556331,0.000008809422,0.000004846886,0.00007627778,0.0001099736,0.002541627,0.0004836423,0.9930339,0.00355512,0.0000068246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6268089,0.004945254,0.2905103,0.001440513,0.0006956868,0.00009528604,0.000404445,0.0005030688,0.07459658],"genre_scores_gemma":[0.9461724,0.00108749,0.03468605,0.0002864526,0.0004331258,0.0001235793,0.0002733347,0.0001010127,0.01683667],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005670965,"threshold_uncertainty_score":0.01897126,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076983944","doi":"10.1007/s00224-002-1033-y","title":"Routing in Series Parallel Networks","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Series (stratigraphy); Computer science; Routing (electronic design automation); Parallel computing; Computer network; Geology","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Flaminia L. Luccio","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01461889209426706,"gpt":0.2234483562985752,"spread":0.2088294642043082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005123797,0.0004520004,0.0006435862,0.0008338419,0.000639679,0.001692211,0.0007394052,0.0007159314,0.004987103],"category_scores_gemma":[0.002654178,0.000418169,0.0004182864,0.001195235,0.0007580442,0.001986197,0.0006624716,0.0008131543,0.0006723028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008290913,"about_ca_system_score_gemma":0.0005385289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001006545,"about_ca_topic_score_gemma":0.0009453284,"domain_scores_codex":[0.9996848,0.00009239956,0.0000225502,0.00007225945,0.00009154054,0.00003651799],"domain_scores_gemma":[0.9991252,0.0004134693,0.0001251101,0.0001290105,0.0001485402,0.00005879381],"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.0001218134,0.00005317128,0.0004894658,0.0001674784,0.00003794609,0.0001076066,0.0001120332,0.209804,0.003799998,0.701299,0.008378066,0.07562946],"study_design_scores_gemma":[0.00002315584,0.00003548314,0.0001609652,0.0000187715,0.00002602288,0.00009745127,0.00003020028,0.3670716,0.001016157,0.619724,0.01178488,0.00001131925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08610388,0.004844768,0.8560532,0.002066351,0.0009252579,0.00009216256,0.0002411086,0.0008988383,0.04877447],"genre_scores_gemma":[0.8213844,0.007894067,0.1162286,0.0005344949,0.0009901065,0.000231058,0.0005944971,0.000336843,0.0518058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004987103,"threshold_uncertainty_score":0.01668346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032278054","doi":"10.1007/s00224-014-9557-5","title":"On the Parameterized Complexity of Computing Balanced Partitions in Graphs","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"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":"Parameterized complexity; Combinatorics; Vertex (graph theory); Partition (number theory); Vertex cover; Mathematics; Neighbourhood (mathematics); Time complexity; Feedback vertex set; Graph partition; Constant (computer programming); Graph; Bisection; Computer science; Geometry","authors":[{"name":"René van Bevern","is_ca":false},{"name":"Andreas Emil Feldmann","is_ca":true},{"name":"Manuel Sorge","is_ca":false},{"name":"Ondřej Suchý","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05734722256749251,"gpt":0.3022804971018644,"spread":0.2449332745343719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004428702,0.002153755,0.002921885,0.002055075,0.002536935,0.01010016,0.005693849,0.003402224,0.0198059],"category_scores_gemma":[0.05203515,0.001522506,0.002632414,0.005740599,0.004352526,0.02930056,0.005832007,0.006050079,0.001759176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007420255,"about_ca_system_score_gemma":0.005480756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007207477,"about_ca_topic_score_gemma":0.01193105,"domain_scores_codex":[0.9926969,0.002545571,0.0004754896,0.001438843,0.001707323,0.001135881],"domain_scores_gemma":[0.9278957,0.05943539,0.002281926,0.006872399,0.001884431,0.001630037],"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.003451172,0.0008964982,0.0104246,0.001448335,0.0004220276,0.0003330633,0.001549625,0.4706387,0.009396576,0.3376935,0.02786715,0.1358788],"study_design_scores_gemma":[0.000217467,0.0001106113,0.001217989,0.0000698701,0.0001234797,0.0001177977,0.000331782,0.485323,0.001820855,0.508618,0.002006975,0.0000422309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5070193,0.003546358,0.4347922,0.01338099,0.000571973,0.0004178734,0.004222377,0.003037485,0.0330115],"genre_scores_gemma":[0.8444405,0.001755368,0.1346842,0.00118502,0.0007749504,0.0004693944,0.005368936,0.001531028,0.009790576],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0198059,"threshold_uncertainty_score":0.06625736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3161660208","doi":"10.1007/s002249910005","title":"The Characterization of Data-Accumulating Algorithms","year":2000,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Speedup; Algorithm; Computer science; Parallelism (grammar); Computation; Characterization (materials science); Class (philosophy); Geodetic datum; Unitary state; Parallel algorithm; Parallel computing; Artificial intelligence","authors":[{"name":"Stefan D. Bruda","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04788059028256705,"gpt":0.2927200907847261,"spread":0.2448395005021591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01000435,0.001400896,0.001754811,0.003842694,0.002134497,0.008473361,0.005602179,0.003517116,0.006073756],"category_scores_gemma":[0.08555424,0.001113555,0.001789804,0.00417582,0.004819707,0.01477344,0.004532212,0.004561556,0.001476548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002554839,"about_ca_system_score_gemma":0.003602484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001044069,"about_ca_topic_score_gemma":0.0006865262,"domain_scores_codex":[0.9937599,0.001927811,0.0007668068,0.001365798,0.001640231,0.0005392983],"domain_scores_gemma":[0.9269058,0.04848177,0.004616203,0.009827108,0.008214624,0.00195455],"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.0003062323,0.0001188788,0.002528758,0.0002896578,0.00005302866,0.00008916239,0.0002938941,0.03466844,0.002355405,0.891954,0.003253098,0.06408935],"study_design_scores_gemma":[0.00004246689,0.0001369793,0.0005511903,0.0001027708,0.00004095549,0.0002590367,0.00007216755,0.3691851,0.005048139,0.6194402,0.005084153,0.00003688292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04467928,0.001604185,0.9427801,0.001467697,0.0001635431,0.0001469168,0.0002693741,0.0005918771,0.008297112],"genre_scores_gemma":[0.5114822,0.002331824,0.4689703,0.0009407044,0.0008095679,0.0004444014,0.001339387,0.0008691768,0.01281243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01000435,"threshold_uncertainty_score":0.05290872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092863347","doi":"10.1007/s00224-011-9379-7","title":"Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"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":"Rendezvous; Terrain; Asynchronous communication; Polygon (computer graphics); Computer science; Bounded function; Trajectory; Point (geometry); Algorithm; Mathematics; Geometry; Geography; Frame (networking); Mathematical analysis; Engineering","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Adrian Kosowski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06548969616562526,"gpt":0.2818040062851477,"spread":0.2163143101195225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005492535,0.0005013783,0.001248492,0.0006747906,0.001304453,0.001494471,0.001894104,0.001091535,0.002505022],"category_scores_gemma":[0.005420166,0.0006294657,0.0005526082,0.0006717105,0.001792425,0.001755708,0.002712721,0.0007464891,0.0002620359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009145153,"about_ca_system_score_gemma":0.0006342681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008524616,"about_ca_topic_score_gemma":0.007246266,"domain_scores_codex":[0.9994935,0.0001165902,0.00002702819,0.0001016019,0.0001231723,0.000138027],"domain_scores_gemma":[0.9977183,0.001308292,0.0002807994,0.0002526904,0.000180452,0.0002594675],"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.0003611902,0.00003581469,0.0009006448,0.00005326874,0.0000318826,0.0002319746,0.0001648062,0.952221,0.002075632,0.03731753,0.0005554173,0.00605082],"study_design_scores_gemma":[0.00002633491,0.00001955789,0.0001393789,0.000003336198,0.000006146133,0.00001919582,0.00005041518,0.9862818,0.0004066639,0.01279178,0.0002489003,0.000006539219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6649819,0.0005435252,0.3207848,0.0006131603,0.0001128044,0.00006205658,0.0001792754,0.0003872083,0.0123353],"genre_scores_gemma":[0.9883403,0.00008350724,0.00941324,0.00002121833,0.00001265096,0.00002315292,0.00005345573,0.00003010044,0.00202248],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008524616,"threshold_uncertainty_score":0.01695001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2613137572","doi":"10.1007/s00224-016-9713-1","title":"Separation Logic with One Quantified Variable","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Heap (data structure); Separation logic; Satisfiability; Boolean satisfiability problem; Fragment (logic); PSPACE; Mathematics; MAGIC (telescope); True quantified Boolean formula; Variable (mathematics); Discrete mathematics; Algorithm; Computer science; Theoretical computer science; Computational complexity theory","authors":[{"name":"Stéphane Demri","is_ca":false},{"name":"Didier Galmiche","is_ca":true},{"name":"Dominique Larchey-Wendling","is_ca":true},{"name":"Daniel Méry","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04982199439789516,"gpt":0.2871277628121783,"spread":0.2373057684142832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001995968,0.0007798772,0.00105586,0.001648682,0.002005977,0.005082151,0.002072625,0.001401162,0.006731445],"category_scores_gemma":[0.003730424,0.0007209043,0.001625892,0.002059715,0.005339935,0.009779876,0.004131431,0.006752786,0.001898079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002172145,"about_ca_system_score_gemma":0.002354962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001025711,"about_ca_topic_score_gemma":0.001004737,"domain_scores_codex":[0.997499,0.0006896274,0.0001742746,0.000566376,0.0007869369,0.0002836452],"domain_scores_gemma":[0.9976304,0.001111829,0.0001555753,0.0005792714,0.000331071,0.0001918484],"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.0000291982,0.00001325986,0.00006223219,0.00005008023,0.000009385678,0.00001939633,0.00007428476,0.000536735,0.000356968,0.9883562,0.001406124,0.009086118],"study_design_scores_gemma":[0.00001568055,0.000007580208,0.00003079421,0.00001546331,0.0000158761,0.00004490618,0.00001748742,0.003900063,0.0006372856,0.9894075,0.005896532,0.00001086848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009581872,0.001563623,0.9539895,0.002860882,0.0005155074,0.00003822741,0.0003234175,0.0008106621,0.03031629],"genre_scores_gemma":[0.5028682,0.002223585,0.4609412,0.002276161,0.001255115,0.000158899,0.0007340104,0.000444296,0.02909853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006731445,"threshold_uncertainty_score":0.02251893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107000858","doi":"10.1007/s00224-007-9049-y","title":"Incremental Branching Programs","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"McGill University","keywords":"Branching (polymer chemistry); Nondeterministic algorithm; Computation; Computer science; Exponential function; Mathematics; Combinatorics; Discrete mathematics; Algorithm","authors":[{"name":"Anna Gál","is_ca":false},{"name":"Michal Koucký","is_ca":false},{"name":"Pierre McKenzie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0161668605177624,"gpt":0.2463214989355354,"spread":0.230154638417773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007118579,0.000601346,0.0006487404,0.001259205,0.001488863,0.002937755,0.001367635,0.0009627031,0.01534995],"category_scores_gemma":[0.003570311,0.0004744285,0.000867907,0.001709293,0.002285361,0.006129369,0.002308257,0.003223325,0.001694841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001715917,"about_ca_system_score_gemma":0.0009692102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001291764,"about_ca_topic_score_gemma":0.001432488,"domain_scores_codex":[0.9992309,0.0001760506,0.00003674769,0.0001826499,0.0002743589,0.00009945939],"domain_scores_gemma":[0.9979875,0.001166519,0.00006895375,0.000309067,0.0003187243,0.0001491217],"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.0000214367,0.00001846242,0.0001024134,0.00002797545,0.000004440823,0.00002697582,0.0001194649,0.0009197171,0.0004639227,0.9843915,0.002018349,0.01188546],"study_design_scores_gemma":[0.00000871098,0.000007129624,0.00008733719,0.000009091254,0.00001195042,0.00003726781,0.00003081876,0.007599052,0.000563389,0.9839197,0.007719901,0.000005629899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06041007,0.001753516,0.6896561,0.003198141,0.0004169704,0.0001651908,0.0007661605,0.002040592,0.2415933],"genre_scores_gemma":[0.7881413,0.001316505,0.1347962,0.0007716697,0.0005165937,0.0002472384,0.001138812,0.0005427757,0.07252906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01534995,"threshold_uncertainty_score":0.05135071,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096830858","doi":"10.1007/s00224-014-9539-7","title":"Probabilistic k-Median Clustering in Data Streams","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"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":"Probabilistic logic; Mathematics; Cluster analysis; Representation (politics); Metric (unit); Probability distribution; Euclidean geometry; Point (geometry); Probabilistic analysis of algorithms; Combinatorics; Statistics","authors":[{"name":"Christiane Lammersen","is_ca":true},{"name":"Melanie Schmidt","is_ca":false},{"name":"Christian Sohler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03428720038795635,"gpt":0.2571392949994608,"spread":0.2228520946115044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005619589,0.0007239535,0.002510605,0.002597556,0.001394734,0.002937029,0.003353501,0.002251491,0.001571546],"category_scores_gemma":[0.0246875,0.001154367,0.001394384,0.004352227,0.001561441,0.004481504,0.002188617,0.001874874,0.0005373481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002183562,"about_ca_system_score_gemma":0.001547537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004731608,"about_ca_topic_score_gemma":0.003773918,"domain_scores_codex":[0.9964414,0.001128892,0.000315441,0.0007546116,0.001068683,0.0002908161],"domain_scores_gemma":[0.9883744,0.007418655,0.0009569821,0.001120878,0.001796031,0.0003331091],"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.0005072544,0.00009071727,0.002881279,0.0002228127,0.0001171029,0.0001099933,0.0002718801,0.8565718,0.00137186,0.06582125,0.002330668,0.06970332],"study_design_scores_gemma":[0.000007724105,0.00001198798,0.0002168287,0.000007941034,0.000006783321,0.00002320094,0.00002807562,0.9679255,0.0003042706,0.03106951,0.0003891258,0.000008908764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01593732,0.0003736163,0.9826132,0.0002474271,0.00005388169,0.00003716746,0.0001186883,0.0002399994,0.0003787543],"genre_scores_gemma":[0.6282867,0.001217302,0.3640312,0.0001562156,0.0003998935,0.0002812068,0.001071751,0.0002552545,0.004300567],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005619589,"threshold_uncertainty_score":0.02971959,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962904359","doi":"10.1007/s00224-017-9803-8","title":"Syntactic Complexity of Regular Ideals","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"European Social Fund; Uniwersytet Wrocławski; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; European Commission; Narodowe Centrum Nauki; University of Toronto; Narodowym Centrum Nauki","keywords":"Regular language; Cardinality (data modeling); Suffix; Mathematics; Prefix; Discrete mathematics; Nondeterministic finite automaton; Descriptive complexity theory; Combinatorics; Computer science; Time complexity; Automaton; Automata theory; Linguistics; Theoretical computer science","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Marek Szykuła","is_ca":false},{"name":"Yuli Ye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05201520097610158,"gpt":0.2847825039784081,"spread":0.2327673030023065,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001512464,0.000310975,0.0007296733,0.001109972,0.001834692,0.003266437,0.001084737,0.0005798755,0.005699026],"category_scores_gemma":[0.00766384,0.0005835329,0.001610799,0.0005416189,0.003218694,0.005724134,0.00254102,0.001841669,0.0005141885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001941206,"about_ca_system_score_gemma":0.001644219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001236394,"about_ca_topic_score_gemma":0.001198534,"domain_scores_codex":[0.9972649,0.000391741,0.0002712481,0.0005787293,0.000941258,0.0005520938],"domain_scores_gemma":[0.9877735,0.007551041,0.001289806,0.001430484,0.001310752,0.0006444501],"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.0004622758,0.0001394486,0.007289138,0.0002510452,0.00005035154,0.0004045434,0.001953486,0.03203704,0.02422583,0.9142721,0.001982539,0.01693224],"study_design_scores_gemma":[0.00002753018,0.00007749991,0.002520562,0.00002509268,0.00004734557,0.0003194844,0.0003488684,0.07103628,0.01468574,0.9072887,0.003566654,0.00005622024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.826318,0.0002793368,0.1365557,0.001360273,0.00005765806,0.0001218187,0.0007678297,0.0005645077,0.03397495],"genre_scores_gemma":[0.9776689,0.0001107026,0.01791808,0.00009460134,0.0000773154,0.0001063113,0.0005011044,0.00008116219,0.003441741],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005699026,"threshold_uncertainty_score":0.0190652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086421997","doi":"10.1007/s00224-005-1206-6","title":"Useful Templates and Iterated Template-Guided DNA Recombination in Ciliates","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Protist diversity and phylogeny","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Template; Recombination; Biology; Materials science; Genetics; Nanotechnology; Gene","authors":[{"name":"Mark Daley","is_ca":true},{"name":"Ian McQuillan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01800312734117122,"gpt":0.2428619670079017,"spread":0.2248588396667305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008824508,0.0002789592,0.0006017723,0.0005632363,0.0009611616,0.001683898,0.001587908,0.001900631,0.001142109],"category_scores_gemma":[0.004567989,0.0005133518,0.0007363187,0.0004339658,0.002154534,0.001730232,0.001059302,0.001224651,0.0003183702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001028136,"about_ca_system_score_gemma":0.0005673873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006558951,"about_ca_topic_score_gemma":0.0006410962,"domain_scores_codex":[0.9994524,0.0001428315,0.00003731547,0.00008849371,0.0001968642,0.00008214201],"domain_scores_gemma":[0.9977736,0.001325615,0.0002327534,0.0003765586,0.0001453831,0.0001461506],"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.0001015588,0.00003925687,0.0007888986,0.0001036014,0.00002062286,0.0003650684,0.0005689636,0.0665705,0.03362517,0.8802443,0.0006168049,0.01695535],"study_design_scores_gemma":[0.00003627364,0.00006901881,0.0004206222,0.0000242282,0.00001838887,0.0002810407,0.0001390537,0.3010706,0.01889026,0.6766697,0.002344128,0.00003668912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5926141,0.002395261,0.3855121,0.001354687,0.0001673461,0.00005555234,0.0001154553,0.0005779673,0.01720758],"genre_scores_gemma":[0.9705692,0.000515277,0.02612682,0.00008534648,0.00003223393,0.00005524153,0.00007016769,0.00009946643,0.002446295],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001900631,"threshold_uncertainty_score":0.0074597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114282507","doi":"10.1007/s00224-013-9462-3","title":"Braess’s Paradox for Flows over Time","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":11,"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":"Transpose; Conjecture; Flow (mathematics); Network topology; Context (archaeology); Mathematics; Computer science; Flow network; Mathematical economics; Topology (electrical circuits); Mathematical optimization; Discrete mathematics; Combinatorics; Physics; Geometry; Geology; Quantum mechanics","authors":[{"name":"Martin Macko","is_ca":false},{"name":"Kate Larson","is_ca":true},{"name":"Ľuboš Steskal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06699727172578591,"gpt":0.3527810848969236,"spread":0.2857838131711377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009517485,0.0007123458,0.001979853,0.002252463,0.002949549,0.008172478,0.002312618,0.004909772,0.0112312],"category_scores_gemma":[0.05061348,0.0006526952,0.001525678,0.002335452,0.01051218,0.02295928,0.003974467,0.006207955,0.0006980773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003407815,"about_ca_system_score_gemma":0.003049714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002594262,"about_ca_topic_score_gemma":0.001483812,"domain_scores_codex":[0.9954914,0.002178974,0.0002886517,0.0007028066,0.0008976184,0.0004405843],"domain_scores_gemma":[0.971224,0.02220918,0.001111323,0.002506695,0.001625969,0.001322758],"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.00001053503,0.000005289078,0.00003817794,0.00001610989,0.0000053589,0.00001433725,0.00007531852,0.0012382,0.00003484262,0.997116,0.0004686018,0.0009772948],"study_design_scores_gemma":[0.000006254687,0.000001928755,0.00001512817,0.000005179639,0.000002070723,0.000009785045,0.00001593196,0.003454086,0.00001325745,0.9959592,0.0005137848,0.000003429444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1326022,0.005509906,0.6859211,0.03359161,0.00101769,0.0001830419,0.0006646637,0.0002437548,0.140266],"genre_scores_gemma":[0.9152,0.002006091,0.06070184,0.00188805,0.000593786,0.0002626603,0.0001650642,0.0001086161,0.01907387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0112312,"threshold_uncertainty_score":0.05033392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168635355","doi":"10.1007/s00224-010-9254-y","title":"On the Complexity of Computing Winning Strategies for Finite Poset Games","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Partially ordered set; Infimum and supremum; Combinatorial game theory; PSPACE; Argument (complex analysis); Mathematics; Combinatorics; Game theory; Simple (philosophy); Theoretical computer science; Computer science; Discrete mathematics; Computational complexity theory; Mathematical economics; Sequential game; Algorithm; Epistemology","authors":[{"name":"Michael Soltys","is_ca":true},{"name":"Craig Wilson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08009168828994542,"gpt":0.3117809293778928,"spread":0.2316892410879473,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006983059,0.002069645,0.004196083,0.003626388,0.003924009,0.01738491,0.0057774,0.004627633,0.01756575],"category_scores_gemma":[0.07100796,0.002281482,0.005232539,0.005061761,0.007896888,0.03678782,0.009071345,0.009839365,0.001452027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007131466,"about_ca_system_score_gemma":0.005694937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007706684,"about_ca_topic_score_gemma":0.009402787,"domain_scores_codex":[0.9869469,0.004195576,0.001160444,0.002240107,0.003582067,0.001874864],"domain_scores_gemma":[0.8783607,0.1086818,0.002803382,0.00526338,0.002529213,0.00236157],"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.001443399,0.0006289858,0.005645386,0.0007725141,0.000330577,0.0003162662,0.001836339,0.1130409,0.002067834,0.8176292,0.00873681,0.04755175],"study_design_scores_gemma":[0.00009260918,0.00004938935,0.0004140315,0.00003452368,0.00006739113,0.00007291696,0.0001809638,0.1156038,0.000518312,0.8820969,0.0008292726,0.00003996503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3831392,0.002378809,0.5457851,0.01184543,0.0003923346,0.0006158431,0.002236584,0.00147107,0.05213572],"genre_scores_gemma":[0.8772387,0.001364098,0.1061981,0.0009493255,0.0005730742,0.0005254118,0.002825787,0.0005785375,0.009746979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01756575,"threshold_uncertainty_score":0.05876333,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2943463427","doi":"10.1007/s00224-005-1139-0","title":"Bounded-Degree Independent Sets in Planar Graphs","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"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":"Combinatorics; Independent set; Mathematics; Bounded function; Maximal independent set; Degree (music); Planar graph; Discrete mathematics; Graph; Set (abstract data type); Planar; Planar straight-line graph; 1-planar graph; Chordal graph; Computer science; Physics","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Dana Wilkinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02799329073985854,"gpt":0.2603683244860735,"spread":0.232375033746215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095047,0.0008085959,0.001594901,0.002650817,0.002133148,0.004129577,0.003071997,0.001858332,0.005544243],"category_scores_gemma":[0.01094491,0.001570032,0.001027646,0.00346545,0.003110969,0.005347424,0.003098771,0.003511423,0.0006159393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001926843,"about_ca_system_score_gemma":0.0008885848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002092068,"about_ca_topic_score_gemma":0.002867449,"domain_scores_codex":[0.9987645,0.0003335367,0.00005619137,0.0002070785,0.0004519879,0.0001867105],"domain_scores_gemma":[0.9879327,0.009300286,0.0008363802,0.0006609848,0.0005893359,0.0006802447],"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.00009697223,0.00005910943,0.0006234733,0.0001372373,0.00002838001,0.00009687656,0.0003862004,0.03828539,0.001047545,0.9440096,0.002729021,0.01250022],"study_design_scores_gemma":[0.00002335455,0.000009974599,0.0002858973,0.00002006529,0.00001699535,0.00005981171,0.00009774787,0.05073655,0.0004867339,0.9468314,0.001421045,0.00001040762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4443038,0.002484068,0.5091069,0.002981856,0.0001752545,0.0001480715,0.0009219737,0.0004782411,0.03939985],"genre_scores_gemma":[0.9247966,0.001995041,0.0567077,0.0003730326,0.0002418259,0.000272,0.001017636,0.0001992401,0.0143968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005544243,"threshold_uncertainty_score":0.01854736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030552895","doi":"10.1007/s00224-007-1325-3","title":"Algorithms in the W-Hierarchy","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"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":"Hierarchy; Intersection (aeronautics); Mathematical proof; Extension (predicate logic); Set (abstract data type); Mathematics; Upper and lower bounds; Algorithm; Computer science; State (computer science); Discrete mathematics; Finite-state machine; Combinatorics; Theoretical computer science; Programming language; Engineering","authors":[{"name":"Jonathan F. Buss","is_ca":true},{"name":"Tarique Islam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0302898493409319,"gpt":0.3155309478931336,"spread":0.2852410985522017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002377224,0.0007417723,0.001736294,0.002683269,0.002649887,0.005509336,0.002667733,0.00181692,0.0111618],"category_scores_gemma":[0.01162551,0.000851863,0.001447891,0.004408278,0.003262205,0.01513242,0.003715116,0.003941942,0.002042321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003237151,"about_ca_system_score_gemma":0.002019197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005127763,"about_ca_topic_score_gemma":0.005264961,"domain_scores_codex":[0.9974855,0.0007389062,0.0001688534,0.0004709523,0.0006455022,0.0004901767],"domain_scores_gemma":[0.9938954,0.003472807,0.0003674645,0.001168088,0.0006246234,0.0004716987],"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.00003856732,0.00002696801,0.000219393,0.00008048942,0.000015306,0.00002439393,0.0001523505,0.002142381,0.0002641765,0.9721657,0.003535033,0.02133528],"study_design_scores_gemma":[0.0000141518,0.000007329802,0.00007819015,0.00001582587,0.0000072476,0.00002424122,0.00003820046,0.009977609,0.0001257051,0.9868171,0.00288894,0.000005509016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1013794,0.00585195,0.7785617,0.008783959,0.0004275225,0.0001576764,0.0006432518,0.001388681,0.1028059],"genre_scores_gemma":[0.6354263,0.004186235,0.3117497,0.002076008,0.000823997,0.0003140044,0.001025518,0.0007030076,0.04369526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0111618,"threshold_uncertainty_score":0.03733993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2467644617","doi":"10.1007/s00224-015-9649-x","title":"On the Advice Complexity of the k-server Problem Under Sparse Metrics","year":2015,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"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":"Treewidth; Advice (programming); Combinatorics; Binary logarithm; Competitive analysis; Mathematics; Online algorithm; Metric space; Discrete mathematics; Upper and lower bounds; Sequence (biology); Metric (unit); Tree (set theory); Deterministic algorithm; Path (computing); Time complexity; Graph; Algorithm; Computer science; Pathwidth; Line graph","authors":[{"name":"Sushmita Gupta","is_ca":false},{"name":"Shahin Kamali","is_ca":true},{"name":"Alejandro López-Ortíz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1207327124076679,"gpt":0.2864676065370435,"spread":0.1657348941293756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006391812,0.002024957,0.004818555,0.002247857,0.002161433,0.006033253,0.005597012,0.005806283,0.01908991],"category_scores_gemma":[0.08712261,0.001457072,0.001456605,0.003905392,0.00531318,0.01724506,0.005511644,0.007830597,0.001518933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005153745,"about_ca_system_score_gemma":0.005132949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007358145,"about_ca_topic_score_gemma":0.006759627,"domain_scores_codex":[0.9934783,0.002748414,0.000310075,0.0008764483,0.001535522,0.001051256],"domain_scores_gemma":[0.8734667,0.1120906,0.003454947,0.004091833,0.003613921,0.003282044],"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.001206994,0.0003769221,0.003075483,0.0007630459,0.0001515354,0.0002643509,0.0007497999,0.2439651,0.00179893,0.6887338,0.02489131,0.03402265],"study_design_scores_gemma":[0.0001094889,0.00004868996,0.0005422097,0.00004585524,0.00002975157,0.00007066924,0.0001021743,0.4773383,0.0002115566,0.5206671,0.00080119,0.0000330338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3141484,0.006309311,0.5849891,0.03573401,0.0008123221,0.0004250627,0.003091337,0.001191835,0.05329864],"genre_scores_gemma":[0.8930582,0.00393094,0.07613857,0.001866992,0.001779699,0.000577081,0.002030386,0.0007918868,0.01982617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01908991,"threshold_uncertainty_score":0.06386209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076003965","doi":"10.1007/s00224-003-1082-x","title":"Automatable Verification of Sequential Consistency","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"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":"Undecidable problem; Consistency model; Sequential consistency; Computer science; Consistency (knowledge bases); Decidability; Class (philosophy); Protocol (science); Task (project management); Theoretical computer science; State (computer science); Multiprocessing; Programming language; Finite-state machine; Model checking; Parallel computing; Artificial intelligence; Correctness","authors":[{"name":"Anne Condon","is_ca":true},{"name":"Alan J. Hu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02071184204497678,"gpt":0.2472285293384058,"spread":0.226516687293429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005677766,0.001090902,0.001472726,0.001521809,0.002030646,0.004294088,0.003521275,0.002346154,0.0068746],"category_scores_gemma":[0.03811319,0.001418083,0.002633989,0.00110125,0.006176226,0.00880583,0.005254475,0.005925876,0.001056662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003147705,"about_ca_system_score_gemma":0.005204245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005326563,"about_ca_topic_score_gemma":0.006277114,"domain_scores_codex":[0.9901953,0.00325729,0.0007237068,0.001671584,0.0029793,0.001172772],"domain_scores_gemma":[0.9335933,0.04880038,0.001997391,0.009373754,0.005480037,0.0007550719],"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.001188998,0.0003252063,0.002154763,0.000484978,0.0001822588,0.0005807913,0.0009679937,0.0908497,0.01552686,0.8296221,0.005936623,0.05217961],"study_design_scores_gemma":[0.0001899408,0.00007799536,0.0002230845,0.00004531493,0.00007801975,0.00008371064,0.00008792987,0.2913494,0.01530819,0.6896642,0.002848379,0.00004381372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06523935,0.0001918661,0.9167036,0.001631638,0.0004072678,0.0002110563,0.00039182,0.00501517,0.01020829],"genre_scores_gemma":[0.8666423,0.0001406533,0.1260591,0.0005487009,0.0002026474,0.0002593887,0.0005243405,0.0005222787,0.005100468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0068746,"threshold_uncertainty_score":0.03002721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2942711255","doi":"10.1007/s00224-021-10059-4","title":"The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is)","year":2022,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Common value auction; Monotonic function; Anomaly (physics); Economics; Mathematical economics; Econometrics; Microeconomics; Computer science; Mathematics","authors":[{"name":"Vishnu V. Narayan","is_ca":true},{"name":"Enguerrand Prebet","is_ca":false},{"name":"Adrian Vetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1529755991396964,"gpt":0.3846520602568345,"spread":0.2316764611171381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004939044,0.0004781821,0.002312315,0.001061794,0.001366475,0.003030061,0.003030313,0.002119051,0.008547349],"category_scores_gemma":[0.0543176,0.0006626952,0.001083712,0.002362854,0.004010253,0.01184401,0.001930548,0.00403682,0.000845838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001295155,"about_ca_system_score_gemma":0.001356978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001678826,"about_ca_topic_score_gemma":0.001138038,"domain_scores_codex":[0.9970596,0.0006312969,0.0002228468,0.0008401341,0.0008512347,0.0003948045],"domain_scores_gemma":[0.9700095,0.01334563,0.004854233,0.007308843,0.003255871,0.001225921],"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.0004086625,0.0001594793,0.009094943,0.000308791,0.0001078699,0.0004696598,0.0004110906,0.008197749,0.003313863,0.926549,0.007155791,0.04382315],"study_design_scores_gemma":[0.00002576324,0.00006150299,0.002688031,0.00001632546,0.00001946656,0.0005849363,0.0001064686,0.03389666,0.0006668194,0.9602324,0.001677722,0.00002386494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5132348,0.001500885,0.4077605,0.01229587,0.0006402989,0.00007084415,0.0007027736,0.002085092,0.06170893],"genre_scores_gemma":[0.9819024,0.0003358206,0.01219453,0.0008144056,0.0002685802,0.0000325006,0.0001713293,0.0001983062,0.004082222],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008547349,"threshold_uncertainty_score":0.02859366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2885021324","doi":"10.1007/s00224-018-9876-z","title":"Computing Parameters of Sequence-Based Dynamic Graphs","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Sequence (biology); Bounded function; Amortized analysis; Computer science; Maximization; Algorithm; Minification; Graph; Combinatorics; Mathematics; Discrete mathematics; Mathematical optimization; Data structure","authors":[{"name":"Arnaud Casteigts","is_ca":false},{"name":"Ralf Klasing","is_ca":false},{"name":"Yessin M. Neggaz","is_ca":false},{"name":"Joseph G. Peters","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03470963640328709,"gpt":0.2690888536117062,"spread":0.2343792172084191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001295038,0.0007552901,0.0009685161,0.002745314,0.0007112026,0.002881797,0.002300438,0.001351665,0.003562782],"category_scores_gemma":[0.02054608,0.0006237235,0.0004721682,0.002591032,0.001393496,0.006922144,0.00168076,0.001426436,0.0004687966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002231989,"about_ca_system_score_gemma":0.0009664085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002528779,"about_ca_topic_score_gemma":0.002603126,"domain_scores_codex":[0.99911,0.0002244471,0.0000610315,0.0002689002,0.0002257738,0.0001097969],"domain_scores_gemma":[0.9911192,0.005652652,0.0008067148,0.001116223,0.0008573171,0.0004478813],"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.0002777,0.00008432179,0.002978765,0.0001053728,0.00004570361,0.0001014508,0.0002752327,0.7731445,0.004527148,0.1803896,0.001085497,0.03698468],"study_design_scores_gemma":[0.000009826485,0.00001925774,0.0002461405,0.00001223304,0.000009240394,0.0000322989,0.0000530595,0.8521883,0.001181983,0.1456826,0.0005520858,0.0000129361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2398407,0.000255434,0.7537508,0.0003425688,0.00005985653,0.00009548258,0.0004941,0.0007604583,0.004400605],"genre_scores_gemma":[0.9449167,0.0001978184,0.0525465,0.00004542389,0.00003457239,0.00008966721,0.0004535422,0.0001689652,0.00154682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003562782,"threshold_uncertainty_score":0.01619428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2179209375","doi":"10.1007/s00224-011-9343-6","title":"The Feline Josephus Problem","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Fibonacci number; Element (criminal law); Sequence (biology); Value (mathematics); Combinatorics; Mathematics; Order (exchange); Position (finance); Arithmetic; Constant (computer programming); Computer science; Statistics; Law","authors":[{"name":"Frank Ruskey","is_ca":true},{"name":"Aaron Williams","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.077392365069908,"gpt":0.2993293293321627,"spread":0.2219369642622547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001111561,0.0003376401,0.0009431815,0.001030283,0.004243305,0.003245109,0.001235813,0.003104342,0.01573987],"category_scores_gemma":[0.007137448,0.0003311075,0.0005345645,0.001214436,0.003827057,0.007053902,0.002383258,0.00385682,0.001350633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002199803,"about_ca_system_score_gemma":0.0014413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00250148,"about_ca_topic_score_gemma":0.002293917,"domain_scores_codex":[0.9992594,0.0002184869,0.00002309482,0.0001609781,0.0001919138,0.0001461022],"domain_scores_gemma":[0.9981788,0.001127101,0.00008742528,0.000213981,0.0002066478,0.0001859154],"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.00001508707,0.00000737233,0.00005029585,0.00001719473,0.000002569257,0.00001907032,0.00006400028,0.0004424136,0.00005375551,0.9893917,0.006211841,0.00372456],"study_design_scores_gemma":[0.00000867739,0.000002745041,0.0000462235,0.000008185877,0.000002503327,0.00003141063,0.00006491443,0.001895377,0.0001149939,0.988152,0.009668524,0.000004443548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1445678,0.004714209,0.09228978,0.06578783,0.001990655,0.00006593332,0.0006293667,0.0003910205,0.6895634],"genre_scores_gemma":[0.8749222,0.002404383,0.01820469,0.003331755,0.001366979,0.00007919662,0.0003786527,0.0001655579,0.09914658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01573987,"threshold_uncertainty_score":0.0526551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985257126","doi":"10.1007/s00224-008-9110-5","title":"Structural Recursion as a Query Language on Lists and Ordered Trees","year":2008,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Recursion (computer science); Computer science; Query language; Query optimization; Programming language; Theoretical computer science; Information retrieval","authors":[{"name":"Edward L. Robertson","is_ca":false},{"name":"Lawrence V. Saxton","is_ca":true},{"name":"Dirk Van Gucht","is_ca":false},{"name":"Stijn Vansummeren","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02133140059131159,"gpt":0.2570534105745805,"spread":0.2357220099832689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007715653,0.0007790583,0.002160206,0.003971736,0.00304459,0.01039399,0.003922279,0.003306752,0.007434961],"category_scores_gemma":[0.02176787,0.001676375,0.002708877,0.008337765,0.008862937,0.03264302,0.005497718,0.00453847,0.001539656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00504132,"about_ca_system_score_gemma":0.003577108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009158516,"about_ca_topic_score_gemma":0.007981608,"domain_scores_codex":[0.9923201,0.003166072,0.0008971898,0.0009931887,0.002011432,0.0006120176],"domain_scores_gemma":[0.9847644,0.01033605,0.0008347385,0.001866863,0.001743094,0.0004548812],"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.00002046937,0.000008152671,0.00007874228,0.00003465055,0.000005341826,0.00002422173,0.000388718,0.001413677,0.0002546112,0.9934282,0.0007490472,0.003594167],"study_design_scores_gemma":[0.00001666184,0.00001039385,0.00003590038,0.0000229844,0.00001875941,0.00005061115,0.00009650849,0.01563833,0.0004149103,0.9777994,0.005875874,0.00001981082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0166338,0.00120819,0.9672867,0.002643073,0.0001486026,0.00009068912,0.0005179776,0.001444134,0.0100268],"genre_scores_gemma":[0.4329337,0.002117697,0.5474151,0.001360559,0.0005043762,0.000478484,0.001470772,0.001106601,0.01261264],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01039399,"threshold_uncertainty_score":0.0408048,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064923761","doi":"10.1007/s00224-001-1037-z","title":"Pursuit and Evasion on a Ring: An Infinite Hierarchy for Parallel Real-Time Systems","year":2001,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Hierarchy; Integer (computer science); Ring (chemistry); Computer science; Computation; Parallel computing; Memory hierarchy; Execution time; Real number; Algorithm; Discrete mathematics; Mathematics; Programming language","authors":[{"name":"Stefan D. Bruda","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05175340958556925,"gpt":0.3125254380226435,"spread":0.2607720284370743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002860798,0.0006881016,0.001675831,0.001732357,0.002919226,0.005940985,0.002593216,0.001878026,0.007093694],"category_scores_gemma":[0.01167746,0.0007952588,0.001422342,0.001409321,0.006194836,0.01038229,0.004085302,0.003521437,0.0007485771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00260542,"about_ca_system_score_gemma":0.002276177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002702956,"about_ca_topic_score_gemma":0.002253733,"domain_scores_codex":[0.9969254,0.0008246983,0.0002158622,0.0005276094,0.0009274026,0.0005790264],"domain_scores_gemma":[0.989089,0.00599852,0.0007617762,0.002000817,0.001039735,0.001110205],"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.00007640344,0.00003486651,0.0003102524,0.000080519,0.00001605545,0.00007918551,0.0004256162,0.01092804,0.0009169454,0.9781429,0.0005739896,0.008415238],"study_design_scores_gemma":[0.00003415857,0.00004229028,0.0001231394,0.00002211857,0.00002267789,0.00007368266,0.0001276945,0.1024956,0.000519636,0.8939955,0.002521707,0.00002181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1955232,0.001745671,0.7254617,0.003250349,0.0001363897,0.0001750804,0.0002271204,0.0006999798,0.07278053],"genre_scores_gemma":[0.8922987,0.0009846368,0.09111553,0.0001940282,0.0001721099,0.0001666388,0.0001603815,0.0001313448,0.01477664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007093694,"threshold_uncertainty_score":0.02373075,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1602585208","doi":"10.1007/s00224-003-1126-2","title":"Asymmetric Communication Protocols via Hotlink Assignments","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Computer science; Protocol (science); Communications protocol; Theoretical computer science; Computer network; Distributed computing","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":false},{"name":"Stefan Langerman","is_ca":true},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03579338451336043,"gpt":0.2865977298048002,"spread":0.2508043452914398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004124307,0.0009258536,0.001536391,0.001986983,0.003482521,0.00597386,0.003654625,0.002337064,0.01589416],"category_scores_gemma":[0.02018959,0.001113671,0.0008627249,0.002813976,0.003892162,0.01712411,0.009587073,0.004860964,0.00237498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001637288,"about_ca_system_score_gemma":0.001260168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004084963,"about_ca_topic_score_gemma":0.0005962853,"domain_scores_codex":[0.9941855,0.00256895,0.0002504755,0.0007673334,0.001346817,0.0008809838],"domain_scores_gemma":[0.9723496,0.01531114,0.001964613,0.00727717,0.001600368,0.001497008],"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.000374211,0.0001474331,0.0002564422,0.0001000453,0.00002695861,0.0000699444,0.0003842178,0.01902403,0.001531106,0.9433796,0.004950597,0.02975538],"study_design_scores_gemma":[0.00006072289,0.0000421304,0.00008883252,0.00001744847,0.00002800675,0.00006254655,0.0001137245,0.09627722,0.001914427,0.8966649,0.004701334,0.00002879479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08163315,0.0004194348,0.8784667,0.002024842,0.0003567208,0.0002697949,0.000260152,0.001270463,0.03529869],"genre_scores_gemma":[0.8545209,0.0006256503,0.1137042,0.0009032237,0.0006241408,0.0006576888,0.0004200863,0.0004575401,0.02808664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01589416,"threshold_uncertainty_score":0.05317134,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2807933378","doi":"10.1007/s00224-019-09955-7","title":"Advice Complexity of Priority Algorithms","year":2019,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Advice (programming); Oracle; Computer science; Reduction (mathematics); Mathematical proof; Function (biology); Algorithm; Matching (statistics); Adversary; Greedy algorithm; Upper and lower bounds; Theoretical computer science; Mathematics; Programming language; Computer security","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Joan Boyar","is_ca":false},{"name":"Kim S. Larsen","is_ca":false},{"name":"Denis Pankratov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03455034673156813,"gpt":0.2786913157960295,"spread":0.2441409690644613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005736406,0.001061981,0.002488524,0.001939797,0.002329604,0.008472776,0.004384428,0.003982607,0.02382311],"category_scores_gemma":[0.08011673,0.001110233,0.0016112,0.00279047,0.003750682,0.01547057,0.003548514,0.007113153,0.002017262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005335697,"about_ca_system_score_gemma":0.005805817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004591542,"about_ca_topic_score_gemma":0.004711099,"domain_scores_codex":[0.9910759,0.002921956,0.0003967563,0.001085122,0.003021377,0.001498948],"domain_scores_gemma":[0.913891,0.07249784,0.001983098,0.005207081,0.003872358,0.002548718],"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.001002845,0.0002855203,0.002141514,0.0003444479,0.00007844108,0.0001063096,0.0004882083,0.05905765,0.001408304,0.8804688,0.01392846,0.04068965],"study_design_scores_gemma":[0.0001296834,0.00004614661,0.0004627699,0.0000232543,0.0000414186,0.00005532087,0.00005903361,0.2149717,0.0004928312,0.7822586,0.001440774,0.00001843286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2553693,0.002478911,0.6223446,0.01812435,0.000736533,0.0002715047,0.001238781,0.001592311,0.09784368],"genre_scores_gemma":[0.8961949,0.001211094,0.07188331,0.001325687,0.001072766,0.0002942269,0.001065799,0.0006767888,0.02627543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02382311,"threshold_uncertainty_score":0.07969624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}