{"meta":{"query_hash":"f7f56b7dd08f","filters":{"venue":"Computational Systems Bioinformatics"},"cohort_total":10,"direct_labels_cover":0,"predictions_cover":10,"exported":10,"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/f7f56b7dd08f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computational+Systems+Bioinformatics"},"results":[{"id":"W1974218884","doi":"10.1142/9781860947575_0043","title":"COMPLEXITY AND SCORING FUNCTION OF MS/MS PEPTIDE DE NOVO SEQUENCING","year":2006,"lang":"en","type":"article","venue":"Computational Systems Bioinformatics","topic":"Advanced Proteomics Techniques and Applications","field":"Chemistry","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Fragment (logic); Function (biology); Tandem mass spectrometry; Computational biology; Computer science; Peptide; DNA sequencing; Algorithm; Biology; Mass spectrometry; Genetics; Chemistry; Gene; Biochemistry; Chromatography","score_opus":0.02655940615621124,"score_gpt":0.25613384115950066,"score_spread":0.22957443500328942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974218884","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.37488422,0.000056800298,0.6164025,0.000013485402,0.000019092231,0.00011538977,0.000045366112,0.0000868627,0.008376262],"genre_scores_gemma":[0.8051997,0.00000287496,0.19447958,0.000012961584,0.00007563309,0.00002691789,0.00011297472,0.000008698808,0.000080660495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991386,0.000005487218,0.0004772551,0.00008815753,0.00015617792,0.00013431633],"domain_scores_gemma":[0.99935544,0.000070381655,0.00029152696,0.00012268512,0.00012035647,0.00003963858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012466867,0.000102033715,0.00014863079,0.00004689047,0.00012709566,0.000038965743,0.00008018084,0.00006302352,0.000011077462],"category_scores_gemma":[0.000010994697,0.000106106876,0.00003247663,0.000090512876,0.00007775899,0.0001488283,0.000043154523,0.000091445676,0.0000039859015],"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.00003081339,0.00007112165,0.01294307,0.0029115845,0.000058638365,0.000001839852,0.0005028524,0.61070234,0.027455077,0.34257433,0.00055503077,0.0021932924],"study_design_scores_gemma":[0.0003775277,0.000021940485,0.0020676197,0.00027417828,0.000022134667,0.000080468635,0.00034959905,0.94518703,0.0063660094,0.04374633,0.0012710284,0.00023610437],"about_ca_topic_score_codex":0.00018961042,"about_ca_topic_score_gemma":0.000005741195,"teacher_disagreement_score":0.4303155,"about_ca_system_score_codex":0.00014079254,"about_ca_system_score_gemma":0.000056878907,"threshold_uncertainty_score":0.43269128},"labels":[],"label_agreement":null},{"id":"W2021800442","doi":"10.1142/9781860947575_0024","title":"WHOLE GENOME COMPOSITION DISTANCE FOR HIV-1 GENOTYPING","year":2006,"lang":"en","type":"article","venue":"Computational Systems Bioinformatics","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Genotyping; Genome; Computational biology; Closeness; Human immunodeficiency virus (HIV); Biology; Genetics; Gene; Genotype; Mathematics; Virology","score_opus":0.008611704137279384,"score_gpt":0.21779305705951613,"score_spread":0.20918135292223675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021800442","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.14434637,0.0016305584,0.8512841,0.00010197341,0.00027016102,0.0005213174,0.0006480743,0.000010782918,0.0011866508],"genre_scores_gemma":[0.96866095,0.000009414029,0.027913382,0.000083491155,0.0004163064,0.000056399185,0.002562693,0.000015417578,0.0002819511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919474,0.000012529629,0.0003687238,0.00013375898,0.00011101416,0.00017924418],"domain_scores_gemma":[0.9994827,0.000024093959,0.00015705635,0.00012560985,0.00017712139,0.00003340952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001120343,0.00012779204,0.0001358611,0.000033583,0.00019470303,0.0000613283,0.00010956826,0.0000635044,6.688314e-7],"category_scores_gemma":[0.0000062568156,0.00012827777,0.000069513764,0.00004908568,0.00004184805,0.0000022810486,0.000045082197,0.000026030575,0.000019473511],"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.000055801986,0.000066334906,0.001356833,0.00033829157,0.00011650307,4.8573867e-7,0.00016265693,0.87947065,0.09887825,0.011168217,0.007993059,0.00039294575],"study_design_scores_gemma":[0.0021196732,0.0002839748,0.026760325,0.000064564796,0.000058053676,0.000054713568,0.00038155753,0.4814663,0.0012791689,0.002843979,0.48384333,0.00084437174],"about_ca_topic_score_codex":0.000006601412,"about_ca_topic_score_gemma":0.0000027969213,"teacher_disagreement_score":0.8243146,"about_ca_system_score_codex":0.000026596195,"about_ca_system_score_gemma":0.000037396236,"threshold_uncertainty_score":0.5231015},"labels":[],"label_agreement":null},{"id":"W2023305634","doi":"10.1142/9781860947575_0027","title":"TOWARD AN ALGEBRAIC UNDERSTANDING OF HAPLOTYPE INFERENCE BY PURE PARSIMONY","year":2006,"lang":"en","type":"article","venue":"Computational Systems Bioinformatics","topic":"Genetic Mapping and Diversity in Plants and Animals","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Inference; Algebraic number; Maximum parsimony; Computer science; Theoretical computer science; Mathematics; Artificial intelligence; Biology; Phylogenetics; Genetics","score_opus":0.03377831007878152,"score_gpt":0.2409049676724368,"score_spread":0.20712665759365528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023305634","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.59340805,0.0005355771,0.4004502,0.00006050097,0.0002346395,0.00020756382,0.00032287033,0.000028819966,0.0047517475],"genre_scores_gemma":[0.99672437,0.0000138894775,0.0021084677,0.000043093387,0.00006050032,0.00000162489,0.00090483093,0.0000050274853,0.0001382164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999272,0.000021341335,0.00029231238,0.00010131481,0.00018331893,0.00012973658],"domain_scores_gemma":[0.99957854,0.000019980554,0.00016115003,0.0001005641,0.00008974172,0.00005002599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110964495,0.00010083671,0.00012646867,0.000039048587,0.00008158906,0.00004820586,0.00013437198,0.00008745775,0.000006166922],"category_scores_gemma":[0.000014714816,0.00009464154,0.000037745474,0.000060273152,0.00005365192,0.000009793224,0.000043226904,0.000034465902,0.000007856574],"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.00018814566,0.0006961035,0.053469084,0.0018609867,0.0004122837,0.000007842779,0.001731569,0.5450864,0.03957348,0.1432349,0.21227503,0.0014641903],"study_design_scores_gemma":[0.004742963,0.0029409581,0.016858464,0.0005732175,0.0001854485,0.00016663485,0.014189981,0.86272407,0.009524594,0.026268851,0.05933249,0.002492313],"about_ca_topic_score_codex":0.0000505628,"about_ca_topic_score_gemma":0.0000032720977,"teacher_disagreement_score":0.4033163,"about_ca_system_score_codex":0.000013217405,"about_ca_system_score_gemma":0.000051201314,"threshold_uncertainty_score":0.38593698},"labels":[],"label_agreement":null},{"id":"W2080049603","doi":"10.1142/9781860947575_0013","title":"A GRAPH-BASED AUTOMATED NMR BACKBONE RESONANCE SEQUENTIAL ASSIGNMENT","year":2006,"lang":"en","type":"article","venue":"Computational Systems Bioinformatics","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chaining; Computer science; Assignment problem; Algorithm; Graph; Partition (number theory); Theoretical computer science; Mathematics; Mathematical optimization; Combinatorics","score_opus":0.006305925403609124,"score_gpt":0.22658416253558603,"score_spread":0.2202782371319769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080049603","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.09396312,0.0010334643,0.90075696,0.000083009836,0.000446324,0.00065968063,0.00022844198,0.00021375525,0.0026152497],"genre_scores_gemma":[0.96503067,0.0000034307193,0.032488476,0.00017483481,0.00022277053,0.00003564138,0.0018536807,0.000017871425,0.00017260588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873424,0.00004178141,0.0004985036,0.00016809625,0.00032631532,0.0002310815],"domain_scores_gemma":[0.9993292,0.000017005133,0.00022133853,0.00021553032,0.00015698053,0.00005990842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015548135,0.00018233844,0.00016374404,0.00007050048,0.00012453181,0.00008163159,0.00015993726,0.00015164974,0.0000042604197],"category_scores_gemma":[0.000014658503,0.00017045916,0.000086479275,0.00014473428,0.000075407894,0.00000969004,0.00005023757,0.00006512876,0.000024646766],"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.000048263988,0.000056680106,0.0008506662,0.00016126594,0.000043451004,0.000004963654,0.0000210928,0.97677946,0.0037218817,0.0043738135,0.013386516,0.00055192923],"study_design_scores_gemma":[0.0008674105,0.00011274534,0.0025727702,0.00004685646,0.0000137344905,0.000039619386,0.000022634664,0.9821369,0.0010960693,0.0006832118,0.012129813,0.00027820136],"about_ca_topic_score_codex":0.000046865684,"about_ca_topic_score_gemma":0.000007923333,"teacher_disagreement_score":0.8710676,"about_ca_system_score_codex":0.00004383573,"about_ca_system_score_gemma":0.0001525017,"threshold_uncertainty_score":0.6951122},"labels":[],"label_agreement":null},{"id":"W2140540053","doi":"10.1109/csb.2004.22","title":"A genetic algorithm for inferring time delays in gene regulatory networks","year":2004,"lang":"en","type":"article","venue":"Computational Systems Bioinformatics","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Gene regulatory network; Computer science; Boolean network; Genetic algorithm; Algorithm; Genetic network; Mathematical optimization; Gene; Boolean function; Mathematics; Machine learning; Gene expression; Biology; Genetics","score_opus":0.006372010540183468,"score_gpt":0.21374779745909755,"score_spread":0.2073757869189141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140540053","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.16608894,0.0010045843,0.8321738,0.00001259977,0.00015368694,0.00045461438,0.00002277986,0.00002216092,0.0000667818],"genre_scores_gemma":[0.7483516,0.000024240739,0.25024644,0.00010818135,0.0004549262,0.00008886042,0.0006032869,0.000036483303,0.00008600853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848735,0.000032773703,0.0006876716,0.00022971952,0.00022611636,0.00033634985],"domain_scores_gemma":[0.99917877,0.000026388743,0.00022871772,0.00028044282,0.00017778779,0.000107886925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029748498,0.00021385409,0.0002661712,0.0001425973,0.000107563355,0.000058409107,0.00020363991,0.00019676545,0.0000021521407],"category_scores_gemma":[0.000018299088,0.00022729332,0.0001411065,0.00022818682,0.00005286586,0.000011990748,0.000084493666,0.00007043892,0.000021223927],"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.0000072455573,0.000026218393,0.00028494105,0.00002972239,0.00007755297,0.000001567749,0.000048311034,0.9919142,0.00032347083,0.00008183955,0.00025380854,0.0069511146],"study_design_scores_gemma":[0.0010194612,0.00009013684,0.0036278407,0.00005055978,0.000028997016,0.00006155221,0.000037916947,0.9936812,0.00029823836,0.0002630152,0.0005667099,0.0002743811],"about_ca_topic_score_codex":0.000012840244,"about_ca_topic_score_gemma":0.0000049354767,"teacher_disagreement_score":0.58226264,"about_ca_system_score_codex":0.00010717544,"about_ca_system_score_gemma":0.00015591914,"threshold_uncertainty_score":0.9268753},"labels":[],"label_agreement":null},{"id":"W2165883267","doi":"10.1142/9781860947575_0012","title":"PROTEIN FOLD RECOGNITION USING THE GRADIENT BOOST ALGORITHM","year":2006,"lang":"en","type":"article","venue":"Computational Systems Bioinformatics","topic":"Machine Learning in Bioinformatics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Bioinformatics Solutions (Canada); University of Waterloo","funders":"","keywords":"Computer science; Algorithm; Threading (protein sequence); Artificial intelligence; Machine learning; Support vector machine; Boosting (machine learning); Computation; Fold (higher-order function); Benchmark (surveying); Protein structure prediction; Protein structure","score_opus":0.013398283772462128,"score_gpt":0.23989169728365473,"score_spread":0.2264934135111926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165883267","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.17682278,0.00026701557,0.817528,0.0001171218,0.0004545647,0.0010592298,0.00012986567,0.000062028,0.0035593875],"genre_scores_gemma":[0.69507825,0.000005827637,0.30043522,0.0002992158,0.0009239052,0.000082449784,0.0025804504,0.000046721205,0.0005479645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985457,0.00006890294,0.0006478209,0.00012560248,0.00035954977,0.00025239607],"domain_scores_gemma":[0.9990796,0.000029422607,0.00036563174,0.00024500568,0.00022933773,0.000051014245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000387476,0.0001941027,0.00014488162,0.00006847843,0.00029791048,0.00015652357,0.00021766711,0.000121653975,0.0000055570113],"category_scores_gemma":[0.00004797152,0.00014790412,0.000087485314,0.00015271424,0.0000866578,0.000020357262,0.0000982519,0.00013385566,0.0000574767],"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.00005694518,0.00023209307,0.0013374138,0.00083580415,0.00027036387,0.000005583023,0.0007706754,0.93102527,0.003453703,0.00412306,0.024182089,0.033706978],"study_design_scores_gemma":[0.00036865522,0.00008834415,0.00029735419,0.00006540927,0.000017782644,0.00013757893,0.00022046537,0.9825525,0.00042150688,0.00040274614,0.015189737,0.00023789282],"about_ca_topic_score_codex":0.00009514387,"about_ca_topic_score_gemma":0.000004755007,"teacher_disagreement_score":0.5182555,"about_ca_system_score_codex":0.000049664413,"about_ca_system_score_gemma":0.000088465684,"threshold_uncertainty_score":0.6031355},"labels":[],"label_agreement":null},{"id":"W2314352172","doi":"10.1142/9781860948732_0033","title":"CONSENSUS CONTACT PREDICTION BY LINEAR PROGRAMMING","year":2007,"lang":"en","type":"article","venue":"Computational Systems Bioinformatics","topic":"Software Engineering Research","field":"Computer Science","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":"University of Waterloo","funders":"","keywords":"Computer science; Linear programming; Algorithm","score_opus":0.016450985169903776,"score_gpt":0.2646623870308433,"score_spread":0.24821140186093954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314352172","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.013670289,0.00016556933,0.9839866,0.00006697676,0.0007607614,0.00041346488,0.000023149078,0.0006138432,0.00029934288],"genre_scores_gemma":[0.7367633,0.0000014604068,0.26285318,0.000045684737,0.00012276435,0.000015696472,0.00008555285,0.000013093026,0.00009924796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810266,0.000024246645,0.00061088847,0.00015929113,0.000725653,0.00037722953],"domain_scores_gemma":[0.9980113,0.0010974915,0.00015122029,0.00025315248,0.0003118654,0.00017497144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010627384,0.00014290334,0.00015815192,0.00018978052,0.00014175718,0.00022418633,0.00042371466,0.00008894828,0.0000014729976],"category_scores_gemma":[0.00029885452,0.00013838803,0.00004518271,0.0004671019,0.000033537308,0.0003096517,0.000105690866,0.00017552552,0.00011155972],"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.00006180914,0.00046861882,0.053462125,0.0019898647,0.00047038263,0.00012450674,0.007064698,0.58690155,0.00041085316,0.09606682,0.08666563,0.16631313],"study_design_scores_gemma":[0.00035304346,0.00009201481,0.004444407,0.000056236393,0.0000025860954,0.000117295705,0.00009363853,0.98106986,0.000057581405,0.00006105046,0.01349988,0.00015238053],"about_ca_topic_score_codex":0.000020558715,"about_ca_topic_score_gemma":4.2443185e-7,"teacher_disagreement_score":0.72309303,"about_ca_system_score_codex":0.00015684812,"about_ca_system_score_gemma":0.000102760016,"threshold_uncertainty_score":0.56433},"labels":[],"label_agreement":null},{"id":"W2315018354","doi":"10.1142/9781860948732_0030","title":"UNCOVERING THE STRUCTURAL BASIS OF PROTEIN INTERACTIONS WITH EFFICIENT CLUSTERING OF 3-D INTERACTION INTERFACES","year":2007,"lang":"en","type":"article","venue":"Computational Systems Bioinformatics","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","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":"Lunenfeld-Tanenbaum Research Institute; University of Toronto; Mount Sinai Hospital","funders":"","keywords":"Computer science; Cluster analysis; Basis (linear algebra); Protein–protein interaction; Human–computer interaction; Data mining; Artificial intelligence; Chemistry; Mathematics","score_opus":0.007201058886584483,"score_gpt":0.2486894658346331,"score_spread":0.24148840694804863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315018354","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.605655,0.000047209283,0.39357546,0.000008354979,0.00014185644,0.00021996931,0.0000139310505,0.0000044099097,0.00033377108],"genre_scores_gemma":[0.98927003,8.4218846e-7,0.010586716,0.0000098768405,0.000049033195,0.0000063040634,0.000047659578,0.0000071294494,0.000022385757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991641,0.000018276698,0.00045288473,0.000076408636,0.00018390844,0.000104420265],"domain_scores_gemma":[0.9991979,0.000038754315,0.00039656094,0.00014278447,0.0001995188,0.000024464498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019381876,0.00010091012,0.000122043995,0.00006198667,0.000063634536,0.000021109496,0.00012649331,0.00004142392,0.0000018602157],"category_scores_gemma":[0.000027801558,0.00006619511,0.000040889106,0.00010747973,0.00007536692,0.000012138678,0.00007466137,0.00007292537,6.9222534e-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.00014787643,0.0000102933345,0.00048643217,0.00022968615,0.00008350196,2.485322e-7,0.0004904793,0.9815305,0.013933159,0.000360703,0.000008379649,0.0027187685],"study_design_scores_gemma":[0.000558951,0.00036312768,0.0039809616,0.0003837749,0.00002911964,0.00015727211,0.0029469088,0.9209431,0.069900334,0.0001178223,0.0004023062,0.00021632647],"about_ca_topic_score_codex":0.00004420891,"about_ca_topic_score_gemma":0.00003983682,"teacher_disagreement_score":0.38361502,"about_ca_system_score_codex":0.000026370924,"about_ca_system_score_gemma":0.00004066352,"threshold_uncertainty_score":0.26993585},"labels":[],"label_agreement":null},{"id":"W2321144071","doi":"10.1142/9781848162648_0006","title":"MSDASH: MASS SPECTROMETRY DATABASE AND SEARCH","year":2008,"lang":"en","type":"article","venue":"Computational Systems Bioinformatics","topic":"Mass Spectrometry Techniques and Applications","field":"Chemistry","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Mass spectrometry; Ion-mobility spectrometry–mass spectrometry; Database; Information retrieval; Chemistry; Selected reaction monitoring; Chromatography; Tandem mass spectrometry","score_opus":0.026768737662564764,"score_gpt":0.2643204686463995,"score_spread":0.23755173098383475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321144071","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.1070618,0.0010024016,0.683194,0.00037920268,0.00012827212,0.0004902708,0.0006138048,0.00077923224,0.20635104],"genre_scores_gemma":[0.81040907,0.00015827962,0.18813285,0.000044536795,0.00014730406,0.000034066896,0.0003915194,0.000017547287,0.0006648385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987502,0.000009505546,0.0004333539,0.00016005822,0.00041244988,0.00023440071],"domain_scores_gemma":[0.9992119,0.00013949964,0.00012460315,0.00027680342,0.000107047184,0.00014011949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001462528,0.00015309485,0.00019187936,0.0001522743,0.0003195295,0.00007250558,0.00019280192,0.00007915041,0.00040606968],"category_scores_gemma":[0.000020962289,0.00014738555,0.00004142723,0.00030633152,0.00012573326,0.00019721825,0.000086159984,0.00018818778,0.00008262401],"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.000053947915,0.0005022603,0.02521035,0.0043215766,0.00039997432,0.00009670128,0.0020327757,0.011373614,0.02373444,0.88296264,0.045541555,0.0037701777],"study_design_scores_gemma":[0.000877435,0.00006178855,0.0018084499,0.00017293893,0.000021663293,0.0012234503,0.000951962,0.96724695,0.0034963612,0.0043064672,0.01912817,0.0007043349],"about_ca_topic_score_codex":0.000033298194,"about_ca_topic_score_gemma":2.4054788e-7,"teacher_disagreement_score":0.95587337,"about_ca_system_score_codex":0.00008310147,"about_ca_system_score_gemma":0.00006453086,"threshold_uncertainty_score":0.6010208},"labels":[],"label_agreement":null},{"id":"W2326738634","doi":"10.1142/9781848162648_0004","title":"VOTING ALGORITHMS FOR THE MOTIF FINDING PROBLEM","year":2008,"lang":"en","type":"article","venue":"Computational Systems Bioinformatics","topic":"Genomics and Chromatin Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Voting; Motif (music); Computer science; Algorithm; Political science; Law; Art","score_opus":0.022797550783589037,"score_gpt":0.24564555102942842,"score_spread":0.2228480002458394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2326738634","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.10698376,0.00036973387,0.8909046,0.00008897194,0.00036480572,0.00067585846,0.000080155325,0.000020872614,0.00051122083],"genre_scores_gemma":[0.9132903,0.00002728078,0.085380204,0.00010562286,0.000295831,0.00006728043,0.00041926635,0.000019883613,0.00039428318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991357,0.000012874582,0.0003904031,0.00011259005,0.00015622629,0.00019224512],"domain_scores_gemma":[0.9993645,0.00008164479,0.00020442087,0.00014055036,0.00016542367,0.000043482876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023307682,0.00012325855,0.000113211805,0.000028793904,0.0004315082,0.000056859077,0.00020668733,0.00007775872,0.0000011479361],"category_scores_gemma":[0.000038504393,0.00009421615,0.00008295454,0.00006542085,0.000055887387,0.0000064785495,0.00007269083,0.000052330925,0.000011232407],"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.000012200461,0.00003387573,0.0012428969,0.00024175356,0.00015039457,8.794475e-7,0.0006510768,0.9832806,0.00048996176,0.004331124,0.0069227046,0.0026425044],"study_design_scores_gemma":[0.0003562076,0.00006698002,0.00083869055,0.00001852995,0.000010650332,0.00012737614,0.0002654482,0.99051803,0.000072702656,0.000107054206,0.0074780495,0.00014025737],"about_ca_topic_score_codex":0.0000066636917,"about_ca_topic_score_gemma":0.0000015145293,"teacher_disagreement_score":0.8063066,"about_ca_system_score_codex":0.000023495206,"about_ca_system_score_gemma":0.000093011404,"threshold_uncertainty_score":0.3842023},"labels":[],"label_agreement":null}]}