{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"John Watrous","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008938765,0.0003707259,0.0008840683,0.0008212187,0.001193346,0.001408017,0.001540153,0.001641077,0.006709985],"category_scores_gemma":[0.008081963,0.000499929,0.0005689277,0.0006937079,0.002772481,0.002979787,0.001292936,0.001493444,0.0002521646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001405657,"about_ca_system_score_gemma":0.0008439735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00498735,"about_ca_topic_score_gemma":0.005033173,"domain_scores_codex":[0.999472,0.0002324597,0.00001670323,0.00005894224,0.000111521,0.0001084135],"domain_scores_gemma":[0.9957065,0.003109528,0.0002049931,0.0003909692,0.0002592858,0.0003288055],"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.000162206,0.0001518303,0.001156997,0.00006038873,0.00004816869,0.0001720663,0.0002424476,0.45672,0.001650467,0.5349259,0.00175094,0.002958609],"study_design_scores_gemma":[0.00004656307,0.00001546008,0.0001910271,0.000005292774,0.000007218486,0.0000143657,0.00004719441,0.8677353,0.0002691831,0.1313922,0.0002637442,0.0000124249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9153259,0.0002393984,0.05551855,0.002689072,0.0002173365,0.00007422437,0.0001759155,0.0003524832,0.02540704],"genre_scores_gemma":[0.9944956,0.00007331886,0.003794338,0.0001280529,0.00002962562,0.000039053,0.00005364455,0.00004495119,0.00134142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006709985,"threshold_uncertainty_score":0.02244717,"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","authors":[{"name":"Paul Beame","is_ca":false},{"name":"Faith E. Fich","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01388675,0.004301832,0.005248293,0.006822004,0.003293706,0.01167747,0.009582475,0.005806073,0.02723122],"category_scores_gemma":[0.09448473,0.002694789,0.002723225,0.008747675,0.005521022,0.02683913,0.008437512,0.01354675,0.004042646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00642968,"about_ca_system_score_gemma":0.005634132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00272913,"about_ca_topic_score_gemma":0.004108267,"domain_scores_codex":[0.9897192,0.003596846,0.0004904506,0.001540284,0.002837656,0.001815678],"domain_scores_gemma":[0.880115,0.1039227,0.002937282,0.00586886,0.00457511,0.002580948],"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.001534568,0.0008729274,0.001264379,0.001716371,0.0001844043,0.0001836769,0.0005932372,0.1739486,0.00219366,0.5973677,0.05540515,0.1647352],"study_design_scores_gemma":[0.0001510327,0.000162539,0.0004079956,0.0003108114,0.0001235486,0.0002581633,0.0001767245,0.3416273,0.001315364,0.6475728,0.007824153,0.00006957492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03910154,0.026489,0.8336782,0.01485309,0.001743528,0.0003798165,0.00158418,0.001327128,0.08084351],"genre_scores_gemma":[0.3878987,0.02418773,0.5282868,0.004502759,0.006756912,0.001541377,0.004102891,0.002489423,0.04023356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02723122,"threshold_uncertainty_score":0.09109747,"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","authors":[{"name":"William Hesse","is_ca":false},{"name":"Eric Allender","is_ca":false},{"name":"David A. Mix Barrington","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009472183,0.0008657315,0.001238367,0.001360588,0.001524686,0.005343311,0.002373909,0.001762915,0.01011613],"category_scores_gemma":[0.008491115,0.0008334634,0.001065527,0.002063445,0.002290953,0.01037598,0.003342251,0.003177498,0.001095173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00436308,"about_ca_system_score_gemma":0.00170842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001579629,"about_ca_topic_score_gemma":0.002526743,"domain_scores_codex":[0.9987596,0.0001374218,0.00009769061,0.0003610479,0.0003035171,0.0003406448],"domain_scores_gemma":[0.9953488,0.003046353,0.0003572372,0.0006602394,0.0002757544,0.0003116749],"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.0005136692,0.00008064901,0.0007026155,0.0002221195,0.00003339799,0.0001000761,0.0004097453,0.007722741,0.005679635,0.9395363,0.004229676,0.04076932],"study_design_scores_gemma":[0.00008881238,0.00003905191,0.0002966981,0.00004446558,0.00006157799,0.0001552043,0.00006728248,0.02793018,0.006436665,0.9612952,0.00354709,0.00003778822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4257094,0.003069245,0.4758362,0.003376418,0.0002972244,0.0004031533,0.001484742,0.003371781,0.08645191],"genre_scores_gemma":[0.9318653,0.0008505343,0.05067149,0.0005889676,0.0001426019,0.000230694,0.0004943006,0.0002896514,0.01486644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01011613,"threshold_uncertainty_score":0.03384185,"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","authors":[{"name":"Krzysztof Pietrzak","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005130848,0.001767409,0.003587637,0.00195262,0.00260162,0.007427807,0.005469713,0.003579617,0.01502354],"category_scores_gemma":[0.05108801,0.001196134,0.002502336,0.005442751,0.003473654,0.02141277,0.003885397,0.005489084,0.001349185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005740596,"about_ca_system_score_gemma":0.006525215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006020892,"about_ca_topic_score_gemma":0.006233648,"domain_scores_codex":[0.9927238,0.002587775,0.0005173686,0.001491825,0.001624506,0.001054778],"domain_scores_gemma":[0.9297576,0.05829419,0.002782638,0.005622858,0.002186689,0.001355983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002381964,0.0006945009,0.004952476,0.0008657182,0.0003593425,0.0003997753,0.0007780174,0.5859976,0.003186855,0.2854383,0.02277924,0.09216627],"study_design_scores_gemma":[0.0001917007,0.00009352026,0.0006455039,0.00004530969,0.00007467072,0.0001265829,0.0002137297,0.6025651,0.0008689812,0.393231,0.001907463,0.00003639222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4366393,0.004648034,0.5007979,0.01446331,0.0005997009,0.0005808231,0.005798258,0.002166563,0.03430616],"genre_scores_gemma":[0.8142553,0.002262437,0.1627016,0.001055073,0.0009470225,0.0006897203,0.007301442,0.00106961,0.009717708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01502354,"threshold_uncertainty_score":0.05025882,"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","authors":[{"name":"Andris Ambainis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005380524,0.0004993242,0.001753335,0.001671812,0.001758919,0.006555983,0.002310202,0.002899935,0.01185301],"category_scores_gemma":[0.04746708,0.0006873099,0.0009538584,0.00254113,0.004940404,0.01874498,0.002799584,0.005078965,0.00100977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003856802,"about_ca_system_score_gemma":0.002427237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002235827,"about_ca_topic_score_gemma":0.001646206,"domain_scores_codex":[0.9941483,0.001640868,0.0002398932,0.0008838523,0.001612206,0.001474986],"domain_scores_gemma":[0.903962,0.07828522,0.003367672,0.008534746,0.003045335,0.00280509],"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.0004242281,0.0001015471,0.002115516,0.0001864059,0.00003571383,0.00007949344,0.000275657,0.01698032,0.001777961,0.9593791,0.004498438,0.01414567],"study_design_scores_gemma":[0.00009186439,0.00008069386,0.001505342,0.00003684505,0.00004782002,0.0002776791,0.0001552512,0.08062731,0.0010433,0.9135768,0.002514279,0.00004273737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.615689,0.008140514,0.2472461,0.0517354,0.0008651189,0.0001703172,0.001507196,0.0006854699,0.07396083],"genre_scores_gemma":[0.9843727,0.001434425,0.007798141,0.0006066177,0.000906869,0.00003891325,0.0001468102,0.0001172508,0.00457824],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01185301,"threshold_uncertainty_score":0.03965229,"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","authors":[{"name":"Ming Li","is_ca":false},{"name":"Bin Ma","is_ca":true},{"name":"Lusheng Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125258,0.0007232936,0.001198863,0.004316458,0.001382271,0.001037173,0.001012748,0.00176686,0.003174988],"category_scores_gemma":[0.004293627,0.000474742,0.0007319643,0.00380274,0.000831756,0.001874744,0.001083068,0.001007242,0.001327049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003455141,"about_ca_system_score_gemma":0.000679385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000844578,"about_ca_topic_score_gemma":0.001570126,"domain_scores_codex":[0.9990262,0.0001064009,0.000103033,0.000279273,0.000391127,0.00009397869],"domain_scores_gemma":[0.9974246,0.001049078,0.0004109656,0.0004766417,0.0004592061,0.0001796205],"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.002873335,0.0008541502,0.02799882,0.00104456,0.0004540601,0.005900218,0.001175968,0.02216006,0.3670491,0.01235736,0.005962624,0.5521697],"study_design_scores_gemma":[0.0004440208,0.003313964,0.04899443,0.0003734583,0.0011811,0.02172153,0.003178627,0.5418472,0.2659518,0.07395004,0.03881861,0.0002252262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6998252,0.003955237,0.2889021,0.0009148869,0.0004007849,0.0002548776,0.001002227,0.00135029,0.003394505],"genre_scores_gemma":[0.7731761,0.00125896,0.2173216,0.0003815051,0.0004200424,0.0001472296,0.002934315,0.0002041612,0.004156094],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004316458,"threshold_uncertainty_score":0.01062143,"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","authors":[{"name":"Eric Bach","is_ca":false},{"name":"S. N. Coppersmith","is_ca":false},{"name":"Marcel Paz Goldschen","is_ca":false},{"name":"Robert Joynt","is_ca":false},{"name":"John Watrous","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081277,0.0006066923,0.001510702,0.001506904,0.002754129,0.003976957,0.001487294,0.003229854,0.005812063],"category_scores_gemma":[0.003655143,0.0006151174,0.0007911628,0.0008085141,0.003073071,0.003827559,0.002414239,0.002233353,0.000832112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009355008,"about_ca_system_score_gemma":0.000773494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007337102,"about_ca_topic_score_gemma":0.0006737698,"domain_scores_codex":[0.9994463,0.0001447486,0.00002591895,0.00007197765,0.0001340273,0.0001769118],"domain_scores_gemma":[0.9981207,0.0008456588,0.0001350382,0.0002523405,0.0001729733,0.000473239],"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.0001042582,0.00009827767,0.000198132,0.00003192258,0.00001226114,0.0001509963,0.0001126991,0.008314958,0.002174634,0.9862133,0.0007417387,0.001846928],"study_design_scores_gemma":[0.00006482918,0.00003632033,0.0002413665,0.00002310989,0.000009789627,0.0001153812,0.00008860067,0.09994114,0.0009913862,0.897854,0.0006066756,0.00002736133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8256763,0.0006180075,0.09150367,0.002020475,0.0004205708,0.00007036573,0.000134969,0.0004205492,0.07913511],"genre_scores_gemma":[0.9796042,0.0002432402,0.009941661,0.0002841252,0.00008945139,0.00005846722,0.00008886385,0.00009257967,0.009597361],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005812063,"threshold_uncertainty_score":0.01944321,"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","authors":[{"name":"Ariel Fuxman","is_ca":true},{"name":"Renée J. Miller","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01298602,0.0006641238,0.002112208,0.001890118,0.001814605,0.00483345,0.003943878,0.001957653,0.00333284],"category_scores_gemma":[0.03622402,0.001299047,0.002694351,0.002145041,0.003243601,0.008540692,0.00428096,0.00433209,0.0007340403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002313698,"about_ca_system_score_gemma":0.002961481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005258131,"about_ca_topic_score_gemma":0.004889467,"domain_scores_codex":[0.9836636,0.005063333,0.002118101,0.001533438,0.006367383,0.001254196],"domain_scores_gemma":[0.9623588,0.02009491,0.001347843,0.009933002,0.005658024,0.0006074694],"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.0005376618,0.0002518532,0.003264786,0.0008755242,0.0003270418,0.001660534,0.003124444,0.02834287,0.01019962,0.8231716,0.01428816,0.1139558],"study_design_scores_gemma":[0.0001383088,0.00009231028,0.0004536207,0.00008388483,0.0003346118,0.001066427,0.0006352197,0.1546339,0.01550357,0.809095,0.01785831,0.0001047835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03263834,0.001167618,0.9549186,0.001921691,0.0002329426,0.0002127285,0.0005042733,0.002489003,0.0059149],"genre_scores_gemma":[0.4441048,0.0008117325,0.5435937,0.001020664,0.0003001029,0.0001713619,0.001685035,0.001153702,0.007158902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01298602,"threshold_uncertainty_score":0.06867743,"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","authors":[{"name":"Klaus-Jörn Lange","is_ca":false},{"name":"Pierre McKenzie","is_ca":true},{"name":"Alain Tapp","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015771,0.0004230679,0.0008983061,0.001207907,0.00252624,0.003850285,0.0009048036,0.00204123,0.01578171],"category_scores_gemma":[0.003482385,0.0004914185,0.0006636714,0.0008086906,0.008534028,0.009016452,0.002894739,0.003138974,0.001907915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001261377,"about_ca_system_score_gemma":0.001303488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001114003,"about_ca_topic_score_gemma":0.000659159,"domain_scores_codex":[0.998584,0.0003087384,0.00008486323,0.0003555383,0.0004314291,0.0002354517],"domain_scores_gemma":[0.9978114,0.001033042,0.0001345803,0.00053989,0.0003037033,0.0001774534],"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.000002703687,0.000001286309,0.00000581769,0.000004932134,7.826643e-7,0.000003596783,0.00001645238,0.00005359827,0.00007346872,0.9988775,0.0002267619,0.0007330729],"study_design_scores_gemma":[0.000003661882,0.000005847242,0.00001897465,0.000002998128,0.000002386457,0.00002647427,0.00001328606,0.0004249621,0.0003350018,0.9943144,0.004847368,0.000004643733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1213776,0.005615263,0.2403713,0.01602383,0.004139705,0.0001443809,0.0008178059,0.001119314,0.6103908],"genre_scores_gemma":[0.9138629,0.002266045,0.02212814,0.001805319,0.002046498,0.0001606323,0.000217455,0.0003244955,0.05718856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01578171,"threshold_uncertainty_score":0.05279505,"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","authors":[{"name":"James J. Cheetham","is_ca":true},{"name":"Frank Dehne","is_ca":true},{"name":"Andrew Rau‐Chaplin","is_ca":true},{"name":"Ulrike Stege","is_ca":true},{"name":"Peter J. Taillon","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624984,0.0008682701,0.001556583,0.0007989366,0.001358672,0.001811013,0.001666481,0.001727907,0.005499913],"category_scores_gemma":[0.01025569,0.0006660533,0.0008166677,0.001681596,0.001468045,0.003415003,0.001297601,0.00207283,0.0006886366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001095068,"about_ca_system_score_gemma":0.001760738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005860194,"about_ca_topic_score_gemma":0.007488388,"domain_scores_codex":[0.9989623,0.0002273639,0.00009119409,0.0002346846,0.0002749205,0.0002094413],"domain_scores_gemma":[0.9924758,0.005810309,0.0002649382,0.0008857927,0.0003809583,0.0001821682],"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.0005478986,0.0002415232,0.002088162,0.0004613429,0.0001094063,0.0003984853,0.0002238305,0.7973028,0.006186997,0.0375796,0.01263789,0.1422221],"study_design_scores_gemma":[0.0001017018,0.00004377378,0.0002464396,0.00001020512,0.0000148545,0.00005358317,0.00006230189,0.9387869,0.002349291,0.05723299,0.001090294,0.000007719344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4063807,0.002262314,0.5647924,0.00361778,0.0006678279,0.0001954641,0.0004967668,0.004907414,0.01667931],"genre_scores_gemma":[0.6324877,0.0004414269,0.3607965,0.0002975767,0.0002520003,0.0002308543,0.0006558288,0.0003605977,0.004477523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005860194,"threshold_uncertainty_score":0.018399,"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","authors":[{"name":"Meikang Qiu","is_ca":false},{"name":"Lei Zhang","is_ca":false},{"name":"Zhong Ming","is_ca":false},{"name":"Zhi Chen","is_ca":false},{"name":"Xiao Qin","is_ca":false},{"name":"Laurence T. Yang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007300329,0.001083885,0.001334897,0.00094668,0.000600845,0.001040152,0.001279067,0.0008938403,0.005648986],"category_scores_gemma":[0.00249832,0.0004748982,0.0008408958,0.0008531083,0.0005284091,0.001687447,0.001008811,0.0009644015,0.0003335458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001093608,"about_ca_system_score_gemma":0.00176492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00892455,"about_ca_topic_score_gemma":0.009123244,"domain_scores_codex":[0.9995283,0.0001662902,0.00001433752,0.00007339574,0.00009939937,0.0001183911],"domain_scores_gemma":[0.999204,0.0004887792,0.00006790105,0.00005850144,0.0001151471,0.00006567998],"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.00006673535,0.00006198756,0.0003080108,0.00004291366,0.00003534091,0.00003037694,0.00002180195,0.9623145,0.0008017271,0.01460973,0.001735911,0.0199709],"study_design_scores_gemma":[0.000004727294,0.00001363653,0.0000620014,0.000002237345,0.00000753581,0.00000492318,0.000009215843,0.9925908,0.0001127565,0.007004859,0.0001849275,0.000002494775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04641764,0.0003742795,0.9444575,0.0005719705,0.00008484416,0.000103028,0.0002095638,0.0005123081,0.007268892],"genre_scores_gemma":[0.8705921,0.0002847165,0.123391,0.0001522406,0.00005127433,0.0001017124,0.0002125311,0.0002033381,0.005011112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00892455,"threshold_uncertainty_score":0.01889777,"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","authors":[{"name":"Claudio Gutiérrez","is_ca":false},{"name":"Carlos Hurtado","is_ca":false},{"name":"Alberto O. Mendelzon","is_ca":true},{"name":"Jorge Eduardo Pérez Pérez","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006015097,0.0007694598,0.001535688,0.005996839,0.002967773,0.01519565,0.00321062,0.003208419,0.006386463],"category_scores_gemma":[0.01283936,0.001773798,0.001692541,0.008864591,0.006931053,0.02333612,0.005941956,0.005621481,0.002045962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002997836,"about_ca_system_score_gemma":0.00355564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003519573,"about_ca_topic_score_gemma":0.002129303,"domain_scores_codex":[0.9934565,0.001811439,0.0009389424,0.001045239,0.002419495,0.0003283721],"domain_scores_gemma":[0.9905478,0.005021771,0.0004681129,0.002323085,0.001270276,0.0003688565],"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.00000784095,0.00001833097,0.00008459122,0.00006523867,0.00001373003,0.00003951978,0.0001312065,0.0006734177,0.00009018576,0.9862432,0.001442272,0.01119052],"study_design_scores_gemma":[0.000005865526,0.000003738923,0.00004662709,0.00005835622,0.00001157271,0.000055429,0.00005398984,0.003807741,0.000138808,0.975086,0.02072576,0.000006155525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009990916,0.02078734,0.8728555,0.01486874,0.001001637,0.000194601,0.0009239708,0.0008064817,0.07857075],"genre_scores_gemma":[0.3880582,0.03364091,0.5456569,0.004256942,0.004224052,0.0006459564,0.002945549,0.0003801711,0.02019122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01519565,"threshold_uncertainty_score":0.03181124,"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","authors":[{"name":"Waleed Bul’ajoul","is_ca":false},{"name":"Anne James","is_ca":false},{"name":"Mandeep Pannu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002365148,0.0008733627,0.0007826184,0.001777807,0.001109701,0.002302771,0.001782447,0.0006626813,0.002341924],"category_scores_gemma":[0.01093745,0.000430878,0.0003097157,0.001593348,0.0006618008,0.003059185,0.0009857754,0.0009178367,0.0006295738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001605342,"about_ca_system_score_gemma":0.002239427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00254199,"about_ca_topic_score_gemma":0.002333772,"domain_scores_codex":[0.9975611,0.0007093475,0.0002010529,0.0004415618,0.0007476732,0.0003393045],"domain_scores_gemma":[0.9919117,0.002240061,0.001245775,0.001647361,0.002485208,0.0004698517],"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.004646929,0.002284343,0.06577859,0.000171053,0.0002236916,0.0002471201,0.0002512505,0.1831666,0.1037615,0.006055792,0.0054626,0.6279505],"study_design_scores_gemma":[0.0003233418,0.001857379,0.01613344,0.00001997045,0.0001947913,0.0005140859,0.0001450159,0.9046007,0.06813151,0.005540674,0.002471977,0.00006720856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7296558,0.0008824579,0.2509691,0.00112102,0.000301053,0.000260774,0.0001089122,0.007827025,0.008873966],"genre_scores_gemma":[0.9821238,0.00005744476,0.0171566,0.00006525069,0.00005066167,0.00001811941,0.00004621718,0.00005212339,0.0004298151],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00254199,"threshold_uncertainty_score":0.01250821,"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","authors":[{"name":"Russell Impagliazzo","is_ca":false},{"name":"Bruce M. Kapron","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006162917,0.001837992,0.001886468,0.005790397,0.003989716,0.01351361,0.005987284,0.004047499,0.01322918],"category_scores_gemma":[0.01621867,0.002735378,0.005421754,0.006516492,0.00762947,0.03608801,0.006525206,0.009390314,0.001695747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008352524,"about_ca_system_score_gemma":0.002355974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007410127,"about_ca_topic_score_gemma":0.007177205,"domain_scores_codex":[0.9936644,0.002528375,0.0008942569,0.0008252509,0.001482045,0.0006057466],"domain_scores_gemma":[0.9879372,0.008143981,0.0007100282,0.001825168,0.0008350514,0.0005486249],"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.00006609745,0.0000365797,0.0002435982,0.0001875096,0.00005649314,0.00008877054,0.0003461269,0.00327632,0.0003080592,0.9794766,0.002221538,0.01369235],"study_design_scores_gemma":[0.00002971707,0.000007767894,0.00003771433,0.00003536371,0.00004447471,0.00003810852,0.0001339206,0.009903871,0.0003509654,0.9862708,0.003129954,0.00001739829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01685404,0.002612438,0.9519164,0.005465858,0.0003076294,0.0002435962,0.001205023,0.002058209,0.01933687],"genre_scores_gemma":[0.5172561,0.002210609,0.4648326,0.002209492,0.0008053522,0.0004810971,0.002706801,0.000466657,0.009031336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01351361,"threshold_uncertainty_score":0.06060207,"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","authors":[{"name":"Alexandru Mateescu","is_ca":false},{"name":"Arto Salomaa","is_ca":false},{"name":"Sheng Yü","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106982,0.000396223,0.0008948646,0.002065212,0.003216137,0.004067587,0.00115832,0.0011586,0.01670809],"category_scores_gemma":[0.009956483,0.0007115391,0.000703686,0.001872302,0.003092706,0.008507027,0.002329866,0.001965477,0.002360049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001246186,"about_ca_system_score_gemma":0.0009838477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001117303,"about_ca_topic_score_gemma":0.0009939129,"domain_scores_codex":[0.9989228,0.0003045669,0.00009259304,0.0002225033,0.0002536076,0.0002039011],"domain_scores_gemma":[0.9908246,0.005591472,0.0007286263,0.001417696,0.0006974928,0.0007401954],"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.00009767726,0.00002467935,0.0002773148,0.0000325541,0.000005731096,0.0001487811,0.0007009548,0.0007518822,0.001011927,0.9860706,0.0008832678,0.009994557],"study_design_scores_gemma":[0.000008921359,0.00001261578,0.00006918766,0.000005323662,0.000004943503,0.00008453266,0.0001155008,0.002798395,0.0005187202,0.9945045,0.001866854,0.00001050611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4875654,0.001184123,0.4159357,0.003789985,0.000622206,0.0001766758,0.0008795435,0.001916283,0.08793001],"genre_scores_gemma":[0.9486861,0.0003612371,0.02283113,0.0002379661,0.0003325677,0.0001153826,0.0002834591,0.0002309229,0.02692112],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01670809,"threshold_uncertainty_score":0.0558942,"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","authors":[{"name":"Chi Yang","is_ca":false},{"name":"Xuyun Zhang","is_ca":false},{"name":"Changmin Zhong","is_ca":false},{"name":"Chang Liu","is_ca":false},{"name":"Jian Pei","is_ca":true},{"name":"Kotagiri Ramamohanarao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001917312,0.0004997246,0.000548707,0.0008507319,0.0004939855,0.0007202798,0.0007230293,0.0003743607,0.002133086],"category_scores_gemma":[0.0006896937,0.0001944844,0.0004495511,0.001652453,0.0002026961,0.0009980376,0.0006520349,0.0004679992,0.000501451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003278027,"about_ca_system_score_gemma":0.0009499522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00488045,"about_ca_topic_score_gemma":0.005601645,"domain_scores_codex":[0.9997581,0.00002019315,0.00001723307,0.00003637496,0.0001355494,0.00003253678],"domain_scores_gemma":[0.9997295,0.00005533311,0.00002282134,0.00005590634,0.0001168418,0.00001978925],"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.0006334972,0.0003020471,0.002388657,0.0001999403,0.0001071997,0.00054887,0.000138248,0.1182172,0.1258879,0.01564044,0.01019402,0.7257419],"study_design_scores_gemma":[0.00001820529,0.00007948899,0.0009375471,0.000007902975,0.00003234147,0.0002482756,0.00006559252,0.9707603,0.0208572,0.003021044,0.003957554,0.00001457183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03608262,0.0009339166,0.958098,0.0003110074,0.0002372208,0.0001214286,0.0002927538,0.001021236,0.002901869],"genre_scores_gemma":[0.4043128,0.0015546,0.5867471,0.0002090596,0.0003231087,0.000137841,0.0009376614,0.0001111603,0.005666591],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00488045,"threshold_uncertainty_score":0.009704113,"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","authors":[{"name":"Guohui Lin","is_ca":true},{"name":"Zhi‐Zhong Chen","is_ca":false},{"name":"Tao Jiang","is_ca":false},{"name":"Jianjun Wen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005669688,0.00124763,0.003435393,0.004882407,0.002523867,0.003560473,0.003856137,0.004943825,0.003612189],"category_scores_gemma":[0.03395538,0.001740241,0.002577451,0.008214023,0.002005584,0.01022578,0.002632116,0.00285526,0.001332363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001484136,"about_ca_system_score_gemma":0.003864856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004835728,"about_ca_topic_score_gemma":0.003752284,"domain_scores_codex":[0.9943842,0.00108912,0.0009547461,0.001651167,0.001472765,0.0004480546],"domain_scores_gemma":[0.9653525,0.02501033,0.00323574,0.002970361,0.002654547,0.0007765287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003367868,0.001027392,0.01368111,0.00391298,0.0008480039,0.004732906,0.001749478,0.4097577,0.02606517,0.09996508,0.02395527,0.4109371],"study_design_scores_gemma":[0.0002303909,0.000236643,0.001772222,0.0001868258,0.0001781798,0.001395852,0.0007962982,0.669811,0.008699869,0.3095979,0.007007705,0.00008711445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1961623,0.003966931,0.7822583,0.002816836,0.0002790636,0.0003424654,0.008714657,0.003036358,0.002423111],"genre_scores_gemma":[0.3960565,0.002343548,0.5638454,0.0004139024,0.0006317776,0.0004300644,0.0307199,0.0009857839,0.004573142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005669688,"threshold_uncertainty_score":0.02998453,"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","authors":[{"name":"Maxime Crochemore","is_ca":false},{"name":"Lucian Ilie","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001490993,0.0006979164,0.001134304,0.002282154,0.002089146,0.003733068,0.001325564,0.002112132,0.01399227],"category_scores_gemma":[0.0146857,0.0008818934,0.001226652,0.002576852,0.002731332,0.005827148,0.003271057,0.002944849,0.003223296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001119247,"about_ca_system_score_gemma":0.0007156296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000372997,"about_ca_topic_score_gemma":0.0004524771,"domain_scores_codex":[0.9963683,0.001128154,0.0003692106,0.0007402039,0.0009704331,0.0004238016],"domain_scores_gemma":[0.9864941,0.009331665,0.0007577281,0.002196457,0.0007955748,0.0004245255],"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.0003231263,0.00006811096,0.0009976499,0.0001612953,0.00003355531,0.000401503,0.0006976484,0.0038845,0.004750263,0.9387391,0.005788275,0.04415493],"study_design_scores_gemma":[0.00002192548,0.00003874212,0.0003113505,0.00005667477,0.00002673894,0.000450549,0.00009287798,0.01241365,0.004263508,0.9748124,0.007490107,0.00002157951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.405698,0.003103467,0.387511,0.004829246,0.000796623,0.0001732172,0.001585046,0.002449728,0.1938536],"genre_scores_gemma":[0.8921758,0.000998623,0.06288162,0.0008910558,0.0007011912,0.0002107821,0.001494492,0.000839557,0.03980689],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01399227,"threshold_uncertainty_score":0.04680884,"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","authors":[{"name":"Jianjiang Wang","is_ca":false},{"name":"Xiaomin Zhu","is_ca":false},{"name":"Laurence T. Yang","is_ca":true},{"name":"Jianghan Zhu","is_ca":false},{"name":"Manhao Ma","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001263929,0.000848457,0.001037644,0.0005685193,0.0008068567,0.001216198,0.001527291,0.0005411988,0.001535856],"category_scores_gemma":[0.003582105,0.0005846137,0.0004740217,0.0008866751,0.0005145905,0.001199816,0.001259141,0.001374715,0.0004464531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007733543,"about_ca_system_score_gemma":0.00200773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006440409,"about_ca_topic_score_gemma":0.007520437,"domain_scores_codex":[0.9992011,0.0001918501,0.00004541192,0.000196348,0.0002047638,0.0001606071],"domain_scores_gemma":[0.9985996,0.0006096186,0.0001605516,0.0002027288,0.0003013267,0.0001262334],"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.0005528355,0.000129088,0.0007945449,0.0001336936,0.00007582219,0.0001219381,0.0002241429,0.8365504,0.02641725,0.01368282,0.003037883,0.1182797],"study_design_scores_gemma":[0.00002812261,0.00005102361,0.0001104146,0.00000469451,0.000009737506,0.00002256541,0.00002717472,0.9925724,0.001359499,0.004841306,0.0009669517,0.000005902841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03407867,0.0003931528,0.9629548,0.0002488228,0.0001489708,0.00004219779,0.00005043421,0.0003929414,0.001690135],"genre_scores_gemma":[0.6931427,0.0003471379,0.303589,0.0001662085,0.0001660503,0.00008577079,0.0002301549,0.0001366085,0.002136393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006440409,"threshold_uncertainty_score":0.01280582,"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","authors":[{"name":"Broňa Brejová","is_ca":true},{"name":"Daniel G. Brown","is_ca":true},{"name":"Tomáš Vinař","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001101469,0.0009107596,0.0008751975,0.001018251,0.0004981929,0.001043743,0.002205247,0.0008400941,0.01788923],"category_scores_gemma":[0.004577424,0.0006302693,0.00087242,0.001386222,0.0006107745,0.002167216,0.001808841,0.001075473,0.007964108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002997092,"about_ca_system_score_gemma":0.0005610783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007832003,"about_ca_topic_score_gemma":0.00139791,"domain_scores_codex":[0.9992563,0.0001116753,0.00006537089,0.0001354325,0.000377363,0.00005377325],"domain_scores_gemma":[0.9979973,0.0005580588,0.0001377461,0.0006806116,0.0004415396,0.0001846541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008713408,0.0004139344,0.001848335,0.0004724208,0.000101156,0.000577826,0.0002176774,0.02977718,0.05662037,0.1164086,0.0287465,0.7639447],"study_design_scores_gemma":[0.0005562949,0.0004848524,0.0010564,0.0001056326,0.0001352802,0.001759647,0.00006396344,0.6061757,0.05593363,0.1847349,0.148817,0.0001766008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003956232,0.00008133977,0.9844838,0.0000472029,0.0001224938,0.0001183913,0.0001800294,0.00817051,0.002839951],"genre_scores_gemma":[0.06325246,0.0001832683,0.9211206,0.00008812676,0.00007956367,0.0001703514,0.0006392227,0.003692861,0.01077353],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01788923,"threshold_uncertainty_score":0.05984545,"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","authors":[{"name":"Pranab Kumar Sen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006776536,0.003077059,0.005326301,0.005194723,0.003900328,0.008227144,0.01022955,0.005946042,0.02626658],"category_scores_gemma":[0.04561326,0.001810809,0.002885761,0.005782573,0.005003756,0.0160474,0.006973953,0.009122525,0.003337867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005798754,"about_ca_system_score_gemma":0.004898971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003481291,"about_ca_topic_score_gemma":0.005659304,"domain_scores_codex":[0.9958979,0.001284562,0.0001363207,0.0005270324,0.001061924,0.001092206],"domain_scores_gemma":[0.94327,0.04578346,0.001750304,0.004719265,0.002118344,0.002358551],"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.0005897181,0.0002862106,0.0007430368,0.0005416121,0.000100469,0.0001386747,0.0002557075,0.1545108,0.001675808,0.7991844,0.01737057,0.02460299],"study_design_scores_gemma":[0.00004632118,0.00005113146,0.0001408166,0.0000804882,0.00005993515,0.00008275634,0.00005480449,0.4471425,0.0006650705,0.5500683,0.001564303,0.00004353344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0997939,0.008720635,0.740916,0.009567958,0.0006640206,0.0002957113,0.001849213,0.002103498,0.1360891],"genre_scores_gemma":[0.7692504,0.007304149,0.1760605,0.002454527,0.001152455,0.0008464142,0.002816407,0.002162161,0.037953],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02626658,"threshold_uncertainty_score":0.08787042,"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","authors":[{"name":"Jochen Alber","is_ca":false},{"name":"Hongbing Fan","is_ca":true},{"name":"Michael R. Fellows","is_ca":false},{"name":"Henning Fernau","is_ca":false},{"name":"Rolf Niedermeier","is_ca":false},{"name":"Frances Rosamond","is_ca":false},{"name":"Ulrike Stege","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001577278,0.0007934795,0.001762103,0.002766069,0.0008088821,0.001233447,0.002838049,0.001166033,0.004535197],"category_scores_gemma":[0.007490596,0.0008685879,0.001918068,0.003563736,0.0008490365,0.003787245,0.002471195,0.002199086,0.001116428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009042701,"about_ca_system_score_gemma":0.001129983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002546777,"about_ca_topic_score_gemma":0.004051043,"domain_scores_codex":[0.9985253,0.0003797143,0.0001008495,0.0002561859,0.0006010861,0.0001368792],"domain_scores_gemma":[0.9965093,0.001778695,0.0001527722,0.0009012489,0.0005447516,0.0001131865],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007451332,0.0003863772,0.00157398,0.001229277,0.0002987806,0.0003103563,0.0009449994,0.2135952,0.06543542,0.1822477,0.01464757,0.5185853],"study_design_scores_gemma":[0.000146146,0.0003180331,0.0008233048,0.00008986198,0.0002238962,0.0003965127,0.0001417497,0.8648952,0.01273104,0.1060073,0.01416667,0.0000602154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01713439,0.0005546559,0.9787375,0.0001971446,0.00006911402,0.0001739707,0.000238484,0.0005711879,0.002323674],"genre_scores_gemma":[0.1090377,0.0005955882,0.8844939,0.0001587,0.00009680997,0.000197508,0.0007435434,0.0002992372,0.004376913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004535197,"threshold_uncertainty_score":0.01517177,"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","authors":[{"name":"Birgit Jenner","is_ca":false},{"name":"Johannes Köbler","is_ca":false},{"name":"Pierre McKenzie","is_ca":true},{"name":"Jacobo Torán","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005856978,0.00170898,0.003404589,0.004954451,0.007931065,0.008246262,0.004609533,0.004211517,0.01832318],"category_scores_gemma":[0.02216072,0.003276238,0.006268322,0.006281532,0.009616517,0.04374237,0.009717498,0.01580021,0.002767075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002147946,"about_ca_system_score_gemma":0.003147337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003158746,"about_ca_topic_score_gemma":0.003113522,"domain_scores_codex":[0.9937413,0.001729977,0.0004991689,0.00179951,0.001450438,0.0007795022],"domain_scores_gemma":[0.9524364,0.03285274,0.001092056,0.006973485,0.004747678,0.001897649],"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.0001392236,0.0001600485,0.0007373889,0.0002691941,0.00009049124,0.0001226445,0.001161751,0.001808417,0.0007591718,0.976004,0.006977018,0.01177054],"study_design_scores_gemma":[0.00002234416,0.00001106556,0.0001470396,0.00001286552,0.00004064583,0.00006761689,0.0001074273,0.002197075,0.0005125512,0.9946695,0.002195816,0.00001617949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1419553,0.002813536,0.6797259,0.01786002,0.0008702619,0.0005215972,0.00462721,0.002730296,0.1488959],"genre_scores_gemma":[0.7805052,0.003519563,0.1595937,0.004484997,0.002039745,0.0009844473,0.009099137,0.001805075,0.03796816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01832318,"threshold_uncertainty_score":0.06129718,"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","authors":[{"name":"Dimitris Achlioptas","is_ca":false},{"name":"Paul Beame","is_ca":false},{"name":"Michael Molloy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02625149,0.00490571,0.006115537,0.007220441,0.003231021,0.01461067,0.01040583,0.00904359,0.01858016],"category_scores_gemma":[0.2205057,0.005166959,0.006070323,0.007180035,0.0106113,0.04105743,0.01352857,0.03105208,0.005245871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009107842,"about_ca_system_score_gemma":0.007143813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002024217,"about_ca_topic_score_gemma":0.002760963,"domain_scores_codex":[0.964872,0.009988924,0.001730768,0.005672005,0.01157643,0.006159866],"domain_scores_gemma":[0.6076341,0.3440857,0.005884812,0.02936894,0.007326073,0.005700343],"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.002093798,0.0007890539,0.003727982,0.001905525,0.0003469287,0.0003614933,0.0009550284,0.09868736,0.0150813,0.6882346,0.02612913,0.1616879],"study_design_scores_gemma":[0.0001100511,0.00022928,0.0006906259,0.0003653189,0.0002010628,0.000332812,0.0001183452,0.3218755,0.008001424,0.6624849,0.005488024,0.0001026822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02656274,0.01002049,0.9141059,0.01232988,0.000700959,0.0002842174,0.000731241,0.003295328,0.03196933],"genre_scores_gemma":[0.5587479,0.008991348,0.3966438,0.00629099,0.0030227,0.001146468,0.001357428,0.004838461,0.01896101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02625149,"threshold_uncertainty_score":0.1388327,"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","authors":[{"name":"Marcelo Luiz Brocardo","is_ca":true},{"name":"Issa Traoré","is_ca":true},{"name":"Isaac Woungang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004767463,0.0005042456,0.0009009118,0.002197944,0.001101878,0.002029434,0.0008013888,0.001437916,0.002725327],"category_scores_gemma":[0.03081246,0.0002219122,0.0004024087,0.001355648,0.0005612005,0.002321547,0.001511363,0.001043639,0.002001038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005612471,"about_ca_system_score_gemma":0.001303172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000605089,"about_ca_topic_score_gemma":0.0005849405,"domain_scores_codex":[0.9936911,0.002276492,0.0006293337,0.0008724642,0.001852822,0.0006777945],"domain_scores_gemma":[0.9591695,0.01981974,0.004948449,0.007420041,0.00752463,0.001117607],"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.006215017,0.001107153,0.07369824,0.0007344205,0.0002963533,0.001288553,0.001425277,0.03399746,0.1013377,0.01895233,0.006762632,0.7541848],"study_design_scores_gemma":[0.0001063418,0.0007803144,0.02509939,0.0000991594,0.0001245555,0.0009985809,0.0007300801,0.8666978,0.08878075,0.01244889,0.004031383,0.0001027549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6457821,0.0007510817,0.3432447,0.0006555188,0.0007066503,0.0004463355,0.001058802,0.002334178,0.005020681],"genre_scores_gemma":[0.9702556,0.0000776673,0.02785976,0.00002390733,0.00007869899,0.00003829495,0.0002642541,0.00001748904,0.001384342],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004767463,"threshold_uncertainty_score":0.02521306,"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","authors":[{"name":"Lihong Zheng","is_ca":false},{"name":"Xiangjian He","is_ca":false},{"name":"Bijan Samali","is_ca":false},{"name":"Laurence T. Yang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005558115,0.0009783906,0.0008766907,0.001566514,0.0007236966,0.0009609404,0.001292211,0.0008263643,0.003398983],"category_scores_gemma":[0.001158642,0.0003953665,0.0005897285,0.001143618,0.0003707237,0.0009507915,0.0006677407,0.000888979,0.002159191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004980941,"about_ca_system_score_gemma":0.0009699992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003349195,"about_ca_topic_score_gemma":0.003210105,"domain_scores_codex":[0.9992311,0.00006506051,0.00005786779,0.0001441362,0.0004243523,0.00007750098],"domain_scores_gemma":[0.9990656,0.0001462443,0.00005005033,0.0001029624,0.0006070466,0.0000282126],"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.0002877378,0.00008070687,0.0008314757,0.0001154543,0.00004661188,0.0001097399,0.0000593378,0.01024738,0.1086293,0.002426914,0.003784808,0.8733805],"study_design_scores_gemma":[0.00005447787,0.000309774,0.005106037,0.00003809473,0.000178066,0.001058018,0.00005951553,0.6426603,0.3262083,0.001800845,0.02246375,0.00006291826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01934165,0.0006870709,0.9743165,0.0001036175,0.0002445295,0.0001050553,0.00008422972,0.002840451,0.002276831],"genre_scores_gemma":[0.1399819,0.0007099656,0.8485706,0.000118839,0.0001805931,0.0001317415,0.000436851,0.000199368,0.009670123],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003398983,"threshold_uncertainty_score":0.01137072,"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","authors":[{"name":"Erik D. Demaine","is_ca":false},{"name":"Mohammad Taghi Hajiaghayi","is_ca":false},{"name":"Naomi Nishimura","is_ca":true},{"name":"Prabhakar Ragde","is_ca":true},{"name":"Dimitrios M. Thilikos","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002639805,0.00250743,0.003097021,0.002737481,0.00272022,0.006190877,0.007063049,0.003346749,0.01179835],"category_scores_gemma":[0.01735193,0.001747348,0.003046453,0.004355425,0.001599981,0.009927894,0.003356846,0.004235793,0.00196039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004396734,"about_ca_system_score_gemma":0.0033475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004986884,"about_ca_topic_score_gemma":0.009249376,"domain_scores_codex":[0.9974739,0.0005654928,0.0001403637,0.0007568458,0.0004897013,0.0005737766],"domain_scores_gemma":[0.9835835,0.009953802,0.001196505,0.003365915,0.0009440671,0.0009561446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005798506,0.002934107,0.0122995,0.001460057,0.0005174755,0.0003383356,0.001585397,0.2918164,0.009254125,0.179123,0.05673875,0.4381344],"study_design_scores_gemma":[0.000600214,0.0002496837,0.001486783,0.00008688572,0.0002847808,0.0005170754,0.0003856359,0.7286946,0.003531831,0.2576859,0.006432117,0.000044475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.360985,0.002433259,0.60413,0.004247173,0.0003729905,0.0006030849,0.00266571,0.005011299,0.0195514],"genre_scores_gemma":[0.6311157,0.001291734,0.3464901,0.0009326407,0.0005089103,0.0004663499,0.007504696,0.00143411,0.01025577],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01179835,"threshold_uncertainty_score":0.03946942,"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","authors":[{"name":"Pierre Fraigniaud","is_ca":false},{"name":"David Ilcinkas","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002224248,0.001200852,0.00150619,0.001558044,0.002315785,0.002747957,0.002161748,0.002666919,0.02660314],"category_scores_gemma":[0.02517992,0.0006952368,0.00100443,0.001669275,0.001858329,0.003865824,0.003153367,0.003949926,0.007722837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001387778,"about_ca_system_score_gemma":0.002485543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002723945,"about_ca_topic_score_gemma":0.003085434,"domain_scores_codex":[0.9967018,0.001109332,0.0001784842,0.0005380528,0.0009760018,0.0004964557],"domain_scores_gemma":[0.987039,0.00710016,0.00029961,0.003756566,0.001424658,0.0003799262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001027692,0.0003745724,0.001387192,0.0003230365,0.0001020081,0.0001629142,0.0004694334,0.04238336,0.002557349,0.4148651,0.09020157,0.4461457],"study_design_scores_gemma":[0.0002630863,0.0001050295,0.0002341663,0.00007887794,0.00007828778,0.0001597585,0.00007015984,0.327407,0.004368643,0.638171,0.02903296,0.00003105703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0299452,0.001176545,0.8566803,0.005367769,0.001313817,0.0002626919,0.0004752329,0.01036657,0.09441203],"genre_scores_gemma":[0.4951814,0.0006647978,0.404964,0.001853478,0.001110663,0.0005745998,0.0008625502,0.002024523,0.09276386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02660314,"threshold_uncertainty_score":0.08899635,"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","authors":[{"name":"Chris Calabro","is_ca":false},{"name":"Russell Impagliazzo","is_ca":false},{"name":"Valentine Kabanets","is_ca":true},{"name":"Ramamohan Paturi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004207079,0.001496625,0.003118161,0.001639679,0.003587245,0.008751538,0.007419641,0.002914011,0.01841643],"category_scores_gemma":[0.04005218,0.001677269,0.003500044,0.0035713,0.005114533,0.029907,0.01006823,0.01171971,0.001984605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004408424,"about_ca_system_score_gemma":0.004794464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003690131,"about_ca_topic_score_gemma":0.004831947,"domain_scores_codex":[0.9909814,0.001696042,0.0006422483,0.002037056,0.002461978,0.002181147],"domain_scores_gemma":[0.9229794,0.06362764,0.002276077,0.007175389,0.002229475,0.001712031],"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.003362873,0.000632862,0.00791471,0.002658716,0.0004063996,0.001005945,0.002039581,0.1419034,0.01174019,0.6862237,0.03580774,0.1063039],"study_design_scores_gemma":[0.0001512123,0.00008938006,0.0010669,0.00009209126,0.0001772526,0.000518275,0.0003225441,0.1911954,0.00532493,0.7963682,0.004615706,0.00007819859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2887507,0.003711066,0.6135734,0.017175,0.0007727354,0.0005250361,0.004235535,0.002990945,0.06826563],"genre_scores_gemma":[0.9192491,0.001166968,0.0655867,0.001524709,0.0006502277,0.0004233552,0.002008772,0.0009147277,0.008475281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01841643,"threshold_uncertainty_score":0.06160909,"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","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true},{"name":"Martin Dyer","is_ca":false},{"name":"Leslie Ann Goldberg","is_ca":false},{"name":"Markus Jalsenius","is_ca":false},{"name":"Mark Jerrum","is_ca":false},{"name":"David Richerby","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004194365,0.0009247379,0.001745226,0.001540334,0.00161791,0.007056822,0.004108109,0.002321766,0.008514096],"category_scores_gemma":[0.03298208,0.001123639,0.001883535,0.003636643,0.002977096,0.01807969,0.003403884,0.003817391,0.0005945278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004709738,"about_ca_system_score_gemma":0.004556592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006769453,"about_ca_topic_score_gemma":0.00622119,"domain_scores_codex":[0.9937644,0.001965389,0.0004320259,0.0007979046,0.002147296,0.0008929394],"domain_scores_gemma":[0.9482411,0.04169932,0.002848678,0.00349024,0.002218897,0.001501815],"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.0009709281,0.0002499864,0.00251953,0.0004232236,0.0001542904,0.0002422628,0.0004581603,0.228352,0.00279436,0.712672,0.008944297,0.04221902],"study_design_scores_gemma":[0.00007170622,0.00003835592,0.0004956126,0.00001921094,0.00004247213,0.0001341183,0.00008913334,0.3260218,0.0008016843,0.6709672,0.001288514,0.00003013118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5649976,0.00153885,0.38788,0.008839805,0.0002699947,0.0002592401,0.00319002,0.001054153,0.03197036],"genre_scores_gemma":[0.9111536,0.0007511947,0.07783191,0.0004285122,0.000336253,0.0002081919,0.001508485,0.0003633435,0.007418356],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008514096,"threshold_uncertainty_score":0.0341717,"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","authors":[{"name":"Albert Atserias","is_ca":false},{"name":"Nicola Galesi","is_ca":true},{"name":"Pavel Pudlák","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005580738,0.0007835761,0.001123553,0.001333903,0.002370088,0.004849653,0.002406588,0.002186493,0.01620396],"category_scores_gemma":[0.04835328,0.001352743,0.001639885,0.0008834873,0.0040425,0.01102936,0.004767098,0.003347148,0.001575088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002058123,"about_ca_system_score_gemma":0.002196634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007394493,"about_ca_topic_score_gemma":0.001085268,"domain_scores_codex":[0.9916831,0.004807052,0.0004954588,0.0009241809,0.001433071,0.0006571645],"domain_scores_gemma":[0.9135191,0.06908646,0.002569457,0.008093894,0.004272239,0.00245882],"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.0004228598,0.0001164845,0.001461073,0.0001281871,0.00005792726,0.0002545202,0.0005968892,0.01274221,0.002447563,0.9723055,0.001041347,0.008425402],"study_design_scores_gemma":[0.00007386965,0.00004144866,0.0001502624,0.00002604231,0.00002753054,0.0001283797,0.0001251888,0.05796548,0.002772319,0.9363344,0.002338141,0.00001691779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2805445,0.000552213,0.6686799,0.002702575,0.0002401122,0.0003421625,0.0006451036,0.002268835,0.04402454],"genre_scores_gemma":[0.9319841,0.0001617445,0.0595188,0.0003026507,0.0000990306,0.00021397,0.0003767551,0.0002658451,0.007077142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01620396,"threshold_uncertainty_score":0.05420768,"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","authors":[{"name":"Tyler J. Gunn","is_ca":true},{"name":"John Anderson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003573125,0.000354409,0.0006151185,0.000374821,0.0005762623,0.0004745504,0.0008304834,0.0004649697,0.001141203],"category_scores_gemma":[0.0008188304,0.0002758027,0.0003398099,0.0002924711,0.0004977545,0.0007153528,0.001752801,0.0005623167,0.0001720599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000408069,"about_ca_system_score_gemma":0.0004514376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001945978,"about_ca_topic_score_gemma":0.001984379,"domain_scores_codex":[0.9998367,0.00004591567,0.000005688283,0.00003709333,0.00003816451,0.00003641392],"domain_scores_gemma":[0.9997436,0.00008406023,0.00005044945,0.000035193,0.00003863293,0.00004807689],"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.00008452476,0.00005384651,0.0005503336,0.00002097658,0.00003762966,0.00007341551,0.00006190731,0.9605335,0.004542544,0.007898699,0.0008023823,0.02534028],"study_design_scores_gemma":[0.000006353566,0.00002555011,0.0001139149,0.000001205544,0.000003533059,0.000008854725,0.00001990771,0.9967042,0.0002579715,0.002661828,0.0001945389,0.000002291052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1371801,0.0001847273,0.8575196,0.0001777345,0.00007241271,0.00004388695,0.00003640379,0.0001440066,0.004641189],"genre_scores_gemma":[0.9707487,0.00005860951,0.02705815,0.00002635585,0.00001645271,0.00004356237,0.00004318431,0.00001844193,0.00198666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001945978,"threshold_uncertainty_score":0.003869295,"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","authors":[{"name":"Solmaz Kolahi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007141,0.0006804311,0.001184103,0.002990279,0.001493602,0.003978079,0.002387656,0.0008087095,0.00593703],"category_scores_gemma":[0.02527484,0.00122002,0.001837694,0.005453716,0.001917613,0.007366195,0.003371988,0.002440989,0.003204097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001699916,"about_ca_system_score_gemma":0.003905149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004530326,"about_ca_topic_score_gemma":0.005452336,"domain_scores_codex":[0.990531,0.002043263,0.001164448,0.001558002,0.004160445,0.000542885],"domain_scores_gemma":[0.9745746,0.006723396,0.001518771,0.01169248,0.005151491,0.0003393168],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006406445,0.0002299715,0.005472884,0.0006976282,0.000251881,0.0007402862,0.001448564,0.02254817,0.0240075,0.4157905,0.04798186,0.48019],"study_design_scores_gemma":[0.00009259085,0.0001127573,0.004859464,0.0002391499,0.0004180523,0.001153223,0.0005579866,0.1579217,0.1540169,0.4796424,0.2008024,0.0001834471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02052053,0.0008829713,0.9537324,0.001143844,0.0005413071,0.0001651989,0.002656073,0.01105942,0.009298194],"genre_scores_gemma":[0.2393755,0.001761132,0.7151228,0.001195616,0.0007372643,0.0004354159,0.01044173,0.007620817,0.02330974],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007141,"threshold_uncertainty_score":0.03776562,"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","authors":[{"name":"Giovanni Pighizzini","is_ca":false},{"name":"Jeffrey Shallit","is_ca":true},{"name":"Ming‐Wei Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007934341,0.001778916,0.00336409,0.003515052,0.003519444,0.01246558,0.006958166,0.004235059,0.0121379],"category_scores_gemma":[0.04581119,0.002601174,0.004526863,0.005916376,0.009797204,0.04334599,0.009693744,0.01733649,0.001318957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006615324,"about_ca_system_score_gemma":0.002968625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002394345,"about_ca_topic_score_gemma":0.002388054,"domain_scores_codex":[0.9893154,0.003687804,0.0006844638,0.002008873,0.002666843,0.001636505],"domain_scores_gemma":[0.8525334,0.1289188,0.003203516,0.01043204,0.002555159,0.002357142],"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.0002622098,0.0001830982,0.001170341,0.0002087735,0.00006136052,0.0001317212,0.0009320583,0.02197797,0.001205892,0.9566696,0.002650853,0.01454615],"study_design_scores_gemma":[0.00001502097,0.00001659681,0.000170664,0.00001827663,0.00002985076,0.00005020671,0.00007688673,0.04241803,0.0005912254,0.9559954,0.0005927687,0.00002503052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2409594,0.005620955,0.697873,0.01470287,0.0003083432,0.0001546104,0.001470811,0.001069409,0.03784065],"genre_scores_gemma":[0.9055136,0.002702506,0.07486797,0.001044102,0.0008073059,0.000514364,0.0015238,0.0007700774,0.01225625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01246558,"threshold_uncertainty_score":0.04799777,"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","authors":[{"name":"Misha Alekhnovich","is_ca":false},{"name":"Mark Braverman","is_ca":true},{"name":"Vitaly Feldman","is_ca":false},{"name":"Adam R. Klivans","is_ca":false},{"name":"Toniann Pitassi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004536422,0.0007687748,0.00158653,0.001066251,0.001203175,0.005136135,0.002716768,0.002661383,0.00934736],"category_scores_gemma":[0.07747123,0.001143496,0.001870044,0.001627962,0.003539051,0.01863404,0.005248447,0.004947049,0.0008693314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002144527,"about_ca_system_score_gemma":0.001708525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002037497,"about_ca_topic_score_gemma":0.001761574,"domain_scores_codex":[0.9931933,0.00204276,0.0007192122,0.001342148,0.002361706,0.0003408091],"domain_scores_gemma":[0.8848349,0.1044552,0.002469108,0.004995266,0.002098408,0.001147092],"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.001595324,0.0003946113,0.01139778,0.001069743,0.000333266,0.0005401424,0.001703482,0.1492553,0.004611459,0.601922,0.01231288,0.2148641],"study_design_scores_gemma":[0.0000716391,0.00005213506,0.001024836,0.00002539447,0.00003675923,0.0001512263,0.0001280633,0.2180394,0.0008066185,0.7784336,0.001204376,0.00002586357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3685029,0.001702939,0.6009161,0.01100161,0.0002264773,0.0002234414,0.001670412,0.0007656938,0.01499045],"genre_scores_gemma":[0.8741518,0.0009502944,0.1159365,0.0007196647,0.0004532957,0.0003353328,0.002020582,0.000210971,0.005221565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00934736,"threshold_uncertainty_score":0.03127003,"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","authors":[{"name":"Bin Ma","is_ca":true},{"name":"Kaizhong Zhang","is_ca":true},{"name":"Chengzhi Liang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001833412,0.00139974,0.001055778,0.001503596,0.00120721,0.001827418,0.001965859,0.001477907,0.003307166],"category_scores_gemma":[0.005096877,0.0007831745,0.0007579766,0.001626078,0.0006035825,0.001945104,0.002231508,0.002053363,0.003153174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005750185,"about_ca_system_score_gemma":0.001739508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0013492,"about_ca_topic_score_gemma":0.002557702,"domain_scores_codex":[0.9988635,0.0002181545,0.0001203814,0.0002919144,0.0004302493,0.00007585758],"domain_scores_gemma":[0.9980782,0.0007399205,0.0001103476,0.0003502297,0.000645484,0.00007587969],"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.0003280676,0.0001074942,0.000509111,0.0001545845,0.00007008884,0.0001251145,0.0000874889,0.02636868,0.03446542,0.008508802,0.004705437,0.9245696],"study_design_scores_gemma":[0.0001043336,0.00008911919,0.0006280324,0.0000257352,0.00005611106,0.0004609379,0.00003921568,0.9213037,0.03695606,0.02918149,0.01110815,0.00004709832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001744674,0.00006537726,0.9964347,0.00004023533,0.0000241671,0.00003668633,0.0000410192,0.001457013,0.0001561539],"genre_scores_gemma":[0.01153657,0.00005985225,0.9873015,0.00004081787,0.00001898116,0.00007615454,0.0001847456,0.0001715231,0.000609822],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003307166,"threshold_uncertainty_score":0.01106358,"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","authors":[{"name":"Carlos Cotta","is_ca":false},{"name":"Pablo Moscato","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002138847,0.001700486,0.00433057,0.001520737,0.001350399,0.003972821,0.003372856,0.004479677,0.01270704],"category_scores_gemma":[0.01129175,0.001254602,0.002515754,0.003039471,0.001399191,0.006743565,0.002496626,0.003931981,0.002646503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001280274,"about_ca_system_score_gemma":0.002335995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002912152,"about_ca_topic_score_gemma":0.003141977,"domain_scores_codex":[0.9975467,0.0004957842,0.0002243538,0.0009914737,0.0004442684,0.0002973447],"domain_scores_gemma":[0.9922368,0.005452913,0.0005411116,0.0009900499,0.0005700794,0.0002089562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00107217,0.0008310355,0.002440124,0.002478352,0.0004867582,0.0006037943,0.0002238942,0.1405376,0.005163421,0.03272938,0.1308174,0.6826161],"study_design_scores_gemma":[0.000432821,0.0004157479,0.002521894,0.0001366402,0.0001257979,0.0006787006,0.0002393577,0.6252618,0.003528315,0.3535391,0.01303336,0.00008637642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07452733,0.002336465,0.8818757,0.01197545,0.0005897114,0.0004640937,0.01419588,0.003700224,0.01033512],"genre_scores_gemma":[0.4742593,0.001431416,0.4740789,0.002409647,0.001085382,0.001316286,0.02533333,0.0009666214,0.01911908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01270704,"threshold_uncertainty_score":0.04250926,"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","authors":[{"name":"Nadia El-Mabrouk","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000892984,0.0004123398,0.0007244591,0.001565448,0.0006837949,0.0009965309,0.00117725,0.001029637,0.002509773],"category_scores_gemma":[0.004429015,0.0008407796,0.001133261,0.001221685,0.0006540783,0.001025621,0.0007107517,0.001264417,0.0005097885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005468318,"about_ca_system_score_gemma":0.00068052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001570665,"about_ca_topic_score_gemma":0.002228823,"domain_scores_codex":[0.999783,0.00005748178,0.00001626004,0.00007948244,0.00003691411,0.00002687391],"domain_scores_gemma":[0.9988564,0.0007053713,0.00008939969,0.000196091,0.00009734741,0.00005534757],"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.001619733,0.0001908521,0.02633925,0.0003753182,0.0002619993,0.00107062,0.0008475505,0.5318074,0.07729416,0.05196447,0.001614602,0.306614],"study_design_scores_gemma":[0.0001104917,0.0001481012,0.003143891,0.0000273812,0.0001192441,0.0004358867,0.0002283407,0.945695,0.01410341,0.03377555,0.002174866,0.00003779359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5904153,0.0002102126,0.4057472,0.0003176227,0.0000516133,0.00005944582,0.0003744669,0.001248911,0.001575266],"genre_scores_gemma":[0.7188681,0.0001953296,0.278377,0.00006291785,0.0000295665,0.00004758029,0.0008896856,0.0003098946,0.001219932],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002509773,"threshold_uncertainty_score":0.008396029,"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","authors":[{"name":"MohammadTaghi Hajiaghayi","is_ca":false},{"name":"Naomi Nishimura","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001335811,0.0004564684,0.001181131,0.001694127,0.001614921,0.002414922,0.002212061,0.001585045,0.005310069],"category_scores_gemma":[0.01574091,0.0006529253,0.0005592134,0.003435941,0.003285151,0.009846379,0.002440482,0.002344968,0.0003532892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001857047,"about_ca_system_score_gemma":0.001080532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00248501,"about_ca_topic_score_gemma":0.00246138,"domain_scores_codex":[0.9988437,0.0003120771,0.00004819821,0.000280448,0.0002514121,0.0002642121],"domain_scores_gemma":[0.9771149,0.01407658,0.003409563,0.002917389,0.0009419282,0.001539545],"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.0006897144,0.0002775218,0.01234823,0.0002374676,0.00007862953,0.0008025469,0.001444742,0.06647235,0.00591846,0.8732298,0.005127444,0.03337298],"study_design_scores_gemma":[0.00004993596,0.00004196372,0.001764941,0.00001679093,0.00002517774,0.0005754491,0.0003617423,0.04176764,0.0009247343,0.9532379,0.001214246,0.00001952058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8342232,0.001212479,0.1483294,0.002896582,0.00005921538,0.00004701961,0.0006002478,0.000657881,0.01197405],"genre_scores_gemma":[0.9866835,0.0003095042,0.01006356,0.0001970684,0.00006576627,0.00004679905,0.0004021387,0.00008537599,0.002146215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005310069,"threshold_uncertainty_score":0.01776391,"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","authors":[{"name":"Bin Ma","is_ca":true},{"name":"Ming Li","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00160129,0.0004467321,0.001439979,0.001614134,0.001514977,0.003907469,0.002320688,0.002371729,0.008303841],"category_scores_gemma":[0.02513923,0.0008713101,0.0009627963,0.001459703,0.004254628,0.00758091,0.001996601,0.002545807,0.0006762497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00105464,"about_ca_system_score_gemma":0.0006451046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001058735,"about_ca_topic_score_gemma":0.000993265,"domain_scores_codex":[0.999169,0.0002577572,0.00004701482,0.0001886691,0.0002301767,0.0001073867],"domain_scores_gemma":[0.9731469,0.02170966,0.001583707,0.001720621,0.0008636242,0.0009753697],"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.00005856727,0.00002530538,0.001400725,0.00006823454,0.00001983762,0.0002147588,0.0002209454,0.03705821,0.001444118,0.9495645,0.001284667,0.008640235],"study_design_scores_gemma":[0.00001667368,0.00001211701,0.000721626,0.00001005051,0.00001029266,0.0002084907,0.00004476549,0.07981915,0.0001824386,0.9182185,0.0007399276,0.00001601301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5914773,0.0038713,0.3298449,0.007075367,0.0002743361,0.00007021915,0.0005061298,0.00054492,0.06633558],"genre_scores_gemma":[0.9723096,0.0007556771,0.02267772,0.0001724695,0.0002356495,0.00003709213,0.000190506,0.0001402047,0.003481056],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008303841,"threshold_uncertainty_score":0.02777916,"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","authors":[{"name":"Elhadi Shakshuki","is_ca":true},{"name":"Hsiang-Hwa Koo","is_ca":true},{"name":"Darcy Benoit","is_ca":true},{"name":"Daniel Silver","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002794184,0.000704587,0.001690171,0.001139362,0.002257537,0.002383974,0.003826014,0.001128659,0.01102715],"category_scores_gemma":[0.005038852,0.0007064887,0.0005656556,0.001342305,0.0004925505,0.001456794,0.002171118,0.001244133,0.00362553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001448688,"about_ca_system_score_gemma":0.00501673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005102391,"about_ca_topic_score_gemma":0.005935276,"domain_scores_codex":[0.9989356,0.000268639,0.0000993827,0.0002072108,0.0003604114,0.0001286213],"domain_scores_gemma":[0.9976768,0.0005930137,0.0001175378,0.0003492923,0.000632424,0.0006308903],"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.006185969,0.002136952,0.005560652,0.0005343977,0.0004909399,0.000653687,0.0007363865,0.2004539,0.06855308,0.05942203,0.05761557,0.5976564],"study_design_scores_gemma":[0.001115718,0.0003000922,0.0005340842,0.000013658,0.0001327398,0.000174305,0.00009280399,0.9499356,0.0083462,0.01128336,0.02800324,0.00006835514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03882985,0.0005727233,0.9325026,0.0007161585,0.0008015284,0.0006798799,0.0004126859,0.01572921,0.009755426],"genre_scores_gemma":[0.4468134,0.0003400235,0.5338967,0.0002731576,0.0003695757,0.0006235862,0.000749952,0.0005843111,0.0163493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01102715,"threshold_uncertainty_score":0.03688949,"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","authors":[{"name":"Maya Rupert","is_ca":true},{"name":"Amjad Rattrout","is_ca":false},{"name":"Salima Hassas","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000817687,0.0004334243,0.0007311804,0.00187286,0.0006846237,0.004758834,0.0009073305,0.001707788,0.006271225],"category_scores_gemma":[0.004239302,0.0004182208,0.0004317442,0.001539127,0.00223346,0.008280322,0.001327145,0.002164476,0.0007287977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008703255,"about_ca_system_score_gemma":0.0005569219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001631014,"about_ca_topic_score_gemma":0.001318228,"domain_scores_codex":[0.9993648,0.0002392176,0.00002969193,0.0001311507,0.000195759,0.00003950153],"domain_scores_gemma":[0.9968827,0.001928788,0.0001894495,0.000395908,0.0003887328,0.0002145229],"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.00001410863,0.00002401438,0.0005461019,0.00007818177,0.00003128668,0.00009473095,0.0001210838,0.01530872,0.0006948087,0.9624874,0.002098966,0.01850053],"study_design_scores_gemma":[0.000004644017,0.000008780424,0.0003585415,0.00002683427,0.00001085109,0.00005655004,0.00008121498,0.0703297,0.000171687,0.9194794,0.009464084,0.000007759567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03515254,0.01024646,0.8582687,0.02046374,0.000683832,0.00004370558,0.0003622524,0.0003607716,0.07441786],"genre_scores_gemma":[0.8484827,0.0106245,0.114719,0.001302975,0.001944433,0.0001308947,0.0002599622,0.00015997,0.02237555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006271225,"threshold_uncertainty_score":0.02097929,"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","authors":[{"name":"Gregory Gutin","is_ca":false},{"name":"Ton Kloks","is_ca":true},{"name":"Chuan-Min Lee","is_ca":false},{"name":"Anders Yeo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003243047,0.0004557484,0.0009201316,0.002547188,0.001335997,0.003134635,0.001031062,0.001158513,0.007385494],"category_scores_gemma":[0.003586204,0.0006754565,0.000667022,0.001829533,0.001342003,0.003976062,0.001776868,0.001543542,0.00106219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001277183,"about_ca_system_score_gemma":0.0005353155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002329632,"about_ca_topic_score_gemma":0.002495087,"domain_scores_codex":[0.9995816,0.00006705012,0.00003024464,0.0001035648,0.00009715719,0.0001203671],"domain_scores_gemma":[0.997052,0.00127697,0.0005117678,0.0002105214,0.0003106611,0.0006380368],"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.0001185218,0.00009679191,0.001262272,0.0001489509,0.00002363236,0.0003393197,0.0006720882,0.007246508,0.002133347,0.96741,0.003155365,0.01739342],"study_design_scores_gemma":[0.00003748239,0.00003105083,0.0007831658,0.00002464035,0.00003116002,0.0003617004,0.0003431583,0.03161226,0.0009290719,0.9624391,0.003384666,0.00002237519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7882263,0.0006168362,0.16755,0.001024651,0.0001296142,0.0001271187,0.0006825824,0.0009638718,0.04067909],"genre_scores_gemma":[0.9628567,0.0005299865,0.01695989,0.0001453342,0.00006836497,0.00005507327,0.0003682856,0.0001473608,0.01886894],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007385494,"threshold_uncertainty_score":0.02470696,"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","authors":[{"name":"Zhi‐Zhong Chen","is_ca":false},{"name":"Bin Ma","is_ca":true},{"name":"Lusheng Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002550507,0.0008393172,0.002119672,0.002980708,0.001794151,0.003447952,0.005262809,0.005250611,0.01470458],"category_scores_gemma":[0.01597133,0.0006544549,0.001810079,0.005210258,0.002679022,0.00760388,0.0046937,0.004944895,0.00338142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001190047,"about_ca_system_score_gemma":0.001521859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001686263,"about_ca_topic_score_gemma":0.001028815,"domain_scores_codex":[0.9967064,0.001304531,0.0002268938,0.0005036732,0.001057028,0.0002014485],"domain_scores_gemma":[0.9942729,0.003519197,0.0002600769,0.0009617133,0.0007300114,0.0002561595],"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.000187838,0.0001689448,0.0003533181,0.0002364696,0.0000717606,0.0002492718,0.0002226211,0.1147911,0.001415772,0.7371874,0.01139941,0.133716],"study_design_scores_gemma":[0.00003461004,0.00004523783,0.00005388329,0.00002472709,0.00001431323,0.0001383907,0.0000591518,0.3872999,0.0005471724,0.6065929,0.005163289,0.00002647812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004657757,0.0006010567,0.9864053,0.001123682,0.0002722181,0.00004451358,0.000106791,0.0001760864,0.006612556],"genre_scores_gemma":[0.1687827,0.00214544,0.8065449,0.0009458974,0.001249735,0.0002844341,0.0007405037,0.0004069488,0.01889941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01470458,"threshold_uncertainty_score":0.04919171,"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","authors":[{"name":"Sam Buss","is_ca":false},{"name":"Michael Soltys","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008223668,0.001015702,0.001517965,0.000586466,0.001337873,0.00213868,0.001540552,0.00205005,0.01124408],"category_scores_gemma":[0.009753889,0.000807257,0.001278038,0.001356282,0.001974292,0.004217296,0.002225236,0.002809354,0.001648795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001004257,"about_ca_system_score_gemma":0.001276788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004559491,"about_ca_topic_score_gemma":0.004867172,"domain_scores_codex":[0.9986809,0.0001806118,0.00008522769,0.0004238736,0.0003385004,0.0002909098],"domain_scores_gemma":[0.9832261,0.01447101,0.0006281757,0.0008149201,0.0005529114,0.0003069794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001346295,0.0005742566,0.00417848,0.001389717,0.0002471534,0.001585424,0.0007301018,0.4711144,0.02152213,0.1010379,0.05130718,0.3449669],"study_design_scores_gemma":[0.0003338906,0.0002868598,0.0007096777,0.00008296328,0.00008163843,0.0005299666,0.0005062364,0.6317911,0.009117153,0.3449686,0.01153862,0.00005321192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3685071,0.001360232,0.5667073,0.008084007,0.0007820805,0.0005637886,0.00242427,0.003259509,0.04831164],"genre_scores_gemma":[0.8108504,0.000640001,0.1575375,0.001130369,0.0004279881,0.0002838105,0.001292796,0.0006783257,0.02715867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01124408,"threshold_uncertainty_score":0.03761524,"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","authors":[{"name":"Klaus Jansen","is_ca":false},{"name":"Hu Zhang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001315118,0.0007512427,0.0007732862,0.0007258028,0.001195995,0.001238133,0.001632007,0.0007795214,0.004380481],"category_scores_gemma":[0.004570709,0.0006659034,0.0004657136,0.0009605957,0.0007703574,0.00169524,0.001765449,0.001123101,0.0004029693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008055046,"about_ca_system_score_gemma":0.001239822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002674398,"about_ca_topic_score_gemma":0.00450515,"domain_scores_codex":[0.9994614,0.0001351546,0.00005025242,0.00007925851,0.0001198949,0.0001541299],"domain_scores_gemma":[0.9970741,0.001810921,0.0003082222,0.0002492249,0.000238695,0.0003188598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005208823,0.000543796,0.002265126,0.0009357983,0.0001305019,0.001220173,0.0007056855,0.7419013,0.04244321,0.0314357,0.003417426,0.1697924],"study_design_scores_gemma":[0.0001669989,0.0003741284,0.0002912937,0.00002487032,0.00003314984,0.0001034652,0.0001186588,0.9695445,0.006006221,0.02136727,0.001945069,0.00002437084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4386263,0.001019103,0.5521995,0.00048804,0.0003340255,0.000270778,0.0001289178,0.0008190673,0.006114333],"genre_scores_gemma":[0.886347,0.0002264584,0.1081918,0.00008764752,0.00007181628,0.00008303334,0.00009499288,0.0001274279,0.004769769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004380481,"threshold_uncertainty_score":0.01465422,"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","authors":[{"name":"Dariusz R. Kowalski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008026032,0.00140828,0.002583407,0.001874803,0.002330029,0.007448284,0.002898332,0.006714744,0.005820236],"category_scores_gemma":[0.02642829,0.0009716835,0.0008338843,0.002323294,0.006323379,0.02128791,0.003589388,0.007583508,0.003123504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001197325,"about_ca_system_score_gemma":0.001482391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001756423,"about_ca_topic_score_gemma":0.001743147,"domain_scores_codex":[0.9941949,0.002684511,0.0002620459,0.001097363,0.001346427,0.000414681],"domain_scores_gemma":[0.9756512,0.01778201,0.0007310683,0.002021094,0.002922644,0.0008918857],"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.0005793244,0.0003105825,0.004034528,0.00162594,0.0002692496,0.0005250973,0.001262269,0.02387979,0.002389153,0.2630025,0.1057367,0.596385],"study_design_scores_gemma":[0.00025408,0.0005280924,0.001194827,0.0007715623,0.0001913818,0.0009553544,0.002167578,0.1261656,0.002695442,0.621253,0.2436135,0.0002095397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01580207,0.212314,0.5740223,0.1450187,0.015022,0.0001288772,0.0001491693,0.001220838,0.03632204],"genre_scores_gemma":[0.5032099,0.184806,0.1755536,0.02250062,0.0484809,0.0002167737,0.0003210264,0.000548902,0.06436217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008026032,"threshold_uncertainty_score":0.04244626,"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","authors":[{"name":"Andreǐ A. Bulatov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003800715,0.0008572756,0.001296466,0.001657612,0.002202573,0.003284942,0.003691425,0.00154442,0.02252334],"category_scores_gemma":[0.02538891,0.0009097955,0.001506078,0.002366327,0.002443965,0.004643465,0.005031636,0.006107216,0.001906769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001312514,"about_ca_system_score_gemma":0.003146824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004879605,"about_ca_topic_score_gemma":0.007844666,"domain_scores_codex":[0.9959578,0.001342036,0.0001851669,0.0005535604,0.001559173,0.0004022192],"domain_scores_gemma":[0.9814429,0.008651931,0.0005834979,0.005723878,0.003058693,0.0005391653],"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.0003181845,0.0001899131,0.001069569,0.0004905134,0.0001547292,0.001018697,0.001264066,0.02637041,0.005325905,0.7750489,0.02267033,0.1660788],"study_design_scores_gemma":[0.0001008109,0.0001044699,0.0006145031,0.0002234602,0.0001246388,0.0007850191,0.0009660339,0.1660942,0.006733038,0.7629081,0.06127989,0.00006567796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03939664,0.0009254845,0.8682553,0.006672843,0.001461112,0.0002728621,0.0005404748,0.001510816,0.08096436],"genre_scores_gemma":[0.5483022,0.0008593655,0.3737974,0.002990522,0.0008136585,0.0002820753,0.001028347,0.001716409,0.07020993],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02252334,"threshold_uncertainty_score":0.07534808,"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","authors":[{"name":"Andreǐ A. Bulatov","is_ca":true},{"name":"Víctor Dalmau","is_ca":false},{"name":"Martin Grohe","is_ca":false},{"name":"Dániel Marx","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001905466,0.001130765,0.001280367,0.003545899,0.002516402,0.004199106,0.002700988,0.00185119,0.01722009],"category_scores_gemma":[0.01206522,0.001024425,0.001999188,0.003750591,0.00219937,0.01130216,0.005503535,0.005527616,0.003356015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001956418,"about_ca_system_score_gemma":0.001272624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009393127,"about_ca_topic_score_gemma":0.001622026,"domain_scores_codex":[0.9973177,0.0007714508,0.0002325556,0.0006292078,0.0006670717,0.0003819964],"domain_scores_gemma":[0.9890062,0.007208772,0.0003280563,0.002050332,0.0009284762,0.000478131],"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.0002334404,0.0002877087,0.002142137,0.0003532577,0.00007132379,0.0001397411,0.0008948807,0.004557411,0.004044382,0.8258004,0.01172808,0.1497472],"study_design_scores_gemma":[0.00001925645,0.00002848514,0.0002743283,0.00003812911,0.00004775789,0.0001789932,0.0001283968,0.01192789,0.002583157,0.9788973,0.005857977,0.00001835879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2474936,0.001635246,0.6353284,0.004288098,0.0007373632,0.0002893085,0.002156343,0.00428838,0.1037833],"genre_scores_gemma":[0.6499674,0.0009905815,0.2898895,0.001139821,0.0004743221,0.0003077338,0.004235069,0.00121229,0.05178337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01722009,"threshold_uncertainty_score":0.05760694,"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","authors":[{"name":"Narayan Vikas","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004157807,0.004156761,0.006141479,0.004064625,0.003259698,0.00930065,0.00871875,0.006228596,0.01937025],"category_scores_gemma":[0.035438,0.001879726,0.007871991,0.007280801,0.004935041,0.02678662,0.006804666,0.01116559,0.003256361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003927215,"about_ca_system_score_gemma":0.004283153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002505323,"about_ca_topic_score_gemma":0.002567989,"domain_scores_codex":[0.9922769,0.001525708,0.0005384776,0.002135896,0.001837747,0.001685324],"domain_scores_gemma":[0.9446276,0.03820443,0.003004768,0.009690098,0.002569543,0.001903594],"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.002541812,0.001337966,0.006144744,0.002570001,0.0004145612,0.0004446494,0.001233979,0.1157208,0.01111751,0.5184485,0.09558494,0.2444405],"study_design_scores_gemma":[0.0002277699,0.0002696228,0.00242302,0.0001219576,0.0002506103,0.0006149181,0.0003087464,0.1723507,0.004117335,0.8110554,0.00812298,0.0001369731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2139962,0.00822619,0.6965058,0.01395071,0.001029609,0.0009787044,0.006574346,0.004338326,0.05440011],"genre_scores_gemma":[0.6303601,0.00780705,0.2880017,0.005126409,0.005697992,0.001777112,0.01846251,0.003138605,0.03962855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01937025,"threshold_uncertainty_score":0.06479996,"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"}]}