{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4945794,0.0004260534,0.48338473,0.00055190263,0.0027124954,0.00013298249,0.000006056013,0.000004937098,0.018201469],"genre_scores_gemma":[0.97515506,0.000031364714,0.016689772,0.00032234236,0.0077425884,1.9807312e-7,0.0000029784856,0.0000031094007,0.000052617463],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893606,0.000056511213,0.00036390562,0.00011542842,0.0003378054,0.00019026775],"domain_scores_gemma":[0.9994368,0.00005419619,0.00015002348,0.00005977962,0.00015851903,0.0001406998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017133178,0.00007724369,0.00014210967,0.00013581035,0.0000916964,0.00005193388,0.0002347569,0.00007250978,0.0000064239903],"category_scores_gemma":[0.00003407374,0.00005211489,0.000060545644,0.00009126754,0.00028295137,0.000004751714,0.00006741849,0.000074004965,0.000006223999],"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.0005947657,0.00038280484,0.010295701,0.00036750842,0.00032028742,0.00019362995,0.000995358,0.0042380854,0.04014853,0.023131974,0.07930559,0.8400258],"study_design_scores_gemma":[0.0066604526,0.033890862,0.035698216,0.00075360766,0.00007936255,0.0037803706,0.004278388,0.035257623,0.05900485,0.0060785837,0.8129882,0.0015294481],"about_ca_topic_score_codex":0.0000014163303,"about_ca_topic_score_gemma":0.0000010858229,"teacher_disagreement_score":0.8384963,"about_ca_system_score_codex":0.000009681535,"about_ca_system_score_gemma":0.000086933636,"threshold_uncertainty_score":0.21251835},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1322112,0.0004220395,0.86424494,0.0006137053,0.0006317406,0.00009155038,8.5316464e-7,0.00002914788,0.0017548611],"genre_scores_gemma":[0.9204161,0.000008209918,0.07935771,0.000088374654,0.00011528642,6.2515727e-7,3.9612406e-8,0.0000019071468,0.000011753402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982328,0.00032823914,0.00040424254,0.0001897323,0.0006555796,0.00018944808],"domain_scores_gemma":[0.9984971,0.00028435997,0.00034225755,0.00014384392,0.00050322176,0.00022918402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030570228,0.00009417045,0.0002547909,0.00027140288,0.0001624805,0.00032854927,0.00057277497,0.000029546121,0.0000012560787],"category_scores_gemma":[0.000049170318,0.00006414044,0.000051523868,0.00056817906,0.00035324905,0.0010921234,0.00013892265,0.00013807607,0.000004226937],"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.00006076627,0.00004341809,0.042135194,0.00009447813,0.00008332607,0.000242974,0.004913696,0.0018197243,0.00034827748,0.81591046,0.0040624146,0.13028526],"study_design_scores_gemma":[0.005662269,0.0080725625,0.09750626,0.0019316006,0.000044953413,0.01205012,0.015136443,0.7383683,0.0014686,0.113948815,0.004587585,0.0012225197],"about_ca_topic_score_codex":0.000008593792,"about_ca_topic_score_gemma":0.0000016575148,"teacher_disagreement_score":0.7882049,"about_ca_system_score_codex":0.000053304186,"about_ca_system_score_gemma":0.00023791661,"threshold_uncertainty_score":0.31682083},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20069097,0.0006291744,0.79611105,0.00092916476,0.0010760864,0.00005385077,8.3698575e-7,0.000029220062,0.00047968575],"genre_scores_gemma":[0.9563767,0.000043311644,0.04319234,0.00007932608,0.00026278113,4.5838354e-7,7.666578e-9,0.0000018682717,0.00004322159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986833,0.00010241533,0.00038785904,0.00021472963,0.00038600698,0.00022570866],"domain_scores_gemma":[0.99897844,0.00036457408,0.00026814637,0.000121581295,0.00011209588,0.00015518967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014957645,0.00010122846,0.00024451796,0.0001864498,0.00029638116,0.0004246739,0.00063678663,0.000027931907,0.0000020896075],"category_scores_gemma":[0.000018176028,0.000049683076,0.00004894835,0.00030400572,0.0002105735,0.0009413563,0.00020062957,0.00006211064,0.0000016597419],"study_design_candidate":"design_other","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.0000089164405,0.000040011084,0.0075658355,0.00010872581,0.000043621225,0.00016211165,0.0017542886,0.000031749623,0.0006665318,0.16125001,0.0011526447,0.82721555],"study_design_scores_gemma":[0.0083835265,0.011053126,0.1518183,0.009600435,0.0000994161,0.058217652,0.0024271344,0.68530995,0.002740035,0.049112555,0.018599583,0.0026382739],"about_ca_topic_score_codex":0.0000043827627,"about_ca_topic_score_gemma":0.0000027665885,"teacher_disagreement_score":0.8245773,"about_ca_system_score_codex":0.000016585402,"about_ca_system_score_gemma":0.000098026954,"threshold_uncertainty_score":0.40951404},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55246323,0.0003408868,0.4463509,0.00031891747,0.00039582947,0.00004457348,7.419067e-7,0.000017991637,0.00006692601],"genre_scores_gemma":[0.97889346,0.000020101299,0.020889355,0.0000280093,0.00016239753,2.0943337e-7,6.617786e-8,0.0000024860108,0.0000038992785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848276,0.00023735585,0.0004765142,0.00022055228,0.00039907894,0.00018373769],"domain_scores_gemma":[0.9984362,0.0007507642,0.00038483087,0.00012748025,0.0001728449,0.00012789493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011031233,0.000119628414,0.00040275397,0.0002854738,0.00027711896,0.0002093313,0.0004232177,0.000043022545,6.636781e-7],"category_scores_gemma":[0.000025790727,0.00007891786,0.000085351356,0.0005708431,0.00024729315,0.00032759522,0.00013695048,0.000145151,1.8979149e-7],"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.00030534744,0.00078340777,0.057560585,0.0005790383,0.00045736745,0.0004191229,0.0135467695,0.20919348,0.003308885,0.22017656,0.00093820156,0.4927312],"study_design_scores_gemma":[0.00081252155,0.0004377072,0.014701537,0.00018252424,0.000010761466,0.0011132928,0.0000770867,0.9800364,0.000036482594,0.0023552661,0.00013481668,0.00010162641],"about_ca_topic_score_codex":0.000016829494,"about_ca_topic_score_gemma":0.000003960544,"teacher_disagreement_score":0.7708429,"about_ca_system_score_codex":0.000009862993,"about_ca_system_score_gemma":0.000074492986,"threshold_uncertainty_score":0.32181767},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93960106,0.0019238038,0.057827577,0.000117366326,0.00024355802,0.000039727423,0.0000022740087,0.000007676105,0.00023696962],"genre_scores_gemma":[0.996647,0.00002125196,0.0026529455,0.00010898562,0.000481476,3.822156e-7,2.8438163e-7,0.0000036790234,0.000084006984],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990948,0.00010849717,0.00028978742,0.000183561,0.00016273894,0.00016061861],"domain_scores_gemma":[0.9995222,0.000028423307,0.00021611738,0.000078570025,0.00008031807,0.00007438117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008452588,0.00009307307,0.00018333073,0.00004255422,0.00012665371,0.000076906275,0.00021263135,0.00006263676,0.0000011328395],"category_scores_gemma":[0.000009669312,0.000045151257,0.00006700964,0.00008254649,0.00007363577,0.000007585036,0.00007872084,0.000033453023,0.0000011559617],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000014436658,0.000007714021,0.0020706386,0.000031431748,0.000027550339,0.000011691242,0.00009410402,0.000010943639,0.9832319,0.00014102325,0.0013342535,0.0130243385],"study_design_scores_gemma":[0.0029129246,0.0041334713,0.0024578015,0.0034259425,0.00008161549,0.004768275,0.0044550085,0.014001632,0.94799536,0.000039981125,0.014790397,0.0009375868],"about_ca_topic_score_codex":0.0000049385567,"about_ca_topic_score_gemma":5.1734196e-7,"teacher_disagreement_score":0.05704594,"about_ca_system_score_codex":0.000014169097,"about_ca_system_score_gemma":0.00002626195,"threshold_uncertainty_score":0.18412149},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30185208,0.00013236536,0.6970744,0.00012473787,0.0006281124,0.00011541391,0.0000011365252,0.000025653666,0.000046098958],"genre_scores_gemma":[0.9356843,0.0000035673636,0.06401634,0.000034842105,0.0002528878,0.000001941109,1.2509898e-7,0.0000034668944,0.0000024988756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982185,0.00017724601,0.00060519774,0.0002714928,0.0005445349,0.00018308048],"domain_scores_gemma":[0.9984898,0.00020632135,0.00058351405,0.0002656229,0.0002864085,0.00016833724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011264028,0.00012617989,0.00036384095,0.00034150435,0.00023581149,0.00017724797,0.0011150478,0.00003380922,1.18648806e-7],"category_scores_gemma":[0.000012016548,0.00008593767,0.00006326209,0.0005448707,0.000107824504,0.000572497,0.0001534429,0.00011755591,0.0000014187144],"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.000062463994,0.0004667057,0.0058999765,0.00047939894,0.000104519284,0.00016025166,0.020237964,0.73249745,0.0016571081,0.06737204,0.00061356125,0.17044854],"study_design_scores_gemma":[0.00017512008,0.0011936338,0.004030368,0.00025103652,0.0000036880172,0.0014382277,0.00015016645,0.9921768,0.00018315499,0.00012426871,0.00017006767,0.00010351187],"about_ca_topic_score_codex":0.000031119533,"about_ca_topic_score_gemma":4.6369217e-7,"teacher_disagreement_score":0.6338323,"about_ca_system_score_codex":0.000022251259,"about_ca_system_score_gemma":0.00011925487,"threshold_uncertainty_score":0.35044363},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20283507,0.0004361459,0.790556,0.00001153462,0.00057303323,0.000036249177,4.4271718e-7,0.00004261131,0.00550893],"genre_scores_gemma":[0.6664676,0.000013541583,0.33343437,0.0000068215645,0.00007002534,2.5409383e-7,2.36627e-8,0.0000026314615,0.000004738635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999413,0.00001822626,0.00021225704,0.000068490874,0.00017826517,0.00010972108],"domain_scores_gemma":[0.99969,0.000027813036,0.000080555226,0.00004135566,0.000083524166,0.000076766126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043764708,0.000066926645,0.00013759157,0.000091010894,0.00008095688,0.0000829491,0.00014575168,0.00002330921,0.000010540484],"category_scores_gemma":[0.0000028747397,0.00004354389,0.000019542009,0.0001373858,0.00012495687,0.00023380404,0.000010385023,0.00007472668,0.0000019760623],"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.000026430975,0.00003638741,0.0119412895,0.00027321762,0.00012693244,0.000099328485,0.0049304455,0.9486831,0.000097710385,0.0038144705,0.000108340166,0.029862352],"study_design_scores_gemma":[0.0003230925,0.00027335517,0.0013773557,0.00049707736,0.000013698429,0.0013566861,0.0016385966,0.99397296,0.00037850213,0.00002608042,0.000018518374,0.00012407989],"about_ca_topic_score_codex":0.0000015845455,"about_ca_topic_score_gemma":4.179053e-7,"teacher_disagreement_score":0.46363255,"about_ca_system_score_codex":0.000009948612,"about_ca_system_score_gemma":0.000033056942,"threshold_uncertainty_score":0.17756683},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043455407,0.00015460723,0.95388925,0.00041400807,0.0012645482,0.00016766442,9.577568e-7,0.00004230969,0.00061127334],"genre_scores_gemma":[0.8371305,2.9356124e-7,0.16175385,0.000151621,0.0009499204,0.0000011974428,6.358303e-7,0.0000040255277,0.0000079943975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997985,0.00019727906,0.00048642422,0.00043067703,0.00066493114,0.00023571284],"domain_scores_gemma":[0.99856806,0.00024318199,0.00053347653,0.00041363575,0.00012461626,0.00011703494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00370377,0.00014576131,0.00030877237,0.00025186435,0.0004818664,0.00058206066,0.0018300273,0.00003630219,7.719449e-8],"category_scores_gemma":[0.000018918421,0.0000913672,0.000068317226,0.00029349618,0.0000969903,0.000058988855,0.00042759653,0.000105184954,4.6663243e-7],"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.000029098706,0.00019407715,0.00024904366,0.00042153682,0.000015515516,0.000004465147,0.00042234344,0.5524682,0.000018505469,0.005592824,0.0015003916,0.439084],"study_design_scores_gemma":[0.00059264887,0.0005763268,0.00038117915,0.00046251313,0.000009495177,0.000047533602,0.00007667207,0.995391,0.000024871748,0.00004074187,0.0022748369,0.0001221951],"about_ca_topic_score_codex":0.000004051151,"about_ca_topic_score_gemma":1.698445e-7,"teacher_disagreement_score":0.79367507,"about_ca_system_score_codex":0.000024484641,"about_ca_system_score_gemma":0.00008425668,"threshold_uncertainty_score":0.5612824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058553457,0.00016299255,0.9402763,0.00015307667,0.00057948387,0.000092759976,2.0777648e-7,0.000030477955,0.00015122692],"genre_scores_gemma":[0.70938444,0.0000048739885,0.29026127,0.00005181343,0.00028624627,0.0000028214647,1.4878778e-7,0.000002862384,0.0000055149753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874365,0.00007882185,0.00042398926,0.00023007748,0.000341771,0.00018169172],"domain_scores_gemma":[0.9990137,0.00013354997,0.00032489325,0.00014776769,0.00029604096,0.000084050014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015982309,0.00009344755,0.0002071398,0.0001525632,0.00034028478,0.00062508445,0.0006259768,0.0000443217,2.3040202e-7],"category_scores_gemma":[0.000011097399,0.00006877948,0.000069176764,0.00027058015,0.000066507506,0.0005392831,0.00007516436,0.000059440277,5.076144e-7],"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.0000035760424,0.000010017104,0.00019804176,0.00002339179,0.000003914979,4.1193456e-7,0.00020729848,0.97288513,0.000028015349,0.017368741,0.000015714684,0.009255747],"study_design_scores_gemma":[0.00027872706,0.00018954506,0.000054045457,0.00008401408,0.000004357204,0.00012498593,0.00002973209,0.99885666,0.000028316897,0.00009141686,0.00017405872,0.000084143096],"about_ca_topic_score_codex":0.0000037045659,"about_ca_topic_score_gemma":6.6021323e-7,"teacher_disagreement_score":0.650831,"about_ca_system_score_codex":0.000024836714,"about_ca_system_score_gemma":0.00004574518,"threshold_uncertainty_score":0.6027704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34768516,0.000112926034,0.65160227,0.000050473896,0.000028761411,0.00006887359,0.000009590786,0.000018194916,0.00042375087],"genre_scores_gemma":[0.48714364,0.000007848133,0.5120805,0.000022783554,0.000727034,0.0000074886325,4.3617766e-7,0.0000031487216,0.000007131703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993173,0.000015091415,0.00025275417,0.00014398214,0.00013160879,0.00013926833],"domain_scores_gemma":[0.99940985,0.00011905215,0.0002237979,0.000083521096,0.000075524345,0.000088255176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041803464,0.000079390724,0.00017173796,0.00004084391,0.00018305988,0.000105739084,0.00023840053,0.00003881084,0.0000049923206],"category_scores_gemma":[0.0000029006142,0.00006018259,0.00005818299,0.00005845001,0.000060815888,0.00025332897,0.000017637796,0.000094106275,4.251355e-7],"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.000037720245,0.00012267273,0.00254538,0.0001706229,0.00009223873,0.000029336354,0.002476485,0.0067036008,0.3089518,0.0057493052,0.00035127037,0.6727696],"study_design_scores_gemma":[0.0007681224,0.0004526713,0.00050399336,0.000538519,0.000042817363,0.001038092,0.0008540404,0.7067152,0.28040418,0.0059968187,0.0023908783,0.00029464893],"about_ca_topic_score_codex":0.000021987129,"about_ca_topic_score_gemma":0.000003877958,"teacher_disagreement_score":0.7000116,"about_ca_system_score_codex":0.00012221345,"about_ca_system_score_gemma":0.00005444988,"threshold_uncertainty_score":0.24541748},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003853357,0.0004696364,0.98980874,0.0021716272,0.00012394988,0.00006056563,1.1144886e-7,0.00003742288,0.0034745662],"genre_scores_gemma":[0.59420365,0.000040700455,0.40547404,0.00021130677,0.000046760484,2.3681574e-7,5.459459e-8,8.949985e-7,0.000022377753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898046,0.00011851546,0.00026570272,0.00011142908,0.00040321023,0.000120687364],"domain_scores_gemma":[0.99922967,0.00006468091,0.00022722855,0.00015234294,0.00023137577,0.000094727846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011398426,0.00006347234,0.00014528494,0.00014785602,0.00022170504,0.00043019053,0.00077224214,0.000018267398,8.1396064e-7],"category_scores_gemma":[0.000002953844,0.0000383846,0.000024659726,0.00038611068,0.00007588607,0.0009353811,0.000053861364,0.00008497841,0.0000014135678],"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.00003258772,0.00026425798,0.0021791612,0.00008658784,0.00005626456,0.00008726205,0.007581928,0.04407561,0.00009050601,0.41839314,0.004552983,0.52259976],"study_design_scores_gemma":[0.00048916944,0.001322945,0.003858722,0.00024650135,0.000004171227,0.0010666611,0.00023941808,0.9908098,0.000028992734,0.0007544674,0.0010667633,0.00011237268],"about_ca_topic_score_codex":0.0000029588316,"about_ca_topic_score_gemma":6.007464e-7,"teacher_disagreement_score":0.9467342,"about_ca_system_score_codex":0.000014528806,"about_ca_system_score_gemma":0.000081628634,"threshold_uncertainty_score":0.41483372},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4581481,0.00043120168,0.54093724,0.000009386878,0.00038996685,0.000054199973,2.718048e-8,0.000004031045,0.000025835534],"genre_scores_gemma":[0.96993315,0.00014388513,0.029790387,0.0000015593473,0.00012672872,0.0000010323986,3.3188442e-8,0.000002948339,2.5953207e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924207,0.00008813528,0.00028644237,0.000053400814,0.00024391356,0.00008602314],"domain_scores_gemma":[0.99946404,0.0002175328,0.00013157424,0.00004097914,0.00011820412,0.000027703507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029282258,0.000051122563,0.00012538613,0.00006790871,0.0000817294,0.00006329338,0.000105442596,0.000030268837,2.3402713e-7],"category_scores_gemma":[0.000007705975,0.000032418313,0.000012827732,0.00016941664,0.00007781353,0.0002156599,0.000013586094,0.00011194083,2.7929488e-8],"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.0000026770194,0.0000015297366,0.00086255436,0.000011504049,0.000004160159,4.1522094e-7,0.000107160784,0.96444786,0.00014796006,0.00088106,0.000005410671,0.033527683],"study_design_scores_gemma":[0.00018074193,0.00003232044,0.0020414407,0.00013125286,0.0000066829143,0.00004213451,0.00014458975,0.9972037,0.00007685155,0.000103039114,0.0000020399775,0.000035200832],"about_ca_topic_score_codex":6.506723e-7,"about_ca_topic_score_gemma":0.0000044886806,"teacher_disagreement_score":0.5117851,"about_ca_system_score_codex":0.000012858141,"about_ca_system_score_gemma":0.000024465777,"threshold_uncertainty_score":0.13219804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07961785,0.000055545148,0.91917956,0.000076111835,0.00038382132,0.00044096657,0.000052376177,0.000028219085,0.00016553098],"genre_scores_gemma":[0.91761404,2.5217813e-7,0.08205718,0.000054929576,0.0002482175,0.0000066753396,0.000003551679,0.0000041466865,0.000011004058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974418,0.0001199084,0.0009536569,0.0003059395,0.00096029136,0.0002183679],"domain_scores_gemma":[0.9970188,0.0010905644,0.0005836336,0.00020842004,0.0008823658,0.00021618519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008399392,0.00010919579,0.0003203575,0.0004279338,0.00040157975,0.0005063021,0.0005925131,0.00005885971,9.74077e-7],"category_scores_gemma":[0.00005763782,0.00007053866,0.00009883598,0.00086639606,0.000057231635,0.00040178167,0.000030466239,0.00006239066,0.0000017303258],"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.00006284083,0.00009739756,0.0013960667,0.00001420991,0.000005769694,7.500254e-7,0.00032912366,0.9856855,0.00006120985,0.006703194,0.00045642356,0.0051874607],"study_design_scores_gemma":[0.000294202,0.00053654774,0.0055439756,0.000045438323,0.000008489604,0.00001969125,0.0023648024,0.98840994,0.00003064591,0.0003800659,0.0022717034,0.000094515424],"about_ca_topic_score_codex":0.000004809583,"about_ca_topic_score_gemma":0.0000034461764,"teacher_disagreement_score":0.8379962,"about_ca_system_score_codex":0.00006226179,"about_ca_system_score_gemma":0.000072358525,"threshold_uncertainty_score":0.48822832},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008583029,0.0035194575,0.9863744,0.0005140796,0.0006291021,0.00014972944,7.171214e-7,0.0000064984083,0.00022303051],"genre_scores_gemma":[0.6371179,0.000029738261,0.3623806,0.00012294107,0.00030668423,0.000004725842,6.469064e-8,0.0000023926098,0.00003496058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909896,0.00015904364,0.00034847212,0.00015620056,0.00013997534,0.00009732732],"domain_scores_gemma":[0.9988998,0.00033847181,0.00039937682,0.00020163141,0.00011126999,0.000049429742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028184114,0.000067276516,0.00017589422,0.000072668954,0.00033314287,0.00011723154,0.0007445473,0.00001841287,5.419593e-7],"category_scores_gemma":[0.000011090307,0.000029375595,0.00004359091,0.00013141987,0.00012398219,0.00027706567,0.00017250712,0.000060621496,1.357677e-7],"study_design_candidate":"design_other","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.0000019824142,0.0000143234665,0.0003025407,0.000042703712,0.000020004649,5.453614e-7,0.007286598,0.000360456,0.002516866,0.012340052,0.0014455478,0.9756684],"study_design_scores_gemma":[0.00020239221,0.00035788107,0.002120516,0.00012715887,0.000009664215,0.00059821305,0.0006749302,0.96101195,0.0001202912,0.001420763,0.03325244,0.000103802435],"about_ca_topic_score_codex":0.0000058954506,"about_ca_topic_score_gemma":6.730416e-7,"teacher_disagreement_score":0.9755646,"about_ca_system_score_codex":0.00003097048,"about_ca_system_score_gemma":0.000024680148,"threshold_uncertainty_score":0.25622994},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8145744,0.010071719,0.15097205,0.0007755364,0.002026409,0.00013307114,7.23848e-7,0.000057855246,0.021388182],"genre_scores_gemma":[0.988385,0.000074994845,0.011195388,0.000090421236,0.0002025276,5.433032e-7,1.6864707e-8,0.0000018604327,0.000049256054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875957,0.00014162877,0.0003986071,0.00018820101,0.00029938773,0.00021259065],"domain_scores_gemma":[0.9993487,0.000115595656,0.00021969664,0.00011253386,0.00008766232,0.000115793395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011693855,0.00010469222,0.00027128783,0.00024757494,0.00012750477,0.00039526768,0.0006915772,0.00003761749,0.0000057206153],"category_scores_gemma":[0.000016062373,0.00006668023,0.000061283456,0.00037881875,0.00016092703,0.00060594786,0.00011181522,0.00011777681,0.000008542265],"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.000011142268,0.00037540027,0.102490194,0.00031770024,0.00009166356,0.0025961327,0.031582817,0.0016126581,0.0004249348,0.45109847,0.006902061,0.40249684],"study_design_scores_gemma":[0.002834051,0.0020895337,0.032097645,0.0022676934,0.000022522796,0.013055849,0.0053516617,0.9344437,0.0008670967,0.0014427443,0.0045519965,0.0009754916],"about_ca_topic_score_codex":0.0000107233545,"about_ca_topic_score_gemma":0.0000071974337,"teacher_disagreement_score":0.93283105,"about_ca_system_score_codex":0.000032832504,"about_ca_system_score_gemma":0.000058411948,"threshold_uncertainty_score":0.38115755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013020135,0.0063896375,0.9769832,0.0017456186,0.0009346958,0.00029668058,0.0000022019644,0.000029898834,0.00059794914],"genre_scores_gemma":[0.79489756,0.00021475034,0.20444588,0.000058454814,0.00023927781,0.0000071216205,1.2595943e-7,0.00000438416,0.00013245159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874556,0.00006277658,0.0004269774,0.00021731097,0.00035559759,0.00019175015],"domain_scores_gemma":[0.9990142,0.00026621748,0.00034593834,0.00015092664,0.00013008417,0.00009265587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013847331,0.00010449479,0.0002058251,0.0000950003,0.000589972,0.00088944065,0.0008087544,0.000037246613,0.0000018118486],"category_scores_gemma":[0.00000667225,0.00005279009,0.000053670406,0.00023485575,0.00016648843,0.0010055427,0.00022460733,0.00009802489,8.060415e-7],"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.00003188392,0.0003115401,0.0024117203,0.0008569917,0.00031559242,0.000065565924,0.017602539,0.03450052,0.00029321705,0.16905567,0.03927964,0.7352751],"study_design_scores_gemma":[0.0004179859,0.0005637092,0.0005754994,0.0002185315,0.000012034697,0.0012421648,0.000114200404,0.9912538,0.000009933506,0.0007830718,0.004718457,0.00009060106],"about_ca_topic_score_codex":0.0000038366406,"about_ca_topic_score_gemma":3.8099193e-7,"teacher_disagreement_score":0.9567533,"about_ca_system_score_codex":0.000011326382,"about_ca_system_score_gemma":0.000028313703,"threshold_uncertainty_score":0.8576897},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12070877,0.0010491348,0.8750828,0.00054389116,0.0010174434,0.00006453434,2.3723051e-7,0.000028180437,0.0015050367],"genre_scores_gemma":[0.972503,0.00001096189,0.027107794,0.000028177348,0.00031233803,1.5178594e-7,4.5539604e-8,0.0000020896766,0.00003541271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833137,0.00021807916,0.00054017466,0.000144796,0.00054136995,0.0002241922],"domain_scores_gemma":[0.9985339,0.00043876338,0.0005823701,0.000118526135,0.00023304558,0.00009341569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039611408,0.00009077917,0.00024515533,0.00009998227,0.00058812095,0.00033924024,0.00090708013,0.000024627932,9.926999e-7],"category_scores_gemma":[0.000036273912,0.00004709903,0.000074311756,0.0003120632,0.00061222934,0.00034489002,0.00014661728,0.0002156567,9.020799e-7],"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.000033579247,0.000089009496,0.030581558,0.00015416133,0.000089240995,0.00008585884,0.0068208133,0.012959405,0.00028105915,0.326444,0.0015751907,0.62088615],"study_design_scores_gemma":[0.0007565341,0.0027905565,0.04661013,0.00033786864,0.000015073248,0.0015827572,0.003109512,0.9243274,0.0005844685,0.0025380198,0.017059801,0.00028789582],"about_ca_topic_score_codex":0.000026480831,"about_ca_topic_score_gemma":0.0000029090975,"teacher_disagreement_score":0.91136795,"about_ca_system_score_codex":0.00001432309,"about_ca_system_score_gemma":0.000090788264,"threshold_uncertainty_score":0.45234102},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6727679,0.0031869686,0.30550662,0.0023121254,0.010653272,0.00020628955,0.000003171733,0.000027815457,0.00533586],"genre_scores_gemma":[0.9650094,0.00016290326,0.022383004,0.00026413484,0.012160261,3.6151212e-7,6.6191075e-7,0.0000025321528,0.000016755119],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934584,0.0000057576694,0.0003025127,0.00006026838,0.00017230262,0.00011332935],"domain_scores_gemma":[0.9994333,0.000013504057,0.00035377798,0.000047186186,0.00013799318,0.000014277055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004382263,0.000068591056,0.0001887156,0.00029533764,0.00009627315,0.00018196531,0.00015176772,0.00003822228,0.0000046258006],"category_scores_gemma":[0.000008512061,0.000047495127,0.000015077446,0.0002454637,0.00019228394,0.00389461,0.00012598324,0.000055143104,0.0000020229293],"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.000026172353,0.000029087501,0.19851851,0.0007207954,0.000022871845,0.0000025023553,0.0004175742,0.00006115452,0.000013486445,0.041871607,0.022632917,0.7356833],"study_design_scores_gemma":[0.0005356587,0.00012879696,0.085176595,0.00055348134,0.000051299514,0.00036473398,0.001830899,0.028678127,0.000063100306,0.0008079332,0.8815544,0.0002549436],"about_ca_topic_score_codex":0.000006270653,"about_ca_topic_score_gemma":7.25723e-7,"teacher_disagreement_score":0.8589215,"about_ca_system_score_codex":0.000004933367,"about_ca_system_score_gemma":0.000008928011,"threshold_uncertainty_score":0.28234982},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2987459,0.00052724,0.7003049,0.000019821831,0.0002842572,0.000054961394,2.3356628e-7,0.000009171806,0.00005347633],"genre_scores_gemma":[0.9901185,0.000038501927,0.009727004,0.00000958445,0.00009580032,6.9773523e-7,1.1876618e-7,0.0000034519683,0.000006346447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941176,0.000028512053,0.0002348737,0.0000642543,0.00014726727,0.00011331904],"domain_scores_gemma":[0.9997694,0.00004572605,0.000028481805,0.000043609925,0.00005291907,0.000059852227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068241864,0.00005881958,0.00014629116,0.000092058064,0.00010360803,0.00013137374,0.00011097716,0.000021900096,3.4279202e-7],"category_scores_gemma":[0.0000034034204,0.000040523326,0.000029086419,0.000051034393,0.00003911702,0.0001855313,0.000014522625,0.000045321016,4.8528545e-7],"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.0000034568784,0.0000037003279,0.00018477153,0.00029036836,0.000011020172,0.0000014175228,0.000572782,0.97480905,0.00025675978,0.0007418489,0.00010630766,0.023018494],"study_design_scores_gemma":[0.000085446605,0.00023928817,0.00031276204,0.00011286026,0.000005228459,0.00043022278,0.0000832293,0.9982912,0.00025244994,0.000042473395,0.000093398914,0.000051467057],"about_ca_topic_score_codex":0.000002057626,"about_ca_topic_score_gemma":0.0000036341676,"teacher_disagreement_score":0.6913726,"about_ca_system_score_codex":0.000017092754,"about_ca_system_score_gemma":0.0000070785213,"threshold_uncertainty_score":0.16524932},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917207,0.0014155295,0.006446409,0.000039495608,0.00017989326,0.000051971114,0.0000017199633,0.00000198239,0.000142304],"genre_scores_gemma":[0.95564985,0.00010133974,0.043959193,0.000018133345,0.00025178882,3.1520958e-7,3.58549e-7,0.0000025992858,0.000016437998],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993696,0.000044755103,0.00022484512,0.00013904549,0.000113184105,0.000108547036],"domain_scores_gemma":[0.99959886,0.0000067371443,0.00019232267,0.00006518301,0.000058913334,0.000078006145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038611452,0.000062336214,0.00011366458,0.0000608789,0.00014879841,0.000091654576,0.0001208864,0.000028691966,0.0000023542682],"category_scores_gemma":[0.0000031623317,0.000049907107,0.000024530396,0.000067767716,0.00009887543,0.000024591185,0.000037221704,0.00003188637,3.0234244e-7],"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.000025847185,0.0001547616,0.18504852,0.0002994221,0.00027667297,0.0000389004,0.002444931,0.0028747038,0.75417745,0.0002017349,0.00029615915,0.05416088],"study_design_scores_gemma":[0.00627573,0.008990629,0.12086298,0.0011763748,0.00038047665,0.030682307,0.015637996,0.79383516,0.013356982,0.00028954487,0.0063327523,0.0021790888],"about_ca_topic_score_codex":0.0000022890506,"about_ca_topic_score_gemma":3.9895605e-7,"teacher_disagreement_score":0.79096043,"about_ca_system_score_codex":0.000007793144,"about_ca_system_score_gemma":0.00001627122,"threshold_uncertainty_score":0.20351528},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4389847,0.00089215004,0.5592711,0.00013195537,0.00035296413,0.000089308436,6.481012e-7,0.000013964854,0.00026324787],"genre_scores_gemma":[0.91365546,0.000067187386,0.08612991,0.00006818698,0.0000626917,6.386109e-7,1.060673e-7,0.0000039780716,0.000011829571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975264,0.00018827642,0.00077038363,0.00029147704,0.0008870639,0.00033636647],"domain_scores_gemma":[0.9981651,0.00045422354,0.00056926237,0.00020415969,0.0003808286,0.0002264465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004201663,0.00015097583,0.0003944148,0.00080616854,0.0003264452,0.0003066501,0.0008947406,0.000052501106,0.0000016025335],"category_scores_gemma":[0.00001831257,0.00010974631,0.00009883197,0.0011062905,0.0008233308,0.0010139482,0.0001758542,0.00015606043,5.843125e-7],"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.00012029086,0.00013940007,0.040316258,0.00022874521,0.00011508831,0.0001505544,0.0032961986,0.00024916482,0.002061164,0.89716345,0.00022461194,0.05593508],"study_design_scores_gemma":[0.0090161385,0.010701964,0.239212,0.0020814969,0.00011413143,0.009424979,0.006723293,0.11081378,0.011590771,0.5973098,0.001363151,0.0016484649],"about_ca_topic_score_codex":0.000013141865,"about_ca_topic_score_gemma":0.0000107420165,"teacher_disagreement_score":0.4746708,"about_ca_system_score_codex":0.000028107583,"about_ca_system_score_gemma":0.00012371303,"threshold_uncertainty_score":0.44753247},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14454983,0.004365303,0.8479771,0.0006609926,0.0017592972,0.00021535678,6.652397e-8,0.00003646715,0.00043559112],"genre_scores_gemma":[0.9746005,0.00013824948,0.024507906,0.00015036142,0.0005472232,0.0000052554683,4.721648e-8,0.0000044315357,0.000046031022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980785,0.00022461858,0.0005973274,0.0002757274,0.00047176267,0.00035206391],"domain_scores_gemma":[0.99901193,0.00015529721,0.00035801835,0.00017849206,0.00014535873,0.0001509071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015241763,0.00013885726,0.00034185976,0.0002829401,0.00015998674,0.00068105344,0.00089153915,0.00006833949,0.000004843452],"category_scores_gemma":[0.0000054500465,0.000098799224,0.00007558428,0.0007996618,0.00010630742,0.0015297905,0.00013386228,0.00023563507,0.000009618203],"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.000036344347,0.0002268769,0.026387818,0.00019507957,0.00011226799,0.00024951954,0.005674975,0.16241047,0.00025369428,0.018544579,0.029842656,0.7560657],"study_design_scores_gemma":[0.0003954768,0.00054339523,0.020857064,0.00029984777,0.0000039990223,0.0010442854,0.00018579025,0.9753702,0.000015887785,0.00029336778,0.0008376378,0.0001530417],"about_ca_topic_score_codex":0.00002332337,"about_ca_topic_score_gemma":0.00001099383,"teacher_disagreement_score":0.83005065,"about_ca_system_score_codex":0.00006698726,"about_ca_system_score_gemma":0.0000879053,"threshold_uncertainty_score":0.6567414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4006418,0.008880431,0.5838747,0.00054436154,0.0027915486,0.00009526719,4.867827e-7,0.000055900276,0.0031155173],"genre_scores_gemma":[0.9504158,0.000049661718,0.049325455,0.00007124713,0.00011035017,4.3317542e-7,1.2179629e-8,0.0000018862753,0.0000251587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890226,0.00013310705,0.0003246325,0.00017023996,0.00031223343,0.00015752701],"domain_scores_gemma":[0.99926674,0.00017409104,0.00027070186,0.000108673485,0.00007434964,0.00010546075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016091703,0.00009333878,0.00022827463,0.00015989407,0.00023849767,0.00047820824,0.00045441685,0.000027283908,0.0000012778121],"category_scores_gemma":[0.000011545561,0.00006091829,0.00003983407,0.00026914835,0.00014887622,0.000801656,0.00007826765,0.00006703436,9.49865e-7],"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.000004357337,0.000029078272,0.0089992685,0.00012032438,0.000023650617,0.000073356794,0.0023677885,0.00006361748,0.00009906599,0.95273113,0.0013792799,0.034109056],"study_design_scores_gemma":[0.006538895,0.008446256,0.07851058,0.0026015418,0.00022954197,0.06400061,0.014086431,0.43005013,0.003381457,0.12281425,0.26562133,0.0037189703],"about_ca_topic_score_codex":0.000004397205,"about_ca_topic_score_gemma":6.4390116e-7,"teacher_disagreement_score":0.8299169,"about_ca_system_score_codex":0.000018747127,"about_ca_system_score_gemma":0.00007531189,"threshold_uncertainty_score":0.4611373},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038507313,0.0007060911,0.95744586,0.0003944921,0.0017594944,0.00010218176,0.0000031259005,0.000029764788,0.0010516584],"genre_scores_gemma":[0.8753679,0.000011739309,0.12429242,0.00015692535,0.00015008882,0.0000013671279,1.125506e-7,0.0000026162465,0.000016835724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852234,0.00014907439,0.0005463351,0.00022332114,0.00034139538,0.0002175095],"domain_scores_gemma":[0.9987392,0.0003829864,0.00041775662,0.00017079938,0.00017788752,0.00011141559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030367358,0.000109635075,0.00029748632,0.00020497899,0.0002977158,0.0003733103,0.00078734715,0.000032189728,4.142161e-7],"category_scores_gemma":[0.000025444946,0.000072804054,0.00010854624,0.00032694265,0.00013170524,0.000564154,0.000058944595,0.00006119031,0.0000012051132],"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.000020657952,0.000049738563,0.00030069394,0.00008657519,0.000031778436,0.000033891294,0.0008413321,0.0005749939,0.00026156649,0.97855616,0.004600868,0.0146417245],"study_design_scores_gemma":[0.010444626,0.006189441,0.008484251,0.0018866312,0.000085696105,0.015475576,0.0026357593,0.74228513,0.0035582313,0.14439417,0.06297674,0.0015837292],"about_ca_topic_score_codex":0.0000022375068,"about_ca_topic_score_gemma":3.8698073e-7,"teacher_disagreement_score":0.8368606,"about_ca_system_score_codex":0.000014450611,"about_ca_system_score_gemma":0.00008536407,"threshold_uncertainty_score":0.35998398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16722669,0.00006133603,0.8320777,0.000030581916,0.00025934484,0.00018603016,3.4577633e-7,0.000019771884,0.00013819616],"genre_scores_gemma":[0.47044343,5.88108e-7,0.52944034,0.000014979796,0.000095787786,0.0000021798962,7.05233e-8,0.0000013185165,0.0000012960611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982834,0.00033242005,0.0005378529,0.0002771418,0.00038380423,0.00018540217],"domain_scores_gemma":[0.9985525,0.00014201773,0.00051499886,0.0002857938,0.00038207546,0.00012262496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052745305,0.00009781881,0.00031213355,0.00031863563,0.00028484935,0.00071643083,0.0010094609,0.00004059058,7.4997325e-7],"category_scores_gemma":[0.000034119977,0.00006395711,0.00012372577,0.0007775473,0.0001386566,0.002127962,0.00008007004,0.000072148825,3.5137077e-7],"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.00004288344,0.000495575,0.043510538,0.00083539635,0.00047008597,0.000004483279,0.0084712375,0.38233003,0.0033115926,0.30615756,0.00015781904,0.25421283],"study_design_scores_gemma":[0.000091699236,0.00024582073,0.007932449,0.000022182525,0.000039124854,0.00007710448,0.00026313376,0.99034405,0.00012664504,0.0007644378,0.000009001726,0.00008433469],"about_ca_topic_score_codex":0.000017072109,"about_ca_topic_score_gemma":8.5420815e-8,"teacher_disagreement_score":0.60801405,"about_ca_system_score_codex":0.000042691456,"about_ca_system_score_gemma":0.00008649413,"threshold_uncertainty_score":0.69085586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013195614,0.00082982966,0.9824403,0.0002472735,0.0014325433,0.00009780414,0.0000016566534,0.000034888537,0.0017201244],"genre_scores_gemma":[0.8134448,0.000031149473,0.1860708,0.00018325103,0.0002176875,0.0000013432768,2.1382176e-7,0.0000042478396,0.000046530953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981098,0.00024993875,0.0004793132,0.0002743892,0.00060070836,0.00028582578],"domain_scores_gemma":[0.99894476,0.00018269576,0.00038231866,0.000212889,0.00012488101,0.00015243777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002373143,0.00015016794,0.00030441766,0.00020636732,0.00051555963,0.0005480775,0.00084359886,0.000039910017,0.0000030790973],"category_scores_gemma":[0.000022189226,0.000091162256,0.00008175758,0.00031180133,0.00006677273,0.0008771485,0.00015349766,0.0001678139,0.0000047375784],"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.00003402946,0.0005290747,0.008456799,0.00035154584,0.00010714,0.00032915754,0.005152564,0.019040681,0.0003640444,0.8509945,0.014849598,0.099790834],"study_design_scores_gemma":[0.0009251205,0.0008742666,0.0014468854,0.00056847645,0.0000073368547,0.0010997922,0.00018833131,0.98365504,0.000041831994,0.0020620904,0.008894972,0.00023588761],"about_ca_topic_score_codex":0.0000060077,"about_ca_topic_score_gemma":0.0000014163213,"teacher_disagreement_score":0.96461433,"about_ca_system_score_codex":0.000020192792,"about_ca_system_score_gemma":0.000089526584,"threshold_uncertainty_score":0.5285124},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64818347,0.00033235372,0.35055283,0.0000072462435,0.0007229062,0.00008140344,0.000005591807,0.000012387751,0.000101807294],"genre_scores_gemma":[0.9215973,0.0000637291,0.077862754,0.000008956559,0.00045905204,0.0000019060736,0.0000011213863,0.0000044537533,7.0322864e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923354,0.00003267663,0.00035739734,0.000055236036,0.00017362882,0.00014754316],"domain_scores_gemma":[0.9994398,0.00012501038,0.00018440024,0.00003830073,0.00012399751,0.00008851721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008873549,0.00006938499,0.00017828678,0.00012141245,0.00005516372,0.000045869085,0.00008465807,0.000031789084,0.000003105788],"category_scores_gemma":[0.000003827982,0.000053952535,0.000041870553,0.00009202976,0.000027133174,0.0007649259,0.0000069307252,0.00004662029,0.0000019745328],"study_design_candidate":"design_other","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.00001377247,0.00006155593,0.0002528924,0.00029103138,0.00005374807,0.0000018419186,0.001320308,0.00070485193,0.008586955,0.00003815322,0.00017281756,0.9885021],"study_design_scores_gemma":[0.0007656217,0.00088213384,0.0016856609,0.0006404057,0.00005819812,0.0005953296,0.00080239965,0.9545917,0.039268862,0.000088408065,0.00042344452,0.00019786415],"about_ca_topic_score_codex":0.0000014328764,"about_ca_topic_score_gemma":2.2477317e-7,"teacher_disagreement_score":0.9883042,"about_ca_system_score_codex":0.000020219679,"about_ca_system_score_gemma":0.0000118710195,"threshold_uncertainty_score":0.22001205},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25335333,0.0025281012,0.7224299,0.00023650359,0.0008320534,0.00019594471,0.000008542603,0.000030504305,0.020385144],"genre_scores_gemma":[0.9949198,0.0000062052654,0.0036838483,0.0000095916575,0.0013584269,8.047707e-7,1.9625529e-7,0.0000032278238,0.000017909964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987461,0.00011991156,0.0004494049,0.00013753913,0.00036054198,0.00018651456],"domain_scores_gemma":[0.9985971,0.00047000896,0.00046128547,0.00010194473,0.00028760138,0.00008205854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016741796,0.000102156606,0.00028021284,0.00009876252,0.00044395143,0.00032323544,0.00037219102,0.0000151655395,0.0000048393954],"category_scores_gemma":[0.0000015544082,0.00005674579,0.00011935183,0.00024569477,0.00020007549,0.0001431965,0.000069226924,0.00011590151,0.0000014761797],"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.00008772731,0.000085842934,0.038232625,0.000010064075,0.0006768346,0.000026854124,0.0024888832,0.0013554435,0.0003128606,0.91711104,0.010335813,0.02927604],"study_design_scores_gemma":[0.0012744558,0.0013195472,0.04933363,0.0008006501,0.0002598103,0.0002150921,0.10636277,0.8015658,0.00013261914,0.020935014,0.017139193,0.0006614086],"about_ca_topic_score_codex":0.00034592726,"about_ca_topic_score_gemma":0.000017925651,"teacher_disagreement_score":0.896176,"about_ca_system_score_codex":0.000048092264,"about_ca_system_score_gemma":0.00006330035,"threshold_uncertainty_score":0.34145606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97701764,0.0014613417,0.009426844,0.005501371,0.0008763559,0.00009984758,5.002634e-7,0.000042514414,0.0055736033],"genre_scores_gemma":[0.9977349,0.00015625889,0.0017425414,0.00019194029,0.00015330044,4.4843145e-7,4.0538627e-8,0.0000011473172,0.000019418772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914503,0.00021902182,0.0002152755,0.000077957055,0.00023728459,0.0001054247],"domain_scores_gemma":[0.99934024,0.00018674425,0.00020814677,0.00006796929,0.00010650557,0.00009038518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017568055,0.000045392047,0.00015284058,0.00010591065,0.0004307464,0.00014187738,0.0003494143,0.00004193125,0.000004138],"category_scores_gemma":[0.000012122697,0.000031775162,0.000022480508,0.00011759279,0.00044572956,0.00018412877,0.000066412555,0.00006872416,0.000001791879],"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.000012702502,0.00005696633,0.07323272,0.00014836373,0.000036053367,0.0000059735194,0.031829834,0.000017175973,0.00010166,0.44895622,0.0007242639,0.44487804],"study_design_scores_gemma":[0.002951599,0.0018208144,0.09290337,0.0016790126,0.00007745038,0.00068057224,0.15723033,0.14871277,0.00022748295,0.00677317,0.58619964,0.0007437485],"about_ca_topic_score_codex":0.00018125624,"about_ca_topic_score_gemma":0.00021445379,"teacher_disagreement_score":0.5854754,"about_ca_system_score_codex":0.000011717761,"about_ca_system_score_gemma":0.000039174047,"threshold_uncertainty_score":0.33129966},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09182915,0.00030267492,0.9056934,0.0001704539,0.00066525635,0.000032575095,4.2678806e-7,0.000012938415,0.0012930841],"genre_scores_gemma":[0.85758054,0.000011454696,0.14217724,0.000043148055,0.00017855964,1.5375957e-7,5.4308842e-8,0.0000011044053,0.000007761422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988537,0.000039295726,0.00042156212,0.00015218441,0.00036021884,0.0001730754],"domain_scores_gemma":[0.99939376,0.00011076068,0.00021128134,0.00011421581,0.00007689312,0.000093113675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002237599,0.000064712985,0.00015962987,0.0002964285,0.00013221623,0.0002329155,0.000603253,0.00002557483,0.000001005099],"category_scores_gemma":[0.000006155652,0.00004407211,0.00003617447,0.00038797618,0.00006419349,0.00089168904,0.00017503357,0.000099734614,0.0000014144803],"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.000031190873,0.00019633373,0.024768112,0.000114220566,0.000021179769,0.0010471792,0.0025161707,0.0010418479,0.0005094236,0.6696647,0.0019835788,0.2981061],"study_design_scores_gemma":[0.0025686554,0.0023519022,0.3650681,0.002383351,0.00001497769,0.011237204,0.0019794158,0.5901868,0.0008158465,0.009500876,0.0131259635,0.0007668895],"about_ca_topic_score_codex":0.0000144843025,"about_ca_topic_score_gemma":0.0000037312675,"teacher_disagreement_score":0.76575136,"about_ca_system_score_codex":0.000024813064,"about_ca_system_score_gemma":0.00005685409,"threshold_uncertainty_score":0.22460096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36917564,0.0001301817,0.62971866,0.000039212,0.0007416667,0.00010324013,2.3625032e-7,0.00004888544,0.000042259268],"genre_scores_gemma":[0.9677773,0.0000061839523,0.03192885,0.000027772963,0.00024951436,0.0000030933716,8.9662265e-8,0.0000035497446,0.000003609871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837935,0.00018991469,0.00049710757,0.0002489843,0.0005067949,0.00017782194],"domain_scores_gemma":[0.9987059,0.00019820569,0.0005300396,0.00015762128,0.00030217535,0.00010601405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023519006,0.00013750112,0.00032437214,0.00019270113,0.0004429137,0.00030452062,0.00030034018,0.00006327999,1.8391958e-7],"category_scores_gemma":[0.000016989732,0.00008276231,0.000040396084,0.000308664,0.000106223,0.001341066,0.000042701795,0.000113829126,0.0000023941284],"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.00013485516,0.000046982874,0.38450098,0.00209609,0.000082144994,0.00001133559,0.0024491888,0.078299075,0.000079679245,0.0025940887,0.00005512784,0.52965045],"study_design_scores_gemma":[0.0006678273,0.0009773438,0.08358808,0.00054603454,0.000016879614,0.0012782274,0.00012978782,0.91256225,0.000038108545,0.000011788471,0.000070965914,0.00011272844],"about_ca_topic_score_codex":0.000006644924,"about_ca_topic_score_gemma":0.0000028668098,"teacher_disagreement_score":0.83426315,"about_ca_system_score_codex":0.00006539905,"about_ca_system_score_gemma":0.0000700904,"threshold_uncertainty_score":0.3406579},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08157626,0.001168761,0.9152676,0.0004500789,0.0006190644,0.00016637516,0.0000023740347,0.000031303465,0.00071819604],"genre_scores_gemma":[0.9584338,0.000055086075,0.0413131,0.00007408614,0.000108397784,0.000001584766,1.4058188e-7,0.0000022290174,0.000011554642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988495,0.00004002357,0.0003998831,0.00022288099,0.0003117988,0.00017591105],"domain_scores_gemma":[0.9990744,0.00020374227,0.00028284077,0.00012745081,0.00019885489,0.00011270047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008914873,0.00010463328,0.0002256893,0.00021616385,0.00038813666,0.00055811735,0.00049907534,0.00003552662,9.472484e-7],"category_scores_gemma":[0.0000086698965,0.00007362403,0.00005629994,0.0003437554,0.00016420575,0.00081015396,0.00011090719,0.000076331824,7.1898154e-7],"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.0000071584923,0.00012870312,0.0069008432,0.00022472757,0.00005094271,0.000025039313,0.0034752511,0.0005426259,0.0004960784,0.2820128,0.00131459,0.7048212],"study_design_scores_gemma":[0.0005702378,0.000491962,0.0033929108,0.00021553828,0.000006033307,0.0005443707,0.00011268094,0.9912161,0.00008304785,0.0026882556,0.0005562807,0.00012258715],"about_ca_topic_score_codex":0.000001804469,"about_ca_topic_score_gemma":0.0000012246651,"teacher_disagreement_score":0.9906735,"about_ca_system_score_codex":0.000015736969,"about_ca_system_score_gemma":0.000021577835,"threshold_uncertainty_score":0.5381938},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041227695,0.0016262757,0.95607275,0.00010314878,0.00036267188,0.00004232113,0.0000072003872,0.0000089841205,0.00054896966],"genre_scores_gemma":[0.75880194,0.000020664183,0.24097686,0.000009260289,0.00017507763,2.0018545e-7,0.0000015936566,0.0000015075152,0.000012904291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873644,0.00007543544,0.00049120886,0.00017805066,0.0004199904,0.00009885719],"domain_scores_gemma":[0.99898505,0.00012260498,0.00046616784,0.00023212173,0.00015076532,0.000043278367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010798714,0.00006923961,0.0001906955,0.00013847688,0.00016108023,0.00009328526,0.00056229945,0.000022682576,8.109567e-7],"category_scores_gemma":[0.000015444131,0.000048754864,0.000018463032,0.00022312776,0.000097416065,0.0024332812,0.0004794996,0.000047708956,2.514853e-7],"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.000007561595,0.00002966191,0.039303824,0.00025693126,0.000019120791,0.000025886498,0.00043819862,0.0053720423,0.00036208483,0.9432752,0.0010446066,0.009864864],"study_design_scores_gemma":[0.0005355685,0.0002736411,0.046330918,0.0007083489,0.000015044292,0.0018920931,0.00039008088,0.9427488,0.00019150789,0.0025900784,0.004116673,0.00020724731],"about_ca_topic_score_codex":0.00005892544,"about_ca_topic_score_gemma":0.000014143668,"teacher_disagreement_score":0.94068515,"about_ca_system_score_codex":0.000007909529,"about_ca_system_score_gemma":0.00008039089,"threshold_uncertainty_score":0.19881657},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29727295,0.0004759259,0.701362,0.00011447408,0.00048657422,0.00013520762,8.092274e-7,0.0000173505,0.00013468304],"genre_scores_gemma":[0.71104485,0.000008930742,0.28886017,0.000016757476,0.000060020073,0.0000019300956,9.281061e-8,0.0000036277345,0.0000036188521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979674,0.00010584088,0.0006474662,0.00027186112,0.0007066444,0.00030076533],"domain_scores_gemma":[0.99828386,0.00035166147,0.0006455713,0.00016634067,0.0004245271,0.00012802152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021981178,0.0001373024,0.0003579654,0.00065092026,0.00050684443,0.0006047759,0.0009005125,0.00004590524,2.6871774e-7],"category_scores_gemma":[0.000043549026,0.00010083044,0.00016302791,0.00093888945,0.00052373135,0.0014795328,0.00012771736,0.000104594066,3.7992768e-7],"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.00005172482,0.00017732488,0.001423323,0.000517036,0.0000745812,0.000032004224,0.004446792,0.008612424,0.010302701,0.8570702,0.000036742254,0.11725512],"study_design_scores_gemma":[0.0037342124,0.0060230917,0.002407978,0.00264507,0.000045737717,0.0033194418,0.0034106525,0.19158223,0.041967485,0.74394935,0.0002089692,0.00070577284],"about_ca_topic_score_codex":0.0000070369297,"about_ca_topic_score_gemma":0.0000011579713,"teacher_disagreement_score":0.4137719,"about_ca_system_score_codex":0.00004785849,"about_ca_system_score_gemma":0.00020027818,"threshold_uncertainty_score":0.5831868},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016354093,0.00034517556,0.9803412,0.0001281276,0.0006180322,0.00012846584,6.856878e-7,0.000023369827,0.0020608413],"genre_scores_gemma":[0.6275097,0.000004692965,0.37218106,0.00004851298,0.0002483469,0.0000015881969,3.6792443e-8,0.0000020155946,0.0000040179034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854857,0.00006415003,0.0003966759,0.00023838058,0.0004992161,0.00025302405],"domain_scores_gemma":[0.99916035,0.00005965126,0.00026584583,0.00024018507,0.00010902038,0.00016495983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019040725,0.000109550536,0.00020650224,0.0001516767,0.00039070036,0.00047637286,0.001689489,0.000025684953,5.748275e-7],"category_scores_gemma":[0.000004843435,0.000055895343,0.00005643938,0.00042967364,0.000064082575,0.0008420844,0.00052460004,0.00012787637,0.0000030904064],"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.000030704854,0.00026568532,0.008858192,0.00021340176,0.00008660031,0.000086096385,0.014367275,0.0044714003,0.000100847436,0.46696773,0.005343566,0.49920848],"study_design_scores_gemma":[0.0006968273,0.001388211,0.02915178,0.00096517685,0.000025692205,0.0032595722,0.001249461,0.9539164,0.0002476362,0.0035201018,0.005098691,0.00048046236],"about_ca_topic_score_codex":0.000043140095,"about_ca_topic_score_gemma":0.000002859286,"teacher_disagreement_score":0.949445,"about_ca_system_score_codex":0.000020067122,"about_ca_system_score_gemma":0.00008298285,"threshold_uncertainty_score":0.45936745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23479119,0.0039670216,0.7581116,0.0016397631,0.0005652769,0.00005161119,3.2288207e-7,0.00001542846,0.0008577895],"genre_scores_gemma":[0.9640056,0.00004961408,0.03574709,0.000031572454,0.00015569731,2.3720105e-7,8.806892e-9,9.515811e-7,0.000009244797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903244,0.000086150016,0.00036310696,0.000084672436,0.0003310674,0.00010257652],"domain_scores_gemma":[0.99926156,0.00023476423,0.00029897568,0.0000966534,0.00006870492,0.000039317132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017088683,0.0000539864,0.0001401146,0.00007828042,0.00019675447,0.00022438205,0.0006984555,0.00001626261,4.7917706e-7],"category_scores_gemma":[0.0000028302973,0.00002749415,0.000055294062,0.00018590776,0.0001233005,0.0005811664,0.00004355754,0.00004609579,9.1235574e-7],"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.0000067507212,0.000023140896,0.00059569464,0.000036774898,0.00002158736,0.000004451954,0.0025842744,0.001364373,0.00051409536,0.18962346,0.00040050244,0.8048249],"study_design_scores_gemma":[0.00038446835,0.00043337184,0.005457585,0.00023812683,0.000009296696,0.0006737324,0.0007265724,0.9827002,0.0011421194,0.0023795157,0.005741257,0.00011369819],"about_ca_topic_score_codex":0.0000019305282,"about_ca_topic_score_gemma":0.0000011332912,"teacher_disagreement_score":0.9813359,"about_ca_system_score_codex":0.0000075472904,"about_ca_system_score_gemma":0.000039782233,"threshold_uncertainty_score":0.21637213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1280967,0.00022050411,0.870279,0.00012751498,0.0010245674,0.00009063702,0.0000011172194,0.00002312791,0.00013683732],"genre_scores_gemma":[0.5260027,0.0000031259835,0.47362262,0.000032556713,0.00032445352,4.291334e-7,1.1293066e-7,0.0000025186025,0.000011462371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855685,0.000036988924,0.00047403207,0.00021647243,0.00043023535,0.00028542083],"domain_scores_gemma":[0.9990218,0.000195188,0.00036782128,0.00014091448,0.0001345765,0.00013969516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002842361,0.00011615749,0.00025572747,0.00022683151,0.0003212625,0.000588172,0.0007786054,0.000037142225,4.3608804e-7],"category_scores_gemma":[0.00000442192,0.00007630422,0.00007844191,0.00022267821,0.000056213416,0.0011878113,0.00026090193,0.00009490303,6.717566e-7],"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.00023147737,0.00027978036,0.0047572944,0.0011406383,0.00021229961,0.00038068226,0.015024509,0.041160103,0.0059819804,0.30443513,0.004017284,0.6223788],"study_design_scores_gemma":[0.0009312855,0.0007379218,0.002264638,0.00057246635,0.000012980317,0.0014551977,0.001209683,0.9892783,0.0009487065,0.0007464544,0.001574217,0.00026814244],"about_ca_topic_score_codex":0.0000042792935,"about_ca_topic_score_gemma":5.553368e-7,"teacher_disagreement_score":0.9481182,"about_ca_system_score_codex":0.000025021965,"about_ca_system_score_gemma":0.000055585224,"threshold_uncertainty_score":0.5671756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93331677,0.0006595729,0.0636157,0.0010712491,0.0006950746,0.00027428387,0.000007185147,0.000015811433,0.00034434185],"genre_scores_gemma":[0.98760134,0.00003204457,0.012146372,0.00017610949,0.000034836263,0.0000022384495,1.6710854e-7,0.000003273857,0.000003638755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975501,0.0006387925,0.0006069323,0.0002758775,0.0006932274,0.00023509096],"domain_scores_gemma":[0.99804544,0.00068804173,0.00056122785,0.00045879633,0.00013629803,0.00011019566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023893076,0.00017483193,0.00042016708,0.000084785854,0.0005583684,0.00046751392,0.0015797702,0.000044979734,0.0000019657566],"category_scores_gemma":[0.000036585265,0.000081216764,0.000084515166,0.00042913246,0.0010732646,0.0005990492,0.00030314416,0.00023076321,5.71121e-7],"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.000039433296,0.0002885869,0.0511069,0.0002519882,0.00008545555,0.000067985486,0.0032644062,0.0028129683,0.0048775175,0.92253757,0.0010942381,0.013572974],"study_design_scores_gemma":[0.0024082614,0.0043463963,0.15466848,0.004789976,0.000087485896,0.006721364,0.0014675324,0.76623845,0.0073670186,0.049544413,0.001302289,0.0010583145],"about_ca_topic_score_codex":0.0000614888,"about_ca_topic_score_gemma":0.000012419088,"teacher_disagreement_score":0.8729931,"about_ca_system_score_codex":0.000025080972,"about_ca_system_score_gemma":0.00010200548,"threshold_uncertainty_score":0.45082477},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23461498,0.00025133038,0.7637489,0.0005007949,0.00045760095,0.00012872927,3.7767938e-7,0.000010895357,0.0002863804],"genre_scores_gemma":[0.7739232,0.0000019993677,0.2256756,0.00013673634,0.00024739883,8.97155e-7,2.9660947e-8,0.00000238995,0.0000116975225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983827,0.000098234144,0.00045862285,0.00021154231,0.00052690745,0.00032199855],"domain_scores_gemma":[0.99895227,0.00046995262,0.0002548271,0.00014637115,0.000100459096,0.00007613495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066472786,0.000108186636,0.00020618734,0.00023994995,0.0003497059,0.00062749966,0.0013031933,0.000032215088,7.5987174e-8],"category_scores_gemma":[0.000009447032,0.00005852637,0.00008696586,0.0003960332,0.00009161047,0.0003637416,0.0001320169,0.00019300189,2.2729334e-7],"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.00010536807,0.0005333217,0.0027647917,0.00076256396,0.00004203426,0.00029103542,0.059773788,0.5681447,0.000895001,0.096374966,0.0015026232,0.26880985],"study_design_scores_gemma":[0.0003024471,0.00045397092,0.0008467063,0.0001404802,0.000002695207,0.00036651437,0.00023482664,0.99477375,0.000069524525,0.002525191,0.00019922461,0.000084693806],"about_ca_topic_score_codex":0.0000047728877,"about_ca_topic_score_gemma":0.0000033446854,"teacher_disagreement_score":0.53930825,"about_ca_system_score_codex":0.00002519675,"about_ca_system_score_gemma":0.00017451683,"threshold_uncertainty_score":0.6050993},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6363882,0.00040235597,0.35543677,0.0044839936,0.0011463941,0.0002844972,0.000002585211,0.00003796044,0.0018172924],"genre_scores_gemma":[0.9891797,0.00004073772,0.010270181,0.00029947446,0.00019374865,0.0000021564958,1.3600426e-7,0.0000024953265,0.000011428653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815935,0.0001943539,0.0005172064,0.00022986821,0.00070860545,0.00019062412],"domain_scores_gemma":[0.9984662,0.00046716075,0.00053695706,0.00027893172,0.00016759547,0.00008313799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001752113,0.00012879274,0.00028158384,0.0002383547,0.0003985,0.0002721011,0.0012832603,0.000033334116,0.000003381088],"category_scores_gemma":[0.000021820904,0.00007227738,0.00010133539,0.0005429165,0.00053966924,0.0005350883,0.00015860342,0.00015827964,0.0000046812547],"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.00001148604,0.00010186753,0.00039882853,0.00003277215,0.000016334838,0.0000070048545,0.0006879396,0.001789929,0.00008570647,0.98486865,0.00028427824,0.011715234],"study_design_scores_gemma":[0.0008487566,0.0033669788,0.0141934175,0.0012143797,0.000013707125,0.0011662055,0.00049518904,0.65729344,0.00068791123,0.31905586,0.0013438993,0.0003202365],"about_ca_topic_score_codex":0.00002843188,"about_ca_topic_score_gemma":0.0000034300933,"teacher_disagreement_score":0.66581273,"about_ca_system_score_codex":0.000024902158,"about_ca_system_score_gemma":0.00006159794,"threshold_uncertainty_score":0.30649802},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.843564,0.025410859,0.1009805,0.006692738,0.0036726233,0.00041403165,0.0000093126455,0.000013828184,0.019242153],"genre_scores_gemma":[0.9966004,0.00015601944,0.0025859924,0.00017113762,0.0001938476,0.0000010921959,2.2559188e-7,0.0000019931597,0.00028927674],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941677,0.00008492002,0.00015315134,0.00009939847,0.00015927939,0.00008650323],"domain_scores_gemma":[0.9996114,0.000011594051,0.00016217235,0.000082730556,0.00008631841,0.00004578488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006038165,0.00005134369,0.000072332645,0.000024597162,0.00022601333,0.00010466485,0.00017148705,0.00003110666,0.0000010478694],"category_scores_gemma":[0.0000045920656,0.00002657926,0.000042091968,0.00007529218,0.00007640123,0.0000052622945,0.000018310368,0.000043276304,6.637703e-7],"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.00011907583,0.00006343426,0.01311414,0.00017525982,0.00018161906,0.000010450085,0.0016817469,0.00050673157,0.32352257,0.027583215,0.58538866,0.04765307],"study_design_scores_gemma":[0.00041468258,0.0005338699,0.002506259,0.000094161594,0.000011276774,0.0006362036,0.0012310306,0.0007647328,0.015716359,0.00029367759,0.97767246,0.00012531663],"about_ca_topic_score_codex":4.0554195e-7,"about_ca_topic_score_gemma":5.0202317e-7,"teacher_disagreement_score":0.39228374,"about_ca_system_score_codex":0.0000044152885,"about_ca_system_score_gemma":0.00006755677,"threshold_uncertainty_score":0.17383347},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076836616,0.0005832814,0.92160183,0.000053197768,0.00043334407,0.0003391468,0.000011429607,0.000003685148,0.00013744204],"genre_scores_gemma":[0.6058625,0.000046923997,0.3933572,0.000057850742,0.0006386393,0.000009197394,0.0000062105028,0.0000060105,0.00001546118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992675,0.000052581003,0.00027408174,0.00013627399,0.00013878474,0.00013075552],"domain_scores_gemma":[0.9994913,0.000015221925,0.00023437191,0.00009128384,0.00011861801,0.00004920635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010436944,0.00007735605,0.00011553769,0.00004713723,0.00016882285,0.00007876887,0.000282549,0.00002839309,0.0000020272723],"category_scores_gemma":[0.0000014751884,0.00004623172,0.000060587958,0.00005403391,0.0000731984,0.00002429284,0.000041541338,0.00003432208,1.9850259e-7],"study_design_candidate":"design_other","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.00014663837,0.0002075323,0.001833823,0.00016671453,0.0003161316,0.000004090762,0.0011029964,0.0002683541,0.030496255,0.00033692503,0.0013530261,0.9637675],"study_design_scores_gemma":[0.004336455,0.020490512,0.015584856,0.00018401827,0.00023277472,0.0010971127,0.007766258,0.924935,0.016048962,0.0011576856,0.0074800523,0.00068634463],"about_ca_topic_score_codex":0.00001115243,"about_ca_topic_score_gemma":0.0000024825767,"teacher_disagreement_score":0.9630812,"about_ca_system_score_codex":0.000008822438,"about_ca_system_score_gemma":0.00005026193,"threshold_uncertainty_score":0.18852748},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56316847,0.00023578914,0.4334615,0.0012332624,0.0015482479,0.00007881429,0.0000045578,0.000013406374,0.0002559635],"genre_scores_gemma":[0.98270726,0.000019502657,0.016974336,0.000044744666,0.00023109419,4.3678205e-7,1.1391639e-7,0.0000018051973,0.00002073363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860716,0.000083208506,0.0005925341,0.00013514537,0.00043987928,0.00014206012],"domain_scores_gemma":[0.9985504,0.00025758598,0.00065289007,0.00017472154,0.0002813737,0.000083019535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012634346,0.00008214239,0.0002326312,0.00012955363,0.00023610536,0.00013460903,0.0009401198,0.00003523149,9.488174e-7],"category_scores_gemma":[0.000020895153,0.0000478145,0.00008026606,0.00045371617,0.00030759495,0.00042890885,0.00015106275,0.00011722523,6.0844604e-7],"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.00007292042,0.00013762517,0.010310756,0.0005591808,0.00020457048,0.000059842856,0.035607927,0.012455286,0.02644249,0.63552696,0.005352762,0.27326965],"study_design_scores_gemma":[0.00032428262,0.00039493662,0.0031165099,0.00019524251,0.000011391777,0.00069755677,0.00025881323,0.9884436,0.002654349,0.0027908476,0.0010025064,0.00010997851],"about_ca_topic_score_codex":0.000041394946,"about_ca_topic_score_gemma":0.000008480287,"teacher_disagreement_score":0.97598827,"about_ca_system_score_codex":0.000010831962,"about_ca_system_score_gemma":0.00027878338,"threshold_uncertainty_score":0.19498187},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019994457,0.0015746331,0.9932528,0.0019345381,0.0010121444,0.00014925427,0.0000155561,0.000018007959,0.000043629083],"genre_scores_gemma":[0.43408874,0.000045112098,0.5643814,0.00020087781,0.0012623331,0.0000010599573,0.0000017008593,0.0000036974466,0.00001506785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880165,0.000029752637,0.00034466689,0.00025338837,0.00040746655,0.00016307087],"domain_scores_gemma":[0.99893034,0.00017603087,0.0002893114,0.0004004922,0.00009815107,0.00010567293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007434051,0.00009776057,0.0001774754,0.00008253348,0.00047564475,0.0005441907,0.002399202,0.00002978422,7.300093e-7],"category_scores_gemma":[0.000006232008,0.000047710153,0.00004536925,0.00024213294,0.000073432966,0.0013873616,0.0005743368,0.000093824005,4.836304e-7],"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.000045490266,0.00009701445,0.00090502587,0.00017286232,0.00017110334,0.000047226844,0.0029966654,0.043984823,0.00049441465,0.23212534,0.050855413,0.6681046],"study_design_scores_gemma":[0.0018201866,0.0012062286,0.008088204,0.0007061023,0.000047013575,0.0045713293,0.00047752884,0.92297786,0.00007365801,0.029297937,0.030427907,0.0003060351],"about_ca_topic_score_codex":0.000041503255,"about_ca_topic_score_gemma":0.0000072393445,"teacher_disagreement_score":0.87899303,"about_ca_system_score_codex":0.000020303814,"about_ca_system_score_gemma":0.00028876448,"threshold_uncertainty_score":0.52476436},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10212538,0.00019649534,0.8964209,0.0004823898,0.00038260364,0.00011365962,8.636358e-7,0.000014911983,0.00026279193],"genre_scores_gemma":[0.93641526,0.000006203518,0.06342796,0.000027816635,0.0001053825,0.0000021796623,2.9319654e-7,0.0000018321202,0.000013076875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886703,0.00014010805,0.00044183587,0.00016832483,0.00026170458,0.000121013356],"domain_scores_gemma":[0.99875337,0.00031247662,0.0005419783,0.000112525224,0.0001970116,0.00008261473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041363696,0.000075203505,0.000247461,0.00014261711,0.00017346279,0.00018179245,0.00036641973,0.00004667902,4.0724484e-7],"category_scores_gemma":[0.000040682324,0.000055038923,0.000040756073,0.00018452844,0.000118068674,0.00028515086,0.000048873317,0.000057590987,4.27215e-7],"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.00002612086,0.000029751754,0.0028553861,0.00028102042,0.000023042987,4.525858e-7,0.0033584526,0.00008782426,0.0034206866,0.9125776,0.00024876854,0.07709089],"study_design_scores_gemma":[0.0015089595,0.0012660703,0.04632816,0.00047827695,0.00006372771,0.00023936082,0.0009823507,0.9150955,0.008330076,0.022842256,0.0025052805,0.00035999576],"about_ca_topic_score_codex":0.0000012603974,"about_ca_topic_score_gemma":2.0300608e-7,"teacher_disagreement_score":0.91500765,"about_ca_system_score_codex":0.000010093308,"about_ca_system_score_gemma":0.000042962118,"threshold_uncertainty_score":0.22444221},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077027135,0.0008921219,0.24502902,0.000089564404,0.75250906,0.00026662048,0.0000057446505,0.000035543457,0.00040204145],"genre_scores_gemma":[0.014342667,0.00004981473,0.0015231115,0.000017188982,0.9840154,0.0000031962327,0.0000019076429,0.000009956767,0.00003675185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99624926,0.0006632926,0.00093742926,0.00061041396,0.0011978296,0.0003418029],"domain_scores_gemma":[0.9956589,0.0026775047,0.00096611277,0.00027871126,0.0002293752,0.00018944276],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0061043394,0.0003328912,0.00084914296,0.00046275344,0.0004404666,0.0013145762,0.0011088586,0.00027344498,2.191241e-7],"category_scores_gemma":[0.000081459926,0.00023608418,0.000077185214,0.00038001713,0.00024577338,0.00007857283,0.0006029292,0.00058749336,0.0000014845747],"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.000021902511,0.000044339846,0.00011140337,0.0004521494,0.000044489778,0.000015873375,0.00070132955,0.01631292,2.2678795e-7,0.019885639,0.94834584,0.0140638845],"study_design_scores_gemma":[0.00072921795,0.0005668552,0.00019993617,0.001491989,0.00002934836,0.00006459899,0.0004322288,0.12119605,1.4799534e-7,0.00048318732,0.8744805,0.00032598292],"about_ca_topic_score_codex":0.00002515821,"about_ca_topic_score_gemma":0.0000019189652,"teacher_disagreement_score":0.24350591,"about_ca_system_score_codex":0.000089070105,"about_ca_system_score_gemma":0.00011432578,"threshold_uncertainty_score":0.9997222},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049803995,0.0033106979,0.9444795,0.00014733567,0.0009980751,0.00009072917,0.0000022117704,0.000017502312,0.00114993],"genre_scores_gemma":[0.8500183,0.00009786996,0.14961472,0.000053483916,0.00019034033,5.6768704e-7,1.5798933e-7,0.0000028024435,0.000021746178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799854,0.000094109346,0.0008738312,0.00020473423,0.000594932,0.0002338845],"domain_scores_gemma":[0.9982338,0.00021011182,0.0009612528,0.00023784388,0.00019840196,0.00015860157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035473863,0.00012445616,0.00043343555,0.0002464601,0.00019593259,0.000104265724,0.0005353622,0.000033796274,0.0000010331335],"category_scores_gemma":[0.000015412377,0.00008024647,0.00011051364,0.000462016,0.00013333482,0.0014944723,0.00014755252,0.000090582325,0.0000015740732],"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.000030068457,0.00018946876,0.01032088,0.00087866804,0.000083438106,0.0003696892,0.004501852,0.0003990002,0.0031861363,0.74699634,0.0017122885,0.23133218],"study_design_scores_gemma":[0.005547705,0.00820343,0.26466393,0.02337197,0.00025166874,0.046962857,0.018440943,0.08291926,0.02399736,0.0046356227,0.51751,0.0034952408],"about_ca_topic_score_codex":0.000012605773,"about_ca_topic_score_gemma":0.0000136149165,"teacher_disagreement_score":0.8002143,"about_ca_system_score_codex":0.00002138279,"about_ca_system_score_gemma":0.000096908974,"threshold_uncertainty_score":0.3272356},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99514824,0.00051034236,0.0022874621,0.00045537343,0.00037222146,0.000042338346,0.000001059638,2.3906625e-7,0.0011827055],"genre_scores_gemma":[0.99920005,0.000015624068,0.0004980875,0.000107951244,0.00016251105,1.05752804e-7,2.2287352e-8,0.000001162755,0.000014475244],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99950933,0.000044709173,0.00017427297,0.000058326088,0.00013959262,0.0000737876],"domain_scores_gemma":[0.99961036,0.000042050182,0.00017696725,0.00008096054,0.00006870075,0.000020969412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096637645,0.000045428187,0.00009202966,0.000018155642,0.0001385159,0.000016916087,0.00022438193,0.000017574954,4.3175592e-7],"category_scores_gemma":[0.000008850954,0.000019348985,0.000058799586,0.00006054389,0.0003634692,5.0366975e-7,0.00007263354,0.000033556364,1.1461515e-7],"study_design_candidate":"observational","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.000315895,0.00020387504,0.12619698,0.00018976581,0.0005528927,0.000009857909,0.00324205,0.002952019,0.6356855,0.20908237,0.010194057,0.011374763],"study_design_scores_gemma":[0.0010305784,0.0031725408,0.85457695,0.0003079695,0.00005847953,0.0005928995,0.003937407,0.0017088974,0.12342317,0.0038310909,0.007065115,0.00029488956],"about_ca_topic_score_codex":0.000003932675,"about_ca_topic_score_gemma":0.000006481622,"teacher_disagreement_score":0.72837996,"about_ca_system_score_codex":0.0000029050059,"about_ca_system_score_gemma":0.000026039877,"threshold_uncertainty_score":0.13392174},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.775033,0.00025120267,0.2231852,0.0012220033,0.00010370411,0.00013506968,0.000008294531,0.000012559892,0.000048948226],"genre_scores_gemma":[0.8928648,0.000026180882,0.10692258,0.00009224815,0.00008409028,0.0000010555601,0.0000010178319,0.0000031699608,0.000004821659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981015,0.00022314287,0.0005130666,0.00032599954,0.0006400605,0.00019623047],"domain_scores_gemma":[0.9985511,0.00036652165,0.0004684699,0.00011664564,0.00027794755,0.00021931874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014931269,0.00013257824,0.0003050244,0.00037493967,0.0003440039,0.00026211143,0.00025438066,0.00003876269,3.3535116e-7],"category_scores_gemma":[0.000016180387,0.0000962238,0.000023776614,0.00036026497,0.00047798862,0.0013718554,0.00015477244,0.00013185084,3.8138376e-7],"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.0026262128,0.00032353576,0.03992294,0.0006670783,0.00033544292,0.000056383153,0.011196056,0.053698674,0.02571524,0.7577057,0.0010598196,0.10669291],"study_design_scores_gemma":[0.0013344075,0.0015101137,0.20818812,0.00018685567,0.000016222044,0.0015750618,0.00026597158,0.78077304,0.0001121748,0.005583851,0.00027826024,0.0001759375],"about_ca_topic_score_codex":0.000019761768,"about_ca_topic_score_gemma":0.000029138535,"teacher_disagreement_score":0.75212187,"about_ca_system_score_codex":0.000051925952,"about_ca_system_score_gemma":0.00005248578,"threshold_uncertainty_score":0.39238924},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0752771,0.0023461282,0.9178856,0.0014233042,0.0012951002,0.00007380483,9.20997e-7,0.000028487679,0.0016695821],"genre_scores_gemma":[0.923916,0.00011115679,0.075671546,0.000086531116,0.00018752209,5.440299e-7,4.0511686e-8,0.0000017112519,0.000024992898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986388,0.00010601281,0.000424402,0.00020425783,0.00042911284,0.00019742161],"domain_scores_gemma":[0.99929655,0.00012977993,0.00026786153,0.00014889408,0.00005914202,0.00009775546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010054398,0.00009388738,0.00022938184,0.0003071947,0.00022205745,0.00039105353,0.0009454823,0.000033369608,0.0000034681973],"category_scores_gemma":[0.000007749937,0.00006176317,0.00004955903,0.0004754137,0.000097242475,0.001297873,0.00019294766,0.00012045419,0.0000036740391],"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.000016465414,0.000426395,0.03478491,0.00037592047,0.00007929279,0.0025539324,0.01795238,0.014244643,0.0007225266,0.49833655,0.034746483,0.3957605],"study_design_scores_gemma":[0.0003020554,0.000286341,0.0033115554,0.00054156675,0.0000032252053,0.0014508867,0.0003683663,0.9904628,0.000041995172,0.0011142392,0.0019742753,0.00014269193],"about_ca_topic_score_codex":0.000012063125,"about_ca_topic_score_gemma":0.0000018706629,"teacher_disagreement_score":0.97621816,"about_ca_system_score_codex":0.000027201524,"about_ca_system_score_gemma":0.000030445113,"threshold_uncertainty_score":0.37709382},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.746488,0.008745558,0.23661552,0.00452645,0.0023266922,0.00017669125,0.000010667445,0.00010969795,0.0010007718],"genre_scores_gemma":[0.95354176,0.00012543291,0.045746874,0.00032183327,0.00020949314,9.321118e-7,1.8056768e-7,0.000004554314,0.00004893577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810356,0.0001840741,0.0004913705,0.0003485882,0.00058494764,0.00028747675],"domain_scores_gemma":[0.99879664,0.00024018077,0.00032658814,0.00027139345,0.00011631954,0.0002489006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015932466,0.00019160754,0.000394347,0.00022991256,0.00049423095,0.0009493258,0.0009083036,0.000058785383,0.000007608391],"category_scores_gemma":[0.000018205254,0.00013771401,0.00007146029,0.00026730882,0.0007680142,0.0014173042,0.0005081228,0.00016056641,0.000002610309],"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.000054432687,0.00027947046,0.013689396,0.00032781984,0.00013082555,0.0004973299,0.0038438002,0.00008162112,0.00027378366,0.8133156,0.024477845,0.14302811],"study_design_scores_gemma":[0.0019211159,0.0016582038,0.046225708,0.0006342327,0.000031021875,0.012229454,0.00082846323,0.8940174,0.000024638795,0.037977234,0.003946462,0.0005060409],"about_ca_topic_score_codex":0.000023653514,"about_ca_topic_score_gemma":0.0000055487503,"teacher_disagreement_score":0.8939358,"about_ca_system_score_codex":0.00003093233,"about_ca_system_score_gemma":0.000046366313,"threshold_uncertainty_score":0.9154371},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10624969,0.00011099328,0.8907408,0.0005283755,0.00077109947,0.00021423117,0.0000011368315,0.000012625324,0.0013710397],"genre_scores_gemma":[0.9075145,0.0000029616021,0.09234968,0.000069165515,0.000051070387,0.0000023891143,8.160926e-8,0.000001778276,0.000008367743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985802,0.0001378821,0.0004802995,0.0002261437,0.00037480504,0.00020066225],"domain_scores_gemma":[0.9992278,0.000172186,0.00017346597,0.00013125471,0.0001988239,0.00009645084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027594266,0.00009277017,0.0002426959,0.00022020993,0.0001974216,0.00038531006,0.00036274915,0.000043370015,0.0000060602288],"category_scores_gemma":[0.000027118844,0.00006938839,0.00007090343,0.00041327497,0.00018587841,0.0006696031,0.00005067446,0.00011502876,4.5965797e-7],"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.00003993714,0.00020268171,0.1376455,0.00027959014,0.000030290004,0.0000273215,0.0025957006,0.013758213,0.000082249186,0.8041597,0.0006712522,0.04050759],"study_design_scores_gemma":[0.0011930146,0.00090010953,0.05915838,0.00024545848,0.000006208176,0.0006248533,0.00035816355,0.92588294,0.00017807233,0.010702087,0.0005141361,0.00023656228],"about_ca_topic_score_codex":0.0000067369574,"about_ca_topic_score_gemma":0.00002341101,"teacher_disagreement_score":0.91212475,"about_ca_system_score_codex":0.00005639738,"about_ca_system_score_gemma":0.00023369698,"threshold_uncertainty_score":0.3715554},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22983928,0.002509523,0.763048,0.0021153586,0.0009005877,0.00007010596,1.826697e-7,0.000023228535,0.0014937458],"genre_scores_gemma":[0.91164225,0.00006751301,0.08789708,0.00007293899,0.00030998522,2.4672178e-7,7.4446575e-8,0.000001913919,0.000008006953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988322,0.00017068512,0.0003342977,0.0001443744,0.00031554102,0.0002029033],"domain_scores_gemma":[0.9993359,0.00014985321,0.00022803774,0.000078796176,0.00006863624,0.00013880468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019787552,0.00008183925,0.00018637658,0.0002060253,0.00013235673,0.00033047158,0.00028513034,0.000040855,2.6331324e-7],"category_scores_gemma":[0.000014009836,0.000057628207,0.000023703746,0.00042578796,0.00012089204,0.0012813733,0.000058025063,0.00011478955,6.8598746e-7],"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.00006030565,0.0003706598,0.13850914,0.0003174312,0.00004183746,0.00005023255,0.021500243,0.0062418017,0.00058752485,0.475456,0.0023745883,0.35449022],"study_design_scores_gemma":[0.00051951205,0.0002850547,0.060905553,0.0003461254,0.0000084862,0.0013220663,0.0006529327,0.9342209,0.000055024822,0.0008300315,0.00068484445,0.00016943816],"about_ca_topic_score_codex":0.0000019117806,"about_ca_topic_score_gemma":3.9724577e-7,"teacher_disagreement_score":0.9279791,"about_ca_system_score_codex":0.00002350492,"about_ca_system_score_gemma":0.00005508399,"threshold_uncertainty_score":0.3186745},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90983063,0.0032056894,0.0843809,0.0013768609,0.00028862106,0.000332851,0.0000039836536,0.000006178067,0.00057431],"genre_scores_gemma":[0.987858,0.00011521796,0.011711106,0.000046673034,0.00019241449,0.000008654608,3.1072597e-7,0.0000032023738,0.00006441976],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927735,0.00008204284,0.0002247349,0.000115264214,0.0001715449,0.00012905174],"domain_scores_gemma":[0.9994122,0.00008308895,0.0002325312,0.00008004036,0.00014148669,0.000050695966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140117,0.00007309329,0.00011756453,0.000029515924,0.00040021839,0.00016377549,0.00026081345,0.000026864278,4.9786e-7],"category_scores_gemma":[0.000007962553,0.000036873753,0.000039397575,0.00008565689,0.00019036069,0.000015828791,0.000017651304,0.000031905984,3.5943577e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00064127997,0.00031340387,0.025279038,0.0008378056,0.0006206097,0.00012402679,0.0036091153,0.008704508,0.46022698,0.05445613,0.007539089,0.43764803],"study_design_scores_gemma":[0.010108522,0.075926326,0.0348678,0.006534863,0.0006899646,0.03533867,0.01729214,0.14646061,0.5327407,0.01256848,0.12312276,0.0043491507],"about_ca_topic_score_codex":0.000003748787,"about_ca_topic_score_gemma":0.00001575873,"teacher_disagreement_score":0.43329886,"about_ca_system_score_codex":0.000004934293,"about_ca_system_score_gemma":0.00003692163,"threshold_uncertainty_score":0.30781966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038145754,0.00012505054,0.95991194,0.0007387158,0.00027307172,0.00028575366,0.0000021298265,0.00002785126,0.0004897452],"genre_scores_gemma":[0.7251117,0.0000064732862,0.2746974,0.000066073844,0.000096421114,0.000008645407,9.899759e-8,0.000004109925,0.000009084233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808675,0.00016160011,0.00042956494,0.00028688024,0.0007006604,0.00033452545],"domain_scores_gemma":[0.9986838,0.00048503684,0.00023560385,0.0001994509,0.00024507128,0.00015103957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00402237,0.00012802739,0.0002929351,0.00062772934,0.00040786582,0.00029699085,0.0012014009,0.000045203225,2.7705514e-7],"category_scores_gemma":[0.000031576103,0.000086481086,0.000113470516,0.0007019822,0.00020016954,0.00058834854,0.00010670298,0.0001894555,0.0000011136594],"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.00009803737,0.00006767442,0.0002286163,0.00017199827,0.00003192181,0.000108030006,0.0013366159,0.0037306852,0.004504334,0.95112497,0.00019252542,0.038404595],"study_design_scores_gemma":[0.013066116,0.0345981,0.005185315,0.0069077713,0.000046873774,0.013193561,0.0038656143,0.16934124,0.079591446,0.67061985,0.0016699312,0.0019141857],"about_ca_topic_score_codex":0.000003851062,"about_ca_topic_score_gemma":0.000001991597,"teacher_disagreement_score":0.68696594,"about_ca_system_score_codex":0.00006313835,"about_ca_system_score_gemma":0.00016672771,"threshold_uncertainty_score":0.35265964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03597238,0.00030730825,0.9608555,0.00042577588,0.0015792695,0.00015064156,4.244738e-7,0.000024363633,0.00068432564],"genre_scores_gemma":[0.78920436,0.000015488107,0.2102422,0.000118198455,0.00039670663,0.0000026012842,7.1136824e-8,0.000002144144,0.000018225393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844587,0.00023882512,0.000511868,0.0001945774,0.00041957694,0.00018930146],"domain_scores_gemma":[0.9983136,0.00087609777,0.00040084918,0.00014083195,0.00016202677,0.000106593005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047765756,0.00010612195,0.0004969389,0.0002744869,0.00034273343,0.0004731952,0.0009061738,0.000033445674,8.0694775e-7],"category_scores_gemma":[0.00004059687,0.00006616957,0.00019330237,0.00029171407,0.00021521786,0.00050800754,0.00016935561,0.00007639118,9.900376e-7],"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.0005307386,0.0000660909,0.00044841625,0.00015109727,0.000048792175,0.0000051858256,0.0012871621,0.0004319311,0.000056354318,0.8420937,0.0010061271,0.15387441],"study_design_scores_gemma":[0.024627307,0.0005491444,0.00040580917,0.0002215804,0.000015142516,0.00031971987,0.00006104899,0.9474481,0.0000777416,0.024097338,0.0020357412,0.00014134958],"about_ca_topic_score_codex":0.000004051246,"about_ca_topic_score_gemma":5.232711e-7,"teacher_disagreement_score":0.9470161,"about_ca_system_score_codex":0.000010602531,"about_ca_system_score_gemma":0.00004938686,"threshold_uncertainty_score":0.4563032},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3423549,0.00019535165,0.6550471,0.00023399333,0.001900771,0.000032917982,1.3896877e-7,0.000010170958,0.00022467235],"genre_scores_gemma":[0.76170594,0.000007826035,0.23798195,0.00004501932,0.00025259214,4.3807884e-7,5.6540365e-8,0.0000011129935,0.0000050856856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988836,0.00006397641,0.0003756347,0.00016318509,0.00037573001,0.0001378524],"domain_scores_gemma":[0.9993951,0.00011518417,0.00020510724,0.00008299864,0.000118448705,0.000083185965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016539149,0.00007485924,0.00016432056,0.00047781478,0.00013945147,0.00028164932,0.00049555156,0.000032378044,0.000001252681],"category_scores_gemma":[0.000008111519,0.000055237706,0.000048565867,0.0006705624,0.00006338134,0.0007840469,0.000079653735,0.00015481269,0.0000013487983],"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.0000143626485,0.00017722431,0.01245898,0.0001031392,0.000036000507,0.00023211633,0.0047049113,0.09704285,0.006137248,0.34840202,0.0015965072,0.52909464],"study_design_scores_gemma":[0.0004108324,0.00025057612,0.016209885,0.000098474935,0.000002402453,0.0014631156,0.0001478112,0.97699344,0.00036281304,0.0028501984,0.00106562,0.0001448148],"about_ca_topic_score_codex":0.000004126459,"about_ca_topic_score_gemma":0.000003903838,"teacher_disagreement_score":0.8799506,"about_ca_system_score_codex":0.00001042753,"about_ca_system_score_gemma":0.00007978114,"threshold_uncertainty_score":0.2715951},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2615792,0.0014112348,0.7338789,0.0009080859,0.00043086265,0.000083146,4.0491094e-7,0.000023380451,0.0016847757],"genre_scores_gemma":[0.92574793,0.00003058634,0.07396845,0.00007190362,0.00016197351,6.2783164e-7,1.48489905e-8,0.0000018892407,0.000016619546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845797,0.0001539282,0.00041852036,0.00019132443,0.00052849454,0.00024976127],"domain_scores_gemma":[0.99926245,0.0001992567,0.00019049393,0.00014202463,0.000083354804,0.0001224366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020979012,0.00008757993,0.00022949593,0.0005322335,0.00011880394,0.00024570647,0.0010867374,0.000027070542,0.0000010391165],"category_scores_gemma":[0.0000091415495,0.000060083185,0.000057700898,0.00068776886,0.00015539888,0.001191697,0.000103952625,0.00014587032,0.000004127549],"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.00003899661,0.00014753797,0.044768576,0.00010065186,0.00003618443,0.0003438863,0.0041867215,0.01325051,0.0004485306,0.64266646,0.0009669395,0.29304498],"study_design_scores_gemma":[0.0029141475,0.0023317747,0.0775703,0.0012391781,0.0000098126075,0.0065732277,0.0013704636,0.8564266,0.0010996726,0.04192662,0.0077491733,0.0007890314],"about_ca_topic_score_codex":0.0000033410854,"about_ca_topic_score_gemma":0.0000051960437,"teacher_disagreement_score":0.84317607,"about_ca_system_score_codex":0.000031463176,"about_ca_system_score_gemma":0.00007270735,"threshold_uncertainty_score":0.2450121},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70186317,0.0016579904,0.29483333,0.000056740886,0.00071132893,0.00013795195,0.0000016204287,0.00007037991,0.00066746643],"genre_scores_gemma":[0.8668901,0.00017921595,0.13271981,0.000008088629,0.00017990042,0.0000020234963,8.112857e-7,0.0000072476114,0.000012842931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901617,0.00008161146,0.00047599612,0.0000866891,0.00021191752,0.00012760202],"domain_scores_gemma":[0.9991094,0.000363059,0.0001786379,0.00012658208,0.00016022756,0.00006213425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016370203,0.000088372944,0.0002433349,0.00013170783,0.00011770754,0.00017111444,0.00029051508,0.000038010643,7.535988e-7],"category_scores_gemma":[0.000025371652,0.000067958,0.000059680904,0.00015779829,0.000042479296,0.0002956176,0.000022735096,0.000053930245,0.0000037711516],"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.000058738173,0.000063942796,0.034642633,0.0027985729,0.00025915538,0.000004261365,0.0064975037,0.35822937,0.0902342,0.009017452,0.000230182,0.497964],"study_design_scores_gemma":[0.00023642366,0.000103115,0.007978225,0.00027566782,0.0000065698096,0.00005607152,0.0001584118,0.9886586,0.00045594331,0.000065489156,0.0019198583,0.00008561487],"about_ca_topic_score_codex":0.0000045337965,"about_ca_topic_score_gemma":0.0000017415445,"teacher_disagreement_score":0.63042927,"about_ca_system_score_codex":0.000026712356,"about_ca_system_score_gemma":0.000021751444,"threshold_uncertainty_score":0.27712467},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007133393,0.0014446585,0.9175283,0.00032972047,0.07832641,0.0009002834,0.00010970454,0.00048497715,0.0008046238],"genre_scores_gemma":[0.010610036,0.00004506789,0.9799397,0.00021223164,0.005471694,0.00005375858,0.000025238649,0.00007000816,0.003572273],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933007,0.0002946737,0.002376674,0.0012311733,0.0018564141,0.0009404183],"domain_scores_gemma":[0.99423534,0.0001809655,0.00199308,0.0009421246,0.0021137116,0.00053478143],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0041531874,0.00079334056,0.0019075044,0.0017594249,0.0006912626,0.0014770565,0.0046853595,0.0004584646,3.4242015e-7],"category_scores_gemma":[0.000022144066,0.0006345876,0.00041107088,0.002087097,0.00024309466,0.00080027594,0.0007453627,0.00070031936,0.0000057235393],"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.000026308904,0.00004428773,0.000026673359,0.0010556745,0.000072172035,0.00013359742,0.00029569858,0.0038267726,0.000006392769,0.04889429,0.9386204,0.006997732],"study_design_scores_gemma":[0.000825873,0.0016138445,0.0003025574,0.0056575704,0.00006889221,0.002153094,0.000036040958,0.4566861,0.000028734159,0.00019513529,0.5314782,0.0009538955],"about_ca_topic_score_codex":0.00009399687,"about_ca_topic_score_gemma":0.000010270956,"teacher_disagreement_score":0.45285934,"about_ca_system_score_codex":0.00038423436,"about_ca_system_score_gemma":0.0008986229,"threshold_uncertainty_score":0.99961054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17981726,0.0005968251,0.81778973,0.0007031865,0.000877215,0.00007314525,0.0000014836344,0.00001087751,0.00013030144],"genre_scores_gemma":[0.967194,0.000022526405,0.03244943,0.00011737779,0.00020836454,8.1835805e-7,5.209866e-8,0.0000015554133,0.0000058446744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898714,0.00006978457,0.00036876064,0.00011416487,0.00033631863,0.0001238335],"domain_scores_gemma":[0.9990952,0.00029459357,0.0002861966,0.00012916012,0.00014803807,0.000046822443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014123023,0.00007067327,0.00021585014,0.00008520385,0.0003756047,0.00010906043,0.0007135019,0.000021258582,0.0000010439329],"category_scores_gemma":[0.000004618203,0.000038068367,0.00011407454,0.00020626932,0.00047275692,0.00045064537,0.000046447523,0.0000516507,3.5134082e-7],"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.00012559608,0.0003159893,0.0011487395,0.0004331206,0.00019234479,0.00008487396,0.018604372,0.0048129046,0.0015484958,0.8983545,0.0077539366,0.066625185],"study_design_scores_gemma":[0.0008818351,0.0014944911,0.011469659,0.0002865457,0.0000244627,0.0034208032,0.0006709407,0.96945304,0.000684248,0.010174617,0.0012594147,0.00017997238],"about_ca_topic_score_codex":0.000006947138,"about_ca_topic_score_gemma":7.1726316e-7,"teacher_disagreement_score":0.9646401,"about_ca_system_score_codex":0.00001033876,"about_ca_system_score_gemma":0.00007518877,"threshold_uncertainty_score":0.28888857},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99384964,0.0016516855,0.0037302,0.00009235514,0.00018971041,0.000033780645,4.0333097e-7,0.0000033275705,0.00044887338],"genre_scores_gemma":[0.99867207,0.00009308976,0.0008042324,0.00012337502,0.0002782886,2.53518e-7,1.3744805e-7,0.0000016757277,0.000026852695],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944234,0.00006042016,0.00018038353,0.0001248742,0.00009091404,0.00010107647],"domain_scores_gemma":[0.9997282,0.000021026879,0.000105011764,0.00004480592,0.000048399554,0.000052550935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034292325,0.0000760174,0.00014169181,0.000035798774,0.00018451862,0.000042015046,0.00012635275,0.00003853324,4.1785816e-7],"category_scores_gemma":[0.0000114134145,0.000036802834,0.00003817141,0.000050497878,0.00018903692,0.0000054913676,0.00006290092,0.000047238067,2.854457e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0010905181,0.0005332898,0.10417372,0.00053277984,0.00045017008,0.00023014787,0.0065291985,0.002599415,0.62857753,0.006155405,0.007747585,0.24138024],"study_design_scores_gemma":[0.014287536,0.10022795,0.26233104,0.006012997,0.00014425149,0.06642034,0.018824324,0.13527703,0.34055308,0.002663063,0.04817373,0.0050846576],"about_ca_topic_score_codex":0.0000013794211,"about_ca_topic_score_gemma":3.5740683e-7,"teacher_disagreement_score":0.2880245,"about_ca_system_score_codex":0.0000026368189,"about_ca_system_score_gemma":0.000029617406,"threshold_uncertainty_score":0.1500776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050553214,0.00006731369,0.94783205,0.00053651945,0.0006551452,0.000098090895,6.7983785e-7,0.0000113881115,0.00024562847],"genre_scores_gemma":[0.8379368,0.000006440936,0.16191658,0.000031246225,0.00010277701,2.8875704e-7,1.4214807e-7,0.0000011177466,0.0000046057175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989802,0.000081396516,0.00045820445,0.0001031364,0.00025975384,0.00011728739],"domain_scores_gemma":[0.9988148,0.0002675012,0.00044834873,0.000099403274,0.00030164822,0.00006826389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030637907,0.00005818349,0.00013736449,0.00012253146,0.00035035767,0.00020604,0.00039022742,0.00002537649,5.001001e-7],"category_scores_gemma":[0.0000127458725,0.000035585617,0.000051185372,0.00022115833,0.00026934495,0.00062036363,0.000035929937,0.000048691152,1.5743576e-7],"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.000040230494,0.000037158574,0.006811649,0.000055521275,0.000022818207,0.0000029844962,0.0017569618,0.0041899597,0.00053891685,0.8003106,0.00017025773,0.18606295],"study_design_scores_gemma":[0.0004290729,0.0007453417,0.050276026,0.00008491796,0.000007035124,0.00033823398,0.00062893564,0.94161123,0.0005718319,0.0046368386,0.0005727578,0.00009778817],"about_ca_topic_score_codex":0.000006337062,"about_ca_topic_score_gemma":0.000029099127,"teacher_disagreement_score":0.93742126,"about_ca_system_score_codex":0.000019483314,"about_ca_system_score_gemma":0.0000846955,"threshold_uncertainty_score":0.26947033},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61064494,0.00051813474,0.3866712,0.0017682154,0.00024154197,0.000072681636,8.5084673e-7,0.000016795113,0.00006564418],"genre_scores_gemma":[0.9675555,0.000007549832,0.032059155,0.00023359564,0.00013571895,7.1643046e-7,4.8860468e-8,0.000002352841,0.0000053484373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988326,0.00010278174,0.00034082454,0.00017895816,0.00037875483,0.00016608209],"domain_scores_gemma":[0.9990651,0.00022296236,0.0003383517,0.000223452,0.000088046014,0.00006207427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011288888,0.000110806184,0.00026335815,0.00008121323,0.00020638783,0.00022199478,0.0009603208,0.000025753176,0.0000013185187],"category_scores_gemma":[0.0000071882514,0.00004195422,0.000056371522,0.00033602543,0.0003167563,0.0004752486,0.00009348962,0.00011302758,2.7407583e-7],"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.00070531125,0.001014969,0.04369876,0.0029154674,0.0008289976,0.0025630384,0.0995777,0.46122816,0.01064019,0.2914666,0.004671352,0.080689475],"study_design_scores_gemma":[0.025068436,0.023830041,0.32711855,0.016974887,0.0004966006,0.0864942,0.03219717,0.4280897,0.03330499,0.017072307,0.005176315,0.0041768127],"about_ca_topic_score_codex":0.000030083138,"about_ca_topic_score_gemma":0.000014225635,"teacher_disagreement_score":0.35691056,"about_ca_system_score_codex":0.000016691321,"about_ca_system_score_gemma":0.00010337587,"threshold_uncertainty_score":0.21407008},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936836,0.0013250981,0.00396449,0.0003729033,0.00037459983,0.000049537866,0.0000012084898,0.0000012669583,0.00022732011],"genre_scores_gemma":[0.9868603,0.000049743856,0.011867755,0.00020295272,0.0009839057,4.798982e-7,1.7243867e-7,0.0000032566907,0.00003147104],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99936026,0.00003988179,0.00020036245,0.00014434921,0.0001364995,0.000118656164],"domain_scores_gemma":[0.99958295,0.000008419608,0.00009970692,0.00008534376,0.00011263201,0.00011093575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046471454,0.00007576636,0.0001445002,0.000058374993,0.00011687726,0.000060773735,0.00015880412,0.000030226882,7.0318146e-7],"category_scores_gemma":[0.0000048936095,0.00005235673,0.000042224692,0.00006587498,0.000047138194,0.0000031555892,0.00007087846,0.000027750171,0.000001411857],"study_design_candidate":"bench_or_experimental","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.00009333296,0.00008944968,0.010419839,0.000042117543,0.000090795394,0.000010761969,0.0015099224,0.0072136554,0.93687403,0.0005340036,0.0029670352,0.040155075],"study_design_scores_gemma":[0.0035336362,0.0217767,0.6296924,0.0006094395,0.00015984978,0.00432392,0.0072704176,0.029721979,0.11499983,0.00013786918,0.18615289,0.0016210732],"about_ca_topic_score_codex":0.0000034281265,"about_ca_topic_score_gemma":0.0000064084334,"teacher_disagreement_score":0.8218742,"about_ca_system_score_codex":0.00000674009,"about_ca_system_score_gemma":0.00003817943,"threshold_uncertainty_score":0.21350454},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010532242,0.00096035824,0.986019,0.0000611617,0.0011138691,0.00020525354,0.0000037954899,0.000034585242,0.0010697128],"genre_scores_gemma":[0.89157456,0.000004816297,0.10781025,0.000049329337,0.00054944435,0.0000023686118,0.0000012391781,0.000004223563,0.0000037941031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862486,0.00007535765,0.00043854307,0.00021636004,0.00032996142,0.0003148936],"domain_scores_gemma":[0.9988596,0.00013704594,0.0004426525,0.00015314035,0.00020526828,0.00020230548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014219505,0.00013950268,0.00032721684,0.0002108415,0.00029884692,0.0009741939,0.0006636079,0.000044607827,1.5875865e-7],"category_scores_gemma":[0.000003180339,0.00009019127,0.000063286185,0.00033581388,0.0000968751,0.0025302167,0.00012746756,0.00007537,4.9118046e-7],"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.000060823117,0.0004008752,0.017652493,0.0020213258,0.00021771995,0.000022721913,0.0060005896,0.71438885,0.0000051785246,0.23217985,0.004599152,0.022450428],"study_design_scores_gemma":[0.00040514884,0.00039761988,0.00018052907,0.00022008698,0.000012366427,0.0016239891,0.00072976766,0.99581623,0.000007716796,0.000044281966,0.0004078646,0.00015438462],"about_ca_topic_score_codex":0.0000048047696,"about_ca_topic_score_gemma":2.296382e-7,"teacher_disagreement_score":0.8810423,"about_ca_system_score_codex":0.000031533993,"about_ca_system_score_gemma":0.00007920766,"threshold_uncertainty_score":0.9394174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4212118,0.00023710729,0.57742935,0.00013710101,0.0007393745,0.00006017226,7.668239e-8,0.000028089147,0.00015689009],"genre_scores_gemma":[0.9672454,0.00006510193,0.032292128,0.000056614143,0.00033614223,0.000001061276,5.403232e-8,0.000002237323,0.0000012654343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831635,0.00024934908,0.0006940902,0.00021950698,0.00035162581,0.00016905552],"domain_scores_gemma":[0.99842805,0.00012843021,0.0009321092,0.00015216535,0.00030799946,0.000051232197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002540289,0.00010952387,0.0003321731,0.00015947712,0.00038269514,0.00016581654,0.00037864762,0.00009570972,3.205712e-7],"category_scores_gemma":[0.00001323028,0.00008109398,0.00003631325,0.0006441105,0.000110342495,0.001025975,0.00015603148,0.0001465958,6.4032724e-7],"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.00015053854,0.000050892497,0.004672359,0.002720781,0.000047865487,0.000005224826,0.0025352389,0.025223665,0.007957514,0.21954632,0.000052468095,0.7370371],"study_design_scores_gemma":[0.00041880427,0.00090605003,0.0049264757,0.0005287352,0.000009950901,0.0006674829,0.0002869886,0.9892665,0.001983477,0.00067741814,0.00020388035,0.00012419319],"about_ca_topic_score_codex":0.000046429563,"about_ca_topic_score_gemma":0.000016670643,"teacher_disagreement_score":0.9640429,"about_ca_system_score_codex":0.000030972406,"about_ca_system_score_gemma":0.000036771962,"threshold_uncertainty_score":0.33069167},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39870718,0.00082390447,0.59466165,0.0031240694,0.0019283111,0.000073813346,0.0000012160066,0.00007336736,0.00060650543],"genre_scores_gemma":[0.8208042,0.00000891589,0.17756444,0.00026137635,0.0013461763,3.0223208e-7,6.357315e-8,0.0000038377134,0.000010711198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789846,0.00018579724,0.0006450201,0.00030663557,0.0006194355,0.00034467023],"domain_scores_gemma":[0.9987722,0.00018926708,0.00046354003,0.0002178156,0.00014398135,0.00021319764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016809625,0.0001822158,0.00042096,0.00028767769,0.0004488853,0.0005830972,0.0013492113,0.00005137649,0.0000016666705],"category_scores_gemma":[0.000009937451,0.00012339973,0.0001438152,0.000386069,0.0002770592,0.00066164514,0.000315333,0.00023828637,0.000007281775],"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.00006252894,0.00026350844,0.0041507883,0.00019931118,0.000121425954,0.00024500495,0.0050475327,0.029163491,0.0003071801,0.0859139,0.024998039,0.8495273],"study_design_scores_gemma":[0.00042644577,0.00059509114,0.008733502,0.00018581495,0.0000068444297,0.0026464635,0.000070855385,0.98113745,0.00007778051,0.00029687697,0.0056267874,0.00019611153],"about_ca_topic_score_codex":0.000019371897,"about_ca_topic_score_gemma":0.0000046734745,"teacher_disagreement_score":0.9519739,"about_ca_system_score_codex":0.00004093014,"about_ca_system_score_gemma":0.00016978069,"threshold_uncertainty_score":0.56228197},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9024916,0.0012421035,0.09588226,0.00008924164,0.00015176898,0.000023942916,4.211545e-7,0.0000028227387,0.00011580701],"genre_scores_gemma":[0.9968939,0.000020065136,0.0027868904,0.00003931174,0.00025389975,1.5910902e-7,2.1350712e-7,9.308615e-7,0.0000046235527],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.999561,0.000041241674,0.00015358232,0.000092484865,0.00008352035,0.00006818451],"domain_scores_gemma":[0.9997738,0.000012841877,0.00010389119,0.00003196101,0.00003806602,0.000039432452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053495634,0.000044086428,0.000081940925,0.000028044105,0.00010750359,0.00005206809,0.00007023502,0.00003208646,2.6819876e-7],"category_scores_gemma":[0.00001215105,0.000027426368,0.000026795033,0.00004794579,0.00007507271,0.0000066942207,0.000043645425,0.000034399032,2.467869e-7],"study_design_candidate":"bench_or_experimental","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.0001354371,0.00013927951,0.022758858,0.00027873303,0.00011082022,0.000064553285,0.0013947234,0.0033572237,0.7363351,0.005405595,0.0001082657,0.22991142],"study_design_scores_gemma":[0.013367642,0.037666593,0.475516,0.0024532988,0.0002802156,0.018225193,0.024515385,0.060978442,0.34761897,0.0053764037,0.011041447,0.002960406],"about_ca_topic_score_codex":0.0000080674845,"about_ca_topic_score_gemma":0.000004360679,"teacher_disagreement_score":0.45275715,"about_ca_system_score_codex":0.000005113671,"about_ca_system_score_gemma":0.00001918354,"threshold_uncertainty_score":0.111841485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2812831,0.0033410764,0.7086527,0.0006639359,0.0020637673,0.0001619774,0.000002326057,0.000041102772,0.0037900421],"genre_scores_gemma":[0.8867603,0.00007681348,0.113038726,0.000029063827,0.00008612761,4.010978e-7,2.6833561e-8,0.0000017060488,0.0000068697814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985103,0.00017199115,0.0005348865,0.00017265641,0.0004251914,0.00018499079],"domain_scores_gemma":[0.99880207,0.00022015009,0.00046626554,0.0001905055,0.00021228341,0.00010870459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016242553,0.00010716954,0.00028353053,0.00016061234,0.00048755918,0.00020870131,0.0010675319,0.000029462753,0.0000015575848],"category_scores_gemma":[0.000006525381,0.000058733694,0.00007442314,0.00043229465,0.0013190489,0.00046234546,0.0002780269,0.00011181166,4.8525965e-7],"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.0000149646685,0.00004706591,0.0030902766,0.000053272048,0.00004627033,0.000019212168,0.0023431133,0.0000025642319,0.000039253915,0.94407,0.0002256827,0.05004833],"study_design_scores_gemma":[0.0016186725,0.0030275383,0.1506758,0.0007894281,0.000054276028,0.0040909075,0.0017874015,0.57055485,0.0014597442,0.26277572,0.0025911229,0.00057451194],"about_ca_topic_score_codex":0.000025656784,"about_ca_topic_score_gemma":0.000005397894,"teacher_disagreement_score":0.68129426,"about_ca_system_score_codex":0.000008483938,"about_ca_system_score_gemma":0.000065517364,"threshold_uncertainty_score":0.48600906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36172464,0.0008736497,0.6305808,0.0017722428,0.0014500851,0.00009708885,9.809255e-7,0.0000745285,0.003425971],"genre_scores_gemma":[0.8562546,0.000028046237,0.1429849,0.00012164267,0.00044561984,2.765934e-7,3.3309902e-8,0.0000038396006,0.0001610544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982874,0.0001650704,0.0004387543,0.00027916956,0.00053326937,0.00029633628],"domain_scores_gemma":[0.998999,0.00024326758,0.00028652983,0.00020747755,0.00008041117,0.00018332365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013621096,0.00015184013,0.00034156063,0.00020018639,0.00036032347,0.00054826925,0.0010353654,0.00004120739,0.0000074470418],"category_scores_gemma":[0.000009255071,0.00010393889,0.00010374064,0.00047436875,0.00014179738,0.0004417524,0.00013557568,0.00016099098,0.00001224275],"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.000036758487,0.00016223296,0.0016237115,0.0003533705,0.000103863866,0.00097224803,0.0066935667,0.07395825,0.00033321668,0.09073325,0.0069672815,0.81806225],"study_design_scores_gemma":[0.00039627615,0.0009116124,0.0014505221,0.00046981536,0.000011890669,0.00394037,0.00011207024,0.98495257,0.00009875183,0.0012009775,0.006220679,0.00023446471],"about_ca_topic_score_codex":0.00000816932,"about_ca_topic_score_gemma":3.5982444e-7,"teacher_disagreement_score":0.9109943,"about_ca_system_score_codex":0.000021100679,"about_ca_system_score_gemma":0.00012217404,"threshold_uncertainty_score":0.5286973},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027243616,0.0019833478,0.96611315,0.0004455843,0.0012752257,0.000112799775,0.0000018935261,0.000034892477,0.0027894885],"genre_scores_gemma":[0.80980545,0.000014866125,0.18926653,0.00007156265,0.0007830824,0.000002322815,2.7313314e-7,0.000002991485,0.00005289472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857026,0.00007325298,0.00052613794,0.00024540868,0.0003371681,0.0002477844],"domain_scores_gemma":[0.9985991,0.00043018826,0.00040597795,0.00015075908,0.0003266857,0.00008725604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016388012,0.000120350254,0.00029335576,0.00017694246,0.00046725402,0.00045284233,0.00064350717,0.00002739183,7.8840105e-7],"category_scores_gemma":[0.000034020606,0.00008005489,0.00010248789,0.0003046863,0.00011949342,0.00077791495,0.00017470407,0.00006968854,0.0000016242766],"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.000023593653,0.00022400044,0.031523813,0.0006921304,0.000064724896,0.00013424225,0.0012494978,0.0034041242,0.00013496497,0.9153719,0.01914496,0.028032042],"study_design_scores_gemma":[0.0018529161,0.001299884,0.017910143,0.001604284,0.000050228635,0.004169815,0.00091249205,0.9326092,0.0002989516,0.004583624,0.034061436,0.0006470096],"about_ca_topic_score_codex":0.00004176323,"about_ca_topic_score_gemma":0.000032910666,"teacher_disagreement_score":0.9292051,"about_ca_system_score_codex":0.00003086963,"about_ca_system_score_gemma":0.0001387009,"threshold_uncertainty_score":0.4366769},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45611462,0.00048073038,0.54141206,0.0010042143,0.00078877126,0.000043888595,3.217702e-7,0.000038412065,0.00011701151],"genre_scores_gemma":[0.8018856,0.0000025805841,0.19770883,0.000121917525,0.000274609,3.0310704e-7,4.8424415e-8,0.0000036162517,0.000002479807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981972,0.00006966474,0.0004219416,0.00027143167,0.0007599254,0.00027985277],"domain_scores_gemma":[0.9990494,0.00010549164,0.0003566728,0.00015548365,0.00018134275,0.00015155945],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001031647,0.00014818492,0.00032534418,0.0002297934,0.00076761766,0.0011506311,0.0007438137,0.00003569265,5.3496547e-7],"category_scores_gemma":[0.0000057889756,0.00009378856,0.000070688766,0.0003997592,0.00037962542,0.00056655786,0.00018052344,0.00019877676,0.0000020810985],"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.000060260354,0.0002425577,0.0013141407,0.00024964704,0.00018810858,0.0006044081,0.00853633,0.31498924,0.00046082193,0.56367916,0.00028818264,0.10938716],"study_design_scores_gemma":[0.0018014099,0.0033188085,0.009131154,0.0020579211,0.000026481108,0.009868058,0.00035420663,0.958191,0.00035399286,0.013474559,0.0009020501,0.0005204056],"about_ca_topic_score_codex":0.000024106692,"about_ca_topic_score_gemma":0.00000285374,"teacher_disagreement_score":0.6432017,"about_ca_system_score_codex":0.000035455465,"about_ca_system_score_gemma":0.00043322993,"threshold_uncertainty_score":0.9998863},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085154526,0.00090575236,0.9106991,0.00018724467,0.0009968738,0.00017962986,4.19594e-7,0.000024148942,0.0018522486],"genre_scores_gemma":[0.9862736,0.000013486786,0.013387741,0.000022954418,0.00023368163,0.0000012229904,5.0831247e-8,0.0000028341124,0.00006442911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834037,0.00009725376,0.0006577148,0.00019717774,0.00050874474,0.00019875032],"domain_scores_gemma":[0.9986988,0.00012883145,0.0006003052,0.0001936196,0.00026319086,0.000115275965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009418376,0.00011441672,0.00036316653,0.00024796178,0.00019195992,0.00024889284,0.00075208256,0.000045867266,0.0000031739792],"category_scores_gemma":[0.000011037394,0.00007604413,0.00009386098,0.000502993,0.00014376285,0.0007239769,0.0001145081,0.00008704679,0.00000495067],"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.000025641915,0.0009653826,0.04388494,0.001073946,0.00032627146,0.00023238966,0.019477993,0.02752621,0.0023928233,0.58409965,0.0033375062,0.31665722],"study_design_scores_gemma":[0.00057258573,0.0009999617,0.0034336315,0.000095084506,0.000015306585,0.00058730406,0.00017941867,0.9900887,0.00045803198,0.0017339033,0.0016555,0.0001805773],"about_ca_topic_score_codex":0.000015821799,"about_ca_topic_score_gemma":0.000001943295,"teacher_disagreement_score":0.9625625,"about_ca_system_score_codex":0.000019760137,"about_ca_system_score_gemma":0.000049594237,"threshold_uncertainty_score":0.31009898},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052677937,0.0009646508,0.94452405,0.0007831325,0.0006196596,0.000109586625,0.0000028767874,0.000025026731,0.00029307557],"genre_scores_gemma":[0.6350778,0.000029912804,0.3645851,0.000085112544,0.0002172182,0.000001842788,1.1181932e-7,0.0000013070232,0.0000016029894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885815,0.000057215988,0.0004476683,0.0001679302,0.00027992815,0.00018907654],"domain_scores_gemma":[0.9990832,0.00015553672,0.0003233559,0.00010910889,0.00023156957,0.00009720091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011664364,0.00008816151,0.00022626201,0.00033054475,0.00051088224,0.00045294943,0.0004801702,0.000028549404,0.0000017270861],"category_scores_gemma":[0.0000068692893,0.00006374201,0.00016169238,0.00047912967,0.0001708596,0.0007156816,0.00006326197,0.00007336363,4.1571073e-7],"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.0000035034084,0.000031567815,0.002268623,0.00003417031,0.000115869414,0.0000031854527,0.0011950808,0.0005020923,0.00003473495,0.9547452,0.0005803599,0.040485665],"study_design_scores_gemma":[0.0033436436,0.0027305586,0.020029765,0.00038164164,0.00047271053,0.007891953,0.0050914395,0.8979904,0.00024089402,0.023147494,0.037766755,0.0009127649],"about_ca_topic_score_codex":0.000003833012,"about_ca_topic_score_gemma":0.000005780351,"teacher_disagreement_score":0.93159765,"about_ca_system_score_codex":0.000013392672,"about_ca_system_score_gemma":0.00008221048,"threshold_uncertainty_score":0.43678018},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16795452,0.00051563745,0.8295783,0.00013947343,0.0015223233,0.00008392923,7.079812e-7,0.000029320749,0.0001757865],"genre_scores_gemma":[0.8800819,0.000007885804,0.119531766,0.00004936165,0.00031407442,4.3093047e-7,1.6437471e-7,0.0000027031172,0.000011695093],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799585,0.00012088491,0.000758672,0.00023245119,0.00061207736,0.0002800591],"domain_scores_gemma":[0.9986509,0.00015698871,0.0006342493,0.0001476158,0.00022615229,0.00018410591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004471496,0.00012714963,0.00028060962,0.00025233562,0.0003041989,0.00038941554,0.0006605295,0.000049156202,9.3539626e-7],"category_scores_gemma":[0.000021216767,0.00008651771,0.000094924704,0.00043224,0.00006599394,0.0007277942,0.00013717246,0.000105019004,0.0000052343876],"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.00013673391,0.0014079586,0.3459785,0.0018224161,0.00068038295,0.0016573438,0.027194457,0.024625951,0.01928697,0.24141376,0.008229183,0.32756636],"study_design_scores_gemma":[0.0015570106,0.0005270438,0.11549817,0.000947298,0.000020931766,0.0017687421,0.0011356997,0.8740187,0.001441666,0.000067102075,0.002625583,0.00039199507],"about_ca_topic_score_codex":0.000018493578,"about_ca_topic_score_gemma":0.0000053182744,"teacher_disagreement_score":0.84939283,"about_ca_system_score_codex":0.000057897527,"about_ca_system_score_gemma":0.00006679457,"threshold_uncertainty_score":0.3755143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09569865,0.00090817816,0.90015864,0.0012264712,0.001404846,0.00008815045,9.948831e-7,0.00003203072,0.00048204127],"genre_scores_gemma":[0.7674095,0.000023337881,0.2317271,0.00035917212,0.00044316016,0.0000012855065,8.467366e-8,0.0000028735035,0.000033508826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985188,0.00007769203,0.00043187218,0.00022411265,0.0005420408,0.00020543256],"domain_scores_gemma":[0.9990026,0.00010008405,0.00031886116,0.00019623099,0.00022265315,0.00015958882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079119904,0.00011012137,0.0002476218,0.00018251486,0.00027957628,0.00093149557,0.0010245158,0.000035029872,0.000009661148],"category_scores_gemma":[0.000004959203,0.00006785585,0.000073986055,0.00030479627,0.00007449319,0.0017938477,0.00028640512,0.00010787008,0.000020794818],"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.000013919542,0.00022715978,0.028018419,0.0005069509,0.00013722744,0.00018049031,0.008966522,0.0018742763,0.0013741041,0.066649444,0.22375678,0.6682947],"study_design_scores_gemma":[0.00058198447,0.0007679893,0.013376248,0.000698387,0.000010295291,0.0019913942,0.0005296115,0.96913826,0.0002952874,0.001910945,0.010384308,0.0003152737],"about_ca_topic_score_codex":0.000029987776,"about_ca_topic_score_gemma":2.2989484e-7,"teacher_disagreement_score":0.967264,"about_ca_system_score_codex":0.00001741969,"about_ca_system_score_gemma":0.00007301265,"threshold_uncertainty_score":0.8982433},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921815,0.0011981787,0.0020963848,0.000019798848,0.00018588048,0.00003754378,0.0000011539909,0.000018256544,0.0042613284],"genre_scores_gemma":[0.9995157,0.000039565995,0.0003026207,0.0000076218885,0.00010345795,6.179637e-7,3.0064147e-8,0.0000026859288,0.00002767401],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994705,0.00004843578,0.00017263924,0.00005980188,0.00015393068,0.00009470501],"domain_scores_gemma":[0.9997415,0.000075600765,0.000056478442,0.000030082405,0.000029542867,0.00006677516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003964392,0.000064050706,0.0001642675,0.00006176896,0.00012433153,0.00009123277,0.000085948144,0.000020333777,0.0000053443678],"category_scores_gemma":[8.7330335e-7,0.00003761404,0.000019989226,0.000108798384,0.00007454914,0.00020876067,0.0000052372934,0.000055657347,0.00000102372],"study_design_candidate":"observational","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.00016826372,0.00026444453,0.24909768,0.003023807,0.0016715407,0.0007408786,0.09765932,0.14150354,0.0117590595,0.06489587,0.008564355,0.42065123],"study_design_scores_gemma":[0.009125432,0.0075056655,0.46530902,0.020735323,0.0004032358,0.024387512,0.037866425,0.4035423,0.0048941905,0.006014233,0.017068848,0.0031477897],"about_ca_topic_score_codex":0.0000011982021,"about_ca_topic_score_gemma":6.2404814e-7,"teacher_disagreement_score":0.41750345,"about_ca_system_score_codex":0.000007228685,"about_ca_system_score_gemma":0.000009562734,"threshold_uncertainty_score":0.15338561},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009122763,0.00020887703,0.98892325,0.00020243308,0.0013738167,0.000087148466,0.0000047142544,0.00002994027,0.000047041034],"genre_scores_gemma":[0.7860212,0.0000029026269,0.21331804,0.00020808376,0.00043076026,5.121139e-7,0.0000012728415,0.0000033582812,0.000013883577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869835,0.00010827894,0.00039046674,0.00018347532,0.0004437544,0.0001756939],"domain_scores_gemma":[0.99898165,0.00011636981,0.00033813543,0.0001375585,0.00025325944,0.00017304101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011647022,0.00010872659,0.00026650156,0.00016341095,0.00014913404,0.0009228908,0.00070683786,0.000043912132,3.3141868e-7],"category_scores_gemma":[0.000013474455,0.000071355076,0.000075768345,0.00033982072,0.00006945391,0.0010148896,0.00006833996,0.00006622829,2.2370021e-7],"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.00017302291,0.00042561832,0.010187874,0.0008502166,0.0004048537,0.00014591122,0.0043304493,0.32755452,0.0002815343,0.5968661,0.03713707,0.021642864],"study_design_scores_gemma":[0.00082177256,0.00039279982,0.00019117001,0.00006977275,0.000017040433,0.00012713914,0.00010763101,0.9964255,0.000046311266,0.00031531122,0.0013816812,0.00010389063],"about_ca_topic_score_codex":0.000001624181,"about_ca_topic_score_gemma":0.0000018175,"teacher_disagreement_score":0.77689844,"about_ca_system_score_codex":0.000033475622,"about_ca_system_score_gemma":0.00032833745,"threshold_uncertainty_score":0.8899457},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8005322,0.0017596682,0.042555284,0.01299735,0.065694906,0.00027697225,0.0000029665082,0.00007708065,0.07610355],"genre_scores_gemma":[0.9839776,0.000043898755,0.0018197291,0.00008930128,0.014035732,2.499056e-7,2.5507067e-8,0.000001865106,0.0000315906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887,0.00008306314,0.00022786437,0.00008784958,0.000566451,0.00016477382],"domain_scores_gemma":[0.99938333,0.000100839046,0.00021811355,0.000040722072,0.00014009616,0.00011689698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023448355,0.000055396027,0.00015047808,0.00008940205,0.000717298,0.00032050992,0.00030468398,0.000046826186,0.0000021860706],"category_scores_gemma":[0.000018829844,0.000037983842,0.000053971737,0.00015067955,0.00043755345,0.00041935634,0.000029090676,0.00011672518,0.0000031142604],"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.000011967811,0.00008448305,0.0023670695,0.000058225713,0.000033358636,0.00007095055,0.028054731,0.00024353877,0.000071771654,0.9540772,0.0071143936,0.007812314],"study_design_scores_gemma":[0.0031297419,0.0034403522,0.015945388,0.0029156911,0.00009328436,0.001053331,0.050167494,0.00093406736,0.00038414352,0.09647354,0.8243841,0.0010788932],"about_ca_topic_score_codex":0.00016451896,"about_ca_topic_score_gemma":0.000071376046,"teacher_disagreement_score":0.85760367,"about_ca_system_score_codex":0.000051430437,"about_ca_system_score_gemma":0.00029727817,"threshold_uncertainty_score":0.55169487},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104095146,0.00070440065,0.87582684,0.00018946422,0.0034290464,0.0002723559,0.0000014267035,0.00003676654,0.015444538],"genre_scores_gemma":[0.9844125,0.000050134357,0.01209539,0.00007132841,0.003339547,0.0000026929592,1.1334095e-7,0.0000013152646,0.000026957843],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884,0.000035451667,0.0004969981,0.00010606806,0.000372564,0.00014895995],"domain_scores_gemma":[0.9991871,0.00010343309,0.0003265549,0.00010989001,0.00015092077,0.00012210116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018427011,0.000075057644,0.00017581803,0.0002330384,0.00021432983,0.0006055385,0.00042152838,0.000034047927,0.0000012621663],"category_scores_gemma":[0.0000030379608,0.00005249453,0.000030085654,0.00031115484,0.00008551611,0.0013855406,0.000095299336,0.000068618916,0.000008477314],"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.000016210624,0.00007266458,0.0061517,0.00034335555,0.000044546174,0.000036995054,0.007475325,0.0018101312,0.00017265447,0.31345624,0.047103047,0.6233171],"study_design_scores_gemma":[0.0007310403,0.0009169365,0.009121619,0.0002735594,0.000015484879,0.0031125192,0.002304695,0.2169337,0.000088714136,0.00018790828,0.7660273,0.00028654226],"about_ca_topic_score_codex":0.000006978337,"about_ca_topic_score_gemma":9.80148e-7,"teacher_disagreement_score":0.8803174,"about_ca_system_score_codex":0.000019848956,"about_ca_system_score_gemma":0.000072011855,"threshold_uncertainty_score":0.58392215},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015953327,0.00012597207,0.9814995,0.00092068757,0.0010717635,0.00018712842,0.0000019516176,0.000028915352,0.00021073288],"genre_scores_gemma":[0.7777815,0.0000066391963,0.22150224,0.00020584169,0.00047113214,0.0000013606804,2.427779e-7,0.0000039627876,0.000027075306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982387,0.00009003166,0.0006096527,0.00031577842,0.00038141565,0.00036445187],"domain_scores_gemma":[0.9988907,0.00035736227,0.00030268094,0.00017863451,0.00011566881,0.00015497221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024803919,0.00014054365,0.0003505859,0.0003477883,0.00020311339,0.0005305294,0.0013190674,0.000030127769,0.0000011345784],"category_scores_gemma":[0.00001554292,0.000083106286,0.000077307646,0.00047716324,0.00008167244,0.00087448925,0.000396567,0.00006228808,0.000002420075],"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.000021169639,0.00010053595,0.022500504,0.00008736339,0.00004511813,0.00010592643,0.0010296564,0.025351519,0.0001397433,0.03154997,0.007303248,0.9117652],"study_design_scores_gemma":[0.00058731297,0.00046384666,0.013975372,0.00041575934,0.000004252292,0.00018177286,0.00011652299,0.97741884,0.000007097327,0.00031505822,0.006343533,0.00017063599],"about_ca_topic_score_codex":0.0000049650566,"about_ca_topic_score_gemma":0.0000025920574,"teacher_disagreement_score":0.9520673,"about_ca_system_score_codex":0.00003536621,"about_ca_system_score_gemma":0.000041494204,"threshold_uncertainty_score":0.5115907},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5456369,0.00046459376,0.4467285,0.0057049794,0.001127551,0.000061354134,0.000012027243,0.000110502144,0.00015359822],"genre_scores_gemma":[0.83298117,0.000060922157,0.16672878,0.00005473479,0.00015250253,0.0000012006406,3.2758757e-7,0.0000027956432,0.000017550417],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983562,0.00012900562,0.00042188435,0.00028221324,0.0005738615,0.00023678796],"domain_scores_gemma":[0.9980865,0.00044632397,0.0005711191,0.0006730495,0.00013449982,0.000088497494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018556819,0.00011392452,0.0002552247,0.00019544152,0.00025477255,0.0004078779,0.0030695836,0.000055251443,0.0000023207947],"category_scores_gemma":[0.0007731913,0.000069013804,0.00003984397,0.00032382333,0.00011804033,0.0019354904,0.005782526,0.00008193621,0.0000018259566],"study_design_candidate":"observational","study_design_consensus":"observational","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.00006463358,0.00022571557,0.37652156,0.0003608057,0.00034394485,0.0005107357,0.0009032179,0.000032574844,0.0076743844,0.05127522,0.35287854,0.20920867],"study_design_scores_gemma":[0.0063818507,0.003915357,0.7254722,0.0067545357,0.00014862319,0.010016317,0.0011550375,0.17825489,0.0066394056,0.046991147,0.01247345,0.0017971762],"about_ca_topic_score_codex":0.000008804918,"about_ca_topic_score_gemma":0.000004235285,"teacher_disagreement_score":0.34895065,"about_ca_system_score_codex":0.000093816045,"about_ca_system_score_gemma":0.00008841319,"threshold_uncertainty_score":0.7207505},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028615214,0.00021135289,0.99172586,0.0032510145,0.0009953337,0.00006117778,3.05527e-7,0.000023886969,0.000869567],"genre_scores_gemma":[0.71928483,0.00013113848,0.27974215,0.0001711753,0.0005628288,0.0000013837919,3.4368075e-8,0.0000027978322,0.00010361643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870133,0.00014337385,0.00036253114,0.00014233698,0.0004857777,0.00016464721],"domain_scores_gemma":[0.9990551,0.00018839599,0.00025026925,0.00016375503,0.00022681417,0.00011568787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017795789,0.00006620051,0.00015615547,0.00012664055,0.00022260702,0.00036631824,0.00086336007,0.000024590385,0.0000021313328],"category_scores_gemma":[0.000021065413,0.000033700282,0.000041196534,0.0003753663,0.00008475893,0.0017137894,0.00019187825,0.000039753275,0.0000049595583],"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.000021583846,0.00006516669,0.0034227483,0.00006430718,0.000040942024,0.000058313824,0.0017905044,0.05120998,0.00019933756,0.6956526,0.052984655,0.19448988],"study_design_scores_gemma":[0.0024120274,0.0021301957,0.0028383443,0.0014642936,0.000010279759,0.0010190323,0.00030096807,0.9470037,0.00023930051,0.027904307,0.014264445,0.00041310964],"about_ca_topic_score_codex":0.0000010029679,"about_ca_topic_score_gemma":7.975273e-7,"teacher_disagreement_score":0.89579374,"about_ca_system_score_codex":0.000020983056,"about_ca_system_score_gemma":0.000098588185,"threshold_uncertainty_score":0.35324153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56621623,0.00009056551,0.4298124,0.0012508559,0.0012517415,0.0000883887,0.000005893329,0.000031558877,0.0012523636],"genre_scores_gemma":[0.95549667,0.000013909243,0.044276696,0.00007450137,0.00011844899,5.063796e-7,1.4154533e-7,0.0000023178743,0.000016824326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985249,0.00012461461,0.0004947471,0.00019472648,0.00049547036,0.00016556117],"domain_scores_gemma":[0.99861413,0.00009829115,0.0005539559,0.00045704516,0.00017098642,0.00010559773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014100702,0.0001089137,0.00032939235,0.00017224572,0.0006730247,0.0008691046,0.0019698667,0.00002483033,0.0000016759531],"category_scores_gemma":[0.000019959714,0.000071703114,0.000079167985,0.000107597945,0.00049683574,0.0011357947,0.00034511698,0.0000950827,0.0000033956496],"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.000027975288,0.0002681141,0.005707498,0.00020372531,0.000110093875,0.00012491591,0.0038452041,0.013176752,0.002003248,0.8727572,0.0014612277,0.10031407],"study_design_scores_gemma":[0.0005935324,0.0009060766,0.05706188,0.00054048735,0.000008494363,0.00044649644,0.00012237285,0.9347558,0.00082480646,0.0043078773,0.00026420655,0.00016795547],"about_ca_topic_score_codex":0.000031801028,"about_ca_topic_score_gemma":0.000005598748,"teacher_disagreement_score":0.92157906,"about_ca_system_score_codex":0.000018689212,"about_ca_system_score_gemma":0.00011125249,"threshold_uncertainty_score":0.8380795},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70715594,0.00039196582,0.2865371,0.0006079371,0.00040854875,0.00019019011,8.8441556e-7,0.00001005684,0.004697391],"genre_scores_gemma":[0.9891963,0.00006063347,0.010633278,0.00001022307,0.000072405914,9.50053e-7,1.44378305e-8,0.0000014878087,0.000024680527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988589,0.00006413003,0.0004039901,0.000096352356,0.0004224545,0.00015417238],"domain_scores_gemma":[0.9982932,0.00009416333,0.0009082823,0.00020972526,0.00042820486,0.00006643139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015498294,0.000076218865,0.00021843838,0.00013508917,0.0006939574,0.0006160466,0.0012212413,0.000020949203,5.9671146e-7],"category_scores_gemma":[0.00002297898,0.000036532092,0.00006908065,0.00018906344,0.0003376438,0.0008208317,0.00015114176,0.00007981984,3.5215356e-7],"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.000111312926,0.0002760592,0.18269627,0.00083027786,0.00019683214,0.000012047473,0.009301863,0.22222705,0.0005215064,0.03313021,0.0025377935,0.54815876],"study_design_scores_gemma":[0.0003133672,0.0011343778,0.045515012,0.0005511237,0.000003329751,0.00011376065,0.0001978975,0.9516759,0.00018635251,0.00006714142,0.00017078538,0.000070946495],"about_ca_topic_score_codex":0.000029159266,"about_ca_topic_score_gemma":9.78071e-7,"teacher_disagreement_score":0.72944885,"about_ca_system_score_codex":0.000018280087,"about_ca_system_score_gemma":0.0003087009,"threshold_uncertainty_score":0.5940552},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9962513,0.0009910439,0.0016979583,0.000020339035,0.00048752228,0.000045286655,8.837156e-7,0.000003913769,0.00050175475],"genre_scores_gemma":[0.99921334,0.000038402643,0.0006709204,0.0000012871811,0.000073687814,4.2048367e-7,3.266647e-8,0.0000014357995,4.7629464e-7],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939376,0.000017015393,0.00029566468,0.00006069717,0.00014418723,0.00008867298],"domain_scores_gemma":[0.9996742,0.000044680528,0.00011003255,0.000074898504,0.000042456493,0.00005371303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076724193,0.000048510752,0.00019540345,0.000057247533,0.00008347426,0.00017595373,0.00014882768,0.000027149721,6.91704e-7],"category_scores_gemma":[0.00000975454,0.00003293834,0.00001894202,0.000031522337,0.00016202006,0.00046361025,0.00002337173,0.000054244203,1.5653893e-7],"study_design_candidate":"observational","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.00013130996,0.00017821381,0.8080877,0.0089597395,0.00016031992,0.000090917005,0.010259936,0.019651057,0.033058822,0.08019796,0.00011147566,0.03911256],"study_design_scores_gemma":[0.000428751,0.00025090837,0.3314918,0.0006265915,0.000011457693,0.00017778805,0.0017047694,0.66400826,0.0011170374,0.000026771126,0.000052088777,0.000103789724],"about_ca_topic_score_codex":0.000012181885,"about_ca_topic_score_gemma":0.0000026429732,"teacher_disagreement_score":0.6443572,"about_ca_system_score_codex":0.000012772457,"about_ca_system_score_gemma":0.000014408117,"threshold_uncertainty_score":0.16967258},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059279975,0.0003259999,0.9282411,0.00023318062,0.0026874517,0.00008804017,7.3111715e-7,0.000022167964,0.009121354],"genre_scores_gemma":[0.9893205,0.0000042216466,0.010274754,0.000014851125,0.00028986152,6.9311227e-7,6.039928e-8,0.0000019863783,0.00009306024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985246,0.00017825408,0.00047549393,0.00018181502,0.0004625431,0.00017727503],"domain_scores_gemma":[0.998345,0.000086812404,0.0008602782,0.0003440406,0.00025153797,0.000112299815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025983045,0.000103946804,0.00035020546,0.00014177029,0.00063695427,0.00065537926,0.0011713562,0.000040890896,0.0000022580077],"category_scores_gemma":[0.000026060761,0.00006551001,0.00012056969,0.00012845568,0.00049710274,0.0007613185,0.00027793212,0.000094179566,0.0000028588354],"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.000009639441,0.00004125603,0.0027345447,0.00007714739,0.000039693234,0.00002098749,0.0009538217,0.00005120057,0.000041163887,0.95178974,0.00021510766,0.044025697],"study_design_scores_gemma":[0.005181044,0.008912793,0.48669633,0.0008018626,0.00019267459,0.01322317,0.007219288,0.21713784,0.0012728466,0.25075853,0.007031973,0.0015716603],"about_ca_topic_score_codex":0.00005957538,"about_ca_topic_score_gemma":0.0000048826264,"teacher_disagreement_score":0.93004054,"about_ca_system_score_codex":0.000017768538,"about_ca_system_score_gemma":0.00015367055,"threshold_uncertainty_score":0.63198376},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39653355,0.0005692627,0.60025406,0.00029336513,0.0005933911,0.00008764683,0.000002482912,0.00001496602,0.0016512339],"genre_scores_gemma":[0.93451315,0.000027744058,0.06537969,0.000037913767,0.00003478919,5.062759e-7,8.175657e-8,9.04397e-7,0.000005193949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988902,0.00020559486,0.00031138852,0.00021229002,0.00023976126,0.00014071613],"domain_scores_gemma":[0.9993616,0.00021520675,0.00016866413,0.00013691728,0.00004762067,0.00007001448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029692815,0.000080946316,0.00022127057,0.00015937697,0.00011504681,0.00032416926,0.00032002848,0.000012679147,9.285943e-7],"category_scores_gemma":[0.000041427025,0.0000564064,0.000022865455,0.00024462893,0.0002657463,0.0014359963,0.00015005733,0.00007264857,3.383484e-7],"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.0000047741764,0.00007757384,0.076041326,0.00013671187,0.000016696924,0.00009976779,0.0008438704,0.000057812573,0.00003598019,0.83544683,0.00025292602,0.08698569],"study_design_scores_gemma":[0.0059113144,0.0035787486,0.46762583,0.0024444405,0.000063441665,0.009694968,0.012699105,0.4406237,0.001095691,0.02373954,0.030660843,0.0018623673],"about_ca_topic_score_codex":0.000030416748,"about_ca_topic_score_gemma":0.000015087422,"teacher_disagreement_score":0.8117073,"about_ca_system_score_codex":0.0000151343,"about_ca_system_score_gemma":0.000060926763,"threshold_uncertainty_score":0.31259716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047163367,0.00046218012,0.9509454,0.00020721278,0.0007180373,0.00020801212,0.0000012544774,0.000009878988,0.000284698],"genre_scores_gemma":[0.8706501,0.0003498883,0.1288955,0.000028448674,0.000065309534,0.0000017919832,3.851699e-7,0.0000021701212,0.000006362019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983822,0.00017336608,0.00077399035,0.00014102767,0.00040920408,0.0001201895],"domain_scores_gemma":[0.99809426,0.00014668144,0.0011787805,0.00019375114,0.00031048068,0.00007602725],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024301233,0.000110224995,0.00043207544,0.00049876346,0.00013828669,0.0011901804,0.0006247603,0.00007335092,5.693445e-7],"category_scores_gemma":[0.000056823046,0.000081459046,0.00005221016,0.00012021883,0.00014495198,0.0022770236,0.0005359569,0.00017304032,2.634119e-7],"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.000065530716,0.0000576098,0.009258707,0.001805982,0.000072723175,0.00002415497,0.014847084,0.8060312,0.000023456061,0.015475459,0.00023010012,0.152108],"study_design_scores_gemma":[0.0009298349,0.00011131116,0.0040095644,0.0011366737,0.0000052457804,0.0001297487,0.00009825202,0.9929591,0.000020788311,0.0004168036,0.00007807225,0.000104651364],"about_ca_topic_score_codex":0.000040207015,"about_ca_topic_score_gemma":0.0000037044929,"teacher_disagreement_score":0.82348675,"about_ca_system_score_codex":0.000028467808,"about_ca_system_score_gemma":0.000256991,"threshold_uncertainty_score":0.9998467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34328,0.00397986,0.6144635,0.03204465,0.0029771815,0.0007368732,0.0000035836342,0.00019639755,0.0023179278],"genre_scores_gemma":[0.95046335,0.0002047495,0.048892293,0.00009901013,0.00028473343,0.0000031066104,2.3886766e-8,0.0000031197233,0.000049609498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824023,0.00031339997,0.00044073287,0.00020943343,0.000548207,0.0002479953],"domain_scores_gemma":[0.99742097,0.0018253594,0.00029626954,0.000246446,0.00012049214,0.000090490976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00609504,0.00011328028,0.00025599665,0.0001162539,0.0011925173,0.000811191,0.0011356403,0.000026668358,3.4166553e-7],"category_scores_gemma":[0.00004613228,0.000049864946,0.00010453613,0.0006815149,0.0007745577,0.00044446034,0.00039883878,0.00015012901,0.0000024621859],"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.00003125995,0.00002141534,0.003281841,0.000113009104,0.00006475645,0.00002436047,0.0042728377,0.00063773885,0.000011198081,0.6631645,0.0019410715,0.32643598],"study_design_scores_gemma":[0.00084648427,0.0003567013,0.016825115,0.00020119635,0.000016560085,0.0007703126,0.0010604215,0.8880677,0.000039952363,0.088439986,0.0032009198,0.0001746459],"about_ca_topic_score_codex":0.000017954542,"about_ca_topic_score_gemma":0.000009032452,"teacher_disagreement_score":0.88742995,"about_ca_system_score_codex":0.000013333634,"about_ca_system_score_gemma":0.00007300213,"threshold_uncertainty_score":0.91719997},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11791286,0.0013990579,0.8768971,0.0011857433,0.00095048355,0.0001071315,0.0000017267201,0.000018239305,0.0015276442],"genre_scores_gemma":[0.92135197,0.000020056865,0.078492574,0.000022257394,0.0001004807,7.3299515e-7,3.852379e-8,0.0000018494196,0.000010062926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980801,0.00033643856,0.00048090212,0.00014625778,0.0007452578,0.00021105683],"domain_scores_gemma":[0.99828225,0.00044371808,0.00038668397,0.00022490494,0.00047044817,0.00019199608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003450248,0.000084199884,0.00023607959,0.0001586676,0.00038262154,0.0002613543,0.0014427514,0.000020935668,3.0095873e-7],"category_scores_gemma":[0.000028837296,0.00004654361,0.00007727106,0.00049174146,0.0010161591,0.0005836302,0.00026213654,0.00011895245,0.0000015503441],"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.00002869388,0.00006009045,0.0013223434,0.00003476277,0.000034943532,0.000027512217,0.0016514548,0.0008186145,0.00017022812,0.97779936,0.0011107154,0.016941274],"study_design_scores_gemma":[0.0021692365,0.004636428,0.010559042,0.0006729768,0.000026739946,0.0042602043,0.0050994037,0.6870642,0.0011045475,0.2806751,0.0032602383,0.0004719287],"about_ca_topic_score_codex":0.000004162877,"about_ca_topic_score_gemma":0.000001993612,"teacher_disagreement_score":0.8034391,"about_ca_system_score_codex":0.000027556503,"about_ca_system_score_gemma":0.00019690626,"threshold_uncertainty_score":0.37440804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.855877,0.0015160966,0.121479526,0.0048997933,0.0047577885,0.0001195778,0.0000012530187,0.00008565516,0.011263314],"genre_scores_gemma":[0.9577455,0.000077227734,0.041844122,0.000074392105,0.00015277311,3.5666892e-7,1.9765302e-8,0.0000022173165,0.00010339343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902123,0.0000785,0.00023793126,0.00019661647,0.00031297223,0.0001527243],"domain_scores_gemma":[0.9991405,0.0000757338,0.00037971913,0.0002075321,0.00008404686,0.000112469024],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011963364,0.00009715224,0.00022359665,0.00017232072,0.0009698199,0.0013488963,0.0008191709,0.00002676854,6.3641215e-7],"category_scores_gemma":[0.000020230093,0.00006178357,0.00004926163,0.000098824414,0.0002111269,0.0009734861,0.00016772124,0.00012375414,0.0000015188023],"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.000030554467,0.000076631484,0.06075755,0.00018831884,0.00008038931,0.00024375321,0.0019981058,0.0005447027,0.00010986469,0.33051616,0.0025441535,0.6029098],"study_design_scores_gemma":[0.0032005417,0.010454566,0.29278427,0.0030073393,0.00005966636,0.016083017,0.001082393,0.6141287,0.00062702777,0.042685952,0.014556474,0.0013300272],"about_ca_topic_score_codex":0.000016370615,"about_ca_topic_score_gemma":0.000001249745,"teacher_disagreement_score":0.613584,"about_ca_system_score_codex":0.0000046801188,"about_ca_system_score_gemma":0.000035413592,"threshold_uncertainty_score":0.9996878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071432814,0.0005440849,0.9232797,0.00006220134,0.0007068282,0.00004883662,1.8529721e-7,0.000024591869,0.003900758],"genre_scores_gemma":[0.79382473,0.000009858296,0.20601143,0.00003431453,0.0001056762,4.9332226e-7,7.884414e-9,0.0000018782008,0.000011609215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865067,0.0001543207,0.00035681567,0.00017109848,0.0004567784,0.00021029412],"domain_scores_gemma":[0.9991724,0.00012337124,0.00025490083,0.00015035001,0.00016865718,0.0001303084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017123794,0.00008300616,0.00020126159,0.00025022263,0.000258184,0.00021428365,0.0010605495,0.00002261655,0.0000030144467],"category_scores_gemma":[0.0000115052735,0.00005566722,0.000058835056,0.00041640495,0.00019865211,0.0010121316,0.00019582824,0.00011968951,0.0000043476566],"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.000010793413,0.00004313541,0.0024985564,0.0000462615,0.000026890108,0.00020186442,0.0036895766,0.00015404323,0.00030843032,0.9029696,0.0001290222,0.0899218],"study_design_scores_gemma":[0.003129162,0.009249443,0.036704678,0.001801994,0.000044210054,0.02691229,0.004686412,0.69670343,0.009539655,0.20778698,0.0018874625,0.0015542601],"about_ca_topic_score_codex":0.0000028539287,"about_ca_topic_score_gemma":2.45731e-7,"teacher_disagreement_score":0.7223919,"about_ca_system_score_codex":0.0000144863925,"about_ca_system_score_gemma":0.00007343997,"threshold_uncertainty_score":0.22700433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013006383,0.0007113419,0.9833501,0.0013148802,0.0006911392,0.00006624039,7.812031e-7,0.00009082595,0.0007682996],"genre_scores_gemma":[0.74464136,0.000024692685,0.2550017,0.0001076496,0.00017977954,3.9155898e-7,3.2935682e-7,0.0000030427989,0.000041057796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879146,0.00009863282,0.00031791735,0.00017567398,0.00048006148,0.00013623296],"domain_scores_gemma":[0.9993609,0.00013478819,0.00012385333,0.00006576518,0.0002119344,0.0001027481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008573769,0.00008120916,0.00016136818,0.00029430664,0.00013756931,0.0008718876,0.00039335052,0.000021966647,0.000001443264],"category_scores_gemma":[0.0000030568058,0.00004774241,0.00003318026,0.0007329469,0.000084802,0.0009677553,0.00006717504,0.00010660759,0.0000025555164],"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.000035119185,0.00025410895,0.0017753731,0.0011000439,0.00020909696,0.0007284115,0.0075467415,0.32707518,0.00008905474,0.30777526,0.008702342,0.34470928],"study_design_scores_gemma":[0.00019009228,0.00050359324,0.0006419533,0.00042749653,0.0000053195745,0.0011453123,0.00017047007,0.99563396,0.000006226688,0.0002043476,0.0009999246,0.00007127994],"about_ca_topic_score_codex":0.0000047151066,"about_ca_topic_score_gemma":0.000002014009,"teacher_disagreement_score":0.731635,"about_ca_system_score_codex":0.000022879552,"about_ca_system_score_gemma":0.00018207754,"threshold_uncertainty_score":0.8407632},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63737714,0.0014204147,0.35431567,0.0014672844,0.0013184908,0.000076316166,0.0000033657384,0.000033883032,0.003987455],"genre_scores_gemma":[0.9419882,0.000012472558,0.057743773,0.000036176323,0.00019966044,1.8601497e-7,3.4380324e-8,0.0000018571485,0.000017592483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987523,0.000095923235,0.0003943749,0.0001573234,0.0004497728,0.00015031414],"domain_scores_gemma":[0.9983131,0.00009658886,0.0007961553,0.0005736551,0.0001358763,0.000084600586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018755865,0.000089505455,0.00032064063,0.00012303433,0.0003937563,0.0005045019,0.0028481875,0.000029109302,0.0000016720502],"category_scores_gemma":[0.000032223747,0.000058695274,0.00008753087,0.00008602991,0.0005855166,0.00087008666,0.0005347389,0.00007065694,9.793595e-7],"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.000010539999,0.00006622849,0.0071812426,0.00019035765,0.000049998765,0.00011617702,0.001535062,0.000079613455,0.0008826244,0.9453676,0.0021400913,0.04238049],"study_design_scores_gemma":[0.0041362997,0.0032444794,0.42079672,0.0032999422,0.00007821489,0.0067120255,0.0037716306,0.42726204,0.010016031,0.11753094,0.002098136,0.0010535439],"about_ca_topic_score_codex":0.000028541954,"about_ca_topic_score_gemma":0.0000026792584,"teacher_disagreement_score":0.82783663,"about_ca_system_score_codex":0.00001038685,"about_ca_system_score_gemma":0.0000602367,"threshold_uncertainty_score":0.52926886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6491566,0.0017996703,0.3408548,0.0005988976,0.0046811816,0.0002818613,0.000052731626,0.00003938187,0.0025349364],"genre_scores_gemma":[0.9828287,0.000015162889,0.016948551,0.000014837022,0.00018457978,0.0000014899472,2.052468e-7,0.0000039451456,0.0000025700804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829507,0.0001757129,0.00064258167,0.00014325413,0.00059655425,0.00014679911],"domain_scores_gemma":[0.9992346,0.00015610969,0.00023498025,0.0001777437,0.00014018458,0.000056344354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011949369,0.00013224776,0.00046892907,0.0001356358,0.00021688268,0.000100491816,0.0007384264,0.00006443261,0.000020847063],"category_scores_gemma":[0.00001815611,0.00007785096,0.00022887399,0.00017568572,0.00057681603,0.000097692755,0.0003763207,0.00050937233,1.6436546e-7],"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.0000037512718,0.000018114217,0.004490465,0.0014560161,0.000075694166,0.000004709296,0.00079111557,0.9859391,0.00008058073,0.0045516617,0.00028965864,0.0022991518],"study_design_scores_gemma":[0.00012385707,0.000081337654,0.022172762,0.00066546554,0.00009095475,0.00019916188,0.0006655396,0.9710588,0.00016411167,0.004443464,0.0001631653,0.0001714115],"about_ca_topic_score_codex":0.00002250181,"about_ca_topic_score_gemma":0.0000033326653,"teacher_disagreement_score":0.3336721,"about_ca_system_score_codex":0.0000602569,"about_ca_system_score_gemma":0.00011099619,"threshold_uncertainty_score":0.31746697},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04578779,0.00017428712,0.95085067,0.0010131141,0.00064284087,0.000054203694,3.887372e-7,0.0000053335843,0.0014713638],"genre_scores_gemma":[0.98058224,0.00007854269,0.019148966,0.00008797963,0.000046298483,5.224846e-7,1.3834217e-7,0.0000014684321,0.00005383627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986717,0.00022524575,0.00041181027,0.00010916213,0.00048446885,0.000097599506],"domain_scores_gemma":[0.9989584,0.00016165688,0.00037066042,0.00013627754,0.00032641427,0.000046597932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012423263,0.000057079167,0.00017542248,0.000072212366,0.00012502792,0.00018427966,0.0004657627,0.00002154482,0.000006604384],"category_scores_gemma":[0.000011728837,0.00003249097,0.000057878104,0.0004672942,0.00010483416,0.0005954865,0.00009252533,0.00006906075,0.000001071292],"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.000030022089,0.00038309582,0.007243353,0.00032781865,0.00016835325,0.00007268302,0.009117038,0.31456435,0.00033757614,0.6113844,0.004822054,0.051549282],"study_design_scores_gemma":[0.0001693843,0.0001632442,0.0016583283,0.00027028352,0.0000036445044,0.00011229289,0.00029121607,0.99621063,0.00011855799,0.00078710483,0.00016972388,0.00004555521],"about_ca_topic_score_codex":0.0000016490432,"about_ca_topic_score_gemma":9.818017e-7,"teacher_disagreement_score":0.9347945,"about_ca_system_score_codex":0.000013409803,"about_ca_system_score_gemma":0.00011279822,"threshold_uncertainty_score":0.1777013},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.726906,0.0023879895,0.020503052,0.026997667,0.05180897,0.00030504196,0.0000034803822,0.00009193155,0.17099586],"genre_scores_gemma":[0.9685409,0.000039957573,0.0022110764,0.00011504369,0.028986437,2.3864447e-7,2.4017503e-8,0.000001834559,0.00010446994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988237,0.00012041026,0.00024903408,0.0000861083,0.00055350474,0.00016721697],"domain_scores_gemma":[0.9993228,0.00015627347,0.0002275014,0.000040701983,0.00013514793,0.00011758908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027891698,0.000055108227,0.00014978099,0.00009281863,0.0006757257,0.00031092367,0.0003071883,0.000045927532,0.0000062903905],"category_scores_gemma":[0.000018014303,0.00003771154,0.000053550968,0.00013164409,0.00036975872,0.0005150216,0.0000299092,0.00011566283,0.000005007398],"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.000025746182,0.00018033423,0.008933489,0.00009713863,0.00007336543,0.000064011256,0.06102923,0.00022224434,0.00014421836,0.719105,0.1005945,0.10953071],"study_design_scores_gemma":[0.00031829192,0.000382173,0.0027946094,0.00029205089,0.000016017088,0.00014937778,0.005753667,0.0019746828,0.00006002558,0.0016804478,0.98639363,0.0001850322],"about_ca_topic_score_codex":0.000057258338,"about_ca_topic_score_gemma":0.000060424045,"teacher_disagreement_score":0.8857991,"about_ca_system_score_codex":0.000039266964,"about_ca_system_score_gemma":0.00017037791,"threshold_uncertainty_score":0.5197204},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5703392,0.00021703707,0.42602122,0.00043784204,0.0020516792,0.000039936553,8.893608e-7,0.000018591301,0.0008736075],"genre_scores_gemma":[0.8891948,0.000013399744,0.11060181,0.000028481058,0.00015252894,2.441024e-7,5.6772667e-8,0.0000010924656,0.0000075875496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891126,0.000053633376,0.00040982573,0.00013428122,0.0003516383,0.00013937218],"domain_scores_gemma":[0.99895585,0.00026033877,0.00035455025,0.0001903789,0.00016968526,0.00006917874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012335328,0.000071561095,0.00023551768,0.00020947796,0.00014861305,0.00018191116,0.00080173986,0.000020286825,0.000002371997],"category_scores_gemma":[0.00003591954,0.000045752644,0.000058240388,0.00028203017,0.00022713788,0.0007506239,0.00015393668,0.00009569909,0.0000018813435],"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.000009277897,0.00016215787,0.071851045,0.00033011916,0.00008055596,0.00009200675,0.0019456701,0.00026387555,0.011602367,0.85621923,0.0027857763,0.05465794],"study_design_scores_gemma":[0.0016952839,0.0016328065,0.15704583,0.001097198,0.00008942309,0.009173659,0.0022421058,0.80816084,0.005039546,0.004772071,0.008385857,0.00066539744],"about_ca_topic_score_codex":0.00001587114,"about_ca_topic_score_gemma":0.000022031229,"teacher_disagreement_score":0.85144717,"about_ca_system_score_codex":0.0000043948676,"about_ca_system_score_gemma":0.0001826019,"threshold_uncertainty_score":0.18657386},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007836621,0.0012725795,0.98385185,0.0013224914,0.0019502023,0.000059212784,3.5303117e-7,0.000048573947,0.0036580886],"genre_scores_gemma":[0.9410422,0.00004786858,0.05840824,0.000096930045,0.0002950623,7.2235173e-7,7.426781e-8,0.0000021113308,0.00010680182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898106,0.00009287173,0.00032622408,0.00014896427,0.0003355229,0.00011538063],"domain_scores_gemma":[0.999515,0.00010297025,0.000095688745,0.00007249889,0.00012242625,0.00009144702],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001305048,0.00006164053,0.00012958291,0.0002334492,0.00012627123,0.0011451453,0.00039751525,0.000023882814,0.000003358061],"category_scores_gemma":[0.000005070954,0.000040096173,0.000047347574,0.00040339405,0.00005466744,0.0011133038,0.000047631398,0.00007551829,0.000011239966],"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.000009776324,0.000056448418,0.0005405587,0.000519039,0.000090310765,0.00025944904,0.006316246,0.010430472,0.0010171284,0.69313294,0.03657694,0.2510507],"study_design_scores_gemma":[0.000095982236,0.0002961019,0.0001600386,0.00023151281,0.0000028828515,0.0006918699,0.00009323334,0.99105746,0.00009497294,0.00050594844,0.0067024245,0.00006758339],"about_ca_topic_score_codex":0.0000010861089,"about_ca_topic_score_gemma":3.6529315e-7,"teacher_disagreement_score":0.980627,"about_ca_system_score_codex":0.000018536528,"about_ca_system_score_gemma":0.00016183138,"threshold_uncertainty_score":0.99989176},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06651697,0.000699066,0.92999965,0.0002595857,0.00054830796,0.00003752708,1.9993605e-7,0.000058546426,0.0018801228],"genre_scores_gemma":[0.7425905,0.000010138119,0.25711566,0.00004931552,0.00017861702,4.6432282e-7,5.3849863e-8,0.00000216978,0.000053087042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990328,0.000022772516,0.000318812,0.00012600544,0.00038397347,0.00011565068],"domain_scores_gemma":[0.9995004,0.00006347465,0.00015948825,0.00008261935,0.00013723827,0.000056772773],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008545658,0.00007618649,0.00014345528,0.00023297491,0.00017321944,0.0011034076,0.00048202716,0.000019061255,0.0000018743816],"category_scores_gemma":[0.0000032429257,0.00004749619,0.000030460324,0.00037287368,0.00012654359,0.0027214966,0.00007080763,0.00008125436,0.000007884743],"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.000009595671,0.000013175957,0.0004545411,0.00050775794,0.000060437887,0.00013800153,0.015746202,0.7973764,0.000071738126,0.14998545,0.000674513,0.03496217],"study_design_scores_gemma":[0.000079128,0.00014690851,0.00006693943,0.000768332,0.000003233507,0.0011528735,0.00038823043,0.99699116,0.000056242206,0.00009586261,0.00018135882,0.00006975588],"about_ca_topic_score_codex":0.000001176261,"about_ca_topic_score_gemma":1.4697223e-7,"teacher_disagreement_score":0.67607355,"about_ca_system_score_codex":0.00002730385,"about_ca_system_score_gemma":0.000098609074,"threshold_uncertainty_score":0.99993354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027654767,0.00012829731,0.9630796,0.007012205,0.001141902,0.0003019072,9.4075705e-7,0.000019600668,0.00066078466],"genre_scores_gemma":[0.9242814,0.000029774998,0.07448256,0.0008480705,0.00014344783,0.0000071557874,3.4737755e-7,0.0000026250277,0.00020461551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855584,0.00021923274,0.00036902097,0.00020391648,0.0004577679,0.00019425],"domain_scores_gemma":[0.9987436,0.00048797994,0.00016598507,0.00018156793,0.00034971518,0.000071144284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036967017,0.000088466426,0.00017348999,0.00021563264,0.00056572986,0.0008901543,0.0008241615,0.000031544056,0.0000017166153],"category_scores_gemma":[0.00002754278,0.000047648795,0.00008009421,0.00054314296,0.00012017772,0.0004775775,0.00012599988,0.00012979873,0.0000015138653],"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.00010815513,0.0002565669,0.0015516548,0.0002334689,0.00010636394,0.000004267179,0.002262562,0.0039913496,0.00066464976,0.88413936,0.013218341,0.093463235],"study_design_scores_gemma":[0.0004541178,0.00056779286,0.0012831134,0.00018202332,0.000005248567,0.000019018787,0.000080701844,0.9884664,0.000052858,0.0018277173,0.0069845896,0.0000764479],"about_ca_topic_score_codex":0.000005513192,"about_ca_topic_score_gemma":0.0000037105572,"teacher_disagreement_score":0.984475,"about_ca_system_score_codex":0.000045342524,"about_ca_system_score_gemma":0.0001877792,"threshold_uncertainty_score":0.8583778},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016954914,0.0006636924,0.9952673,0.00032967026,0.0016370043,0.00009051849,0.0000043507684,0.000023631012,0.00028836148],"genre_scores_gemma":[0.10631365,0.000024727558,0.89276046,0.00029823152,0.0005062213,0.0000019537115,6.719077e-7,0.000002576063,0.00009148267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883276,0.0000700173,0.0004021378,0.00022841542,0.00030169255,0.0001649846],"domain_scores_gemma":[0.99909973,0.0001492591,0.0002250258,0.00019660422,0.00023180107,0.00009757391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013034105,0.00009710176,0.0002499997,0.0002165015,0.0002823479,0.0005214343,0.0010172632,0.000036282407,0.0000011174102],"category_scores_gemma":[0.000005240833,0.00006290451,0.00006573928,0.00029940426,0.0000695068,0.0011242931,0.00015850802,0.0000666504,0.0000013780264],"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.000008742233,0.00006509259,0.00012839629,0.0000488872,0.00002353509,0.000013293936,0.0001811293,0.00085304934,0.00008690711,0.025661457,0.009203955,0.96372557],"study_design_scores_gemma":[0.0004142895,0.00057864026,0.00039219428,0.0001818328,0.000007807755,0.00013862763,0.000053324962,0.9880036,0.00012700878,0.0010770864,0.00894501,0.00008054063],"about_ca_topic_score_codex":0.0000041753556,"about_ca_topic_score_gemma":2.1401455e-7,"teacher_disagreement_score":0.9871506,"about_ca_system_score_codex":0.000018848887,"about_ca_system_score_gemma":0.00014649081,"threshold_uncertainty_score":0.5028203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34480506,0.00017608222,0.6537928,0.00021864475,0.0005328091,0.00006520158,8.28277e-7,0.000031619507,0.0003769813],"genre_scores_gemma":[0.8989145,0.000035882,0.10092496,0.00004106405,0.000060051072,0.0000016210792,2.9185912e-7,0.0000021645924,0.00001945676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866414,0.0001611757,0.00038553594,0.00019127326,0.00044466346,0.00015318916],"domain_scores_gemma":[0.9991348,0.00006309887,0.00024783047,0.00015366354,0.0002776674,0.00012294138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001122794,0.00008829121,0.0002381267,0.00030162887,0.00019451688,0.00031427213,0.00068626343,0.00001884781,7.466489e-7],"category_scores_gemma":[0.0000046663245,0.000055664204,0.000028001634,0.0006225176,0.00013322297,0.0022797543,0.0000882422,0.000071507035,2.0345068e-7],"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.00019978118,0.0014294523,0.041161448,0.001761519,0.00034860024,0.000165213,0.027054368,0.13839816,0.0037573737,0.45271435,0.0046881596,0.32832158],"study_design_scores_gemma":[0.00066219695,0.001906805,0.0038050015,0.00068111374,0.000008907299,0.00021010016,0.0014295127,0.98820835,0.002027018,0.0001247154,0.00079482084,0.0001414268],"about_ca_topic_score_codex":0.000012638406,"about_ca_topic_score_gemma":0.000002821901,"teacher_disagreement_score":0.84981024,"about_ca_system_score_codex":0.000015786254,"about_ca_system_score_gemma":0.00016172622,"threshold_uncertainty_score":0.30305335},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20943871,0.00015455062,0.78808993,0.001439699,0.00016376427,0.000112469286,3.1898742e-7,0.000002553687,0.00059800793],"genre_scores_gemma":[0.9820668,0.000010500748,0.017730877,0.00016464983,0.000012675663,7.9135344e-7,4.285712e-8,7.8576585e-7,0.000012877303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984925,0.00030053302,0.0005537703,0.00009111092,0.00046094297,0.00010118178],"domain_scores_gemma":[0.9990201,0.00022973277,0.00040430418,0.00013091319,0.0001947321,0.000020239735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004742281,0.00005101149,0.00018047635,0.00020965862,0.00012659386,0.00016563549,0.00073330273,0.000017120741,7.619235e-7],"category_scores_gemma":[0.000027364322,0.000025102425,0.000053116324,0.00063023856,0.00008268677,0.00038512697,0.0000950605,0.00008052753,1.2465462e-7],"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.000042193435,0.00023781855,0.007231602,0.00032276937,0.000059651033,0.0000057247626,0.059550267,0.7605505,0.00089186244,0.1368627,0.0025018426,0.031743065],"study_design_scores_gemma":[0.00028547528,0.000076581826,0.0015594788,0.00032844706,0.000003305704,0.00001154708,0.000846329,0.9954882,0.00007181819,0.001277514,0.000024240626,0.00002701619],"about_ca_topic_score_codex":0.000011755596,"about_ca_topic_score_gemma":0.000004497993,"teacher_disagreement_score":0.77262807,"about_ca_system_score_codex":0.000016812479,"about_ca_system_score_gemma":0.00015195526,"threshold_uncertainty_score":0.16435894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019382158,0.0019273706,0.98958904,0.0033287234,0.002048883,0.00019206459,0.0000034182979,0.00001897837,0.0009532944],"genre_scores_gemma":[0.57840633,0.00015650543,0.41995206,0.0005384046,0.0005555203,0.0000096345875,1.5576822e-7,0.000003799472,0.00037758544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987599,0.00007363348,0.00045125544,0.0002334647,0.00030091018,0.00018081027],"domain_scores_gemma":[0.9987022,0.00062847446,0.0002486061,0.00016612545,0.00019609275,0.000058475038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023980343,0.00010379032,0.00023290908,0.00018316536,0.00059762393,0.0007458026,0.0009348914,0.00003100676,1.6932671e-7],"category_scores_gemma":[0.000017421413,0.00005730007,0.00007993413,0.00044478345,0.00024396674,0.0004993315,0.0002499746,0.00009928548,3.217979e-7],"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.000057475834,0.00006426136,0.000548186,0.0003088814,0.00014150937,0.000018414743,0.002296775,0.0010997957,0.000025918838,0.49050054,0.018764041,0.48617423],"study_design_scores_gemma":[0.0012624237,0.00050955935,0.004084512,0.0005231621,0.000028940472,0.0004894645,0.00037460047,0.94870573,0.00007456888,0.014798426,0.028986672,0.00016190863],"about_ca_topic_score_codex":0.000008128953,"about_ca_topic_score_gemma":0.0000013121055,"teacher_disagreement_score":0.94760597,"about_ca_system_score_codex":0.000013959129,"about_ca_system_score_gemma":0.00011670851,"threshold_uncertainty_score":0.71917915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98793876,0.00052345975,0.009769866,0.00026413632,0.0005245844,0.00005836956,0.0000020335362,0.0000037425643,0.0009150248],"genre_scores_gemma":[0.9980582,0.0000061293113,0.0017304175,0.00003023696,0.0001486653,7.6340007e-7,7.192599e-8,0.0000010904847,0.00002440859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937534,0.000047056794,0.00025269768,0.00009654763,0.00013154026,0.000096786855],"domain_scores_gemma":[0.9996446,0.00003139456,0.00014729488,0.00003346074,0.00009986594,0.00004341778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029145824,0.00007102045,0.00018627715,0.000079547455,0.00023944293,0.00023739671,0.0001396797,0.00001795687,0.0000010664378],"category_scores_gemma":[9.831766e-7,0.000044962722,0.000034342138,0.00010483584,0.00024150299,0.00029118496,0.00004407317,0.00006963349,1.1725239e-7],"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.000022268088,0.000026936561,0.06206659,0.00020828628,0.00018763803,0.000007856846,0.004570314,0.0025038684,0.0013601596,0.82881635,0.00017015617,0.100059554],"study_design_scores_gemma":[0.0009549669,0.00043968108,0.015821923,0.0011555835,0.000049126345,0.00010235712,0.010235214,0.9181893,0.0004258096,0.05214808,0.00012356546,0.00035443032],"about_ca_topic_score_codex":0.00011948157,"about_ca_topic_score_gemma":0.0000011314235,"teacher_disagreement_score":0.9156854,"about_ca_system_score_codex":0.000008487011,"about_ca_system_score_gemma":0.00012378,"threshold_uncertainty_score":0.2289222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95374507,0.0013097783,0.043619733,0.00009368205,0.00037971593,0.00007364298,0.0000013772496,7.350694e-7,0.0007762707],"genre_scores_gemma":[0.9971351,0.00005840446,0.0026452036,0.000021582982,0.00006176124,5.5243004e-7,3.2353825e-7,0.000001193587,0.000075902484],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945,0.000082744584,0.00021107415,0.00007291977,0.00009117919,0.00009204684],"domain_scores_gemma":[0.9996839,0.000053486285,0.00005770152,0.000058140322,0.00011601473,0.000030741685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015708617,0.000035899517,0.000097472344,0.00007379102,0.00009499694,0.000038527392,0.00021905912,0.000025670635,1.7200479e-7],"category_scores_gemma":[0.000010787299,0.000020609405,0.00003914687,0.000097057,0.000103157334,0.0000061186165,0.000059391354,0.000038139264,4.450635e-8],"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.0022087651,0.0018382802,0.13223885,0.0025987872,0.0005556168,0.000025264348,0.012946149,0.021173315,0.35149047,0.15558118,0.014225309,0.30511802],"study_design_scores_gemma":[0.003233392,0.006185431,0.030000877,0.0010571749,0.000017669621,0.000124112,0.013093922,0.89446557,0.019449873,0.0006231691,0.031433534,0.00031527696],"about_ca_topic_score_codex":0.000002124893,"about_ca_topic_score_gemma":0.0000089745035,"teacher_disagreement_score":0.87329227,"about_ca_system_score_codex":0.000004902821,"about_ca_system_score_gemma":0.00012548412,"threshold_uncertainty_score":0.08404271},"labels":[],"label_agreement":null}]}