{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":10,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":10,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"f7f56b7dd08f","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02655940615621124,"gpt":0.2561338411595007,"spread":0.2295744350032894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001246687,0.0001020337,0.0001486308,0.00004689047,0.0001270957,0.00003896574,0.00008018084,0.00006302352,0.00001107746],"category_scores_gemma":[0.0000109947,0.0001061069,0.00003247663,0.00009051288,0.00007775899,0.0001488283,0.00004315452,0.00009144568,0.000003985901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001407925,"about_ca_system_score_gemma":0.00005687891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001896104,"about_ca_topic_score_gemma":0.000005741195,"domain_scores_codex":[0.9991386,0.000005487218,0.0004772551,0.00008815753,0.0001561779,0.0001343163],"domain_scores_gemma":[0.9993554,0.00007038165,0.000291527,0.0001226851,0.0001203565,0.00003963858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003081339,0.00007112165,0.01294307,0.002911584,0.00005863836,0.000001839852,0.0005028524,0.6107023,0.02745508,0.3425743,0.0005550308,0.002193292],"study_design_scores_gemma":[0.0003775277,0.00002194048,0.00206762,0.0002741783,0.00002213467,0.00008046864,0.0003495991,0.945187,0.006366009,0.04374633,0.001271028,0.0002361044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3748842,0.0000568003,0.6164025,0.0000134854,0.00001909223,0.0001153898,0.00004536611,0.0000868627,0.008376262],"genre_scores_gemma":[0.8051997,0.00000287496,0.1944796,0.00001296158,0.00007563309,0.00002691789,0.0001129747,0.000008698808,0.00008066049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4303155,"threshold_uncertainty_score":0.4326913,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01339828377246213,"gpt":0.2398916972836547,"spread":0.2264934135111926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000387476,0.0001941027,0.0001448816,0.00006847843,0.0002979105,0.0001565236,0.0002176671,0.000121654,0.000005557011],"category_scores_gemma":[0.00004797152,0.0001479041,0.00008748531,0.0001527142,0.0000866578,0.00002035726,0.0000982519,0.0001338557,0.0000574767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004966441,"about_ca_system_score_gemma":0.00008846568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009514387,"about_ca_topic_score_gemma":0.000004755007,"domain_scores_codex":[0.9985457,0.00006890294,0.0006478209,0.0001256025,0.0003595498,0.0002523961],"domain_scores_gemma":[0.9990796,0.00002942261,0.0003656317,0.0002450057,0.0002293377,0.00005101425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005694518,0.0002320931,0.001337414,0.0008358042,0.0002703639,0.000005583023,0.0007706754,0.9310253,0.003453703,0.00412306,0.02418209,0.03370698],"study_design_scores_gemma":[0.0003686552,0.00008834415,0.0002973542,0.00006540927,0.00001778264,0.0001375789,0.0002204654,0.9825525,0.0004215069,0.0004027461,0.01518974,0.0002378928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1768228,0.0002670156,0.817528,0.0001171218,0.0004545647,0.00105923,0.0001298657,0.000062028,0.003559388],"genre_scores_gemma":[0.6950783,0.000005827637,0.3004352,0.0002992158,0.0009239052,0.00008244978,0.00258045,0.0000467212,0.0005479645],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5182555,"threshold_uncertainty_score":0.6031355,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03377831007878152,"gpt":0.2409049676724368,"spread":0.2071266575936553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001109645,0.0001008367,0.0001264687,0.00003904859,0.00008158906,0.00004820586,0.000134372,0.00008745775,0.000006166922],"category_scores_gemma":[0.00001471482,0.00009464154,0.00003774547,0.00006027315,0.00005365192,0.000009793224,0.0000432269,0.0000344659,0.000007856574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000132174,"about_ca_system_score_gemma":0.00005120131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000505628,"about_ca_topic_score_gemma":0.000003272098,"domain_scores_codex":[0.999272,0.00002134134,0.0002923124,0.0001013148,0.0001833189,0.0001297366],"domain_scores_gemma":[0.9995785,0.00001998055,0.00016115,0.0001005641,0.00008974172,0.00005002599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001881457,0.0006961035,0.05346908,0.001860987,0.0004122837,0.000007842779,0.001731569,0.5450864,0.03957348,0.1432349,0.212275,0.00146419],"study_design_scores_gemma":[0.004742963,0.002940958,0.01685846,0.0005732175,0.0001854485,0.0001666349,0.01418998,0.8627241,0.009524594,0.02626885,0.05933249,0.002492313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.593408,0.0005355771,0.4004502,0.00006050097,0.0002346395,0.0002075638,0.0003228703,0.00002881997,0.004751747],"genre_scores_gemma":[0.9967244,0.00001388948,0.002108468,0.00004309339,0.00006050032,0.00000162489,0.0009048309,0.000005027485,0.0001382164],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4033163,"threshold_uncertainty_score":0.385937,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02676873766256476,"gpt":0.2643204686463995,"spread":0.2375517309838348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001462528,0.0001530949,0.0001918794,0.0001522743,0.0003195295,0.00007250558,0.0001928019,0.00007915041,0.0004060697],"category_scores_gemma":[0.00002096229,0.0001473856,0.00004142723,0.0003063315,0.0001257333,0.0001972183,0.00008615998,0.0001881878,0.00008262401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008310147,"about_ca_system_score_gemma":0.00006453086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003329819,"about_ca_topic_score_gemma":2.405479e-7,"domain_scores_codex":[0.9987502,0.000009505546,0.0004333539,0.0001600582,0.0004124499,0.0002344007],"domain_scores_gemma":[0.9992119,0.0001394996,0.0001246031,0.0002768034,0.0001070472,0.0001401195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005394792,0.0005022603,0.02521035,0.004321577,0.0003999743,0.00009670128,0.002032776,0.01137361,0.02373444,0.8829626,0.04554155,0.003770178],"study_design_scores_gemma":[0.000877435,0.00006178855,0.00180845,0.0001729389,0.00002166329,0.00122345,0.000951962,0.9672469,0.003496361,0.004306467,0.01912817,0.0007043349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1070618,0.001002402,0.683194,0.0003792027,0.0001282721,0.0004902708,0.0006138048,0.0007792322,0.206351],"genre_scores_gemma":[0.8104091,0.0001582796,0.1881329,0.0000445368,0.0001473041,0.0000340669,0.0003915194,0.00001754729,0.0006648385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9558734,"threshold_uncertainty_score":0.6010208,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006372010540183468,"gpt":0.2137477974590976,"spread":0.2073757869189141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000297485,0.0002138541,0.0002661712,0.0001425973,0.0001075634,0.00005840911,0.0002036399,0.0001967655,0.000002152141],"category_scores_gemma":[0.00001829909,0.0002272933,0.0001411065,0.0002281868,0.00005286586,0.00001199075,0.00008449367,0.00007043892,0.00002122393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001071754,"about_ca_system_score_gemma":0.0001559191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001284024,"about_ca_topic_score_gemma":0.000004935477,"domain_scores_codex":[0.9984874,0.0000327737,0.0006876716,0.0002297195,0.0002261164,0.0003363499],"domain_scores_gemma":[0.9991788,0.00002638874,0.0002287177,0.0002804428,0.0001777878,0.0001078869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007245557,0.00002621839,0.0002849411,0.00002972239,0.00007755297,0.000001567749,0.00004831103,0.9919142,0.0003234708,0.00008183955,0.0002538085,0.006951115],"study_design_scores_gemma":[0.001019461,0.00009013684,0.003627841,0.00005055978,0.00002899702,0.00006155221,0.00003791695,0.9936812,0.0002982384,0.0002630152,0.0005667099,0.0002743811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1660889,0.001004584,0.8321738,0.00001259977,0.0001536869,0.0004546144,0.00002277986,0.00002216092,0.0000667818],"genre_scores_gemma":[0.7483516,0.00002424074,0.2502464,0.0001081814,0.0004549262,0.00008886042,0.0006032869,0.0000364833,0.00008600853],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5822626,"threshold_uncertainty_score":0.9268753,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008611704137279384,"gpt":0.2177930570595161,"spread":0.2091813529222367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001120343,0.000127792,0.0001358611,0.000033583,0.000194703,0.0000613283,0.0001095683,0.0000635044,6.688314e-7],"category_scores_gemma":[0.000006256816,0.0001282778,0.00006951376,0.00004908568,0.00004184805,0.000002281049,0.0000450822,0.00002603058,0.00001947351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000265962,"about_ca_system_score_gemma":0.00003739624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006601412,"about_ca_topic_score_gemma":0.000002796921,"domain_scores_codex":[0.9991947,0.00001252963,0.0003687238,0.000133759,0.0001110142,0.0001792442],"domain_scores_gemma":[0.9994827,0.00002409396,0.0001570563,0.0001256098,0.0001771214,0.00003340952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005580199,0.00006633491,0.001356833,0.0003382916,0.0001165031,4.857387e-7,0.0001626569,0.8794706,0.09887825,0.01116822,0.007993059,0.0003929457],"study_design_scores_gemma":[0.002119673,0.0002839748,0.02676032,0.0000645648,0.00005805368,0.00005471357,0.0003815575,0.4814663,0.001279169,0.002843979,0.4838433,0.0008443717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1443464,0.001630558,0.8512841,0.0001019734,0.000270161,0.0005213174,0.0006480743,0.00001078292,0.001186651],"genre_scores_gemma":[0.968661,0.000009414029,0.02791338,0.00008349116,0.0004163064,0.00005639919,0.002562693,0.00001541758,0.0002819511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8243146,"threshold_uncertainty_score":0.5231015,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006305925403609124,"gpt":0.226584162535586,"spread":0.2202782371319769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001554813,0.0001823384,0.000163744,0.00007050048,0.0001245318,0.00008163159,0.0001599373,0.0001516497,0.00000426042],"category_scores_gemma":[0.0000146585,0.0001704592,0.00008647927,0.0001447343,0.00007540789,0.00000969004,0.00005023757,0.00006512876,0.00002464677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004383573,"about_ca_system_score_gemma":0.0001525017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004686568,"about_ca_topic_score_gemma":0.000007923333,"domain_scores_codex":[0.9987342,0.00004178141,0.0004985036,0.0001680962,0.0003263153,0.0002310815],"domain_scores_gemma":[0.9993292,0.00001700513,0.0002213385,0.0002155303,0.0001569805,0.00005990842],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004826399,0.00005668011,0.0008506662,0.0001612659,0.000043451,0.000004963654,0.0000210928,0.9767795,0.003721882,0.004373814,0.01338652,0.0005519292],"study_design_scores_gemma":[0.0008674105,0.0001127453,0.00257277,0.00004685646,0.00001373449,0.00003961939,0.00002263466,0.9821369,0.001096069,0.0006832118,0.01212981,0.0002782014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09396312,0.001033464,0.900757,0.00008300984,0.000446324,0.0006596806,0.000228442,0.0002137553,0.00261525],"genre_scores_gemma":[0.9650307,0.000003430719,0.03248848,0.0001748348,0.0002227705,0.00003564138,0.001853681,0.00001787143,0.0001726059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8710676,"threshold_uncertainty_score":0.6951122,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Voting; Motif (music); Computer science; Algorithm; Political science; Law; Art","retraction":null,"screen_n_in":null,"score":{"opus":0.02279755078358904,"gpt":0.2456455510294284,"spread":0.2228480002458394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002330768,0.0001232585,0.0001132118,0.0000287939,0.0004315082,0.00005685908,0.0002066873,0.00007775872,0.000001147936],"category_scores_gemma":[0.00003850439,0.00009421615,0.00008295454,0.00006542085,0.00005588739,0.000006478549,0.00007269083,0.00005233092,0.00001123241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002349521,"about_ca_system_score_gemma":0.0000930114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006663692,"about_ca_topic_score_gemma":0.000001514529,"domain_scores_codex":[0.9991357,0.00001287458,0.0003904031,0.0001125901,0.0001562263,0.0001922451],"domain_scores_gemma":[0.9993645,0.00008164479,0.0002044209,0.0001405504,0.0001654237,0.00004348288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001220046,0.00003387573,0.001242897,0.0002417536,0.0001503946,8.794475e-7,0.0006510768,0.9832806,0.0004899618,0.004331124,0.006922705,0.002642504],"study_design_scores_gemma":[0.0003562076,0.00006698002,0.0008386906,0.00001852995,0.00001065033,0.0001273761,0.0002654482,0.990518,0.00007270266,0.0001070542,0.007478049,0.0001402574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1069838,0.0003697339,0.8909046,0.00008897194,0.0003648057,0.0006758585,0.00008015533,0.00002087261,0.0005112208],"genre_scores_gemma":[0.9132903,0.00002728078,0.0853802,0.0001056229,0.000295831,0.00006728043,0.0004192663,0.00001988361,0.0003942832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8063066,"threshold_uncertainty_score":0.3842023,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007201058886584483,"gpt":0.2486894658346331,"spread":0.2414884069480486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001938188,0.0001009101,0.000122044,0.00006198667,0.00006363454,0.0000211095,0.0001264933,0.00004142392,0.000001860216],"category_scores_gemma":[0.00002780156,0.00006619511,0.00004088911,0.0001074797,0.00007536692,0.00001213868,0.00007466137,0.00007292537,6.922253e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002637092,"about_ca_system_score_gemma":0.00004066352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004420891,"about_ca_topic_score_gemma":0.00003983682,"domain_scores_codex":[0.9991641,0.0000182767,0.0004528847,0.00007640864,0.0001839084,0.0001044203],"domain_scores_gemma":[0.9991979,0.00003875432,0.0003965609,0.0001427845,0.0001995188,0.0000244645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001478764,0.00001029333,0.0004864322,0.0002296861,0.00008350196,2.485322e-7,0.0004904793,0.9815305,0.01393316,0.000360703,0.000008379649,0.002718769],"study_design_scores_gemma":[0.000558951,0.0003631277,0.003980962,0.0003837749,0.00002911964,0.0001572721,0.002946909,0.9209431,0.06990033,0.0001178223,0.0004023062,0.0002163265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.605655,0.00004720928,0.3935755,0.000008354979,0.0001418564,0.0002199693,0.00001393105,0.00000440991,0.0003337711],"genre_scores_gemma":[0.98927,8.421885e-7,0.01058672,0.000009876841,0.00004903319,0.000006304063,0.00004765958,0.000007129449,0.00002238576],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.383615,"threshold_uncertainty_score":0.2699358,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Linear programming; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01645098516990378,"gpt":0.2646623870308433,"spread":0.2482114018609395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001062738,0.0001429033,0.0001581519,0.0001897805,0.0001417572,0.0002241863,0.0004237147,0.00008894828,0.000001472998],"category_scores_gemma":[0.0002988545,0.000138388,0.00004518271,0.0004671019,0.00003353731,0.0003096517,0.0001056909,0.0001755255,0.0001115597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001568481,"about_ca_system_score_gemma":0.00010276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002055871,"about_ca_topic_score_gemma":4.244318e-7,"domain_scores_codex":[0.9981027,0.00002424664,0.0006108885,0.0001592911,0.000725653,0.0003772295],"domain_scores_gemma":[0.9980113,0.001097491,0.0001512203,0.0002531525,0.0003118654,0.0001749714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006180914,0.0004686188,0.05346213,0.001989865,0.0004703826,0.0001245067,0.007064698,0.5869015,0.0004108532,0.09606682,0.08666563,0.1663131],"study_design_scores_gemma":[0.0003530435,0.00009201481,0.004444407,0.00005623639,0.000002586095,0.0001172957,0.00009363853,0.9810699,0.0000575814,0.00006105046,0.01349988,0.0001523805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01367029,0.0001655693,0.9839866,0.00006697676,0.0007607614,0.0004134649,0.00002314908,0.0006138432,0.0002993429],"genre_scores_gemma":[0.7367633,0.000001460407,0.2628532,0.00004568474,0.0001227644,0.00001569647,0.00008555285,0.00001309303,0.00009924796],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.723093,"threshold_uncertainty_score":0.56433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}