{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06981806,0.0002587888,0.92667925,0.00052692805,0.000024418967,0.00008061738,0.00013431918,0.0006267818,0.0018509268],"genre_scores_gemma":[0.5314253,0.00041220596,0.46317017,0.00013955956,0.000084692125,0.0003033221,0.00082533667,0.00016946676,0.0034699212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757785,0.0008321972,0.00014038963,0.00026518785,0.0010076839,0.0001766461],"domain_scores_gemma":[0.98978174,0.0076291016,0.0005677553,0.0006297776,0.0011777742,0.00021380687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033252856,0.0006547939,0.0010883912,0.0008497637,0.00054591394,0.0012704259,0.0014622032,0.0008078788,0.0016201324],"category_scores_gemma":[0.013003993,0.0003896696,0.0007108851,0.0008165735,0.0007552253,0.0019653572,0.0010862672,0.001218386,0.0005347912],"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.00024071097,0.00010647099,0.003794306,0.00015494155,0.00005794344,0.00034415696,0.000093758645,0.8272019,0.012282224,0.05141763,0.0020629403,0.10224307],"study_design_scores_gemma":[0.0000066943003,0.000013362534,0.00026369316,0.000002274259,0.0000033996023,0.000038690305,0.00000437391,0.9897647,0.001050123,0.008655443,0.00019181358,0.0000054872216],"about_ca_topic_score_codex":0.0018793681,"about_ca_topic_score_gemma":0.0010063847,"teacher_disagreement_score":0.0033252856,"about_ca_system_score_codex":0.0013301199,"about_ca_system_score_gemma":0.0011859975,"threshold_uncertainty_score":0.017585993},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07801132,0.00052350725,0.91729957,0.00015404022,0.00005350764,0.00008794022,0.00043477849,0.0017820724,0.0016533481],"genre_scores_gemma":[0.29960564,0.00025073646,0.6972915,0.00007942467,0.000022915683,0.00014858831,0.0011218586,0.00022925617,0.00125014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917907,0.00037502867,0.000038929535,0.00015975056,0.00021359687,0.000033633143],"domain_scores_gemma":[0.9985973,0.00070322695,0.00012614003,0.000276646,0.00021244425,0.00008416155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010745407,0.00047379851,0.0006317427,0.0014037064,0.0007058962,0.0007455645,0.0006729615,0.0006847565,0.0016468922],"category_scores_gemma":[0.0049556075,0.00028318106,0.00042812782,0.0015938621,0.0003978054,0.0010666776,0.0009392075,0.00084713864,0.0006860907],"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.00090537616,0.0002562759,0.020837389,0.00039457166,0.00027565856,0.00018688457,0.0002735932,0.3172226,0.1266425,0.05075823,0.0042079436,0.47803894],"study_design_scores_gemma":[0.000027616767,0.00011021704,0.004514324,0.00001114238,0.000025190186,0.00013602371,0.000037677044,0.93864655,0.029500619,0.02192602,0.005022375,0.00004221919],"about_ca_topic_score_codex":0.001859493,"about_ca_topic_score_gemma":0.0018680504,"teacher_disagreement_score":0.001859493,"about_ca_system_score_codex":0.0007103572,"about_ca_system_score_gemma":0.00062377047,"threshold_uncertainty_score":0.0056827664},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014897176,0.00031649388,0.9791509,0.0010287309,0.000024948216,0.000050253282,0.0002447782,0.00013959031,0.0041471203],"genre_scores_gemma":[0.33273044,0.0015834973,0.6588186,0.0008001947,0.0005833934,0.00032111263,0.0013067037,0.00030536583,0.0035506764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952023,0.0021728144,0.0002707893,0.0007473842,0.0012903159,0.0003165072],"domain_scores_gemma":[0.963738,0.03010032,0.0018800535,0.0027937107,0.0011305738,0.00035736553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062508755,0.00090991566,0.0014878396,0.002506027,0.001343744,0.003913624,0.0028499814,0.0013999616,0.0045062383],"category_scores_gemma":[0.041521233,0.0010858834,0.0016623645,0.0033335008,0.0048756837,0.011136255,0.005641232,0.005405464,0.0008727559],"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.000099578465,0.00005880147,0.001536455,0.00028066096,0.000060521532,0.00019937062,0.00033668606,0.15218964,0.0011511523,0.79627776,0.0030770288,0.044732373],"study_design_scores_gemma":[0.000019103283,0.000018499828,0.00017143738,0.000018090315,0.000012534381,0.00009576807,0.000040003517,0.19042315,0.00038577992,0.80716914,0.0016344738,0.0000120508175],"about_ca_topic_score_codex":0.0012440728,"about_ca_topic_score_gemma":0.0016284412,"teacher_disagreement_score":0.0062508755,"about_ca_system_score_codex":0.0016724508,"about_ca_system_score_gemma":0.0016109946,"threshold_uncertainty_score":0.033058167},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022293609,0.000105284395,0.9628246,0.0002389973,0.000052297557,0.00016138826,0.0005924386,0.012422002,0.0013093718],"genre_scores_gemma":[0.13369997,0.0000969476,0.86114824,0.00011100278,0.000035554218,0.00014881844,0.001647794,0.00049520785,0.0026164895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993351,0.00018133761,0.000024363728,0.00024199836,0.00015994244,0.00005709672],"domain_scores_gemma":[0.9989171,0.00045320002,0.00008364718,0.00020455514,0.00026632907,0.00007521073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075712084,0.0011708791,0.0010541073,0.002306795,0.00092924194,0.0009258068,0.0016179911,0.00095773727,0.0050757946],"category_scores_gemma":[0.002682807,0.00054693583,0.001027016,0.0016269286,0.000619481,0.0013908148,0.0012413829,0.0008251078,0.0014051447],"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.00048271078,0.00026629452,0.00181998,0.00023287236,0.000111119174,0.00022309615,0.00013246857,0.3354302,0.021620423,0.0084532965,0.013684288,0.6175432],"study_design_scores_gemma":[0.000033827342,0.000043045027,0.00028058584,0.0000041028065,0.00001329241,0.000039584167,0.000017209926,0.99021953,0.0034024091,0.00421468,0.0017188563,0.000012848991],"about_ca_topic_score_codex":0.010910347,"about_ca_topic_score_gemma":0.010935605,"teacher_disagreement_score":0.010910347,"about_ca_system_score_codex":0.00083712826,"about_ca_system_score_gemma":0.0021405108,"threshold_uncertainty_score":0.021693647},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018573621,0.00012797669,0.9800934,0.00010134126,0.000014754413,0.00004132031,0.000050335246,0.0003687042,0.00062847394],"genre_scores_gemma":[0.2904161,0.0002015675,0.7075565,0.00010998235,0.00001957627,0.00024787505,0.00020961463,0.00006619719,0.0011726646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968433,0.00011108973,0.000015475769,0.00010279678,0.000051439994,0.00003488107],"domain_scores_gemma":[0.998904,0.0008719813,0.0000787721,0.00003315422,0.000088060515,0.000023893825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090317824,0.0010457444,0.00082992646,0.0011695297,0.0005756283,0.0007396216,0.00096510095,0.0014197181,0.0009941866],"category_scores_gemma":[0.0029711484,0.00054731284,0.00072995364,0.0009686176,0.00086538756,0.00091233547,0.0005441684,0.0011513107,0.00016742638],"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.000023747387,0.000021668335,0.00045845803,0.000018718738,0.000018265075,0.000029227896,0.000027288484,0.9640385,0.0007515686,0.0078020673,0.00021640756,0.026594069],"study_design_scores_gemma":[0.000008657638,0.000006712953,0.00003133304,0.0000026652594,0.0000040141294,0.0000052810456,0.0000039313877,0.9944876,0.0002169624,0.0050646495,0.00016553552,0.0000027250055],"about_ca_topic_score_codex":0.012585416,"about_ca_topic_score_gemma":0.00851528,"teacher_disagreement_score":0.012585416,"about_ca_system_score_codex":0.0015056037,"about_ca_system_score_gemma":0.001794428,"threshold_uncertainty_score":0.025024295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005801165,0.00029777776,0.9884566,0.00013516784,0.000075901866,0.0000721448,0.000054772347,0.0033155656,0.0017908843],"genre_scores_gemma":[0.15321274,0.00030655,0.83903056,0.00028163468,0.000113137336,0.0002889015,0.0004498587,0.00037197306,0.0059446287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992205,0.00014992579,0.000037372407,0.00015246551,0.00036245128,0.00007719903],"domain_scores_gemma":[0.999493,0.00012535564,0.00004801101,0.00008064982,0.00020991096,0.000042965105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001509223,0.00091650797,0.0015306554,0.0010533701,0.00051815726,0.0009968361,0.0020365268,0.001202579,0.0037715184],"category_scores_gemma":[0.002129913,0.0005716014,0.000888272,0.00087647716,0.0004903991,0.00096273166,0.001013068,0.0015597229,0.0033500907],"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.00030705414,0.000197866,0.0012880011,0.00018484131,0.00012965064,0.000111668676,0.00007505149,0.34319422,0.01387349,0.016039774,0.017082827,0.6075156],"study_design_scores_gemma":[0.000017482207,0.000023982737,0.000106357664,0.0000032186038,0.0000057889088,0.000023815013,0.0000030958531,0.9918989,0.001548236,0.0047475,0.0016149444,0.0000067115825],"about_ca_topic_score_codex":0.0031277684,"about_ca_topic_score_gemma":0.0022307457,"teacher_disagreement_score":0.0037715184,"about_ca_system_score_codex":0.0007166277,"about_ca_system_score_gemma":0.0011920808,"threshold_uncertainty_score":0.012616992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024967564,0.000058156675,0.9723598,0.00012396395,0.0000136343,0.000037085698,0.000086204054,0.0012606084,0.0010930891],"genre_scores_gemma":[0.5992819,0.00010800381,0.3942505,0.00015564552,0.000056243967,0.00033063008,0.0008831166,0.0003958094,0.004538159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874216,0.0003972185,0.00005398393,0.0003205932,0.00032427945,0.0001618554],"domain_scores_gemma":[0.9972247,0.0017573846,0.00026243465,0.00018921756,0.000450423,0.00011579486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014511538,0.00091648527,0.0014969191,0.0010277985,0.0006870578,0.0010544378,0.001577121,0.000851098,0.0031119182],"category_scores_gemma":[0.0049775536,0.0007532735,0.00087763503,0.0010082364,0.00057049724,0.0014039302,0.0010270317,0.001296047,0.00088068476],"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.000119981654,0.00008632786,0.0013876507,0.000046039462,0.000036509722,0.000074835116,0.000033587854,0.90775144,0.0012233187,0.0037548323,0.0018933737,0.08359208],"study_design_scores_gemma":[0.0000042045945,0.0000063825264,0.000035020166,8.362046e-7,0.0000017056881,0.0000038614085,0.000003538811,0.9975768,0.000269187,0.0020417366,0.00005494109,0.0000017379585],"about_ca_topic_score_codex":0.00548586,"about_ca_topic_score_gemma":0.0049214386,"teacher_disagreement_score":0.00548586,"about_ca_system_score_codex":0.00077701797,"about_ca_system_score_gemma":0.001644462,"threshold_uncertainty_score":0.010907888},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27018934,0.00028305812,0.72508407,0.0001806455,0.000019591263,0.0001277026,0.00070099527,0.002534706,0.00087992364],"genre_scores_gemma":[0.49279386,0.00022524995,0.5032319,0.000054200766,0.000012953749,0.00018746375,0.0027880045,0.00028133404,0.0004249869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996296,0.00008609467,0.000027179314,0.00008607751,0.0001335131,0.000037541482],"domain_scores_gemma":[0.99943155,0.0001933345,0.00009752782,0.00010518655,0.0001262046,0.00004614143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005273339,0.0006989704,0.0007907599,0.0024084798,0.0006309863,0.0009276563,0.0008699814,0.0006622116,0.0005650311],"category_scores_gemma":[0.0018173177,0.00045022008,0.00104975,0.0018228828,0.00055911427,0.0006985718,0.0009226174,0.0006689529,0.00031041808],"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.001011562,0.0004614038,0.03024205,0.00067021203,0.00055435346,0.00070816185,0.00074897514,0.41813985,0.23903282,0.019258456,0.008020363,0.2811518],"study_design_scores_gemma":[0.00003245489,0.00002652751,0.0031445457,0.000006138078,0.000030994466,0.00011617778,0.00007169604,0.9735972,0.014276755,0.0074596894,0.001215245,0.000022499913],"about_ca_topic_score_codex":0.0035962057,"about_ca_topic_score_gemma":0.004656283,"teacher_disagreement_score":0.0035962057,"about_ca_system_score_codex":0.0006294424,"about_ca_system_score_gemma":0.0010545257,"threshold_uncertainty_score":0.0071505904},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006506492,0.0037977211,0.32887673,0.0014647616,0.0005802315,0.0012370918,0.21727575,0.426528,0.013733238],"genre_scores_gemma":[0.0328235,0.003223812,0.5563601,0.0018780384,0.000444795,0.0031726118,0.36652642,0.026132468,0.009438176],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99651307,0.00067358505,0.0005282005,0.0006734649,0.0013613593,0.00025038427],"domain_scores_gemma":[0.99630797,0.0010670362,0.00052093755,0.0010183004,0.0007485132,0.00033734468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037258533,0.0026471296,0.0030093347,0.008640166,0.0012078218,0.0034471012,0.0057228263,0.0018310378,0.03140167],"category_scores_gemma":[0.009169103,0.0015717219,0.001649195,0.009726399,0.00072458095,0.0039183283,0.004928318,0.002422295,0.044953667],"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.0012249451,0.0002001402,0.002581188,0.002818763,0.00057581125,0.0006105606,0.0002678572,0.0035530787,0.009937146,0.010514061,0.7543262,0.21339019],"study_design_scores_gemma":[0.0012737841,0.00031642528,0.004702724,0.00041968244,0.00022018955,0.001969621,0.0002854597,0.068105236,0.04601049,0.04026446,0.8359527,0.00047926177],"about_ca_topic_score_codex":0.002011903,"about_ca_topic_score_gemma":0.00206688,"teacher_disagreement_score":0.03140167,"about_ca_system_score_codex":0.001012288,"about_ca_system_score_gemma":0.0029113158,"threshold_uncertainty_score":0.105049014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077533624,0.00025318764,0.99088097,0.00017110733,0.000038636026,0.000057185902,0.00004971113,0.00021592871,0.00057986466],"genre_scores_gemma":[0.24418022,0.0004603215,0.7514816,0.00027183976,0.00020996695,0.0004008369,0.00063598744,0.00016823887,0.0021910442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969703,0.0012147765,0.0002331896,0.00079818786,0.0005459417,0.0002375033],"domain_scores_gemma":[0.98847467,0.008473618,0.00059186196,0.0010432156,0.0011399575,0.0002766538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004115015,0.0010834086,0.0018720806,0.001424144,0.0010834499,0.0011727464,0.004004538,0.0022210546,0.003309969],"category_scores_gemma":[0.018106917,0.00057851675,0.0012035593,0.0025548232,0.00138796,0.0035674702,0.0018877059,0.0023465513,0.00092201284],"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.0006860219,0.00021870628,0.0032667809,0.0004174391,0.00016493033,0.00012579634,0.00022451066,0.4302843,0.0061114267,0.13576135,0.007248071,0.41549072],"study_design_scores_gemma":[0.000068108675,0.00006528445,0.00017668471,0.000013886095,0.000016675871,0.000053507873,0.00002111879,0.9248852,0.0011000689,0.07243255,0.0011549576,0.000011877995],"about_ca_topic_score_codex":0.001560687,"about_ca_topic_score_gemma":0.0014713928,"teacher_disagreement_score":0.004115015,"about_ca_system_score_codex":0.0008370581,"about_ca_system_score_gemma":0.0010220215,"threshold_uncertainty_score":0.02176255},"labels":[],"label_agreement":null}]}