{"meta":{"query_hash":"3764d43a42ae","filters":{"venue":"Journal of Computer and System Sciences"},"cohort_total":109,"direct_labels_cover":1,"predictions_cover":109,"exported":109,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/3764d43a42ae","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Computer+and+System+Sciences"},"results":[{"id":"W1547689523","doi":"10.1016/j.jcss.2007.03.010","title":"Special issue on computational molecular biology","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Genetics, Bioinformatics, and Biomedical Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computational biology; Computer science; Biology","score_opus":0.015890869094608896,"score_gpt":0.31632556221082714,"score_spread":0.30043469311621823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547689523","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057755987,0.03684934,0.008694549,0.04385359,0.83992624,0.00023511758,0.001346432,0.0013599792,0.06715722],"genre_scores_gemma":[0.0032072738,0.029038958,0.002673358,0.011925802,0.74454045,0.00029525312,0.0034446388,0.0014735847,0.20340067],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970907,0.00047541584,0.00026834445,0.0005639117,0.0013564886,0.0002451548],"domain_scores_gemma":[0.9798013,0.0064302813,0.00087068597,0.0023079554,0.006910218,0.003679665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00471924,0.0038446854,0.005468406,0.0074492153,0.00221328,0.00800324,0.003014154,0.004262827,0.15781587],"category_scores_gemma":[0.012243604,0.0014097684,0.002212424,0.0049032993,0.0016417095,0.005732763,0.0031508985,0.006614929,0.07584539],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028717495,0.000035452955,0.00007640403,0.00021696514,0.000023987364,0.000030870284,0.000007685379,0.00013478186,0.00013097312,0.0014635619,0.9763871,0.021463562],"study_design_scores_gemma":[0.000039257415,0.000050422568,0.0005490002,0.00021534618,0.00003734373,0.0001595354,0.000014279664,0.0006848117,0.00016236232,0.0051833536,0.9928847,0.000019515455],"about_ca_topic_score_codex":0.0012383992,"about_ca_topic_score_gemma":0.003477249,"teacher_disagreement_score":0.15781587,"about_ca_system_score_codex":0.002067064,"about_ca_system_score_gemma":0.0030972224,"threshold_uncertainty_score":0.5279467},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint satisfaction problem; Homomorphism; Mathematics; Constraint (computer-aided design); Variable (mathematics); Graph; Constraint satisfaction; Discrete mathematics; Conservative extension; Combinatorics; Statistics","score_opus":0.06971659307546549,"score_gpt":0.32773972412823354,"score_spread":0.2580231310527681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602309302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039396644,0.0009254845,0.8682553,0.0066728434,0.0014611118,0.00027286215,0.0005404748,0.0015108164,0.080964364],"genre_scores_gemma":[0.5483022,0.0008593655,0.37379745,0.0029905217,0.00081365847,0.0002820753,0.0010283473,0.0017164091,0.07020993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959578,0.0013420357,0.00018516692,0.00055356044,0.0015591735,0.00040221924],"domain_scores_gemma":[0.98144287,0.008651931,0.00058349787,0.005723878,0.0030586927,0.0005391653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038007153,0.00085727556,0.0012964655,0.0016576123,0.0022025735,0.0032849417,0.0036914248,0.0015444196,0.022523336],"category_scores_gemma":[0.025388908,0.0009097955,0.0015060782,0.0023663265,0.0024439646,0.0046434654,0.0050316355,0.006107216,0.001906769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031818447,0.00018991312,0.0010695687,0.0004905134,0.00015472919,0.0010186973,0.001264066,0.02637041,0.005325905,0.77504885,0.02267033,0.16607878],"study_design_scores_gemma":[0.00010081089,0.00010446986,0.0006145031,0.00022346024,0.0001246388,0.00078501913,0.0009660339,0.16609424,0.006733038,0.7629081,0.06127989,0.00006567796],"about_ca_topic_score_codex":0.0048796046,"about_ca_topic_score_gemma":0.007844666,"teacher_disagreement_score":0.022523336,"about_ca_system_score_codex":0.0013125138,"about_ca_system_score_gemma":0.0031468242,"threshold_uncertainty_score":0.07534808},"labels":[],"label_agreement":null},{"id":"W1650093283","doi":"10.1016/j.jcss.2016.01.001","title":"Separating OR, SUM, and XOR circuits","year":2016,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Academy of Finland","keywords":"Electronic circuit; Boolean circuit; Mathematics; Monotone polygon; Modulo; Rewriting; Netlist; Circuit complexity; Discrete mathematics; Boolean function; Arithmetic; Algorithm; Computer science","score_opus":0.04163178691523718,"score_gpt":0.27593742014764816,"score_spread":0.234305633232411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650093283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34310573,0.0035438342,0.5479437,0.0041988944,0.0005470722,0.00020266694,0.0010933818,0.0010784593,0.098286286],"genre_scores_gemma":[0.85177034,0.0019914883,0.11063584,0.0008778329,0.00038797662,0.00015042131,0.00069483765,0.0002818848,0.03320946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990095,0.0002475908,0.000080348706,0.00021630667,0.00024387272,0.00020234907],"domain_scores_gemma":[0.99675083,0.0020843276,0.00029389875,0.0004910616,0.00022241753,0.00015747178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009889577,0.0009327742,0.0008653991,0.001155006,0.001102137,0.003063424,0.0011172215,0.0012322617,0.008560256],"category_scores_gemma":[0.0066747046,0.00060270244,0.0009906003,0.0010944318,0.0017930731,0.0070800516,0.002396732,0.0022361479,0.0011783673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045382293,0.00006686439,0.00060647214,0.0002007345,0.000050429884,0.00012869424,0.00019237808,0.012471119,0.0049718483,0.901923,0.004078058,0.07485662],"study_design_scores_gemma":[0.000035616024,0.00003308208,0.00016517585,0.00003006986,0.00005364976,0.0001466449,0.000048900492,0.02696686,0.0029692056,0.9649999,0.004532959,0.000017874616],"about_ca_topic_score_codex":0.00094210735,"about_ca_topic_score_gemma":0.0015301687,"teacher_disagreement_score":0.008560256,"about_ca_system_score_codex":0.0010037955,"about_ca_system_score_gemma":0.0012580293,"threshold_uncertainty_score":0.028636932},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015609028292088054,"score_gpt":0.251137507748184,"score_spread":0.23552847945609595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872909421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91532594,0.00023939845,0.05551855,0.0026890722,0.00021733648,0.00007422437,0.0001759155,0.00035248318,0.025407042],"genre_scores_gemma":[0.9944956,0.00007331886,0.0037943379,0.00012805291,0.000029625617,0.000039053004,0.000053644548,0.00004495119,0.0013414202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947196,0.00023245972,0.00001670323,0.00005894224,0.00011152103,0.000108413544],"domain_scores_gemma":[0.9957065,0.0031095282,0.00020499306,0.00039096922,0.00025928576,0.0003288055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008938765,0.0003707259,0.0008840683,0.0008212187,0.0011933459,0.0014080167,0.0015401527,0.0016410766,0.006709985],"category_scores_gemma":[0.008081963,0.000499929,0.00056892773,0.0006937079,0.0027724812,0.0029797873,0.0012929364,0.0014934436,0.0002521646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016220604,0.00015183029,0.0011569966,0.000060388735,0.00004816869,0.00017206627,0.00024244763,0.45671996,0.001650467,0.5349259,0.00175094,0.0029586095],"study_design_scores_gemma":[0.00004656307,0.000015460077,0.00019102714,0.000005292774,0.0000072184857,0.000014365699,0.000047194408,0.8677353,0.00026918313,0.13139224,0.00026374418,0.000012424902],"about_ca_topic_score_codex":0.00498735,"about_ca_topic_score_gemma":0.005033173,"teacher_disagreement_score":0.006709985,"about_ca_system_score_codex":0.0014056573,"about_ca_system_score_gemma":0.0008439735,"threshold_uncertainty_score":0.022447169},"labels":[],"label_agreement":null},{"id":"W1924404066","doi":"10.1016/j.jcss.2016.10.001","title":"Deciding whether a regular language is generated by a splicing system","year":2016,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Syntactic monoid; Regular language; RNA splicing; Computer science; Class (philosophy); Function (biology); Word (group theory); Mathematics; Discrete mathematics; Genetics; Theoretical computer science; Monoid; Artificial intelligence; Biology; Gene; Free monoid","score_opus":0.010700925357367405,"score_gpt":0.24105450340923162,"score_spread":0.2303535780518642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924404066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88395965,0.000041724557,0.10675766,0.0017729216,0.00011923084,0.00012382472,0.00049129775,0.0017277624,0.005006045],"genre_scores_gemma":[0.9630299,0.00002079899,0.034821313,0.00022892588,0.00006203915,0.00003546311,0.00073051796,0.00017608773,0.0008949708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966023,0.00083743583,0.00037129995,0.00093779335,0.0006919452,0.0005593017],"domain_scores_gemma":[0.9693581,0.024116976,0.0014062821,0.0014292208,0.002495005,0.0011943534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033563073,0.00036539577,0.0006397997,0.00067907,0.0010643125,0.002843307,0.0014308828,0.0017597694,0.004020156],"category_scores_gemma":[0.014608584,0.0006252725,0.0013118533,0.00044721656,0.002185201,0.0044186697,0.0013288106,0.0019557572,0.00070205564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010671016,0.0015759972,0.12643276,0.0015684793,0.0009155436,0.010586595,0.004903436,0.077625096,0.2751485,0.2844461,0.017286247,0.18884024],"study_design_scores_gemma":[0.00057689607,0.0010464276,0.007992992,0.00009977861,0.00040196753,0.0023834805,0.0021250863,0.38805708,0.1369882,0.45542184,0.0047285045,0.00017769779],"about_ca_topic_score_codex":0.00089481217,"about_ca_topic_score_gemma":0.0012908938,"teacher_disagreement_score":0.004020156,"about_ca_system_score_codex":0.00064883847,"about_ca_system_score_gemma":0.0017641995,"threshold_uncertainty_score":0.017750084},"labels":[],"label_agreement":null},{"id":"W1959691716","doi":"10.1016/j.jcss.2008.12.001","title":"An application of quantum finite automata to interactive proof systems","year":2008,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Computer science; Theoretical computer science; Quantum finite automata; Quantum; Automaton; Automata theory; Quantum mechanics; Physics","score_opus":0.014757690870303809,"score_gpt":0.26378779444359124,"score_spread":0.24903010357328742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959691716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03275566,0.00066172756,0.9292417,0.0015374281,0.00038643274,0.000130787,0.00008146253,0.0008525366,0.034352288],"genre_scores_gemma":[0.67558545,0.00077303813,0.31330293,0.0004033179,0.00042277106,0.00019900537,0.00007533005,0.00032408477,0.008914041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807227,0.00086558965,0.00012040081,0.000248852,0.00051309535,0.00017987154],"domain_scores_gemma":[0.98956126,0.008412187,0.00015155054,0.0011276645,0.000507019,0.00024025669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002242501,0.0005216293,0.0010224511,0.0013089958,0.0020203884,0.0028084982,0.0020568685,0.0019456077,0.009207269],"category_scores_gemma":[0.014022021,0.0006522963,0.0018892795,0.0011680335,0.0037591923,0.0048431386,0.0035995524,0.0029565434,0.00082397077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003946132,0.000034856588,0.00014878692,0.00005655582,0.000020458756,0.00013525644,0.0002458384,0.011941788,0.0011842698,0.9724243,0.00076526304,0.013003046],"study_design_scores_gemma":[0.000019417883,0.000016157188,0.00006118093,0.000017675597,0.000014312332,0.00005551691,0.000023486476,0.11284711,0.0009131329,0.88274145,0.003273103,0.000017372626],"about_ca_topic_score_codex":0.002016764,"about_ca_topic_score_gemma":0.0016403791,"teacher_disagreement_score":0.009207269,"about_ca_system_score_codex":0.0017215303,"about_ca_system_score_gemma":0.0014886233,"threshold_uncertainty_score":0.030801415},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02568153275759406,"score_gpt":0.21400118481868027,"score_spread":0.18831965206108622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964122413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4386263,0.0010191032,0.5521995,0.00048804,0.00033402554,0.00027077802,0.00012891779,0.0008190673,0.0061143334],"genre_scores_gemma":[0.886347,0.00022645837,0.1081918,0.00008764752,0.00007181628,0.000083033345,0.00009499288,0.0001274279,0.004769769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946135,0.00013515462,0.00005025242,0.000079258505,0.00011989485,0.00015412991],"domain_scores_gemma":[0.9970741,0.0018109211,0.00030822217,0.00024922486,0.00023869498,0.00031885985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013151184,0.0007512427,0.00077328616,0.00072580285,0.001195995,0.0012381332,0.0016320071,0.00077952136,0.0043804813],"category_scores_gemma":[0.0045707086,0.00066590344,0.00046571356,0.00096059573,0.00077035744,0.0016952399,0.0017654486,0.0011231011,0.00040296934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005208823,0.00054379605,0.0022651257,0.0009357983,0.00013050185,0.0012201725,0.00070568547,0.74190134,0.042443212,0.0314357,0.0034174258,0.16979244],"study_design_scores_gemma":[0.00016699889,0.0003741284,0.00029129372,0.000024870316,0.000033149845,0.00010346516,0.000118658805,0.96954453,0.006006221,0.021367272,0.0019450692,0.000024370844],"about_ca_topic_score_codex":0.0026743985,"about_ca_topic_score_gemma":0.0045051496,"teacher_disagreement_score":0.0043804813,"about_ca_system_score_codex":0.0008055046,"about_ca_system_score_gemma":0.0012398219,"threshold_uncertainty_score":0.014654219},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cloud computing; Big data; Graph; Data mining; Distributed computing; Theoretical computer science","score_opus":0.06487644311564492,"score_gpt":0.27202098733089275,"score_spread":0.20714454421524783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970225139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03608262,0.0009339166,0.958098,0.00031100743,0.00023722083,0.000121428566,0.00029275377,0.0010212363,0.0029018691],"genre_scores_gemma":[0.40431285,0.0015546001,0.58674705,0.00020905958,0.0003231087,0.00013784104,0.00093766145,0.00011116029,0.0056665908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975806,0.00002019315,0.000017233073,0.00003637496,0.00013554939,0.000032536784],"domain_scores_gemma":[0.99972945,0.00005533311,0.00002282134,0.00005590634,0.000116841846,0.000019789251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019173125,0.0004997246,0.000548707,0.00085073186,0.00049398554,0.00072027976,0.0007230293,0.00037436068,0.0021330856],"category_scores_gemma":[0.00068969367,0.00019448444,0.00044955107,0.0016524531,0.00020269607,0.0009980376,0.00065203494,0.0004679992,0.00050145097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006334972,0.00030204712,0.002388657,0.0001999403,0.0001071997,0.00054887,0.00013824795,0.11821724,0.12588795,0.015640438,0.0101940185,0.7257419],"study_design_scores_gemma":[0.000018205286,0.00007948899,0.00093754707,0.000007902975,0.000032341468,0.00024827558,0.00006559252,0.97076035,0.020857202,0.0030210437,0.003957554,0.000014571828],"about_ca_topic_score_codex":0.0048804497,"about_ca_topic_score_gemma":0.0056016445,"teacher_disagreement_score":0.0048804497,"about_ca_system_score_codex":0.00032780267,"about_ca_system_score_gemma":0.00094995217,"threshold_uncertainty_score":0.009704113},"labels":[],"label_agreement":null},{"id":"W1970586713","doi":"10.1016/j.jcss.2014.11.007","title":"A cross layer optimization modeling for a periodic WSN application","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"Deanship of Scientific Research, King Faisal University","keywords":"Computer science; Integer programming; Wireless sensor network; Scheduling (production processes); Schedule; Mathematical optimization; Cross-layer optimization; Routing (electronic design automation); Optimization problem; Linear programming; Integer (computer science); Energy (signal processing); Wireless; Wireless network; Algorithm; Computer network; Mathematics","score_opus":0.018489090853321708,"score_gpt":0.26060520093349837,"score_spread":0.24211611008017667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970586713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061977983,0.00056507764,0.9165162,0.0006053023,0.0000864822,0.00007214125,0.00013188331,0.0002177125,0.01982718],"genre_scores_gemma":[0.90558404,0.00068243954,0.07040826,0.00017150138,0.00006599223,0.00014954779,0.00013872917,0.00018865961,0.022610813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998272,0.00004684254,0.000006613998,0.000037248952,0.000053535772,0.000028692222],"domain_scores_gemma":[0.9997894,0.00009808696,0.000030217707,0.000015174724,0.00005547751,0.000011610766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005375737,0.0005361706,0.00040973813,0.00022124586,0.00029217286,0.00069838576,0.0007516659,0.00082526664,0.0030029435],"category_scores_gemma":[0.0010100353,0.000344343,0.0006183877,0.00032428742,0.00025825843,0.0006246465,0.0006013087,0.00065699435,0.00035864874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014213204,0.00001651335,0.00017175877,0.000018354598,0.000008193229,0.000031236785,0.00001231177,0.9908579,0.0013261392,0.003546669,0.00030452502,0.003692228],"study_design_scores_gemma":[7.840146e-7,0.0000052107357,0.00004019123,0.0000010007084,0.0000019881961,0.0000038634817,0.0000019895274,0.9994773,0.00008951645,0.0002847973,0.00009249878,9.474209e-7],"about_ca_topic_score_codex":0.006078286,"about_ca_topic_score_gemma":0.0038775674,"teacher_disagreement_score":0.006078286,"about_ca_system_score_codex":0.00046653845,"about_ca_system_score_gemma":0.0006952125,"threshold_uncertainty_score":0.012085795},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013237746815717362,"score_gpt":0.2886852760603667,"score_spread":0.2754475292446493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971378925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001744674,0.00006537726,0.9964347,0.000040235333,0.000024167104,0.000036686328,0.0000410192,0.0014570133,0.00015615387],"genre_scores_gemma":[0.01153657,0.000059852246,0.98730147,0.000040817868,0.000018981164,0.00007615454,0.00018474563,0.00017152315,0.000609822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886346,0.00021815451,0.00012038138,0.00029191436,0.00043024926,0.000075857584],"domain_scores_gemma":[0.9980782,0.0007399205,0.000110347646,0.00035022973,0.000645484,0.00007587969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018334123,0.0013997402,0.0010557782,0.0015035957,0.0012072099,0.0018274185,0.0019658585,0.0014779071,0.0033071658],"category_scores_gemma":[0.0050968775,0.00078317453,0.0007579766,0.0016260783,0.00060358254,0.001945104,0.002231508,0.0020533635,0.0031531744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003280676,0.000107494205,0.00050911104,0.00015458453,0.00007008884,0.00012511451,0.0000874889,0.02636868,0.03446542,0.008508802,0.004705437,0.9245696],"study_design_scores_gemma":[0.00010433357,0.00008911919,0.00062803243,0.000025735199,0.00005611106,0.00046093788,0.000039215676,0.92130375,0.036956057,0.029181493,0.011108148,0.00004709832],"about_ca_topic_score_codex":0.0013491997,"about_ca_topic_score_gemma":0.0025577024,"teacher_disagreement_score":0.0033071658,"about_ca_system_score_codex":0.0005750185,"about_ca_system_score_gemma":0.0017395084,"threshold_uncertainty_score":0.011063576},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Advice (programming); Computer science; Dissemination; Node (physics); Broadcasting (networking); Computer network; Algorithm; Theoretical computer science; Telecommunications","score_opus":0.017505653996276998,"score_gpt":0.26672492767637895,"score_spread":0.24921927368010197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971694274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0299452,0.0011765447,0.8566803,0.005367769,0.0013138166,0.00026269193,0.0004752329,0.0103665665,0.09441203],"genre_scores_gemma":[0.4951814,0.00066479784,0.404964,0.0018534783,0.0011106629,0.0005745998,0.00086255017,0.0020245232,0.092763856],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967018,0.001109332,0.00017848423,0.0005380528,0.00097600184,0.0004964557],"domain_scores_gemma":[0.987039,0.00710016,0.00029961,0.0037565662,0.0014246581,0.00037992618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022242481,0.0012008516,0.0015061896,0.0015580442,0.0023157848,0.0027479567,0.002161748,0.002666919,0.026603144],"category_scores_gemma":[0.025179923,0.0006952368,0.0010044302,0.0016692748,0.0018583287,0.0038658236,0.0031533674,0.003949926,0.007722837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010276921,0.00037457235,0.0013871919,0.00032303648,0.00010200812,0.00016291418,0.0004694334,0.04238336,0.002557349,0.41486514,0.09020157,0.44614574],"study_design_scores_gemma":[0.00026308626,0.0001050295,0.0002341663,0.00007887794,0.000078287776,0.00015975854,0.00007015984,0.32740697,0.004368643,0.63817096,0.029032957,0.00003105703],"about_ca_topic_score_codex":0.0027239448,"about_ca_topic_score_gemma":0.003085434,"teacher_disagreement_score":0.026603144,"about_ca_system_score_codex":0.0013877776,"about_ca_system_score_gemma":0.0024855435,"threshold_uncertainty_score":0.08899635},"labels":[],"label_agreement":null},{"id":"W1974421059","doi":"10.1016/j.jcss.2010.02.006","title":"The design and evaluation of fair scheduling in wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Round-robin scheduling; Fair-share scheduling; Dynamic priority scheduling; Two-level scheduling; Scheduling (production processes); Maximum throughput scheduling; Rate-monotonic scheduling; Distributed computing; Computer network; Mathematical optimization; Mathematics; Quality of service","score_opus":0.01739725792280923,"score_gpt":0.249744633077948,"score_spread":0.23234737515513876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974421059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11244185,0.00084122724,0.8824824,0.000521992,0.00015803387,0.00025665647,0.000040911375,0.00027982923,0.0029770713],"genre_scores_gemma":[0.9389965,0.0001933502,0.059923075,0.000048149654,0.00007055248,0.000076228906,0.00001848482,0.000036963138,0.0006366756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963446,0.0019629723,0.00012623209,0.00026680858,0.000949771,0.0003496304],"domain_scores_gemma":[0.9885824,0.008509779,0.0006903835,0.0004794522,0.0013928611,0.00034515932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010852056,0.00082167983,0.001092637,0.00103315,0.0009844961,0.0018302491,0.0021204825,0.0009749426,0.0011209858],"category_scores_gemma":[0.03100558,0.0006536925,0.0003987329,0.0005280421,0.0016885969,0.0017418343,0.0011928895,0.00087265234,0.00009123898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003187521,0.0000866584,0.0009460534,0.00009237451,0.00003338001,0.00003807365,0.00006692912,0.95140356,0.0036968538,0.018863821,0.0003737673,0.024079753],"study_design_scores_gemma":[0.000014135773,0.000045552657,0.000047510137,0.000002672546,0.0000073169854,0.0000047808735,0.000006650942,0.9962853,0.00058720703,0.0028936192,0.0001021724,0.0000030482076],"about_ca_topic_score_codex":0.0059256293,"about_ca_topic_score_gemma":0.0043618972,"teacher_disagreement_score":0.010852056,"about_ca_system_score_codex":0.0035278762,"about_ca_system_score_gemma":0.0038044166,"threshold_uncertainty_score":0.057391822},"labels":[],"label_agreement":null},{"id":"W1981154552","doi":"10.1016/j.jcss.2007.07.007","title":"An Adaptive Dynamic Grid-Based approach to DDM for large-scale distributed simulation systems","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Distributed computing; Computer science; Grid; Scale (ratio); Computational science; Mathematics; Physics","score_opus":0.08831218270843036,"score_gpt":0.4104759402932044,"score_spread":0.322163757584774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981154552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007934411,0.00005883464,0.989777,0.00010436595,0.000040142753,0.00003519589,0.000022718952,0.00040973967,0.0016175145],"genre_scores_gemma":[0.6317281,0.0001168912,0.36578286,0.00011153475,0.00005929116,0.00019168099,0.00009748815,0.00018388551,0.0017282106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995308,0.00018769906,0.00002977996,0.00006588537,0.0001496045,0.000036163954],"domain_scores_gemma":[0.99891424,0.00053120276,0.00008994535,0.00015012447,0.0002505507,0.00006402726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007899578,0.00042161587,0.000995277,0.00056241604,0.00065713015,0.00079294096,0.0018714418,0.00086075545,0.002678181],"category_scores_gemma":[0.003504964,0.00042486758,0.0004989566,0.000635531,0.0005215051,0.0008527584,0.001397766,0.0009114445,0.0003624273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006928815,0.000043275806,0.0004930688,0.00003517003,0.00003334334,0.00004466912,0.000047122478,0.9535668,0.0015041756,0.0061906464,0.00054848543,0.03742408],"study_design_scores_gemma":[0.000004177251,0.000003874568,0.000020637077,8.322478e-7,0.0000018859938,0.0000028013487,0.0000024390936,0.9989434,0.00009110109,0.0007862237,0.00014133716,0.0000013545623],"about_ca_topic_score_codex":0.0071590086,"about_ca_topic_score_gemma":0.0076159285,"teacher_disagreement_score":0.0071590086,"about_ca_system_score_codex":0.0006327755,"about_ca_system_score_gemma":0.00075854996,"threshold_uncertainty_score":0.014234662},"labels":[],"label_agreement":null},{"id":"W1981541922","doi":"10.1016/s0022-0000(02)00006-5","title":"Methods for reconstructing the history of tandem repeats and their application to the human genome","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Alberta; University of Waterloo","funders":"University of Waterloo; McMaster University","keywords":"Tandem repeat; Steiner tree problem; Combinatorics; Computer science; Heuristic; Gene duplication; Tandem exon duplication; Tree (set theory); Mathematics; Algorithm; Genome; Artificial intelligence; Biology; Genetics; Gene","score_opus":0.05563502447013171,"score_gpt":0.30498942655447414,"score_spread":0.24935440208434242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981541922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016423661,0.0010607049,0.9808945,0.00017832425,0.000049393635,0.000025077208,0.00018923666,0.00064166286,0.00053741835],"genre_scores_gemma":[0.12290521,0.0019728043,0.8719652,0.00007690369,0.00014992275,0.00015113753,0.0006745331,0.00039040897,0.0017138984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994802,0.00015371827,0.000049902825,0.00014275688,0.00014275743,0.000030674124],"domain_scores_gemma":[0.99469876,0.0038614618,0.00036718676,0.0006362796,0.000305942,0.00013030577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023354448,0.00077076786,0.0008252957,0.003845509,0.0009467017,0.0014587917,0.0019291863,0.0015581637,0.0025057576],"category_scores_gemma":[0.013625629,0.00094712485,0.0011381811,0.0035187888,0.0014102283,0.0017863102,0.0016291561,0.0018927717,0.00096138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028158817,0.000095825795,0.0056281025,0.00034239976,0.00019132116,0.00027158615,0.0006187442,0.2943659,0.013827705,0.0521779,0.0024174699,0.62978137],"study_design_scores_gemma":[0.000060011902,0.000044507367,0.0016692086,0.000054501357,0.00006992649,0.00037524616,0.00011622421,0.9073428,0.004668333,0.081344,0.004187349,0.00006798716],"about_ca_topic_score_codex":0.003757516,"about_ca_topic_score_gemma":0.004811899,"teacher_disagreement_score":0.003845509,"about_ca_system_score_codex":0.0005693731,"about_ca_system_score_gemma":0.00090043986,"threshold_uncertainty_score":0.012351155},"labels":[],"label_agreement":null},{"id":"W1986060337","doi":"10.1006/jcss.2001.1810","title":"Aggregate Operators in Constraint Query Languages","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Constraint (computer-aided design); Aggregate (composite); Computer science; Class (philosophy); Closure (psychology); Dimension (graph theory); Query language; Theoretical computer science; Set (abstract data type); Computation; Datalog; Range (aeronautics); Mathematics; Algorithm; Programming language; Artificial intelligence; Database; Combinatorics","score_opus":0.019816982670070694,"score_gpt":0.24449189325280507,"score_spread":0.22467491058273437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986060337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02268262,0.0009246379,0.96326435,0.0016615086,0.00011560184,0.00017831489,0.0008630446,0.0025375567,0.0077722915],"genre_scores_gemma":[0.3761123,0.00146548,0.6071015,0.0012724542,0.00041271182,0.00046801867,0.002012497,0.0014289632,0.009726016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99327165,0.0023434558,0.00088884286,0.0007918616,0.002178362,0.0005258235],"domain_scores_gemma":[0.98825806,0.008462891,0.0005461373,0.0014195989,0.0010333466,0.0002799603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074952627,0.0007818976,0.0018749713,0.0021089392,0.0020491632,0.0075677014,0.002645022,0.0018543784,0.00664397],"category_scores_gemma":[0.01607978,0.0016468758,0.0017119258,0.0051655523,0.003973885,0.018062793,0.004059179,0.004344778,0.0011257549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030762996,0.00007481242,0.00072375825,0.0002385112,0.00006055323,0.00016994077,0.0013283532,0.0096238805,0.0016830156,0.9287456,0.008285547,0.048758294],"study_design_scores_gemma":[0.00010390145,0.000042368145,0.00019237155,0.00008014109,0.00011444472,0.0001670561,0.00044160066,0.07048155,0.0032464482,0.9032498,0.021809518,0.00007092338],"about_ca_topic_score_codex":0.0081304135,"about_ca_topic_score_gemma":0.009689904,"teacher_disagreement_score":0.0081304135,"about_ca_system_score_codex":0.0024723338,"about_ca_system_score_gemma":0.0024908087,"threshold_uncertainty_score":0.039639235},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024220483263055054,"score_gpt":0.2379167837357343,"score_spread":0.21369630047267923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986633843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039101545,0.026489,0.83367825,0.014853091,0.0017435284,0.00037981654,0.0015841802,0.0013271283,0.08084351],"genre_scores_gemma":[0.38789868,0.024187725,0.52828676,0.004502759,0.006756912,0.0015413773,0.004102891,0.0024894227,0.040233564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98971915,0.0035968455,0.00049045065,0.0015402837,0.0028376563,0.0018156775],"domain_scores_gemma":[0.88011503,0.10392275,0.0029372815,0.00586886,0.00457511,0.002580948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013886751,0.004301832,0.005248293,0.0068220035,0.0032937056,0.011677475,0.009582475,0.005806073,0.027231222],"category_scores_gemma":[0.09448473,0.0026947893,0.0027232247,0.0087476745,0.0055210222,0.026839126,0.008437512,0.013546746,0.0040426464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015345678,0.00087292737,0.0012643794,0.0017163708,0.00018440427,0.00018367692,0.0005932372,0.17394865,0.0021936602,0.5973677,0.055405155,0.16473524],"study_design_scores_gemma":[0.00015103267,0.00016253897,0.00040799557,0.00031081142,0.00012354857,0.0002581633,0.00017672454,0.34162733,0.001315364,0.64757276,0.007824153,0.00006957492],"about_ca_topic_score_codex":0.00272913,"about_ca_topic_score_gemma":0.004108267,"teacher_disagreement_score":0.027231222,"about_ca_system_score_codex":0.00642968,"about_ca_system_score_gemma":0.0056341323,"threshold_uncertainty_score":0.091097474},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03143958742733738,"score_gpt":0.2867763757400699,"score_spread":0.25533678831273254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990948892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36850286,0.0017029387,0.6009161,0.011001612,0.00022647728,0.00022344138,0.0016704125,0.0007656938,0.014990445],"genre_scores_gemma":[0.87415177,0.0009502944,0.11593646,0.0007196647,0.00045329565,0.00033533282,0.0020205823,0.00021097102,0.0052215653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931933,0.0020427597,0.0007192122,0.0013421476,0.002361706,0.00034080914],"domain_scores_gemma":[0.88483495,0.10445518,0.002469108,0.004995266,0.0020984083,0.0011470915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045364224,0.00076877483,0.00158653,0.001066251,0.0012031754,0.0051361355,0.0027167676,0.0026613835,0.00934736],"category_scores_gemma":[0.07747123,0.0011434965,0.0018700438,0.001627962,0.0035390514,0.01863404,0.0052484474,0.004947049,0.00086933136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015953236,0.00039461127,0.011397782,0.0010697431,0.00033326604,0.00054014236,0.0017034825,0.14925526,0.004611459,0.601922,0.012312881,0.21486412],"study_design_scores_gemma":[0.0000716391,0.00005213506,0.0010248361,0.000025394475,0.000036759233,0.00015122625,0.00012806333,0.21803941,0.00080661854,0.7784336,0.0012043755,0.000025863572],"about_ca_topic_score_codex":0.002037497,"about_ca_topic_score_gemma":0.0017615736,"teacher_disagreement_score":0.00934736,"about_ca_system_score_codex":0.0021445274,"about_ca_system_score_gemma":0.0017085245,"threshold_uncertainty_score":0.031270027},"labels":[],"label_agreement":null},{"id":"W1991704078","doi":"10.1016/j.jcss.2012.05.001","title":"Special issue: Frontiers and advance topics of computer and information technology","year":2012,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Data science; Information technology; Library science","score_opus":0.020230506106961716,"score_gpt":0.24953108350323122,"score_spread":0.2293005773962695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991704078","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012136113,0.017059648,0.0006684211,0.019264624,0.9242123,0.0002805382,0.0011147185,0.0003747681,0.035811372],"genre_scores_gemma":[0.0038472442,0.014264599,0.00051816215,0.006152113,0.8301743,0.00022378415,0.0016886516,0.0003230076,0.14280808],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980108,0.00021152603,0.00029869375,0.00032526714,0.0008184432,0.00033523366],"domain_scores_gemma":[0.98617166,0.0024326516,0.0011162681,0.00082461344,0.0051927534,0.0042620897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003718812,0.004060421,0.0057875128,0.009208826,0.002731941,0.009324189,0.0030213846,0.0075999983,0.14694965],"category_scores_gemma":[0.0064742593,0.00097091775,0.002540409,0.0047790785,0.0012695404,0.0052453587,0.0026908605,0.003751776,0.06807175],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014195238,0.00008376668,0.00028073645,0.0005388349,0.000019257353,0.00017455645,0.000014700634,0.000072873736,0.00045125472,0.0007068013,0.9749019,0.022613324],"study_design_scores_gemma":[0.000084122585,0.0002142891,0.0044523138,0.00037766478,0.00005598281,0.0005026527,0.00007881917,0.000481076,0.00040024627,0.001974379,0.9913464,0.00003198858],"about_ca_topic_score_codex":0.00090495526,"about_ca_topic_score_gemma":0.0024901254,"teacher_disagreement_score":0.14694965,"about_ca_system_score_codex":0.0019498569,"about_ca_system_score_gemma":0.0032012716,"threshold_uncertainty_score":0.49159557},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0158461054721059,"score_gpt":0.2391431729055691,"score_spread":0.2232970674334632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998001670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13718012,0.00018472725,0.85751957,0.00017773452,0.00007241271,0.000043886947,0.00003640379,0.00014400657,0.0046411892],"genre_scores_gemma":[0.97074866,0.000058609512,0.027058154,0.000026355852,0.000016452712,0.00004356237,0.000043184307,0.000018441931,0.0019866598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998367,0.000045915673,0.000005688283,0.00003709333,0.000038164515,0.00003641392],"domain_scores_gemma":[0.99974364,0.00008406023,0.000050449446,0.000035193,0.00003863293,0.00004807689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035731247,0.00035440899,0.0006151185,0.000374821,0.0005762623,0.00047455044,0.0008304834,0.00046496966,0.0011412025],"category_scores_gemma":[0.0008188304,0.00027580268,0.0003398099,0.00029247106,0.00049775455,0.00071535277,0.0017528005,0.0005623167,0.00017205991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084524756,0.000053846514,0.00055033364,0.000020976584,0.000037629663,0.00007341551,0.00006190731,0.9605335,0.004542544,0.007898699,0.0008023823,0.025340283],"study_design_scores_gemma":[0.000006353566,0.000025550113,0.00011391491,0.0000012055438,0.0000035330593,0.000008854725,0.000019907708,0.99670416,0.00025797146,0.0026618282,0.00019453885,0.000002291052],"about_ca_topic_score_codex":0.0019459779,"about_ca_topic_score_gemma":0.0019843793,"teacher_disagreement_score":0.0019459779,"about_ca_system_score_codex":0.000408069,"about_ca_system_score_gemma":0.00045143758,"threshold_uncertainty_score":0.0038692951},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05013380049442868,"score_gpt":0.27311171172693877,"score_spread":0.2229779112325101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999792620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5904153,0.00021021256,0.4057472,0.00031762273,0.000051613304,0.00005944582,0.00037446685,0.001248911,0.0015752657],"genre_scores_gemma":[0.7188681,0.00019532956,0.27837703,0.000062917854,0.0000295665,0.00004758029,0.0008896856,0.00030989462,0.0012199323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999783,0.00005748178,0.000016260043,0.00007948244,0.000036914113,0.00002687391],"domain_scores_gemma":[0.9988564,0.00070537126,0.00008939969,0.00019609096,0.00009734741,0.000055347566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000892984,0.00041233975,0.00072445907,0.0015654482,0.0006837949,0.0009965309,0.0011772498,0.0010296367,0.0025097725],"category_scores_gemma":[0.0044290153,0.0008407796,0.0011332607,0.0012216851,0.00065407826,0.0010256212,0.0007107517,0.0012644171,0.0005097885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016197334,0.00019085214,0.026339253,0.0003753182,0.00026199935,0.0010706201,0.00084755046,0.53180736,0.07729416,0.05196447,0.0016146024,0.306614],"study_design_scores_gemma":[0.000110491674,0.00014810117,0.0031438905,0.000027381202,0.00011924415,0.00043588673,0.00022834072,0.94569504,0.014103409,0.03377555,0.0021748657,0.00003779359],"about_ca_topic_score_codex":0.001570665,"about_ca_topic_score_gemma":0.0022288233,"teacher_disagreement_score":0.0025097725,"about_ca_system_score_codex":0.0005468318,"about_ca_system_score_gemma":0.00068051997,"threshold_uncertainty_score":0.0083960295},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.020491964852345043,"score_gpt":0.29002053605459854,"score_spread":0.2695285712022535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000945011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8342232,0.0012124794,0.14832939,0.0028965815,0.00005921538,0.000047019614,0.00060024776,0.00065788097,0.01197405],"genre_scores_gemma":[0.98668355,0.00030950416,0.010063555,0.0001970684,0.000065766275,0.000046799054,0.00040213874,0.00008537599,0.002146215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884367,0.0003120771,0.000048198206,0.000280448,0.0002514121,0.00026421208],"domain_scores_gemma":[0.9771149,0.014076579,0.003409563,0.0029173887,0.00094192824,0.0015395448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001335811,0.0004564684,0.0011811312,0.0016941266,0.0016149215,0.0024149215,0.0022120608,0.001585045,0.005310069],"category_scores_gemma":[0.015740907,0.00065292534,0.0005592134,0.0034359414,0.0032851507,0.009846379,0.0024404817,0.0023449678,0.0003532892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068971445,0.00027752185,0.012348228,0.00023746758,0.000078629535,0.0008025469,0.0014447423,0.06647235,0.0059184595,0.8732298,0.005127444,0.033372976],"study_design_scores_gemma":[0.000049935963,0.00004196372,0.001764941,0.000016790926,0.000025177742,0.0005754491,0.00036174234,0.04176764,0.0009247343,0.9532379,0.0012142457,0.000019520583],"about_ca_topic_score_codex":0.0024850103,"about_ca_topic_score_gemma":0.0024613803,"teacher_disagreement_score":0.005310069,"about_ca_system_score_codex":0.0018570474,"about_ca_system_score_gemma":0.0010805323,"threshold_uncertainty_score":0.017763913},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"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","score_opus":0.012126426616974816,"score_gpt":0.22011064574566236,"score_spread":0.20798421912868753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003002196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01580207,0.21231402,0.5740223,0.14501871,0.015022005,0.00012887716,0.0001491693,0.001220838,0.03632204],"genre_scores_gemma":[0.50320995,0.18480603,0.17555362,0.022500625,0.0484809,0.00021677365,0.0003210264,0.000548902,0.06436217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941949,0.0026845115,0.00026204585,0.0010973627,0.0013464275,0.00041468104],"domain_scores_gemma":[0.9756512,0.017782014,0.00073106826,0.0020210939,0.0029226437,0.00089188566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008026032,0.0014082801,0.002583407,0.0018748029,0.0023300292,0.007448284,0.002898332,0.0067147436,0.0058202357],"category_scores_gemma":[0.026428292,0.0009716835,0.00083388435,0.0023232938,0.0063233795,0.021287907,0.0035893875,0.007583508,0.0031235043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005793244,0.00031058246,0.004034528,0.0016259399,0.00026924958,0.0005250973,0.0012622686,0.023879787,0.0023891525,0.26300246,0.10573673,0.596385],"study_design_scores_gemma":[0.00025407996,0.0005280924,0.0011948275,0.0007715623,0.00019138181,0.00095535436,0.0021675783,0.12616558,0.0026954424,0.621253,0.24361351,0.00020953974],"about_ca_topic_score_codex":0.0017564228,"about_ca_topic_score_gemma":0.0017431471,"teacher_disagreement_score":0.008026032,"about_ca_system_score_codex":0.0011973253,"about_ca_system_score_gemma":0.0014823907,"threshold_uncertainty_score":0.042446256},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01107804895600222,"score_gpt":0.21512534690480742,"score_spread":0.2040472979488052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005181510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48756543,0.001184123,0.41593567,0.0037899849,0.000622206,0.00017667578,0.0008795435,0.0019162827,0.08793001],"genre_scores_gemma":[0.9486861,0.00036123712,0.022831127,0.00023796615,0.0003325677,0.00011538259,0.00028345906,0.00023092289,0.026921118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892277,0.00030456687,0.000092593036,0.00022250334,0.00025360758,0.0002039011],"domain_scores_gemma":[0.9908246,0.005591472,0.00072862627,0.0014176962,0.0006974928,0.00074019545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010698197,0.00039622298,0.00089486456,0.0020652115,0.0032161372,0.004067587,0.0011583202,0.0011585999,0.016708095],"category_scores_gemma":[0.009956483,0.0007115391,0.000703686,0.0018723024,0.0030927057,0.008507027,0.0023298662,0.001965477,0.0023600492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097677264,0.00002467935,0.00027731483,0.0000325541,0.0000057310963,0.00014878105,0.0007009548,0.00075188215,0.0010119267,0.9860706,0.0008832678,0.009994557],"study_design_scores_gemma":[0.000008921359,0.000012615784,0.000069187656,0.000005323662,0.0000049435034,0.00008453266,0.00011550081,0.002798395,0.0005187202,0.9945045,0.0018668541,0.000010506107],"about_ca_topic_score_codex":0.0011173029,"about_ca_topic_score_gemma":0.0009939129,"teacher_disagreement_score":0.016708095,"about_ca_system_score_codex":0.0012461862,"about_ca_system_score_gemma":0.0009838477,"threshold_uncertainty_score":0.055894196},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028811575890706785,"score_gpt":0.24963177114746798,"score_spread":0.2208201952567612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006771561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14195526,0.002813536,0.67972594,0.017860016,0.00087026187,0.0005215972,0.0046272096,0.0027302958,0.1488959],"genre_scores_gemma":[0.78050524,0.0035195625,0.15959372,0.004484997,0.0020397445,0.0009844473,0.009099137,0.0018050749,0.037968162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99374133,0.001729977,0.0004991689,0.0017995099,0.0014504376,0.0007795022],"domain_scores_gemma":[0.95243645,0.032852743,0.0010920564,0.0069734845,0.0047476776,0.0018976488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058569782,0.0017089801,0.003404589,0.0049544508,0.007931065,0.008246262,0.0046095327,0.0042115166,0.018323183],"category_scores_gemma":[0.022160718,0.0032762385,0.006268322,0.0062815323,0.0096165165,0.04374237,0.009717498,0.015800213,0.0027670746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013922359,0.00016004851,0.00073738885,0.00026919408,0.000090491245,0.00012264455,0.0011617505,0.0018084171,0.0007591718,0.976004,0.006977018,0.011770536],"study_design_scores_gemma":[0.000022344157,0.000011065559,0.00014703961,0.000012865516,0.00004064583,0.00006761689,0.0001074273,0.0021970752,0.0005125512,0.9946695,0.002195816,0.000016179485],"about_ca_topic_score_codex":0.0031587456,"about_ca_topic_score_gemma":0.003113522,"teacher_disagreement_score":0.018323183,"about_ca_system_score_codex":0.0021479456,"about_ca_system_score_gemma":0.0031473374,"threshold_uncertainty_score":0.06129718},"labels":[],"label_agreement":null},{"id":"W2007291179","doi":"10.1016/j.jcss.2013.05.002","title":"An approach for lifetime reliability analysis using theorem proving","year":2013,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Reliability (semiconductor); Computer science; Calculus (dental); Mathematics; Automated theorem proving; Reliability engineering; Discrete mathematics; Algorithm; Engineering; Medicine; Physics; Thermodynamics","score_opus":0.035162649597970844,"score_gpt":0.30863702817940114,"score_spread":0.2734743785814303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007291179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041041974,0.00005617072,0.99853647,0.00005948617,0.00001747178,0.00003876295,0.000017142345,0.00022025265,0.00064380426],"genre_scores_gemma":[0.05120382,0.00034390026,0.94628805,0.0001455789,0.00008518577,0.00027908917,0.000096421216,0.00018663044,0.0013712036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99282855,0.0025599508,0.00050116674,0.0009025191,0.0027365333,0.00047124454],"domain_scores_gemma":[0.98394173,0.01035531,0.000686638,0.0033066988,0.0015559786,0.0001535627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009020761,0.0022454616,0.0015708108,0.0035293836,0.0015865021,0.0032363601,0.005071905,0.0018852887,0.00491751],"category_scores_gemma":[0.019857746,0.0013130384,0.004718376,0.0016639576,0.0034501264,0.0057236,0.0032966435,0.004615792,0.0016416985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091364745,0.00023069045,0.0008274282,0.00074631354,0.00028835537,0.00044477565,0.00040221753,0.108021006,0.010717479,0.7306484,0.003237057,0.14434487],"study_design_scores_gemma":[0.00004756319,0.00010023083,0.00015156114,0.00012377305,0.00018236609,0.00033049294,0.000052646097,0.36220908,0.009998305,0.61664104,0.010102929,0.00005991001],"about_ca_topic_score_codex":0.001656354,"about_ca_topic_score_gemma":0.0012821386,"teacher_disagreement_score":0.009020761,"about_ca_system_score_codex":0.0016598809,"about_ca_system_score_gemma":0.0028603843,"threshold_uncertainty_score":0.047706902},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01946566761545364,"score_gpt":0.2503981644689971,"score_spread":0.23093249685354345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007979101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40638074,0.0022623136,0.5647924,0.0036177796,0.0006678279,0.00019546408,0.00049676676,0.0049074143,0.016679306],"genre_scores_gemma":[0.6324877,0.00044142688,0.36079648,0.00029757665,0.0002520003,0.00023085428,0.0006558288,0.00036059768,0.0044775233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989623,0.00022736391,0.00009119409,0.00023468459,0.00027492046,0.00020944126],"domain_scores_gemma":[0.9924758,0.005810309,0.0002649382,0.0008857927,0.00038095834,0.0001821682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624984,0.0008682701,0.0015565827,0.00079893664,0.0013586722,0.0018110133,0.0016664815,0.001727907,0.0054999134],"category_scores_gemma":[0.010255691,0.00066605327,0.0008166677,0.0016815957,0.0014680449,0.0034150032,0.0012976015,0.00207283,0.0006886366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054789864,0.00024152323,0.0020881623,0.0004613429,0.00010940634,0.00039848525,0.00022383053,0.79730284,0.006186997,0.037579596,0.01263789,0.14222208],"study_design_scores_gemma":[0.0001017018,0.000043773784,0.00024643957,0.000010205123,0.000014854498,0.00005358317,0.00006230189,0.93878686,0.0023492912,0.057232987,0.0010902935,0.000007719344],"about_ca_topic_score_codex":0.005860194,"about_ca_topic_score_gemma":0.007488388,"teacher_disagreement_score":0.005860194,"about_ca_system_score_codex":0.0010950676,"about_ca_system_score_gemma":0.0017607379,"threshold_uncertainty_score":0.018399},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0303863753325897,"score_gpt":0.26605264278339785,"score_spread":0.23566626745080815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008334867","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019341648,0.00068707095,0.97431654,0.00010361746,0.0002445295,0.00010505525,0.000084229716,0.0028404507,0.0022768313],"genre_scores_gemma":[0.13998191,0.0007099656,0.84857064,0.00011883899,0.00018059314,0.00013174152,0.000436851,0.00019936796,0.009670123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992311,0.000065060514,0.00005786779,0.00014413618,0.00042435227,0.000077500976],"domain_scores_gemma":[0.9990656,0.0001462443,0.00005005033,0.000102962375,0.0006070466,0.000028212604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005558115,0.0009783906,0.00087669067,0.0015665144,0.0007236966,0.00096094044,0.0012922112,0.0008263643,0.0033989828],"category_scores_gemma":[0.0011586419,0.00039536651,0.00058972853,0.0011436179,0.00037072375,0.0009507915,0.0006677407,0.000888979,0.0021591913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002877378,0.00008070687,0.0008314757,0.00011545433,0.00004661188,0.00010973988,0.000059337803,0.0102473805,0.10862929,0.002426914,0.0037848079,0.87338054],"study_design_scores_gemma":[0.000054477867,0.00030977398,0.0051060366,0.00003809473,0.00017806597,0.001058018,0.000059515525,0.64266026,0.32620826,0.0018008455,0.022463748,0.00006291826],"about_ca_topic_score_codex":0.0033491945,"about_ca_topic_score_gemma":0.0032101045,"teacher_disagreement_score":0.0033989828,"about_ca_system_score_codex":0.00049809413,"about_ca_system_score_gemma":0.0009699992,"threshold_uncertainty_score":0.0113707185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023887283972343312,"score_gpt":0.28359252803897544,"score_spread":0.25970524406663215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010023761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035152536,0.0102464575,0.85826874,0.02046374,0.000683832,0.00004370558,0.00036225235,0.00036077158,0.07441786],"genre_scores_gemma":[0.84848267,0.010624497,0.114719026,0.0013029745,0.0019444328,0.00013089471,0.00025996217,0.00015996999,0.022375546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993648,0.00023921758,0.00002969193,0.0001311507,0.00019575901,0.000039501534],"domain_scores_gemma":[0.9968827,0.0019287879,0.00018944946,0.00039590805,0.00038873285,0.00021452294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081768696,0.00043342425,0.00073118036,0.0018728604,0.0006846237,0.0047588344,0.00090733054,0.0017077884,0.006271225],"category_scores_gemma":[0.004239302,0.0004182208,0.00043174424,0.0015391272,0.00223346,0.008280322,0.0013271448,0.0021644763,0.0007287977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014108632,0.000024014382,0.0005461019,0.00007818177,0.000031286683,0.00009473095,0.00012108384,0.015308725,0.00069480867,0.9624874,0.002098966,0.018500535],"study_design_scores_gemma":[0.0000046440173,0.000008780424,0.00035854153,0.000026834266,0.000010851086,0.000056550038,0.00008121498,0.070329696,0.00017168699,0.91947937,0.009464084,0.000007759567],"about_ca_topic_score_codex":0.0016310144,"about_ca_topic_score_gemma":0.0013182284,"teacher_disagreement_score":0.006271225,"about_ca_system_score_codex":0.00087032554,"about_ca_system_score_gemma":0.00055692194,"threshold_uncertainty_score":0.020979285},"labels":[],"label_agreement":null},{"id":"W2010870112","doi":"10.1016/j.jcss.2014.11.004","title":"Ambient and context-aware services","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Context (archaeology); Geography","score_opus":0.01909565252495155,"score_gpt":0.29356486006122334,"score_spread":0.2744692075362718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010870112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22281127,0.012172444,0.5338836,0.0044186264,0.0012124958,0.00015681326,0.00065666315,0.0027304662,0.22195761],"genre_scores_gemma":[0.95624954,0.0020081147,0.028623985,0.00026609818,0.0004566263,0.00002703292,0.00023779071,0.0000655688,0.012065171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999421,0.00013565573,0.000039631188,0.00010480935,0.00022105785,0.00007790634],"domain_scores_gemma":[0.99935955,0.00021528453,0.000056541885,0.0001323878,0.00013576246,0.00010035003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005940571,0.00035077386,0.00031935913,0.00059227063,0.0006741446,0.0031816727,0.00065807125,0.0010181313,0.0034657316],"category_scores_gemma":[0.0016020789,0.0002532732,0.00034532053,0.00084086333,0.00060099247,0.003444562,0.0016487177,0.0008809734,0.0007730345],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039781857,0.0004692413,0.011021163,0.00059838395,0.00017814062,0.0014103382,0.0023476467,0.017475229,0.032843113,0.54974234,0.016087472,0.36742917],"study_design_scores_gemma":[0.00006392038,0.0003314298,0.021131631,0.00031300564,0.00039509722,0.003072519,0.0031414113,0.21225838,0.017107433,0.4350188,0.30699882,0.0001675655],"about_ca_topic_score_codex":0.0024139602,"about_ca_topic_score_gemma":0.0028392463,"teacher_disagreement_score":0.0034657316,"about_ca_system_score_codex":0.00044757666,"about_ca_system_score_gemma":0.0005602978,"threshold_uncertainty_score":0.011594057},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.015463654187503464,"score_gpt":0.2579745793370556,"score_spread":0.24251092514955214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014277465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40569797,0.0031034674,0.38751101,0.0048292456,0.000796623,0.00017321724,0.0015850462,0.0024497276,0.1938536],"genre_scores_gemma":[0.8921758,0.000998623,0.06288162,0.0008910558,0.0007011912,0.00021078208,0.0014944922,0.00083955703,0.039806888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963683,0.0011281541,0.00036921055,0.0007402039,0.00097043306,0.00042380163],"domain_scores_gemma":[0.98649406,0.009331665,0.00075772806,0.002196457,0.0007955748,0.00042452553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014909932,0.0006979164,0.0011343035,0.0022821536,0.002089146,0.0037330678,0.0013255639,0.0021121316,0.013992274],"category_scores_gemma":[0.014685697,0.00088189344,0.0012266517,0.0025768518,0.0027313319,0.0058271484,0.0032710573,0.0029448492,0.0032232963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032312633,0.00006811096,0.0009976499,0.00016129529,0.000033555312,0.000401503,0.00069764844,0.0038845004,0.0047502634,0.93873906,0.005788275,0.044154935],"study_design_scores_gemma":[0.000021925483,0.00003874212,0.00031135054,0.000056674766,0.000026738935,0.00045054898,0.00009287798,0.012413646,0.004263508,0.97481245,0.0074901073,0.00002157951],"about_ca_topic_score_codex":0.00037299702,"about_ca_topic_score_gemma":0.00045247714,"teacher_disagreement_score":0.013992274,"about_ca_system_score_codex":0.0011192466,"about_ca_system_score_gemma":0.0007156296,"threshold_uncertainty_score":0.04680884},"labels":[],"label_agreement":null},{"id":"W2022890167","doi":"10.1016/j.jcss.2014.02.004","title":"Software control flow error detection and correlation with system performance deviation","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Software; Correlation; Control flow; Algorithm; Mathematics; Programming language","score_opus":0.0060708952855284696,"score_gpt":0.1935654384770278,"score_spread":0.18749454319149933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022890167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9819447,0.00023324104,0.016081734,0.00007403699,0.000033614477,0.00001888884,0.00019628338,0.0002636553,0.0011538289],"genre_scores_gemma":[0.99851865,0.000028877537,0.0011771859,0.000010362684,0.000013900435,0.000006210721,0.00008658368,0.000012796646,0.00014540029],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957146,0.001206778,0.00040117,0.00080968573,0.0015481563,0.00031952444],"domain_scores_gemma":[0.8487583,0.12179292,0.015572951,0.0050350986,0.007693436,0.0011473396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039844154,0.00042873537,0.00054119003,0.0022207026,0.00022648941,0.0009697533,0.0006035598,0.000979242,0.0012251858],"category_scores_gemma":[0.060789898,0.0004884299,0.00036749322,0.0019325137,0.0005874702,0.0010957433,0.0005354648,0.0016337826,0.0004355731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013147175,0.00027606153,0.9506347,0.000036575257,0.0001639685,0.0001634232,0.00019503837,0.015892306,0.0038233942,0.00044402023,0.0002944239,0.026761381],"study_design_scores_gemma":[0.000046976846,0.00086934824,0.70001185,0.000032518194,0.0001817376,0.0016828198,0.0001461066,0.28490505,0.010317339,0.0012086008,0.00052660744,0.0000709989],"about_ca_topic_score_codex":0.0015505627,"about_ca_topic_score_gemma":0.0012807259,"teacher_disagreement_score":0.0039844154,"about_ca_system_score_codex":0.00038713863,"about_ca_system_score_gemma":0.0005766829,"threshold_uncertainty_score":0.02107191},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05525673498615786,"score_gpt":0.26710998064801583,"score_spread":0.21185324566185798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024091095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4257094,0.003069245,0.47583622,0.0033764176,0.00029722435,0.00040315327,0.001484742,0.0033717805,0.08645191],"genre_scores_gemma":[0.93186533,0.0008505343,0.05067149,0.0005889676,0.00014260193,0.00023069404,0.0004943006,0.00028965142,0.014866437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987596,0.0001374218,0.00009769061,0.00036104792,0.00030351712,0.00034064482],"domain_scores_gemma":[0.99534875,0.0030463533,0.00035723718,0.0006602394,0.00027575443,0.0003116749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009472183,0.0008657315,0.0012383667,0.0013605879,0.0015246861,0.0053433115,0.0023739089,0.001762915,0.010116129],"category_scores_gemma":[0.008491115,0.0008334634,0.0010655274,0.0020634446,0.0022909532,0.010375978,0.003342251,0.0031774985,0.0010951734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051366916,0.000080649006,0.00070261554,0.00022211953,0.000033397988,0.00010007607,0.00040974526,0.007722741,0.005679635,0.93953633,0.0042296755,0.040769324],"study_design_scores_gemma":[0.000088812376,0.00003905191,0.0002966981,0.000044465578,0.00006157799,0.00015520427,0.00006728248,0.027930183,0.006436665,0.9612952,0.0035470903,0.000037788224],"about_ca_topic_score_codex":0.0015796294,"about_ca_topic_score_gemma":0.0025267426,"teacher_disagreement_score":0.010116129,"about_ca_system_score_codex":0.00436308,"about_ca_system_score_gemma":0.0017084203,"threshold_uncertainty_score":0.03384185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03262459263909213,"score_gpt":0.2570799605490312,"score_spread":0.22445536790993909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026139222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020520533,0.0008829713,0.95373243,0.0011438442,0.0005413071,0.00016519894,0.0026560728,0.011059416,0.009298194],"genre_scores_gemma":[0.23937547,0.0017611322,0.7151228,0.0011956155,0.0007372643,0.00043541592,0.0104417335,0.0076208166,0.023309743],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.990531,0.0020432633,0.0011644479,0.0015580021,0.004160445,0.000542885],"domain_scores_gemma":[0.9745746,0.0067233965,0.0015187712,0.011692479,0.0051514907,0.00033931684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007141,0.0006804311,0.0011841034,0.0029902789,0.0014936023,0.003978079,0.0023876557,0.0008087095,0.00593703],"category_scores_gemma":[0.025274837,0.0012200199,0.0018376943,0.0054537165,0.0019176133,0.0073661953,0.003371988,0.0024409893,0.003204097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064064446,0.00022997145,0.0054728836,0.00069762825,0.000251881,0.0007402862,0.0014485642,0.022548174,0.024007495,0.41579053,0.047981862,0.48019004],"study_design_scores_gemma":[0.00009259085,0.00011275728,0.0048594642,0.0002391499,0.00041805234,0.0011532233,0.00055798655,0.15792173,0.15401685,0.4796424,0.20080239,0.00018344707],"about_ca_topic_score_codex":0.0045303255,"about_ca_topic_score_gemma":0.005452336,"teacher_disagreement_score":0.007141,"about_ca_system_score_codex":0.0016999162,"about_ca_system_score_gemma":0.0039051494,"threshold_uncertainty_score":0.037765622},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06961559235493293,"score_gpt":0.3323560924359493,"score_spread":0.2627405000810164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029854525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36098495,0.0024332588,0.60413,0.004247173,0.00037299047,0.00060308486,0.0026657102,0.0050112987,0.019551404],"genre_scores_gemma":[0.6311157,0.001291734,0.3464901,0.0009326407,0.00050891034,0.00046634994,0.007504696,0.00143411,0.010255772],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974739,0.0005654928,0.00014036374,0.00075684575,0.00048970134,0.0005737766],"domain_scores_gemma":[0.9835835,0.0099538015,0.0011965049,0.0033659148,0.0009440671,0.00095614465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026398054,0.0025074303,0.0030970208,0.002737481,0.0027202195,0.006190877,0.0070630494,0.003346749,0.011798351],"category_scores_gemma":[0.017351933,0.0017473482,0.003046453,0.004355425,0.0015999806,0.009927894,0.0033568463,0.004235793,0.0019603905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057985056,0.0029341066,0.0122994995,0.0014600571,0.0005174755,0.0003383356,0.0015853969,0.29181644,0.009254125,0.17912297,0.056738745,0.4381344],"study_design_scores_gemma":[0.000600214,0.00024968365,0.0014867826,0.00008688572,0.0002847808,0.0005170754,0.00038563594,0.72869456,0.0035318309,0.25768593,0.006432117,0.000044475004],"about_ca_topic_score_codex":0.0049868836,"about_ca_topic_score_gemma":0.009249376,"teacher_disagreement_score":0.011798351,"about_ca_system_score_codex":0.0043967343,"about_ca_system_score_gemma":0.0033474998,"threshold_uncertainty_score":0.03946942},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"String (physics); Mathematics; Combinatorics; Computer science; Theoretical physics; Physics","score_opus":0.0543624952810548,"score_gpt":0.23728972868137221,"score_spread":0.1829272334003174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032287082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046577575,0.0006010567,0.9864053,0.0011236822,0.00027221808,0.00004451358,0.00010679099,0.00017608637,0.006612556],"genre_scores_gemma":[0.16878271,0.0021454403,0.8065449,0.0009458974,0.0012497354,0.00028443412,0.0007405037,0.0004069488,0.018899411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967064,0.0013045309,0.00022689375,0.00050367316,0.0010570277,0.0002014485],"domain_scores_gemma":[0.9942729,0.003519197,0.00026007686,0.00096171326,0.00073001144,0.0002561595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025505072,0.00083931716,0.0021196716,0.0029807081,0.0017941514,0.0034479515,0.005262809,0.005250611,0.014704579],"category_scores_gemma":[0.015971325,0.00065445487,0.0018100791,0.0052102576,0.0026790216,0.00760388,0.0046937005,0.004944895,0.0033814202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018783797,0.0001689448,0.00035331812,0.00023646957,0.0000717606,0.0002492718,0.00022262106,0.11479113,0.0014157722,0.73718745,0.011399405,0.13371602],"study_design_scores_gemma":[0.000034610042,0.000045237834,0.000053883294,0.000024727091,0.000014313234,0.00013839068,0.000059151796,0.3872999,0.00054717244,0.6065929,0.005163289,0.000026478123],"about_ca_topic_score_codex":0.0016862634,"about_ca_topic_score_gemma":0.0010288149,"teacher_disagreement_score":0.014704579,"about_ca_system_score_codex":0.0011900471,"about_ca_system_score_gemma":0.0015218585,"threshold_uncertainty_score":0.049191713},"labels":[],"label_agreement":null},{"id":"W2034920294","doi":"10.1016/j.jcss.2005.08.003","title":"The many faces of a translation","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Translation (biology); Computer science; Artificial intelligence; Chemistry","score_opus":0.016951275936972193,"score_gpt":0.24134541833644,"score_spread":0.2243941423994678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034920294","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053878047,0.01129065,0.20359702,0.20837063,0.0123241125,0.000084688785,0.00075062964,0.00081854773,0.50888574],"genre_scores_gemma":[0.73215085,0.007522014,0.082185164,0.01776415,0.011078841,0.000338087,0.00060393976,0.0007611207,0.14759585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974819,0.0010380555,0.00017455136,0.0004739495,0.00059141935,0.00024008894],"domain_scores_gemma":[0.99383634,0.0034315302,0.00023565494,0.0013957601,0.00078655843,0.00031410367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002715427,0.00058333215,0.000821961,0.0011687619,0.004979396,0.008243993,0.0010063282,0.0035750975,0.03243307],"category_scores_gemma":[0.014028174,0.0005521749,0.00084339705,0.0013560724,0.011182819,0.022232782,0.004805085,0.0049039163,0.006515168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022133712,0.0000037375728,0.00004691708,0.000021643225,0.0000034412897,0.000058898688,0.00044072457,0.000076263976,0.00016602312,0.9848045,0.0064839125,0.007871754],"study_design_scores_gemma":[0.000008043751,0.000004077156,0.00003515538,0.000019049014,0.0000032957291,0.00008234296,0.00030797807,0.00040700045,0.000098739016,0.9760395,0.022986246,0.000008472713],"about_ca_topic_score_codex":0.0005885659,"about_ca_topic_score_gemma":0.0005163717,"teacher_disagreement_score":0.03243307,"about_ca_system_score_codex":0.0010497001,"about_ca_system_score_gemma":0.0008043507,"threshold_uncertainty_score":0.10849941},"labels":[],"label_agreement":null},{"id":"W2037307735","doi":"10.1016/j.jcss.2007.03.007","title":"Optimal spaced seeds for faster approximate string matching","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"String (physics); Mathematics; Matching (statistics); Mathematical optimization; Computer science; Combinatorics; Statistics","score_opus":0.02193825351894405,"score_gpt":0.27304516477516255,"score_spread":0.2511069112562185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037307735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045246698,0.00087029097,0.94686806,0.00030415112,0.00032161822,0.0001423122,0.00023394788,0.0030817029,0.0029312326],"genre_scores_gemma":[0.18838288,0.00026814002,0.8062435,0.00018335099,0.000117476986,0.00016711072,0.00062345964,0.000334411,0.003679624],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981583,0.00047155516,0.00015721812,0.0003314911,0.0007451604,0.00013641981],"domain_scores_gemma":[0.9950251,0.0021996922,0.00030814073,0.0016741591,0.00061602524,0.00017688875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014439258,0.0008650149,0.001819699,0.0020165865,0.00077835965,0.0013646173,0.0015595728,0.0020186785,0.008516471],"category_scores_gemma":[0.012469167,0.00070184964,0.0006308823,0.003492477,0.00082872645,0.0028680149,0.002283519,0.001421713,0.003461359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024757588,0.0004633138,0.0016183538,0.00031289016,0.00008388173,0.00038086306,0.00027870046,0.10244175,0.05350361,0.06364508,0.015236417,0.7595594],"study_design_scores_gemma":[0.00029427154,0.00033268085,0.00046234834,0.000047982787,0.000038392598,0.0005384224,0.00011618286,0.8851247,0.034975085,0.06927939,0.008753537,0.000036981706],"about_ca_topic_score_codex":0.00095894065,"about_ca_topic_score_gemma":0.0021433777,"teacher_disagreement_score":0.008516471,"about_ca_system_score_codex":0.0008204737,"about_ca_system_score_gemma":0.0016905554,"threshold_uncertainty_score":0.028490424},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05730906861657043,"score_gpt":0.2577674707612815,"score_spread":0.20045840214471106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037968786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43663928,0.0046480345,0.50079787,0.014463314,0.0005997009,0.0005808231,0.0057982584,0.002166563,0.034306157],"genre_scores_gemma":[0.8142553,0.0022624368,0.1627016,0.0010550735,0.0009470225,0.0006897203,0.0073014423,0.0010696105,0.0097177075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99272376,0.0025877745,0.0005173686,0.0014918245,0.0016245055,0.0010547779],"domain_scores_gemma":[0.9297576,0.058294192,0.002782638,0.0056228577,0.0021866893,0.0013559826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051308484,0.0017674092,0.0035876369,0.0019526203,0.0026016196,0.007427807,0.005469713,0.003579617,0.015023544],"category_scores_gemma":[0.05108801,0.001196134,0.0025023357,0.005442751,0.0034736537,0.02141277,0.0038853975,0.0054890844,0.001349185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002381964,0.0006945009,0.0049524764,0.00086571823,0.00035934252,0.00039977528,0.0007780174,0.5859976,0.0031868548,0.28543827,0.02277924,0.09216627],"study_design_scores_gemma":[0.00019170067,0.000093520255,0.0006455039,0.00004530969,0.000074670716,0.00012658286,0.00021372974,0.6025651,0.00086898124,0.39323103,0.0019074628,0.000036392223],"about_ca_topic_score_codex":0.0060208924,"about_ca_topic_score_gemma":0.006233648,"teacher_disagreement_score":0.015023544,"about_ca_system_score_codex":0.0057405955,"about_ca_system_score_gemma":0.006525215,"threshold_uncertainty_score":0.050258815},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01952030531597196,"score_gpt":0.27433301713273067,"score_spread":0.2548127118167587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038255135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099793896,0.008720635,0.74091595,0.009567958,0.0006640206,0.00029571133,0.0018492131,0.002103498,0.13608912],"genre_scores_gemma":[0.7692504,0.0073041487,0.17606051,0.0024545272,0.0011524545,0.00084641424,0.0028164075,0.0021621613,0.037952997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589795,0.001284562,0.00013632067,0.0005270324,0.0010619238,0.0010922062],"domain_scores_gemma":[0.94327,0.045783456,0.0017503038,0.004719265,0.0021183444,0.0023585514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006776536,0.0030770586,0.005326301,0.0051947227,0.0039003284,0.008227144,0.010229552,0.0059460416,0.02626658],"category_scores_gemma":[0.045613255,0.0018108089,0.0028857614,0.0057825735,0.005003756,0.016047403,0.006973953,0.009122525,0.0033378666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058971805,0.0002862106,0.0007430368,0.0005416121,0.00010046899,0.00013867472,0.00025570748,0.15451083,0.0016758085,0.7991844,0.017370572,0.024602989],"study_design_scores_gemma":[0.000046321184,0.00005113146,0.00014081664,0.0000804882,0.000059935148,0.00008275634,0.00005480449,0.44714245,0.00066507055,0.5500683,0.0015643027,0.000043533444],"about_ca_topic_score_codex":0.0034812915,"about_ca_topic_score_gemma":0.005659304,"teacher_disagreement_score":0.02626658,"about_ca_system_score_codex":0.005798754,"about_ca_system_score_gemma":0.0048989714,"threshold_uncertainty_score":0.08787042},"labels":[],"label_agreement":null},{"id":"W2039116808","doi":"10.1006/jcss.2001.1764","title":"On the Complexity of Some Problems on Groups Input as Multiplication Tables","year":2001,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Iterated function; Multiplication (music); Abelian group; Group (periodic table); Combinatorics; Nilpotent; Associative property; Discrete mathematics; Binary number; Arithmetic; Pure mathematics","score_opus":0.06203262370306753,"score_gpt":0.26828629767360634,"score_spread":0.20625367397053881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039116808","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8092277,0.0020407909,0.1254017,0.015252197,0.00035253735,0.00057554233,0.004195964,0.0017025919,0.04125104],"genre_scores_gemma":[0.896874,0.000833249,0.08502843,0.00086196215,0.0007052172,0.00035655196,0.00375005,0.0006206622,0.010969923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935336,0.002081628,0.00038078873,0.001069619,0.001585009,0.0013493273],"domain_scores_gemma":[0.8592752,0.12862338,0.0035129776,0.004841231,0.0020769911,0.0016703272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048622536,0.0018349,0.0026205697,0.0022951434,0.0032743753,0.008516548,0.0037809054,0.0040158243,0.019943882],"category_scores_gemma":[0.047852825,0.0012191747,0.0025952603,0.004813728,0.0036985467,0.015870707,0.0038049966,0.005562954,0.0010996273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062887208,0.0018883379,0.01622337,0.0016607306,0.00055571116,0.0010019791,0.0018100153,0.50451654,0.0071049025,0.2963911,0.052524853,0.110033706],"study_design_scores_gemma":[0.00046823683,0.00017421009,0.00239736,0.00007645521,0.0001633563,0.0003488396,0.00044526724,0.5903552,0.0034176926,0.39929983,0.0027745357,0.000078982725],"about_ca_topic_score_codex":0.0066121067,"about_ca_topic_score_gemma":0.008730153,"teacher_disagreement_score":0.019943882,"about_ca_system_score_codex":0.006302265,"about_ca_system_score_gemma":0.00418858,"threshold_uncertainty_score":0.066718996},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01999543691972397,"score_gpt":0.26307757735784293,"score_spread":0.24308214043811896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040761679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07452733,0.0023364648,0.8818757,0.011975454,0.0005897114,0.0004640937,0.014195885,0.0037002242,0.010335116],"genre_scores_gemma":[0.47425932,0.0014314165,0.47407886,0.0024096475,0.0010853816,0.001316286,0.025333334,0.0009666214,0.019119084],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754673,0.00049578416,0.00022435382,0.0009914737,0.00044426843,0.00029734467],"domain_scores_gemma":[0.9922368,0.005452913,0.00054111157,0.0009900499,0.0005700794,0.00020895617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021388473,0.001700486,0.0043305703,0.0015207372,0.0013503991,0.003972821,0.0033728562,0.004479677,0.012707036],"category_scores_gemma":[0.011291747,0.0012546015,0.0025157544,0.0030394706,0.0013991912,0.0067435647,0.0024966258,0.0039319806,0.002646503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010721695,0.0008310355,0.0024401243,0.002478352,0.00048675822,0.0006037943,0.00022389415,0.14053763,0.005163421,0.032729384,0.13081741,0.68261606],"study_design_scores_gemma":[0.000432821,0.00041574793,0.0025218937,0.00013664018,0.00012579795,0.00067870057,0.00023935767,0.6252618,0.0035283146,0.35353914,0.013033363,0.00008637642],"about_ca_topic_score_codex":0.002912152,"about_ca_topic_score_gemma":0.0031419771,"teacher_disagreement_score":0.012707036,"about_ca_system_score_codex":0.001280274,"about_ca_system_score_gemma":0.0023359947,"threshold_uncertainty_score":0.042509258},"labels":[],"label_agreement":null},{"id":"W2042644003","doi":"10.1016/j.jcss.2011.10.014","title":"An improved approximation algorithm for the complementary maximal strip recovery problem","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Mathematics; Approximation algorithm; Combinatorics; Sequence (biology); Set (abstract data type); Algorithm; Discrete mathematics; Computer science","score_opus":0.02802862343456994,"score_gpt":0.25095938606182633,"score_spread":0.2229307626272564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042644003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03203152,0.00028296956,0.9578514,0.00059411384,0.000138953,0.00021054316,0.00035114514,0.0019527551,0.0065866127],"genre_scores_gemma":[0.13687368,0.00017885193,0.8560273,0.0002277277,0.00009622094,0.0002913826,0.0012091546,0.0003339764,0.0047617056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877685,0.00025768433,0.000063300446,0.00029498522,0.00035190867,0.00025514312],"domain_scores_gemma":[0.99758124,0.0012540442,0.00014109006,0.0005848071,0.00028301546,0.00015583994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012259264,0.0012816449,0.0019325082,0.0013603035,0.0011136698,0.002171248,0.003768438,0.0021337222,0.012542156],"category_scores_gemma":[0.0048483307,0.0007118644,0.0013246962,0.002568237,0.0009320594,0.0034512794,0.003062533,0.0030009344,0.0021690114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014570397,0.00081547064,0.0012898609,0.00048919045,0.00015046772,0.00027880317,0.0003375926,0.31603366,0.014557468,0.06629533,0.03249973,0.56579524],"study_design_scores_gemma":[0.00023788623,0.00010504541,0.00025407647,0.000019432075,0.00004182101,0.00013520473,0.00010091227,0.95583034,0.0025160962,0.037176743,0.0035599407,0.000022477245],"about_ca_topic_score_codex":0.004699418,"about_ca_topic_score_gemma":0.00591704,"teacher_disagreement_score":0.012542156,"about_ca_system_score_codex":0.0013825775,"about_ca_system_score_gemma":0.0028253412,"threshold_uncertainty_score":0.041957676},"labels":[],"label_agreement":null},{"id":"W2043428776","doi":"10.1016/j.jcss.2010.08.010","title":"The set of realizations of a max-plus linear sequence is semi-polyhedral","year":2010,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Sequence (biology); Commutative property; Idempotence; Realization (probability); Minimal realization; Set (abstract data type); Combinatorics; Finite set; Dimension (graph theory); Discrete mathematics; Linear system; Computer science; Mathematical analysis","score_opus":0.027516310816995872,"score_gpt":0.28420510693619794,"score_spread":0.2566887961192021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043428776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31724855,0.00043124755,0.62836313,0.0009199272,0.00022046996,0.00014228522,0.0027122046,0.00096784503,0.04899433],"genre_scores_gemma":[0.9082315,0.0004716758,0.067680895,0.00028914667,0.00018199297,0.00035467552,0.003452408,0.00021934629,0.019118365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848783,0.00026905534,0.000115761,0.00038852642,0.00047532443,0.00026346336],"domain_scores_gemma":[0.9963043,0.0017886154,0.00041708347,0.00034500487,0.0007411869,0.00040375508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008955546,0.00093636266,0.0012307398,0.0012682913,0.0017401925,0.0042063105,0.0011357664,0.0011439404,0.0073423744],"category_scores_gemma":[0.0032243088,0.0007491419,0.0010716149,0.0010020966,0.0024127294,0.0034435487,0.0014206338,0.002419653,0.0014451857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037109834,0.0001102354,0.00080252707,0.00011339933,0.000058614292,0.00022116184,0.00021237876,0.013145838,0.0053897593,0.9620151,0.0019980653,0.015561979],"study_design_scores_gemma":[0.000060077586,0.00015699423,0.0005201353,0.000045120647,0.000022436467,0.00023471513,0.0001497638,0.055241514,0.0040280316,0.9347194,0.004773164,0.00004872484],"about_ca_topic_score_codex":0.0010126657,"about_ca_topic_score_gemma":0.0009677187,"teacher_disagreement_score":0.0073423744,"about_ca_system_score_codex":0.0011539216,"about_ca_system_score_gemma":0.0013100604,"threshold_uncertainty_score":0.024562657},"labels":[],"label_agreement":null},{"id":"W2044832252","doi":"10.1016/j.jcss.2003.11.003","title":"Implicit B-trees: a new data structure for the dictionary problem","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Data structure; Computer science; Block (permutation group theory); Combinatorics; Conjecture; Hierarchy; Theoretical computer science; B-tree; Auxiliary memory; Tree (set theory); Arithmetic; Discrete mathematics; Algorithm; Mathematics; Programming language","score_opus":0.033671350161060286,"score_gpt":0.28101301593193784,"score_spread":0.24734166577087754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044832252","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041890037,0.00055504736,0.99212426,0.00049079664,0.00019382266,0.00004459333,0.00045736,0.00066542317,0.0012796713],"genre_scores_gemma":[0.048078343,0.0010950889,0.94452244,0.00038664925,0.0004050307,0.00019633038,0.0015680471,0.00054446806,0.0032035983],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984108,0.0004371275,0.00014306318,0.0002532362,0.00064036483,0.000115422146],"domain_scores_gemma":[0.9947737,0.0019317531,0.0003567961,0.0015997685,0.0010429427,0.00029500542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013307673,0.00065153115,0.001733452,0.0023980697,0.0013350256,0.0027489902,0.0028657494,0.0024532543,0.006605379],"category_scores_gemma":[0.0134229,0.0008008761,0.0007717064,0.005543728,0.0014498181,0.006549353,0.0040168865,0.004001384,0.0040752613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004863789,0.00016527629,0.0011265129,0.0004832573,0.00006387172,0.0002097417,0.00045050637,0.025706802,0.010178885,0.30217716,0.039742053,0.6192095],"study_design_scores_gemma":[0.00016856992,0.0002544973,0.00031361973,0.00014180683,0.00004888781,0.00063555344,0.00018943466,0.39566478,0.006318763,0.5248971,0.07128405,0.00008289176],"about_ca_topic_score_codex":0.0013579392,"about_ca_topic_score_gemma":0.0017918309,"teacher_disagreement_score":0.006605379,"about_ca_system_score_codex":0.00043760505,"about_ca_system_score_gemma":0.0014354693,"threshold_uncertainty_score":0.02209723},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.026529906452372357,"score_gpt":0.2698352296278049,"score_spread":0.24330532317543252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045244401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64578205,0.0007510817,0.3432447,0.0006555188,0.0007066503,0.00044633553,0.0010588025,0.0023341777,0.005020681],"genre_scores_gemma":[0.9702556,0.000077667304,0.027859764,0.000023907327,0.00007869899,0.000038294955,0.0002642541,0.00001748904,0.0013843416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936911,0.0022764918,0.00062933366,0.0008724642,0.0018528225,0.00067779445],"domain_scores_gemma":[0.9591695,0.01981974,0.004948449,0.007420041,0.0075246296,0.0011176069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047674626,0.0005042456,0.0009009118,0.002197944,0.0011018777,0.0020294336,0.00080138876,0.0014379156,0.0027253274],"category_scores_gemma":[0.030812465,0.00022191223,0.00040240868,0.0013556476,0.00056120055,0.0023215471,0.001511363,0.001043639,0.002001038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062150173,0.0011071534,0.07369824,0.0007344205,0.00029635333,0.001288553,0.001425277,0.033997457,0.1013377,0.018952329,0.0067626317,0.75418484],"study_design_scores_gemma":[0.000106341824,0.0007803144,0.025099391,0.0000991594,0.00012455547,0.000998581,0.0007300801,0.86669785,0.088780746,0.012448892,0.0040313834,0.00010275489],"about_ca_topic_score_codex":0.000605089,"about_ca_topic_score_gemma":0.00058494054,"teacher_disagreement_score":0.0047674626,"about_ca_system_score_codex":0.00056124706,"about_ca_system_score_gemma":0.0013031723,"threshold_uncertainty_score":0.025213063},"labels":[],"label_agreement":null},{"id":"W2045328782","doi":"10.1016/j.jcss.2014.04.016","title":"Editorial: Special Issue on Theory and Applications in Parallel and Distributed Computing Systems","year":2014,"lang":"en","type":"editorial","venue":"Journal of Computer and System Sciences","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Theoretical computer science","score_opus":0.0066597253595863885,"score_gpt":0.24504602169195733,"score_spread":0.23838629633237093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045328782","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022320524,0.0027941065,0.00011886394,0.013588122,0.98241055,0.000011280562,0.00002466191,0.00003141056,0.000998667],"genre_scores_gemma":[0.0002753939,0.0017363039,0.000084706066,0.0049544415,0.98701453,0.000013015519,0.000021491749,0.00003232318,0.0058677373],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9931324,0.0009934433,0.0007344527,0.0008125224,0.003835521,0.0004916265],"domain_scores_gemma":[0.9711921,0.009827207,0.0020698104,0.00081408233,0.012070836,0.0040259026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007793653,0.0052025844,0.0065337317,0.0072567943,0.0041505303,0.011438828,0.004142076,0.015257625,0.02347412],"category_scores_gemma":[0.028060695,0.001551607,0.0038442835,0.0026186535,0.0029531438,0.005030633,0.0023148078,0.017451042,0.013055938],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033767166,0.000017646584,0.000021447064,0.00014752256,0.000024520967,0.000079443074,0.00000593172,0.00003986284,0.0000537829,0.00029433705,0.99526864,0.00401295],"study_design_scores_gemma":[0.000114786126,0.00004944872,0.0004134195,0.00036624874,0.00011058663,0.00026624335,0.000035558438,0.00051612675,0.000156127,0.0026323916,0.9953117,0.000027488519],"about_ca_topic_score_codex":0.0011606562,"about_ca_topic_score_gemma":0.004646746,"teacher_disagreement_score":0.02347412,"about_ca_system_score_codex":0.0037554367,"about_ca_system_score_gemma":0.0033813978,"threshold_uncertainty_score":0.07852876},"labels":[],"label_agreement":null},{"id":"W2047502228","doi":"10.1016/j.jcss.2007.03.002","title":"View disassembly: A rewrite that extracts portions of views","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Class (philosophy); Theoretical computer science; Task (project management); Cover (algebra); Cache; Materialized view; Matching (statistics); Table (database); Information retrieval; Artificial intelligence; Database; Mathematics; View; Parallel computing","score_opus":0.053639016463828626,"score_gpt":0.31413215651623083,"score_spread":0.2604931400524022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047502228","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019214163,0.0006668823,0.8362558,0.00045068856,0.0005634474,0.00049721147,0.003887656,0.12552129,0.012942852],"genre_scores_gemma":[0.17926782,0.0009028032,0.69960946,0.0012672113,0.00035643342,0.0003897488,0.015308427,0.0811729,0.021725222],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977309,0.00030962998,0.0002489283,0.00045682339,0.0010007267,0.00025301237],"domain_scores_gemma":[0.9942368,0.0023253283,0.0002522283,0.0021634626,0.00085441564,0.00016768218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013513506,0.0022975435,0.001718771,0.0016681603,0.0008052691,0.0025898744,0.0025917683,0.0017005961,0.015080063],"category_scores_gemma":[0.008658045,0.002116793,0.0022445119,0.0013339511,0.0012255196,0.005003581,0.0036219505,0.0028568057,0.006318441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015050238,0.00045099916,0.004852667,0.0018259432,0.0005018797,0.0025477395,0.0027010795,0.006277617,0.117052175,0.0405992,0.22875947,0.59292626],"study_design_scores_gemma":[0.00048068582,0.00052041246,0.0037983826,0.00049491914,0.0010342438,0.00233925,0.0017659134,0.1173732,0.35337088,0.073550075,0.44480163,0.00047043734],"about_ca_topic_score_codex":0.004688462,"about_ca_topic_score_gemma":0.006126485,"teacher_disagreement_score":0.015080063,"about_ca_system_score_codex":0.00053935853,"about_ca_system_score_gemma":0.001462394,"threshold_uncertainty_score":0.05044782},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.033128919041031754,"score_gpt":0.25258260196016785,"score_spread":0.21945368291913608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047794824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5914773,0.0038713005,0.32984486,0.0070753666,0.0002743361,0.000070219154,0.0005061298,0.00054492,0.06633558],"genre_scores_gemma":[0.9723096,0.00075567706,0.02267772,0.00017246952,0.00023564954,0.000037092133,0.00019050605,0.00014020469,0.0034810558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999169,0.00025775723,0.000047014822,0.00018866915,0.00023017674,0.0001073867],"domain_scores_gemma":[0.9731469,0.021709656,0.0015837067,0.0017206211,0.00086362415,0.0009753697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016012898,0.00044673207,0.0014399792,0.0016141336,0.0015149768,0.003907469,0.0023206882,0.0023717291,0.008303841],"category_scores_gemma":[0.025139231,0.00087131007,0.0009627963,0.0014597032,0.0042546275,0.0075809103,0.0019966005,0.0025458073,0.00067624974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005856727,0.000025305382,0.0014007249,0.00006823454,0.00001983762,0.00021475875,0.00022094544,0.037058212,0.0014441182,0.94956446,0.0012846667,0.008640235],"study_design_scores_gemma":[0.000016673685,0.000012117008,0.000721626,0.000010050508,0.000010292657,0.00020849075,0.000044765493,0.07981915,0.00018243858,0.9182185,0.00073992764,0.00001601301],"about_ca_topic_score_codex":0.0010587354,"about_ca_topic_score_gemma":0.000993265,"teacher_disagreement_score":0.008303841,"about_ca_system_score_codex":0.0010546403,"about_ca_system_score_gemma":0.00064510456,"threshold_uncertainty_score":0.027779162},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10570888928428386,"score_gpt":0.33144506100960225,"score_spread":0.2257361717253184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051028069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21399619,0.00822619,0.6965058,0.013950706,0.0010296087,0.0009787044,0.0065743458,0.004338326,0.054400112],"genre_scores_gemma":[0.6303601,0.0078070504,0.28800166,0.0051264088,0.005697992,0.001777112,0.018462509,0.0031386053,0.039628554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922769,0.0015257075,0.0005384776,0.0021358964,0.0018377466,0.0016853244],"domain_scores_gemma":[0.94462764,0.03820443,0.0030047682,0.009690098,0.0025695434,0.001903594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004157807,0.004156761,0.006141479,0.004064625,0.0032596984,0.00930065,0.0087187495,0.0062285964,0.01937025],"category_scores_gemma":[0.035438005,0.0018797257,0.007871991,0.0072808014,0.004935041,0.026786618,0.0068046665,0.011165589,0.0032563615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025418117,0.0013379661,0.0061447443,0.002570001,0.00041456122,0.0004446494,0.0012339788,0.115720786,0.011117514,0.51844853,0.09558494,0.24444047],"study_design_scores_gemma":[0.00022776994,0.00026962283,0.0024230198,0.000121957644,0.00025061026,0.0006149181,0.00030874636,0.17235072,0.004117335,0.81105536,0.00812298,0.0001369731],"about_ca_topic_score_codex":0.0025053227,"about_ca_topic_score_gemma":0.0025679888,"teacher_disagreement_score":0.01937025,"about_ca_system_score_codex":0.0039272155,"about_ca_system_score_gemma":0.0042831535,"threshold_uncertainty_score":0.064799964},"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"},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.050430558016814044,"score_gpt":0.2647240296950133,"score_spread":0.21429347167819926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053743126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69982517,0.003955237,0.28890207,0.0009148869,0.0004007849,0.00025487758,0.0010022274,0.0013502899,0.0033945055],"genre_scores_gemma":[0.7731761,0.0012589603,0.21732157,0.00038150512,0.00042004243,0.00014722957,0.0029343145,0.00020416117,0.0041560936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990262,0.00010640094,0.000103032966,0.00027927302,0.00039112702,0.00009397869],"domain_scores_gemma":[0.9974246,0.0010490783,0.00041096564,0.00047664167,0.00045920615,0.00017962049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125258,0.0007232936,0.001198863,0.0043164585,0.0013822713,0.0010371731,0.0010127482,0.0017668599,0.003174988],"category_scores_gemma":[0.004293627,0.000474742,0.0007319643,0.0038027398,0.00083175604,0.0018747438,0.0010830681,0.0010072422,0.0013270495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028733355,0.00085415016,0.02799882,0.0010445603,0.0004540601,0.005900218,0.0011759677,0.02216006,0.3670491,0.012357355,0.005962624,0.55216974],"study_design_scores_gemma":[0.00044402084,0.003313964,0.048994433,0.0003734583,0.0011810996,0.021721527,0.0031786275,0.5418472,0.2659518,0.07395004,0.038818605,0.0002252262],"about_ca_topic_score_codex":0.00084457797,"about_ca_topic_score_gemma":0.001570126,"teacher_disagreement_score":0.0043164585,"about_ca_system_score_codex":0.00034551413,"about_ca_system_score_gemma":0.000679385,"threshold_uncertainty_score":0.0106214285},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031997160919846224,"score_gpt":0.21991453948585216,"score_spread":0.18791737856600593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057559629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24095936,0.0056209546,0.697873,0.014702872,0.0003083432,0.00015461045,0.0014708113,0.0010694086,0.037840653],"genre_scores_gemma":[0.9055136,0.0027025065,0.07486797,0.0010441019,0.00080730586,0.00051436404,0.0015238003,0.0007700774,0.0122562535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893154,0.0036878043,0.0006844638,0.0020088733,0.0026668431,0.0016365047],"domain_scores_gemma":[0.8525334,0.1289188,0.003203516,0.010432042,0.0025551594,0.0023571423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007934341,0.0017789156,0.0033640903,0.0035150524,0.0035194445,0.01246558,0.0069581657,0.004235059,0.012137904],"category_scores_gemma":[0.045811195,0.0026011742,0.004526863,0.0059163757,0.009797204,0.04334599,0.009693744,0.017336491,0.0013189574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002622098,0.00018309821,0.0011703414,0.00020877353,0.000061360515,0.00013172119,0.0009320583,0.021977974,0.0012058918,0.95666957,0.002650853,0.014546152],"study_design_scores_gemma":[0.000015020971,0.000016596807,0.00017066397,0.000018276627,0.000029850758,0.00005020671,0.00007688673,0.042418025,0.0005912254,0.9559954,0.00059276866,0.000025030524],"about_ca_topic_score_codex":0.0023943447,"about_ca_topic_score_gemma":0.0023880543,"teacher_disagreement_score":0.01246558,"about_ca_system_score_codex":0.0066153244,"about_ca_system_score_gemma":0.0029686252,"threshold_uncertainty_score":0.047997773},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05440909133257375,"score_gpt":0.293218237044864,"score_spread":0.23880914571229023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062671967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026562745,0.010020486,0.9141059,0.012329882,0.000700959,0.0002842174,0.00073124096,0.003295328,0.031969335],"genre_scores_gemma":[0.5587479,0.008991348,0.3966438,0.00629099,0.0030227003,0.0011464678,0.0013574283,0.0048384606,0.018961007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.964872,0.0099889245,0.0017307681,0.005672005,0.011576425,0.006159866],"domain_scores_gemma":[0.60763407,0.34408572,0.0058848117,0.029368943,0.0073260725,0.005700343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026251486,0.0049057105,0.0061155367,0.007220441,0.0032310206,0.0146106705,0.010405834,0.00904359,0.01858016],"category_scores_gemma":[0.22050567,0.0051669586,0.006070323,0.007180035,0.010611296,0.04105743,0.013528566,0.031052077,0.0052458714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020937985,0.00078905385,0.003727982,0.0019055255,0.00034692866,0.0003614933,0.0009550284,0.09868736,0.015081297,0.6882346,0.026129132,0.1616879],"study_design_scores_gemma":[0.00011005107,0.00022927996,0.00069062586,0.00036531893,0.00020106276,0.00033281196,0.00011834522,0.3218755,0.008001424,0.6624849,0.005488024,0.000102682236],"about_ca_topic_score_codex":0.0020242166,"about_ca_topic_score_gemma":0.002760963,"teacher_disagreement_score":0.026251486,"about_ca_system_score_codex":0.009107842,"about_ca_system_score_gemma":0.007143813,"threshold_uncertainty_score":0.13883275},"labels":[],"label_agreement":null},{"id":"W2064113406","doi":"10.1016/j.jcss.2012.06.001","title":"Space and speed tradeoffs in TCAM hierarchical packet classification","year":2012,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Content-addressable memory; Network packet; The Internet; Hierarchy; Quality of service; Software-defined networking; Throughput; Distributed computing; Computer network; Artificial intelligence; World Wide Web; Artificial neural network; Operating system","score_opus":0.03052033678092598,"score_gpt":0.263910897751214,"score_spread":0.23339056097028804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064113406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7495332,0.0044174846,0.22656128,0.002630436,0.00025429644,0.00010579882,0.00039060303,0.001706149,0.014400789],"genre_scores_gemma":[0.96645075,0.00027110954,0.030422386,0.00014023016,0.000050021874,0.000035477115,0.000120318706,0.000051721392,0.0024579673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910283,0.0003205038,0.000051664378,0.000101854,0.00023808691,0.00018505994],"domain_scores_gemma":[0.9927921,0.005474267,0.0002693926,0.00051872287,0.00080537604,0.00014015866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015648886,0.000479997,0.00058590225,0.0010793204,0.0009334734,0.0015117646,0.0013406542,0.000859061,0.0042336877],"category_scores_gemma":[0.009491011,0.00032544823,0.00024585516,0.0015621857,0.00046437435,0.0029202143,0.00075257145,0.0005722629,0.000395346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021773404,0.00035249375,0.0067871767,0.00032914474,0.00009189637,0.00014652459,0.00042078865,0.49636263,0.020186918,0.054012507,0.012232296,0.4069002],"study_design_scores_gemma":[0.00003235816,0.00018512894,0.0007591752,0.000014013401,0.000029786715,0.00007029913,0.00009375796,0.98296887,0.005369251,0.00966839,0.0007978099,0.000011198454],"about_ca_topic_score_codex":0.004139545,"about_ca_topic_score_gemma":0.011933112,"teacher_disagreement_score":0.0042336877,"about_ca_system_score_codex":0.0018059234,"about_ca_system_score_gemma":0.0019258922,"threshold_uncertainty_score":0.014163077},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023838667292619145,"score_gpt":0.2456956519260933,"score_spread":0.22185698463347414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067194564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19616233,0.0039669313,0.78225833,0.002816836,0.00027906362,0.00034246544,0.008714657,0.0030363584,0.0024231113],"genre_scores_gemma":[0.3960565,0.0023435485,0.5638454,0.0004139024,0.0006317776,0.0004300644,0.030719904,0.0009857839,0.004573142],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99438417,0.0010891202,0.0009547461,0.0016511673,0.0014727652,0.0004480546],"domain_scores_gemma":[0.9653525,0.025010332,0.0032357401,0.002970361,0.0026545469,0.00077652873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005669688,0.0012476299,0.0034353929,0.004882407,0.0025238672,0.0035604732,0.0038561367,0.004943825,0.0036121893],"category_scores_gemma":[0.03395538,0.0017402406,0.002577451,0.008214023,0.0020055836,0.010225778,0.002632116,0.0028552604,0.0013323626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033678683,0.0010273925,0.013681109,0.0039129797,0.0008480039,0.0047329064,0.0017494779,0.40975767,0.026065169,0.09996508,0.023955267,0.4109371],"study_design_scores_gemma":[0.00023039091,0.00023664304,0.0017722216,0.0001868258,0.00017817982,0.0013958518,0.0007962982,0.66981095,0.008699869,0.30959788,0.007007705,0.00008711445],"about_ca_topic_score_codex":0.0048357276,"about_ca_topic_score_gemma":0.0037522842,"teacher_disagreement_score":0.005669688,"about_ca_system_score_codex":0.0014841359,"about_ca_system_score_gemma":0.003864856,"threshold_uncertainty_score":0.029984534},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04379541596315799,"score_gpt":0.331260597960581,"score_spread":0.287465181997423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075457919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017134385,0.00055465585,0.9787375,0.00019714457,0.00006911402,0.00017397068,0.00023848399,0.0005711879,0.0023236743],"genre_scores_gemma":[0.10903771,0.00059558824,0.88449395,0.00015869999,0.00009680997,0.00019750796,0.00074354344,0.0002992372,0.004376913],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985253,0.00037971427,0.000100849524,0.00025618591,0.00060108607,0.00013687924],"domain_scores_gemma":[0.99650925,0.0017786953,0.00015277218,0.0009012489,0.00054475165,0.00011318654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015772779,0.0007934795,0.0017621028,0.0027660695,0.0008088821,0.0012334466,0.002838049,0.001166033,0.004535197],"category_scores_gemma":[0.007490596,0.00086858793,0.0019180677,0.0035637363,0.0008490365,0.0037872454,0.0024711946,0.0021990864,0.0011164284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007451332,0.00038637724,0.0015739802,0.0012292775,0.00029878056,0.00031035626,0.0009449994,0.21359518,0.06543542,0.18224767,0.014647567,0.51858526],"study_design_scores_gemma":[0.00014614596,0.00031803313,0.0008233048,0.00008986198,0.00022389618,0.0003965127,0.00014174965,0.86489516,0.012731042,0.10600734,0.014166669,0.0000602154],"about_ca_topic_score_codex":0.0025467773,"about_ca_topic_score_gemma":0.004051043,"teacher_disagreement_score":0.004535197,"about_ca_system_score_codex":0.0009042701,"about_ca_system_score_gemma":0.0011299826,"threshold_uncertainty_score":0.015171766},"labels":[],"label_agreement":null},{"id":"W2075553387","doi":"10.1016/j.jcss.2014.04.027","title":"Randomized diffusion for indivisible loads","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Hypercube; Randomized algorithm; Vertex (graph theory); Mathematics; Computer science; Expander graph; Eigenvalues and eigenvectors; Load balancing (electrical power); Exponential function; Degree (music); Upper and lower bounds; Combinatorics; Discrete mathematics; Graph; Grid","score_opus":0.021908114671098634,"score_gpt":0.2596130867643442,"score_spread":0.23770497209324556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075553387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12923831,0.0011837577,0.83935684,0.008174513,0.00064068445,0.00033545957,0.0007339297,0.0018301504,0.018506303],"genre_scores_gemma":[0.87196356,0.0007903238,0.096320316,0.0012237336,0.00063662475,0.0004639284,0.00054599054,0.00062359066,0.027431933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962379,0.001360877,0.00017497575,0.00085681124,0.00071740535,0.0006521021],"domain_scores_gemma":[0.9556519,0.03326728,0.001998379,0.0050133825,0.0021703632,0.0018986663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057720426,0.001542363,0.0033809044,0.0022797566,0.0025264637,0.004526111,0.0047841775,0.0038588059,0.0134576745],"category_scores_gemma":[0.044288315,0.0015897356,0.0015986696,0.0021397357,0.0042483713,0.010765812,0.005152537,0.005696706,0.0012065914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010783739,0.00035824356,0.0006746695,0.0003182831,0.00009731817,0.00012227264,0.00027842305,0.29815564,0.003951527,0.6552916,0.01301981,0.02665391],"study_design_scores_gemma":[0.00012590887,0.000042568332,0.0001228261,0.00002333286,0.000023612043,0.000034918146,0.000035622772,0.69115925,0.00066368334,0.30675575,0.0009808027,0.00003171251],"about_ca_topic_score_codex":0.004137562,"about_ca_topic_score_gemma":0.0042271013,"teacher_disagreement_score":0.0134576745,"about_ca_system_score_codex":0.0052537974,"about_ca_system_score_gemma":0.003194517,"threshold_uncertainty_score":0.04502046},"labels":[],"label_agreement":null},{"id":"W2077000739","doi":"10.1016/j.jcss.2010.06.002","title":"Errors in graph embedding algorithms","year":2010,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Victoria","funders":"","keywords":"Planarity testing; Embedding; Algorithm; Computer science; Graph; Graph embedding; Torus; Genus; Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.01633444415429612,"score_gpt":0.2792815978192382,"score_spread":0.2629471536649421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077000739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07289375,0.0026502635,0.911741,0.002515013,0.0010202467,0.000077388104,0.00030779737,0.0013017079,0.007492895],"genre_scores_gemma":[0.68718016,0.0012510201,0.2927375,0.0005329534,0.0004812836,0.0001391965,0.0006670647,0.0014973657,0.015513537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99291116,0.0030835443,0.00040617283,0.0011312023,0.0021179444,0.00034995892],"domain_scores_gemma":[0.90269274,0.07759663,0.002345257,0.009445578,0.0070859846,0.00083387067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008141638,0.0012831851,0.0017097081,0.0028839672,0.0012726706,0.002634772,0.0024712263,0.0030611008,0.006601807],"category_scores_gemma":[0.09654808,0.0010485452,0.00073641096,0.0031750859,0.0029809421,0.0065845763,0.0044570905,0.0036617406,0.0016615213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011536987,0.00015994172,0.0060668923,0.0004085083,0.00014931358,0.00016431106,0.00036754718,0.5889947,0.00243345,0.16737139,0.010110774,0.22261949],"study_design_scores_gemma":[0.000035988236,0.0000654817,0.0006415178,0.000059169462,0.000031889347,0.00007744675,0.00007447491,0.8653046,0.003686737,0.12773788,0.0022652599,0.00001952445],"about_ca_topic_score_codex":0.004723164,"about_ca_topic_score_gemma":0.0044529242,"teacher_disagreement_score":0.008141638,"about_ca_system_score_codex":0.0018734613,"about_ca_system_score_gemma":0.0014009952,"threshold_uncertainty_score":0.04305762},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02316245338529533,"score_gpt":0.29162058749459785,"score_spread":0.2684581341093025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077761942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7882263,0.0006168362,0.16754995,0.0010246508,0.00012961417,0.0001271187,0.0006825824,0.00096387183,0.040679093],"genre_scores_gemma":[0.9628567,0.00052998646,0.016959889,0.00014533417,0.00006836497,0.00005507327,0.00036828557,0.00014736081,0.018868944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958163,0.00006705012,0.000030244635,0.000103564824,0.000097157186,0.00012036711],"domain_scores_gemma":[0.99705195,0.00127697,0.0005117678,0.00021052141,0.00031066113,0.00063803676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032430474,0.0004557484,0.0009201316,0.002547188,0.0013359975,0.0031346346,0.001031062,0.0011585134,0.0073854937],"category_scores_gemma":[0.0035862036,0.0006754565,0.000667022,0.0018295331,0.0013420027,0.003976062,0.0017768678,0.0015435419,0.0010621899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011852183,0.00009679191,0.0012622717,0.00014895087,0.000023632361,0.00033931973,0.00067208824,0.007246508,0.0021333473,0.96740997,0.0031553647,0.017393418],"study_design_scores_gemma":[0.000037482394,0.00003105083,0.0007831658,0.00002464035,0.000031160023,0.0003617004,0.00034315835,0.031612262,0.0009290719,0.9624391,0.0033846656,0.000022375187],"about_ca_topic_score_codex":0.0023296324,"about_ca_topic_score_gemma":0.002495087,"teacher_disagreement_score":0.0073854937,"about_ca_system_score_codex":0.0012771831,"about_ca_system_score_gemma":0.0005353155,"threshold_uncertainty_score":0.02470696},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029020436755622613,"score_gpt":0.2539311889240583,"score_spread":0.2249107521684357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079029882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034078665,0.00039315285,0.96295476,0.0002488228,0.00014897075,0.000042197793,0.00005043421,0.00039294144,0.0016901346],"genre_scores_gemma":[0.69314265,0.00034713792,0.30358896,0.00016620854,0.00016605027,0.00008577079,0.00023015485,0.0001366085,0.002136393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992011,0.00019185014,0.000045411918,0.00019634803,0.0002047638,0.0001606071],"domain_scores_gemma":[0.9985996,0.00060961855,0.00016055162,0.00020272876,0.00030132668,0.00012623335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012639288,0.000848457,0.0010376435,0.0005685193,0.0008068567,0.001216198,0.0015272908,0.00054119877,0.0015358559],"category_scores_gemma":[0.0035821046,0.0005846137,0.00047402168,0.0008866751,0.00051459053,0.0011998158,0.0012591406,0.0013747155,0.00044645305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055283547,0.00012908802,0.00079454493,0.0001336936,0.00007582219,0.00012193808,0.00022414289,0.83655035,0.026417246,0.013682824,0.0030378825,0.118279666],"study_design_scores_gemma":[0.00002812261,0.000051023606,0.000110414556,0.0000046945097,0.000009737506,0.000022565408,0.000027174725,0.9925724,0.0013594993,0.0048413062,0.0009669517,0.000005902841],"about_ca_topic_score_codex":0.0064404085,"about_ca_topic_score_gemma":0.0075204372,"teacher_disagreement_score":0.0064404085,"about_ca_system_score_codex":0.0007733543,"about_ca_system_score_gemma":0.0020077303,"threshold_uncertainty_score":0.0128058195},"labels":[],"label_agreement":null},{"id":"W2087899083","doi":"10.1016/j.jcss.2005.11.002","title":"Corrigendum to “Completeness results for graph isomorphism” [J. Comput. System Sci. 66 (2003) 549–566]","year":2006,"lang":"en","type":"erratum","venue":"Journal of Computer and System Sciences","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Graph isomorphism; Isomorphism (crystallography); Completeness (order theory); Graph; Combinatorics; Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Line graph; Chemistry","score_opus":0.029425602210087932,"score_gpt":0.24820032944291343,"score_spread":0.21877472723282548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087899083","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007067851,0.007135394,0.012690245,0.10116479,0.8426932,0.00012761337,0.002553295,0.0012160336,0.03171268],"genre_scores_gemma":[0.03795845,0.03535251,0.036524545,0.1199096,0.2897315,0.00075427955,0.013421521,0.0036869294,0.4626608],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99509573,0.00090344937,0.00061812793,0.0007518123,0.002160979,0.00046989252],"domain_scores_gemma":[0.9736649,0.008029162,0.0008699632,0.0026896321,0.014059026,0.0006872659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037998308,0.0029351416,0.003518966,0.006022225,0.0037772432,0.0035091315,0.0059883343,0.004700986,0.11781054],"category_scores_gemma":[0.0436362,0.0014065511,0.0034420863,0.0053244117,0.0034037542,0.0071076322,0.0029787123,0.0070965323,0.048593502],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042508043,0.000017377037,0.0000718332,0.00023154827,0.000030183015,0.00015601615,0.000026570377,0.00017449317,0.00009300526,0.0046004476,0.986102,0.0084539605],"study_design_scores_gemma":[0.00009543195,0.00008030009,0.002351112,0.00040231054,0.00017657387,0.00089415425,0.00014429554,0.00207711,0.0011872497,0.05161009,0.94081724,0.00016408015],"about_ca_topic_score_codex":0.020140504,"about_ca_topic_score_gemma":0.023149233,"teacher_disagreement_score":0.11781054,"about_ca_system_score_codex":0.0048946687,"about_ca_system_score_gemma":0.0028649333,"threshold_uncertainty_score":0.39411557},"labels":[],"label_agreement":null},{"id":"W2091741450","doi":"10.1016/j.jcss.2008.02.007","title":"Lower bounds for the transition complexity of NFAs","year":2008,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Nondeterministic algorithm; Constant (computer programming); State (computer science); Combinatorics; Mathematics; Discrete mathematics; Computer science; Algorithm","score_opus":0.052486422567526995,"score_gpt":0.2577307109255387,"score_spread":0.20524428835801167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091741450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28409514,0.0056185494,0.62142915,0.010557989,0.0006456256,0.00032654405,0.0033195296,0.0030145757,0.07099292],"genre_scores_gemma":[0.9062748,0.0022781524,0.07193753,0.00092008564,0.0011912511,0.00060564117,0.002423824,0.0009856807,0.013383152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922426,0.0015529692,0.0004150038,0.0015062899,0.0025760666,0.0017070415],"domain_scores_gemma":[0.8658396,0.11762593,0.0027298813,0.0073306034,0.0032449046,0.0032291266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005051342,0.0018987465,0.00259837,0.0049480163,0.0026614303,0.008570453,0.005048623,0.0035998689,0.01760105],"category_scores_gemma":[0.048217192,0.0014371722,0.003820716,0.0033922037,0.0042719524,0.016525595,0.005096251,0.011548185,0.0017557591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011981695,0.000505853,0.0051387246,0.0009130175,0.00024771297,0.00033330213,0.0011934072,0.15725276,0.010526416,0.7427444,0.012521726,0.0674245],"study_design_scores_gemma":[0.000046027493,0.00007524455,0.0011118393,0.00008160345,0.000090353155,0.00017805195,0.00010238646,0.27060854,0.0025492047,0.7227895,0.0023050867,0.00006217383],"about_ca_topic_score_codex":0.0021917454,"about_ca_topic_score_gemma":0.003450779,"teacher_disagreement_score":0.01760105,"about_ca_system_score_codex":0.005858022,"about_ca_system_score_gemma":0.0023989517,"threshold_uncertainty_score":0.058881342},"labels":[],"label_agreement":null},{"id":"W2092237630","doi":"10.1016/j.jcss.2008.08.002","title":"On pseudoknot-bordered words and their properties","year":2008,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Pseudoknot; Complementarity (molecular biology); Context (archaeology); Generalization; Word (group theory); DNA; Computer science; Mathematics; Base sequence; Biology; Genetics; Geometry","score_opus":0.028216077377469315,"score_gpt":0.2300313340057564,"score_spread":0.2018152566282871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092237630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89925265,0.001174358,0.07977626,0.0008337934,0.00016671493,0.000056785175,0.0005390066,0.00033182523,0.017868645],"genre_scores_gemma":[0.98271966,0.00051518716,0.011403812,0.00016163659,0.00019841391,0.000086841384,0.00060459547,0.00013323204,0.0041766292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989453,0.00024708098,0.00013386548,0.00023411014,0.00026716464,0.00017242388],"domain_scores_gemma":[0.98109996,0.013273115,0.002169183,0.0014027066,0.0011071878,0.0009477286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475355,0.0006309508,0.0011728465,0.003048697,0.0021384289,0.0038391522,0.0012430808,0.0015565739,0.004281901],"category_scores_gemma":[0.014365912,0.00042397587,0.00072729005,0.0039565084,0.0030532468,0.0064747524,0.0017339711,0.0014140232,0.0007672226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005174715,0.00009071888,0.003220874,0.00012930941,0.00002486425,0.00073726365,0.0010990954,0.007877026,0.0042011617,0.9617346,0.0017975114,0.018570187],"study_design_scores_gemma":[0.000043685184,0.00010491381,0.0011224379,0.00005424456,0.00002416458,0.00077170954,0.00029247496,0.029384725,0.0017952891,0.96391845,0.0024403906,0.00004759443],"about_ca_topic_score_codex":0.0007036787,"about_ca_topic_score_gemma":0.0005425657,"teacher_disagreement_score":0.004281901,"about_ca_system_score_codex":0.0009265186,"about_ca_system_score_gemma":0.00072367076,"threshold_uncertainty_score":0.014324427},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05216442578228685,"score_gpt":0.2959712926665272,"score_spread":0.24380686688424036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092928619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2887507,0.0037110655,0.6135734,0.017175002,0.0007727354,0.00052503607,0.0042355354,0.0029909448,0.06826563],"genre_scores_gemma":[0.9192491,0.0011669676,0.0655867,0.0015247092,0.0006502277,0.00042335523,0.0020087725,0.0009147277,0.008475281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909814,0.0016960418,0.0006422483,0.002037056,0.0024619778,0.0021811465],"domain_scores_gemma":[0.9229794,0.06362764,0.0022760767,0.007175389,0.0022294747,0.0017120308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042070793,0.0014966249,0.003118161,0.0016396794,0.0035872448,0.008751538,0.007419641,0.0029140108,0.018416433],"category_scores_gemma":[0.04005218,0.0016772689,0.003500044,0.0035712998,0.0051145325,0.029907003,0.010068235,0.01171971,0.0019846049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033628729,0.000632862,0.00791471,0.0026587157,0.00040639957,0.001005945,0.0020395806,0.14190336,0.011740189,0.68622375,0.035807744,0.10630386],"study_design_scores_gemma":[0.00015121233,0.00008938006,0.0010668997,0.00009209126,0.00017725259,0.00051827496,0.00032254413,0.19119538,0.0053249304,0.7963682,0.004615706,0.000078198595],"about_ca_topic_score_codex":0.0036901312,"about_ca_topic_score_gemma":0.0048319474,"teacher_disagreement_score":0.018416433,"about_ca_system_score_codex":0.0044084243,"about_ca_system_score_gemma":0.004794464,"threshold_uncertainty_score":0.06160909},"labels":[],"label_agreement":null},{"id":"W2096648167","doi":"10.1016/j.jcss.2004.07.004","title":"First-order expressibility of languages with neutral letters or: The Crane Beach conjecture","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Conjecture; First-order logic; Predicate (mathematical logic); Iterated function; Mathematics; Alphabet; Order (exchange); Logarithm; Discrete mathematics; Combinatorics; Computer science; Linguistics; Programming language; Philosophy","score_opus":0.009808816728811886,"score_gpt":0.23353575833276194,"score_spread":0.22372694160395004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096648167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63769925,0.0016300952,0.18434761,0.011047136,0.00034266792,0.00009801379,0.0011459667,0.0016655409,0.1620238],"genre_scores_gemma":[0.96321803,0.0005255469,0.014248829,0.0009344686,0.0002134886,0.00006237213,0.0006235012,0.00020188074,0.019971885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771726,0.0004081735,0.00017145794,0.0007268684,0.00044293763,0.0005333221],"domain_scores_gemma":[0.9913163,0.005256878,0.0004985898,0.0017511826,0.000811963,0.0003650173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018733221,0.00065235875,0.0010921484,0.0008335356,0.0017938424,0.007637521,0.0017533186,0.0017780623,0.007926106],"category_scores_gemma":[0.007615561,0.0009433635,0.0014784442,0.000975865,0.0044946508,0.014325001,0.002512215,0.0053002504,0.0013086331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019744522,0.000042932785,0.000396612,0.00007828635,0.000017600936,0.00013655152,0.0008581694,0.0013490957,0.0020162964,0.98675144,0.0017009549,0.0064545297],"study_design_scores_gemma":[0.000030655574,0.0000132620125,0.000095734686,0.000016742435,0.000015851343,0.000092803224,0.00019282015,0.0036448357,0.0016031214,0.99196374,0.0023100637,0.000020290423],"about_ca_topic_score_codex":0.00272138,"about_ca_topic_score_gemma":0.0022479927,"teacher_disagreement_score":0.007926106,"about_ca_system_score_codex":0.0017898243,"about_ca_system_score_gemma":0.0016445881,"threshold_uncertainty_score":0.026515484},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01641046682680313,"score_gpt":0.2574368310928004,"score_spread":0.24102636426599727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106811687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039562318,0.00008133977,0.9844838,0.000047202895,0.00012249385,0.00011839134,0.0001800294,0.00817051,0.002839951],"genre_scores_gemma":[0.063252464,0.00018326828,0.92112064,0.000088126755,0.000079563666,0.00017035141,0.00063922274,0.0036928614,0.010773535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992563,0.000111675334,0.00006537089,0.00013543252,0.000377363,0.00005377325],"domain_scores_gemma":[0.99799734,0.00055805885,0.00013774606,0.0006806116,0.00044153963,0.00018465414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011014694,0.00091075955,0.0008751975,0.0010182506,0.0004981929,0.0010437429,0.0022052473,0.00084009406,0.017889233],"category_scores_gemma":[0.004577424,0.0006302693,0.00087242,0.0013862223,0.0006107745,0.0021672156,0.0018088408,0.001075473,0.007964108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008713408,0.0004139344,0.0018483353,0.00047242077,0.00010115603,0.000577826,0.00021767736,0.029777179,0.056620374,0.11640862,0.0287465,0.7639447],"study_design_scores_gemma":[0.00055629486,0.00048485235,0.0010564002,0.00010563262,0.00013528022,0.0017596474,0.00006396344,0.60617566,0.05593363,0.18473494,0.148817,0.00017660079],"about_ca_topic_score_codex":0.00078320026,"about_ca_topic_score_gemma":0.0013979098,"teacher_disagreement_score":0.017889233,"about_ca_system_score_codex":0.0002997092,"about_ca_system_score_gemma":0.0005610783,"threshold_uncertainty_score":0.059845448},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02633655907656768,"score_gpt":0.23429768430904283,"score_spread":0.20796112523247515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117278106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046417642,0.00037427948,0.9444575,0.00057197054,0.000084844156,0.00010302796,0.00020956378,0.0005123081,0.0072688917],"genre_scores_gemma":[0.87059206,0.00028471655,0.12339096,0.00015224062,0.000051274328,0.00010171244,0.00021253106,0.00020333809,0.005011112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995283,0.00016629016,0.00001433752,0.00007339574,0.000099399374,0.000118391086],"domain_scores_gemma":[0.999204,0.0004887792,0.00006790105,0.000058501442,0.00011514713,0.00006567998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007300329,0.0010838851,0.0013348974,0.00094668,0.000600845,0.0010401516,0.0012790675,0.00089384033,0.005648986],"category_scores_gemma":[0.0024983196,0.00047489817,0.0008408958,0.0008531083,0.00052840915,0.001687447,0.001008811,0.00096440146,0.00033354576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006673535,0.000061987565,0.00030801079,0.000042913663,0.000035340912,0.000030376938,0.000021801954,0.9623145,0.0008017271,0.014609728,0.0017359114,0.019970898],"study_design_scores_gemma":[0.000004727294,0.000013636534,0.000062001396,0.0000022373451,0.0000075358103,0.0000049231803,0.000009215843,0.9925908,0.00011275652,0.007004859,0.00018492747,0.000002494775],"about_ca_topic_score_codex":0.00892455,"about_ca_topic_score_gemma":0.009123244,"teacher_disagreement_score":0.00892455,"about_ca_system_score_codex":0.001093608,"about_ca_system_score_gemma":0.0017649201,"threshold_uncertainty_score":0.018897772},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016248356281999173,"score_gpt":0.23802107929001748,"score_spread":0.2217727230080183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125194875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7296558,0.0008824579,0.25096908,0.0011210204,0.00030105302,0.00026077396,0.00010891222,0.007827025,0.008873966],"genre_scores_gemma":[0.9821238,0.00005744476,0.017156601,0.000065250686,0.000050661667,0.000018119408,0.000046217185,0.000052123392,0.00042981506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975611,0.00070934754,0.0002010529,0.00044156177,0.00074767316,0.00033930448],"domain_scores_gemma":[0.9919117,0.0022400606,0.0012457748,0.0016473612,0.0024852077,0.00046985174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023651482,0.0008733627,0.00078261836,0.0017778075,0.0011097012,0.0023027707,0.0017824474,0.0006626813,0.0023419242],"category_scores_gemma":[0.010937451,0.00043087796,0.00030971572,0.0015933478,0.00066180085,0.0030591849,0.0009857754,0.0009178367,0.00062957377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004646929,0.0022843427,0.06577859,0.00017105296,0.00022369165,0.00024712013,0.0002512505,0.18316661,0.103761464,0.0060557923,0.0054626004,0.62795055],"study_design_scores_gemma":[0.00032334184,0.0018573786,0.016133439,0.000019970452,0.00019479125,0.0005140859,0.00014501593,0.9046007,0.068131514,0.0055406736,0.0024719767,0.00006720856],"about_ca_topic_score_codex":0.0025419898,"about_ca_topic_score_gemma":0.0023337721,"teacher_disagreement_score":0.0025419898,"about_ca_system_score_codex":0.0016053421,"about_ca_system_score_gemma":0.0022394273,"threshold_uncertainty_score":0.0125082135},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03660138892514958,"score_gpt":0.2591070153224866,"score_spread":0.222505626397337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126323053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61568904,0.008140514,0.24724607,0.051735397,0.00086511887,0.00017031716,0.0015071956,0.0006854699,0.073960826],"genre_scores_gemma":[0.98437274,0.001434425,0.0077981413,0.0006066177,0.000906869,0.000038913255,0.00014681018,0.000117250835,0.0045782398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99414825,0.0016408677,0.00023989318,0.0008838523,0.0016122056,0.0014749864],"domain_scores_gemma":[0.90396196,0.078285225,0.0033676717,0.008534746,0.003045335,0.00280509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053805243,0.0004993242,0.0017533354,0.0016718125,0.0017589194,0.0065559833,0.0023102018,0.0028999352,0.011853009],"category_scores_gemma":[0.047467075,0.0006873099,0.00095385837,0.0025411304,0.0049404036,0.018744983,0.0027995836,0.005078965,0.0010097697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004242281,0.00010154711,0.0021155155,0.0001864059,0.000035713827,0.00007949344,0.00027565696,0.01698032,0.0017779607,0.9593791,0.004498438,0.014145666],"study_design_scores_gemma":[0.000091864385,0.000080693855,0.0015053416,0.000036845046,0.000047820016,0.00027767906,0.00015525117,0.08062731,0.0010433,0.91357684,0.0025142787,0.00004273737],"about_ca_topic_score_codex":0.0022358266,"about_ca_topic_score_gemma":0.0016462064,"teacher_disagreement_score":0.011853009,"about_ca_system_score_codex":0.0038568017,"about_ca_system_score_gemma":0.0024272373,"threshold_uncertainty_score":0.039652288},"labels":[],"label_agreement":null},{"id":"W2127955734","doi":"10.1016/j.jcss.2004.08.005","title":"Language equations, maximality and error-detection","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Nondeterministic algorithm; Prefix; Closure (psychology); Type (biology); Mathematics; Hierarchy; Regular language; Discrete mathematics; Code (set theory); Characterization (materials science); Computer science; Theoretical computer science; Linguistics; Programming language; Automaton; Set (abstract data type)","score_opus":0.020679599311732345,"score_gpt":0.2753569463597711,"score_spread":0.25467734704803874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127955734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09321692,0.0012855397,0.8833188,0.006368528,0.00019988338,0.000063300104,0.000384315,0.00073790835,0.014424808],"genre_scores_gemma":[0.8553218,0.00081296515,0.13301283,0.001000338,0.0005007678,0.00014126825,0.00044073642,0.00033967537,0.008429603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99209565,0.0028795649,0.00070512685,0.0017245527,0.0015961069,0.000999021],"domain_scores_gemma":[0.9119669,0.07602047,0.002556307,0.004606292,0.0039538564,0.00089619873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007395327,0.00094722863,0.0018672417,0.0022841252,0.0021996577,0.004268125,0.003296985,0.002431529,0.0049122814],"category_scores_gemma":[0.059161395,0.0014379348,0.0028042507,0.0023446588,0.009518191,0.016131986,0.0057767425,0.006213526,0.0006421357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010649786,0.00003511146,0.0010285832,0.000100006844,0.000043150947,0.00012364221,0.0005849018,0.009870916,0.0006035586,0.9703856,0.0018255796,0.015292309],"study_design_scores_gemma":[0.000013488511,0.000007317864,0.00007501443,0.000009409775,0.000013700688,0.000041040592,0.000022397404,0.018699706,0.00046565066,0.98021084,0.0004260028,0.000015411022],"about_ca_topic_score_codex":0.0039110435,"about_ca_topic_score_gemma":0.0027816552,"teacher_disagreement_score":0.007395327,"about_ca_system_score_codex":0.002470695,"about_ca_system_score_gemma":0.0024700582,"threshold_uncertainty_score":0.03911072},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06998880825289108,"score_gpt":0.24769342942031014,"score_spread":0.17770462116741906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134600856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56499755,0.0015388497,0.38788,0.008839805,0.00026999466,0.0002592401,0.00319002,0.0010541533,0.03197036],"genre_scores_gemma":[0.9111536,0.00075119466,0.07783191,0.00042851217,0.00033625297,0.00020819188,0.0015084852,0.00036334354,0.0074183564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937644,0.0019653887,0.00043202587,0.00079790456,0.0021472955,0.0008929394],"domain_scores_gemma":[0.94824106,0.04169932,0.0028486783,0.0034902403,0.0022188965,0.0015018152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041943653,0.00092473795,0.0017452262,0.0015403338,0.0016179095,0.007056822,0.004108109,0.002321766,0.008514096],"category_scores_gemma":[0.032982085,0.0011236388,0.0018835353,0.0036366433,0.0029770955,0.018079689,0.0034038837,0.0038173907,0.0005945278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097092806,0.00024998642,0.0025195295,0.00042322357,0.00015429044,0.00024226279,0.00045816027,0.22835198,0.0027943598,0.712672,0.008944297,0.042219017],"study_design_scores_gemma":[0.00007170622,0.00003835592,0.00049561256,0.000019210938,0.00004247213,0.00013411825,0.00008913334,0.3260218,0.0008016843,0.6709672,0.0012885141,0.000030131183],"about_ca_topic_score_codex":0.0067694527,"about_ca_topic_score_gemma":0.0062211896,"teacher_disagreement_score":0.008514096,"about_ca_system_score_codex":0.004709738,"about_ca_system_score_gemma":0.0045565916,"threshold_uncertainty_score":0.0341717},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013491403880278757,"score_gpt":0.2427616204778011,"score_spread":0.22927021659752234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136462002","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12137764,0.005615263,0.24037126,0.016023833,0.0041397046,0.00014438093,0.00081780594,0.0011193143,0.61039084],"genre_scores_gemma":[0.9138629,0.0022660452,0.022128142,0.0018053193,0.0020464975,0.00016063235,0.000217455,0.00032449554,0.057188556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858403,0.00030873838,0.000084863226,0.00035553827,0.00043142913,0.00023545169],"domain_scores_gemma":[0.9978114,0.0010330419,0.00013458027,0.00053988997,0.00030370333,0.00017745345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010157712,0.0004230679,0.0008983061,0.0012079069,0.0025262404,0.003850285,0.0009048036,0.0020412304,0.015781708],"category_scores_gemma":[0.003482385,0.00049141847,0.0006636714,0.00080869056,0.008534028,0.009016452,0.002894739,0.0031389736,0.0019079153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027036872,0.0000012863088,0.00000581769,0.000004932134,7.826643e-7,0.0000035967828,0.000016452383,0.000053598273,0.00007346872,0.99887747,0.0002267619,0.0007330729],"study_design_scores_gemma":[0.0000036618824,0.000005847242,0.000018974646,0.0000029981277,0.0000023864573,0.000026474274,0.000013286062,0.00042496208,0.00033500182,0.9943144,0.0048473678,0.000004643733],"about_ca_topic_score_codex":0.0011140025,"about_ca_topic_score_gemma":0.00065915904,"teacher_disagreement_score":0.015781708,"about_ca_system_score_codex":0.0012613769,"about_ca_system_score_gemma":0.0013034876,"threshold_uncertainty_score":0.052795053},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03061450247099549,"score_gpt":0.26054316029865665,"score_spread":0.22992865782766117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154093507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03263834,0.0011676179,0.95491856,0.0019216915,0.00023294259,0.00021272847,0.00050427334,0.002489003,0.0059149005],"genre_scores_gemma":[0.4441048,0.00081173255,0.5435937,0.0010206645,0.00030010287,0.00017136191,0.0016850347,0.0011537025,0.007158902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98366356,0.0050633326,0.0021181013,0.0015334376,0.0063673826,0.0012541958],"domain_scores_gemma":[0.9623588,0.020094912,0.0013478427,0.009933002,0.0056580245,0.00060746935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012986017,0.0006641238,0.002112208,0.001890118,0.0018146052,0.0048334496,0.0039438778,0.001957653,0.00333284],"category_scores_gemma":[0.036224015,0.001299047,0.0026943511,0.0021450408,0.0032436007,0.008540692,0.0042809597,0.00433209,0.00073404034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005376618,0.0002518532,0.0032647864,0.0008755242,0.00032704175,0.0016605343,0.0031244436,0.028342875,0.010199618,0.82317156,0.014288161,0.11395583],"study_design_scores_gemma":[0.00013830877,0.00009231028,0.00045362074,0.00008388483,0.00033461183,0.0010664272,0.0006352197,0.15463392,0.0155035695,0.809095,0.017858312,0.00010478347],"about_ca_topic_score_codex":0.005258131,"about_ca_topic_score_gemma":0.004889467,"teacher_disagreement_score":0.012986017,"about_ca_system_score_codex":0.0023136982,"about_ca_system_score_gemma":0.002961481,"threshold_uncertainty_score":0.068677425},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0123920140745925,"score_gpt":0.22286031182502164,"score_spread":0.21046829775042913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154773309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82567626,0.0006180075,0.09150367,0.0020204755,0.00042057084,0.00007036573,0.00013496896,0.0004205492,0.079135105],"genre_scores_gemma":[0.97960424,0.00024324015,0.009941661,0.0002841252,0.000089451394,0.00005846722,0.00008886385,0.00009257967,0.009597361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944633,0.0001447486,0.00002591895,0.00007197765,0.00013402732,0.00017691184],"domain_scores_gemma":[0.9981207,0.00084565877,0.00013503822,0.00025234045,0.00017297335,0.000473239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081277004,0.00060669234,0.0015107018,0.0015069039,0.0027541285,0.003976957,0.0014872935,0.0032298537,0.0058120633],"category_scores_gemma":[0.0036551426,0.0006151174,0.0007911628,0.00080851413,0.0030730711,0.0038275586,0.002414239,0.0022333527,0.000832112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010425818,0.00009827767,0.000198132,0.000031922584,0.000012261142,0.00015099633,0.00011269912,0.008314958,0.0021746343,0.98621327,0.0007417387,0.0018469281],"study_design_scores_gemma":[0.00006482918,0.00003632033,0.00024136654,0.000023109891,0.000009789627,0.0001153812,0.00008860067,0.09994114,0.0009913862,0.89785403,0.0006066756,0.000027361328],"about_ca_topic_score_codex":0.0007337102,"about_ca_topic_score_gemma":0.0006737698,"teacher_disagreement_score":0.0058120633,"about_ca_system_score_codex":0.0009355008,"about_ca_system_score_gemma":0.000773494,"threshold_uncertainty_score":0.019443214},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031710240243010404,"score_gpt":0.26269144178937565,"score_spread":0.23098120154636526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158912767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28054452,0.000552213,0.6686799,0.002702575,0.0002401122,0.0003421625,0.0006451036,0.0022688347,0.04402454],"genre_scores_gemma":[0.93198407,0.00016174452,0.0595188,0.00030265067,0.0000990306,0.00021396996,0.00037675508,0.0002658451,0.007077142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916831,0.004807052,0.00049545884,0.0009241809,0.0014330706,0.00065716455],"domain_scores_gemma":[0.9135191,0.06908646,0.002569457,0.0080938935,0.0042722393,0.0024588201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055807377,0.0007835761,0.0011235533,0.0013339034,0.0023700881,0.004849653,0.0024065878,0.0021864928,0.016203959],"category_scores_gemma":[0.04835328,0.0013527425,0.0016398849,0.0008834873,0.0040425,0.011029361,0.004767098,0.0033471484,0.0015750882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004228598,0.000116484516,0.0014610732,0.00012818712,0.000057927264,0.00025452024,0.00059688924,0.012742206,0.002447563,0.97230554,0.0010413467,0.0084254015],"study_design_scores_gemma":[0.00007386965,0.00004144866,0.0001502624,0.000026042306,0.00002753054,0.00012837973,0.00012518883,0.057965476,0.002772319,0.93633443,0.0023381405,0.000016917795],"about_ca_topic_score_codex":0.0007394493,"about_ca_topic_score_gemma":0.0010852675,"teacher_disagreement_score":0.016203959,"about_ca_system_score_codex":0.0020581225,"about_ca_system_score_gemma":0.0021966342,"threshold_uncertainty_score":0.054207683},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0222037773679399,"score_gpt":0.2902167245142492,"score_spread":0.2680129471463093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159543798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016854037,0.0026124378,0.9519164,0.0054658577,0.00030762944,0.00024359618,0.0012050235,0.002058209,0.019336866],"genre_scores_gemma":[0.5172561,0.0022106091,0.4648326,0.0022094923,0.00080535223,0.00048109711,0.002706801,0.00046665696,0.009031336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936644,0.002528375,0.00089425687,0.0008252509,0.0014820449,0.00060574664],"domain_scores_gemma":[0.98793715,0.008143981,0.0007100282,0.0018251676,0.00083505135,0.0005486249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061629172,0.0018379923,0.0018864681,0.005790397,0.0039897156,0.013513613,0.0059872842,0.004047499,0.013229182],"category_scores_gemma":[0.016218673,0.0027353782,0.0054217544,0.006516492,0.0076294695,0.036088012,0.0065252064,0.009390314,0.0016957468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006609745,0.000036579702,0.0002435982,0.00018750959,0.000056493136,0.00008877054,0.00034612694,0.0032763202,0.00030805916,0.97947663,0.002221538,0.013692354],"study_design_scores_gemma":[0.000029717068,0.000007767894,0.000037714326,0.000035363708,0.00004447471,0.000038108523,0.0001339206,0.009903871,0.0003509654,0.9862708,0.003129954,0.000017398288],"about_ca_topic_score_codex":0.0074101267,"about_ca_topic_score_gemma":0.0071772053,"teacher_disagreement_score":0.013513613,"about_ca_system_score_codex":0.008352524,"about_ca_system_score_gemma":0.0023559737,"threshold_uncertainty_score":0.06060207},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03604890839245389,"score_gpt":0.2828293850728211,"score_spread":0.24678047668036723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160395634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038829852,0.0005727233,0.9325026,0.0007161585,0.0008015284,0.0006798799,0.00041268588,0.015729213,0.009755426],"genre_scores_gemma":[0.4468134,0.00034002346,0.5338967,0.00027315764,0.00036957572,0.00062358624,0.000749952,0.0005843111,0.016349299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893564,0.000268639,0.0000993827,0.00020721077,0.00036041142,0.00012862131],"domain_scores_gemma":[0.9976768,0.00059301365,0.00011753777,0.00034929233,0.00063242397,0.00063089025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027941838,0.000704587,0.0016901714,0.0011393619,0.0022575369,0.002383974,0.0038260135,0.0011286594,0.011027151],"category_scores_gemma":[0.005038852,0.00070648873,0.00056565565,0.001342305,0.00049255055,0.0014567939,0.0021711178,0.0012441328,0.0036255296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061859693,0.0021369515,0.0055606524,0.00053439767,0.00049093994,0.000653687,0.00073638646,0.20045394,0.06855308,0.059422035,0.057615574,0.59765637],"study_design_scores_gemma":[0.001115718,0.00030009222,0.0005340842,0.000013657997,0.00013273983,0.00017430495,0.00009280399,0.94993556,0.0083462,0.0112833595,0.02800324,0.00006835514],"about_ca_topic_score_codex":0.005102391,"about_ca_topic_score_gemma":0.0059352764,"teacher_disagreement_score":0.011027151,"about_ca_system_score_codex":0.0014486884,"about_ca_system_score_gemma":0.00501673,"threshold_uncertainty_score":0.036889493},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02151735836986119,"score_gpt":0.24342231982633483,"score_spread":0.22190496145647365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163733217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36850715,0.0013602322,0.56670725,0.008084007,0.0007820805,0.00056378864,0.00242427,0.0032595093,0.048311643],"genre_scores_gemma":[0.81085044,0.00064000103,0.15753752,0.0011303694,0.0004279881,0.00028381054,0.0012927956,0.0006783257,0.027158672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986809,0.00018061175,0.00008522769,0.00042387357,0.00033850042,0.0002909098],"domain_scores_gemma":[0.9832261,0.014471008,0.0006281757,0.00081492006,0.0005529114,0.0003069794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008223668,0.0010157025,0.0015179645,0.000586466,0.001337873,0.0021386803,0.0015405522,0.0020500498,0.011244084],"category_scores_gemma":[0.009753889,0.000807257,0.0012780385,0.0013562823,0.0019742919,0.004217296,0.0022252358,0.0028093543,0.0016487953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013462948,0.00057425664,0.00417848,0.0013897172,0.00024715342,0.0015854238,0.00073010183,0.47111443,0.021522135,0.10103795,0.051307183,0.3449669],"study_design_scores_gemma":[0.00033389055,0.00028685975,0.0007096777,0.00008296328,0.00008163843,0.0005299666,0.0005062364,0.63179106,0.0091171535,0.34496865,0.011538624,0.000053211923],"about_ca_topic_score_codex":0.004559491,"about_ca_topic_score_gemma":0.0048671723,"teacher_disagreement_score":0.011244084,"about_ca_system_score_codex":0.0010042575,"about_ca_system_score_gemma":0.0012767883,"threshold_uncertainty_score":0.03761524},"labels":[],"label_agreement":null},{"id":"W2170207118","doi":"10.1006/jcss.1999.1673","title":"Circuits and Expressions with Nonassociative Gates","year":2000,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; McGill University","funders":"Santa Fe Institute; Natural Sciences and Engineering Research Council of Canada; McGill University; National Science Foundation","keywords":"Quasigroup; Mathematics; Multiplication (music); Iterated function; Group (periodic table); Abelian group; Semigroup; Counterexample; Expression (computer science); Discrete mathematics; Class (philosophy); Value (mathematics); Algebra over a field; Pure mathematics; Combinatorics; Computer science","score_opus":0.006162769610364968,"score_gpt":0.18186925985654281,"score_spread":0.17570649024617785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170207118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0738181,0.0022067311,0.8277303,0.0030170563,0.00086508313,0.000145665,0.00033599022,0.00064892904,0.09123216],"genre_scores_gemma":[0.69851166,0.0020036611,0.22296892,0.0013231278,0.0007174859,0.00043881248,0.00036007026,0.00025633106,0.07342002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888974,0.0003264216,0.0000948993,0.00025003732,0.0002811288,0.00015778274],"domain_scores_gemma":[0.99852693,0.0008854137,0.00010766901,0.00023961317,0.00017266195,0.00006752917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009258606,0.0006019418,0.00060193747,0.0010480578,0.001449139,0.0041279322,0.001098233,0.0013304721,0.007049008],"category_scores_gemma":[0.003404539,0.0004949211,0.00077095744,0.0016207208,0.0030494898,0.006550479,0.0022309313,0.0023674842,0.0014054124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013618884,0.0000061125975,0.000031044077,0.000017353985,0.000002963169,0.00003671044,0.00008307216,0.00053236604,0.00036373295,0.99158865,0.00044001092,0.006884331],"study_design_scores_gemma":[0.000008045782,0.000010302062,0.000035419336,0.000012435171,0.000010012487,0.00008281275,0.000028336819,0.004109836,0.0010920588,0.98646754,0.008135497,0.000007734638],"about_ca_topic_score_codex":0.00049341726,"about_ca_topic_score_gemma":0.00068113767,"teacher_disagreement_score":0.007049008,"about_ca_system_score_codex":0.0010952271,"about_ca_system_score_gemma":0.000827751,"threshold_uncertainty_score":0.023581207},"labels":[],"label_agreement":null},{"id":"W2192089045","doi":"10.1016/j.jcss.2015.10.004","title":"Self-regularized causal structure discovery for trajectory-based networks","year":2015,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Regularization (linguistics); Computer science; Causal structure; Trajectory; Bayesian network; Bayesian probability; Causal model; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.026347632885163855,"score_gpt":0.2808468392128732,"score_spread":0.25449920632770934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2192089045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07125106,0.000428176,0.92554635,0.0005168161,0.00003917709,0.000057032663,0.00070386764,0.0008353957,0.00062223827],"genre_scores_gemma":[0.79514456,0.00038120587,0.20002104,0.00009956733,0.00009690976,0.00012499957,0.0021997187,0.00015331252,0.0017787474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893194,0.0004149822,0.000074088115,0.000324758,0.00016985061,0.00008444273],"domain_scores_gemma":[0.9845153,0.0118565485,0.001230445,0.0011711477,0.0008804495,0.0003460876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003274075,0.0006543398,0.0014571713,0.003279075,0.00093322125,0.0017112707,0.0020360346,0.0015244917,0.0019564973],"category_scores_gemma":[0.022642922,0.0008828052,0.0013179906,0.0022563417,0.0010353304,0.0029074305,0.0016221228,0.0016811691,0.0003346459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002805955,0.00011947391,0.009442358,0.0001846045,0.0002146447,0.00024230793,0.0002641429,0.8910086,0.0011865444,0.04725301,0.0025731302,0.047230583],"study_design_scores_gemma":[0.0000038940366,0.0000044942844,0.0001761705,0.000004294607,0.0000060261314,0.000011901295,0.000008618775,0.98627454,0.00011213565,0.013274759,0.00012061542,0.000002518638],"about_ca_topic_score_codex":0.009705282,"about_ca_topic_score_gemma":0.011074411,"teacher_disagreement_score":0.009705282,"about_ca_system_score_codex":0.0012555891,"about_ca_system_score_gemma":0.001845888,"threshold_uncertainty_score":0.01929754},"labels":[],"label_agreement":null},{"id":"W2309787715","doi":"10.1016/j.jcss.2004.01.005","title":"Guest editor's foreword","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Posthumanist Ethics and Activism","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Mathematical economics; Mathematics","score_opus":0.029354016166480746,"score_gpt":0.3131934976140919,"score_spread":0.2838394814476111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2309787715","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012659478,0.0015217867,0.00009627554,0.07194195,0.9241634,0.000019009267,0.00004394795,0.000043050106,0.0020439255],"genre_scores_gemma":[0.0018470052,0.0019328537,0.0002084991,0.082612105,0.8836765,0.000050575298,0.00005543677,0.00007032246,0.029546613],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977901,0.00028384055,0.00032616084,0.0003349039,0.00095957663,0.0003054833],"domain_scores_gemma":[0.98280627,0.0042908154,0.0014528361,0.00076824834,0.008031928,0.0026500549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039077327,0.0016073632,0.002233376,0.0018967052,0.002621578,0.0053286226,0.002248458,0.01511098,0.031532258],"category_scores_gemma":[0.021131558,0.00080021896,0.001708043,0.001009696,0.0012112379,0.0024404991,0.0017663809,0.014751722,0.015468221],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003507087,0.000009658811,0.000064065374,0.0000961972,0.0000094085135,0.00027393032,0.00001222581,0.000013807479,0.000100073914,0.00021100759,0.9946556,0.0045189927],"study_design_scores_gemma":[0.00005422511,0.000047223326,0.0008678202,0.00025162,0.000042893917,0.0006079458,0.000104695726,0.00014136438,0.00028734037,0.00053967885,0.9970312,0.000023917655],"about_ca_topic_score_codex":0.0012122437,"about_ca_topic_score_gemma":0.0028304267,"teacher_disagreement_score":0.031532258,"about_ca_system_score_codex":0.0015812605,"about_ca_system_score_gemma":0.0022302298,"threshold_uncertainty_score":0.105485916},"labels":[],"label_agreement":null},{"id":"W2504879638","doi":"10.1016/j.jcss.2007.04.005","title":"Special issue: Web and mobile information systems","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Mobile and Web Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; World Wide Web","score_opus":0.00909716308528915,"score_gpt":0.24431176231938193,"score_spread":0.23521459923409277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504879638","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001131655,0.028900689,0.0012496734,0.025467873,0.8663591,0.00021541402,0.0009285195,0.00039952135,0.07534746],"genre_scores_gemma":[0.0037874253,0.027239136,0.0004459706,0.008063633,0.71942735,0.00022282958,0.0014156719,0.00046696595,0.23893096],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99798274,0.00025343464,0.00025995585,0.0003235561,0.0009122355,0.00026800472],"domain_scores_gemma":[0.98993355,0.0026476597,0.0007164334,0.0008674543,0.0036444524,0.0021904283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00295286,0.004928178,0.006730231,0.010966764,0.003906196,0.011754439,0.0035190564,0.008551621,0.19207363],"category_scores_gemma":[0.0073839105,0.0012255079,0.0024525146,0.007500717,0.0013572954,0.008854119,0.0029360084,0.00455924,0.08494128],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000576262,0.00009492785,0.00022151307,0.00048352132,0.00002572503,0.00013161427,0.000022110433,0.00008752889,0.00018670285,0.0014913105,0.97964555,0.017551977],"study_design_scores_gemma":[0.000033834134,0.00012367046,0.0020691438,0.00034949003,0.000058154754,0.00036098418,0.000082127575,0.000461826,0.00016555865,0.002363868,0.9939089,0.00002242209],"about_ca_topic_score_codex":0.001267178,"about_ca_topic_score_gemma":0.003288291,"teacher_disagreement_score":0.19207363,"about_ca_system_score_codex":0.0020398176,"about_ca_system_score_gemma":0.0021531342,"threshold_uncertainty_score":0.6425503},"labels":[],"label_agreement":null},{"id":"W2531121659","doi":"10.1016/j.jcss.2016.09.011","title":"Computing source-to-target shortest paths for complex networks in RDBMS","year":2016,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Relational database management system; Shortest path problem; Theoretical computer science; Distributed computing; Parallel computing; Relational database; Database; Graph","score_opus":0.02856876478531118,"score_gpt":0.2616750358609549,"score_spread":0.23310627107564375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531121659","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34954923,0.0012361592,0.6306647,0.0012761268,0.00019355307,0.00030312836,0.002724775,0.007166172,0.0068861544],"genre_scores_gemma":[0.5787627,0.00035805936,0.4143321,0.000133028,0.000065814216,0.00016273538,0.0024767374,0.00044395524,0.003264945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885285,0.00025968105,0.00012265633,0.00030711305,0.000305008,0.00015264623],"domain_scores_gemma":[0.9955485,0.0026221438,0.00028609938,0.00083334616,0.00044145898,0.00026836724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019432943,0.0009370686,0.0014260216,0.0016138577,0.0012498451,0.0028473632,0.0024214806,0.001496087,0.005488642],"category_scores_gemma":[0.011556265,0.0008043821,0.00082621555,0.0026736837,0.0007781917,0.0043067248,0.0019534857,0.0011131332,0.0009602165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069291185,0.00021753507,0.0041137515,0.0003865992,0.0001450401,0.00013895874,0.00037901432,0.84174633,0.005040603,0.018763449,0.0063603814,0.12201548],"study_design_scores_gemma":[0.000023284421,0.000028600398,0.0002415635,0.000008417801,0.000013417628,0.000021677486,0.00007119083,0.98003525,0.0011515879,0.017718023,0.0006811075,0.0000057796847],"about_ca_topic_score_codex":0.014892527,"about_ca_topic_score_gemma":0.022896692,"teacher_disagreement_score":0.014892527,"about_ca_system_score_codex":0.002208082,"about_ca_system_score_gemma":0.002784278,"threshold_uncertainty_score":0.029611647},"labels":[],"label_agreement":null},{"id":"W2562025978","doi":"10.1016/j.jcss.2016.12.005","title":"Secure and flexible cloud-assisted association rule mining over horizontally partitioned databases","year":2016,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"","keywords":"Association rule learning; Database; Computer science; Cloud computing; Cloud database; Data mining; Operating system","score_opus":0.036650772053093084,"score_gpt":0.279092838500106,"score_spread":0.24244206644701294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562025978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22163709,0.0009573889,0.7658268,0.001137589,0.00018694696,0.00025915576,0.0013866933,0.0059117833,0.0026966368],"genre_scores_gemma":[0.8996933,0.00024323008,0.09772436,0.00018119768,0.00007945732,0.00009274092,0.00075743266,0.00008939525,0.0011387584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625635,0.00056415057,0.00044916265,0.0006655755,0.0012927275,0.00077206123],"domain_scores_gemma":[0.98767823,0.0028735478,0.0009966864,0.0067531825,0.001284373,0.00041394876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019823886,0.0006224301,0.0014772367,0.0010129624,0.0016816701,0.0028664924,0.0024542909,0.00091031316,0.0013836484],"category_scores_gemma":[0.008198775,0.0006546551,0.000959319,0.0029357865,0.0008974732,0.0036331532,0.0042280867,0.0012396383,0.00088744133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0068719806,0.0009476285,0.023526458,0.00026859037,0.00055161805,0.0025177866,0.00063260994,0.26458603,0.0854646,0.028124781,0.021731593,0.5647764],"study_design_scores_gemma":[0.00012337683,0.00010538637,0.0018750156,0.00001618889,0.00006507984,0.0004943557,0.00020020975,0.96472913,0.015490921,0.015153105,0.0017207339,0.000026479416],"about_ca_topic_score_codex":0.0063792346,"about_ca_topic_score_gemma":0.008629627,"teacher_disagreement_score":0.0063792346,"about_ca_system_score_codex":0.0010524171,"about_ca_system_score_gemma":0.0037917027,"threshold_uncertainty_score":0.012684226},"labels":[],"label_agreement":null},{"id":"W2563013149","doi":"10.1016/j.jcss.2016.11.008","title":"Collision-free network exploration","year":2016,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Node (physics); Upper and lower bounds; Network topology; Tree (set theory); Topology (electrical circuits); Collision; Mobile agent; Distributed computing; Computer network; Combinatorics; Mathematics; Computer security; Physics","score_opus":0.03322928801255541,"score_gpt":0.25679849622801937,"score_spread":0.22356920821546394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563013149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15772128,0.0008829802,0.7882025,0.0013503464,0.00018654249,0.0003422538,0.00033836885,0.0007109724,0.0502647],"genre_scores_gemma":[0.8421841,0.00029202926,0.13920175,0.00022643837,0.000053658918,0.0003203334,0.00024606203,0.00014208608,0.017333554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963665,0.0001233125,0.000013168996,0.00006173165,0.000098724995,0.00006639445],"domain_scores_gemma":[0.9978816,0.001593533,0.00010532252,0.00016201168,0.00013682545,0.00012081322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079032447,0.0006730603,0.0010390928,0.0012566431,0.001091294,0.00088119885,0.0015588528,0.0015991353,0.008276407],"category_scores_gemma":[0.0058824574,0.0005385312,0.00072879496,0.0010453017,0.001098447,0.0018772224,0.0030529073,0.0010134488,0.00066962227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002971421,0.00008157875,0.0007337325,0.00009620938,0.000051984734,0.000093733826,0.000118832075,0.91859,0.0012109906,0.036326673,0.0032244876,0.039174587],"study_design_scores_gemma":[0.00003395843,0.000037153146,0.000092294315,0.000009306703,0.000009011338,0.000027908252,0.00002302838,0.9864667,0.0002434151,0.012416214,0.00063644187,0.0000045431843],"about_ca_topic_score_codex":0.003656162,"about_ca_topic_score_gemma":0.0044386783,"teacher_disagreement_score":0.008276407,"about_ca_system_score_codex":0.0007789013,"about_ca_system_score_gemma":0.0012182682,"threshold_uncertainty_score":0.027687311},"labels":[],"label_agreement":null},{"id":"W2585141159","doi":"10.1016/j.jcss.2017.02.001","title":"State complexity of operations on input-driven pushdown automata","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Combinatorics; State (computer science); Discrete mathematics; Mathematics; Alphabet; Automaton; Regular language; Star (game theory); Pushdown automaton; Finite-state machine; Computer science; Algorithm; Theoretical computer science","score_opus":0.05344652619702596,"score_gpt":0.29515263919310697,"score_spread":0.24170611299608102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585141159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85407877,0.00025986382,0.13579078,0.000830699,0.000046746874,0.000073455885,0.00071681995,0.00038471547,0.00781821],"genre_scores_gemma":[0.9912005,0.00009465218,0.006514321,0.000039495302,0.00003742915,0.000054967044,0.0003273687,0.00007776029,0.0016534269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672973,0.00073417765,0.0002853953,0.00053213205,0.0009878308,0.00073069136],"domain_scores_gemma":[0.9473689,0.044427313,0.0020553614,0.0024157981,0.002265301,0.0014674134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002212425,0.00069832784,0.0016630848,0.0016519396,0.001296397,0.006967764,0.0019385243,0.0016391043,0.008261859],"category_scores_gemma":[0.020719044,0.0007419816,0.0015177694,0.0016433812,0.0026682827,0.009694898,0.0027651873,0.0026391563,0.00038179877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001155109,0.0003246872,0.0061181015,0.00030290868,0.00012211679,0.00048667841,0.00132853,0.20170279,0.010607426,0.75544155,0.0017299391,0.020680223],"study_design_scores_gemma":[0.000060839677,0.00007132136,0.0009927874,0.0000148730915,0.000043190495,0.000072262694,0.0001503393,0.46415564,0.0034865828,0.53059906,0.00031305355,0.000039997773],"about_ca_topic_score_codex":0.0031712807,"about_ca_topic_score_gemma":0.0024275698,"teacher_disagreement_score":0.008261859,"about_ca_system_score_codex":0.0029478623,"about_ca_system_score_gemma":0.002370953,"threshold_uncertainty_score":0.027638674},"labels":[],"label_agreement":null},{"id":"W2608449519","doi":"10.1016/j.jcss.2017.04.001","title":"The impact of processing order on performance: A taxonomy of semi-FIFO policies","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research University Higher School of Economics","keywords":"FIFO (computing and electronics); Computer science; Order (exchange); Taxonomy (biology); Operations research; Mathematics; Business; Programming language; Biology; Finance","score_opus":0.05195371665569185,"score_gpt":0.32342264984391245,"score_spread":0.2714689331882206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608449519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51539826,0.011047317,0.4189272,0.0035073021,0.00039175243,0.0004353278,0.0007623912,0.0017092989,0.0478212],"genre_scores_gemma":[0.95551103,0.0036847466,0.03811226,0.00018736885,0.00027397118,0.000110492074,0.00015571839,0.00015597937,0.0018084953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99465287,0.0011077898,0.00052077067,0.0003927291,0.002258665,0.0010671782],"domain_scores_gemma":[0.9124268,0.067238085,0.007493688,0.005848152,0.0049583702,0.00203488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007400285,0.00088193465,0.0011183412,0.003106525,0.0009861281,0.004855025,0.0017565206,0.0012973654,0.002599773],"category_scores_gemma":[0.04607871,0.0005990395,0.00071195874,0.0037085544,0.0014309284,0.005840515,0.0012903449,0.0016262401,0.000346231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017754507,0.0010603298,0.03773467,0.0010071542,0.00028729593,0.00037355957,0.00058283476,0.3312881,0.011494266,0.23420614,0.004671484,0.37551865],"study_design_scores_gemma":[0.00009494481,0.0011800358,0.011432102,0.00024110901,0.00030094423,0.00066558743,0.00039115033,0.7406103,0.010501177,0.2275885,0.006881171,0.00011294141],"about_ca_topic_score_codex":0.0016159528,"about_ca_topic_score_gemma":0.001273058,"teacher_disagreement_score":0.007400285,"about_ca_system_score_codex":0.0020909111,"about_ca_system_score_gemma":0.0028617855,"threshold_uncertainty_score":0.039136946},"labels":[],"label_agreement":null},{"id":"W2614329595","doi":"10.1016/j.jcss.2017.05.004","title":"Formal verification of stability and chaos in periodic optical systems","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Semiconductor Lasers and Optical Devices","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Chaotic; CHAOS (operating system); Focus (optics); Viewpoints; Stability (learning theory); Resonator; Formal verification; Formal methods; Ring (chemistry); Theoretical computer science; Optics; Physics; Artificial intelligence; Programming language; Acoustics","score_opus":0.027386474101524155,"score_gpt":0.24071876631172479,"score_spread":0.21333229221020064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614329595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10624396,0.00010842821,0.8813901,0.00066908216,0.00012054987,0.0001533322,0.00015217612,0.0013657445,0.009796673],"genre_scores_gemma":[0.9309595,0.00008282888,0.06676661,0.000090388596,0.00004130209,0.000088421984,0.00012575234,0.00010369984,0.0017415192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732924,0.0008225854,0.00018277088,0.00027109802,0.0010404735,0.000353955],"domain_scores_gemma":[0.98861873,0.008518788,0.00057810894,0.0010045363,0.0011280569,0.00015175168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002942898,0.00045336093,0.0004081077,0.00066624023,0.0008750553,0.0019976224,0.001491087,0.0008055726,0.002859529],"category_scores_gemma":[0.01293985,0.0005627839,0.0012594417,0.00024693675,0.0033925474,0.0022047353,0.0018550474,0.0015440093,0.00029526153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002573503,0.00016931145,0.0015504069,0.0003346505,0.00008546525,0.00067370594,0.00092015025,0.14371504,0.022528507,0.7988058,0.0012254808,0.02973417],"study_design_scores_gemma":[0.00014413812,0.000095489326,0.000320789,0.000079502905,0.00005411461,0.00012716335,0.00014246034,0.5297188,0.02820327,0.43728966,0.0037834607,0.000041179926],"about_ca_topic_score_codex":0.003016631,"about_ca_topic_score_gemma":0.0023819946,"teacher_disagreement_score":0.003016631,"about_ca_system_score_codex":0.0011860682,"about_ca_system_score_gemma":0.0020713648,"threshold_uncertainty_score":0.015563726},"labels":[],"label_agreement":null},{"id":"W2621402653","doi":"10.1016/j.jcss.2017.12.003","title":"Towards a unified complexity theory of total functions","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation of Sri Lanka; Simons Institute for the Theory of Computing, University of California Berkeley; Environment and Climate Change Canada; National Science Foundation","keywords":"Class (philosophy); Mathematics; Complexity class; Discrete mathematics; Algebra over a field; Computer science; Theoretical computer science; Pure mathematics; Time complexity; Artificial intelligence","score_opus":0.0746962879741267,"score_gpt":0.28687240667488384,"score_spread":0.21217611870075714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621402653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02206489,0.0014352999,0.9427082,0.005126446,0.00027346404,0.00003980045,0.00020133767,0.00020908269,0.027941382],"genre_scores_gemma":[0.5890326,0.0034655682,0.3810845,0.0028847225,0.0024127194,0.0003930474,0.00070555834,0.0005438433,0.01947748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969561,0.001053676,0.00018688111,0.0005221974,0.0009694419,0.00031170997],"domain_scores_gemma":[0.99223036,0.004073355,0.00042879794,0.0013433165,0.0014237738,0.0005004107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005066989,0.0012026815,0.0018165965,0.0049692593,0.0019398938,0.007930656,0.003585723,0.0026249292,0.0048109395],"category_scores_gemma":[0.01036013,0.0010254933,0.0027631815,0.003345216,0.007593764,0.023056896,0.006446334,0.008161589,0.0009868658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025459585,0.000003479189,0.00004460005,0.000009952338,0.000002817146,0.0000049347864,0.000045532306,0.0006326709,0.00004630145,0.9974408,0.00035786757,0.0014084523],"study_design_scores_gemma":[0.000002993977,0.0000038172857,0.000037963404,0.0000066875136,0.0000031098962,0.000008742672,0.000018519891,0.004633582,0.000035111483,0.99380374,0.0014409036,0.0000047919743],"about_ca_topic_score_codex":0.0016597015,"about_ca_topic_score_gemma":0.0014074912,"teacher_disagreement_score":0.007930656,"about_ca_system_score_codex":0.0038030506,"about_ca_system_score_gemma":0.0016682969,"threshold_uncertainty_score":0.027593136},"labels":[],"label_agreement":null},{"id":"W2714643361","doi":"10.1016/s0022-0000(02)00034-x","title":"Reachability and connectivity queries in constraint databases","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Reachability; Computer science; Theoretical computer science; Path (computing); Context (archaeology); Set (abstract data type); Time complexity; Constraint (computer-aided design); Query language; Reachability problem; Datalog; Mathematics; Database; Algorithm; Programming language","score_opus":0.031986980961840494,"score_gpt":0.2640258118051083,"score_spread":0.23203883084326782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2714643361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2514659,0.002737552,0.71330726,0.005921204,0.00017748396,0.00050267397,0.006134624,0.0040303487,0.015723],"genre_scores_gemma":[0.7947304,0.00116555,0.19260852,0.00062994077,0.00021433544,0.00026963823,0.0060636527,0.00043866623,0.0038792887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920557,0.0022643146,0.0011468751,0.0013496401,0.002522821,0.00066059345],"domain_scores_gemma":[0.94902754,0.042917624,0.0019047331,0.003558184,0.0016732145,0.0009187422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057930024,0.00085114985,0.0021813833,0.0032916074,0.002400078,0.0068544946,0.0036412887,0.0034284913,0.006403293],"category_scores_gemma":[0.04425651,0.0011053655,0.0018647469,0.0075659472,0.0032396952,0.023166163,0.0046465322,0.003246235,0.0006093628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026685938,0.00055185606,0.009666749,0.0010888745,0.00031963643,0.0012697362,0.0022680603,0.18903288,0.004495222,0.63108695,0.017904418,0.13964699],"study_design_scores_gemma":[0.00026874567,0.00012423813,0.00083846063,0.000085808504,0.0001605014,0.000589333,0.0008253187,0.45957857,0.0038226454,0.5270758,0.006557343,0.00007326702],"about_ca_topic_score_codex":0.013197809,"about_ca_topic_score_gemma":0.011574166,"teacher_disagreement_score":0.013197809,"about_ca_system_score_codex":0.0026652275,"about_ca_system_score_gemma":0.0026841024,"threshold_uncertainty_score":0.030636728},"labels":[],"label_agreement":null},{"id":"W2754813051","doi":"10.1016/j.jcss.2017.10.005","title":"Use of information, memory and randomization in asynchronous gathering","year":2017,"lang":"en","type":"preprint","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Construct (python library); Computer science; Asynchronous communication; Turing machine; Theoretical computer science; Grid; Finite-state machine; Algorithm; Mathematics; Programming language","score_opus":0.03790261855482626,"score_gpt":0.2688181432647735,"score_spread":0.23091552470994722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754813051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3679226,0.0011457169,0.61161083,0.0021801123,0.00028614883,0.00018760032,0.00018779328,0.0011007308,0.015378441],"genre_scores_gemma":[0.9791403,0.00010840211,0.018911289,0.00008977266,0.000058244183,0.00007220649,0.000027834312,0.00006646768,0.0015254411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966858,0.0017879135,0.00021878675,0.00053912797,0.00038361485,0.00038472936],"domain_scores_gemma":[0.93181825,0.05422162,0.0035700162,0.007372487,0.001477881,0.0015397449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067085996,0.00060294085,0.0014795313,0.0012206231,0.0020014513,0.0036170718,0.0022460406,0.001749613,0.0050179423],"category_scores_gemma":[0.06135817,0.00075462065,0.00064755994,0.0009733291,0.0022959602,0.0065507954,0.0037313127,0.0016816405,0.00048315772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050715376,0.0007208833,0.0073025646,0.0005122799,0.00028461622,0.0006076024,0.0011730499,0.3296965,0.019283671,0.4958887,0.0046612737,0.13479738],"study_design_scores_gemma":[0.00029005922,0.00032245836,0.0007468832,0.000036938523,0.00011394382,0.00015257754,0.0001460901,0.73386747,0.005922972,0.25695994,0.0013689855,0.00007169001],"about_ca_topic_score_codex":0.0009341697,"about_ca_topic_score_gemma":0.001374411,"teacher_disagreement_score":0.0067085996,"about_ca_system_score_codex":0.0011390505,"about_ca_system_score_gemma":0.0018972541,"threshold_uncertainty_score":0.03547895},"labels":[],"label_agreement":null},{"id":"W2760351616","doi":"10.1016/j.jcss.2023.03.001","title":"The 2CNF Boolean formula satisfiability problem and the linear space hypothesis","year":2023,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Mathematics; Nondeterministic algorithm; Discrete mathematics; Maximum satisfiability problem; True quantified Boolean formula; Linear space; Boolean satisfiability problem; Time complexity; Satisfiability; Space (punctuation); Polynomial; Boolean domain; Combinatorics; NP; Boolean function; Algebra over a field; Algorithm; Computer science; Pure mathematics; Two-element Boolean algebra; Turing machine; Computation","score_opus":0.024400049774708648,"score_gpt":0.2432979119986418,"score_spread":0.21889786222393318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760351616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36463016,0.0042693997,0.49896312,0.053068765,0.00071711605,0.00025847313,0.0039997445,0.0009480025,0.073145136],"genre_scores_gemma":[0.91474223,0.0015540045,0.06590623,0.002163566,0.0014321641,0.00021993593,0.0022353283,0.00018192026,0.011564576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964784,0.0012595397,0.00014947844,0.0007607487,0.000749139,0.0006027699],"domain_scores_gemma":[0.9569326,0.03815278,0.0016053143,0.0014555057,0.001144757,0.0007090889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028571414,0.00062097545,0.0014803791,0.0019176598,0.0017322592,0.0042535206,0.0028716554,0.0034051326,0.01569578],"category_scores_gemma":[0.02898236,0.00077382656,0.0018601703,0.0028484236,0.004249814,0.014213677,0.0024186682,0.0049001947,0.0008140416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042640092,0.0002860128,0.0026557797,0.00049852626,0.00010131126,0.00036620095,0.00044229635,0.047507443,0.00083708396,0.8804126,0.02051162,0.045954764],"study_design_scores_gemma":[0.00006737347,0.000022038963,0.00045226773,0.00003455477,0.000017771556,0.0001432496,0.0001476244,0.078356676,0.00042540915,0.91822207,0.0020873018,0.000023626506],"about_ca_topic_score_codex":0.007519707,"about_ca_topic_score_gemma":0.005073801,"teacher_disagreement_score":0.01569578,"about_ca_system_score_codex":0.0027586152,"about_ca_system_score_gemma":0.0025311066,"threshold_uncertainty_score":0.05250764},"labels":[],"label_agreement":null},{"id":"W2763773774","doi":"10.1016/j.jcss.2015.06.011","title":"The complexity of minimum-length path decompositions","year":2015,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki; Narodowe Centrum Nauki","keywords":"Mathematics; Combinatorics; Pathwidth; Discrete mathematics; Path (computing); Time complexity; Graph; Generalization; Longest path problem; Chordal graph; Line graph; Computer science","score_opus":0.08791787131458557,"score_gpt":0.33166942746323375,"score_spread":0.24375155614864819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763773774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6998765,0.0021823486,0.24318764,0.007859262,0.00026673725,0.0003996149,0.0093845185,0.0020237518,0.03481968],"genre_scores_gemma":[0.85381293,0.0015243309,0.12618653,0.0004950874,0.00029505248,0.00030277827,0.0073697274,0.00079276814,0.009220822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975222,0.00065353024,0.00018011528,0.00049535296,0.0007429951,0.00040577337],"domain_scores_gemma":[0.9752407,0.019248478,0.0016261591,0.0019182638,0.0009818145,0.0009845884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017680941,0.0012232693,0.0017156443,0.0016925443,0.001424532,0.006157373,0.0029895226,0.0024617314,0.017083092],"category_scores_gemma":[0.021759674,0.0012420511,0.0016661087,0.003340074,0.0015981406,0.010379901,0.002916873,0.0027192351,0.0018540095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002955353,0.0007673615,0.008339414,0.0018979369,0.0003726337,0.0005734789,0.0013390554,0.4626088,0.017766522,0.24373998,0.043713015,0.21592635],"study_design_scores_gemma":[0.00029965065,0.00013001499,0.0013869983,0.000071744966,0.0001141034,0.00029197824,0.0004098722,0.4809095,0.0024291957,0.51068085,0.0032357613,0.000040334846],"about_ca_topic_score_codex":0.0028715571,"about_ca_topic_score_gemma":0.004049383,"teacher_disagreement_score":0.017083092,"about_ca_system_score_codex":0.002637746,"about_ca_system_score_gemma":0.0025284006,"threshold_uncertainty_score":0.057148576},"labels":[],"label_agreement":null},{"id":"W2767121203","doi":"10.1016/j.jcss.2017.09.008","title":"Recognizable series on graphs and hypergraphs","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hypergraph; Series (stratigraphy); Mathematics; Closure (psychology); Combinatorics; Learnability; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.015798208545533283,"score_gpt":0.2544205664885582,"score_spread":0.23862235794302492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767121203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19605285,0.0005668512,0.7686797,0.0008927113,0.00048265472,0.000109874345,0.0009829963,0.0030218645,0.029210588],"genre_scores_gemma":[0.8334976,0.00078107684,0.12767844,0.0003028464,0.0004854564,0.000120143064,0.0020001011,0.0007324411,0.034401864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993992,0.00014007022,0.00005151805,0.00019864486,0.00015231603,0.00005838144],"domain_scores_gemma":[0.9957379,0.0020147623,0.0006522898,0.00064641045,0.0006625627,0.000286043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056890387,0.00057385856,0.0006222957,0.0022185114,0.00060756935,0.0022698087,0.00096506695,0.0009074407,0.009106996],"category_scores_gemma":[0.005917966,0.00037006242,0.0006297118,0.001898132,0.0011564917,0.0043057124,0.0011198167,0.0014389546,0.0013232286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014038292,0.00007521935,0.0022143712,0.00016140079,0.00003083436,0.00055839674,0.00068176055,0.018003741,0.006400435,0.8787731,0.0071805282,0.08577986],"study_design_scores_gemma":[0.000014644144,0.000041213814,0.00055183034,0.000029973766,0.000019959254,0.00030188984,0.00015062782,0.090203136,0.0021978908,0.8978862,0.008586101,0.000016574539],"about_ca_topic_score_codex":0.000877205,"about_ca_topic_score_gemma":0.0011791656,"teacher_disagreement_score":0.009106996,"about_ca_system_score_codex":0.0007471898,"about_ca_system_score_gemma":0.0003251505,"threshold_uncertainty_score":0.0304659},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.055889408027295244,"score_gpt":0.27907293644530284,"score_spread":0.2231835284180076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914039150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24749364,0.0016352457,0.6353284,0.0042880983,0.0007373632,0.0002893085,0.0021563433,0.00428838,0.10378328],"genre_scores_gemma":[0.6499674,0.0009905815,0.28988945,0.0011398206,0.0004743221,0.0003077338,0.004235069,0.0012122905,0.051783368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731773,0.00077145075,0.00023255563,0.0006292078,0.0006670717,0.00038199636],"domain_scores_gemma":[0.98900616,0.0072087715,0.0003280563,0.0020503323,0.00092847616,0.00047813097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019054663,0.0011307654,0.0012803674,0.0035458987,0.0025164017,0.0041991062,0.0027009875,0.0018511896,0.017220087],"category_scores_gemma":[0.012065221,0.0010244249,0.0019991884,0.003750591,0.00219937,0.011302164,0.005503535,0.0055276155,0.0033560153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023344035,0.00028770874,0.0021421374,0.00035325772,0.00007132379,0.00013974113,0.00089488074,0.0045574107,0.0040443824,0.82580036,0.011728075,0.14974724],"study_design_scores_gemma":[0.000019256446,0.00002848514,0.0002743283,0.000038129107,0.00004775789,0.00017899316,0.00012839683,0.011927889,0.0025831566,0.97889733,0.005857977,0.000018358793],"about_ca_topic_score_codex":0.00093931274,"about_ca_topic_score_gemma":0.0016220261,"teacher_disagreement_score":0.017220087,"about_ca_system_score_codex":0.0019564182,"about_ca_system_score_gemma":0.001272624,"threshold_uncertainty_score":0.057606936},"labels":[],"label_agreement":null},{"id":"W2944983791","doi":"10.1016/j.jcss.2024.103545","title":"Online computation with untrusted advice","year":2024,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; Centro de Modelamiento Matemático, Facultad de Ciencias Físicas y Matemáticas","keywords":"Advice (programming); Bidding; Adversarial system; Computer science; Online algorithm; Competitive analysis; Computation; Generalization; Bin packing problem; Pareto principle; Mathematical optimization; Bin; Algorithm; Artificial intelligence; Upper and lower bounds; Mathematics; Business; Marketing","score_opus":0.020594512805411674,"score_gpt":0.28330973365175727,"score_spread":0.2627152208463456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944983791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20037864,0.0013867713,0.7426826,0.006818865,0.0011781054,0.00018460148,0.00070793385,0.00925497,0.037407555],"genre_scores_gemma":[0.88189924,0.00017977534,0.104760796,0.00046597805,0.00029863892,0.00009316096,0.00023385936,0.0005076632,0.0115608685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962708,0.001174603,0.00022005574,0.00064242864,0.001024636,0.0006675679],"domain_scores_gemma":[0.9712848,0.016932085,0.0005996459,0.009073777,0.0015171106,0.0005925646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027267742,0.00065782166,0.001460226,0.00069247273,0.0015198888,0.0026270233,0.0020902627,0.002407805,0.013003216],"category_scores_gemma":[0.031328943,0.00070766156,0.00081683573,0.0012568388,0.002047903,0.0058501964,0.0030667053,0.0034369621,0.0021478178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034172055,0.0009270944,0.006581051,0.00049581315,0.00024776626,0.000813777,0.0006894471,0.316593,0.007118534,0.23396155,0.043809865,0.38534492],"study_design_scores_gemma":[0.00014678476,0.00005922327,0.00023068604,0.00002320566,0.000042977954,0.00008955854,0.00003767096,0.7756844,0.0027065896,0.21852647,0.0024375026,0.000014897555],"about_ca_topic_score_codex":0.0034784868,"about_ca_topic_score_gemma":0.0056571634,"teacher_disagreement_score":0.013003216,"about_ca_system_score_codex":0.0013380934,"about_ca_system_score_gemma":0.003293227,"threshold_uncertainty_score":0.043500125},"labels":[],"label_agreement":null},{"id":"W3000767751","doi":"10.1016/j.jcss.2017.05.011","title":"Complexity of suffix-free regular languages","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki","keywords":"Suffix; Regular language; Computer science; Abstract family of languages; Mathematics; Programming language; Theoretical computer science; Linguistics; Second-generation programming language; Automaton; Fifth-generation programming language; Philosophy","score_opus":0.03649435107061784,"score_gpt":0.28232251809877423,"score_spread":0.2458281670281564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000767751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8624281,0.0006455115,0.100573935,0.004884983,0.000096496384,0.000085248605,0.0015042768,0.00046258623,0.029318783],"genre_scores_gemma":[0.9842808,0.00024640257,0.007938661,0.00017966611,0.00018402045,0.000069862006,0.0009091356,0.00010623628,0.006085276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968321,0.000710387,0.00023792645,0.0005740744,0.0011674752,0.00047810024],"domain_scores_gemma":[0.96568763,0.028209522,0.001701802,0.001633536,0.0013280186,0.0014394362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016979405,0.00055222807,0.001383317,0.0017571219,0.0016515165,0.0075252815,0.0024746659,0.001874934,0.013317219],"category_scores_gemma":[0.018060712,0.000777748,0.0014005123,0.0019313094,0.0029421118,0.012887989,0.0027917165,0.0026577446,0.00084543513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006265596,0.00024384567,0.005300948,0.0003024273,0.000081090846,0.00048594436,0.0017581579,0.041646913,0.0051873866,0.9228828,0.0041093547,0.017374618],"study_design_scores_gemma":[0.00005252103,0.000031072217,0.0007433135,0.00001125299,0.000023978166,0.00020166035,0.00016695305,0.06985483,0.0010095893,0.92701215,0.0008658944,0.000026701151],"about_ca_topic_score_codex":0.0015209009,"about_ca_topic_score_gemma":0.0015455642,"teacher_disagreement_score":0.013317219,"about_ca_system_score_codex":0.002606095,"about_ca_system_score_gemma":0.0019177664,"threshold_uncertainty_score":0.044550538},"labels":[],"label_agreement":null},{"id":"W3040096682","doi":"10.1016/j.jcss.2022.02.004","title":"Complexity of the multilevel critical node problem","year":2022,"lang":"en","type":"preprint","venue":"Journal of Computer and System Sciences","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Institut de Valorisation des Données","keywords":"Unitary state; Node (physics); Computer science; Combinatorics; Graph; Computational complexity theory; Theoretical computer science; Time complexity; Sigma; Discrete mathematics; Mathematics; Algorithm","score_opus":0.03471655478964366,"score_gpt":0.2808616398586547,"score_spread":0.24614508506901103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040096682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51958513,0.001841382,0.3911151,0.0117243435,0.00022237915,0.00014085288,0.0012616684,0.00019438205,0.07391478],"genre_scores_gemma":[0.9715375,0.000743327,0.020379828,0.0002119949,0.00024797366,0.00010691498,0.00040819639,0.000049646922,0.0063147615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993555,0.00021230568,0.000024067425,0.00010421384,0.0001812673,0.00012261195],"domain_scores_gemma":[0.99404055,0.0047863103,0.00046625093,0.00017197768,0.0002681504,0.0002667168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096786296,0.0003798103,0.0010593125,0.0010898344,0.00090421323,0.002403029,0.0011108177,0.0013620917,0.007833921],"category_scores_gemma":[0.009214871,0.0004018846,0.0007929232,0.0009556103,0.001405715,0.0032125742,0.0018776237,0.0017233423,0.00022912101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006712805,0.000050153463,0.0015556642,0.00015190383,0.00005042732,0.0002280999,0.00013839538,0.26213798,0.00055687025,0.72179824,0.0048066033,0.0084584635],"study_design_scores_gemma":[0.000019699344,0.000008692168,0.00034828045,0.0000137599945,0.00001037942,0.000059652124,0.00006466525,0.34415394,0.00009286255,0.6543214,0.00089774706,0.000008953747],"about_ca_topic_score_codex":0.003668591,"about_ca_topic_score_gemma":0.0020848885,"teacher_disagreement_score":0.007833921,"about_ca_system_score_codex":0.0014446238,"about_ca_system_score_gemma":0.0012341352,"threshold_uncertainty_score":0.02620709},"labels":[],"label_agreement":null},{"id":"W3160973854","doi":"10.1016/j.jcss.2021.04.003","title":"Exploration of dynamic networks: Tight bounds on the number of agents","year":2021,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Computer science; Graph; Interval (graph theory); Upper and lower bounds; Mathematics; Discrete mathematics; Topology (electrical circuits); Combinatorics; Theoretical computer science","score_opus":0.044241695295764084,"score_gpt":0.3022377106508853,"score_spread":0.2579960153551212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160973854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14933406,0.009354356,0.7677382,0.012407946,0.00044478063,0.00037320008,0.0011179843,0.0012317464,0.05799765],"genre_scores_gemma":[0.84084815,0.004950993,0.13394983,0.001474123,0.00051215757,0.00064921903,0.0007753797,0.00095548487,0.015884789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954457,0.0020071403,0.00018666597,0.000740729,0.00076040364,0.0008593205],"domain_scores_gemma":[0.8639355,0.12093477,0.004423125,0.00462628,0.002145967,0.0039344137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008275158,0.003053961,0.0043862457,0.0028781455,0.0024435355,0.005268781,0.0048909304,0.0045296378,0.01230228],"category_scores_gemma":[0.086032584,0.0026556435,0.002316359,0.0029585203,0.00536636,0.014486095,0.008385102,0.007044614,0.0011072088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011985278,0.0003558516,0.0027428465,0.00076576544,0.00024379589,0.00020966111,0.00046840942,0.8121205,0.0022946603,0.13447008,0.008688273,0.03644164],"study_design_scores_gemma":[0.000079145255,0.000103910934,0.000344326,0.00012773075,0.00005958084,0.00012479353,0.00009369968,0.8684056,0.000730505,0.12823935,0.0016686842,0.00002268181],"about_ca_topic_score_codex":0.0028113988,"about_ca_topic_score_gemma":0.00532716,"teacher_disagreement_score":0.01230228,"about_ca_system_score_codex":0.0030315684,"about_ca_system_score_gemma":0.0033570041,"threshold_uncertainty_score":0.043763697},"labels":[],"label_agreement":null},{"id":"W4211106120","doi":"10.1016/j.jcss.2004.12.007","title":"Guest Editors’ foreword","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Posthumanist Ethics and Activism","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.03393722967457864,"score_gpt":0.32133505394816453,"score_spread":0.2873978242735859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211106120","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014371566,0.0028296488,0.00015092618,0.05108235,0.9404311,0.000032007356,0.00006935533,0.000084305226,0.0051765917],"genre_scores_gemma":[0.0028191218,0.0031398437,0.00028615212,0.051448125,0.86257285,0.00009873424,0.00012588814,0.0001360472,0.0793732],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977452,0.00029619157,0.00029132713,0.00036009555,0.0010135389,0.00029366833],"domain_scores_gemma":[0.9815388,0.0035889444,0.0013896122,0.0008829535,0.009240292,0.0033594624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041299006,0.0014976792,0.0017928598,0.002143243,0.0022218768,0.00544743,0.0021195565,0.00816272,0.056574788],"category_scores_gemma":[0.021427691,0.0006124913,0.0012632405,0.0010362042,0.0009228538,0.00285551,0.0021922167,0.009269651,0.03238848],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000297493,0.000008878922,0.000054574335,0.00008888093,0.0000048139805,0.000099882636,0.000012832531,0.000012465336,0.00009740606,0.0002738031,0.99130416,0.008012428],"study_design_scores_gemma":[0.00002638956,0.000031389045,0.00047946072,0.00013219443,0.000015636802,0.00021647313,0.00005544204,0.00008057473,0.00020747873,0.0004400423,0.99830246,0.000012359977],"about_ca_topic_score_codex":0.0009308746,"about_ca_topic_score_gemma":0.0018440507,"teacher_disagreement_score":0.056574788,"about_ca_system_score_codex":0.0013520812,"about_ca_system_score_gemma":0.0021185593,"threshold_uncertainty_score":0.18926156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03716863265475034,"score_gpt":0.2944975212328642,"score_spread":0.25732888857811387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213246264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009990916,0.02078734,0.87285554,0.014868742,0.0010016373,0.00019460097,0.0009239708,0.0008064817,0.078570746],"genre_scores_gemma":[0.38805822,0.033640906,0.5456569,0.004256942,0.0042240517,0.0006459564,0.0029455493,0.00038017114,0.02019122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99345654,0.0018114386,0.00093894236,0.0010452386,0.0024194948,0.0003283721],"domain_scores_gemma":[0.99054784,0.0050217714,0.0004681129,0.0023230854,0.0012702763,0.00036885653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006015097,0.00076945976,0.0015356877,0.0059968387,0.002967773,0.015195647,0.0032106205,0.0032084193,0.0063864626],"category_scores_gemma":[0.012839356,0.0017737985,0.001692541,0.008864591,0.0069310525,0.023336116,0.0059419563,0.0056214808,0.0020459625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000784095,0.000018330966,0.00008459122,0.000065238666,0.000013730031,0.00003951978,0.0001312065,0.0006734177,0.000090185764,0.9862432,0.001442272,0.011190518],"study_design_scores_gemma":[0.0000058655255,0.000003738923,0.00004662709,0.00005835622,0.000011572712,0.000055428998,0.00005398984,0.0038077415,0.000138808,0.975086,0.02072576,0.0000061555247],"about_ca_topic_score_codex":0.003519573,"about_ca_topic_score_gemma":0.0021293033,"teacher_disagreement_score":0.015195647,"about_ca_system_score_codex":0.0029978356,"about_ca_system_score_gemma":0.00355564,"threshold_uncertainty_score":0.031811237},"labels":[],"label_agreement":null},{"id":"W4401074641","doi":"10.1016/j.jcss.2024.103574","title":"Minimum separator reconfiguration","year":2024,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Japan Society for the Promotion of Science; Banff International Research Station for Mathematical Innovation and Discovery; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Control reconfiguration; Separator (oil production); Computer science; Mathematical optimization; Mathematics; Embedded system; Physics","score_opus":0.024473958951421855,"score_gpt":0.2856749715242304,"score_spread":0.26120101257280853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401074641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24008608,0.0012349908,0.631239,0.0016543902,0.00050284364,0.0001755126,0.0008995471,0.003627516,0.12058014],"genre_scores_gemma":[0.9051902,0.00021209425,0.07481048,0.00015580228,0.00007141036,0.000086704946,0.0005592247,0.00034324554,0.018570669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996983,0.00006751303,0.000014687443,0.00009409475,0.000057056986,0.000068357986],"domain_scores_gemma":[0.9995912,0.0001377444,0.000055652807,0.00010329593,0.000063974374,0.00004810969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002626011,0.00095375476,0.00094290165,0.00087778777,0.00082851044,0.0012220412,0.0008283609,0.0011661558,0.014899775],"category_scores_gemma":[0.0012932294,0.0004020157,0.0005796156,0.0008219845,0.00040247352,0.0015539991,0.0010249849,0.00091528054,0.0020623815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019239456,0.00031814646,0.0012181149,0.0006970316,0.00019219916,0.000810293,0.00017914984,0.45787087,0.075266786,0.054560214,0.023368202,0.3835951],"study_design_scores_gemma":[0.00015681713,0.0005118557,0.0015211694,0.00008256537,0.00009976919,0.0008563905,0.000131963,0.88427216,0.038383856,0.055149686,0.018782077,0.000051685583],"about_ca_topic_score_codex":0.00035543914,"about_ca_topic_score_gemma":0.000776461,"teacher_disagreement_score":0.014899775,"about_ca_system_score_codex":0.00057721057,"about_ca_system_score_gemma":0.00046419998,"threshold_uncertainty_score":0.049844682},"labels":[],"label_agreement":null},{"id":"W4404626973","doi":"10.1016/j.jcss.2024.103605","title":"Time-sharing scheduling with tolerance capacities","year":2024,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Distributed computing; Mathematical optimization; Mathematics","score_opus":0.0117924527015338,"score_gpt":0.21807835862218197,"score_spread":0.20628590592064816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404626973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2859967,0.00088696845,0.69174,0.0009496305,0.000472818,0.00020593478,0.00043796212,0.0011913955,0.018118659],"genre_scores_gemma":[0.97014284,0.00015219956,0.026825383,0.00007164498,0.000092643284,0.00005522816,0.000072953895,0.00006775698,0.0025192662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985864,0.0004137032,0.00007256193,0.0001781249,0.0002507868,0.00049832556],"domain_scores_gemma":[0.9944022,0.0030267842,0.0005029657,0.0007991537,0.00054902764,0.0007197389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018416668,0.00079106214,0.001461112,0.0008586273,0.0012846568,0.0019497186,0.0022606063,0.0009805968,0.004798889],"category_scores_gemma":[0.007433863,0.0005136969,0.00065184885,0.0017715212,0.0007926396,0.0021825503,0.0016983658,0.0013102626,0.00041792067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009100309,0.00016360769,0.00041265532,0.00015298185,0.00005955958,0.00015977443,0.0001127596,0.89436316,0.0052390643,0.06620207,0.002548842,0.029675562],"study_design_scores_gemma":[0.000049991533,0.00013560368,0.00014016275,0.000009835246,0.000023390596,0.000046584748,0.000038864517,0.9673597,0.0015747594,0.029853994,0.00074889,0.000018136358],"about_ca_topic_score_codex":0.0037073954,"about_ca_topic_score_gemma":0.0025246644,"teacher_disagreement_score":0.004798889,"about_ca_system_score_codex":0.0016977167,"about_ca_system_score_gemma":0.0021750862,"threshold_uncertainty_score":0.016053855},"labels":[],"label_agreement":null},{"id":"W4410397800","doi":"10.1016/j.jcss.2025.103678","title":"Weighted group search on the disk & improved lower bounds for priority evacuation","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Group (periodic table); Computer science; Combinatorics; Mathematics; Mathematical optimization; Chemistry","score_opus":0.031114535952634755,"score_gpt":0.3065126150479861,"score_spread":0.27539807909535136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410397800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03184381,0.0024378768,0.9469562,0.0014815978,0.00023822596,0.00010087131,0.00025614622,0.00028041037,0.016404822],"genre_scores_gemma":[0.66523296,0.0030348909,0.30949697,0.0009203333,0.0005548502,0.0005453335,0.00071703526,0.0006939041,0.018803734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787354,0.0008293598,0.00006998081,0.00032115306,0.00045222946,0.0004537077],"domain_scores_gemma":[0.99231684,0.005369629,0.0006229948,0.00056254986,0.000564872,0.00056313217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027300152,0.002360935,0.0019145154,0.0014046577,0.0010710394,0.002141237,0.003194048,0.0019259948,0.007790113],"category_scores_gemma":[0.018214421,0.000623042,0.0012807559,0.0020311032,0.001589203,0.0072502466,0.0034688755,0.003975597,0.0012840831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045680313,0.00026938872,0.0010756216,0.00052887655,0.00011003214,0.00016217725,0.00034471543,0.6814015,0.0036553696,0.24923487,0.011636006,0.05112465],"study_design_scores_gemma":[0.00002403461,0.00010104205,0.00015721309,0.00004540388,0.0000212184,0.000039062958,0.00006401277,0.9080177,0.00076470507,0.08773136,0.0030190006,0.000015325864],"about_ca_topic_score_codex":0.0023562168,"about_ca_topic_score_gemma":0.002408639,"teacher_disagreement_score":0.007790113,"about_ca_system_score_codex":0.0021127427,"about_ca_system_score_gemma":0.0013412442,"threshold_uncertainty_score":0.026060522},"labels":[],"label_agreement":null},{"id":"W4410616320","doi":"10.1016/j.jcss.2025.103679","title":"An FPT algorithm for timeline cover","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Timeline; Cover (algebra); Computer science; Algorithm; Mathematics; Engineering; Statistics","score_opus":0.012408226805731665,"score_gpt":0.28855826537174345,"score_spread":0.2761500385660118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410616320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04415751,0.0012239,0.92836946,0.0021392973,0.00026203456,0.00047199728,0.0017655988,0.0063333535,0.015276916],"genre_scores_gemma":[0.2727307,0.00053385907,0.71418256,0.00083327666,0.00023053649,0.0005801073,0.0037270363,0.0007255523,0.006456409],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799466,0.00024105732,0.00012552705,0.0005725611,0.0007138816,0.00035223874],"domain_scores_gemma":[0.9958851,0.0027308594,0.00019278722,0.0006429122,0.00041596591,0.00013237013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010538574,0.0012560765,0.0014715189,0.0011932435,0.0011134635,0.002099681,0.0021676167,0.0022868393,0.007263678],"category_scores_gemma":[0.007376784,0.00047634853,0.0015503524,0.0023342662,0.0011827135,0.0039464994,0.002041212,0.0024059492,0.001443237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008635764,0.0005078229,0.0018591873,0.00074151455,0.00014816917,0.0007730248,0.0005850488,0.17588712,0.017150896,0.115692176,0.050624248,0.63516724],"study_design_scores_gemma":[0.00022478293,0.0002413513,0.00048345234,0.00007455674,0.00010076748,0.00095087587,0.0002003905,0.7667186,0.011819743,0.20249721,0.016639302,0.000048901802],"about_ca_topic_score_codex":0.0030872328,"about_ca_topic_score_gemma":0.0029871545,"teacher_disagreement_score":0.007263678,"about_ca_system_score_codex":0.0023454754,"about_ca_system_score_gemma":0.00215448,"threshold_uncertainty_score":0.024299443},"labels":[],"label_agreement":null},{"id":"W4412791354","doi":"10.1016/j.jcss.2025.103696","title":"Exploring wedges of an oriented grid by an automaton with pebbles","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Grid; Automaton; Computer science; Cellular automaton; Theoretical computer science; Mathematics; Algorithm; Geometry","score_opus":0.042991125658790104,"score_gpt":0.2750190246847915,"score_spread":0.2320278990260014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412791354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50033563,0.00019933571,0.48310655,0.00026626233,0.00011386568,0.00008383639,0.00019073041,0.00079677004,0.014906962],"genre_scores_gemma":[0.8906692,0.00009783383,0.10603583,0.00005880757,0.000009330238,0.000080326776,0.000153572,0.00011164431,0.0027834259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998271,0.000047884598,0.000011752353,0.00005134162,0.00002950194,0.000032313812],"domain_scores_gemma":[0.99926215,0.00040468219,0.000052983472,0.000109105975,0.000056993922,0.000114136055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025692486,0.00038981935,0.0007736211,0.00045757776,0.00079609663,0.000910138,0.0011103082,0.00085885107,0.005910626],"category_scores_gemma":[0.0015290973,0.00056807155,0.0006720655,0.0004671105,0.0010198564,0.0013504911,0.002157697,0.0007325631,0.00055254815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005017586,0.00014542001,0.0029085486,0.00012597542,0.00004977383,0.0006406317,0.00035901775,0.8967018,0.011210626,0.057274703,0.0012879696,0.028793816],"study_design_scores_gemma":[0.000033241533,0.000065034365,0.00012417835,0.0000147458895,0.00000890403,0.000036006615,0.00007483604,0.9765797,0.00086400507,0.021418469,0.0007704727,0.000010449294],"about_ca_topic_score_codex":0.0034207627,"about_ca_topic_score_gemma":0.0033378606,"teacher_disagreement_score":0.005910626,"about_ca_system_score_codex":0.00040922497,"about_ca_system_score_gemma":0.00055496977,"threshold_uncertainty_score":0.019773066},"labels":[],"label_agreement":null},{"id":"W4412791763","doi":"10.1016/j.jcss.2025.103695","title":"Triangle evacuation of 2 agents in the wireless model & the power of choosing a starting point","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless; Computer science; Point (geometry); Power (physics); Power point; Mathematical economics; Mathematics; Telecommunications; Physics","score_opus":0.06209018673215274,"score_gpt":0.32834209363200356,"score_spread":0.26625190689985084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412791763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11667328,0.0007436573,0.8449037,0.002079818,0.00014993215,0.00025592957,0.0005081803,0.00018228711,0.034503184],"genre_scores_gemma":[0.8023467,0.0009969955,0.16677265,0.00034158494,0.000120696,0.00035783628,0.0004935777,0.00013137962,0.028438462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988544,0.0004734216,0.000039539278,0.00022815078,0.00015576406,0.00024878592],"domain_scores_gemma":[0.9971879,0.001920553,0.0002979515,0.00022923278,0.00011952542,0.00024494078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012453598,0.0008719787,0.0011447639,0.00046643303,0.0010331456,0.001726805,0.0020753765,0.002228975,0.007841274],"category_scores_gemma":[0.0065202075,0.00056783337,0.0015165536,0.0009877924,0.0019518695,0.003309043,0.0030978792,0.002291615,0.00073063874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028507411,0.000057956608,0.00045515507,0.00010251557,0.000027083579,0.0002596957,0.00017640984,0.835323,0.00076987786,0.15311238,0.0021528543,0.0072781],"study_design_scores_gemma":[0.000039623876,0.000058448753,0.00007872104,0.000013481023,0.00000972707,0.000063689105,0.00007592327,0.94997025,0.0002458514,0.047683626,0.001751403,0.000009199574],"about_ca_topic_score_codex":0.007843938,"about_ca_topic_score_gemma":0.007507056,"teacher_disagreement_score":0.007843938,"about_ca_system_score_codex":0.001488746,"about_ca_system_score_gemma":0.0010921208,"threshold_uncertainty_score":0.026231647},"labels":[],"label_agreement":null},{"id":"W4415829623","doi":"10.1016/j.jcss.2025.103727","title":"Algorithms and hardness results for the (k,ℓ)-cover problem","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Approximation algorithm; Efficient algorithm; Minification; Key (lock)","score_opus":0.027734756578015954,"score_gpt":0.2790050750009111,"score_spread":0.25127031842289516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415829623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2967536,0.005611297,0.6074074,0.018297222,0.00041851666,0.0008643283,0.0065371906,0.0038111995,0.060299363],"genre_scores_gemma":[0.63585776,0.004416228,0.3270545,0.001962197,0.0011759789,0.00095918245,0.010801969,0.0010099865,0.01676227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966678,0.00062815746,0.00024193642,0.0010932784,0.0006613464,0.0007074988],"domain_scores_gemma":[0.9864646,0.009842196,0.0010959556,0.0016037611,0.00045929753,0.0005341246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001721268,0.0019441978,0.0016648046,0.0015702597,0.0024505265,0.0061665275,0.0040666135,0.0038111527,0.0082511455],"category_scores_gemma":[0.012104057,0.0011499423,0.0028716242,0.0031880839,0.0027009323,0.013498734,0.0030737196,0.005239833,0.001703908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036230425,0.0021002565,0.011639002,0.0028736,0.00057354226,0.000915942,0.0020976982,0.32053202,0.015491646,0.33909634,0.074857906,0.22619899],"study_design_scores_gemma":[0.0004937707,0.00021322869,0.0029418292,0.00019848572,0.00024685968,0.0014375462,0.0004585778,0.4692757,0.0069275545,0.49842882,0.019256862,0.00012079168],"about_ca_topic_score_codex":0.0042863516,"about_ca_topic_score_gemma":0.003686616,"teacher_disagreement_score":0.0082511455,"about_ca_system_score_codex":0.003855867,"about_ca_system_score_gemma":0.0028340977,"threshold_uncertainty_score":0.027976394},"labels":[],"label_agreement":null},{"id":"W4416918872","doi":"10.1016/j.jcss.2025.103738","title":"Induced minor models. I. Structural properties and algorithmic consequences","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Agence Nationale de la Recherche; Univerza na Primorskem","keywords":"Minor (academic); Set (abstract data type); Term (time)","score_opus":0.03526396190237045,"score_gpt":0.2711670785014451,"score_spread":0.23590311659907465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416918872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2976306,0.0009906911,0.66536707,0.0021202252,0.0001508475,0.00045255566,0.0015303381,0.0015738177,0.030183826],"genre_scores_gemma":[0.856773,0.00035840282,0.13220878,0.00043780424,0.00016986232,0.00037180563,0.0019780563,0.00022428329,0.0074780746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985885,0.00027620938,0.00008003385,0.00048654474,0.0003485155,0.00022015872],"domain_scores_gemma":[0.9923006,0.003861598,0.0011736044,0.0014361019,0.00064724503,0.0005808201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009695902,0.0006193329,0.00065534026,0.0010357226,0.0012607829,0.0023178337,0.002061818,0.0013221601,0.00588816],"category_scores_gemma":[0.0073258257,0.00075272564,0.001478069,0.0011593534,0.002012244,0.005869285,0.002128595,0.00203174,0.00076308317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036775018,0.00033281985,0.008201278,0.000368868,0.000093764305,0.0005034179,0.0010209893,0.030407492,0.014909672,0.90385705,0.008262272,0.031674616],"study_design_scores_gemma":[0.00007523686,0.00014867533,0.0015627077,0.00004022291,0.000059274927,0.0009788347,0.00032167175,0.13978785,0.0063376366,0.841638,0.009012668,0.00003711248],"about_ca_topic_score_codex":0.0012664347,"about_ca_topic_score_gemma":0.0022397202,"teacher_disagreement_score":0.00588816,"about_ca_system_score_codex":0.0016595349,"about_ca_system_score_gemma":0.00079606095,"threshold_uncertainty_score":0.019697845},"labels":[],"label_agreement":null},{"id":"W4417123665","doi":"10.1016/j.jcss.2025.103737","title":"The power of knowledge in linear search for an escaping target","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Diffusion and Search Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Power (physics); Key (lock); Linear programming; Search algorithm","score_opus":0.01934607989761594,"score_gpt":0.33033797060412284,"score_spread":0.3109918907065069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417123665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1881476,0.0054404666,0.74260247,0.008677191,0.00016774108,0.00011986245,0.00039147196,0.0006645034,0.053788707],"genre_scores_gemma":[0.9572662,0.0023139145,0.03318476,0.00048464132,0.00023808281,0.00009436319,0.00013609996,0.00020997072,0.0060719023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961719,0.0012367604,0.00013065166,0.00071262976,0.00083304616,0.0009150094],"domain_scores_gemma":[0.9228491,0.06935748,0.0023501508,0.0027769252,0.0012543541,0.0014119562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044854027,0.0013196013,0.0029307979,0.0020955729,0.0017149756,0.0056131547,0.004233207,0.0029971404,0.0053746887],"category_scores_gemma":[0.042780027,0.0008978115,0.0013220193,0.0026978746,0.006945505,0.01674779,0.0048536826,0.00395223,0.00088453933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079962175,0.00017393561,0.0016729818,0.00051074446,0.00012892632,0.00030163783,0.0005030731,0.5157174,0.0031251777,0.44458887,0.0029045583,0.029573187],"study_design_scores_gemma":[0.000044545246,0.000055974393,0.00016419342,0.000033127348,0.000027564609,0.000084163774,0.000052994375,0.7369649,0.00091746356,0.2608792,0.0007502047,0.0000257514],"about_ca_topic_score_codex":0.004351227,"about_ca_topic_score_gemma":0.0022860211,"teacher_disagreement_score":0.0056131547,"about_ca_system_score_codex":0.0042229644,"about_ca_system_score_gemma":0.0020077855,"threshold_uncertainty_score":0.030639887},"labels":[],"label_agreement":null}]}