{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":109,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":109,"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"},"query_hash":"3764d43a42ae","filters":{"venue":"Journal of Computer and System Sciences"}},"results":[{"id":"W1872909421","doi":"10.1006/jcss.2000.1732","title":"Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity","year":2001,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":230,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Quantum walk; Unitary state; Computation; Quantum computer; Quantum algorithm; Mathematics; Quantum; Random walk; Discrete mathematics; Computer science; Algorithm; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01560902829208805,"gpt":0.251137507748184,"spread":0.235528479456096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001103123,0.0001196284,0.000402754,0.0002854738,0.000277119,0.0002093313,0.0004232177,0.00004302254,6.636781e-7],"category_scores_gemma":[0.00002579073,0.00007891786,0.00008535136,0.0005708431,0.0002472932,0.0003275952,0.0001369505,0.000145151,1.897915e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009862993,"about_ca_system_score_gemma":0.00007449299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001682949,"about_ca_topic_score_gemma":0.000003960544,"domain_scores_codex":[0.9984828,0.0002373559,0.0004765142,0.0002205523,0.0003990789,0.0001837377],"domain_scores_gemma":[0.9984362,0.0007507642,0.0003848309,0.0001274802,0.0001728449,0.0001278949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003053474,0.0007834078,0.05756059,0.0005790383,0.0004573675,0.0004191229,0.01354677,0.2091935,0.003308885,0.2201766,0.0009382016,0.4927312],"study_design_scores_gemma":[0.0008125216,0.0004377072,0.01470154,0.0001825242,0.00001076147,0.001113293,0.0000770867,0.9800364,0.00003648259,0.002355266,0.0001348167,0.0001016264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5524632,0.0003408868,0.4463509,0.0003189175,0.0003958295,0.00004457348,7.419067e-7,0.00001799164,0.00006692601],"genre_scores_gemma":[0.9788935,0.0000201013,0.02088935,0.0000280093,0.0001623975,2.094334e-7,6.617786e-8,0.000002486011,0.000003899278],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7708429,"threshold_uncertainty_score":0.3218177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986633843","doi":"10.1006/jcss.2002.1822","title":"Optimal Bounds for the Predecessor Problem and Related Problems","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":191,"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":"Matching (statistics); Set (abstract data type); Computer science; Element (criminal law); Class (philosophy); Dynamic problem; Multiplication (music); Upper and lower bounds; Mathematics; Algorithm; Mathematical optimization; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02422048326305505,"gpt":0.2379167837357343,"spread":0.2136963004726792,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001384733,0.0001044948,0.0002058251,0.0000950003,0.000589972,0.0008894406,0.0008087544,0.00003724661,0.000001811849],"category_scores_gemma":[0.00000667225,0.00005279009,0.00005367041,0.0002348557,0.0001664884,0.001005543,0.0002246073,0.00009802489,8.060415e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001132638,"about_ca_system_score_gemma":0.0000283137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003836641,"about_ca_topic_score_gemma":3.809919e-7,"domain_scores_codex":[0.9987456,0.00006277658,0.0004269774,0.000217311,0.0003555976,0.0001917502],"domain_scores_gemma":[0.9990142,0.0002662175,0.0003459383,0.0001509266,0.0001300842,0.00009265587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003188392,0.0003115401,0.00241172,0.0008569917,0.0003155924,0.00006556592,0.01760254,0.03450052,0.000293217,0.1690557,0.03927964,0.7352751],"study_design_scores_gemma":[0.0004179859,0.0005637092,0.0005754994,0.0002185315,0.0000120347,0.001242165,0.0001142004,0.9912538,0.000009933506,0.0007830718,0.004718457,0.00009060106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01302014,0.006389637,0.9769832,0.001745619,0.0009346958,0.0002966806,0.000002201964,0.00002989883,0.0005979491],"genre_scores_gemma":[0.7948976,0.0002147503,0.2044459,0.00005845481,0.0002392778,0.00000712162,1.259594e-7,0.00000438416,0.0001324516],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9567533,"threshold_uncertainty_score":0.8576897,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024091095","doi":"10.1016/s0022-0000(02)00025-9","title":"Uniform constant-depth threshold circuits for division and iterated multiplication","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University; Clay Mathematics Institute; National Science Foundation","keywords":"Modulo; Mathematics; Division (mathematics); Iterated function; Constant (computer programming); Natural number; Discrete mathematics; Electronic circuit; Integer (computer science); Multiplication (music); Boolean circuit; Arithmetic; Combinatorics; Computer science; Boolean function; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05525673498615786,"gpt":0.2671099806480158,"spread":0.211853245661858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008914873,0.0001046333,0.0002256893,0.0002161639,0.0003881367,0.0005581173,0.0004990753,0.00003552662,9.472484e-7],"category_scores_gemma":[0.000008669896,0.00007362403,0.00005629994,0.0003437554,0.0001642057,0.000810154,0.0001109072,0.00007633182,7.189815e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001573697,"about_ca_system_score_gemma":0.00002157783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001804469,"about_ca_topic_score_gemma":0.000001224665,"domain_scores_codex":[0.9988495,0.00004002357,0.0003998831,0.000222881,0.0003117988,0.000175911],"domain_scores_gemma":[0.9990744,0.0002037423,0.0002828408,0.0001274508,0.0001988549,0.0001127005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007158492,0.0001287031,0.006900843,0.0002247276,0.00005094271,0.00002503931,0.003475251,0.0005426259,0.0004960784,0.2820128,0.00131459,0.7048212],"study_design_scores_gemma":[0.0005702378,0.000491962,0.003392911,0.0002155383,0.000006033307,0.0005443707,0.0001126809,0.9912161,0.00008304785,0.002688256,0.0005562807,0.0001225872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08157626,0.001168761,0.9152676,0.0004500789,0.0006190644,0.0001663752,0.000002374035,0.00003130347,0.000718196],"genre_scores_gemma":[0.9584338,0.00005508608,0.0413131,0.00007408614,0.0001083978,0.000001584766,1.405819e-7,0.000002229017,0.00001155464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9906735,"threshold_uncertainty_score":0.5381938,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037968786","doi":"10.1016/s0022-0000(03)00078-3","title":"On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Southeast Fisheries Science Center","keywords":"Parameterized complexity; Combinatorics; Longest common subsequence problem; Alphabet; Mathematics; Sequence (biology); Subsequence; Discrete mathematics; Biology; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.05730906861657043,"gpt":0.2577674707612815,"spread":0.2004584021447111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002389308,0.0001748319,0.0004201671,0.00008478585,0.0005583684,0.0004675139,0.00157977,0.00004497973,0.000001965757],"category_scores_gemma":[0.00003658526,0.00008121676,0.00008451517,0.0004291325,0.001073265,0.0005990492,0.0003031442,0.0002307632,5.71121e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002508097,"about_ca_system_score_gemma":0.0001020055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000614888,"about_ca_topic_score_gemma":0.00001241909,"domain_scores_codex":[0.9975501,0.0006387925,0.0006069323,0.0002758775,0.0006932274,0.000235091],"domain_scores_gemma":[0.9980454,0.0006880417,0.0005612278,0.0004587963,0.000136298,0.0001101957],"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.0000394333,0.0002885869,0.0511069,0.0002519882,0.00008545555,0.00006798549,0.003264406,0.002812968,0.004877517,0.9225376,0.001094238,0.01357297],"study_design_scores_gemma":[0.002408261,0.004346396,0.1546685,0.004789976,0.0000874859,0.006721364,0.001467532,0.7662385,0.007367019,0.04954441,0.001302289,0.001058314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9333168,0.0006595729,0.0636157,0.001071249,0.0006950746,0.0002742839,0.000007185147,0.00001581143,0.0003443419],"genre_scores_gemma":[0.9876013,0.00003204457,0.01214637,0.0001761095,0.00003483626,0.000002238449,1.671085e-7,0.000003273857,0.000003638755],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8729931,"threshold_uncertainty_score":0.4508248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126323053","doi":"10.1016/j.jcss.2005.06.006","title":"Polynomial degree vs. quantum query complexity","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":153,"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":"Degree (music); Mathematics; Upper and lower bounds; Quantum complexity theory; Polynomial; Function (biology); Quantum; Degree of a polynomial; Combinatorics; Time complexity; Structural complexity theory; Discrete mathematics; Quantum algorithm; Computational complexity theory; Complexity class; Algorithm; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.03660138892514958,"gpt":0.2591070153224866,"spread":0.222505626397337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001680963,0.0001822158,0.00042096,0.0002876777,0.0004488853,0.0005830972,0.001349211,0.00005137649,0.000001666671],"category_scores_gemma":[0.000009937451,0.0001233997,0.0001438152,0.000386069,0.0002770592,0.0006616451,0.000315333,0.0002382864,0.000007281775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004093014,"about_ca_system_score_gemma":0.0001697807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000193719,"about_ca_topic_score_gemma":0.000004673474,"domain_scores_codex":[0.9978985,0.0001857972,0.0006450201,0.0003066356,0.0006194355,0.0003446702],"domain_scores_gemma":[0.9987722,0.0001892671,0.00046354,0.0002178156,0.0001439813,0.0002131976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006252894,0.0002635084,0.004150788,0.0001993112,0.000121426,0.000245005,0.005047533,0.02916349,0.0003071801,0.0859139,0.02499804,0.8495273],"study_design_scores_gemma":[0.0004264458,0.0005950911,0.008733502,0.0001858149,0.00000684443,0.002646463,0.00007085539,0.9811375,0.00007778051,0.000296877,0.005626787,0.0001961115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3987072,0.0008239045,0.5946617,0.003124069,0.001928311,0.00007381335,0.000001216007,0.00007336736,0.0006065054],"genre_scores_gemma":[0.8208042,0.00000891589,0.1775644,0.0002613763,0.001346176,3.022321e-7,6.357315e-8,0.000003837713,0.0000107112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9519739,"threshold_uncertainty_score":0.562282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053743126","doi":"10.1006/jcss.2002.1823","title":"Finding Similar Regions in Many Sequences","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Combinatorics; Polynomial-time approximation scheme; Mathematics; Hamming distance; Core (optical fiber); Sequence (biology); Time complexity; Approximation algorithm; Discrete mathematics; Entropy (arrow of time); Computer science; Biology; Physics; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.05043055801681404,"gpt":0.2647240296950133,"spread":0.2142934716781993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100544,0.00009388738,0.0002293818,0.0003071947,0.0002220575,0.0003910535,0.0009454823,0.00003336961,0.000003468197],"category_scores_gemma":[0.000007749937,0.00006176317,0.00004955903,0.0004754137,0.00009724248,0.001297873,0.0001929477,0.0001204542,0.000003674039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002720152,"about_ca_system_score_gemma":0.00003044511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001206312,"about_ca_topic_score_gemma":0.000001870663,"domain_scores_codex":[0.9986388,0.0001060128,0.000424402,0.0002042578,0.0004291128,0.0001974216],"domain_scores_gemma":[0.9992965,0.0001297799,0.0002678615,0.0001488941,0.00005914202,0.00009775546],"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.00001646541,0.000426395,0.03478491,0.0003759205,0.00007929279,0.002553932,0.01795238,0.01424464,0.0007225266,0.4983366,0.03474648,0.3957605],"study_design_scores_gemma":[0.0003020554,0.000286341,0.003311555,0.0005415668,0.000003225205,0.001450887,0.0003683663,0.9904628,0.00004199517,0.001114239,0.001974275,0.0001426919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0752771,0.002346128,0.9178856,0.001423304,0.0012951,0.00007380483,9.20997e-7,0.00002848768,0.001669582],"genre_scores_gemma":[0.923916,0.0001111568,0.07567155,0.00008653112,0.0001875221,5.440299e-7,4.051169e-8,0.000001711252,0.0000249929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9762182,"threshold_uncertainty_score":0.3770938,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154773309","doi":"10.1016/j.jcss.2004.03.005","title":"One-dimensional quantum walks with absorbing boundaries","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Eigenfunction; Curse of dimensionality; Quantum walk; Statistical physics; Random walk; Domain (mathematical analysis); Mathematics; Absorption (acoustics); Space (punctuation); Function (biology); Simple (philosophy); Unitary state; Quantum; Applied mathematics; Mathematical analysis; Computer science; Physics; Quantum mechanics; Eigenvalues and eigenvectors; Quantum algorithm; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.0123920140745925,"gpt":0.2228603118250216,"spread":0.2104682977504291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001031647,0.0001481849,0.0003253442,0.0002297934,0.0007676177,0.001150631,0.0007438137,0.00003569265,5.349655e-7],"category_scores_gemma":[0.000005788976,0.00009378856,0.00007068877,0.0003997592,0.0003796254,0.0005665579,0.0001805234,0.0001987768,0.000002081099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003545546,"about_ca_system_score_gemma":0.0004332299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002410669,"about_ca_topic_score_gemma":0.00000285374,"domain_scores_codex":[0.9981972,0.00006966474,0.0004219416,0.0002714317,0.0007599254,0.0002798528],"domain_scores_gemma":[0.9990494,0.0001054916,0.0003566728,0.0001554836,0.0001813428,0.0001515594],"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.00006026035,0.0002425577,0.001314141,0.000249647,0.0001881086,0.0006044081,0.00853633,0.3149892,0.0004608219,0.5636792,0.0002881826,0.1093872],"study_design_scores_gemma":[0.00180141,0.003318809,0.009131154,0.002057921,0.00002648111,0.009868058,0.0003542066,0.958191,0.0003539929,0.01347456,0.0009020501,0.0005204056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4561146,0.0004807304,0.5414121,0.001004214,0.0007887713,0.00004388859,3.217702e-7,0.00003841206,0.0001170115],"genre_scores_gemma":[0.8018856,0.000002580584,0.1977088,0.0001219175,0.000274609,3.03107e-7,4.842441e-8,0.000003616252,0.000002479807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6432017,"threshold_uncertainty_score":0.9998863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154093507","doi":"10.1016/j.jcss.2006.10.013","title":"First-order query rewriting for inconsistent databases","year":2006,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":128,"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":"Rewriting; Computer science; Conjunctive query; Boolean conjunctive query; Class (philosophy); Set (abstract data type); Query language; Query optimization; Database; Sargable; Order (exchange); Data integrity; Database query; Theoretical computer science; Information retrieval; Web search query; Relational database; Programming language; Search engine; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03061450247099549,"gpt":0.2605431602986567,"spread":0.2299286578276612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001638801,0.0001203503,0.0002933558,0.0001769425,0.000467254,0.0004528423,0.0006435072,0.00002739183,7.884011e-7],"category_scores_gemma":[0.00003402061,0.00008005489,0.0001024879,0.0003046863,0.0001194934,0.0007779149,0.0001747041,0.00006968854,0.000001624277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003086963,"about_ca_system_score_gemma":0.0001387009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004176323,"about_ca_topic_score_gemma":0.00003291067,"domain_scores_codex":[0.9985703,0.00007325298,0.0005261379,0.0002454087,0.0003371681,0.0002477844],"domain_scores_gemma":[0.9985991,0.0004301883,0.0004059779,0.0001507591,0.0003266857,0.00008725604],"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.00002359365,0.0002240004,0.03152381,0.0006921304,0.0000647249,0.0001342422,0.001249498,0.003404124,0.000134965,0.9153719,0.01914496,0.02803204],"study_design_scores_gemma":[0.001852916,0.001299884,0.01791014,0.001604284,0.00005022863,0.004169815,0.000912492,0.9326092,0.0002989516,0.004583624,0.03406144,0.0006470096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02724362,0.001983348,0.9661132,0.0004455843,0.001275226,0.0001127998,0.000001893526,0.00003489248,0.002789489],"genre_scores_gemma":[0.8098055,0.00001486612,0.1892665,0.00007156265,0.0007830824,0.000002322815,2.731331e-7,0.000002991485,0.00005289472],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9292051,"threshold_uncertainty_score":0.4366769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136462002","doi":"10.1006/jcss.1999.1672","title":"Reversible Space Equals Deterministic Space","year":2000,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Turing machine; Conjecture; Space (punctuation); Turing; Bounded function; Computation; Mathematics; Stochastic game; Computer science; Discrete mathematics; Mathematical economics; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01349140388027876,"gpt":0.2427616204778011,"spread":0.2292702165975223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00136211,0.0001518401,0.0003415606,0.0002001864,0.0003603235,0.0005482693,0.001035365,0.00004120739,0.000007447042],"category_scores_gemma":[0.000009255071,0.0001039389,0.0001037406,0.0004743687,0.0001417974,0.0004417524,0.0001355757,0.000160991,0.00001224275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002110068,"about_ca_system_score_gemma":0.000122174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000816932,"about_ca_topic_score_gemma":3.598244e-7,"domain_scores_codex":[0.9982874,0.0001650704,0.0004387543,0.0002791696,0.0005332694,0.0002963363],"domain_scores_gemma":[0.998999,0.0002432676,0.0002865298,0.0002074776,0.00008041117,0.0001833236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003675849,0.000162233,0.001623712,0.0003533705,0.0001038639,0.000972248,0.006693567,0.07395825,0.0003332167,0.09073325,0.006967281,0.8180622],"study_design_scores_gemma":[0.0003962762,0.0009116124,0.001450522,0.0004698154,0.00001189067,0.00394037,0.0001120702,0.9849526,0.00009875183,0.001200977,0.006220679,0.0002344647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3617246,0.0008736497,0.6305808,0.001772243,0.001450085,0.00009708885,9.809255e-7,0.0000745285,0.003425971],"genre_scores_gemma":[0.8562546,0.00002804624,0.1429849,0.0001216427,0.0004456198,2.765934e-7,3.33099e-8,0.000003839601,0.0001610544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9109943,"threshold_uncertainty_score":0.5286973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007979101","doi":"10.1016/s0022-0000(03)00075-8","title":"Solving large FPT problems on coarse-grained parallel machines","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Dalhousie University; Carleton University","funders":"","keywords":"Computer science; Vertex cover; Parallelism (grammar); Bounded function; Vertex (graph theory); Implementation; Cover (algebra); Sequence (biology); Parallel computing; Tree (set theory); Parallel algorithm; Algorithm; Theoretical computer science; Mathematics; Graph; Combinatorics; Approximation algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01946566761545364,"gpt":0.2503981644689971,"spread":0.2309324968535434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002373143,0.0001501679,0.0003044177,0.0002063673,0.0005155596,0.0005480775,0.0008435989,0.00003991002,0.000003079097],"category_scores_gemma":[0.00002218923,0.00009116226,0.00008175758,0.0003118013,0.00006677273,0.0008771485,0.0001534977,0.0001678139,0.000004737578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002019279,"about_ca_system_score_gemma":0.00008952658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000060077,"about_ca_topic_score_gemma":0.000001416321,"domain_scores_codex":[0.9981098,0.0002499387,0.0004793132,0.0002743892,0.0006007084,0.0002858258],"domain_scores_gemma":[0.9989448,0.0001826958,0.0003823187,0.000212889,0.000124881,0.0001524378],"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.00003402946,0.0005290747,0.008456799,0.0003515458,0.00010714,0.0003291575,0.005152564,0.01904068,0.0003640444,0.8509945,0.0148496,0.09979083],"study_design_scores_gemma":[0.0009251205,0.0008742666,0.001446885,0.0005684764,0.000007336855,0.001099792,0.0001883313,0.983655,0.00004183199,0.00206209,0.008894972,0.0002358876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01319561,0.0008298297,0.9824403,0.0002472735,0.001432543,0.00009780414,0.000001656653,0.00003488854,0.001720124],"genre_scores_gemma":[0.8134448,0.00003114947,0.1860708,0.000183251,0.0002176875,0.000001343277,2.138218e-7,0.00000424784,0.00004653095],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9646143,"threshold_uncertainty_score":0.5285124,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117278106","doi":"10.1016/j.jcss.2012.11.002","title":"Security-aware optimization for ubiquitous computing systems with SEAT graph approach","year":2012,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Big Data and Digital Economy","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Correctness; Graph; Computer security model; Theoretical computer science; Cryptography; Integer programming; Distributed computing; Computer security; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02633655907656768,"gpt":0.2342976843090428,"spread":0.2079611252324751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001421951,0.0001395027,0.0003272168,0.0002108415,0.0002988469,0.0009741939,0.0006636079,0.00004460783,1.587587e-7],"category_scores_gemma":[0.000003180339,0.00009019127,0.00006328618,0.0003358139,0.0000968751,0.002530217,0.0001274676,0.00007537,4.911805e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003153399,"about_ca_system_score_gemma":0.00007920766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000480477,"about_ca_topic_score_gemma":2.296382e-7,"domain_scores_codex":[0.9986249,0.00007535765,0.0004385431,0.00021636,0.0003299614,0.0003148936],"domain_scores_gemma":[0.9988596,0.0001370459,0.0004426525,0.0001531404,0.0002052683,0.0002023055],"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.00006082312,0.0004008752,0.01765249,0.002021326,0.0002177199,0.00002272191,0.00600059,0.7143888,0.000005178525,0.2321799,0.004599152,0.02245043],"study_design_scores_gemma":[0.0004051488,0.0003976199,0.0001805291,0.000220087,0.00001236643,0.001623989,0.0007297677,0.9958162,0.000007716796,0.00004428197,0.0004078646,0.0001543846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01053224,0.0009603582,0.986019,0.0000611617,0.001113869,0.0002052535,0.00000379549,0.00003458524,0.001069713],"genre_scores_gemma":[0.8915746,0.000004816297,0.1078103,0.00004932934,0.0005494443,0.000002368612,0.000001239178,0.000004223563,0.000003794103],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8810423,"threshold_uncertainty_score":0.9394174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4213246264","doi":"10.1016/j.jcss.2010.04.009","title":"Foundations of Semantic Web databases","year":2010,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; RDF query language; RDF; Query language; SPARQL; RDF Schema; Semantic Web; Containment (computer programming); RDF/XML; Information retrieval; Logical consequence; Query optimization; Database; Web query classification; Programming language; Web search query; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03716863265475034,"gpt":0.2944975212328642,"spread":0.2573288885781139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001233533,0.00007156109,0.0002355177,0.000209478,0.000148613,0.0001819112,0.0008017399,0.00002028683,0.000002371997],"category_scores_gemma":[0.00003591954,0.00004575264,0.00005824039,0.0002820302,0.0002271379,0.0007506239,0.0001539367,0.00009569909,0.000001881343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004394868,"about_ca_system_score_gemma":0.0001826019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001587114,"about_ca_topic_score_gemma":0.00002203123,"domain_scores_codex":[0.9989113,0.00005363338,0.0004098257,0.0001342812,0.0003516383,0.0001393722],"domain_scores_gemma":[0.9989558,0.0002603388,0.0003545503,0.0001903789,0.0001696853,0.00006917874],"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.000009277897,0.0001621579,0.07185104,0.0003301192,0.00008055596,0.00009200675,0.00194567,0.0002638756,0.01160237,0.8562192,0.002785776,0.05465794],"study_design_scores_gemma":[0.001695284,0.001632806,0.1570458,0.001097198,0.00008942309,0.009173659,0.002242106,0.8081608,0.005039546,0.004772071,0.008385857,0.0006653974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5703392,0.0002170371,0.4260212,0.000437842,0.002051679,0.00003993655,8.893608e-7,0.0000185913,0.0008736075],"genre_scores_gemma":[0.8891948,0.00001339974,0.1106018,0.00002848106,0.0001525289,2.441024e-7,5.677267e-8,0.000001092466,0.00000758755],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8514472,"threshold_uncertainty_score":0.1865739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125194875","doi":"10.1016/j.jcss.2014.12.012","title":"Improving network intrusion detection system performance through quality of service configuration and parallel technology","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kwantlen Polytechnic University","funders":"","keywords":"Network packet; Computer science; Quality of service; Computer network; Intrusion detection system; Process (computing); Software; Operating system; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01624835628199917,"gpt":0.2380210792900175,"spread":0.2217727230080183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002540289,0.0001095239,0.0003321731,0.0001594771,0.0003826951,0.0001658165,0.0003786476,0.00009570972,3.205712e-7],"category_scores_gemma":[0.00001323028,0.00008109398,0.00003631325,0.0006441105,0.0001103425,0.001025975,0.0001560315,0.0001465958,6.403272e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003097241,"about_ca_system_score_gemma":0.00003677196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004642956,"about_ca_topic_score_gemma":0.00001667064,"domain_scores_codex":[0.9983163,0.0002493491,0.0006940902,0.000219507,0.0003516258,0.0001690555],"domain_scores_gemma":[0.998428,0.0001284302,0.0009321092,0.0001521653,0.0003079995,0.0000512322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001505385,0.0000508925,0.004672359,0.002720781,0.00004786549,0.000005224826,0.002535239,0.02522366,0.007957514,0.2195463,0.00005246809,0.7370371],"study_design_scores_gemma":[0.0004188043,0.00090605,0.004926476,0.0005287352,0.000009950901,0.0006674829,0.0002869886,0.9892665,0.001983477,0.0006774181,0.0002038804,0.0001241932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4212118,0.0002371073,0.5774294,0.000137101,0.0007393745,0.00006017226,7.668239e-8,0.00002808915,0.0001568901],"genre_scores_gemma":[0.9672454,0.00006510193,0.03229213,0.00005661414,0.0003361422,0.000001061276,5.403232e-8,0.000002237323,0.000001265434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9640429,"threshold_uncertainty_score":0.3306917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159543798","doi":"10.1016/j.jcss.2005.06.008","title":"Logics for reasoning about cryptographic constructions","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":86,"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":"Soundness; Correctness; Cryptography; Cryptographic protocol; Cryptographic primitive; Theoretical computer science; Computer science; Interpretation (philosophy); Mathematics; Programming language; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0222037773679399,"gpt":0.2902167245142492,"spread":0.2680129471463093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166436,0.00008816151,0.000226262,0.0003305447,0.0005108822,0.0004529494,0.0004801702,0.0000285494,0.000001727086],"category_scores_gemma":[0.000006869289,0.00006374201,0.0001616924,0.0004791297,0.0001708596,0.0007156816,0.00006326197,0.00007336363,4.157107e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001339267,"about_ca_system_score_gemma":0.00008221048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003833012,"about_ca_topic_score_gemma":0.000005780351,"domain_scores_codex":[0.9988582,0.00005721599,0.0004476683,0.0001679302,0.0002799282,0.0001890765],"domain_scores_gemma":[0.9990832,0.0001555367,0.0003233559,0.0001091089,0.0002315696,0.00009720091],"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.000003503408,0.00003156782,0.002268623,0.00003417031,0.0001158694,0.000003185453,0.001195081,0.0005020923,0.00003473495,0.9547452,0.0005803599,0.04048567],"study_design_scores_gemma":[0.003343644,0.002730559,0.02002976,0.0003816416,0.0004727105,0.007891953,0.005091439,0.8979904,0.000240894,0.02314749,0.03776675,0.0009127649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05267794,0.0009646508,0.944524,0.0007831325,0.0006196596,0.0001095866,0.000002876787,0.00002502673,0.0002930756],"genre_scores_gemma":[0.6350778,0.0000299128,0.3645851,0.00008511254,0.0002172182,0.000001842788,1.118193e-7,0.000001307023,0.000001602989],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9315977,"threshold_uncertainty_score":0.4367802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005181510","doi":"10.1016/j.jcss.2003.04.001","title":"Subword histories and Parikh matrices","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Decidability; Equivalence (formal languages); Sequence (biology); Type (biology); Word (group theory); Computer science; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01107804895600222,"gpt":0.2151253469048074,"spread":0.2040472979488052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00160917,0.00009333878,0.0002282746,0.0001598941,0.0002384977,0.0004782082,0.0004544168,0.00002728391,0.000001277812],"category_scores_gemma":[0.00001154556,0.00006091829,0.00003983407,0.0002691484,0.0001488762,0.000801656,0.00007826765,0.00006703436,9.49865e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001874713,"about_ca_system_score_gemma":0.00007531189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004397205,"about_ca_topic_score_gemma":6.439012e-7,"domain_scores_codex":[0.9989023,0.0001331071,0.0003246325,0.00017024,0.0003122334,0.000157527],"domain_scores_gemma":[0.9992667,0.000174091,0.0002707019,0.0001086735,0.00007434964,0.0001054607],"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.000004357337,0.00002907827,0.008999269,0.0001203244,0.00002365062,0.00007335679,0.002367788,0.00006361748,0.00009906599,0.9527311,0.00137928,0.03410906],"study_design_scores_gemma":[0.006538895,0.008446256,0.07851058,0.002601542,0.000229542,0.06400061,0.01408643,0.4300501,0.003381457,0.1228143,0.2656213,0.00371897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4006418,0.008880431,0.5838747,0.0005443615,0.002791549,0.00009526719,4.867827e-7,0.00005590028,0.003115517],"genre_scores_gemma":[0.9504158,0.00004966172,0.04932545,0.00007124713,0.0001103502,4.331754e-7,1.217963e-8,0.000001886275,0.0000251587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8299169,"threshold_uncertainty_score":0.4611373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970225139","doi":"10.1016/j.jcss.2014.04.022","title":"A spatiotemporal compression based approach for efficient big data processing on Cloud","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cloud computing; Big data; Graph; Data mining; Distributed computing; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06487644311564492,"gpt":0.2720209873308927,"spread":0.2071445442152478,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00370377,0.0001457613,0.0003087724,0.0002518643,0.0004818664,0.0005820607,0.001830027,0.00003630219,7.719449e-8],"category_scores_gemma":[0.00001891842,0.0000913672,0.00006831723,0.0002934962,0.0000969903,0.00005898886,0.0004275965,0.000105185,4.666324e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002448464,"about_ca_system_score_gemma":0.00008425668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004051151,"about_ca_topic_score_gemma":1.698445e-7,"domain_scores_codex":[0.997985,0.0001972791,0.0004864242,0.000430677,0.0006649311,0.0002357128],"domain_scores_gemma":[0.9985681,0.000243182,0.0005334765,0.0004136357,0.0001246163,0.0001170349],"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.00002909871,0.0001940771,0.0002490437,0.0004215368,0.00001551552,0.000004465147,0.0004223434,0.5524682,0.00001850547,0.005592824,0.001500392,0.439084],"study_design_scores_gemma":[0.0005926489,0.0005763268,0.0003811792,0.0004625131,0.000009495177,0.0000475336,0.00007667207,0.995391,0.00002487175,0.00004074187,0.002274837,0.0001221951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04345541,0.0001546072,0.9538893,0.0004140081,0.001264548,0.0001676644,9.577568e-7,0.00004230969,0.0006112733],"genre_scores_gemma":[0.8371305,2.935612e-7,0.1617538,0.000151621,0.0009499204,0.000001197443,6.358303e-7,0.000004025528,0.000007994397],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7936751,"threshold_uncertainty_score":0.5612824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067194564","doi":"10.1016/s0022-0000(02)00004-1","title":"The longest common subsequence problem for sequences with nested arc annotations","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Longest common subsequence problem; Combinatorics; Sequence (biology); Subsequence; Computer science; Discrete mathematics; Nested set model; Mathematics; Matching (statistics); Algorithm; Theoretical computer science; Information retrieval; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.02383866729261915,"gpt":0.2456956519260933,"spread":0.2218569846334741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140117,0.00007309329,0.0001175645,0.00002951592,0.0004002184,0.0001637755,0.0002608135,0.00002686428,4.9786e-7],"category_scores_gemma":[0.000007962553,0.00003687375,0.00003939758,0.00008565689,0.0001903607,0.00001582879,0.0000176513,0.00003190598,3.594358e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004934293,"about_ca_system_score_gemma":0.00003692163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003748787,"about_ca_topic_score_gemma":0.00001575873,"domain_scores_codex":[0.9992774,0.00008204284,0.0002247349,0.0001152642,0.0001715449,0.0001290517],"domain_scores_gemma":[0.9994122,0.00008308895,0.0002325312,0.00008004036,0.0001414867,0.00005069597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00064128,0.0003134039,0.02527904,0.0008378056,0.0006206097,0.0001240268,0.003609115,0.008704508,0.460227,0.05445613,0.007539089,0.437648],"study_design_scores_gemma":[0.01010852,0.07592633,0.0348678,0.006534863,0.0006899646,0.03533867,0.01729214,0.1464606,0.5327407,0.01256848,0.1231228,0.004349151],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9098306,0.003205689,0.0843809,0.001376861,0.0002886211,0.000332851,0.000003983654,0.000006178067,0.00057431],"genre_scores_gemma":[0.987858,0.000115218,0.01171111,0.00004667303,0.0001924145,0.000008654608,3.10726e-7,0.000003202374,0.00006441976],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4332989,"threshold_uncertainty_score":0.3078197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014277465","doi":"10.1016/j.jcss.2007.09.003","title":"Maximal repetitions in strings","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Conjecture; String (physics); Mathematics; Combinatorics; Upper and lower bounds; Running time; Computation; Discrete mathematics; Time complexity; Linearity; Computer science; Algorithm; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01546365418750346,"gpt":0.2579745793370556,"spread":0.2425109251495521,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002237599,0.00006471299,0.0001596299,0.0002964285,0.0001322162,0.0002329155,0.000603253,0.00002557483,0.000001005099],"category_scores_gemma":[0.000006155652,0.00004407211,0.00003617447,0.0003879762,0.00006419349,0.000891689,0.0001750336,0.00009973461,0.00000141448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002481306,"about_ca_system_score_gemma":0.00005685409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000144843,"about_ca_topic_score_gemma":0.000003731267,"domain_scores_codex":[0.9988537,0.00003929573,0.0004215621,0.0001521844,0.0003602188,0.0001730754],"domain_scores_gemma":[0.9993938,0.0001107607,0.0002112813,0.0001142158,0.00007689312,0.00009311367],"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.00003119087,0.0001963337,0.02476811,0.0001142206,0.00002117977,0.001047179,0.002516171,0.001041848,0.0005094236,0.6696647,0.001983579,0.2981061],"study_design_scores_gemma":[0.002568655,0.002351902,0.3650681,0.002383351,0.00001497769,0.0112372,0.001979416,0.5901868,0.0008158465,0.009500876,0.01312596,0.0007668895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09182915,0.0003026749,0.9056934,0.0001704539,0.0006652563,0.0000325751,4.267881e-7,0.00001293842,0.001293084],"genre_scores_gemma":[0.8575805,0.0000114547,0.1421772,0.00004314805,0.0001785596,1.537596e-7,5.430884e-8,0.000001104405,0.000007761422],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7657514,"threshold_uncertainty_score":0.224601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079029882","doi":"10.1016/j.jcss.2014.06.016","title":"Towards dynamic real-time scheduling for multiple earth observation satellites","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Satellite Communication Systems","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Dynamic priority scheduling; Scheduling (production processes); Real-time computing; Dynamic programming; Earth observation satellite; Distributed computing; Earliest deadline first scheduling; Rate-monotonic scheduling; Mathematical optimization; Algorithm; Quality of service; Satellite; Computer network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02902043675562261,"gpt":0.2539311889240583,"spread":0.2249107521684357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00163702,0.00008837294,0.0002433349,0.0001317078,0.0001177075,0.0001711144,0.0002905151,0.00003801064,7.535988e-7],"category_scores_gemma":[0.00002537165,0.000067958,0.0000596809,0.0001577983,0.0000424793,0.0002956176,0.0000227351,0.00005393025,0.000003771152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002671236,"about_ca_system_score_gemma":0.00002175144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004533797,"about_ca_topic_score_gemma":0.000001741544,"domain_scores_codex":[0.9990162,0.00008161146,0.0004759961,0.0000866891,0.0002119175,0.000127602],"domain_scores_gemma":[0.9991094,0.000363059,0.0001786379,0.0001265821,0.0001602276,0.00006213425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005873817,0.0000639428,0.03464263,0.002798573,0.0002591554,0.000004261365,0.006497504,0.3582294,0.0902342,0.009017452,0.000230182,0.497964],"study_design_scores_gemma":[0.0002364237,0.000103115,0.007978225,0.0002756678,0.00000656981,0.00005607152,0.0001584118,0.9886586,0.0004559433,0.00006548916,0.001919858,0.00008561487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7018632,0.00165799,0.2948333,0.00005674089,0.0007113289,0.000137952,0.000001620429,0.00007037991,0.0006674664],"genre_scores_gemma":[0.8668901,0.0001792159,0.1327198,0.000008088629,0.0001799004,0.000002023496,8.112857e-7,0.000007247611,0.00001284293],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6304293,"threshold_uncertainty_score":0.2771247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106811687","doi":"10.1016/j.jcss.2004.12.008","title":"Vector seeds: An extension to spaced seeds","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":65,"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":"Probabilistic logic; Sensitivity (control systems); Extension (predicate logic); Sequence (biology); Pairwise comparison; Multiple sequence alignment; Computer science; Sequence alignment; Algorithm; Coding (social sciences); Coding region; Computational biology; Mathematics; Biology; Genetics; Artificial intelligence; Gene; Peptide sequence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01641046682680313,"gpt":0.2574368310928004,"spread":0.2410263642659973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004647145,0.00007576636,0.0001445002,0.00005837499,0.0001168773,0.00006077373,0.0001588041,0.00003022688,7.031815e-7],"category_scores_gemma":[0.000004893609,0.00005235673,0.00004222469,0.00006587498,0.00004713819,0.000003155589,0.00007087846,0.00002775017,0.000001411857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000674009,"about_ca_system_score_gemma":0.00003817943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003428127,"about_ca_topic_score_gemma":0.000006408433,"domain_scores_codex":[0.9993603,0.00003988179,0.0002003625,0.0001443492,0.0001364995,0.0001186562],"domain_scores_gemma":[0.9995829,0.000008419608,0.00009970692,0.00008534376,0.000112632,0.0001109357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.00009333296,0.00008944968,0.01041984,0.00004211754,0.00009079539,0.00001076197,0.001509922,0.007213655,0.936874,0.0005340036,0.002967035,0.04015508],"study_design_scores_gemma":[0.003533636,0.0217767,0.6296924,0.0006094395,0.0001598498,0.00432392,0.007270418,0.02972198,0.1149998,0.0001378692,0.1861529,0.001621073],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9936836,0.001325098,0.00396449,0.0003729033,0.0003745998,0.00004953787,0.00000120849,0.000001266958,0.0002273201],"genre_scores_gemma":[0.9868603,0.00004974386,0.01186776,0.0002029527,0.0009839057,4.798982e-7,1.724387e-7,0.000003256691,0.00003147104],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8218742,"threshold_uncertainty_score":0.2135045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038255135","doi":"10.1016/j.jcss.2007.06.016","title":"Lower bounds for predecessor searching in the cell probe model","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":63,"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":"Upper and lower bounds; Computer science; Quantum; Query optimization; Mathematics; Theoretical computer science; Discrete mathematics; Information retrieval","retraction":null,"screen_n_in":null,"score":{"opus":0.01952030531597196,"gpt":0.2743330171327307,"spread":0.2548127118167587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006647279,0.0001081866,0.0002061873,0.0002399499,0.0003497059,0.0006274997,0.001303193,0.00003221509,7.598717e-8],"category_scores_gemma":[0.000009447032,0.00005852637,0.00008696586,0.0003960332,0.00009161047,0.0003637416,0.0001320169,0.0001930019,2.272933e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002519675,"about_ca_system_score_gemma":0.0001745168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004772888,"about_ca_topic_score_gemma":0.000003344685,"domain_scores_codex":[0.9983827,0.00009823414,0.0004586228,0.0002115423,0.0005269074,0.0003219986],"domain_scores_gemma":[0.9989523,0.0004699526,0.0002548271,0.0001463712,0.0001004591,0.00007613495],"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.0001053681,0.0005333217,0.002764792,0.000762564,0.00004203426,0.0002910354,0.05977379,0.5681447,0.000895001,0.09637497,0.001502623,0.2688099],"study_design_scores_gemma":[0.0003024471,0.0004539709,0.0008467063,0.0001404802,0.000002695207,0.0003665144,0.0002348266,0.9947737,0.00006952453,0.002525191,0.0001992246,0.00008469381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.234615,0.0002513304,0.7637489,0.0005007949,0.000457601,0.0001287293,3.776794e-7,0.00001089536,0.0002863804],"genre_scores_gemma":[0.7739232,0.000001999368,0.2256756,0.0001367363,0.0002473988,8.97155e-7,2.966095e-8,0.00000238995,0.00001169752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5393082,"threshold_uncertainty_score":0.6050993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075457919","doi":"10.1016/j.jcss.2004.03.007","title":"A refined search tree technique for Dominating Set on planar graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Parameterized complexity; Vertex (graph theory); Independent set; Feedback vertex set; Planar graph; Discrete mathematics; Maximal independent set; Vertex cover; Time complexity; Chordal graph; Undirected graph; Graph; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.04379541596315799,"gpt":0.331260597960581,"spread":0.287465181997423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00402237,0.0001280274,0.0002929351,0.0006277293,0.0004078658,0.0002969909,0.001201401,0.00004520323,2.770551e-7],"category_scores_gemma":[0.0000315761,0.00008648109,0.0001134705,0.0007019822,0.0002001695,0.0005883485,0.000106703,0.0001894555,0.000001113659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006313835,"about_ca_system_score_gemma":0.0001667277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003851062,"about_ca_topic_score_gemma":0.000001991597,"domain_scores_codex":[0.9980868,0.0001616001,0.0004295649,0.0002868802,0.0007006604,0.0003345255],"domain_scores_gemma":[0.9986838,0.0004850368,0.0002356038,0.0001994509,0.0002450713,0.0001510396],"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.00009803737,0.00006767442,0.0002286163,0.0001719983,0.00003192181,0.00010803,0.001336616,0.003730685,0.004504334,0.951125,0.0001925254,0.0384046],"study_design_scores_gemma":[0.01306612,0.0345981,0.005185315,0.006907771,0.00004687377,0.01319356,0.003865614,0.1693412,0.07959145,0.6706198,0.001669931,0.001914186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03814575,0.0001250505,0.9599119,0.0007387158,0.0002730717,0.0002857537,0.000002129826,0.00002785126,0.0004897452],"genre_scores_gemma":[0.7251117,0.000006473286,0.2746974,0.00006607384,0.00009642111,0.000008645407,9.899759e-8,0.000004109925,0.000009084233],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6869659,"threshold_uncertainty_score":0.3526596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006771561","doi":"10.1016/s0022-0000(03)00042-4","title":"Completeness results for graph isomorphism","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Graph isomorphism; Graph automorphism; Mathematics; Discrete mathematics; Isomorphism (crystallography); Graph; Line graph; Voltage graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02881157589070679,"gpt":0.249631771147468,"spread":0.2208201952567612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003036736,0.0001096351,0.0002974863,0.000204979,0.0002977158,0.0003733103,0.0007873471,0.00003218973,4.142161e-7],"category_scores_gemma":[0.00002544495,0.00007280405,0.0001085462,0.0003269427,0.0001317052,0.000564154,0.0000589446,0.00006119031,0.000001205113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001445061,"about_ca_system_score_gemma":0.00008536407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002237507,"about_ca_topic_score_gemma":3.869807e-7,"domain_scores_codex":[0.9985223,0.0001490744,0.0005463351,0.0002233211,0.0003413954,0.0002175095],"domain_scores_gemma":[0.9987392,0.0003829864,0.0004177566,0.0001707994,0.0001778875,0.0001114156],"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.00002065795,0.00004973856,0.0003006939,0.00008657519,0.00003177844,0.00003389129,0.0008413321,0.0005749939,0.0002615665,0.9785562,0.004600868,0.01464172],"study_design_scores_gemma":[0.01044463,0.006189441,0.008484251,0.001886631,0.00008569611,0.01547558,0.002635759,0.7422851,0.003558231,0.1443942,0.06297674,0.001583729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03850731,0.0007060911,0.9574459,0.0003944921,0.001759494,0.0001021818,0.000003125901,0.00002976479,0.001051658],"genre_scores_gemma":[0.8753679,0.00001173931,0.1242924,0.0001569254,0.0001500888,0.000001367128,1.125506e-7,0.000002616247,0.00001683572],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8368606,"threshold_uncertainty_score":0.359984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062671967","doi":"10.1016/j.jcss.2003.07.011","title":"A sharp threshold in proof complexity yields lower bounds for satisfiability search","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":61,"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":"Satisfiability; Mathematics; Combinatorics; Resolution (logic); Range (aeronautics); Conjunctive normal form; Discrete mathematics; Exponential function; Boolean satisfiability problem; Upper and lower bounds; Exponential time hypothesis; Time complexity; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05440909133257375,"gpt":0.293218237044864,"spread":0.2388091457122902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002759427,0.00009277017,0.0002426959,0.0002202099,0.0001974216,0.0003853101,0.0003627492,0.00004337002,0.000006060229],"category_scores_gemma":[0.00002711884,0.00006938839,0.00007090343,0.000413275,0.0001858784,0.0006696031,0.00005067446,0.0001150288,4.59658e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005639738,"about_ca_system_score_gemma":0.000233697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006736957,"about_ca_topic_score_gemma":0.00002341101,"domain_scores_codex":[0.9985802,0.0001378821,0.0004802995,0.0002261437,0.000374805,0.0002006623],"domain_scores_gemma":[0.9992278,0.000172186,0.000173466,0.0001312547,0.0001988239,0.00009645084],"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.00003993714,0.0002026817,0.1376455,0.0002795901,0.00003029,0.0000273215,0.002595701,0.01375821,0.00008224919,0.8041597,0.0006712522,0.04050759],"study_design_scores_gemma":[0.001193015,0.0009001095,0.05915838,0.0002454585,0.000006208176,0.0006248533,0.0003581636,0.9258829,0.0001780723,0.01070209,0.0005141361,0.0002365623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1062497,0.0001109933,0.8907408,0.0005283755,0.0007710995,0.0002142312,0.000001136832,0.00001262532,0.00137104],"genre_scores_gemma":[0.9075145,0.000002961602,0.09234968,0.00006916552,0.00005107039,0.000002389114,8.160926e-8,0.000001778276,0.000008367743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9121248,"threshold_uncertainty_score":0.3715554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045244401","doi":"10.1016/j.jcss.2014.12.019","title":"Authorship verification of e-mail and tweet messages applied for continuous authentication","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Authorship Attribution and Profiling","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Stylometry; Word error rate; Support vector machine; Set (abstract data type); Feature selection; Feature (linguistics); Authentication (law); Writing style; Information retrieval; Selection (genetic algorithm); Block (permutation group theory); Artificial intelligence; Natural language processing; Data mining; Computer security; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02652990645237236,"gpt":0.2698352296278049,"spread":0.2433053231754325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00413637,0.0000752035,0.000247461,0.0001426171,0.0001734628,0.0001817924,0.0003664197,0.00004667902,4.072448e-7],"category_scores_gemma":[0.00004068232,0.00005503892,0.00004075607,0.0001845284,0.0001180687,0.0002851509,0.00004887332,0.00005759099,4.27215e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001009331,"about_ca_system_score_gemma":0.00004296212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001260397,"about_ca_topic_score_gemma":2.030061e-7,"domain_scores_codex":[0.998867,0.0001401081,0.0004418359,0.0001683248,0.0002617046,0.0001210134],"domain_scores_gemma":[0.9987534,0.0003124766,0.0005419783,0.0001125252,0.0001970116,0.00008261473],"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.00002612086,0.00002975175,0.002855386,0.0002810204,0.00002304299,4.525858e-7,0.003358453,0.00008782426,0.003420687,0.9125776,0.0002487685,0.07709089],"study_design_scores_gemma":[0.001508959,0.00126607,0.04632816,0.000478277,0.00006372771,0.0002393608,0.0009823507,0.9150955,0.008330076,0.02284226,0.002505281,0.0003599958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1021254,0.0001964953,0.8964209,0.0004823898,0.0003826036,0.0001136596,8.636358e-7,0.00001491198,0.0002627919],"genre_scores_gemma":[0.9364153,0.000006203518,0.06342796,0.00002781664,0.0001053825,0.000002179662,2.931965e-7,0.00000183212,0.00001307687],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9150077,"threshold_uncertainty_score":0.2244422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008334867","doi":"10.1016/j.jcss.2012.05.006","title":"An algorithm for accuracy enhancement of license plate recognition","year":2012,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Vehicle License Plate Recognition","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"License; Computer science; Artificial intelligence; Haar-like features; Computer vision; Classifier (UML); Pattern recognition (psychology); Edge detection; Algorithm; Image (mathematics); Image processing; Facial recognition system; Face detection","retraction":null,"screen_n_in":null,"score":{"opus":0.0303863753325897,"gpt":0.2660526427833979,"spread":0.2356662674508082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008873549,0.00006938499,0.0001782868,0.0001214124,0.00005516372,0.00004586908,0.00008465807,0.00003178908,0.000003105788],"category_scores_gemma":[0.000003827982,0.00005395254,0.00004187055,0.00009202976,0.00002713317,0.0007649259,0.000006930725,0.00004662029,0.000001974533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002021968,"about_ca_system_score_gemma":0.00001187102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001432876,"about_ca_topic_score_gemma":2.247732e-7,"domain_scores_codex":[0.9992335,0.00003267663,0.0003573973,0.00005523604,0.0001736288,0.0001475432],"domain_scores_gemma":[0.9994398,0.0001250104,0.0001844002,0.00003830073,0.0001239975,0.00008851721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001377247,0.00006155593,0.0002528924,0.0002910314,0.00005374807,0.000001841919,0.001320308,0.0007048519,0.008586955,0.00003815322,0.0001728176,0.9885021],"study_design_scores_gemma":[0.0007656217,0.0008821338,0.001685661,0.0006404057,0.00005819812,0.0005953296,0.0008023996,0.9545917,0.03926886,0.00008840807,0.0004234445,0.0001978642],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6481835,0.0003323537,0.3505528,0.000007246244,0.0007229062,0.00008140344,0.000005591807,0.00001238775,0.0001018073],"genre_scores_gemma":[0.9215973,0.0000637291,0.07786275,0.000008956559,0.000459052,0.000001906074,0.000001121386,0.000004453753,7.032286e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9883042,"threshold_uncertainty_score":0.2200121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029854525","doi":"10.1016/j.jcss.2003.12.001","title":"Approximation algorithms for classes of graphs excluding single-crossing graphs as minors","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","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":"University of Waterloo","funders":"","keywords":"Treewidth; Clique-sum; 1-planar graph; Partial k-tree; Pathwidth; Chordal graph; Combinatorics; Indifference graph; Mathematics; Discrete mathematics; Maximal independent set; Tree-depth; Planar graph; Independent set; Vertex cover; Cograph; Time complexity; Graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.06961559235493293,"gpt":0.3323560924359493,"spread":0.2627405000810164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002198118,0.0001373024,0.0003579654,0.0006509203,0.0005068444,0.0006047759,0.0009005125,0.00004590524,2.687177e-7],"category_scores_gemma":[0.00004354903,0.0001008304,0.0001630279,0.0009388895,0.0005237313,0.001479533,0.0001277174,0.0001045941,3.799277e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004785849,"about_ca_system_score_gemma":0.0002002782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000703693,"about_ca_topic_score_gemma":0.000001157971,"domain_scores_codex":[0.9979674,0.0001058409,0.0006474662,0.0002718611,0.0007066444,0.0003007653],"domain_scores_gemma":[0.9982839,0.0003516615,0.0006455713,0.0001663407,0.0004245271,0.0001280215],"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.00005172482,0.0001773249,0.001423323,0.000517036,0.0000745812,0.00003200422,0.004446792,0.008612424,0.0103027,0.8570702,0.00003674225,0.1172551],"study_design_scores_gemma":[0.003734212,0.006023092,0.002407978,0.00264507,0.00004573772,0.003319442,0.003410653,0.1915822,0.04196749,0.7439494,0.0002089692,0.0007057728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.297273,0.0004759259,0.701362,0.0001144741,0.0004865742,0.0001352076,8.092274e-7,0.0000173505,0.000134683],"genre_scores_gemma":[0.7110448,0.000008930742,0.2888602,0.00001675748,0.00006002007,0.000001930096,9.281061e-8,0.000003627734,0.000003618852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4137719,"threshold_uncertainty_score":0.5831868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971694274","doi":"10.1016/j.jcss.2009.07.002","title":"Communication algorithms with advice","year":2009,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Advice (programming); Computer science; Dissemination; Node (physics); Broadcasting (networking); Computer network; Algorithm; Theoretical computer science; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.017505653996277,"gpt":0.266724927676379,"spread":0.249219273680102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001139843,0.00006347234,0.0001452849,0.000147856,0.000221705,0.0004301905,0.0007722421,0.0000182674,8.139606e-7],"category_scores_gemma":[0.000002953844,0.0000383846,0.00002465973,0.0003861107,0.00007588607,0.0009353811,0.00005386136,0.00008497841,0.000001413568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001452881,"about_ca_system_score_gemma":0.00008162863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002958832,"about_ca_topic_score_gemma":6.007464e-7,"domain_scores_codex":[0.9989805,0.0001185155,0.0002657027,0.0001114291,0.0004032102,0.0001206874],"domain_scores_gemma":[0.9992297,0.00006468091,0.0002272285,0.0001523429,0.0002313758,0.00009472785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003258772,0.000264258,0.002179161,0.00008658784,0.00005626456,0.00008726205,0.007581928,0.04407561,0.00009050601,0.4183931,0.004552983,0.5225998],"study_design_scores_gemma":[0.0004891694,0.001322945,0.003858722,0.0002465014,0.000004171227,0.001066661,0.0002394181,0.9908098,0.00002899273,0.0007544674,0.001066763,0.0001123727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003853357,0.0004696364,0.9898087,0.002171627,0.0001239499,0.00006056563,1.114489e-7,0.00003742288,0.003474566],"genre_scores_gemma":[0.5942037,0.00004070046,0.405474,0.0002113068,0.00004676048,2.368157e-7,5.459459e-8,8.949985e-7,0.00002237775],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9467342,"threshold_uncertainty_score":0.4148337,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092928619","doi":"10.1016/j.jcss.2007.06.015","title":"The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Constraint Satisfaction and Optimization","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":"Simon Fraser University","funders":"","keywords":"Lemma (botany); Corollary; Combinatorics; Mathematics; Satisfiability; Randomized algorithm; Discrete mathematics; Time complexity; Boolean satisfiability problem; Computability; Ramsey's theorem","retraction":null,"screen_n_in":null,"score":{"opus":0.05216442578228685,"gpt":0.2959712926665272,"spread":0.2438068668842404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003063791,0.00005818349,0.0001373645,0.0001225315,0.0003503577,0.00020604,0.0003902274,0.00002537649,5.001001e-7],"category_scores_gemma":[0.00001274587,0.00003558562,0.00005118537,0.0002211583,0.0002693449,0.0006203636,0.00003592994,0.00004869115,1.574358e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001948331,"about_ca_system_score_gemma":0.0000846955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006337062,"about_ca_topic_score_gemma":0.00002909913,"domain_scores_codex":[0.9989802,0.00008139652,0.0004582044,0.0001031364,0.0002597538,0.0001172874],"domain_scores_gemma":[0.9988148,0.0002675012,0.0004483487,0.00009940327,0.0003016482,0.00006826389],"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.00004023049,0.00003715857,0.006811649,0.00005552128,0.00002281821,0.000002984496,0.001756962,0.00418996,0.0005389169,0.8003106,0.0001702577,0.1860629],"study_design_scores_gemma":[0.0004290729,0.0007453417,0.05027603,0.00008491796,0.000007035124,0.000338234,0.0006289356,0.9416112,0.0005718319,0.004636839,0.0005727578,0.00009778817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05055321,0.00006731369,0.947832,0.0005365195,0.0006551452,0.0000980909,6.798379e-7,0.00001138811,0.0002456285],"genre_scores_gemma":[0.8379368,0.000006440936,0.1619166,0.00003124623,0.000102777,2.88757e-7,1.421481e-7,0.000001117747,0.000004605718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9374213,"threshold_uncertainty_score":0.2694703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134600856","doi":"10.1016/j.jcss.2011.12.002","title":"The complexity of weighted and unweighted #CSP","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":53,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Class (philosophy); Computational complexity theory; Computation; Mathematical optimization; Discrete mathematics; Combinatorics; Computer science; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06998880825289108,"gpt":0.2476934294203101,"spread":0.1777046211674191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624255,0.0001071695,0.0002835305,0.0001606123,0.0004875592,0.0002087013,0.001067532,0.00002946275,0.000001557585],"category_scores_gemma":[0.000006525381,0.00005873369,0.00007442314,0.0004322946,0.001319049,0.0004623455,0.0002780269,0.0001118117,4.852596e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008483938,"about_ca_system_score_gemma":0.00006551736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002565678,"about_ca_topic_score_gemma":0.000005397894,"domain_scores_codex":[0.9985103,0.0001719912,0.0005348865,0.0001726564,0.0004251914,0.0001849908],"domain_scores_gemma":[0.9988021,0.0002201501,0.0004662655,0.0001905055,0.0002122834,0.0001087046],"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.00001496467,0.00004706591,0.003090277,0.00005327205,0.00004627033,0.00001921217,0.002343113,0.000002564232,0.00003925392,0.94407,0.0002256827,0.05004833],"study_design_scores_gemma":[0.001618673,0.003027538,0.1506758,0.0007894281,0.00005427603,0.004090908,0.001787402,0.5705549,0.001459744,0.2627757,0.002591123,0.0005745119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2812831,0.003341076,0.7086527,0.0006639359,0.002063767,0.0001619774,0.000002326057,0.00004110277,0.003790042],"genre_scores_gemma":[0.8867603,0.00007681348,0.1130387,0.00002906383,0.00008612761,4.010978e-7,2.683356e-8,0.000001706049,0.000006869781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6812943,"threshold_uncertainty_score":0.4860091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158912767","doi":"10.1016/s0022-0000(02)00020-x","title":"Monotone simulations of non-monotone proofs","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":53,"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":"Pigeonhole principle; Monotone polygon; Mathematical proof; Mathematics; Sequent; Proof complexity; Combinatorics; Discrete mathematics; Bounded function; Matching (statistics); Polynomial; Strongly monotone; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0317102402430104,"gpt":0.2626914417893756,"spread":0.2309812015463653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009418376,0.0001144167,0.0003631665,0.0002479618,0.0001919599,0.0002488928,0.0007520826,0.00004586727,0.000003173979],"category_scores_gemma":[0.00001103739,0.00007604413,0.00009386098,0.000502993,0.0001437629,0.0007239769,0.0001145081,0.00008704679,0.00000495067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001976014,"about_ca_system_score_gemma":0.00004959424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000158218,"about_ca_topic_score_gemma":0.000001943295,"domain_scores_codex":[0.9983404,0.00009725376,0.0006577148,0.0001971777,0.0005087447,0.0001987503],"domain_scores_gemma":[0.9986988,0.0001288315,0.0006003052,0.0001936196,0.0002631909,0.000115276],"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.00002564192,0.0009653826,0.04388494,0.001073946,0.0003262715,0.0002323897,0.01947799,0.02752621,0.002392823,0.5840997,0.003337506,0.3166572],"study_design_scores_gemma":[0.0005725857,0.0009999617,0.003433632,0.00009508451,0.00001530658,0.0005873041,0.0001794187,0.9900887,0.000458032,0.001733903,0.0016555,0.0001805773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08515453,0.0009057524,0.9106991,0.0001872447,0.0009968738,0.0001796299,4.19594e-7,0.00002414894,0.001852249],"genre_scores_gemma":[0.9862736,0.00001348679,0.01338774,0.00002295442,0.0002336816,0.00000122299,5.083125e-8,0.000002834112,0.00006442911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9625625,"threshold_uncertainty_score":0.310099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998001670","doi":"10.1016/j.jcss.2014.11.009","title":"Dynamic heterogeneous team formation for robotic urban search and rescue","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Robot; Urban search and rescue; Search and rescue; Task (project management); Computer science; Rescue robot; Work (physics); Order (exchange); Artificial intelligence; Human–computer interaction; Mobile robot; Engineering; Systems engineering; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.0158461054721059,"gpt":0.2391431729055691,"spread":0.2232970674334632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006824186,0.00005881958,0.0001462912,0.00009205806,0.000103608,0.0001313737,0.0001109772,0.0000219001,3.42792e-7],"category_scores_gemma":[0.00000340342,0.00004052333,0.00002908642,0.00005103439,0.00003911702,0.0001855313,0.00001452262,0.00004532102,4.852855e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001709275,"about_ca_system_score_gemma":0.000007078521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002057626,"about_ca_topic_score_gemma":0.000003634168,"domain_scores_codex":[0.9994118,0.00002851205,0.0002348737,0.0000642543,0.0001472673,0.000113319],"domain_scores_gemma":[0.9997694,0.00004572605,0.00002848181,0.00004360993,0.00005291907,0.00005985223],"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.000003456878,0.000003700328,0.0001847715,0.0002903684,0.00001102017,0.000001417523,0.000572782,0.9748091,0.0002567598,0.0007418489,0.0001063077,0.02301849],"study_design_scores_gemma":[0.00008544661,0.0002392882,0.000312762,0.0001128603,0.000005228459,0.0004302228,0.0000832293,0.9982912,0.0002524499,0.0000424734,0.00009339891,0.00005146706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2987459,0.00052724,0.7003049,0.00001982183,0.0002842572,0.00005496139,2.335663e-7,0.000009171806,0.00005347633],"genre_scores_gemma":[0.9901185,0.00003850193,0.009727004,0.00000958445,0.00009580032,6.977352e-7,1.187662e-7,0.000003451968,0.000006346447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6913726,"threshold_uncertainty_score":0.1652493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026139222","doi":"10.1016/j.jcss.2006.10.014","title":"Dependency-preserving normalization of relational and XML data","year":2006,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Functional dependency; Relational database; Redundancy (engineering); XML; Data integrity; Normalization (sociology); Data redundancy; Dependency (UML); XML validation; Data mining; Theoretical computer science; Database; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03262459263909213,"gpt":0.2570799605490312,"spread":0.2244553679099391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079871,0.00006923961,0.0001906955,0.0001384769,0.0001610802,0.00009328526,0.0005622995,0.00002268258,8.109567e-7],"category_scores_gemma":[0.00001544413,0.00004875486,0.00001846303,0.0002231278,0.00009741606,0.002433281,0.0004794996,0.00004770896,2.514853e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007909529,"about_ca_system_score_gemma":0.00008039089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005892544,"about_ca_topic_score_gemma":0.00001414367,"domain_scores_codex":[0.9987364,0.00007543544,0.0004912089,0.0001780507,0.0004199904,0.00009885719],"domain_scores_gemma":[0.9989851,0.000122605,0.0004661678,0.0002321217,0.0001507653,0.00004327837],"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.000007561595,0.00002966191,0.03930382,0.0002569313,0.00001912079,0.0000258865,0.0004381986,0.005372042,0.0003620848,0.9432752,0.001044607,0.009864864],"study_design_scores_gemma":[0.0005355685,0.0002736411,0.04633092,0.0007083489,0.00001504429,0.001892093,0.0003900809,0.9427488,0.0001915079,0.002590078,0.004116673,0.0002072473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04122769,0.001626276,0.9560727,0.0001031488,0.0003626719,0.00004232113,0.000007200387,0.000008984121,0.0005489697],"genre_scores_gemma":[0.7588019,0.00002066418,0.2409769,0.000009260289,0.0001750776,2.001855e-7,0.000001593657,0.000001507515,0.00001290429],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9406852,"threshold_uncertainty_score":0.1988166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057559629","doi":"10.1006/jcss.2002.1855","title":"Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"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":"Deterministic context-free grammar; Embedded pushdown automaton; Deterministic pushdown automaton; Unary operation; Pushdown automaton; Mathematics; Discrete mathematics; Deterministic finite automaton; Nested word; Context-free language; Context-free grammar; Combinatorics; Quantum finite automata; Nondeterministic finite automaton; Automata theory; Finite-state machine; Computer science; Automaton; Rule-based machine translation; Algorithm; Tree-adjoining grammar; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03199716091984622,"gpt":0.2199145394858522,"spread":0.1879173785660059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001593247,0.0001916075,0.000394347,0.0002299126,0.0004942309,0.0009493258,0.0009083036,0.00005878538,0.000007608391],"category_scores_gemma":[0.00001820525,0.000137714,0.00007146029,0.0002673088,0.0007680142,0.001417304,0.0005081228,0.0001605664,0.000002610309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003093233,"about_ca_system_score_gemma":0.00004636631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002365351,"about_ca_topic_score_gemma":0.00000554875,"domain_scores_codex":[0.9981036,0.0001840741,0.0004913705,0.0003485882,0.0005849476,0.0002874768],"domain_scores_gemma":[0.9987966,0.0002401808,0.0003265881,0.0002713935,0.0001163195,0.0002489006],"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.00005443269,0.0002794705,0.0136894,0.0003278198,0.0001308255,0.0004973299,0.0038438,0.00008162112,0.0002737837,0.8133156,0.02447785,0.1430281],"study_design_scores_gemma":[0.001921116,0.001658204,0.04622571,0.0006342327,0.00003102187,0.01222945,0.0008284632,0.8940174,0.0000246388,0.03797723,0.003946462,0.0005060409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.746488,0.008745558,0.2366155,0.00452645,0.002326692,0.0001766912,0.00001066745,0.0001096979,0.001000772],"genre_scores_gemma":[0.9535418,0.0001254329,0.04574687,0.0003218333,0.0002094931,9.321118e-7,1.805677e-7,0.000004554314,0.00004893577],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8939358,"threshold_uncertainty_score":0.9154371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990948892","doi":"10.1016/j.jcss.2007.04.011","title":"The complexity of properly learning simple concept classes","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Machine Learning and Algorithms","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 Toronto","funders":"","keywords":"Mathematics; Combinatorics; Hypergraph; Intersection (aeronautics); Simple (philosophy); Constant (computer programming); DTIME; Time complexity; Upper and lower bounds; Discrete mathematics; Running time; Graph; Turing machine; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03143958742733738,"gpt":0.2867763757400699,"spread":0.2553367883127325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003961141,0.00009077917,0.0002451553,0.00009998227,0.000588121,0.0003392402,0.0009070801,0.00002462793,9.926999e-7],"category_scores_gemma":[0.00003627391,0.00004709903,0.00007431176,0.0003120632,0.0006122293,0.00034489,0.0001466173,0.0002156567,9.020799e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001432309,"about_ca_system_score_gemma":0.00009078826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002648083,"about_ca_topic_score_gemma":0.000002909097,"domain_scores_codex":[0.9983314,0.0002180792,0.0005401747,0.000144796,0.00054137,0.0002241922],"domain_scores_gemma":[0.9985339,0.0004387634,0.0005823701,0.0001185261,0.0002330456,0.00009341569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003357925,0.0000890095,0.03058156,0.0001541613,0.000089241,0.00008585884,0.006820813,0.0129594,0.0002810592,0.326444,0.001575191,0.6208861],"study_design_scores_gemma":[0.0007565341,0.002790557,0.04661013,0.0003378686,0.00001507325,0.001582757,0.003109512,0.9243274,0.0005844685,0.00253802,0.0170598,0.0002878958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1207088,0.001049135,0.8750828,0.0005438912,0.001017443,0.00006453434,2.372305e-7,0.00002818044,0.001505037],"genre_scores_gemma":[0.972503,0.00001096189,0.02710779,0.00002817735,0.000312338,1.517859e-7,4.55396e-8,0.000002089677,0.00003541271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.911368,"threshold_uncertainty_score":0.452341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971378925","doi":"10.1016/j.jcss.2004.12.001","title":"An effective algorithm for peptide de novo sequencing from MS/MS spectra","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Proteomics Techniques and Applications","field":"Chemistry","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bioinformatics Solutions (Canada); Western University","funders":"","keywords":"Computer science; Task (project management); Proteomics; Algorithm; Dynamic programming; Sequence (biology); Identification (biology); Computational biology; Biology; Genetics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01323774681571736,"gpt":0.2886852760603667,"spread":0.2754475292446493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004180346,0.00007939072,0.000171738,0.00004084391,0.0001830599,0.0001057391,0.0002384005,0.00003881084,0.000004992321],"category_scores_gemma":[0.000002900614,0.00006018259,0.00005818299,0.00005845001,0.00006081589,0.000253329,0.0000176378,0.00009410628,4.251355e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001222134,"about_ca_system_score_gemma":0.00005444988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002198713,"about_ca_topic_score_gemma":0.000003877958,"domain_scores_codex":[0.9993173,0.00001509141,0.0002527542,0.0001439821,0.0001316088,0.0001392683],"domain_scores_gemma":[0.9994099,0.0001190522,0.0002237979,0.0000835211,0.00007552435,0.00008825518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003772025,0.0001226727,0.00254538,0.0001706229,0.00009223873,0.00002933635,0.002476485,0.006703601,0.3089518,0.005749305,0.0003512704,0.6727696],"study_design_scores_gemma":[0.0007681224,0.0004526713,0.0005039934,0.000538519,0.00004281736,0.001038092,0.0008540404,0.7067152,0.2804042,0.005996819,0.002390878,0.0002946489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3476852,0.000112926,0.6516023,0.0000504739,0.00002876141,0.00006887359,0.000009590786,0.00001819492,0.0004237509],"genre_scores_gemma":[0.4871436,0.000007848133,0.5120805,0.00002278355,0.000727034,0.000007488632,4.361777e-7,0.000003148722,0.000007131703],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7000116,"threshold_uncertainty_score":0.2454175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040761679","doi":"10.1016/s0022-0000(03)00081-3","title":"The k-Feature Set problem is W[2]-complete","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; University of Victoria","keywords":"Cardinality (data modeling); Completeness (order theory); Computer science; Gene chip analysis; DNA microarray; Set (abstract data type); Feature selection; Feature (linguistics); Theoretical computer science; Mathematics; Data mining; Gene; Biology; Artificial intelligence; Genetics; Gene expression; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01999543691972397,"gpt":0.2630775773578429,"spread":0.243082140438119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006038165,0.00005134369,0.00007233264,0.00002459716,0.0002260133,0.0001046648,0.000171487,0.00003110666,0.000001047869],"category_scores_gemma":[0.000004592066,0.00002657926,0.00004209197,0.00007529218,0.00007640123,0.000005262295,0.00001831037,0.0000432763,6.637703e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004415288,"about_ca_system_score_gemma":0.00006755677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.05542e-7,"about_ca_topic_score_gemma":5.020232e-7,"domain_scores_codex":[0.9994168,0.00008492002,0.0001531513,0.00009939847,0.0001592794,0.00008650323],"domain_scores_gemma":[0.9996114,0.00001159405,0.0001621723,0.00008273056,0.00008631841,0.00004578488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001190758,0.00006343426,0.01311414,0.0001752598,0.0001816191,0.00001045009,0.001681747,0.0005067316,0.3235226,0.02758322,0.5853887,0.04765307],"study_design_scores_gemma":[0.0004146826,0.0005338699,0.002506259,0.00009416159,0.00001127677,0.0006362036,0.001231031,0.0007647328,0.01571636,0.0002936776,0.9776725,0.0001253166],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.843564,0.02541086,0.1009805,0.006692738,0.003672623,0.0004140316,0.000009312645,0.00001382818,0.01924215],"genre_scores_gemma":[0.9966004,0.0001560194,0.002585992,0.0001711376,0.0001938476,0.000001092196,2.255919e-7,0.00000199316,0.0002892767],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3922837,"threshold_uncertainty_score":0.1738335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999792620","doi":"10.1016/s0022-0000(02)00003-x","title":"Reconstructing an ancestral genome using minimum segments duplications and reversals","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Gene duplication; Genome; Ancestor; Phylogenetic tree; Gene; Biology; Genome evolution; Substring; Genetics; Segmental duplication; Evolutionary biology; Gene family; Computational biology; Computer science; Data structure","retraction":null,"screen_n_in":null,"score":{"opus":0.05013380049442868,"gpt":0.2731117117269388,"spread":0.2229779112325101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003861145,0.00006233621,0.0001136646,0.0000608789,0.0001487984,0.00009165458,0.0001208864,0.00002869197,0.000002354268],"category_scores_gemma":[0.000003162332,0.00004990711,0.0000245304,0.00006776772,0.00009887543,0.00002459119,0.0000372217,0.00003188637,3.023424e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007793144,"about_ca_system_score_gemma":0.00001627122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002289051,"about_ca_topic_score_gemma":3.98956e-7,"domain_scores_codex":[0.9993696,0.0000447551,0.0002248451,0.0001390455,0.0001131841,0.000108547],"domain_scores_gemma":[0.9995989,0.000006737144,0.0001923227,0.00006518301,0.00005891333,0.00007800615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002584718,0.0001547616,0.1850485,0.0002994221,0.000276673,0.0000389004,0.002444931,0.002874704,0.7541775,0.0002017349,0.0002961592,0.05416088],"study_design_scores_gemma":[0.00627573,0.008990629,0.120863,0.001176375,0.0003804766,0.03068231,0.015638,0.7938352,0.01335698,0.0002895449,0.006332752,0.002179089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9917207,0.00141553,0.006446409,0.00003949561,0.0001798933,0.00005197111,0.000001719963,0.00000198239,0.000142304],"genre_scores_gemma":[0.9556499,0.0001013397,0.04395919,0.00001813335,0.0002517888,3.152096e-7,3.58549e-7,0.000002599286,0.000016438],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7909604,"threshold_uncertainty_score":0.2035153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000945011","doi":"10.1016/j.jcss.2007.01.003","title":"Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"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":"University of Waterloo","keywords":"Treewidth; Bounded function; Combinatorics; Mathematics; Induced subgraph isomorphism problem; Isomorphism (crystallography); Discrete mathematics; Subgraph isomorphism problem; Graph; Pathwidth; Line graph; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.02049196485234504,"gpt":0.2900205360545985,"spread":0.2695285712022535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004201663,0.0001509758,0.0003944148,0.0008061685,0.0003264452,0.0003066501,0.0008947406,0.00005250111,0.000001602534],"category_scores_gemma":[0.00001831257,0.0001097463,0.00009883197,0.00110629,0.0008233308,0.001013948,0.0001758542,0.0001560604,5.843125e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002810758,"about_ca_system_score_gemma":0.000123713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001314186,"about_ca_topic_score_gemma":0.00001074202,"domain_scores_codex":[0.9975264,0.0001882764,0.0007703836,0.000291477,0.0008870639,0.0003363665],"domain_scores_gemma":[0.9981651,0.0004542235,0.0005692624,0.0002041597,0.0003808286,0.0002264465],"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.0001202909,0.0001394001,0.04031626,0.0002287452,0.0001150883,0.0001505544,0.003296199,0.0002491648,0.002061164,0.8971635,0.0002246119,0.05593508],"study_design_scores_gemma":[0.009016139,0.01070196,0.239212,0.002081497,0.0001141314,0.009424979,0.006723293,0.1108138,0.01159077,0.5973098,0.001363151,0.001648465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4389847,0.00089215,0.5592711,0.0001319554,0.0003529641,0.00008930844,6.481012e-7,0.00001396485,0.0002632479],"genre_scores_gemma":[0.9136555,0.00006718739,0.08612991,0.00006818698,0.0000626917,6.386109e-7,1.060673e-7,0.000003978072,0.00001182957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4746708,"threshold_uncertainty_score":0.4475325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047794824","doi":"10.1016/j.jcss.2007.03.008","title":"On the complexity of the spaced seeds","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Western University","funders":"Canada Research Chairs","keywords":"Probabilistic logic; Homology (biology); Exponential function; Computational complexity theory; Mathematics; Computer science; Discrete mathematics; Combinatorics; Theoretical computer science; Algorithm; Biology; Statistics; Genetics; Amino acid; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03312891904103175,"gpt":0.2525826019601679,"spread":0.2194536829191361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009663765,0.00004542819,0.00009202966,0.00001815564,0.0001385159,0.00001691609,0.0002243819,0.00001757495,4.317559e-7],"category_scores_gemma":[0.000008850954,0.00001934899,0.00005879959,0.00006054389,0.0003634692,5.036698e-7,0.00007263354,0.00003355636,1.146151e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002905006,"about_ca_system_score_gemma":0.00002603988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003932675,"about_ca_topic_score_gemma":0.000006481622,"domain_scores_codex":[0.9995093,0.00004470917,0.000174273,0.00005832609,0.0001395926,0.0000737876],"domain_scores_gemma":[0.9996104,0.00004205018,0.0001769673,0.00008096054,0.00006870075,0.00002096941],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.000315895,0.000203875,0.126197,0.0001897658,0.0005528927,0.000009857909,0.00324205,0.002952019,0.6356855,0.2090824,0.01019406,0.01137476],"study_design_scores_gemma":[0.001030578,0.003172541,0.8545769,0.0003079695,0.00005847953,0.0005928995,0.003937407,0.001708897,0.1234232,0.003831091,0.007065115,0.0002948896],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9951482,0.0005103424,0.002287462,0.0004553734,0.0003722215,0.00004233835,0.000001059638,2.390663e-7,0.001182706],"genre_scores_gemma":[0.9992,0.00001562407,0.0004980875,0.0001079512,0.000162511,1.057528e-7,2.228735e-8,0.000001162755,0.00001447524],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.72838,"threshold_uncertainty_score":0.1339217,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160395634","doi":"10.1016/j.jcss.2007.04.019","title":"A distributed multi-agent meeting scheduler","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Multi-Agent Systems and Negotiation","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":"Acadia University","funders":"","keywords":"Computer science; Negotiation; Scheduling (production processes); Schedule; Task (project management); Architecture; Multi-agent system; Intelligent agent; Distributed computing; Human–computer interaction; Operations research; Artificial intelligence; Operations management; Operating system; Systems engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03604890839245389,"gpt":0.2828293850728211,"spread":0.2467804766803672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004471496,0.0001271496,0.0002806096,0.0002523356,0.0003041989,0.0003894155,0.0006605295,0.0000491562,9.353963e-7],"category_scores_gemma":[0.00002121677,0.00008651771,0.0000949247,0.00043224,0.00006599394,0.0007277942,0.0001371725,0.000105019,0.000005234388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005789753,"about_ca_system_score_gemma":0.00006679457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001849358,"about_ca_topic_score_gemma":0.000005318274,"domain_scores_codex":[0.9979959,0.0001208849,0.000758672,0.0002324512,0.0006120774,0.0002800591],"domain_scores_gemma":[0.9986509,0.0001569887,0.0006342493,0.0001476158,0.0002261523,0.0001841059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001367339,0.001407959,0.3459785,0.001822416,0.0006803829,0.001657344,0.02719446,0.02462595,0.01928697,0.2414138,0.008229183,0.3275664],"study_design_scores_gemma":[0.001557011,0.0005270438,0.1154982,0.000947298,0.00002093177,0.001768742,0.0011357,0.8740187,0.001441666,0.00006710208,0.002625583,0.0003919951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1679545,0.0005156375,0.8295783,0.0001394734,0.001522323,0.00008392923,7.079812e-7,0.00002932075,0.0001757865],"genre_scores_gemma":[0.8800819,0.000007885804,0.1195318,0.00004936165,0.0003140744,4.309305e-7,1.643747e-7,0.000002703117,0.00001169509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8493928,"threshold_uncertainty_score":0.3755143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010023761","doi":"10.1016/j.jcss.2007.04.001","title":"The web from a complex adaptive systems perspective","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Computer science; Complex adaptive system; Perspective (graphical); Web modeling; World Wide Web; Complex system; Web intelligence; Openness to experience; Data science; Web service; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02388728397234331,"gpt":0.2835925280389754,"spread":0.2597052440666321,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00167418,0.0001021566,0.0002802128,0.00009876252,0.0004439514,0.0003232354,0.000372191,0.00001516554,0.000004839395],"category_scores_gemma":[0.000001554408,0.00005674579,0.0001193518,0.0002456948,0.0002000755,0.0001431965,0.00006922692,0.0001159015,0.00000147618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004809226,"about_ca_system_score_gemma":0.00006330035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003459273,"about_ca_topic_score_gemma":0.00001792565,"domain_scores_codex":[0.9987461,0.0001199116,0.0004494049,0.0001375391,0.000360542,0.0001865146],"domain_scores_gemma":[0.9985971,0.000470009,0.0004612855,0.0001019447,0.0002876014,0.00008205854],"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.00008772731,0.00008584293,0.03823262,0.00001006407,0.0006768346,0.00002685412,0.002488883,0.001355443,0.0003128606,0.917111,0.01033581,0.02927604],"study_design_scores_gemma":[0.001274456,0.001319547,0.04933363,0.0008006501,0.0002598103,0.0002150921,0.1063628,0.8015658,0.0001326191,0.02093501,0.01713919,0.0006614086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2533533,0.002528101,0.7224299,0.0002365036,0.0008320534,0.0001959447,0.000008542603,0.0000305043,0.02038514],"genre_scores_gemma":[0.9949198,0.000006205265,0.003683848,0.000009591658,0.001358427,8.047707e-7,1.962553e-7,0.000003227824,0.00001790996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.896176,"threshold_uncertainty_score":0.3414561,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077761942","doi":"10.1016/j.jcss.2005.02.003","title":"Kernels in planar digraphs","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Digraph; Combinatorics; Kernel (algebra); Vertex (graph theory); Mathematics; Planar; Set (abstract data type); Discrete mathematics; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02316245338529533,"gpt":0.2916205874945978,"spread":0.2684581341093025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002097901,0.00008757993,0.0002294959,0.0005322335,0.0001188039,0.0002457065,0.001086737,0.00002707054,0.000001039116],"category_scores_gemma":[0.00000914155,0.00006008318,0.0000577009,0.0006877689,0.0001553989,0.001191697,0.0001039526,0.0001458703,0.000004127549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003146318,"about_ca_system_score_gemma":0.00007270735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003341085,"about_ca_topic_score_gemma":0.000005196044,"domain_scores_codex":[0.998458,0.0001539282,0.0004185204,0.0001913244,0.0005284945,0.0002497613],"domain_scores_gemma":[0.9992625,0.0001992567,0.0001904939,0.0001420246,0.0000833548,0.0001224366],"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.00003899661,0.000147538,0.04476858,0.0001006519,0.00003618443,0.0003438863,0.004186722,0.01325051,0.0004485306,0.6426665,0.0009669395,0.293045],"study_design_scores_gemma":[0.002914147,0.002331775,0.0775703,0.001239178,0.000009812607,0.006573228,0.001370464,0.8564266,0.001099673,0.04192662,0.007749173,0.0007890314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2615792,0.001411235,0.7338789,0.0009080859,0.0004308627,0.000083146,4.049109e-7,0.00002338045,0.001684776],"genre_scores_gemma":[0.9257479,0.00003058634,0.07396845,0.00007190362,0.0001619735,6.278316e-7,1.484899e-8,0.000001889241,0.00001661955],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8431761,"threshold_uncertainty_score":0.2450121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032287082","doi":"10.1016/j.jcss.2011.01.003","title":"A three-string approach to the closest string problem","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":33,"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":"String (physics); Mathematics; Combinatorics; Computer science; Theoretical physics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0543624952810548,"gpt":0.2372897286813722,"spread":0.1829272334003174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001904072,0.0001095505,0.0002065022,0.0001516767,0.0003907004,0.0004763729,0.001689489,0.00002568495,5.748275e-7],"category_scores_gemma":[0.000004843435,0.00005589534,0.00005643938,0.0004296736,0.00006408257,0.0008420844,0.0005246,0.0001278764,0.000003090406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002006712,"about_ca_system_score_gemma":0.00008298285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004314009,"about_ca_topic_score_gemma":0.000002859286,"domain_scores_codex":[0.9985486,0.00006415003,0.0003966759,0.0002383806,0.0004992161,0.000253024],"domain_scores_gemma":[0.9991603,0.00005965126,0.0002658458,0.0002401851,0.0001090204,0.0001649598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003070485,0.0002656853,0.008858192,0.0002134018,0.00008660031,0.00008609638,0.01436727,0.0044714,0.0001008474,0.4669677,0.005343566,0.4992085],"study_design_scores_gemma":[0.0006968273,0.001388211,0.02915178,0.0009651768,0.0000256922,0.003259572,0.001249461,0.9539164,0.0002476362,0.003520102,0.005098691,0.0004804624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01635409,0.0003451756,0.9803412,0.0001281276,0.0006180322,0.0001284658,6.856878e-7,0.00002336983,0.002060841],"genre_scores_gemma":[0.6275097,0.000004692965,0.3721811,0.00004851298,0.0002483469,0.000001588197,3.679244e-8,0.000002015595,0.000004017903],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.949445,"threshold_uncertainty_score":0.4593675,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163733217","doi":"10.1016/j.jcss.2013.11.002","title":"Unshuffling a square is NP-hard","year":2013,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":32,"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":"String (physics); Square (algebra); Combinatorics; Time complexity; Interleaving; Mathematics; Square tiling; Discrete mathematics; Partition (number theory); Dynamic programming; Reduction (mathematics); Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02151735836986119,"gpt":0.2434223198263348,"spread":0.2219049614564736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000791199,0.0001101214,0.0002476218,0.0001825149,0.0002795763,0.0009314956,0.001024516,0.00003502987,0.000009661148],"category_scores_gemma":[0.000004959203,0.00006785585,0.00007398606,0.0003047963,0.00007449319,0.001793848,0.0002864051,0.0001078701,0.00002079482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001741969,"about_ca_system_score_gemma":0.00007301265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002998778,"about_ca_topic_score_gemma":2.298948e-7,"domain_scores_codex":[0.9985188,0.00007769203,0.0004318722,0.0002241126,0.0005420408,0.0002054326],"domain_scores_gemma":[0.9990026,0.000100084,0.0003188612,0.000196231,0.0002226532,0.0001595888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001391954,0.0002271598,0.02801842,0.0005069509,0.0001372274,0.0001804903,0.008966522,0.001874276,0.001374104,0.06664944,0.2237568,0.6682947],"study_design_scores_gemma":[0.0005819845,0.0007679893,0.01337625,0.000698387,0.00001029529,0.001991394,0.0005296115,0.9691383,0.0002952874,0.001910945,0.01038431,0.0003152737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09569865,0.0009081782,0.9001586,0.001226471,0.001404846,0.00008815045,9.948831e-7,0.00003203072,0.0004820413],"genre_scores_gemma":[0.7674095,0.00002333788,0.2317271,0.0003591721,0.0004431602,0.000001285507,8.467366e-8,0.000002873503,0.00003350883],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.967264,"threshold_uncertainty_score":0.8982433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964122413","doi":"10.1016/j.jcss.2011.04.003","title":"Scheduling malleable tasks with precedence constraints","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Bank of Canada","funders":"","keywords":"Computer science; Scheduling (production processes); Rounding; Speedup; Approximation algorithm; Regular polygon; Mathematical optimization; Algorithm; Parallel computing; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02568153275759406,"gpt":0.2140011848186803,"spread":0.1883196520610862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004376471,0.00006692664,0.0001375916,0.00009101089,0.00008095688,0.0000829491,0.0001457517,0.00002330921,0.00001054048],"category_scores_gemma":[0.00000287474,0.00004354389,0.00001954201,0.0001373858,0.0001249569,0.000233804,0.00001038502,0.00007472668,0.000001976062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009948612,"about_ca_system_score_gemma":0.00003305694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001584546,"about_ca_topic_score_gemma":4.179053e-7,"domain_scores_codex":[0.999413,0.00001822626,0.000212257,0.00006849087,0.0001782652,0.0001097211],"domain_scores_gemma":[0.99969,0.00002781304,0.00008055523,0.00004135566,0.00008352417,0.00007676613],"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.00002643097,0.00003638741,0.01194129,0.0002732176,0.0001269324,0.00009932848,0.004930445,0.9486831,0.00009771038,0.00381447,0.0001083402,0.02986235],"study_design_scores_gemma":[0.0003230925,0.0002733552,0.001377356,0.0004970774,0.00001369843,0.001356686,0.001638597,0.993973,0.0003785021,0.00002608042,0.00001851837,0.0001240799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2028351,0.0004361459,0.790556,0.00001153462,0.0005730332,0.00003624918,4.427172e-7,0.00004261131,0.00550893],"genre_scores_gemma":[0.6664676,0.00001354158,0.3334344,0.000006821565,0.00007002534,2.540938e-7,2.36627e-8,0.000002631461,0.000004738635],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4636326,"threshold_uncertainty_score":0.1775668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003002196","doi":"10.1016/j.jcss.2013.04.003","title":"Leader election in ad hoc radio networks: A keen ear helps","year":2013,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Node (physics); Collision; Wireless ad hoc network; Collision detection; Leader election; Computer science; Computer network; Radio networks; Algorithm; Computer security; Telecommunications; Physics; Wireless network; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.01212642661697482,"gpt":0.2201106457456624,"spread":0.2079842191286875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001524176,0.0001388573,0.0003418598,0.0002829401,0.0001599867,0.0006810534,0.0008915392,0.00006833949,0.000004843452],"category_scores_gemma":[0.000005450047,0.00009879922,0.00007558428,0.0007996618,0.0001063074,0.00152979,0.0001338623,0.0002356351,0.000009618203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006698726,"about_ca_system_score_gemma":0.0000879053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002332337,"about_ca_topic_score_gemma":0.00001099383,"domain_scores_codex":[0.9980785,0.0002246186,0.0005973274,0.0002757274,0.0004717627,0.0003520639],"domain_scores_gemma":[0.9990119,0.0001552972,0.0003580184,0.0001784921,0.0001453587,0.0001509071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003634435,0.0002268769,0.02638782,0.0001950796,0.000112268,0.0002495195,0.005674975,0.1624105,0.0002536943,0.01854458,0.02984266,0.7560657],"study_design_scores_gemma":[0.0003954768,0.0005433952,0.02085706,0.0002998478,0.000003999022,0.001044285,0.0001857903,0.9753702,0.00001588778,0.0002933678,0.0008376378,0.0001530417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1445498,0.004365303,0.8479771,0.0006609926,0.001759297,0.0002153568,6.652397e-8,0.00003646715,0.0004355911],"genre_scores_gemma":[0.9746005,0.0001382495,0.02450791,0.0001503614,0.0005472232,0.000005255468,4.721648e-8,0.000004431536,0.00004603102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8300506,"threshold_uncertainty_score":0.6567414,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1602309302","doi":"10.1016/j.jcss.2015.07.004","title":"Conservative constraint satisfaction re-revisited","year":2015,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"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","keywords":"Constraint satisfaction problem; Homomorphism; Mathematics; Constraint (computer-aided design); Variable (mathematics); Graph; Constraint satisfaction; Discrete mathematics; Conservative extension; Combinatorics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.06971659307546549,"gpt":0.3277397241282335,"spread":0.2580231310527681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003057023,0.00009417045,0.0002547909,0.0002714029,0.0001624805,0.0003285493,0.000572775,0.00002954612,0.000001256079],"category_scores_gemma":[0.00004917032,0.00006414044,0.00005152387,0.0005681791,0.0003532491,0.001092123,0.0001389227,0.0001380761,0.000004226937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005330419,"about_ca_system_score_gemma":0.0002379166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008593792,"about_ca_topic_score_gemma":0.000001657515,"domain_scores_codex":[0.9982328,0.0003282391,0.0004042425,0.0001897323,0.0006555796,0.0001894481],"domain_scores_gemma":[0.9984971,0.00028436,0.0003422576,0.0001438439,0.0005032218,0.000229184],"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.00006076627,0.00004341809,0.04213519,0.00009447813,0.00008332607,0.000242974,0.004913696,0.001819724,0.0003482775,0.8159105,0.004062415,0.1302853],"study_design_scores_gemma":[0.005662269,0.008072563,0.09750626,0.001931601,0.00004495341,0.01205012,0.01513644,0.7383683,0.0014686,0.1139488,0.004587585,0.00122252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1322112,0.0004220395,0.8642449,0.0006137053,0.0006317406,0.00009155038,8.531646e-7,0.00002914788,0.001754861],"genre_scores_gemma":[0.9204161,0.000008209918,0.07935771,0.00008837465,0.0001152864,6.251573e-7,3.961241e-8,0.000001907147,0.0000117534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7882049,"threshold_uncertainty_score":0.3168208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914039150","doi":"10.1016/j.jcss.2011.09.006","title":"Enumerating homomorphisms","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"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":"Hungarian Scientific Research Fund; Fonds National de la Recherche Luxembourg","keywords":"Homomorphism; Decision problem; Constraint satisfaction problem; Mathematics; Enumeration; Characterization (materials science); Discrete mathematics; Constraint (computer-aided design); Graph; Time complexity; Computer science; Combinatorics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.05588940802729524,"gpt":0.2790729364453028,"spread":0.2231835284180076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001712379,0.00008300616,0.0002012616,0.0002502226,0.000258184,0.0002142836,0.00106055,0.00002261655,0.000003014447],"category_scores_gemma":[0.00001150527,0.00005566722,0.00005883506,0.0004164049,0.0001986521,0.001012132,0.0001958282,0.0001196895,0.000004347657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001448639,"about_ca_system_score_gemma":0.00007343997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002853929,"about_ca_topic_score_gemma":2.45731e-7,"domain_scores_codex":[0.9986507,0.0001543207,0.0003568157,0.0001710985,0.0004567784,0.0002102941],"domain_scores_gemma":[0.9991724,0.0001233712,0.0002549008,0.00015035,0.0001686572,0.0001303084],"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.00001079341,0.00004313541,0.002498556,0.0000462615,0.00002689011,0.0002018644,0.003689577,0.0001540432,0.0003084303,0.9029696,0.0001290222,0.0899218],"study_design_scores_gemma":[0.003129162,0.009249443,0.03670468,0.001801994,0.00004421005,0.02691229,0.004686412,0.6967034,0.009539655,0.207787,0.001887462,0.00155426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07143281,0.0005440849,0.9232797,0.00006220134,0.0007068282,0.00004883662,1.852972e-7,0.00002459187,0.003900758],"genre_scores_gemma":[0.7938247,0.000009858296,0.2060114,0.00003431453,0.0001056762,4.933223e-7,7.884414e-9,0.000001878201,0.00001160922],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7223919,"threshold_uncertainty_score":0.2270043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051028069","doi":"10.1016/j.jcss.2004.07.003","title":"A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"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":"Computational complexity theory; Bipartite graph; Compaction; Mathematics; Equivalence (formal languages); Combinatorics; Computational problem; Constraint satisfaction problem; Computer science; Chordal graph; Time complexity; Discrete mathematics; Theoretical computer science; Graph; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1057088892842839,"gpt":0.3314450610096022,"spread":0.2257361717253184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001493127,0.0001325782,0.0003050244,0.0003749397,0.0003440039,0.0002621114,0.0002543807,0.00003876269,3.353512e-7],"category_scores_gemma":[0.00001618039,0.0000962238,0.00002377661,0.000360265,0.0004779886,0.001371855,0.0001547724,0.0001318508,3.813838e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005192595,"about_ca_system_score_gemma":0.00005248578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001976177,"about_ca_topic_score_gemma":0.00002913853,"domain_scores_codex":[0.9981015,0.0002231429,0.0005130666,0.0003259995,0.0006400605,0.0001962305],"domain_scores_gemma":[0.9985511,0.0003665216,0.0004684699,0.0001166456,0.0002779475,0.0002193187],"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.002626213,0.0003235358,0.03992294,0.0006670783,0.0003354429,0.00005638315,0.01119606,0.05369867,0.02571524,0.7577057,0.00105982,0.1066929],"study_design_scores_gemma":[0.001334407,0.001510114,0.2081881,0.0001868557,0.00001622204,0.001575062,0.0002659716,0.780773,0.0001121748,0.005583851,0.0002782602,0.0001759375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.775033,0.0002512027,0.2231852,0.001222003,0.0001037041,0.0001350697,0.000008294531,0.00001255989,0.00004894823],"genre_scores_gemma":[0.8928648,0.00002618088,0.1069226,0.00009224815,0.00008409028,0.00000105556,0.000001017832,0.000003169961,0.000004821659],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7521219,"threshold_uncertainty_score":0.3923892,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"}]}