{"meta":{"query_hash":"1d83937be232","filters":{"topic":"Genome Rearrangement Algorithms"},"cohort_total":311,"direct_labels_cover":0,"predictions_cover":311,"exported":311,"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/1d83937be232","api":"https://metacan.xera.ac/api/v1/cohort?topic=Genome+Rearrangement+Algorithms"},"results":[{"id":"W1008706668","doi":"10.1007/978-3-642-22616-8_24","title":"Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Regina","funders":"","keywords":"Substring; Partition (number theory); Combinatorics; Partition problem; Time complexity; Constant (computer programming); Mathematics; String (physics); Permutation (music); Discrete mathematics; Alphabet; Exponential function; Algorithm; Computer science; Data structure; Physics","score_opus":0.018606079698248366,"score_gpt":0.23697858803514674,"score_spread":0.21837250833689836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1008706668","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.003358784,0.0012741375,0.9930879,0.00022133865,0.00058268773,0.00092613447,0.000032277945,0.00001651776,0.0005002241],"genre_scores_gemma":[0.7502201,0.00074039557,0.23755692,0.0009928037,0.0061318083,0.0002044352,0.00034109768,0.00019409298,0.0036183363],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863833,0.000013368552,0.00022092134,0.0006156586,0.00019509853,0.00031664144],"domain_scores_gemma":[0.9993088,0.000055214903,0.00012557908,0.00037968735,0.00006993035,0.000060785864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003646941,0.00024741708,0.00019670025,0.000097423814,0.00017940499,0.00009861961,0.00047167664,0.00021399166,0.000015211062],"category_scores_gemma":[0.000012844203,0.0001956981,0.00007491976,0.000047568374,0.00039684534,0.00000842569,0.00039334284,0.00016689814,0.0000055594633],"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.000095056275,0.000040691113,0.00007412856,0.00006629042,0.0000847924,0.0000064179617,0.00037499273,0.0013139265,0.0612809,0.00016302838,0.00025927505,0.9362405],"study_design_scores_gemma":[0.008221543,0.0071405345,0.0018288967,0.0011339093,0.00059775723,0.00038995006,0.0000049714654,0.32431564,0.4050059,0.087538406,0.15761822,0.0062042684],"about_ca_topic_score_codex":0.000013688212,"about_ca_topic_score_gemma":0.000030363273,"teacher_disagreement_score":0.93003625,"about_ca_system_score_codex":0.000029126713,"about_ca_system_score_gemma":0.00008774471,"threshold_uncertainty_score":0.79803365},"labels":[],"label_agreement":null},{"id":"W102313747","doi":"","title":"The ABCs of MGR with DCJ.","year":2008,"lang":"en","type":"article","venue":"PubMed","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"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 Ottawa","funders":"","keywords":"Genome; Reciprocal; Computer science; Block (permutation group theory); Transposition (logic); Metric (unit); Computational biology; Algorithm; Theoretical computer science; Biology; Mathematics; Combinatorics; Genetics; Artificial intelligence; Gene","score_opus":0.011833454515721457,"score_gpt":0.17262762043061425,"score_spread":0.1607941659148928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102313747","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.9907012,0.0010780467,0.00024648852,0.00021957653,0.00006476282,0.00032124674,0.0000032411617,0.0000062177905,0.0073592463],"genre_scores_gemma":[0.99594647,0.00035797662,0.00018793435,0.000037049598,0.00008030511,0.00021214507,0.000008123119,0.00000931735,0.0031607023],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9995317,0.000014629128,0.00007645502,0.000106526975,0.00009684827,0.00017385917],"domain_scores_gemma":[0.9996518,0.0000056366925,0.000040445226,0.00022396246,0.000041442967,0.000036695663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010032794,0.000055987843,0.000053385374,0.000009995623,0.00006182293,0.0000041761036,0.00012792133,0.000031431755,0.0000021416079],"category_scores_gemma":[0.00002000035,0.000034547975,0.000028496672,0.00004987023,0.00010550809,8.2285385e-7,0.000036892143,0.00002703637,0.0000025790569],"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.0009930664,0.00055117416,0.20841047,0.000104152205,0.0014495689,0.000060281396,0.0005756995,0.0001986717,0.14649588,0.0008600337,0.04093295,0.59936804],"study_design_scores_gemma":[0.00083840045,0.0001335967,0.5823403,0.0000014849717,0.000019968105,0.00004871407,0.000056099365,0.0000063840457,0.1407505,0.000048342437,0.2755843,0.00017188997],"about_ca_topic_score_codex":0.000005333853,"about_ca_topic_score_gemma":0.000009418421,"teacher_disagreement_score":0.5991962,"about_ca_system_score_codex":0.0000040150285,"about_ca_system_score_gemma":0.000016671454,"threshold_uncertainty_score":0.14088255},"labels":[],"label_agreement":null},{"id":"W1149343824","doi":"10.71781/10745","title":"Algorithmes pour la réconciliation d’un arbre de gènes avec un arbre d’espèces","year":2010,"lang":"fr","type":"dissertation","venue":"","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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; Simon Fraser University","keywords":"Conciliation; Humanities; Philosophy; Political science; Mediation","score_opus":0.004293897053774764,"score_gpt":0.22859066492410285,"score_spread":0.2242967678703281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1149343824","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.9591552,0.008498376,0.006711455,0.0017028295,0.001815197,0.0008708259,0.00018426693,0.0000927741,0.020969098],"genre_scores_gemma":[0.77070004,0.0068475013,0.06282894,0.0007808352,0.003070266,0.000317934,0.011045721,0.0003174764,0.14409126],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965379,0.00029761906,0.00070992275,0.0011603874,0.00045324065,0.0008409332],"domain_scores_gemma":[0.99759877,0.00008895437,0.00050739344,0.0007468264,0.0007507149,0.00030736707],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006287411,0.0008812741,0.00058602914,0.00018542794,0.00030071262,0.00020777168,0.0006669347,0.0022225017,0.0011559703],"category_scores_gemma":[0.00029269097,0.0009086687,0.00039027142,0.00022056108,0.00015529449,0.00001832816,0.0001447804,0.0007687209,0.00026855845],"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.00010246482,0.0004257527,0.0044854963,0.00045040285,0.00087971636,0.000057214453,0.0021619727,0.00004696719,0.7931464,0.0007500614,0.0021145653,0.19537899],"study_design_scores_gemma":[0.0019466713,0.00038912994,0.021772258,0.00015308238,0.00062207755,0.00014734956,0.0047750007,0.0030512298,0.7960703,0.0013108393,0.16800997,0.0017521188],"about_ca_topic_score_codex":0.00029687246,"about_ca_topic_score_gemma":0.0007143897,"teacher_disagreement_score":0.19362688,"about_ca_system_score_codex":0.000091693306,"about_ca_system_score_gemma":0.00067193183,"threshold_uncertainty_score":0.9997571},"labels":[],"label_agreement":null},{"id":"W119766800","doi":"","title":"Combinators Introduction: An Algorithm.","year":2008,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Genome Rearrangement Algorithms","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Combinatory logic; Construct (python library); Computer science; Expression (computer science); Programming language; Algorithm; Theoretical computer science","score_opus":0.049336247204238785,"score_gpt":0.3432606209426702,"score_spread":0.2939243737384314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119766800","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.9859021,0.0010512435,0.0021364756,0.008722186,0.000812805,0.0006454513,0.000019495725,0.000059404087,0.0006508785],"genre_scores_gemma":[0.96109885,0.0030194502,0.0052485447,0.0011266216,0.013739903,0.00025369704,0.0004128089,0.000116806186,0.014983335],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99785614,0.00028633975,0.00015734119,0.00045731183,0.00066524115,0.00057761074],"domain_scores_gemma":[0.99847144,0.000021283218,0.000029527024,0.0008727378,0.0004494009,0.0001556128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014580084,0.00015069229,0.0001228313,0.000030533283,0.0008878947,0.000052217867,0.00061413477,0.00013957203,0.000110657355],"category_scores_gemma":[0.000056392833,0.00011441694,0.00016379729,0.00038882304,0.0006506476,0.000012623996,0.00032686614,0.00049934536,0.00010262703],"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.000057751764,0.0002899622,0.0022124546,0.000026702515,0.000279662,0.000014811356,0.0021528816,0.00008338886,0.14405234,0.0004085005,0.8391048,0.0113167465],"study_design_scores_gemma":[0.0014502156,0.001280845,0.0065538264,0.000005397792,0.000020474106,0.00014124362,0.0021092365,0.0022657712,0.093644656,0.0010692127,0.89094675,0.0005123812],"about_ca_topic_score_codex":0.000030145127,"about_ca_topic_score_gemma":0.0000035477913,"teacher_disagreement_score":0.05184195,"about_ca_system_score_codex":0.000057964473,"about_ca_system_score_gemma":0.00016110092,"threshold_uncertainty_score":0.6829058},"labels":[],"label_agreement":null},{"id":"W1481103812","doi":"10.1007/978-1-4471-5298-9_13","title":"The Potential of Family-Free Genome Comparison","year":2013,"lang":"en","type":"book-chapter","venue":"Computational biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University","funders":"","keywords":"Genome; Gene family; Computational biology; Comparative genomics; Genomics; Gene; Biology; Genetics; Evolutionary biology","score_opus":0.01648567117936326,"score_gpt":0.25078044032114155,"score_spread":0.2342947691417783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481103812","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0485604,0.0968184,0.105807684,0.0022777927,0.004829879,0.004047381,0.0024909985,0.0001240799,0.7350434],"genre_scores_gemma":[0.5165416,0.004025988,0.023543375,0.000818474,0.003665952,0.00013092329,0.019533053,0.00030344364,0.4314372],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988049,0.000038295006,0.0004360376,0.0003611781,0.00014881261,0.00021075644],"domain_scores_gemma":[0.99883527,0.00004766868,0.00033153,0.00044704447,0.00028617974,0.000052338037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012775286,0.00024389259,0.00029672257,0.0000596291,0.00010381682,0.000016027476,0.00059305277,0.00037456013,0.00012419873],"category_scores_gemma":[0.000024052537,0.00019302436,0.00017890902,0.000015770811,0.00037399662,0.0000012092673,0.0003992891,0.00015558359,0.00015629666],"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.0003897295,0.00022722573,0.00031187315,0.00019154877,0.004126152,0.000011266455,0.00009889084,0.019749917,0.44304818,0.36237875,0.092173696,0.07729275],"study_design_scores_gemma":[0.00090434216,0.0006876765,0.0030540305,0.000015397323,0.00008033758,0.0000180599,0.000024402552,0.0009394054,0.0003426772,0.123382024,0.87002736,0.00052430085],"about_ca_topic_score_codex":0.000005759771,"about_ca_topic_score_gemma":0.0000034236875,"teacher_disagreement_score":0.77785367,"about_ca_system_score_codex":0.000017571716,"about_ca_system_score_gemma":0.000103701095,"threshold_uncertainty_score":0.7871305},"labels":[],"label_agreement":null},{"id":"W1485855914","doi":"10.1007/978-3-540-74126-8_26","title":"Algorithms for the Extraction of Synteny Blocks from Comparative Maps","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":39,"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":"Synteny; Computer science; Extraction (chemistry); Computational biology; Biology; Chemistry; Chromatography; Genetics","score_opus":0.040882404148095255,"score_gpt":0.3036998917927222,"score_spread":0.262817487644627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485855914","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.0007929186,0.0021076559,0.99467707,0.00010406632,0.00085700845,0.0005697075,0.00008589672,0.000007853978,0.00079782004],"genre_scores_gemma":[0.45361245,0.0005177149,0.5390263,0.0008041878,0.0036082119,0.000057487505,0.00039684313,0.00009126791,0.0018855417],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984226,0.000011435407,0.0003047758,0.0006415224,0.00033983763,0.00027983132],"domain_scores_gemma":[0.9986614,0.0002604361,0.00023651932,0.00054606755,0.0002463913,0.000049187554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044670518,0.0002657937,0.0002832476,0.00014280854,0.00010940722,0.000042451484,0.0006892378,0.00026450094,0.000018260242],"category_scores_gemma":[0.000034957844,0.00020202606,0.00013000147,0.000098024095,0.00051453017,0.000005768325,0.0002233501,0.00024221285,0.0000032695161],"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.00016691853,0.00010144898,0.00012057909,0.000055805893,0.0003016983,0.000012091938,0.0008412543,0.022104908,0.13622107,0.00030376852,0.00035802514,0.83941245],"study_design_scores_gemma":[0.002393641,0.0019709382,0.0012949286,0.00056892,0.00027514203,0.00008086111,0.000015570708,0.19704786,0.63859653,0.04084923,0.11473981,0.0021665774],"about_ca_topic_score_codex":0.00003999847,"about_ca_topic_score_gemma":0.0001193122,"teacher_disagreement_score":0.8372459,"about_ca_system_score_codex":0.00004736462,"about_ca_system_score_gemma":0.00012613775,"threshold_uncertainty_score":0.82383835},"labels":[],"label_agreement":null},{"id":"W1491688952","doi":"10.1007/11851561_16","title":"A Unifying View of Genome Rearrangements","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":299,"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 à Montréal","funders":"","keywords":"Computer science; Concatenation (mathematics); Genome; Computation; Algorithm; Theoretical computer science; Variety (cybernetics); Combinatorics; Mathematics; Genetics; Artificial intelligence; Biology; Gene","score_opus":0.014550144280510205,"score_gpt":0.24045251684787694,"score_spread":0.22590237256736673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491688952","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.0034958746,0.0043777386,0.9801647,0.00006675951,0.00047362602,0.0005065313,0.000025925974,0.0000165699,0.010872256],"genre_scores_gemma":[0.76524454,0.0013601562,0.22351193,0.0009791068,0.00204115,0.000028817765,0.00041586527,0.00020248268,0.0062159714],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981253,0.000015972639,0.0003520056,0.0007370019,0.00042273878,0.00034695907],"domain_scores_gemma":[0.9989007,0.000016364722,0.0002023232,0.00067297096,0.00014804797,0.000059573413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037021737,0.0003000397,0.00031888465,0.00026972863,0.000061324776,0.00003990441,0.0007674781,0.00023398857,0.00003026161],"category_scores_gemma":[0.000017903249,0.0002921013,0.000107252825,0.00016120687,0.00037378678,0.000005426084,0.000497707,0.00019509307,0.00001127331],"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.000040513478,0.00012406931,0.00068074284,0.00051049836,0.00015106157,0.00006546071,0.0003061162,0.045707706,0.32439077,0.00031764063,0.00011901512,0.6275864],"study_design_scores_gemma":[0.008014134,0.0057700593,0.0105835,0.0043570846,0.0004657147,0.00035294742,0.0000039187353,0.038174745,0.2621462,0.061681233,0.5977661,0.010684385],"about_ca_topic_score_codex":0.000018897987,"about_ca_topic_score_gemma":0.000033585475,"teacher_disagreement_score":0.7617487,"about_ca_system_score_codex":0.00006076464,"about_ca_system_score_gemma":0.00016082762,"threshold_uncertainty_score":0.9999531},"labels":[],"label_agreement":null},{"id":"W1492180884","doi":"10.1007/11864127_3","title":"Inferring Positional Homologs with Common Intervals of Sequences","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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; Université du Québec à Montréal","funders":"","keywords":"Genome; Context (archaeology); Biology; Heuristic; Gene; Computational biology; Matching (statistics); Genetics; Computer science; Mathematics; Artificial intelligence","score_opus":0.010092628239256487,"score_gpt":0.236301468981617,"score_spread":0.2262088407423605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492180884","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.053611707,0.00090283214,0.9392349,0.00014310703,0.0002652036,0.0003014995,0.000029941339,0.000015059443,0.0054957327],"genre_scores_gemma":[0.9499982,0.000026331885,0.049167573,0.00018965437,0.0002389969,0.0000050836734,0.00008050845,0.000021784832,0.0002718946],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986532,0.000014805842,0.0002483777,0.00051892066,0.00033226368,0.00023243076],"domain_scores_gemma":[0.99925774,0.000029089775,0.00017235221,0.0003669896,0.00013350182,0.000040297928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021780995,0.00023399848,0.0002556561,0.00019642158,0.000053863783,0.000039088813,0.00055672636,0.00017928948,0.000013620711],"category_scores_gemma":[0.000008580858,0.0001962758,0.00006399826,0.0000961749,0.0006907448,0.000007036513,0.0003061094,0.00018772068,0.0000024746214],"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.0002003301,0.00029369575,0.021651462,0.00052773335,0.00036029407,0.00028785315,0.00060376636,0.28797778,0.30314746,0.0026480039,0.00023276694,0.38206887],"study_design_scores_gemma":[0.0040161777,0.010422826,0.028525095,0.004549537,0.00024287404,0.0014122564,0.0000029825424,0.03458249,0.787341,0.113360934,0.009747389,0.005796468],"about_ca_topic_score_codex":0.00004496575,"about_ca_topic_score_gemma":0.00013572346,"teacher_disagreement_score":0.89638644,"about_ca_system_score_codex":0.00004545809,"about_ca_system_score_gemma":0.00017266686,"threshold_uncertainty_score":0.80038947},"labels":[],"label_agreement":null},{"id":"W1495473427","doi":"10.1007/978-3-540-27801-6_29","title":"Reversal Distance without Hurdles and Fortresses","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":57,"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 à Montréal","funders":"","keywords":"Permutation (music); Fortress (chess); Simple (philosophy); Computer science; Algorithm; Tree (set theory); Value (mathematics); Combinatorics; Mathematics; Discrete mathematics; Artificial intelligence; Physics","score_opus":0.008796151040115455,"score_gpt":0.2313689773336902,"score_spread":0.22257282629357472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495473427","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.004308474,0.0034421098,0.9894617,0.00019493121,0.00039566768,0.00029121406,0.000016762957,0.000018200855,0.0018709231],"genre_scores_gemma":[0.86504287,0.00089893467,0.13135569,0.00051572896,0.00075786945,0.0000092634355,0.000049425336,0.00005852769,0.0013117238],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984738,0.000007017994,0.00017494983,0.0007824512,0.00026871642,0.00029301728],"domain_scores_gemma":[0.99929076,0.000016446324,0.00009771233,0.0004445058,0.00007127808,0.000079265286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015934467,0.00027675612,0.00022001307,0.000116298754,0.00009221324,0.00008636541,0.00042515516,0.00020221573,0.00001228133],"category_scores_gemma":[0.000029673754,0.00025387248,0.00004828545,0.00006904302,0.000603789,0.000007546402,0.00037460632,0.00018766384,0.000004124522],"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.00012819962,0.00011040846,0.0081772655,0.0005591525,0.0001692162,0.00017738865,0.0008826066,0.019479884,0.07051472,0.005610181,0.00015491407,0.89403605],"study_design_scores_gemma":[0.009193013,0.005244101,0.011554912,0.005571961,0.00035532875,0.0008620215,0.000006862424,0.017778264,0.23202541,0.44557202,0.2599252,0.011910943],"about_ca_topic_score_codex":0.000010388974,"about_ca_topic_score_gemma":0.00010098691,"teacher_disagreement_score":0.88212514,"about_ca_system_score_codex":0.00005362247,"about_ca_system_score_gemma":0.00018610846,"threshold_uncertainty_score":0.99999136},"labels":[],"label_agreement":null},{"id":"W1502442151","doi":"10.1007/11602613_74","title":"5-th Phylogenetic Root Construction for Strictly Chordal Graphs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"University of Alberta","funders":"","keywords":"Chordal graph; Pairwise comparison; Phylogenetic tree; Computer science; Closeness; Time complexity; Theoretical computer science; Combinatorics; Graph; Block graph; Split graph; Discrete mathematics; Mathematics; Artificial intelligence; 1-planar graph; Biology","score_opus":0.00968951747809062,"score_gpt":0.23126863811776857,"score_spread":0.22157912063967794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502442151","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.0064811916,0.0015298222,0.98859006,0.00012307664,0.0013014573,0.0006886577,0.00003824396,0.000021064254,0.0012264354],"genre_scores_gemma":[0.43039683,0.0005060232,0.5622807,0.0008844512,0.003955147,0.000075130396,0.0002737108,0.00014190887,0.0014860771],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979988,0.000012320437,0.0002851263,0.00095286604,0.0003179211,0.00043299762],"domain_scores_gemma":[0.99900156,0.000032169257,0.00015998469,0.00053887226,0.00017169333,0.00009570403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002482073,0.00035158204,0.00026274627,0.00030377758,0.00012612724,0.00008554242,0.00063306,0.0003382325,0.000019801453],"category_scores_gemma":[0.00003310749,0.0003472528,0.00014348282,0.00014669444,0.0004859049,0.00000585977,0.00023921243,0.00021074015,0.000007029463],"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.000033318007,0.00003437579,0.00045071123,0.000049313185,0.00005519207,0.0000048514157,0.000056367353,0.012042479,0.03846559,0.0007902339,0.00007073203,0.94794685],"study_design_scores_gemma":[0.007732497,0.0066713253,0.0052471627,0.00066816126,0.00036838985,0.0006603297,0.0000025454387,0.06764212,0.3686423,0.20115554,0.3336332,0.0075764055],"about_ca_topic_score_codex":0.0000036514152,"about_ca_topic_score_gemma":0.0000727917,"teacher_disagreement_score":0.94037044,"about_ca_system_score_codex":0.000069804686,"about_ca_system_score_gemma":0.00022489895,"threshold_uncertainty_score":0.99989796},"labels":[],"label_agreement":null},{"id":"W1511447460","doi":"10.1007/978-3-540-85557-6_14","title":"Tests for Gene Clusters Satisfying the Generalized Adjacency Criterion","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"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":"Adjacency list; Genome; Adjacency matrix; Combinatorics; Cluster (spacecraft); Null (SQL); Function (biology); Chromosome; Gene; Mathematics; Biology; Genetics; Computer science; Graph; Data mining","score_opus":0.023707234926744526,"score_gpt":0.26401631227597455,"score_spread":0.24030907734923002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511447460","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.0051279357,0.0038543458,0.98825324,0.00046626249,0.0010318905,0.0008700025,0.00002277269,0.000020287705,0.00035323857],"genre_scores_gemma":[0.23774132,0.004461941,0.7440207,0.005663329,0.0048028994,0.00016840172,0.00036175837,0.00023053736,0.0025491088],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980571,0.000023089604,0.00029972437,0.0008446597,0.0003392529,0.0004361624],"domain_scores_gemma":[0.9988332,0.00006145236,0.00015955002,0.0007154859,0.00015770584,0.00007262302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034731845,0.00034573776,0.00025349343,0.00015374746,0.00027459493,0.000074366304,0.0008632381,0.0002538375,0.00000894384],"category_scores_gemma":[0.00006422713,0.00026787174,0.00014524323,0.00010806346,0.0004379571,0.000007442303,0.00043002804,0.00020363108,0.0000053796393],"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.00009105198,0.00004760215,0.00030674902,0.00013154696,0.00013011628,0.00003855899,0.0010743617,0.03162557,0.21982825,0.00010695246,0.001205317,0.74541396],"study_design_scores_gemma":[0.009097875,0.0044364175,0.003418942,0.0012116153,0.0003493152,0.0013783647,0.0000038539406,0.2803301,0.31287012,0.027136903,0.35171035,0.008056142],"about_ca_topic_score_codex":0.0000109172315,"about_ca_topic_score_gemma":0.000051632756,"teacher_disagreement_score":0.7373578,"about_ca_system_score_codex":0.000075368116,"about_ca_system_score_gemma":0.00020860934,"threshold_uncertainty_score":0.99997735},"labels":[],"label_agreement":null},{"id":"W1517201934","doi":"10.1142/s0218195911003561","title":"COMPUTING SIGNED PERMUTATIONS OF POLYGONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Polygon (computer graphics); Combinatorics; Rectilinear polygon; Rectangle; Enhanced Data Rates for GSM Evolution; Simple polygon; Mathematics; Polygon covering; Visibility polygon; Star-shaped polygon; Equiangular polygon; Algorithm; Computer science; Monotone polygon; Regular polygon; Geometry; Artificial intelligence; Convex set","score_opus":0.015814733847699006,"score_gpt":0.27821978918652956,"score_spread":0.2624050553388306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517201934","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.18526746,0.00043308627,0.8115398,0.00015605967,0.00020656642,0.00022950608,0.00007143951,0.00000837412,0.002087653],"genre_scores_gemma":[0.93655926,0.000026342786,0.06263036,0.00009695805,0.0004304362,0.00001534256,0.00014103971,0.000016690716,0.000083574625],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99854845,0.00003955825,0.0006330035,0.00016606203,0.00048590044,0.00012705299],"domain_scores_gemma":[0.99752825,0.000063629675,0.0006106057,0.00014142305,0.0015687275,0.000087344764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025958935,0.000121367484,0.00016226275,0.00039798638,0.000063237814,0.00002040864,0.0005639723,0.00006417846,0.0001204177],"category_scores_gemma":[0.00004901339,0.00012676719,0.00018315579,0.00028953393,0.00010672635,0.000017050641,0.00010105641,0.00010222236,0.000017061177],"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.0011196543,0.007403952,0.07492093,0.00021137379,0.009231525,0.000066591034,0.0037849436,0.18199694,0.30867314,0.088108845,0.0051831948,0.31929892],"study_design_scores_gemma":[0.013779966,0.0035937766,0.44333938,0.00034471304,0.0009654349,0.0028880155,0.004352817,0.009435817,0.19455972,0.15959923,0.16427901,0.002862127],"about_ca_topic_score_codex":0.0000068251243,"about_ca_topic_score_gemma":0.000001271027,"teacher_disagreement_score":0.7512918,"about_ca_system_score_codex":0.000032203734,"about_ca_system_score_gemma":0.0001837938,"threshold_uncertainty_score":0.5169416},"labels":[],"label_agreement":null},{"id":"W1519555383","doi":"10.1007/978-3-642-16181-0_3","title":"Advances on Genome Duplication Distances","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"Université de Montréal","funders":"","keywords":"Genome; Gene duplication; Tree (set theory); Phylogenetic tree; Computer science; Gene rearrangement; Node (physics); Combinatorics; Computational biology; Biology; Gene; Mathematics; Genetics; Physics","score_opus":0.007667278432481175,"score_gpt":0.236859674641153,"score_spread":0.22919239620867185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519555383","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.0020929002,0.0023431294,0.9833624,0.00028646915,0.00093321817,0.0003940013,0.000018400899,0.00002435051,0.010545168],"genre_scores_gemma":[0.79745275,0.0034416553,0.18844631,0.0019955274,0.004533745,0.00006656499,0.00037612332,0.00015100803,0.0035362835],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983086,0.000007791981,0.00019516473,0.00086523115,0.0003381463,0.00028505168],"domain_scores_gemma":[0.99897915,0.000025012043,0.00013984142,0.00068892376,0.00009624033,0.00007085859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021313128,0.0002728114,0.00018569076,0.00015872497,0.00011453542,0.00007328201,0.0007489163,0.00025792676,0.000025795702],"category_scores_gemma":[0.000029676741,0.0002443678,0.00006599075,0.00009320144,0.00044189824,0.000007887155,0.00021495912,0.0003233718,0.000033006978],"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.00002669056,0.000036795973,0.00008264679,0.00004332112,0.000013922768,0.000008684005,0.00008519169,0.005135009,0.18419556,0.0007935967,0.00000593925,0.80957264],"study_design_scores_gemma":[0.00098783,0.0017519778,0.0017567038,0.00031057856,0.00003715751,0.00005485814,6.371037e-7,0.0040093814,0.20516783,0.09240792,0.6909055,0.002609628],"about_ca_topic_score_codex":0.0000016783227,"about_ca_topic_score_gemma":0.00006641534,"teacher_disagreement_score":0.806963,"about_ca_system_score_codex":0.00004559318,"about_ca_system_score_gemma":0.00010689472,"threshold_uncertainty_score":0.996503},"labels":[],"label_agreement":null},{"id":"W1523916760","doi":"10.1007/978-3-642-02882-3_27","title":"On the Generalised Character Compatibility Problem for Non-branching Character Trees","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University","funders":"","keywords":"Branching (polymer chemistry); Combinatorics; Mathematics; Character (mathematics); Tree (set theory); Character evolution; Computer science; Discrete mathematics; Phylogenetics; Biology","score_opus":0.01523903294797201,"score_gpt":0.24026576026952226,"score_spread":0.22502672732155024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523916760","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.0687799,0.00023636023,0.92154574,0.0028105231,0.0011045587,0.0030474789,0.000086542146,0.000040430336,0.002348467],"genre_scores_gemma":[0.9130249,0.00007745897,0.07158992,0.009379378,0.0031854224,0.000118117576,0.00036250497,0.00011326105,0.0021490632],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99764496,0.00003300272,0.0003586002,0.001089422,0.00038968818,0.00048430383],"domain_scores_gemma":[0.9984663,0.00012794981,0.00022319132,0.0009417918,0.00016059123,0.00008013857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075806316,0.00044940657,0.00036120962,0.00015619175,0.00021892019,0.00016791365,0.0009883831,0.0002792001,0.000023462511],"category_scores_gemma":[0.00005307097,0.00031518957,0.00019584983,0.000093484574,0.0002941637,0.0000112065045,0.00022209472,0.00036931725,0.00001149877],"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.00019188756,0.00019529474,0.00029488016,0.00012853973,0.000113291775,0.000011081923,0.0007199646,0.0077855177,0.20677842,0.0013475575,0.0004101141,0.78202343],"study_design_scores_gemma":[0.0075262613,0.008041008,0.029517531,0.002447254,0.00024509843,0.000096397496,0.000001979662,0.24599263,0.3597427,0.21622434,0.121942155,0.008222638],"about_ca_topic_score_codex":0.0000047874328,"about_ca_topic_score_gemma":0.00004946745,"teacher_disagreement_score":0.8499558,"about_ca_system_score_codex":0.000075664204,"about_ca_system_score_gemma":0.0001425015,"threshold_uncertainty_score":0.99993},"labels":[],"label_agreement":null},{"id":"W1525672419","doi":"10.1007/978-3-540-87989-3_17","title":"On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université du Québec à Montréal","funders":"","keywords":"Reuse; Breakpoint; Genome; Computer science; Set (abstract data type); Human genome; Computational biology; Theoretical computer science; Algorithm; Chromosomal translocation; Biology; Genetics; Programming language; Gene","score_opus":0.013107243622082966,"score_gpt":0.23316020105837743,"score_spread":0.22005295743629447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525672419","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.11109138,0.0039838115,0.8622942,0.005006817,0.0031596906,0.0030656445,0.000027850518,0.000090913876,0.0112797],"genre_scores_gemma":[0.96475816,0.00088149565,0.027335994,0.004414591,0.0012746656,0.00001938828,0.00006482011,0.00011129654,0.0011395823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975712,0.00006116918,0.00037863615,0.0010228091,0.00045512812,0.0005110663],"domain_scores_gemma":[0.99820244,0.000104786384,0.00017447468,0.0013455183,0.00009831364,0.000074478994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008750668,0.00039695366,0.00029705928,0.0002846792,0.000181694,0.00008877276,0.0014925578,0.0002458507,0.000015947096],"category_scores_gemma":[0.00013156494,0.00030373677,0.000129455,0.00020864204,0.00048777094,0.000005487253,0.0010311687,0.00054736616,0.000030965697],"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.00017086757,0.00023920003,0.0005012972,0.00011268843,0.00014099416,0.00044206277,0.00320576,0.37491903,0.03590695,0.0005210801,0.0018510467,0.58198905],"study_design_scores_gemma":[0.015084623,0.0098285675,0.026853234,0.0073300116,0.00022264522,0.0011382841,0.000016194184,0.50878346,0.11529995,0.07799886,0.22384705,0.013597098],"about_ca_topic_score_codex":0.000032095915,"about_ca_topic_score_gemma":0.00014379168,"teacher_disagreement_score":0.8536668,"about_ca_system_score_codex":0.00015182827,"about_ca_system_score_gemma":0.000209197,"threshold_uncertainty_score":0.99994147},"labels":[],"label_agreement":null},{"id":"W1547622250","doi":"10.1007/3-540-45123-4_20","title":"Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":79,"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; Université du Québec à Montréal","funders":"","keywords":"Genome; Sorting; Heuristic; Computer science; Time complexity; Algorithm; Gene rearrangement; Gene; Computational biology; Genetics; Biology; Artificial intelligence","score_opus":0.008509472042093532,"score_gpt":0.22101751444506404,"score_spread":0.2125080424029705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547622250","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.09332209,0.011977187,0.8840691,0.00065192184,0.00063232915,0.0016194038,0.00027589747,0.000038303657,0.0074137673],"genre_scores_gemma":[0.89674586,0.007816749,0.086944394,0.0015396323,0.0006348061,0.00004919004,0.0005893912,0.00012910424,0.0055508763],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845344,0.000018258124,0.00030122988,0.00065441785,0.00030799594,0.0002646515],"domain_scores_gemma":[0.9991936,0.000015274127,0.00013555321,0.0004760781,0.00009694956,0.00008250863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002455346,0.00024846557,0.00026257077,0.0001897455,0.00008324164,0.0000400818,0.00039795248,0.00020221317,0.00006128867],"category_scores_gemma":[0.000015084127,0.00024839822,0.000061232226,0.00009941789,0.00044126427,0.0000068154827,0.00025141943,0.00015542208,0.0000072107064],"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.00004802117,0.00010903464,0.00035123824,0.00010149715,0.00013566227,0.000013780144,0.00034642793,0.002645162,0.75567156,0.00007309538,0.00024848274,0.24025603],"study_design_scores_gemma":[0.009605277,0.0072934856,0.011650668,0.002111816,0.0005338963,0.0003469124,0.000008449167,0.00870876,0.35034016,0.047277197,0.5542598,0.007863596],"about_ca_topic_score_codex":0.000018279161,"about_ca_topic_score_gemma":0.00001868663,"teacher_disagreement_score":0.80342376,"about_ca_system_score_codex":0.000047357888,"about_ca_system_score_gemma":0.00009632368,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W155408510","doi":"10.1007/978-1-4471-5298-9_3","title":"How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree","year":2013,"lang":"en","type":"book-chapter","venue":"Computational biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal","funders":"","keywords":"Tree (set theory); Phylogenetics; Maximum parsimony; Evolutionary biology; Phylogenetic tree; Computer science; Dynamic programming; Theoretical computer science; Genetic programming; Biology; Artificial intelligence; Algorithm; Mathematics; Combinatorics; Genetics; Clade; Gene","score_opus":0.01091562138572523,"score_gpt":0.25148409101264113,"score_spread":0.24056846962691592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155408510","genre_codex":"empirical","genre_gemma":"other","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.46031934,0.12557177,0.19546579,0.017271452,0.0077661867,0.021117643,0.015617888,0.0011913391,0.1556786],"genre_scores_gemma":[0.37454763,0.0005603924,0.08965193,0.0020639722,0.0023624355,0.00042252112,0.10061384,0.0003450094,0.42943227],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99830043,0.000043038974,0.00025720158,0.0008235633,0.00017311248,0.00040262818],"domain_scores_gemma":[0.9990848,0.000020727137,0.0001725869,0.0003193695,0.00020754874,0.00019498343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000070630806,0.00043312158,0.00032553935,0.00013588453,0.000099149365,0.000070593516,0.00036525808,0.0006059245,0.0001338086],"category_scores_gemma":[0.000017187751,0.0004322424,0.0001470554,0.00003596079,0.00019006434,0.000010355897,0.0002008664,0.00021929105,0.00008767814],"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.0005692714,0.00076809636,0.003541147,0.00032346955,0.0037244994,0.00006475809,0.0002851922,0.008813783,0.30967617,0.03881872,0.15393867,0.4794762],"study_design_scores_gemma":[0.00058785605,0.0012732389,0.013694897,0.000019985582,0.00005531803,0.000037644124,0.000012775361,0.00031233762,0.00006180366,0.010981504,0.97202903,0.0009335891],"about_ca_topic_score_codex":0.000009955883,"about_ca_topic_score_gemma":0.00002450089,"teacher_disagreement_score":0.8180904,"about_ca_system_score_codex":0.00008101023,"about_ca_system_score_gemma":0.00012165722,"threshold_uncertainty_score":0.99981296},"labels":[],"label_agreement":null},{"id":"W1555413501","doi":"10.1007/11758525_105","title":"Genomes Containing Duplicates Are Hard to Compare","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"Université du Québec à Montréal","funders":"","keywords":"Permutation (music); Computer science; Genome; Similarity (geometry); Theoretical computer science; Time complexity; Matching (statistics); Computational complexity theory; Combinatorics; Algorithm; Gene; Mathematics; Artificial intelligence; Biology; Genetics; Image (mathematics); Physics","score_opus":0.016468274548295338,"score_gpt":0.24031357721880658,"score_spread":0.22384530267051125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555413501","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.009392522,0.0031404563,0.9813578,0.0006439447,0.00065581716,0.0007181359,0.000047509435,0.000050370352,0.0039934595],"genre_scores_gemma":[0.8893575,0.00009276121,0.103645064,0.0022212008,0.0016405567,0.000034838973,0.00019182521,0.000102867634,0.0027133727],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767727,0.000013147649,0.00030627093,0.0011221827,0.0003772289,0.00050388346],"domain_scores_gemma":[0.9987366,0.000032467677,0.00016680654,0.00073988957,0.0001844388,0.00013979945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002605049,0.00040602422,0.000386214,0.00028666452,0.00013418846,0.00014388129,0.0009681029,0.00016900516,0.00002295839],"category_scores_gemma":[0.000027989452,0.0003962314,0.00010600529,0.00015648699,0.00027721605,0.000005606747,0.0006702749,0.00025074882,0.00005154346],"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.00013779239,0.00015178871,0.021593839,0.00025206938,0.00020793531,0.00021306284,0.0007752209,0.2244108,0.11464871,0.00055221264,0.003565908,0.6334907],"study_design_scores_gemma":[0.0037253771,0.0032057723,0.038527247,0.0019955272,0.00017927168,0.0003043822,0.000009158663,0.042361762,0.16061042,0.023135982,0.7165744,0.009370725],"about_ca_topic_score_codex":0.000022076358,"about_ca_topic_score_gemma":0.00014887571,"teacher_disagreement_score":0.879965,"about_ca_system_score_codex":0.000100527956,"about_ca_system_score_gemma":0.00013944972,"threshold_uncertainty_score":0.99984896},"labels":[],"label_agreement":null},{"id":"W1566359724","doi":"10.1007/978-3-540-87361-7_3","title":"Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":38,"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":"Breakpoint; Computer science; Speedup; Combinatorics; Vertex (graph theory); Matching (statistics); Genome; Class (philosophy); Graph; Algorithm; Theoretical computer science; Mathematics; Biology; Parallel computing; Artificial intelligence; Genetics","score_opus":0.012956138607874562,"score_gpt":0.22348722683795594,"score_spread":0.21053108823008138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566359724","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.0052321623,0.0022917045,0.9866392,0.0034047097,0.000389963,0.0009640007,0.000071922106,0.000019176614,0.0009871569],"genre_scores_gemma":[0.82257795,0.0010449636,0.1751253,0.0006645126,0.00027556714,0.000033614346,0.000070958056,0.000036964168,0.00017016877],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99868554,0.000020039268,0.00022892888,0.0005304183,0.00024778867,0.00028729226],"domain_scores_gemma":[0.99912965,0.000058800626,0.00009535186,0.00049493846,0.00012174288,0.0000995047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002590895,0.00021001413,0.00018888024,0.00021922891,0.00020573862,0.000032719985,0.00051118655,0.0001411504,0.000008034641],"category_scores_gemma":[0.000030178424,0.0001628291,0.000077806464,0.00015906658,0.00047669397,0.0000050402837,0.0004702457,0.00017541036,0.0000039281663],"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.000048919388,0.00016102781,0.00061919104,0.000114504866,0.00017669595,0.000027037462,0.0027104025,0.031539943,0.15132652,0.00070136273,0.0012616266,0.81131274],"study_design_scores_gemma":[0.008738092,0.011619189,0.027655194,0.0032721623,0.0005265855,0.0032682063,0.000021743852,0.1552,0.3515679,0.19712187,0.23046967,0.010539384],"about_ca_topic_score_codex":0.000033623317,"about_ca_topic_score_gemma":0.00040974852,"teacher_disagreement_score":0.8173458,"about_ca_system_score_codex":0.000032813325,"about_ca_system_score_gemma":0.00013667758,"threshold_uncertainty_score":0.6639978},"labels":[],"label_agreement":null},{"id":"W1567305107","doi":"10.1007/978-3-540-87989-3_12","title":"Perfect DCJ Rearrangement","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"Simon Fraser University","funders":"","keywords":"Sorting; Computer science; Combinatorics; Separable space; Join (topology); Mathematics; Algorithm","score_opus":0.01316899368788779,"score_gpt":0.23074670507428532,"score_spread":0.21757771138639753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567305107","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.005473274,0.0050996174,0.96095973,0.00039866674,0.0017008566,0.00085111556,0.000020091886,0.000054816705,0.025441814],"genre_scores_gemma":[0.63528764,0.0084084105,0.31183758,0.005098387,0.008775671,0.00009667071,0.00046032944,0.0004513787,0.029583931],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997704,0.000018147215,0.00026305404,0.0010407761,0.00051514764,0.00045885312],"domain_scores_gemma":[0.9987938,0.000021769481,0.00011762729,0.0008306589,0.00012603676,0.00011014485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003179805,0.0003818597,0.0002834275,0.00025828803,0.00014147538,0.00006416211,0.00081980927,0.00029746597,0.000096149706],"category_scores_gemma":[0.000034292727,0.0003609965,0.00013309185,0.00012752129,0.00048956607,0.000005582451,0.00055774715,0.0003069086,0.00006362097],"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.000040468683,0.00007364237,0.00033260838,0.0000787173,0.00009392738,0.00015439364,0.00044754962,0.009373872,0.05248424,0.0000957673,0.0011874813,0.93563735],"study_design_scores_gemma":[0.0028594888,0.0032865962,0.00206503,0.0007047189,0.000103214676,0.00068581,0.0000011244929,0.017807031,0.08443515,0.0077028284,0.8755788,0.004770186],"about_ca_topic_score_codex":0.000009294293,"about_ca_topic_score_gemma":0.00003550317,"teacher_disagreement_score":0.93086714,"about_ca_system_score_codex":0.00009899928,"about_ca_system_score_gemma":0.00024262586,"threshold_uncertainty_score":0.9998842},"labels":[],"label_agreement":null},{"id":"W1572811950","doi":"10.1007/978-3-642-13122-6_35","title":"O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"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":"Substring; Lexicographical order; Prefix; Combinatorics; Computer science; Data structure; Time complexity; Sequence (biology); Algorithm; Integer (computer science); Mathematics; Discrete mathematics","score_opus":0.00744540385288891,"score_gpt":0.22579290033619848,"score_spread":0.21834749648330956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572811950","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.13559617,0.004160875,0.84767514,0.0011389581,0.0023042082,0.0021721988,0.00010228945,0.0001147453,0.0067353924],"genre_scores_gemma":[0.70664644,0.00053908856,0.27498177,0.002405673,0.0030629241,0.000060449413,0.0005227933,0.0002989155,0.011481966],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974723,0.000026182834,0.00042149308,0.0011220131,0.00040519677,0.00055284356],"domain_scores_gemma":[0.99876666,0.000042387044,0.00022674976,0.00074464665,0.000104553554,0.00011501042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005585314,0.0004067796,0.00037318995,0.00026256553,0.00009132285,0.00011736966,0.0009962982,0.0005999956,0.00006118401],"category_scores_gemma":[0.00010737466,0.00040315435,0.00009847181,0.00018026667,0.00054750394,0.00001003624,0.0005920704,0.0006990533,0.000029136852],"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.00002481369,0.000057353027,0.0002884355,0.00005113631,0.000025283065,0.000039529295,0.0001994486,0.0031633375,0.8874263,0.00002046843,0.00011974644,0.10858413],"study_design_scores_gemma":[0.0060849404,0.0033214032,0.001248374,0.0021237577,0.00014635055,0.0002751103,0.0000032498274,0.087870754,0.64371556,0.019724393,0.22729357,0.008192552],"about_ca_topic_score_codex":0.000033585984,"about_ca_topic_score_gemma":0.000119115524,"teacher_disagreement_score":0.5726934,"about_ca_system_score_codex":0.00008897196,"about_ca_system_score_gemma":0.00022072744,"threshold_uncertainty_score":0.99984205},"labels":[],"label_agreement":null},{"id":"W1573866825","doi":"10.1007/11554714_11","title":"Power Boosts for Cluster Tests","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Adjacency list; Computer science; Cluster (spacecraft); Genome; Component (thermodynamics); Similarity (geometry); Adjacency matrix; Theoretical computer science; Data mining; Algorithm; Artificial intelligence; Gene; Biology; Genetics; Physics; Graph","score_opus":0.010156003267830276,"score_gpt":0.24898815828261486,"score_spread":0.23883215501478458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573866825","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.0010675003,0.0012485187,0.9899429,0.00057121686,0.0009049555,0.0007545453,0.000024910067,0.000021763104,0.0054636933],"genre_scores_gemma":[0.36368752,0.00027070407,0.60338753,0.008520094,0.0056953817,0.00009572315,0.00025512982,0.00026231713,0.017825618],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99805063,0.000008967264,0.00025259284,0.0009257744,0.0003068451,0.0004551811],"domain_scores_gemma":[0.9989194,0.000051047566,0.00011692721,0.0006521301,0.00016429948,0.00009616227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033823473,0.00034153622,0.0002454895,0.00019885239,0.00009181783,0.00008918777,0.0007407688,0.00034640898,0.000041281244],"category_scores_gemma":[0.00006113248,0.00031880333,0.00012952105,0.00007531381,0.00029618922,0.0000070133337,0.00043157616,0.00020194081,0.000026854703],"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.00010294017,0.00010586172,0.0003089196,0.00011521049,0.0001041222,0.000017120148,0.0003491269,0.016559416,0.046678953,0.00058849546,0.0018242316,0.9332456],"study_design_scores_gemma":[0.0033154706,0.0025637483,0.0009494656,0.00048495122,0.000068645684,0.00018329905,5.263336e-7,0.027152045,0.059036974,0.027728684,0.87505937,0.0034568184],"about_ca_topic_score_codex":0.000001286926,"about_ca_topic_score_gemma":0.00003939764,"teacher_disagreement_score":0.92978877,"about_ca_system_score_codex":0.00007542602,"about_ca_system_score_gemma":0.00019251269,"threshold_uncertainty_score":0.9999264},"labels":[],"label_agreement":null},{"id":"W1573898492","doi":"","title":"Hybridization Number on Three Trees","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Genome Rearrangement Algorithms","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":"Dalhousie University","funders":"","keywords":"Phylogenetic tree; Phylogenetic network; Combinatorics; Connection (principal bundle); Mathematics; Binary logarithm; Generalization; Binary tree; Tree (set theory); Time complexity; Computer science; Algorithm; Biology; Genetics","score_opus":0.039151945137849316,"score_gpt":0.18439937988421504,"score_spread":0.14524743474636573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573898492","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.92180645,0.00003609589,0.06570779,0.00003991526,0.00034845885,0.00026798013,0.000029778847,0.000043368924,0.011720134],"genre_scores_gemma":[0.9947541,0.00019628946,0.0001877534,0.00008789889,0.0003218014,0.0000014781552,0.00039091602,0.00003741251,0.004022381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987262,0.00006707942,0.000120064025,0.0007866392,0.00006589392,0.00023410583],"domain_scores_gemma":[0.99887544,0.0000097869,0.00013489176,0.0007909949,0.00009714939,0.00009175357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001159248,0.00026568072,0.00019315648,0.00006745268,0.00007087289,0.000029438406,0.00042593788,0.00030961251,0.00011273013],"category_scores_gemma":[0.000026082198,0.00030857493,0.00017213337,0.00009646899,0.00006616235,0.0000028241545,0.00050357403,0.00020420359,0.00032865794],"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.00064809824,0.00073593616,0.11408637,0.0003476072,0.0014163766,0.00021605514,0.000090020745,0.8137868,0.02364695,0.020945221,0.018735843,0.0053446996],"study_design_scores_gemma":[0.014066614,0.0029541824,0.13601457,0.0008902588,0.00218758,0.00006026973,0.00031670128,0.3293108,0.095450096,0.09384321,0.31396657,0.010939147],"about_ca_topic_score_codex":0.00003282791,"about_ca_topic_score_gemma":0.000090788584,"teacher_disagreement_score":0.48447603,"about_ca_system_score_codex":0.00005170245,"about_ca_system_score_gemma":0.000059755555,"threshold_uncertainty_score":0.99993664},"labels":[],"label_agreement":null},{"id":"W1574973644","doi":"10.1007/11554714_12","title":"Reversals of Fortune","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Ottawa","funders":"","keywords":"Heuristics; Genome; Computer science; Identification (biology); Function (biology); Genetic algorithm; Algorithm; Theoretical computer science; Computational biology; Genetics; Gene; Biology; Machine learning","score_opus":0.012446387697355045,"score_gpt":0.2390927382497082,"score_spread":0.22664635055235316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574973644","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.0019973428,0.0020699813,0.98704326,0.00024295147,0.0005495492,0.00033957118,0.000017894432,0.000012338138,0.0077270824],"genre_scores_gemma":[0.55908024,0.0011462315,0.4258855,0.0015093724,0.0028809942,0.000012935677,0.00012589312,0.00012311661,0.009235673],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985939,0.000007825498,0.00025666342,0.0005724731,0.000314304,0.00025480802],"domain_scores_gemma":[0.99907917,0.000019107045,0.0001533788,0.00057321973,0.000115969706,0.00005917712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028629784,0.00021922651,0.00024340507,0.00018166499,0.00003447206,0.000020972891,0.00062071125,0.00023196396,0.00004355416],"category_scores_gemma":[0.00003215234,0.00020807088,0.00009330676,0.00008905826,0.00035518763,0.0000041845524,0.0003689103,0.00015975127,0.000009897123],"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.000021509963,0.00004008461,0.00020456174,0.00007936824,0.000052109608,0.00001532932,0.0001355867,0.00901339,0.09238313,0.00044532106,0.00016971167,0.8974399],"study_design_scores_gemma":[0.00259132,0.002540547,0.0012232213,0.0010896851,0.00012955039,0.00017810267,9.913385e-7,0.019802216,0.6360103,0.044745084,0.28816962,0.0035194021],"about_ca_topic_score_codex":0.0000047812473,"about_ca_topic_score_gemma":0.000032292923,"teacher_disagreement_score":0.8939205,"about_ca_system_score_codex":0.000038739334,"about_ca_system_score_gemma":0.00017063796,"threshold_uncertainty_score":0.8484884},"labels":[],"label_agreement":null},{"id":"W1582188219","doi":"10.1007/978-3-540-32290-0_9","title":"Estimators of Translocations and Inversions in Comparative Maps","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"Kempe Foundation; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Estimator; Divergence (linguistics); Chromosome; Chromosomal translocation; Genome; Evolutionary biology; Biology; Genetics; Mathematics; Statistics; Gene","score_opus":0.01789364534163833,"score_gpt":0.2580672836086085,"score_spread":0.24017363826697014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582188219","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.03572612,0.002745946,0.9564541,0.0005969055,0.00028085033,0.00065345626,0.00004432424,0.000011433422,0.0034868426],"genre_scores_gemma":[0.9008233,0.00019318875,0.098471515,0.00017744013,0.00010540601,0.000005796926,0.00004116591,0.000013800223,0.00016842128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904054,0.000011511575,0.00020062139,0.00042087666,0.00016169633,0.0001647234],"domain_scores_gemma":[0.9995262,0.000030131161,0.000073918345,0.00025748493,0.00006190983,0.000050354945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015226676,0.00016555225,0.00020762431,0.0002538124,0.000039540486,0.00001613226,0.00028718676,0.0001447678,0.000008560677],"category_scores_gemma":[0.000011727115,0.00016276805,0.000034573437,0.00012904675,0.0004978667,0.0000056359336,0.00013958362,0.00015744168,0.0000022712572],"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.000099984674,0.0003609087,0.0076184305,0.0003598364,0.00016762404,0.000036723253,0.009299005,0.22480674,0.11430619,0.004061411,0.0003237873,0.63855934],"study_design_scores_gemma":[0.0101776505,0.004086815,0.023715986,0.003609671,0.00026824963,0.00029415858,0.00004397791,0.41900533,0.36565346,0.103200294,0.06257344,0.0073709874],"about_ca_topic_score_codex":0.000010047584,"about_ca_topic_score_gemma":0.00024208042,"teacher_disagreement_score":0.86509717,"about_ca_system_score_codex":0.000030503375,"about_ca_system_score_gemma":0.00014290829,"threshold_uncertainty_score":0.66374886},"labels":[],"label_agreement":null},{"id":"W1588532374","doi":"10.1007/3-540-44696-6_13","title":"Experiments in Computing Sequences of Reversals","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science","score_opus":0.01973155574191111,"score_gpt":0.27214244194327114,"score_spread":0.25241088620136004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588532374","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.08137863,0.0044352994,0.90423965,0.00012503934,0.00095011457,0.00059925305,0.000010476173,0.000018193747,0.008243323],"genre_scores_gemma":[0.9273123,0.000233468,0.07147622,0.00024138614,0.0003388922,0.0000030212052,0.000022775503,0.000029453506,0.00034244955],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99832296,0.000020185844,0.00034185202,0.0006669308,0.00033449818,0.00031355413],"domain_scores_gemma":[0.99923253,0.000029257595,0.00018212931,0.00042383152,0.00008271247,0.00004952232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003964063,0.00024154216,0.00029204207,0.00026344453,0.000037176953,0.000028996243,0.0006684877,0.0002176167,0.000022898268],"category_scores_gemma":[0.000029426257,0.00023750991,0.000065692,0.0001591788,0.00037959858,0.0000059659133,0.0004228283,0.00018990482,0.000004589883],"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.00004246956,0.0001234929,0.005001231,0.00015778697,0.00005678095,0.00017024379,0.0013678119,0.062465306,0.4811076,0.00028281938,0.00004482697,0.44917962],"study_design_scores_gemma":[0.0024202333,0.0015743421,0.0017017452,0.0021540022,0.00003479649,0.0001819936,0.000007908651,0.034430075,0.9248598,0.01887229,0.011075435,0.0026873762],"about_ca_topic_score_codex":0.000031150674,"about_ca_topic_score_gemma":0.000038858656,"teacher_disagreement_score":0.8459337,"about_ca_system_score_codex":0.00006901484,"about_ca_system_score_gemma":0.00015702937,"threshold_uncertainty_score":0.96853733},"labels":[],"label_agreement":null},{"id":"W1593332677","doi":"10.1109/ipdps.2003.1213270","title":"Proximity and priority: applying a gene expression algorithm to the Traveling Salesperson Problem","year":2004,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","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 Waterloo","funders":"","keywords":"Crossover; Permutation (music); Representation (politics); Computer science; Computation; Genome; Algorithm; Expression (computer science); Travelling salesman problem; Evolutionary computation; Genetic algorithm; Gene; Theoretical computer science; Artificial intelligence; Biology; Genetics; Machine learning","score_opus":0.010563891377206964,"score_gpt":0.2332207865363063,"score_spread":0.22265689515909934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593332677","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.69230604,0.0009281299,0.30306038,0.0010896719,0.000088094734,0.0017545563,0.000011483215,0.000041014297,0.00072060345],"genre_scores_gemma":[0.59737223,0.00019468868,0.40059438,0.0004613785,0.00040958333,0.00026856593,0.000039075723,0.000037196984,0.0006229178],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99901116,0.000027090771,0.0001436413,0.0003931609,0.00016097899,0.00026396243],"domain_scores_gemma":[0.9995361,0.0000039364218,0.0000364101,0.00027143414,0.000046239136,0.000105906875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025596732,0.00015290556,0.00010658694,0.000024926572,0.00016408168,0.000053397267,0.0001580031,0.00008975057,0.000006243723],"category_scores_gemma":[0.000015614507,0.00010668976,0.000042594056,0.00008977274,0.000032570828,0.0000048854486,0.00017945778,0.00008471279,0.000012069316],"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.000013614881,0.000037161666,0.00019960583,0.000015333377,0.000019711286,0.0000021397518,0.00038612142,0.00012515314,0.93387145,0.000018779976,0.00006927402,0.06524165],"study_design_scores_gemma":[0.0011506147,0.00027287123,0.001108016,0.000036033798,0.00002301601,0.00004615884,0.0005725224,0.00022008881,0.9739717,0.00024024141,0.022013927,0.000344791],"about_ca_topic_score_codex":0.000036999863,"about_ca_topic_score_gemma":0.000026929249,"teacher_disagreement_score":0.097533986,"about_ca_system_score_codex":0.000021372596,"about_ca_system_score_gemma":0.000043750562,"threshold_uncertainty_score":0.4350682},"labels":[],"label_agreement":null},{"id":"W1596946737","doi":"10.1007/11864127_10","title":"Ordering Partially Assembled Genomes Using Gene Arrangements","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"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":"Contig; Genome; Impossibility; Breakpoint; Set (abstract data type); Computational biology; Graph; Biology; Bacterial genome size; Combinatorics; Computer science; Genetics; Theoretical computer science; Gene; Mathematics; Chromosome","score_opus":0.01878770852273043,"score_gpt":0.24987256945730052,"score_spread":0.2310848609345701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596946737","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.018231642,0.002056089,0.9764796,0.000046811943,0.0008059851,0.00040344376,0.000008748141,0.000025619654,0.0019420615],"genre_scores_gemma":[0.5594789,0.00037938857,0.43379197,0.0007582364,0.003449203,0.000021996217,0.00018261377,0.00020253606,0.0017351868],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975495,0.000018553099,0.00035845634,0.0010346984,0.00047975345,0.0005590536],"domain_scores_gemma":[0.9988827,0.000015625039,0.00018835653,0.0006769111,0.00014459186,0.00009178508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034992615,0.00042408073,0.00032735764,0.00027772583,0.00015353125,0.00014732021,0.0007687055,0.00028780347,0.000025849182],"category_scores_gemma":[0.000016226524,0.0004322488,0.000113960756,0.00015875665,0.00019262992,0.000010286685,0.00060537463,0.00022994315,0.00001309962],"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.000020129073,0.00005091157,0.0011338748,0.00006744618,0.00009337061,0.000070641276,0.00007815672,0.2380958,0.59843826,0.000031429427,0.000049896742,0.16187006],"study_design_scores_gemma":[0.003268407,0.0011495424,0.0014977853,0.000665012,0.00023088475,0.00022303493,9.0107164e-7,0.30658418,0.6064283,0.011883413,0.0627768,0.005291694],"about_ca_topic_score_codex":0.00002120769,"about_ca_topic_score_gemma":0.00009266713,"teacher_disagreement_score":0.54268765,"about_ca_system_score_codex":0.0001258973,"about_ca_system_score_gemma":0.00026786333,"threshold_uncertainty_score":0.9998129},"labels":[],"label_agreement":null},{"id":"W1600987055","doi":"10.1007/978-3-540-73437-6_15","title":"A New and Faster Method of Sorting by Transpositions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"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; Université du Québec à Montréal","funders":"","keywords":"Transposition (logic); Sorting; Computer science; Computation; Algorithm; Time complexity; Combinatorics; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.01470070926883479,"score_gpt":0.27258271131568046,"score_spread":0.2578820020468457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600987055","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.00045954375,0.0011789766,0.99656105,0.000090294074,0.00011691973,0.00015322985,0.000011365972,0.0000052156192,0.0014233863],"genre_scores_gemma":[0.031317957,0.00010817008,0.96682423,0.0003982654,0.00029919558,0.0000018047419,0.000038299913,0.000030094378,0.0009819627],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988381,0.000010036111,0.00023058346,0.0004953433,0.00020686068,0.00021903693],"domain_scores_gemma":[0.99946076,0.00003301971,0.00010760588,0.00026127967,0.000059090627,0.00007823847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031660259,0.0001841954,0.00019404895,0.0001484399,0.000044390905,0.000027601905,0.0002775825,0.00019533306,0.00001504498],"category_scores_gemma":[0.00001127529,0.00017645914,0.00005572062,0.000082417886,0.00017844053,0.000004289495,0.0001313029,0.00015647711,9.94484e-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.000009438409,0.000009386873,0.00007125949,0.00003477374,0.000022877603,0.0000039390193,0.0002129075,0.000730905,0.19060996,0.00011621937,0.000029466637,0.80814886],"study_design_scores_gemma":[0.0022164462,0.0017002195,0.00058017,0.0007720364,0.00016559257,0.00025617515,0.0000025211843,0.018635035,0.916168,0.03222631,0.025030648,0.0022468616],"about_ca_topic_score_codex":0.000015071176,"about_ca_topic_score_gemma":0.000037044698,"teacher_disagreement_score":0.805902,"about_ca_system_score_codex":0.000015629179,"about_ca_system_score_gemma":0.00009715653,"threshold_uncertainty_score":0.7195795},"labels":[],"label_agreement":null},{"id":"W1601291018","doi":"10.1007/11758525_106","title":"Rearrangement of Noisy Genomes","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Robustness (evolution); Computer science; Genome; Noise (video); Suite; Artificial intelligence; Algorithm; Data mining; Computational biology; Gene; Genetics; Biology; Image (mathematics)","score_opus":0.009750910708447025,"score_gpt":0.22532813072869187,"score_spread":0.21557722002024485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601291018","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.004876201,0.0049058613,0.97126865,0.00016883378,0.00076892856,0.0005582384,0.000032860655,0.00001957653,0.01740085],"genre_scores_gemma":[0.72869426,0.0011124181,0.25483766,0.00089780515,0.0029138348,0.000031261505,0.00034852294,0.0001903131,0.0109739145],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99816096,0.000011896219,0.00032881252,0.0007307311,0.00043720152,0.00033039722],"domain_scores_gemma":[0.9988967,0.000018255152,0.00018570312,0.0006926207,0.00014867647,0.00005800091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031618576,0.00029383448,0.00029479375,0.00026426133,0.000052286567,0.00003528884,0.0007150625,0.00023474946,0.00003547362],"category_scores_gemma":[0.000014492456,0.0002790875,0.00011404328,0.00012002108,0.00044071933,0.0000040544965,0.00045279454,0.0001726184,0.000011664354],"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.000040130042,0.000114289636,0.0011141828,0.00021499977,0.000112292175,0.000042699372,0.00021215284,0.036563363,0.24398233,0.00043867482,0.0007162199,0.71644866],"study_design_scores_gemma":[0.0038932886,0.0038590035,0.005320653,0.0011300346,0.0002185009,0.00014328067,0.0000017808366,0.02232333,0.53918487,0.047881965,0.37066892,0.0053744186],"about_ca_topic_score_codex":0.00001891621,"about_ca_topic_score_gemma":0.000051108986,"teacher_disagreement_score":0.72381806,"about_ca_system_score_codex":0.00006016685,"about_ca_system_score_gemma":0.00017095011,"threshold_uncertainty_score":0.99996614},"labels":[],"label_agreement":null},{"id":"W1602467868","doi":"10.1007/978-3-540-74960-8_13","title":"Parts of the Problem of Polyploids in Rearrangement Phylogeny","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Genome; Phylogenetics; Genetic algorithm; Set (abstract data type); Event (particle physics); Evolutionary biology; Biology; Genomics; Computer science; Computational biology; Genetics; Gene; Physics","score_opus":0.015478037939288045,"score_gpt":0.24257665979103657,"score_spread":0.22709862185174853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602467868","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.1127241,0.007672845,0.8517787,0.0005553531,0.0015097281,0.0031345491,0.0000621487,0.000021815342,0.022540765],"genre_scores_gemma":[0.94849193,0.00013548808,0.050402403,0.00023045125,0.00022492828,0.000007536965,0.00001063627,0.000030506528,0.00046613356],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998358,0.000020309235,0.00039238876,0.0005036391,0.00043418875,0.00029146264],"domain_scores_gemma":[0.9989654,0.00002300352,0.00023565981,0.0006237559,0.00011489378,0.000037289086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006073967,0.00021656645,0.00026237732,0.00022243055,0.000029508596,0.000011216096,0.0008189405,0.00021414387,0.000011822327],"category_scores_gemma":[0.000016404954,0.00016591573,0.00012451556,0.00022128403,0.0005400715,0.0000030848107,0.00052850123,0.00020403657,0.0000011959858],"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.000059573325,0.00015574064,0.0061027138,0.0002865845,0.0000817727,0.000013547387,0.00074991287,0.016976362,0.46667987,0.00069873786,0.000039068902,0.5081561],"study_design_scores_gemma":[0.0020481823,0.0014763164,0.018309092,0.0015837428,0.00007228156,0.000040509156,0.0000031614666,0.003065412,0.92690283,0.024231622,0.02075013,0.0015166887],"about_ca_topic_score_codex":0.000029070909,"about_ca_topic_score_gemma":0.00023140534,"teacher_disagreement_score":0.8357678,"about_ca_system_score_codex":0.00004764201,"about_ca_system_score_gemma":0.00017848235,"threshold_uncertainty_score":0.6765847},"labels":[],"label_agreement":null},{"id":"W1603144785","doi":"10.1016/j.tcs.2009.09.008","title":"A new linear time algorithm to compute the genomic distance via the double cut and join distance","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","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":"Université du Québec à Montréal","funders":"Bundesministerium für Bildung und Forschung; Alexander von Humboldt-Stiftung","keywords":"Join (topology); Algorithm; Edit distance; Simple (philosophy); Computer science; Time complexity; Genome; Tree (set theory); Mathematics; Combinatorics; Biology; Genetics","score_opus":0.005246742315466484,"score_gpt":0.2288864844595042,"score_spread":0.22363974214403773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603144785","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.036693618,0.00029269088,0.9579825,0.003919294,0.00014988834,0.0003849361,0.000005057766,0.000023697809,0.0005483337],"genre_scores_gemma":[0.87088305,0.000031631724,0.12562838,0.0023814524,0.0007026976,0.0000072391304,0.0000063974344,0.000015814037,0.00034335552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840164,0.000055303713,0.00018731585,0.0005738956,0.00032194637,0.00045992457],"domain_scores_gemma":[0.9989237,0.000030621693,0.000046409725,0.0006843881,0.000076637334,0.00023824726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000655079,0.00019130396,0.00015387546,0.00003008409,0.00039988136,0.00018621604,0.0011123583,0.000044736003,0.000018156516],"category_scores_gemma":[0.000011927278,0.00011381205,0.000051789528,0.0003513922,0.001079267,0.000010366101,0.0005036612,0.00012953857,0.00006555853],"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.0002489899,0.00013170061,0.00006968416,0.000009968219,0.000049328024,0.000015195387,0.0010750323,0.0013096292,0.1644535,0.21985547,0.0032459374,0.6095356],"study_design_scores_gemma":[0.0025797877,0.002530795,0.010716347,0.000069732116,0.00007100099,0.0002381806,0.000033995297,0.7986152,0.05214871,0.053565647,0.07795575,0.0014748515],"about_ca_topic_score_codex":0.0000045378297,"about_ca_topic_score_gemma":0.0000022908441,"teacher_disagreement_score":0.8341894,"about_ca_system_score_codex":0.00002399731,"about_ca_system_score_gemma":0.0000712475,"threshold_uncertainty_score":0.46411207},"labels":[],"label_agreement":null},{"id":"W161985688","doi":"","title":"Genome rearrangement and planning","year":2005,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Institute for Cancer Research","funders":"","keywords":"Genome; Biology; Gene rearrangement; Gene; Computational biology; Computer science; Evolutionary biology; Genetics","score_opus":0.011510178865094532,"score_gpt":0.24461602214522862,"score_spread":0.2331058432801341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161985688","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.97475976,0.0019452947,0.0020031647,0.0003325507,0.000036561585,0.00011804576,0.0000021586113,0.000016382932,0.02078608],"genre_scores_gemma":[0.98586464,0.00016266645,0.008011919,0.00032239835,0.00042087067,0.000010986233,0.00003346531,0.000013237469,0.005159813],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995047,0.000009556017,0.00008139082,0.00018949455,0.000065362365,0.00014948544],"domain_scores_gemma":[0.99975806,0.0000015724123,0.000017308674,0.000146287,0.000020049956,0.000056704805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087796,0.00007717531,0.000055200362,0.00002513941,0.00003811244,0.000016821637,0.00006306185,0.00004216049,0.0000983359],"category_scores_gemma":[0.0000074990076,0.00007099779,0.000019977095,0.000025660067,0.00002166628,0.0000017747881,0.00007916097,0.000027392634,0.00003545714],"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.000012215589,0.000022759146,0.0031988914,0.0000066618622,0.00004097729,0.0000017059417,0.00010089521,0.000101365935,0.98525035,0.000042434818,0.0011679797,0.010053768],"study_design_scores_gemma":[0.00081309193,0.00018588151,0.047715485,0.0000047799927,0.000016613241,0.00001916198,0.00024682508,0.00015148101,0.054597456,0.000032884527,0.89591473,0.00030160815],"about_ca_topic_score_codex":0.0000024114058,"about_ca_topic_score_gemma":0.0000042936663,"teacher_disagreement_score":0.9306529,"about_ca_system_score_codex":0.0000064948877,"about_ca_system_score_gemma":0.0000072888834,"threshold_uncertainty_score":0.2895206},"labels":[],"label_agreement":null},{"id":"W1803070299","doi":"10.1007/11533719_8","title":"Genome Rearrangements with Partially Ordered Chromosomes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"University of Ottawa","funders":"","keywords":"Directed acyclic graph; Genome; Computer science; Graph; Directed graph; Chromosome; Computational biology; Biology; Genetics; Combinatorics; Algorithm; Mathematics; Theoretical computer science; Gene","score_opus":0.010500122973351131,"score_gpt":0.22572770314688861,"score_spread":0.2152275801735375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803070299","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.011330068,0.0026833527,0.97424775,0.0005378051,0.00060656865,0.0010546807,0.00003303029,0.000060119797,0.00944663],"genre_scores_gemma":[0.6888515,0.0012345286,0.29072207,0.0022761798,0.005137501,0.000075218864,0.00045488743,0.0003021274,0.010946008],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997486,0.000016344458,0.00028697177,0.001108387,0.00056182995,0.00054046174],"domain_scores_gemma":[0.99869186,0.000014490635,0.00016368428,0.00083765446,0.000163303,0.00012900075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002745019,0.0004395279,0.00032558668,0.00023349911,0.00011988224,0.0001186645,0.00088865496,0.00026915615,0.000114897375],"category_scores_gemma":[0.000017001843,0.00037812686,0.000078437464,0.0001616451,0.00047975173,0.000010961766,0.0004458711,0.00026844774,0.000047417543],"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.00019327411,0.0001947462,0.0010381043,0.00016160616,0.0003772373,0.00022270124,0.00060564507,0.06429526,0.21303481,0.0002050614,0.0000873711,0.71958417],"study_design_scores_gemma":[0.010780507,0.009809269,0.013685383,0.0016388063,0.0004248549,0.00075577985,0.000003765587,0.021156384,0.14548305,0.013392786,0.7715594,0.011310026],"about_ca_topic_score_codex":0.0000061439086,"about_ca_topic_score_gemma":0.00021672658,"teacher_disagreement_score":0.77147204,"about_ca_system_score_codex":0.00009526909,"about_ca_system_score_gemma":0.00032541336,"threshold_uncertainty_score":0.9998671},"labels":[],"label_agreement":null},{"id":"W1844128133","doi":"10.1007/978-3-540-74960-8_8","title":"Evolution of Tandemly Arrayed Genes in Multiple Species","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal","funders":"","keywords":"Genome; Gene duplication; Computer science; Gene; Tandem repeat; Cluster (spacecraft); Computational biology; Tandem exon duplication; Evolutionary biology; Biology; Genetics","score_opus":0.021166589576194796,"score_gpt":0.23917021410800543,"score_spread":0.21800362453181063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844128133","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.020332018,0.0021674063,0.97467256,0.00002966211,0.0004968404,0.00029862596,0.000010848581,0.0000087631315,0.0019833],"genre_scores_gemma":[0.931106,0.00023568457,0.06736698,0.00008345104,0.0005596502,0.0000038830294,0.000032123855,0.00002883285,0.00058344495],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983966,0.000013308397,0.00032309964,0.00060429994,0.00034719627,0.0003154961],"domain_scores_gemma":[0.9992016,0.00003933088,0.00015142707,0.00043289727,0.00012564707,0.000049111695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044076346,0.0002376208,0.0002590324,0.00040190955,0.00004139409,0.000022376815,0.00051500293,0.00028196647,0.000019927136],"category_scores_gemma":[0.000056035136,0.00023076126,0.00007768679,0.0001912493,0.00046171664,0.000005798411,0.00026637243,0.00019286647,0.00000549661],"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.000090488895,0.00010468779,0.019585919,0.00012759259,0.000042942203,0.000038420527,0.0003471523,0.047177065,0.631661,0.0006352712,0.00002405495,0.3001654],"study_design_scores_gemma":[0.0043936144,0.0020218685,0.058063805,0.0011025368,0.000060181872,0.000106089334,0.000008470718,0.077682346,0.776188,0.031762026,0.045135263,0.0034757748],"about_ca_topic_score_codex":0.000030160443,"about_ca_topic_score_gemma":0.00056120695,"teacher_disagreement_score":0.91077393,"about_ca_system_score_codex":0.00013478765,"about_ca_system_score_gemma":0.00018753417,"threshold_uncertainty_score":0.9410171},"labels":[],"label_agreement":null},{"id":"W1844928675","doi":"10.1186/1471-2148-4-3","title":"A scale invariant clustering of genes on human chromosome 7","year":2004,"lang":"en","type":"article","venue":"BMC Evolutionary Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ottawa Regional Cancer Foundation","funders":"","keywords":"Biology; Genetics; Chromosome; Gene; Gene duplication; Evolutionary biology","score_opus":0.026088664922495505,"score_gpt":0.2761915056756228,"score_spread":0.2501028407531273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844928675","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.9876474,0.0010848772,0.009631612,0.00010375777,0.0001851857,0.00022559337,0.000051303818,0.000018723567,0.0010515375],"genre_scores_gemma":[0.99015445,0.00007542084,0.008809315,0.00006889893,0.00029694894,0.000030429646,0.0003129679,0.000017037357,0.00023452334],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99907595,0.00006050657,0.00022582781,0.0003337386,0.00006995286,0.00023403886],"domain_scores_gemma":[0.9994853,0.000007619754,0.000087726476,0.00031447032,0.000053524927,0.000051326868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106323416,0.00013908897,0.00016039256,0.000076514625,0.000081631806,0.0000029238886,0.00019522886,0.00017088137,0.000043166572],"category_scores_gemma":[0.000018743833,0.00011854463,0.00009014168,0.00007816192,0.0001586145,0.0000024546132,0.00015958604,0.00005491213,0.000031824748],"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.00004855181,0.0001317592,0.01341009,0.000024396748,0.00003537742,0.0000013879958,0.000018525487,0.0011944207,0.9840379,0.0006784697,0.00008208277,0.00033707675],"study_design_scores_gemma":[0.0072972863,0.00714266,0.31155053,0.00013585544,0.00008406079,0.0002484105,0.00021756068,0.0004319287,0.63372415,0.00890918,0.028922794,0.0013356021],"about_ca_topic_score_codex":0.000059636874,"about_ca_topic_score_gemma":0.000102100166,"teacher_disagreement_score":0.35031372,"about_ca_system_score_codex":0.000040583887,"about_ca_system_score_gemma":0.00008753224,"threshold_uncertainty_score":0.48341098},"labels":[],"label_agreement":null},{"id":"W1854090516","doi":"10.1186/1471-2164-16-s5-s6","title":"ProCARs: Progressive Reconstruction of Ancestral Gene Orders","year":2015,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":18,"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":"Université de Sherbrooke","keywords":"Contiguity; Homology (biology); Biology; Python (programming language); Genome; Computational biology; Extant taxon; Evolutionary biology; Gene; Computer science; Genetics","score_opus":0.03145233856405392,"score_gpt":0.25872161265236143,"score_spread":0.22726927408830752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854090516","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.9958092,0.0010246775,0.0020967468,0.000016645303,0.00022594877,0.00027730293,0.000013885206,0.000009044124,0.00052654603],"genre_scores_gemma":[0.9369637,0.00006953792,0.062360182,0.00001905469,0.00028081398,0.000027774418,0.00008539877,0.000022670769,0.00017087426],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993126,0.000026451016,0.00017955572,0.00022107834,0.00009104826,0.00016929854],"domain_scores_gemma":[0.99942464,0.0000020335556,0.00013197261,0.00022338219,0.00014029066,0.0000776762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012395205,0.000104118924,0.000111928624,0.00003314606,0.00001951432,0.000010625588,0.00013246053,0.00009143198,0.0000055190117],"category_scores_gemma":[0.000038487837,0.000106146246,0.000052824005,0.00006520391,0.00008632176,0.0000035505864,0.00005688757,0.000038431594,0.000008748213],"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.00021606934,0.00010609602,0.039500568,0.00007220195,0.00012190163,0.000002804182,0.00033666607,0.0013876047,0.9386198,0.000041462223,0.0007577586,0.018837087],"study_design_scores_gemma":[0.0018531439,0.0007231694,0.0031890408,0.000015114155,0.00004860336,0.0001272223,0.00094053213,0.00039420996,0.9804079,0.0004488087,0.011472824,0.00037944177],"about_ca_topic_score_codex":0.0000101162295,"about_ca_topic_score_gemma":0.000019598829,"teacher_disagreement_score":0.060263436,"about_ca_system_score_codex":0.000029441118,"about_ca_system_score_gemma":0.000258738,"threshold_uncertainty_score":0.43285182},"labels":[],"label_agreement":null},{"id":"W1879935290","doi":"10.1186/1471-2105-6-139","title":"PentaPlot: A software tool for the illustration of genome mosaicism","year":2005,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Aeronautics and Space Administration; National Science Foundation","keywords":"Computational biology; DNA microarray; Software; Genome; Computer science; Biology; Genetics; Bioinformatics; Programming language; Gene; Gene expression","score_opus":0.019939113460943753,"score_gpt":0.2429802835424754,"score_spread":0.22304117008153163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1879935290","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.05948031,0.0005754248,0.93830705,0.00014716346,0.00010601243,0.00095172896,0.00012219287,0.000019306484,0.00029080603],"genre_scores_gemma":[0.17729406,0.00030969075,0.8184295,0.0004931279,0.0006472489,0.00016324845,0.00070100476,0.00004225766,0.0019198116],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992899,0.000008350525,0.0003189042,0.0000840643,0.00012926321,0.00016952644],"domain_scores_gemma":[0.99939483,0.000026553056,0.00014649233,0.00031165354,0.000094117706,0.000026373627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020647896,0.000106281565,0.00009584231,0.000026552087,0.00007412861,0.000021470554,0.00020606395,0.0000836772,0.000019651023],"category_scores_gemma":[0.00007439833,0.0000784809,0.000100818615,0.000055425804,0.000050826948,0.00000981664,0.000062992614,0.000036409605,0.000018619632],"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.0009940023,0.0010390116,0.011610475,0.0038624208,0.0015855709,8.1555703e-7,0.009041198,0.15622577,0.27563888,0.0035535793,0.03948302,0.49696526],"study_design_scores_gemma":[0.0043815863,0.0011677304,0.013010682,0.000040297873,0.00028032405,0.000036857524,0.0018882555,0.2956067,0.062008277,0.00020313646,0.6203979,0.0009782471],"about_ca_topic_score_codex":0.0000016419032,"about_ca_topic_score_gemma":0.000014823623,"teacher_disagreement_score":0.5809149,"about_ca_system_score_codex":0.000013623373,"about_ca_system_score_gemma":0.000060566537,"threshold_uncertainty_score":0.32003585},"labels":[],"label_agreement":null},{"id":"W1886146870","doi":"10.1016/j.tcs.2015.09.007","title":"Successor rules for flipping pancakes and burnt pancakes","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"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 Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Successor cardinal; Sequence (biology); Stack (abstract data type); Combinatorics; Mathematics; Minification; Simple (philosophy); Discrete mathematics; Algorithm; Computer science; Mathematical optimization; Mathematical analysis","score_opus":0.018123366519930503,"score_gpt":0.2678905162861136,"score_spread":0.24976714976618308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886146870","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.7009838,0.00032952407,0.29747662,0.0003455292,0.00020621513,0.00018276137,0.000006015472,0.000017640787,0.0004518898],"genre_scores_gemma":[0.94373524,0.000017145758,0.055729914,0.00017026378,0.00029319798,0.000014958534,0.000008176675,0.0000090342655,0.00002205334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998904,0.000028032537,0.00012445234,0.0004111867,0.00020442289,0.00032794074],"domain_scores_gemma":[0.9993267,0.000026322003,0.00003236602,0.000247401,0.0001631907,0.00020400497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070954935,0.00011529029,0.00011703961,0.000044546592,0.00013922804,0.00011557645,0.0003600003,0.000046445744,0.0000041025364],"category_scores_gemma":[0.0000763167,0.00009363162,0.00003220622,0.000100741025,0.0012646089,0.000009953702,0.00029603337,0.000040602674,0.00000643463],"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.00018199426,0.00015631528,0.0033086252,0.00008807092,0.0000547639,0.0000068821537,0.00085275027,0.00017900467,0.2235088,0.6242378,0.0007618293,0.14666319],"study_design_scores_gemma":[0.006501995,0.00609757,0.021618353,0.00017033519,0.0001277608,0.00022009529,0.0004717096,0.22039202,0.3912117,0.30424923,0.04631921,0.0026200346],"about_ca_topic_score_codex":0.0000012387737,"about_ca_topic_score_gemma":6.130628e-7,"teacher_disagreement_score":0.31998855,"about_ca_system_score_codex":0.000011817837,"about_ca_system_score_gemma":0.00006149353,"threshold_uncertainty_score":0.46595043},"labels":[],"label_agreement":null},{"id":"W188669452","doi":"","title":"Determining a permutation from its set of reductions.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Set (abstract data type); Combinatorics; Computer science; Programming language","score_opus":0.014844619276884742,"score_gpt":0.2667212119536093,"score_spread":0.2518765926767246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188669452","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.9979571,0.00029267813,0.0001865431,0.000029988396,0.0006304936,0.00009956344,0.0000124397075,0.000009552608,0.00078160106],"genre_scores_gemma":[0.9986705,0.000029674808,0.00091654254,0.000016681744,0.000042071824,0.0000049405,0.00013321909,0.000013679742,0.00017269167],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993746,0.000020681584,0.00017430838,0.00018144646,0.00010890031,0.00014004635],"domain_scores_gemma":[0.99957806,0.0000124811895,0.00008402475,0.0001889234,0.00009252618,0.000043998443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017487939,0.000079980804,0.000087299246,0.000042477604,0.000037608832,0.000007093844,0.000102014725,0.00008155594,0.000023441462],"category_scores_gemma":[0.000056665496,0.00008895084,0.000044441545,0.00008767058,0.000027225142,0.000003714125,0.000045713394,0.000044355715,0.000013173824],"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.000024114237,0.000039204948,0.0045761294,0.00000880659,0.000057436755,0.0000034353059,0.00027051807,0.000009544932,0.9887641,0.0010776257,0.0003397135,0.0048293816],"study_design_scores_gemma":[0.0010138158,0.0002574016,0.028555628,0.000016265612,0.000035604484,0.000007474056,0.0004325481,0.000074972115,0.9580636,0.006751471,0.0045913267,0.00019988863],"about_ca_topic_score_codex":0.000012431467,"about_ca_topic_score_gemma":0.0000044999697,"teacher_disagreement_score":0.030700484,"about_ca_system_score_codex":0.000013230608,"about_ca_system_score_gemma":0.00002637648,"threshold_uncertainty_score":0.36273098},"labels":[],"label_agreement":null},{"id":"W1918663757","doi":"10.1186/1471-2105-13-s19-s4","title":"A flexible ancestral genome reconstruction method based on gapped adjacencies","year":2012,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":true,"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":"Synteny; Genome; Phylogenetic tree; Biology; Tree (set theory); Adjacency list; Extant taxon; Phylogenetics; Set (abstract data type); Phylogenetic network; Computational biology; Data mining; Evolutionary biology; Genetics; Computer science; Gene; Algorithm; Mathematics; Combinatorics","score_opus":0.031277767100683175,"score_gpt":0.28122426960227037,"score_spread":0.2499465025015872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918663757","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.11281423,0.00043870602,0.864792,0.00006826858,0.0007717769,0.00061319314,0.000067307985,0.00009362641,0.020340929],"genre_scores_gemma":[0.08897645,0.000061762476,0.9091092,0.0003458018,0.0004594454,0.00003943766,0.0002356736,0.00002783133,0.00074443046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989549,0.00004575231,0.00028652424,0.0001279935,0.00018076088,0.00040410506],"domain_scores_gemma":[0.99930716,0.000016225562,0.00014041155,0.00035455122,0.000052466163,0.00012916885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041527557,0.00017860533,0.0001417485,0.00009139184,0.00008542031,0.000033475808,0.00015237121,0.00014040421,0.00006824919],"category_scores_gemma":[0.000053634623,0.00016244366,0.000099250734,0.00013303774,0.00005156755,0.000019758925,0.000046784047,0.000084733816,0.00012193038],"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.0014128508,0.0017064712,0.13920495,0.0029727325,0.00070310273,0.0000031651805,0.0039037634,0.07645114,0.37089583,0.0017906708,0.010549589,0.39040574],"study_design_scores_gemma":[0.005283564,0.0020962493,0.05260368,0.00013734397,0.00021048835,0.0002293732,0.0035372588,0.47016934,0.24044885,0.00016932614,0.22269604,0.0024184918],"about_ca_topic_score_codex":0.0000027526082,"about_ca_topic_score_gemma":0.0000026720286,"teacher_disagreement_score":0.3937182,"about_ca_system_score_codex":0.0000322141,"about_ca_system_score_gemma":0.00008144281,"threshold_uncertainty_score":0.662426},"labels":[],"label_agreement":null},{"id":"W194204729","doi":"10.1007/978-94-011-4309-7_39","title":"How Can Duplication be Analyzed?","year":2000,"lang":"en","type":"book-chapter","venue":"Computational biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal","funders":"","keywords":"Gene duplication; Computer science; Biology; Genetics","score_opus":0.016780009702250895,"score_gpt":0.24362048250250612,"score_spread":0.2268404728002552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194204729","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011324414,0.01213697,0.02610455,0.015853265,0.0010187789,0.0022520805,0.003167644,0.00020223846,0.9279401],"genre_scores_gemma":[0.24915482,0.0019556945,0.008130825,0.002387125,0.0023836726,0.000090154754,0.05623565,0.00019137916,0.67947066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988852,0.000024918429,0.00020637612,0.00057277264,0.00011117534,0.00019956473],"domain_scores_gemma":[0.9993408,0.000018871318,0.00016094925,0.000252296,0.00015082544,0.00007628219],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000065722175,0.00027743896,0.00024032398,0.00011636145,0.00006880569,0.000028364555,0.00023649979,0.00046842216,0.00024749155],"category_scores_gemma":[0.000012457796,0.00028801404,0.00015032796,0.000024261966,0.00015347927,0.0000014666746,0.00008430539,0.00013573637,0.000059853304],"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.0004205176,0.00027907582,0.0008297519,0.00019575997,0.004336584,0.00006599185,0.0001675938,0.005963243,0.11454139,0.46051165,0.07027066,0.34241778],"study_design_scores_gemma":[0.0003750875,0.00021949374,0.0003055842,0.000009228764,0.000054524167,0.000036811412,0.0000028067036,0.00019614027,0.00028433322,0.048209388,0.9498801,0.00042646885],"about_ca_topic_score_codex":0.0000048366524,"about_ca_topic_score_gemma":0.000010731803,"teacher_disagreement_score":0.87960947,"about_ca_system_score_codex":0.000034057848,"about_ca_system_score_gemma":0.000104920444,"threshold_uncertainty_score":0.9999572},"labels":[],"label_agreement":null},{"id":"W1963627601","doi":"10.1007/978-94-011-4309-7_46","title":"Duplication, Rearrangement, and Reconciliation","year":2000,"lang":"en","type":"book-chapter","venue":"Computational biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":26,"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; Phylogenetic tree; Genome; Breakpoint; Gene; Genetics; Biology; Sequence (biology); Tree (set theory); Gene family; Computational biology; Evolutionary biology; Combinatorics; Mathematics; Chromosome","score_opus":0.015059570266931036,"score_gpt":0.2445813760675773,"score_spread":0.22952180580064627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963627601","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014762276,0.012748914,0.01047968,0.0017008163,0.0005772038,0.0014562896,0.0006425748,0.000099931945,0.9575323],"genre_scores_gemma":[0.118547834,0.013608971,0.019313917,0.0031449255,0.0033378026,0.00019813926,0.04947547,0.00030060663,0.79207236],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999017,0.000021349802,0.00024814776,0.0004975495,0.00007831579,0.00013764968],"domain_scores_gemma":[0.9994477,0.000020164525,0.00013973562,0.00020891469,0.00012639687,0.000057103232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010419203,0.00021008332,0.00017719224,0.00008440248,0.00006744712,0.000014415293,0.00011620731,0.00033908637,0.00042467308],"category_scores_gemma":[0.000013597012,0.00022613279,0.00006160638,0.000014859174,0.00012557673,0.0000019748381,0.000070425835,0.000094619856,0.00017005959],"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.00035576642,0.00012281239,0.0021669369,0.00017893223,0.0016956672,0.000009363918,0.00016798466,0.001776399,0.040123213,0.31610787,0.059702132,0.5775929],"study_design_scores_gemma":[0.00040750546,0.0002064226,0.0011162745,0.00001363327,0.000034778925,0.000019682633,0.0000017656942,0.00013997694,0.00008423215,0.09063818,0.9070278,0.00030975207],"about_ca_topic_score_codex":0.0000028716124,"about_ca_topic_score_gemma":0.000005380953,"teacher_disagreement_score":0.8473257,"about_ca_system_score_codex":0.000022129403,"about_ca_system_score_gemma":0.000065178254,"threshold_uncertainty_score":0.9221428},"labels":[],"label_agreement":null},{"id":"W1963713243","doi":"10.1089/cmb.2010.0099","title":"Natural Parameter Values for Generalized Gene Adjacency","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"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 Ottawa","funders":"","keywords":"Genome; Adjacency list; Value (mathematics); Probabilistic logic; Gene; Natural (archaeology); Class (philosophy); Biology; Expected value; Computational biology; Genetics; Computer science; Mathematics; Combinatorics; Artificial intelligence; Statistics","score_opus":0.010781784142865205,"score_gpt":0.28796840471012203,"score_spread":0.27718662056725685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963713243","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.96118975,0.0007335985,0.036184866,0.0004445099,0.0012640945,0.000121989295,0.000020933106,0.0000032712499,0.00003701286],"genre_scores_gemma":[0.82314163,0.000036712823,0.17526698,0.00028580197,0.0009779283,0.000005457632,0.0001573992,0.000011193872,0.00011690697],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925405,0.000048066042,0.00031449323,0.00013810137,0.00008781256,0.0001574639],"domain_scores_gemma":[0.99911076,0.00007412865,0.00024324674,0.0000892901,0.0004243072,0.000058276597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027246986,0.00010389584,0.00016929196,0.000076447875,0.000047696816,0.000013351156,0.00018675793,0.00011569517,0.000025433743],"category_scores_gemma":[0.00017959048,0.00008331066,0.0001733592,0.000039981926,0.0000745909,0.000004330892,0.000035392404,0.00013059161,0.0000033618112],"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.00014946795,0.000051872204,0.0012445154,0.0000062225695,0.00015968093,0.0000015315053,0.000018078847,0.00088680006,0.9897747,0.00055342005,0.0019662476,0.005187452],"study_design_scores_gemma":[0.013862549,0.005505482,0.04887604,0.000020873436,0.00032688255,0.0016835359,0.000059266236,0.009848191,0.5025183,0.2009375,0.21510072,0.0012606734],"about_ca_topic_score_codex":8.695716e-7,"about_ca_topic_score_gemma":0.0000016545648,"teacher_disagreement_score":0.4872564,"about_ca_system_score_codex":0.0000067546234,"about_ca_system_score_gemma":0.00009495326,"threshold_uncertainty_score":0.339731},"labels":[],"label_agreement":null},{"id":"W1963847479","doi":"10.1089/cmb.2010.0091","title":"Rearrangement Models and Single-Cut Operations","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"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 Toronto","funders":"Deutscher Akademischer Austauschdienst","keywords":"Sorting; Join (topology); Set (abstract data type); Computer science; Algorithm; Mathematics; Theoretical computer science; Combinatorics; Programming language","score_opus":0.01894765429857264,"score_gpt":0.26936801227171825,"score_spread":0.2504203579731456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963847479","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.94411266,0.000305975,0.053947452,0.0007768019,0.00030324492,0.00006744991,0.000009051269,0.0000024963063,0.00047485257],"genre_scores_gemma":[0.9637342,0.000047779497,0.03555801,0.00019592336,0.0003450569,0.000001904249,0.000044397446,0.000007135037,0.000065568485],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944156,0.000036767084,0.00023537542,0.000108666114,0.00007983674,0.000097807766],"domain_scores_gemma":[0.99949706,0.000018472178,0.00008997676,0.00007048899,0.00026100292,0.00006300339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020451898,0.00007475666,0.00010707689,0.00007157873,0.000049827326,0.00001893436,0.000098666445,0.000081322956,0.000025052603],"category_scores_gemma":[0.000040787818,0.00006363676,0.00004695557,0.00003625185,0.00008001142,0.0000069990174,0.000046846966,0.000109538516,0.0000023348364],"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.00003866485,0.000093358125,0.0009902352,0.0000042617553,0.00010632048,0.000002608952,0.00005980834,0.016450502,0.9728088,0.0030595958,0.0005934553,0.005792398],"study_design_scores_gemma":[0.017308185,0.014727398,0.048210107,0.000090852904,0.00046332512,0.005738886,0.0006818285,0.121099085,0.16186874,0.3008676,0.3263506,0.0025934083],"about_ca_topic_score_codex":0.0000021006495,"about_ca_topic_score_gemma":0.000015296937,"teacher_disagreement_score":0.8109401,"about_ca_system_score_codex":0.0000055945115,"about_ca_system_score_gemma":0.000061064755,"threshold_uncertainty_score":0.2595032},"labels":[],"label_agreement":null},{"id":"W1964112927","doi":"10.1089/cmb.2012.0292","title":"Ancestral Genome Organization: An Alignment Approach","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":true,"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":"Genome; Biology; Evolutionary biology; Computational biology; Computer science; Data science; Genetics; Gene","score_opus":0.011429712418337259,"score_gpt":0.2455299861806244,"score_spread":0.23410027376228715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964112927","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.91762775,0.00028976347,0.081239276,0.000263606,0.00015336965,0.00011115288,0.000005707703,0.000004029059,0.00030533504],"genre_scores_gemma":[0.95671624,0.000033429005,0.04211914,0.00023629768,0.00053069124,0.000002828426,0.00028871573,0.000011070763,0.00006159997],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9992488,0.000072454,0.00028885234,0.00013485625,0.00012105105,0.00013399462],"domain_scores_gemma":[0.99909675,0.000008013366,0.000208923,0.00008693299,0.00051052426,0.000088861365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015382687,0.000091824,0.000129249,0.000061434264,0.000042487107,0.000023517568,0.00019478922,0.0000901136,0.00012830555],"category_scores_gemma":[0.000021830985,0.000077366145,0.000045881923,0.00008932252,0.000057133046,0.00001139404,0.000038320017,0.000067566754,0.000021209782],"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.00006506685,0.00081478123,0.058596004,0.00003115837,0.0006001487,0.000007632743,0.00030831867,0.117410526,0.809311,0.0025183882,0.0031178826,0.0072191097],"study_design_scores_gemma":[0.0057856967,0.007451061,0.8848388,0.0000167488,0.00012854674,0.0021417532,0.0008099325,0.004848119,0.014782963,0.031078788,0.046851307,0.0012662527],"about_ca_topic_score_codex":0.0000026055625,"about_ca_topic_score_gemma":1.8636506e-7,"teacher_disagreement_score":0.8262428,"about_ca_system_score_codex":0.000018118797,"about_ca_system_score_gemma":0.00009400608,"threshold_uncertainty_score":0.31548998},"labels":[],"label_agreement":null},{"id":"W1965744864","doi":"10.1186/1471-2105-12-s9-s14","title":"Origin and evolution of gene families in Bacteria and Archaea","year":2011,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University; McMaster University","funders":"","keywords":"Genome; Biology; Gene; Horizontal gene transfer; Archaea; Gene duplication; Genetics; Gene family; Genome evolution; Bacterial genome size; Gene cluster; Genome size; Evolutionary biology; Computational biology","score_opus":0.02074680044134661,"score_gpt":0.22023558622248285,"score_spread":0.19948878578113624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965744864","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.98728645,0.00040291334,0.0113905845,0.0000025136037,0.00003225085,0.00012120316,0.000013248013,0.0000034729333,0.00074734446],"genre_scores_gemma":[0.78915226,0.00045105655,0.21027979,0.000010442472,0.000018869856,0.0000060157863,0.000028074312,0.0000065356426,0.000046914294],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99957657,0.000011251597,0.00018736886,0.000070300106,0.000048593443,0.00010590668],"domain_scores_gemma":[0.9997584,0.0000034727489,0.000060954106,0.00012320404,0.000022701213,0.000031223764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011478395,0.000072691444,0.00008898182,0.000065578366,0.00001289804,0.0000047156286,0.000051874285,0.0000627261,0.0000042029524],"category_scores_gemma":[0.000017087194,0.00006695974,0.000013885028,0.000047828165,0.00008206682,0.000006624122,0.00006529702,0.000025538955,0.0000018116762],"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.00017388466,0.00012260098,0.6385551,0.00094348355,0.00007461275,0.0000013342947,0.008109519,0.000017230346,0.33601895,0.0009498163,0.000104593295,0.014928879],"study_design_scores_gemma":[0.0018756322,0.00057420763,0.876319,0.00004987634,0.00003095105,0.00003632328,0.003326879,0.012204147,0.10276695,0.0005328611,0.0018795398,0.00040366017],"about_ca_topic_score_codex":0.00004264062,"about_ca_topic_score_gemma":0.000065436194,"teacher_disagreement_score":0.23776387,"about_ca_system_score_codex":0.0000072896514,"about_ca_system_score_gemma":0.000027299991,"threshold_uncertainty_score":0.2730539},"labels":[],"label_agreement":null},{"id":"W1969595164","doi":"10.1089/cmb.2007.a005","title":"Common Intervals and Symmetric Difference in a Model-Free Phylogenomics, with an Application to Streptophyte Evolution","year":2007,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":35,"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é Laval; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Phylogenomics; Biology; Evolutionary biology; Botany; Phylogenetics; Genetics","score_opus":0.009398791714588465,"score_gpt":0.264439563613116,"score_spread":0.25504077189852753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969595164","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.65316004,0.00018914243,0.34643874,0.00007672085,0.000017634864,0.000086713146,0.000005355294,0.00000116197,0.000024528788],"genre_scores_gemma":[0.96612364,0.000018130077,0.03361306,0.000112628295,0.000085164895,0.0000025330235,0.000032439202,0.000006405345,0.000006011462],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99935347,0.000033468856,0.000270069,0.00014640202,0.00007505384,0.00012155909],"domain_scores_gemma":[0.99947554,0.000022174183,0.00015708063,0.000104245795,0.0001595438,0.00008139753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031214269,0.0000800196,0.0001461986,0.00023624358,0.000019299663,0.000007542561,0.00012719823,0.00006756377,5.3826955e-7],"category_scores_gemma":[0.00002521559,0.00006827416,0.000025168343,0.00013457562,0.000040072962,0.0000046056684,0.000055214772,0.00007301179,5.6728055e-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.001510869,0.0004222785,0.3321772,0.000030007921,0.00014647997,0.000009286768,0.00016039073,0.14476936,0.4498997,0.003987265,0.000025744353,0.06686143],"study_design_scores_gemma":[0.0017331904,0.0034336064,0.936772,0.000020680722,0.000022166683,0.00015455285,0.000063924635,0.033138614,0.0035736237,0.020804813,0.00009826529,0.00018455074],"about_ca_topic_score_codex":0.000006828384,"about_ca_topic_score_gemma":0.000045280765,"teacher_disagreement_score":0.6045948,"about_ca_system_score_codex":0.000046582318,"about_ca_system_score_gemma":0.000060044913,"threshold_uncertainty_score":0.27841395},"labels":[],"label_agreement":null},{"id":"W1970925480","doi":"10.1016/j.endm.2013.10.056","title":"Greedy Pancake Flipping","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Guelph; McGill University","funders":"","keywords":"Mathematics; Combinatorics; Greedy algorithm; Algorithm","score_opus":0.007820628795675699,"score_gpt":0.23605773178441763,"score_spread":0.22823710298874195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970925480","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.9709677,0.0011808733,0.02432843,0.00031569556,0.00006996936,0.0005859737,0.0000032929404,0.000030339554,0.0025177384],"genre_scores_gemma":[0.9895584,0.00018276293,0.008985767,0.00008766664,0.00013811034,0.00010950346,0.000043948465,0.000044636043,0.00084922794],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863356,0.000030140876,0.0002873246,0.00028647974,0.00016042903,0.0006020773],"domain_scores_gemma":[0.9993405,0.000028265722,0.00008535063,0.00044852757,0.000040969247,0.000056399345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021927281,0.00019397424,0.00018789397,0.000063025225,0.000043220734,0.000043397613,0.0002798398,0.00011135414,0.00020766309],"category_scores_gemma":[0.00013609462,0.00017980438,0.000078905236,0.00013955812,0.000051026662,0.0000073004444,0.00013462598,0.00015898742,0.00016173304],"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.00001931632,0.00038763715,0.0061136354,0.00034981666,0.00029894477,0.0000071783134,0.0009987387,0.00041822382,0.9583641,0.0070430078,0.0010995306,0.02489987],"study_design_scores_gemma":[0.0077426964,0.0030034496,0.016761111,0.0006028488,0.00024186056,0.00023563979,0.002043393,0.047948122,0.62815106,0.24105032,0.04700255,0.0052169343],"about_ca_topic_score_codex":0.000027413498,"about_ca_topic_score_gemma":0.000071924835,"teacher_disagreement_score":0.330213,"about_ca_system_score_codex":0.000053678505,"about_ca_system_score_gemma":0.00005889542,"threshold_uncertainty_score":0.733221},"labels":[],"label_agreement":null},{"id":"W1971276942","doi":"10.1089/cmb.2009.0103","title":"Towards Improved Reconstruction of Ancestral Gene Order in Angiosperm Phylogeny","year":2009,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"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 Ottawa","funders":"","keywords":"Phylogenetics; Evolutionary biology; Biology; Order (exchange); Computational biology; Paleontology; Gene; Genetics; Economics","score_opus":0.00961919351483483,"score_gpt":0.2658073958321393,"score_spread":0.2561882023173045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971276942","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.98837477,0.0007241784,0.010231974,0.0002433068,0.00020968549,0.00006297983,0.000009302792,0.000001331664,0.00014246655],"genre_scores_gemma":[0.9584823,0.00009759676,0.0410589,0.00009244372,0.00022259953,6.014404e-7,0.000033609325,0.000003848689,0.000008092105],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.999254,0.000051239273,0.00039550356,0.00010995234,0.00006926238,0.00012003431],"domain_scores_gemma":[0.99930197,0.000009612465,0.00029311707,0.00005983398,0.00030052112,0.000034924535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019738782,0.00008146135,0.00018102731,0.00011866921,0.000012763062,0.0000038811054,0.00011500907,0.00009942498,0.000015241367],"category_scores_gemma":[0.000044106488,0.00007224155,0.00008267276,0.000120497025,0.000058498266,0.000005272628,0.000014502268,0.00007693549,6.7678735e-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.00013613388,0.00008910321,0.0070012235,0.000003913435,0.00006129243,0.0000031091542,0.000027952046,0.004973472,0.9355038,0.00012844313,0.000038348495,0.052033205],"study_design_scores_gemma":[0.0049862945,0.005520465,0.7380364,0.000038204624,0.000047564754,0.0011298796,0.00010167154,0.002790686,0.20868069,0.03697941,0.0012738152,0.00041492272],"about_ca_topic_score_codex":0.0000042732736,"about_ca_topic_score_gemma":0.0000028696834,"teacher_disagreement_score":0.7310352,"about_ca_system_score_codex":0.00001770962,"about_ca_system_score_gemma":0.00014908494,"threshold_uncertainty_score":0.2945925},"labels":[],"label_agreement":null},{"id":"W1972818612","doi":"10.1186/1471-2105-12-s1-s4","title":"On the PATHGROUPS approach to rapid small phylogeny","year":2011,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université de Montréal; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Simulated annealing; Computer science; Genome; Phylogenetics; Set (abstract data type); Computational biology; Sequence (biology); Greedy algorithm; DNA microarray; Data mining; Algorithm; Biology; Theoretical computer science; Artificial intelligence; Gene; Genetics","score_opus":0.05217310429469563,"score_gpt":0.20729530492198414,"score_spread":0.15512220062728851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972818612","genre_codex":"empirical","genre_gemma":"methods","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.356473,0.00021810438,0.3506904,0.000073346535,0.00036985657,0.0016918189,0.00005779436,0.00006603323,0.29035965],"genre_scores_gemma":[0.48125842,0.000082384875,0.51301354,0.003384949,0.00030695478,0.00021071047,0.00018327587,0.0000652971,0.001494436],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991598,0.000032286345,0.00023561585,0.0001534595,0.0001386383,0.0002801794],"domain_scores_gemma":[0.9991581,0.000012688645,0.00007821574,0.0006068096,0.00004811975,0.00009605671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029313046,0.0001701867,0.000106154774,0.00004711814,0.00008580407,0.000026975236,0.00041197802,0.00010372552,0.000041725743],"category_scores_gemma":[0.000070836,0.00011382247,0.00009120659,0.00011392496,0.00004570342,0.0000027145245,0.00016148991,0.00008057275,0.00028645157],"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.002553421,0.0072820666,0.015049038,0.0028179388,0.002666941,0.000014922424,0.06945101,0.0040846635,0.21415333,0.13321376,0.25716215,0.29155076],"study_design_scores_gemma":[0.008661446,0.011478797,0.068876356,0.00020852749,0.00046572156,0.00020917685,0.022561776,0.124307066,0.36738062,0.0050823265,0.38373074,0.0070374706],"about_ca_topic_score_codex":0.0000038748717,"about_ca_topic_score_gemma":0.0000040175905,"teacher_disagreement_score":0.2888652,"about_ca_system_score_codex":0.000010536084,"about_ca_system_score_gemma":0.000033664888,"threshold_uncertainty_score":0.46415457},"labels":[],"label_agreement":null},{"id":"W1973111150","doi":"10.1016/s1570-8667(03)00077-7","title":"A lower bound for the breakpoint phylogeny problem","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"McGill University","funders":"","keywords":"Breakpoint; Phylogenetics; Heuristics; Phylogenetic tree; Genome; Computer science; Combinatorics; Biology; Mathematics; Algorithm; Computational biology; Evolutionary biology; Gene; Mathematical optimization; Genetics; Chromosome","score_opus":0.010738364970273969,"score_gpt":0.2569843468178186,"score_spread":0.24624598184754465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973111150","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.31139803,0.01763571,0.6558877,0.008717527,0.0026956191,0.0021663997,0.0001783494,0.000024462433,0.0012961817],"genre_scores_gemma":[0.88032037,0.0015210959,0.11175569,0.00074302795,0.0041169655,0.00008081549,0.000045043344,0.00011526069,0.0013017387],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874,0.000026689142,0.00042974297,0.00019920977,0.00028263422,0.0003216872],"domain_scores_gemma":[0.9989434,0.000023787165,0.00033125927,0.0003010726,0.00028715382,0.000113329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052986864,0.00018896107,0.00021304325,0.00005479904,0.0001442673,0.0000734199,0.00042883022,0.00010284637,0.000016922888],"category_scores_gemma":[0.00005633074,0.000120158016,0.00037235205,0.00010161544,0.0001074715,0.000010656645,0.000085256754,0.00015297848,0.000006475509],"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.0010878909,0.0007448168,0.00034262225,0.00014247758,0.0027686362,0.000093872804,0.0007733999,0.007109355,0.88630307,0.00067955756,0.012695515,0.08725877],"study_design_scores_gemma":[0.017616404,0.011593906,0.0060662013,0.00024624364,0.00097500876,0.0019386659,0.0013618531,0.00076050166,0.20921548,0.01867312,0.7300154,0.0015372323],"about_ca_topic_score_codex":0.000013830532,"about_ca_topic_score_gemma":0.000012919475,"teacher_disagreement_score":0.71731985,"about_ca_system_score_codex":0.00004484107,"about_ca_system_score_gemma":0.00017764942,"threshold_uncertainty_score":0.48999017},"labels":[],"label_agreement":null},{"id":"W1973260309","doi":"10.1089/cmb.2011.0083","title":"Consistency of Sequence-Based Gene Clusters","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Genome; Gene cluster; Gene; Phylogenetic tree; Consistency (knowledge bases); Biology; Computational biology; Permutation (music); Genomics; Sequence (biology); Phylogenetic network; Gene prediction; Set (abstract data type); Comparative genomics; Genetics; Computer science; Artificial intelligence; Physics","score_opus":0.041981213999927214,"score_gpt":0.2742414387323298,"score_spread":0.2322602247324026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973260309","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.94068027,0.0005841426,0.057552,0.00013675822,0.00025816253,0.000069853515,0.000021976473,0.0000021154638,0.0006947365],"genre_scores_gemma":[0.93942994,0.000024359975,0.060207106,0.0001800276,0.00009194117,9.4022096e-7,0.00004367952,0.0000060859084,0.000015912814],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926615,0.00007505051,0.00037199704,0.000094433206,0.00008993775,0.000102427344],"domain_scores_gemma":[0.9990833,0.000026065809,0.00037341236,0.00008097569,0.00038741253,0.00004887621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022036464,0.000077295095,0.00016282486,0.00009499729,0.000019870173,0.000002136541,0.00015828795,0.000079482525,0.00004751432],"category_scores_gemma":[0.000045487366,0.000065874156,0.000115907555,0.00005704139,0.00014929232,0.0000025411478,0.000027277458,0.00005574075,0.0000031590394],"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.00057605223,0.00034430609,0.03332343,0.000042968753,0.0005377076,0.000025906484,0.00018939588,0.010355005,0.94495225,0.0012494572,0.0007044163,0.007699079],"study_design_scores_gemma":[0.010540867,0.013056826,0.12294905,0.00010762145,0.00031512408,0.0012472187,0.0003310099,0.0047237906,0.7873536,0.04432608,0.01400928,0.0010395534],"about_ca_topic_score_codex":0.0000041029853,"about_ca_topic_score_gemma":9.4724186e-7,"teacher_disagreement_score":0.15759869,"about_ca_system_score_codex":0.000010777875,"about_ca_system_score_gemma":0.00021632787,"threshold_uncertainty_score":0.26862702},"labels":[],"label_agreement":null},{"id":"W1976616078","doi":"10.1089/cmb.2007.a004","title":"Paths and Cycles in Breakpoint Graph of Random Multichromosomal Genomes","year":2007,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Breakpoint; Combinatorics; Genome; Mathematics; Biology; Graph; Genetics; Discrete mathematics; Gene; Chromosome","score_opus":0.006927500281005102,"score_gpt":0.2610461755468781,"score_spread":0.254118675265873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976616078","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.98113126,0.0026721451,0.01584949,0.00010211427,0.00009487909,0.00006888216,0.000007912865,0.0000010178618,0.00007227959],"genre_scores_gemma":[0.9871043,0.00022871843,0.012475056,0.000046492587,0.000114068534,5.6339695e-7,0.000020513084,0.0000055638466,0.0000047512744],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99919844,0.000058063764,0.00043757132,0.00009995618,0.000081123515,0.00012482081],"domain_scores_gemma":[0.9994005,0.0000901091,0.00025438674,0.000048167803,0.00015941469,0.000047450372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005369991,0.00007889596,0.00020120712,0.00016980535,0.000015342062,0.000003600258,0.00008569458,0.00008165829,0.000007752572],"category_scores_gemma":[0.00005128777,0.00006655728,0.00007109155,0.00006768599,0.00011079118,0.0000033723427,0.00003962956,0.000068751746,5.56735e-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.0011448954,0.00028886448,0.20693117,0.000043243337,0.00029841563,0.00004394088,0.00032154477,0.0066826907,0.74003047,0.0006150761,0.00006268951,0.043537017],"study_design_scores_gemma":[0.012272569,0.0022098848,0.91014415,0.000052559284,0.000051918487,0.0007618088,0.00035100593,0.00067275105,0.051240165,0.019390408,0.0025079171,0.0003448386],"about_ca_topic_score_codex":0.0000048483926,"about_ca_topic_score_gemma":0.0000117755935,"teacher_disagreement_score":0.70321304,"about_ca_system_score_codex":0.000008517145,"about_ca_system_score_gemma":0.000047728812,"threshold_uncertainty_score":0.2714127},"labels":[],"label_agreement":null},{"id":"W1976933290","doi":"10.1007/s10878-008-9164-y","title":"Linear time construction of 5-phylogenetic roots for tree chordal graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta; McGill University","funders":"","keywords":"Phylogenetic tree; Combinatorics; Theory of computation; Mathematics; Chordal graph; Tree (set theory); Constructive; Discrete mathematics; Treewidth; Time complexity; Root (linguistics); Graph; Pathwidth; Computer science; Algorithm; Biology; Line graph","score_opus":0.0077324450531980355,"score_gpt":0.22357302615700256,"score_spread":0.21584058110380452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976933290","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.7514332,0.00057265535,0.24411066,0.00012548067,0.0028975294,0.00049324706,0.000018319226,0.0000075583757,0.0003413805],"genre_scores_gemma":[0.83466566,0.00047644947,0.16349882,0.000017455697,0.0011028913,0.000007165105,0.000088269364,0.000036534442,0.0001067663],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912655,0.000046369078,0.00041545954,0.00010664051,0.00019167604,0.00011330739],"domain_scores_gemma":[0.9987313,0.000014575707,0.00046861678,0.00011667951,0.00059823657,0.000070592236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019461593,0.00010185452,0.00020842039,0.00011308593,0.000054578373,0.0000057925536,0.00012425358,0.00012342061,0.00001620264],"category_scores_gemma":[0.00015262076,0.00009951254,0.0001546994,0.00012388307,0.000071648705,0.000008729692,0.000020042025,0.000053920397,6.453083e-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.0018458368,0.00064693973,0.0052796784,0.00007832645,0.0005686902,0.0000074497007,0.00013080244,0.26502156,0.71686906,0.0010206657,0.0033654736,0.0051654987],"study_design_scores_gemma":[0.041716766,0.020555796,0.0069089904,0.00016775758,0.0008589337,0.0011148374,0.00013266619,0.1026712,0.79300547,0.014465338,0.016844274,0.001557951],"about_ca_topic_score_codex":7.2231865e-7,"about_ca_topic_score_gemma":8.594378e-8,"teacher_disagreement_score":0.16235036,"about_ca_system_score_codex":0.00001594965,"about_ca_system_score_gemma":0.00013445325,"threshold_uncertainty_score":0.40580034},"labels":[],"label_agreement":null},{"id":"W1977051245","doi":"10.1007/978-3-642-04744-2_16","title":"A Statistically Fair Comparison of Ancestral Genome Reconstructions, Based on Breakpoint and Rearrangement Distances","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Breakpoint; Computer science; Algorithm; Genome; Biology; Genetics; Chromosome; Gene","score_opus":0.013677446150213548,"score_gpt":0.26061034126603,"score_spread":0.24693289511581645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977051245","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.006651427,0.0010380573,0.9888933,0.0002616485,0.000297114,0.00042992065,0.000088341956,0.000014156439,0.0023260687],"genre_scores_gemma":[0.75514185,0.00016498668,0.24390273,0.00026273436,0.0002522112,0.000007823691,0.000092556125,0.000024983514,0.00015009475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982019,0.000022193824,0.00037895775,0.0007423028,0.00037614268,0.0002785134],"domain_scores_gemma":[0.9991077,0.000046172496,0.00021011643,0.00043704704,0.00010873902,0.00009021306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026230712,0.0002828136,0.00035328895,0.0002048156,0.00008035293,0.00005592662,0.00035780834,0.00016151923,0.000017888866],"category_scores_gemma":[0.000030828898,0.0002633249,0.000060064333,0.000095689276,0.0006823205,0.000005949047,0.000105909116,0.00021450555,0.000002112571],"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.000101976955,0.00010056842,0.00085168553,0.00011122846,0.00003273055,0.000012420896,0.0001234111,0.020368932,0.017290607,0.00052828516,0.000022248088,0.9604559],"study_design_scores_gemma":[0.011707558,0.03472513,0.08703459,0.0051855957,0.0005259986,0.0003270212,0.00002950115,0.4888382,0.11302395,0.16794808,0.07988798,0.010766385],"about_ca_topic_score_codex":0.000006704273,"about_ca_topic_score_gemma":0.00007111762,"teacher_disagreement_score":0.9496895,"about_ca_system_score_codex":0.000059572936,"about_ca_system_score_gemma":0.00016860304,"threshold_uncertainty_score":0.9999819},"labels":[],"label_agreement":null},{"id":"W1985672280","doi":"10.1007/s10878-006-7120-2","title":"Genome rearrangements with partially ordered chromosomes","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Genome; Directed acyclic graph; Biology; Genetics; Chromosome; Combinatorics; Whole genome sequencing; Graph; Directed graph; Mathematics; Computational biology; Gene","score_opus":0.004616278146711241,"score_gpt":0.20568677464747243,"score_spread":0.2010704965007612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985672280","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.8303585,0.0011761979,0.16130342,0.0004102115,0.0025657942,0.0005840251,0.000010554316,0.000023463886,0.0035678158],"genre_scores_gemma":[0.9687466,0.00016956504,0.029057845,0.000026971229,0.001555761,0.0000055142586,0.000111730624,0.00003758936,0.0002883913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896884,0.000055946617,0.0003547191,0.00013576855,0.00031559877,0.0001691555],"domain_scores_gemma":[0.99896306,0.0000050577073,0.00038173035,0.00015496022,0.00043702385,0.00005819586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002170801,0.00013162887,0.00017975397,0.00008277899,0.000059653292,0.000049286326,0.00016389783,0.00008904935,0.000049624323],"category_scores_gemma":[0.000025612691,0.000110961126,0.00006822392,0.0001494995,0.000035000892,0.00001652198,0.00003106766,0.00007155445,0.0000027351214],"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.0010862596,0.00070061366,0.00582018,0.00003619056,0.0003986047,0.00004504457,0.000063814456,0.69782025,0.29158127,0.00047776464,0.0015759361,0.00039408178],"study_design_scores_gemma":[0.10528323,0.035234336,0.08397786,0.00046387909,0.0019872414,0.0011275784,0.0005446505,0.013908318,0.35888016,0.0077106217,0.38572204,0.0051600817],"about_ca_topic_score_codex":0.0000054582706,"about_ca_topic_score_gemma":0.0000017272135,"teacher_disagreement_score":0.6839119,"about_ca_system_score_codex":0.000033497206,"about_ca_system_score_gemma":0.00010897525,"threshold_uncertainty_score":0.45248634},"labels":[],"label_agreement":null},{"id":"W1987212153","doi":"10.1186/1471-2148-9-203","title":"Long-range regulation is a major driving force in maintaining genome integrity","year":2009,"lang":"en","type":"article","venue":"BMC Evolutionary Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University and Génome Québec Innovation Centre; McGill University Health Centre; McGill University","funders":"European Molecular Biology Laboratory; McGill University","keywords":"Biology; Genome; Breakpoint; Genetics; Gene; Comparative genomics; Evolutionary biology; Housekeeping gene; Genomics; Genome evolution; INDEL Mutation; Lineage (genetic); Gene duplication; Vertebrate; Computational biology; Chromosome; Single-nucleotide polymorphism","score_opus":0.014759446792914003,"score_gpt":0.2628512640521802,"score_spread":0.24809181725926618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987212153","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.956674,0.0021251459,0.0388321,0.00057657034,0.00013540401,0.00038120872,0.000023868834,0.000033452678,0.001218297],"genre_scores_gemma":[0.98944354,0.00007586565,0.008405602,0.00031815327,0.00031789244,0.000027708833,0.0005015064,0.00001531062,0.0008944456],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985115,0.0001480775,0.00031129466,0.0005159742,0.000089450565,0.00042371958],"domain_scores_gemma":[0.9993992,0.000020057685,0.00009939464,0.00033838482,0.00007348694,0.00006948774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032926,0.000195444,0.00019281042,0.00015599412,0.00008873941,0.000009906783,0.00022585888,0.00030941583,0.000115947296],"category_scores_gemma":[0.00008744034,0.0002021445,0.00010194943,0.00018643269,0.00008550416,0.000009499877,0.00010556534,0.0001715554,0.0000394508],"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.0001369749,0.0001293415,0.6714546,0.000014681695,0.00003496316,0.0000054487746,0.00011251912,0.00017407544,0.32455727,0.0013133106,0.00044787157,0.001618939],"study_design_scores_gemma":[0.0007922341,0.0004040133,0.9890348,0.000015327323,0.00001117591,0.000039791783,0.0000643276,0.0011004319,0.00090461626,0.004448446,0.0029105328,0.00027434045],"about_ca_topic_score_codex":0.000027222604,"about_ca_topic_score_gemma":0.00011660123,"teacher_disagreement_score":0.32365265,"about_ca_system_score_codex":0.00011073465,"about_ca_system_score_gemma":0.000094443,"threshold_uncertainty_score":0.8243213},"labels":[],"label_agreement":null},{"id":"W1987752844","doi":"10.1007/11864127_5","title":"Paths and Cycles in Breakpoint Graphs of Random Multichromosomal Genomes","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"University of Ottawa","funders":"","keywords":"Breakpoint; Combinatorics; Genome; Order (exchange); Random graph; Graph; Computer science; Discrete mathematics; Mathematics; Biology; Genetics; Gene; Chromosome","score_opus":0.006534572382703496,"score_gpt":0.21486821583470628,"score_spread":0.20833364345200278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987752844","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.36982456,0.016934283,0.6078714,0.00021029996,0.00076259533,0.0013937143,0.000074258685,0.000028746286,0.0029001264],"genre_scores_gemma":[0.96631604,0.0004327615,0.032835357,0.00008476422,0.00015860554,0.000006842006,0.000035657442,0.000027780537,0.00010221546],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984255,0.000020424915,0.00033528035,0.0006736844,0.0002554492,0.00028966035],"domain_scores_gemma":[0.99930537,0.00004771975,0.00014132872,0.0003805911,0.00007261605,0.000052374377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030140814,0.0002743356,0.00035023625,0.0003186628,0.000038815157,0.00003557896,0.00038659645,0.00023294623,0.000006219049],"category_scores_gemma":[0.000022436208,0.000252324,0.000078354096,0.000113794595,0.0005772101,0.000005750608,0.00035625772,0.0001780332,0.0000011439591],"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.00015559797,0.00017057334,0.013292155,0.00030812004,0.00008333044,0.00012816486,0.000677894,0.02657542,0.21373244,0.00036875258,0.000028252718,0.7444793],"study_design_scores_gemma":[0.030372243,0.00480276,0.10318421,0.0031704234,0.0002693534,0.00071752205,0.0000092050595,0.15524122,0.5139689,0.16771331,0.011733975,0.008816889],"about_ca_topic_score_codex":0.000046380308,"about_ca_topic_score_gemma":0.0002033786,"teacher_disagreement_score":0.7356624,"about_ca_system_score_codex":0.00002848609,"about_ca_system_score_gemma":0.00009978915,"threshold_uncertainty_score":0.9999929},"labels":[],"label_agreement":null},{"id":"W1988405029","doi":"10.1142/s0219720009004102","title":"GENOME HALVING WITH DOUBLE CUT AND JOIN","year":2009,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Royal Society of Canada","keywords":"Join (topology); Reciprocal; Genome; Context (archaeology); Computer science; Block (permutation group theory); Combinatorics; Mathematics; Algorithm; Genetics; Biology; Gene","score_opus":0.007831224378292838,"score_gpt":0.231936087837947,"score_spread":0.22410486345965416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988405029","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.96725655,0.0010558408,0.030440865,0.00051454763,0.000046959878,0.00007767787,0.0000046137534,0.00000253425,0.00060039695],"genre_scores_gemma":[0.9609852,0.00029511063,0.038218807,0.0003173319,0.00011620461,5.122026e-7,0.000035157813,0.0000038885455,0.000027809609],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99946976,0.000011158559,0.000267875,0.00006587486,0.00007420843,0.00011114329],"domain_scores_gemma":[0.99953395,0.000010555383,0.00020991823,0.00004810983,0.00012950774,0.000067951114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016031775,0.000087225795,0.00013674286,0.00007860254,0.000053606615,0.000029634597,0.00006365028,0.00005665355,0.0000030720234],"category_scores_gemma":[0.000006607359,0.00006304112,0.000027116486,0.000042646112,0.00006131492,0.00001051612,0.000029393774,0.000064464955,9.4964764e-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.0046263337,0.0010158729,0.059205476,0.00055779784,0.0030423612,0.00010679966,0.0055340766,0.03317072,0.46945095,0.025734972,0.0025163477,0.39503828],"study_design_scores_gemma":[0.039510034,0.045886718,0.6393629,0.00033061724,0.0005519404,0.016136967,0.0030466116,0.06384016,0.013427608,0.05154737,0.123124376,0.0032347024],"about_ca_topic_score_codex":6.4105166e-7,"about_ca_topic_score_gemma":6.408018e-7,"teacher_disagreement_score":0.5801574,"about_ca_system_score_codex":0.000005728385,"about_ca_system_score_gemma":0.00004612316,"threshold_uncertainty_score":0.25707424},"labels":[],"label_agreement":null},{"id":"W1991265331","doi":"10.1142/s0219720012400082","title":"A FAST METHOD FOR LARGE-SCALE MULTICHROMOSOMAL BREAKPOINT MEDIAN PROBLEMS","year":2011,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Breakpoint; Computer science; Scale (ratio); Algorithm; Mathematics; Biology; Chromosome; Genetics; Cartography; Geography","score_opus":0.015277791115516364,"score_gpt":0.2636110825953793,"score_spread":0.24833329147986294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991265331","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.07101673,0.00026191032,0.92771035,0.00017633695,0.00018995961,0.00022283832,0.00008524699,0.0000037593782,0.00033285067],"genre_scores_gemma":[0.19786587,0.00007801286,0.8014511,0.00025178606,0.00017887163,0.000009488769,0.00012528992,0.000010763387,0.000028858338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991099,0.00003243161,0.0004890543,0.00009508143,0.000083630686,0.0001898604],"domain_scores_gemma":[0.999146,0.00003600683,0.00035407333,0.00007231156,0.00029176523,0.00009988614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045828018,0.000116034695,0.0001983138,0.00009335075,0.000063523454,0.000014314798,0.00013013347,0.00011043327,0.000014839049],"category_scores_gemma":[0.000036362006,0.000091533475,0.00010393932,0.000046068526,0.000048149428,0.00001020687,0.0000669574,0.00007067479,0.0000023923674],"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.0028385373,0.0034480144,0.0361126,0.0020248166,0.0056396164,0.00003012574,0.04649925,0.013233172,0.19307718,0.02264339,0.009166378,0.6652869],"study_design_scores_gemma":[0.017449856,0.014688509,0.02122617,0.00016290465,0.00040365098,0.0026265404,0.0056240275,0.79854274,0.017505247,0.05489432,0.065357305,0.0015187581],"about_ca_topic_score_codex":0.0000025657846,"about_ca_topic_score_gemma":0.0000067413803,"teacher_disagreement_score":0.78530955,"about_ca_system_score_codex":0.000008435826,"about_ca_system_score_gemma":0.000073350086,"threshold_uncertainty_score":0.37326267},"labels":[],"label_agreement":null},{"id":"W1994823302","doi":"10.1089/cmb.2011.0128","title":"The Complexity of the Gapped Consecutive-Ones Property Problem for Matrices of Bounded Maximum Degree","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Degree (music); Combinatorics; Row; Mathematics; Upper and lower bounds; Polynomial; Matrix (chemical analysis); Binary number; Discrete mathematics; Physics; Computer science; Mathematical analysis; Chemistry; Arithmetic","score_opus":0.08174218429878709,"score_gpt":0.2810726362280495,"score_spread":0.1993304519292624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994823302","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.97016186,0.0017872896,0.024794633,0.0012949251,0.00036672014,0.00065663096,0.00009001017,0.0000027291373,0.0008451794],"genre_scores_gemma":[0.9741579,0.0000720619,0.025563307,0.000046048954,0.00007409299,0.0000063507896,0.00001400921,0.000006851996,0.00005931843],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990732,0.00013183674,0.00046538375,0.00009362062,0.00010984267,0.00012613798],"domain_scores_gemma":[0.9983586,0.000083873696,0.00074039557,0.00011012764,0.0006811565,0.000025850424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043706974,0.00008768325,0.00019301152,0.000036354882,0.000091512054,0.0000053855665,0.00034704714,0.00006954317,0.000008154703],"category_scores_gemma":[0.000080520265,0.000040745595,0.00016318834,0.00006860609,0.0006741008,0.0000034662057,0.00008177712,0.00006399817,4.64571e-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.0068299253,0.0015157195,0.08547484,0.00054434617,0.0041231667,0.0000039232564,0.0018403059,0.001361011,0.7953573,0.060868513,0.007350083,0.034730863],"study_design_scores_gemma":[0.0052052215,0.005128248,0.16253214,0.000097920616,0.00026058403,0.00032956965,0.00066931575,0.0008322144,0.14786376,0.64388114,0.032791793,0.00040811594],"about_ca_topic_score_codex":0.000013634044,"about_ca_topic_score_gemma":0.000015301974,"teacher_disagreement_score":0.64749354,"about_ca_system_score_codex":0.000008836675,"about_ca_system_score_gemma":0.00019768019,"threshold_uncertainty_score":0.24837525},"labels":[],"label_agreement":null},{"id":"W1996773098","doi":"10.1038/nmeth.2444","title":"Elements of visual style","year":2013,"lang":"en","type":"article","venue":"Nature Methods","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada's Michael Smith Genome Sciences Centre","funders":"","keywords":"Style (visual arts); Computer science; Process (computing); Computational biology; Biology; Programming language; Visual arts; Art","score_opus":0.008134924044573763,"score_gpt":0.3637503546552582,"score_spread":0.3556154306106844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996773098","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.9431185,0.0038408944,0.043663286,0.00016531162,0.0005230861,0.00052432145,0.000009733008,0.000017454668,0.008137382],"genre_scores_gemma":[0.50094247,0.000055971006,0.49681172,0.00020376296,0.000179811,0.00002760558,0.000049396087,0.000018915,0.0017103482],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992329,0.00013727199,0.00015897464,0.00019400512,0.000116276504,0.00016056233],"domain_scores_gemma":[0.9995282,0.00001353267,0.000073757845,0.00022586464,0.00011232471,0.000046319557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039067247,0.00009554509,0.00011660256,0.000039082137,0.000019515897,0.0000086520495,0.0001523704,0.00024111148,0.00023993273],"category_scores_gemma":[0.00012439981,0.000083296305,0.00006667371,0.00008869711,0.000029072877,0.0000021935912,0.00009691195,0.00014153798,0.000017833847],"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.0000043937202,0.000042742387,0.001813806,0.000012497492,0.000051662682,1.8060355e-7,0.000013624996,9.4419806e-7,0.9188157,0.000027924058,0.0022024887,0.077014044],"study_design_scores_gemma":[0.0003934676,0.00020038328,0.010997376,0.000004411734,0.00001657176,0.0000020364057,0.000050578867,0.00012088538,0.8942276,0.00023042805,0.093620434,0.00013580233],"about_ca_topic_score_codex":0.0000074605286,"about_ca_topic_score_gemma":8.6399433e-7,"teacher_disagreement_score":0.45314842,"about_ca_system_score_codex":0.0000060113366,"about_ca_system_score_gemma":0.000017623019,"threshold_uncertainty_score":0.33967248},"labels":[],"label_agreement":null},{"id":"W1996806342","doi":"10.1142/s0219720007003107","title":"COMPUTING THE BREAKPOINT DISTANCE BETWEEN PARTIALLY ORDERED GENOMES","year":2007,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"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":"Tsinghua University; McMaster University; University of Minnesota; National Science Foundation","keywords":"Breakpoint; Genome; Nondeterministic algorithm; Chromosome; Computational biology; Heuristic; Biology; Algorithm; Genetics; Computer science; Gene; Artificial intelligence","score_opus":0.010050303129952113,"score_gpt":0.2603520993494437,"score_spread":0.2503017962194916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996806342","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.4436067,0.0010987412,0.55416095,0.0005129727,0.00013647812,0.00009179366,0.000013844215,0.000003055338,0.0003754519],"genre_scores_gemma":[0.97116613,0.00011214763,0.028049847,0.00026158954,0.00034036723,2.9984653e-7,0.000049971895,0.0000057693546,0.000013902986],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990364,0.000030122785,0.0005630335,0.000071818555,0.0001184034,0.00018026201],"domain_scores_gemma":[0.99912876,0.000097826276,0.00041757108,0.00008006692,0.00020640617,0.00006934345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000810258,0.00010115198,0.00016136987,0.000059051978,0.000112873124,0.00003006158,0.00016897256,0.00007061998,0.000003971152],"category_scores_gemma":[0.000036945916,0.00006687733,0.000068964364,0.000073996925,0.00012720683,0.0000066817665,0.00008734412,0.000103038125,0.0000023925707],"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.00033176123,0.00014811782,0.14824367,0.00013190646,0.0012510635,0.000014248899,0.0021004127,0.011516963,0.0075349812,0.008211573,0.0017710892,0.81874424],"study_design_scores_gemma":[0.007308446,0.0051662973,0.5691591,0.00013008171,0.00031279086,0.001273952,0.0036044416,0.053451993,0.004616927,0.029184794,0.32435706,0.0014341528],"about_ca_topic_score_codex":0.0000014353766,"about_ca_topic_score_gemma":0.00000414703,"teacher_disagreement_score":0.8173101,"about_ca_system_score_codex":0.00001109731,"about_ca_system_score_gemma":0.00006541013,"threshold_uncertainty_score":0.27271783},"labels":[],"label_agreement":null},{"id":"W1997093937","doi":"10.1186/1471-2164-15-s6-s12","title":"Orthology and paralogy constraints: satisfiability and consistency","year":2014,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":47,"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":"","keywords":"Consistency (knowledge bases); Tree (set theory); Biology; Set (abstract data type); Synteny; Constraint (computer-aided design); Mathematics; Combinatorics; Similarity (geometry); Satisfiability; Phylogenetic tree; Computational biology; Gene; Algorithm; Discrete mathematics; Genetics; Computer science; Artificial intelligence; Genome","score_opus":0.011809594940310222,"score_gpt":0.22729029383705876,"score_spread":0.21548069889674853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997093937","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.99117297,0.00071488775,0.0063297376,0.000092673865,0.000084394764,0.00017747456,0.000015816595,0.0000091759175,0.0014028453],"genre_scores_gemma":[0.98665166,0.00023399944,0.012667825,0.0002115324,0.00008758279,0.000010857581,0.000035908713,0.000013658829,0.00008697502],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991358,0.00009658089,0.00017425155,0.0003566416,0.00003663985,0.00020008467],"domain_scores_gemma":[0.9995222,0.000031816733,0.00005443819,0.0002695116,0.000035300323,0.00008674734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002819705,0.00012452666,0.00016048709,0.00002441701,0.000062587744,0.000016637787,0.00006852557,0.00012997036,0.000019241368],"category_scores_gemma":[0.00010097019,0.0001274113,0.00002930864,0.000020969412,0.0005004454,0.0000016740685,0.0001285014,0.000052981162,0.0000073777105],"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.00006404356,0.000055416825,0.6245857,0.00010963978,0.00007746469,0.0000024102117,0.0002072549,0.000022945944,0.3263195,0.0033306216,0.0002731199,0.04495189],"study_design_scores_gemma":[0.0044335457,0.0012913883,0.87477505,0.000011575508,0.00014351566,0.00057306787,0.00070451264,0.00079565117,0.016797893,0.008353179,0.09096147,0.0011591618],"about_ca_topic_score_codex":0.000011262155,"about_ca_topic_score_gemma":0.0001451464,"teacher_disagreement_score":0.3095216,"about_ca_system_score_codex":0.000007748209,"about_ca_system_score_gemma":0.000048570906,"threshold_uncertainty_score":0.5195682},"labels":[],"label_agreement":null},{"id":"W1997993719","doi":"10.1109/tcbb.2012.57","title":"Scaffold Filling under the Breakpoint and Related Distances","year":2012,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":35,"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 Ottawa; Université de Montréal","funders":"","keywords":"Breakpoint; Genome; Scaffold; Permutation (music); Similarity (geometry); Computer science; Computational biology; Combinatorics; Sequence (biology); Gene; Biology; Genetics; Mathematics; Algorithm; Physics; Artificial intelligence; Image (mathematics)","score_opus":0.013243424560604896,"score_gpt":0.25498862447662013,"score_spread":0.24174519991601523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997993719","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.55466354,0.0013410061,0.44116,0.0013918327,0.00052776,0.00027860145,0.0001066157,0.000029243969,0.00050139363],"genre_scores_gemma":[0.98679256,0.00036881428,0.012168547,0.00037181092,0.00005926192,0.000011832704,0.000104534716,0.0000072236326,0.00011541607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993691,0.000039529303,0.00021872838,0.00011416033,0.00006957589,0.00018890107],"domain_scores_gemma":[0.99959576,0.000090198955,0.000070060654,0.00013899615,0.00004022733,0.00006477925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020014457,0.00012700241,0.000094354764,0.000046620524,0.00028063174,0.00002286871,0.00009250959,0.00012426297,0.000018520508],"category_scores_gemma":[0.000007180625,0.00008827142,0.000042311152,0.00007548767,0.00021363529,0.000014750021,0.000010154595,0.00010271304,0.000012999354],"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.00089840125,0.0017489004,0.017823903,0.0006295428,0.0048437277,0.0000040525792,0.0116787385,0.17374238,0.044150963,0.026167465,0.0027413298,0.71557057],"study_design_scores_gemma":[0.02107625,0.008029824,0.26828742,0.0005311891,0.0018669225,0.003760008,0.024457674,0.33444452,0.07071479,0.14360785,0.11507374,0.008149796],"about_ca_topic_score_codex":0.0000031100417,"about_ca_topic_score_gemma":0.0000039097185,"teacher_disagreement_score":0.7074208,"about_ca_system_score_codex":0.000008457162,"about_ca_system_score_gemma":0.000018959692,"threshold_uncertainty_score":0.3599604},"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":"W2000519643","doi":"10.1093/bioinformatics/btm024","title":"A simulation test bed for hypotheses of genome evolution","year":2007,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Australian Research Council; Genome Atlantic","keywords":"Computer science; Component (thermodynamics); Genetic algorithm; Genome; Software; Horizontal gene transfer; Data mining; Biology; Evolutionary biology; Gene; Genetics","score_opus":0.017961718638179174,"score_gpt":0.26076676186649106,"score_spread":0.2428050432283119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000519643","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.32428864,0.00018221818,0.67365974,0.000012004193,0.00007545482,0.00050880335,0.00007373741,0.000013979246,0.001185402],"genre_scores_gemma":[0.95733315,0.000010521539,0.042206753,0.000027217658,0.000105936866,0.0000065715735,0.00013821358,0.000010570391,0.00016109418],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993731,0.0000033083759,0.00029073935,0.00006908108,0.00009918738,0.00016459741],"domain_scores_gemma":[0.99944645,0.00006383203,0.00014349124,0.00017280676,0.00013702881,0.000036404872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027203336,0.000080512655,0.00008654838,0.00006214818,0.000041335978,0.0000073846654,0.00008951061,0.0000839397,0.0000054028587],"category_scores_gemma":[0.0002914949,0.00007722672,0.00006106464,0.0000725975,0.000031862764,0.0000056394374,0.000031305102,0.000019040612,0.000007063867],"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.00015404045,0.00021009623,0.005620487,0.00043935017,0.0001129391,3.0456752e-7,0.00063037773,0.014113206,0.96426326,0.00026914635,0.00019205238,0.013994734],"study_design_scores_gemma":[0.0063503888,0.0044798553,0.10395439,0.00008676223,0.00023866502,0.0000134020975,0.0027911747,0.34465697,0.4198433,0.0011028493,0.114975415,0.0015068236],"about_ca_topic_score_codex":0.0000019094666,"about_ca_topic_score_gemma":0.000004404438,"teacher_disagreement_score":0.6330445,"about_ca_system_score_codex":0.000020943484,"about_ca_system_score_gemma":0.000029302524,"threshold_uncertainty_score":0.31492144},"labels":[],"label_agreement":null},{"id":"W2002496559","doi":"10.1186/1471-2105-13-s3-s6","title":"Detection of gene expression changes at chromosomal rearrangement breakpoints in evolution","year":2012,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Breakpoint; Biology; Genetics; Gene; Genome; Gene duplication; Chromosomal rearrangement; Chromosome; Computational biology; Karyotype","score_opus":0.013626995074313983,"score_gpt":0.2269050628505561,"score_spread":0.21327806777624211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002496559","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.96531904,0.00075752696,0.032525614,0.000010571546,0.00023555214,0.0003494277,0.000020551499,0.000012932262,0.00076880783],"genre_scores_gemma":[0.97087044,0.00009771512,0.02850114,0.00001830845,0.00018152894,0.0000349119,0.00011493106,0.000015117854,0.00016593515],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99908686,0.000034792592,0.00029163176,0.000103988976,0.00019331506,0.00028944042],"domain_scores_gemma":[0.9994275,0.0000057460484,0.00017303329,0.00027809574,0.000045821642,0.0000698014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002830833,0.00013083224,0.0001287952,0.00010621284,0.00004256485,0.0000058415953,0.000105324725,0.00014074496,0.000023535538],"category_scores_gemma":[0.000032320146,0.00012309103,0.00005024277,0.00011407925,0.00003686923,0.000015407628,0.00013028386,0.000046492594,0.000033558605],"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.00005341738,0.00006832381,0.018894212,0.00012452478,0.000010666242,1.0063848e-7,0.00032443213,0.00006458963,0.9783319,0.0000031592851,0.00008526484,0.0020393801],"study_design_scores_gemma":[0.00073942763,0.00018039998,0.04704652,0.0000337554,0.000013350129,0.000014576566,0.00029239312,0.0021898218,0.9471815,0.0000046660834,0.002134573,0.00016897742],"about_ca_topic_score_codex":0.000013213428,"about_ca_topic_score_gemma":0.00012325497,"teacher_disagreement_score":0.031150391,"about_ca_system_score_codex":0.0000951315,"about_ca_system_score_gemma":0.00001970125,"threshold_uncertainty_score":0.5019506},"labels":[],"label_agreement":null},{"id":"W2003921372","doi":"10.1089/cmb.2005.12.812","title":"Chromosomal Breakpoint Reuse in Genome Sequence Rearrangement","year":2005,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":53,"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; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Breakpoint; Genome; Biology; Computational biology; Sequence (biology); Genetics; Identification (biology); Gene; Reuse; Computer science; Chromosome","score_opus":0.01606047862208839,"score_gpt":0.2841884439062238,"score_spread":0.2681279652841354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003921372","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.9930198,0.0009922354,0.0034499005,0.0019442912,0.00018181711,0.00010083068,0.000018145303,0.000003314719,0.0002896459],"genre_scores_gemma":[0.9742996,0.00015837631,0.024364775,0.0003665425,0.0006155935,0.0000034313025,0.000091328395,0.000010776615,0.0000895772],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894595,0.00009314562,0.00046591976,0.00016623811,0.00013523114,0.00019353104],"domain_scores_gemma":[0.9993089,0.00002272528,0.00024569005,0.00015636017,0.00019724845,0.000069115944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038817685,0.000113145354,0.00018280413,0.00014849055,0.000025902506,0.000010610169,0.00031901934,0.00009488298,0.00006107488],"category_scores_gemma":[0.000073714444,0.000102257814,0.00008930333,0.00009542904,0.000070243375,0.00000801391,0.000106593194,0.00012337111,0.00002262037],"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.00016108491,0.00019742423,0.0052825785,0.000010547663,0.00012457222,0.000029988718,0.0001456166,0.04762824,0.9365019,0.00029723922,0.0007970422,0.008823771],"study_design_scores_gemma":[0.011641572,0.006157984,0.25754458,0.00011298682,0.000094961906,0.0030051486,0.00022207054,0.0045732222,0.035795476,0.01986405,0.65963703,0.0013509062],"about_ca_topic_score_codex":0.0000040754503,"about_ca_topic_score_gemma":0.000010066817,"teacher_disagreement_score":0.9007064,"about_ca_system_score_codex":0.000070238035,"about_ca_system_score_gemma":0.00013538556,"threshold_uncertainty_score":0.4169953},"labels":[],"label_agreement":null},{"id":"W2006716451","doi":"10.1089/cmb.2010.0113","title":"Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Row; Monotone polygon; Logical matrix; Set (abstract data type); Combinatorics; Bounded function; Block matrix; Mathematics; Function (biology); Genome; Property (philosophy); Matrix (chemical analysis); Computer science; Discrete mathematics; Biology; Genetics; Group (periodic table)","score_opus":0.022886922461080095,"score_gpt":0.3087363574746885,"score_spread":0.28584943501360843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006716451","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.9916482,0.00025064376,0.0063230656,0.0008987277,0.00056878396,0.00019351658,0.0000211106,0.0000016459562,0.00009431723],"genre_scores_gemma":[0.9847987,0.00003152331,0.014575065,0.00011243807,0.00040267096,0.000008431167,0.000030887204,0.0000060885545,0.000034182405],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9993476,0.000048131078,0.00030269727,0.000113613954,0.000056277615,0.00013166704],"domain_scores_gemma":[0.99926645,0.00011947758,0.00025599753,0.000053612992,0.00027419618,0.000030283514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003978034,0.000077579985,0.00012615834,0.000059653274,0.000059095022,0.000012169105,0.00013192993,0.00009256741,0.000012795489],"category_scores_gemma":[0.0001304602,0.000046479614,0.00007300945,0.000045744615,0.00014966275,0.0000054672273,0.00002280916,0.00015520392,0.0000011086178],"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.00058180536,0.00009390599,0.03231532,0.000017260729,0.0002603697,0.000004723041,0.00026506104,0.0068404297,0.9248375,0.0004903697,0.00019556191,0.034097686],"study_design_scores_gemma":[0.013356735,0.0065711197,0.7065223,0.00007595866,0.00019106884,0.0066527384,0.0021043036,0.018638609,0.041592713,0.022685703,0.18045695,0.0011518255],"about_ca_topic_score_codex":0.000005918607,"about_ca_topic_score_gemma":0.000024957779,"teacher_disagreement_score":0.8832448,"about_ca_system_score_codex":0.000009748779,"about_ca_system_score_gemma":0.00014746588,"threshold_uncertainty_score":0.18953836},"labels":[],"label_agreement":null},{"id":"W2007567771","doi":"10.1142/s0219720009004199","title":"GENE LOSS UNDER NEIGHBORHOOD SELECTION FOLLOWING WHOLE GENOME DUPLICATION AND THE RECONSTRUCTION OF THE ANCESTRAL POPULUS GENOME","year":2009,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Ottawa","funders":"","keywords":"Genome; Gene duplication; Biology; Populus trichocarpa; Genetics; Gene; Chromosome; Genome evolution; Segmental duplication; Phylogenomics; Gene family; Computational biology; Phylogenetic tree","score_opus":0.006985693473040731,"score_gpt":0.22958404739665136,"score_spread":0.22259835392361063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007567771","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.95567006,0.0008711602,0.04170215,0.0014083429,0.00012363073,0.00014231491,0.000011164255,0.000001750622,0.00006939858],"genre_scores_gemma":[0.99319506,0.00022952394,0.0062056426,0.00021606273,0.000109387074,0.0000011359343,0.00002956909,0.0000030022045,0.000010590588],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99929976,0.000047258087,0.00039790897,0.000069596426,0.00009005405,0.00009541136],"domain_scores_gemma":[0.99931765,0.000018708786,0.00043708633,0.00006668035,0.00012936421,0.000030509345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029934593,0.0000821992,0.00014535848,0.000049633316,0.000107969965,0.000021098263,0.00010260088,0.00007149722,0.0000013082686],"category_scores_gemma":[0.000019043713,0.000045559096,0.000083621344,0.000089243185,0.00012692048,0.000015834483,0.0000315611,0.00008258767,3.1688126e-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.0008065637,0.00021836406,0.033394605,0.000098568125,0.0012458244,0.0000014702845,0.0014869757,0.06332263,0.71822125,0.0101132495,0.00005762447,0.17103289],"study_design_scores_gemma":[0.010927258,0.0030055095,0.79907,0.00006699454,0.0003931373,0.003360506,0.001045845,0.0635705,0.007932851,0.10804192,0.0019421619,0.0006433253],"about_ca_topic_score_codex":0.0000017169575,"about_ca_topic_score_gemma":8.3229475e-7,"teacher_disagreement_score":0.76567537,"about_ca_system_score_codex":0.000013338863,"about_ca_system_score_gemma":0.00005526756,"threshold_uncertainty_score":0.18578461},"labels":[],"label_agreement":null},{"id":"W2012661148","doi":"10.1145/1798596.1798598","title":"An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"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 Victoria","funders":"","keywords":"Mathematics; Cycle basis; Combinatorics; Permutation (music); Hamiltonian path; Eulerian path; Set (abstract data type); Recursion (computer science); Discrete mathematics; Directed graph; Graph; Algorithm; Lagrangian; Computer science; Pure mathematics; Line graph","score_opus":0.013359003754091013,"score_gpt":0.27905269468391103,"score_spread":0.26569369092982004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012661148","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.4239958,0.000045486962,0.57327676,0.00054535386,0.0005728403,0.00073314493,0.0006075092,0.00004626764,0.0001768485],"genre_scores_gemma":[0.96110916,0.000059539314,0.03783332,0.00018932196,0.0002198012,0.00015516477,0.00019935751,0.000045920166,0.00018842256],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989853,0.000039590577,0.00020282774,0.000359477,0.0001669577,0.00024585146],"domain_scores_gemma":[0.9984941,0.00006379013,0.000072884985,0.0011037444,0.0001468905,0.00011858798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002058132,0.00017391391,0.00013071888,0.00007034304,0.0002871278,0.000030416788,0.0006298171,0.0001493688,0.000070839276],"category_scores_gemma":[0.000020980811,0.00014823352,0.00014062962,0.0001549245,0.00011568178,0.000021799173,0.000008446247,0.00018234826,0.0000073471583],"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.00012883625,0.00057288224,0.000030827818,0.000013614593,0.0001753427,0.0000012828524,0.00041368188,0.0048999204,0.7948488,0.00017877694,0.0001208064,0.19861524],"study_design_scores_gemma":[0.0036521067,0.0031790757,0.0016001939,0.0000105155,0.0003421878,0.000043644206,0.0030879336,0.028719012,0.901488,0.0013975943,0.05569243,0.0007873089],"about_ca_topic_score_codex":0.00007998425,"about_ca_topic_score_gemma":0.0002567083,"teacher_disagreement_score":0.53711337,"about_ca_system_score_codex":0.000009039606,"about_ca_system_score_gemma":0.0000681164,"threshold_uncertainty_score":0.6044788},"labels":[],"label_agreement":null},{"id":"W2013476107","doi":"10.1089/cmb.2006.13.1005","title":"The Distribution of Genomic Distance between Random Genomes","year":2006,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Combinatorics; Breakpoint; Random graph; Probability distribution; Distribution (mathematics); Mathematics; Biology; Graph; Computational biology; Genetics; Gene; Statistics","score_opus":0.0060786303690669044,"score_gpt":0.2405020344163715,"score_spread":0.23442340404730458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013476107","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.86774635,0.0046701385,0.12682697,0.00034283125,0.0001465019,0.00007659439,0.00007315845,0.0000014890677,0.00011597577],"genre_scores_gemma":[0.99768716,0.00016779875,0.0012414918,0.0000128458,0.00050146243,0.0000013576109,0.00032675892,0.000005531381,0.000055606113],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991758,0.000088036446,0.00043325571,0.00008445436,0.0000980353,0.00012042928],"domain_scores_gemma":[0.99911,0.000111164445,0.0004174515,0.000077529476,0.00025874758,0.00002511576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035648214,0.00007571579,0.00016362022,0.000026393065,0.00006996909,0.000009379866,0.00018376195,0.00006042807,0.0000039271945],"category_scores_gemma":[0.000031083517,0.000052246276,0.00011653505,0.000047368147,0.00014094073,0.0000025835363,0.000035745215,0.00006189864,0.0000023574728],"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.0017586043,0.0003255471,0.41370866,0.00006345807,0.0015344999,0.00000976578,0.000076411845,0.09347664,0.38131174,0.018693713,0.0105353985,0.07850557],"study_design_scores_gemma":[0.004574656,0.0010516222,0.631012,0.0000149630205,0.000106368585,0.000068928464,0.000045113935,0.0004832498,0.01038843,0.055113707,0.2968645,0.0002764446],"about_ca_topic_score_codex":0.0000033608128,"about_ca_topic_score_gemma":0.00000233025,"teacher_disagreement_score":0.3709233,"about_ca_system_score_codex":0.000021454132,"about_ca_system_score_gemma":0.00007752287,"threshold_uncertainty_score":0.21305414},"labels":[],"label_agreement":null},{"id":"W2013714222","doi":"10.1145/2147805.2147823","title":"A fast method for large-scale multichromosomal breakpoint median problems","year":2011,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","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":"University of Ottawa","funders":"","keywords":"Breakpoint; Computer science; Scale (ratio); Algorithm; Theoretical computer science; Chromosome; Biology; Genetics; Cartography; Geography","score_opus":0.019530979970634972,"score_gpt":0.261281399426076,"score_spread":0.241750419455441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013714222","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.044344228,0.00018999826,0.93953973,0.00021472099,0.0002667959,0.00120052,0.00010451778,0.00005708347,0.014082381],"genre_scores_gemma":[0.19074307,0.000032958724,0.80259824,0.00030277207,0.0003407012,0.0003369826,0.0002459105,0.000061941755,0.005337397],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988841,0.000035928326,0.00019644616,0.00039260523,0.00009837978,0.00039257933],"domain_scores_gemma":[0.99938357,0.000008176006,0.000054799566,0.00032772904,0.00009805264,0.00012767842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029835702,0.00016375874,0.00014851693,0.00003773977,0.00006335567,0.000013065362,0.00019957217,0.00013707021,0.00027382004],"category_scores_gemma":[0.000026334279,0.00014208056,0.00012753201,0.000055505796,0.000024585719,0.0000030482129,0.00011514034,0.00004840239,0.000039498376],"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.00010182746,0.0005130144,0.001928373,0.000105010935,0.00023156597,0.0000034478953,0.001923301,0.0000136451,0.973375,0.00033400816,0.0029355148,0.018535268],"study_design_scores_gemma":[0.004005415,0.0013131546,0.0027977198,0.0000184864,0.00010025787,0.000047341036,0.0011865781,0.008592476,0.87154037,0.00082180917,0.10881479,0.00076159247],"about_ca_topic_score_codex":0.000051993215,"about_ca_topic_score_gemma":0.00037664868,"teacher_disagreement_score":0.14639884,"about_ca_system_score_codex":0.000009677985,"about_ca_system_score_gemma":0.00003402376,"threshold_uncertainty_score":0.5793877},"labels":[],"label_agreement":null},{"id":"W2014859375","doi":"10.1023/b:joco.0000031419.12290.2b","title":"A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":24,"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":"Sorting; Combinatorics; Approximation algorithm; Theory of computation; Mathematics; Graph; Decomposition; Discrete mathematics; Breakpoint; Computer science; Algorithm","score_opus":0.005139858459938569,"score_gpt":0.23965066921381553,"score_spread":0.23451081075387697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014859375","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.014434356,0.00014806168,0.98322874,0.00023473872,0.001507598,0.0003815266,0.0000073355445,0.000007253661,0.0000503579],"genre_scores_gemma":[0.19815774,0.00016213239,0.79980177,0.00006835442,0.0014944203,0.000029043487,0.00021900954,0.00004536086,0.000022178605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914956,0.00003451471,0.00037912323,0.00013266933,0.0001643003,0.00013981048],"domain_scores_gemma":[0.99884737,0.00000774399,0.00041477854,0.000116406256,0.0005482338,0.00006548374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032610033,0.00012031323,0.00015903909,0.000109789544,0.00006207649,0.0000442356,0.0001195798,0.00012809175,0.000006307992],"category_scores_gemma":[0.000043368804,0.00011528435,0.00015637034,0.00011223938,0.000021682852,0.00002314517,0.000020506948,0.00006513204,7.931768e-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.0010095278,0.0012451892,0.00004726827,0.00007466883,0.0005383549,0.0000045577017,0.00044410117,0.51452893,0.4395247,0.0016106612,0.00046191877,0.040510137],"study_design_scores_gemma":[0.063746944,0.014463265,0.0003408737,0.00023223861,0.0006957418,0.0004095804,0.00048378544,0.2222212,0.62201923,0.067736894,0.006036867,0.0016133934],"about_ca_topic_score_codex":0.0000028552479,"about_ca_topic_score_gemma":2.535376e-7,"teacher_disagreement_score":0.2923077,"about_ca_system_score_codex":0.000063512336,"about_ca_system_score_gemma":0.000105992476,"threshold_uncertainty_score":0.47011593},"labels":[],"label_agreement":null},{"id":"W2016638689","doi":"10.5539/mas.v7n8p15","title":"New Permutation Generation Under Exchange Strategy (PGuES)","year":2013,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universiti Utara Malaysia","keywords":"Permutation (music); Starter; Reversing; Computer science; Arithmetic; Mathematical optimization; Algorithm; Mathematics; Chemistry; Engineering; Physics","score_opus":0.022785198940507147,"score_gpt":0.24802631331915745,"score_spread":0.2252411143786503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016638689","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.45210528,0.0001617499,0.5404696,0.00013723904,0.00008993922,0.0003487708,0.0000014373422,0.000019323526,0.0066666463],"genre_scores_gemma":[0.9916289,0.00002320108,0.006012988,0.00020489788,0.000279562,0.000054158318,0.000049154118,0.0000126408195,0.0017345247],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989184,0.000008823086,0.00011186728,0.00042122276,0.00027105256,0.00026860734],"domain_scores_gemma":[0.99948835,0.0000015984848,0.000044539964,0.0002669294,0.00007796674,0.000120617915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016133575,0.000109613786,0.00006380901,0.000057970097,0.0001447034,0.0001364898,0.00024463751,0.00006035617,0.00014391764],"category_scores_gemma":[0.0000053426375,0.00010479221,0.00002134939,0.0001647391,0.0000951822,0.000015674217,0.00008526071,0.0000430658,0.00017026729],"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.0000015466626,0.000009787736,0.000016370272,0.0000022996242,0.000003134199,8.8733984e-8,0.0000940521,0.00097602856,0.9554468,0.00021147881,0.0007832024,0.0424552],"study_design_scores_gemma":[0.00086728885,0.00017937437,0.010397292,0.0000032868766,0.000014938406,0.0000072981475,0.00026875717,0.12628934,0.85261077,0.00695533,0.0018356941,0.00057063054],"about_ca_topic_score_codex":0.00004820079,"about_ca_topic_score_gemma":0.000024113222,"teacher_disagreement_score":0.5395236,"about_ca_system_score_codex":0.000031241234,"about_ca_system_score_gemma":0.00014311766,"threshold_uncertainty_score":0.42733023},"labels":[],"label_agreement":null},{"id":"W2020163930","doi":"10.1089/cmb.2011.0116","title":"Restricted DCJ Model: Rearrangement Problems with Chromosome Reincorporation","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"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 Ottawa","funders":"Universität Bielefeld; Univerzita Komenského v Bratislave","keywords":"Sorting; Combinatorics; Constraint (computer-aided design); Chromosome; Genome; Mathematics; Time complexity; Computer science; Algorithm; Discrete mathematics; Biology; Genetics; Gene","score_opus":0.02783604522470315,"score_gpt":0.23956346261886585,"score_spread":0.2117274173941627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020163930","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.78759515,0.00030383043,0.21027228,0.00026719575,0.00013019012,0.00020857353,0.000011830977,0.000008705785,0.0012022606],"genre_scores_gemma":[0.93496794,0.00006493723,0.06442847,0.00013505683,0.0001790881,0.000006717827,0.00011912486,0.000014942544,0.00008371506],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990897,0.000069554386,0.0003693491,0.00016395614,0.0001589525,0.00014847892],"domain_scores_gemma":[0.99889445,0.000009666542,0.00043281517,0.000113891234,0.0004785287,0.000070622686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000195904,0.00012085498,0.00016387206,0.00012281258,0.000043793563,0.000009090348,0.00016696697,0.000096284166,0.000027595142],"category_scores_gemma":[0.00002167673,0.000092583934,0.00006198584,0.00011586106,0.000077531,0.000009587382,0.000038374164,0.00009733771,0.0000056549015],"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.0014757535,0.00070270366,0.014574486,0.00005951185,0.0009992823,0.000048757833,0.00062816386,0.27256826,0.6956388,0.0032771092,0.0034208368,0.0066063884],"study_design_scores_gemma":[0.035335507,0.07081159,0.21746661,0.0005224731,0.0010764252,0.004672078,0.00057752,0.117597744,0.15820551,0.32833067,0.06087426,0.004529622],"about_ca_topic_score_codex":0.0000031640739,"about_ca_topic_score_gemma":0.0000043907844,"teacher_disagreement_score":0.53743327,"about_ca_system_score_codex":0.000024525845,"about_ca_system_score_gemma":0.00017773731,"threshold_uncertainty_score":0.37754634},"labels":[],"label_agreement":null},{"id":"W2022846158","doi":"10.1089/10665270360688129","title":"Tests for Gene Clustering","year":2003,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":77,"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 Ottawa","funders":"National Human Genome Research Institute","keywords":"Genome; Biology; Gene; Gene duplication; Comparative genomics; Horizontal gene transfer; Gene cluster; Genetics; Genomics; Evolutionary biology; Gene family; Computational biology; Genome evolution","score_opus":0.019888695644746702,"score_gpt":0.29794481290654184,"score_spread":0.27805611726179513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022846158","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.5062876,0.0009252855,0.4918031,0.00018206787,0.00041055816,0.00010543664,0.000011431663,0.0000021805256,0.00027235915],"genre_scores_gemma":[0.88281363,0.000031014013,0.11657154,0.0001769031,0.00028180188,0.0000032356772,0.000039227594,0.000008774494,0.00007388606],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994662,0.000044728513,0.00023120624,0.000090187765,0.000053284915,0.000114409966],"domain_scores_gemma":[0.9994487,0.00004142995,0.00016580381,0.00005233834,0.00024920565,0.000042534935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025624502,0.00006663587,0.000110202556,0.000055441007,0.000032944452,0.0000069675475,0.00008896737,0.000063148786,0.000011453372],"category_scores_gemma":[0.00013034165,0.00005855094,0.00008763651,0.000034853034,0.00002891638,0.0000020658304,0.000016347718,0.00003931405,0.0000024851472],"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.00019208499,0.00015279771,0.0071372837,0.00002682711,0.00037928368,0.0000059359286,0.000050632545,0.05767652,0.91962117,0.0022383293,0.003101883,0.0094172275],"study_design_scores_gemma":[0.011213051,0.007830634,0.025468849,0.000039161958,0.00015305517,0.002642298,0.00014064983,0.004604133,0.19027221,0.0902853,0.6663705,0.0009801615],"about_ca_topic_score_codex":2.2801423e-7,"about_ca_topic_score_gemma":7.05149e-7,"teacher_disagreement_score":0.729349,"about_ca_system_score_codex":0.000010877663,"about_ca_system_score_gemma":0.00008585517,"threshold_uncertainty_score":0.2387638},"labels":[],"label_agreement":null},{"id":"W2028382411","doi":"10.1089/cmb.2011.0086","title":"Theory and Practice of Ultra-Perfection","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","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 Ottawa; Université du Québec à Montréal","funders":"","keywords":"Perfection; Extant taxon; Epistemology; Computer science; Evolutionary biology; Philosophy; Biology","score_opus":0.015535623767214325,"score_gpt":0.27790593920380113,"score_spread":0.2623703154365868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028382411","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.91745853,0.0014403651,0.07778249,0.00010460891,0.00021280386,0.00005789523,0.000005000365,0.0000016841842,0.0029366293],"genre_scores_gemma":[0.98237604,0.00016068816,0.01722883,0.00009848319,0.000103167375,5.154519e-7,0.000008366125,0.000004117128,0.000019772078],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994104,0.00020534008,0.00020721182,0.000067306086,0.000052359355,0.000057379533],"domain_scores_gemma":[0.9992483,0.00013152944,0.00027074307,0.00004125441,0.00027988138,0.000028285749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704491,0.000049440114,0.00009405781,0.000056934383,0.000016634865,0.0000020989794,0.000058294427,0.000057799334,0.000020205662],"category_scores_gemma":[0.00030237582,0.000040822837,0.00004008328,0.000033585093,0.00008467683,0.0000052596,0.000015019392,0.000049463353,0.0000012167162],"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.001890991,0.00030067808,0.008735682,0.000027748758,0.00058301905,0.0000071786976,0.00062146975,0.0006009514,0.9521139,0.015068756,0.00033532808,0.019714275],"study_design_scores_gemma":[0.007835779,0.01903177,0.20137607,0.000081931874,0.00056417973,0.008512326,0.0024247188,0.00018779915,0.4344862,0.26126212,0.06336018,0.00087691634],"about_ca_topic_score_codex":0.0000018498514,"about_ca_topic_score_gemma":2.1718294e-7,"teacher_disagreement_score":0.5176277,"about_ca_system_score_codex":0.0000040555315,"about_ca_system_score_gemma":0.00003832463,"threshold_uncertainty_score":0.1664707},"labels":[],"label_agreement":null},{"id":"W2029036185","doi":"10.1186/1471-2105-10-120","title":"Multichromosomal median and halving problems under different genomic distances","year":2009,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":160,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Genome; Breakpoint; Context (archaeology); Generalization; Time complexity; Biology; Computer science; Computational biology; Genetics; Combinatorics; Mathematics; Chromosome; Gene","score_opus":0.012402740614968691,"score_gpt":0.22283285140290676,"score_spread":0.21043011078793808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029036185","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.9266176,0.001174671,0.0699575,0.00019652508,0.00013939182,0.00042184375,0.000021369404,0.000033323886,0.0014377697],"genre_scores_gemma":[0.9463533,0.00036353507,0.052539233,0.00021211858,0.00014463921,0.000010838192,0.00012449805,0.000014747789,0.00023704444],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99915963,0.000014999051,0.00027019068,0.00015345821,0.00013230371,0.00026940412],"domain_scores_gemma":[0.9995227,0.000009060999,0.00009679326,0.00023428796,0.000028568831,0.00010858645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008472934,0.00017508339,0.00014162794,0.000041200226,0.00008804608,0.000065408676,0.0001427667,0.00009714915,0.000010448813],"category_scores_gemma":[0.000018665196,0.00014469137,0.000049415194,0.0000430122,0.00006487191,0.000009828411,0.00007448885,0.00006269808,0.000013117527],"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.00023187582,0.00088978,0.08284508,0.0019910722,0.00056789623,0.000009393403,0.00737513,0.0066668736,0.70878536,0.002413608,0.0028473213,0.18537663],"study_design_scores_gemma":[0.009566296,0.0029497205,0.49355105,0.0003183965,0.00028882234,0.00018795578,0.005454137,0.41122943,0.04315278,0.003806083,0.026140712,0.0033546418],"about_ca_topic_score_codex":0.0000021268452,"about_ca_topic_score_gemma":0.000050868228,"teacher_disagreement_score":0.66563255,"about_ca_system_score_codex":0.000019860629,"about_ca_system_score_gemma":0.000028252336,"threshold_uncertainty_score":0.59003425},"labels":[],"label_agreement":null},{"id":"W2030381931","doi":"10.1145/332306.332563","title":"Early eukaryote evolution based on mitochondrial gene order breakpoints","year":2000,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":41,"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 Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Medical Research Council Canada","keywords":"Eukaryote; Breakpoint; Phylogenetic tree; Genome; Biology; Phylogenetics; Gene; Evolutionary biology; Computational biology; Genetics; Mitochondrial DNA","score_opus":0.00465035779064313,"score_gpt":0.20599135453617612,"score_spread":0.201340996745533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030381931","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.9593735,0.000085006264,0.010786154,0.00028647727,0.0002672337,0.00032794962,0.000020264548,0.000042148557,0.028811302],"genre_scores_gemma":[0.9685116,0.00002691322,0.01120908,0.0005605261,0.00074754923,0.000031017735,0.0002046097,0.000039723072,0.018668976],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99899024,0.000044833447,0.00014738676,0.00036987424,0.00018671021,0.0002609629],"domain_scores_gemma":[0.99942786,0.0000043797436,0.000026843467,0.00039321728,0.0000635201,0.00008415605],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000062527855,0.00015700712,0.00009803633,0.00004611102,0.00006305382,0.000023310693,0.00014854432,0.00013539944,0.0017150261],"category_scores_gemma":[0.00001545568,0.00014546017,0.00007874469,0.00011888181,0.00003244661,0.000002792855,0.000022126575,0.00006308098,0.0006128996],"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.00052611,0.0002565445,0.0014667625,0.0000069622024,0.00006832464,0.000007905666,0.000018434761,0.0019165613,0.96935004,0.00003759213,0.006781985,0.019562785],"study_design_scores_gemma":[0.013153645,0.0045215515,0.14102545,0.000043735752,0.00013007227,0.00003775532,0.000029873274,0.013683045,0.60352707,0.00041531306,0.22135133,0.0020811614],"about_ca_topic_score_codex":0.00006995108,"about_ca_topic_score_gemma":0.000011440027,"teacher_disagreement_score":0.36582297,"about_ca_system_score_codex":0.000025849291,"about_ca_system_score_gemma":0.000055260032,"threshold_uncertainty_score":0.99919754},"labels":[],"label_agreement":null},{"id":"W2030796019","doi":"10.1007/978-3-642-16181-0_1","title":"Genome Aliquoting Revisited","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Genome; Computer science; Breakpoint; Approximation algorithm; Time complexity; Polyploid; Ancestor; Algorithm; Combinatorics; Mathematics; Genetics; Biology; Gene; Chromosome","score_opus":0.009926857533070866,"score_gpt":0.23363157966796966,"score_spread":0.22370472213489878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030796019","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.0049586752,0.0015334556,0.9860168,0.00020587693,0.00082515035,0.0004446479,0.000015578036,0.00003439472,0.0059654186],"genre_scores_gemma":[0.44899556,0.00064723374,0.534722,0.0028643894,0.006635548,0.000023183647,0.00043414734,0.000246626,0.005431332],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99796844,0.000013285439,0.0002770596,0.00096390385,0.0003571151,0.0004202061],"domain_scores_gemma":[0.9987492,0.000023850263,0.0001571914,0.00081222825,0.00015185139,0.00010567037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047524695,0.00033502345,0.0002674251,0.00024385109,0.0001245946,0.00010879044,0.0009144927,0.00042707697,0.00006329901],"category_scores_gemma":[0.000050567764,0.00032239276,0.00010259893,0.00013431498,0.00039038612,0.0000053528843,0.0006398972,0.00051623216,0.00003910745],"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.000011515466,0.00002078013,0.00016816506,0.00006361023,0.000044619384,0.000040718744,0.00013647568,0.0018371969,0.84915394,0.00018912682,0.0000079113215,0.14832592],"study_design_scores_gemma":[0.002891227,0.0022522034,0.0043396824,0.001147855,0.00021068333,0.00064176146,0.000001045949,0.019381994,0.45378947,0.06090039,0.44676572,0.007677959],"about_ca_topic_score_codex":0.0000036511237,"about_ca_topic_score_gemma":0.00002448967,"teacher_disagreement_score":0.4512948,"about_ca_system_score_codex":0.000046585505,"about_ca_system_score_gemma":0.00017268071,"threshold_uncertainty_score":0.9999228},"labels":[],"label_agreement":null},{"id":"W2030886449","doi":"10.1007/978-3-319-09174-7_33","title":"Fixed-parameter algorithms for scaffold filling","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"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":"Universität Duisburg-Essen; Universidade Federal do Rio de Janeiro; Université de Bordeaux; Universidad de Buenos Aires; Centre National de la Recherche Scientifique; Universidad de Chile; Università di Bologna; Universidade de Lisboa; Qatar University; Athens University of Economics and Business; Université Pierre et Marie Curie; Universität Wien; Università di Pisa; Universitat de València; Universidad de La Laguna; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Universidade de Aveiro","keywords":"Genome; Multiset; Parameterized complexity; Computational biology; Algorithm; Biology; Computer science; Gene; Mathematics; Genetics; Combinatorics","score_opus":0.014568712315176946,"score_gpt":0.2603904553116907,"score_spread":0.24582174299651374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030886449","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.14367764,0.000113652604,0.8553055,0.00018268969,0.00047888968,0.00021019709,0.000002877791,0.000013661461,0.00001492293],"genre_scores_gemma":[0.6229315,0.0000043903474,0.37610158,0.00051812246,0.00040350354,0.00001703332,0.000009931755,0.0000099731515,0.000003972336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862623,0.00002648917,0.00015857197,0.000585799,0.00018977973,0.00041310352],"domain_scores_gemma":[0.9992867,0.000093028066,0.00004944768,0.00040605912,0.000092495844,0.0000722488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056934013,0.00014807336,0.00013194227,0.00010730171,0.000113903705,0.00008887975,0.0005121104,0.00009028924,0.000004052257],"category_scores_gemma":[0.00021432443,0.00013287798,0.00006404384,0.00029195967,0.00016869066,0.000008207477,0.00019396059,0.00006895433,0.0000055215983],"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.000012300958,0.000040984327,0.0017499501,0.0000207793,0.000009945923,8.749961e-7,0.00011090217,0.03477317,0.16101623,0.000018809445,0.000043511314,0.8022025],"study_design_scores_gemma":[0.0006054736,0.0005549631,0.0011036753,0.000022982995,0.000005905409,0.000011150249,5.5151713e-7,0.655275,0.33557722,0.0025001979,0.0040086717,0.00033423718],"about_ca_topic_score_codex":0.0000064502237,"about_ca_topic_score_gemma":0.000012822876,"teacher_disagreement_score":0.8018683,"about_ca_system_score_codex":0.0000221531,"about_ca_system_score_gemma":0.00005004015,"threshold_uncertainty_score":0.54186064},"labels":[],"label_agreement":null},{"id":"W2032125335","doi":"10.1016/j.tcs.2004.05.006","title":"On maximal instances for the original syntenic distance","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université du Québec à Montréal","funders":"","keywords":"Genome; Synteny; Combinatorics; Chromosome; Genetic distance; Biology; Mathematics; Genetics; Gene","score_opus":0.007896712641639192,"score_gpt":0.24957024624216476,"score_spread":0.24167353360052557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032125335","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.15932629,0.00012852222,0.83834565,0.00089861924,0.00031725765,0.0002281985,0.0000061099145,0.00001316618,0.0007361914],"genre_scores_gemma":[0.9792612,0.000018364433,0.020027936,0.0004208399,0.00021982858,0.000022721373,0.0000025712009,0.000007575672,0.000018937002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989283,0.000013765407,0.0001020944,0.00037812509,0.0002517071,0.0003259953],"domain_scores_gemma":[0.9994102,0.000047139667,0.00002859985,0.0003615664,0.000078110155,0.00007438502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000437386,0.000108722066,0.00007615351,0.00002425122,0.00029028734,0.000079505844,0.00070665317,0.000029909757,0.00001189411],"category_scores_gemma":[0.000055448352,0.00006839163,0.000055906905,0.00017251683,0.0017581695,0.0000056031963,0.00013438359,0.00006391952,0.000018652605],"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.00007402962,0.000038114133,0.00001578781,0.0000044030107,0.0000077211525,0.0000012112476,0.000029365732,0.0006460935,0.007798506,0.98455596,0.00004250669,0.0067863096],"study_design_scores_gemma":[0.0037862598,0.005584999,0.002200774,0.00011818673,0.00006240857,0.00008482122,0.00007495507,0.036846388,0.23347287,0.67959195,0.037009425,0.0011669388],"about_ca_topic_score_codex":8.0709924e-7,"about_ca_topic_score_gemma":0.0000014755637,"teacher_disagreement_score":0.8199349,"about_ca_system_score_codex":0.000028316463,"about_ca_system_score_gemma":0.00008219775,"threshold_uncertainty_score":0.6478049},"labels":[],"label_agreement":null},{"id":"W2032410720","doi":"10.1016/j.tcs.2010.11.045","title":"On protein structure alignment under distance constraint","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Waterloo","funders":"","keywords":"Bijection; Mathematics; Combinatorics; Constraint (computer-aided design); Sequence (biology); Enhanced Data Rates for GSM Evolution; Mathematical optimization; Matching (statistics); Algorithm; Computer science; Geometry; Artificial intelligence","score_opus":0.0040224769463836265,"score_gpt":0.22474028448383354,"score_spread":0.2207178075374499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032410720","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.74884546,0.0000050537865,0.24870582,0.00036702582,0.00027607082,0.00020891512,0.000008965345,0.0000146107695,0.0015680527],"genre_scores_gemma":[0.9773554,5.922883e-7,0.02205683,0.00036832475,0.00016602487,0.000006487621,0.00000595138,0.000008570096,0.000031808428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874157,0.000026614225,0.00011280045,0.00046868366,0.0003293057,0.00032105754],"domain_scores_gemma":[0.9992633,0.000011056511,0.00003110027,0.00047896797,0.00006473309,0.0001508626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002951928,0.00013146912,0.0000840323,0.000032380933,0.0001384966,0.000076269986,0.0005166501,0.00006601479,0.00014845788],"category_scores_gemma":[0.000033717806,0.000102626494,0.000034354824,0.00012505447,0.0023024841,0.0000037365846,0.00021844885,0.00015628849,0.000019490688],"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.000007773824,0.000019435216,0.00000885453,0.0000017329128,0.0000027779902,0.0000011071671,0.000010928656,0.00004308193,0.4894256,0.50832117,0.000023841658,0.0021337026],"study_design_scores_gemma":[0.0004571174,0.0005886916,0.00064187485,0.000015646132,0.0000053003705,0.000025310774,0.000011792965,0.004859155,0.81026864,0.18167475,0.0011054274,0.00034629926],"about_ca_topic_score_codex":4.3642535e-7,"about_ca_topic_score_gemma":0.0000017257349,"teacher_disagreement_score":0.32664642,"about_ca_system_score_codex":0.0000136964345,"about_ca_system_score_gemma":0.000062620486,"threshold_uncertainty_score":0.8483599},"labels":[],"label_agreement":null},{"id":"W2034369306","doi":"10.1089/cmb.2011.0136","title":"Genome Halving and Double Distance with Losses","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"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":"","keywords":"Genome; Gene duplication; Tree (set theory); Phylogenetic tree; Gene; Gene rearrangement; Biology; Combinatorics; Genome evolution; Node (physics); Segmental duplication; Genetics; Mathematics; Computational biology; Computer science; Gene family; Physics","score_opus":0.01705976222796272,"score_gpt":0.24128566552039846,"score_spread":0.22422590329243575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034369306","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.93883437,0.0015226823,0.058812164,0.00007946442,0.000062762294,0.000048796675,0.000004333534,0.0000020415932,0.0006334008],"genre_scores_gemma":[0.9773744,0.00008935715,0.022279225,0.00005814066,0.0001236894,0.0000011264975,0.000016744123,0.0000068034005,0.00005054797],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99954605,0.00002261561,0.00017011765,0.0001017972,0.000059950413,0.00009945189],"domain_scores_gemma":[0.9995472,0.0000114074655,0.00016703088,0.00005255518,0.00017323985,0.00004858911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117179196,0.00007234343,0.000110424124,0.000047390393,0.000033761396,0.000007912195,0.00009006288,0.00004309385,0.00002044235],"category_scores_gemma":[0.000007857102,0.00005397489,0.000028851278,0.00003876776,0.00009886693,0.00000487695,0.00003217465,0.000052911266,0.0000017781763],"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.004472649,0.0006249044,0.32755497,0.00012627768,0.0018335034,0.00015364941,0.0014708574,0.0073730536,0.6301847,0.012609658,0.0003913425,0.013204419],"study_design_scores_gemma":[0.010344826,0.008770831,0.8533735,0.00007692255,0.0001781738,0.0032760433,0.00046176804,0.00031796363,0.03477134,0.029848535,0.057602577,0.0009775036],"about_ca_topic_score_codex":0.0000023495609,"about_ca_topic_score_gemma":0.0000025049053,"teacher_disagreement_score":0.5954134,"about_ca_system_score_codex":0.0000066986595,"about_ca_system_score_gemma":0.00005277492,"threshold_uncertainty_score":0.22010322},"labels":[],"label_agreement":null},{"id":"W2038639639","doi":"10.1089/cmb.2010.0126","title":"Combinatorial Structure of Genome Rearrangements Scenarios","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bijection, injection and surjection; Enumeration; Genome; Set (abstract data type); sort; Combinatorics; Mathematics; Construct (python library); Component (thermodynamics); Computer science; Biology; Genetics; Physics; Bijection; Gene; Arithmetic","score_opus":0.005735136830741955,"score_gpt":0.25104857336194397,"score_spread":0.24531343653120202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038639639","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.99572843,0.00016569642,0.0023991955,0.00013003698,0.0012895126,0.00008324183,0.000041879888,0.0000018473781,0.0001601836],"genre_scores_gemma":[0.99078935,0.000016373378,0.008289908,0.00006437865,0.00070441567,4.5410266e-7,0.000109610846,0.000009899856,0.00001559077],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99915105,0.000055300443,0.00039021077,0.000119355755,0.00015432044,0.00012974179],"domain_scores_gemma":[0.99892336,0.000023740422,0.0004081697,0.00011329624,0.00046806465,0.00006335323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018667517,0.00010079436,0.00019868922,0.00010491076,0.000031503416,0.0000070783644,0.00024317933,0.00015244332,0.00010119884],"category_scores_gemma":[0.00008216137,0.00008621683,0.00010283368,0.00007080061,0.000107339096,0.0000042869624,0.00006172978,0.00018310249,0.000002740754],"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.00010815644,0.00006587237,0.0048055514,0.0000087,0.00015146675,0.0000020115351,0.0000306351,0.0016587824,0.99100506,0.0011720924,0.00017266528,0.00081900647],"study_design_scores_gemma":[0.020279443,0.009599684,0.30745673,0.00005330704,0.0003292765,0.0012942313,0.00018929158,0.0008717382,0.26318833,0.21086247,0.18447788,0.001397618],"about_ca_topic_score_codex":0.000002259535,"about_ca_topic_score_gemma":0.0000029058715,"teacher_disagreement_score":0.7278167,"about_ca_system_score_codex":0.000007799424,"about_ca_system_score_gemma":0.0001272855,"threshold_uncertainty_score":0.35158202},"labels":[],"label_agreement":null},{"id":"W2039803514","doi":"10.1186/1748-7188-6-11","title":"Listing all sorting reversals in quadratic time","year":2011,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","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 Ottawa","funders":"","keywords":"Permutation (music); Sorting; Listing (finance); Computer science; Identity (music); Sorting algorithm; Quadratic equation; Algorithm; Time complexity; Combinatorics; Mathematics","score_opus":0.03749375139985743,"score_gpt":0.3000611005173297,"score_spread":0.26256734911747226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039803514","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.8131464,0.0024375948,0.17540956,0.00025274802,0.00056730123,0.002072029,0.00008594605,0.000101384954,0.005927047],"genre_scores_gemma":[0.8204606,0.00009269677,0.17553076,0.0010527233,0.00035356238,0.00039032672,0.0009889002,0.00015084562,0.00097955],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979625,0.00013033308,0.00048280382,0.0006722751,0.00008481641,0.0006673133],"domain_scores_gemma":[0.99913263,0.000027712718,0.00019149606,0.0004454037,0.00009804574,0.000104727864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057228137,0.00028520793,0.00032371868,0.00014160962,0.000058861515,0.000013938179,0.00036116762,0.00031027806,0.000055721437],"category_scores_gemma":[0.00029009962,0.0002962628,0.00018019044,0.0001510493,0.00010549327,0.0000057081165,0.0001781247,0.0001224946,0.000048093505],"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.000057277062,0.0001070436,0.0016143713,0.000029260866,0.0001574134,0.00002375173,0.00019465364,0.000014468248,0.98751205,0.00054379395,0.00017822873,0.009567711],"study_design_scores_gemma":[0.0056786975,0.0034668287,0.0024671194,0.00008990552,0.00022957569,0.00013360662,0.00035639494,0.0062327064,0.933174,0.016934777,0.028994886,0.0022414792],"about_ca_topic_score_codex":0.00009833416,"about_ca_topic_score_gemma":0.000024364976,"teacher_disagreement_score":0.054338004,"about_ca_system_score_codex":0.000029563296,"about_ca_system_score_gemma":0.00006215872,"threshold_uncertainty_score":0.999949},"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":"W2044506914","doi":"10.1089/cmb.2009.0094","title":"Genetic Map Refinement Using a Comparative Genomic Approach","year":2009,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"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":"Directed acyclic graph; Phylogenetic tree; Heuristics; Tree (set theory); Set (abstract data type); Phylogenetic network; Biology; Gene mapping; Graph; Computational biology; Genetics; Computer science; Mathematics; Combinatorics; Algorithm; Gene; Theoretical computer science; Chromosome","score_opus":0.03135141223604313,"score_gpt":0.30297317240939275,"score_spread":0.2716217601733496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044506914","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.8701046,0.0015877967,0.1275567,0.00019054626,0.00014802534,0.000101613434,0.0000068182967,0.0000025090844,0.00030134758],"genre_scores_gemma":[0.84936386,0.000024430075,0.14988835,0.00025186714,0.00039352223,8.197501e-7,0.000044218446,0.00000531272,0.000027591723],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9990947,0.00009222329,0.0003868078,0.0001544695,0.000111720525,0.00016006999],"domain_scores_gemma":[0.99929684,0.000012641614,0.0003096723,0.00008775535,0.00022840696,0.00006465095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017459554,0.00011988564,0.00021466713,0.00010320001,0.000048787366,0.00001266664,0.00017506082,0.000077538614,0.00001671307],"category_scores_gemma":[0.000008850939,0.00010421991,0.00010540024,0.00006056742,0.000054681455,0.0000030161023,0.000034170276,0.00008929833,0.000006084193],"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.00027122346,0.00040813044,0.0039272546,0.000014727485,0.00042199265,0.000011651385,0.00021369489,0.31072792,0.6762032,0.00071311684,0.0020322471,0.0050548785],"study_design_scores_gemma":[0.017774891,0.019795751,0.61421657,0.0001104664,0.00060350087,0.0046933866,0.0009976204,0.115649715,0.021462116,0.06758577,0.13443547,0.0026747552],"about_ca_topic_score_codex":0.0000012830694,"about_ca_topic_score_gemma":2.741775e-7,"teacher_disagreement_score":0.65474105,"about_ca_system_score_codex":0.00003664717,"about_ca_system_score_gemma":0.000121393976,"threshold_uncertainty_score":0.42499644},"labels":[],"label_agreement":null},{"id":"W2045149392","doi":"10.1109/tcbb.2007.1075","title":"Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Clique; Computer science; STRIPS; Computational biology; Data mining; Algorithm; Mathematics; Biology; Combinatorics; Genetics; Gene","score_opus":0.02053758222045991,"score_gpt":0.28812674610366407,"score_spread":0.26758916388320414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045149392","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.6464933,0.00021290882,0.35248384,0.00012397504,0.000090713926,0.0001494396,0.00016715877,0.000010735086,0.0002678952],"genre_scores_gemma":[0.9426934,0.00018082421,0.056305174,0.00022572013,0.0000399631,0.000007962461,0.00048262381,0.000005211269,0.000059097165],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99911016,0.000042912096,0.00035089848,0.00021189611,0.000093417984,0.0001907152],"domain_scores_gemma":[0.99950415,0.00012638132,0.00008758004,0.00015548264,0.00006046715,0.00006596216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028966018,0.0001559133,0.00021016906,0.00023395866,0.00012640117,0.000024383531,0.00009463099,0.00013624667,0.000017068356],"category_scores_gemma":[0.000009681422,0.00014661018,0.000070905415,0.00022515637,0.0001627235,0.000011875573,0.0000126637005,0.00011686876,0.0000057928037],"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.0032378477,0.0020259519,0.15819013,0.00044662712,0.014709263,0.00004264146,0.0244481,0.24180563,0.10080753,0.0016057167,0.0011178072,0.45156276],"study_design_scores_gemma":[0.012338168,0.0034893863,0.7067286,0.00019590383,0.0019484812,0.000087430686,0.018105272,0.18183307,0.041346185,0.018791016,0.011907825,0.003228678],"about_ca_topic_score_codex":0.00006521721,"about_ca_topic_score_gemma":0.00031483316,"teacher_disagreement_score":0.54853845,"about_ca_system_score_codex":0.00002011397,"about_ca_system_score_gemma":0.000021867672,"threshold_uncertainty_score":0.59785897},"labels":[],"label_agreement":null},{"id":"W2045385587","doi":"10.1016/s1476-9271(02)00097-x","title":"Gene teams: a new formalization of gene clusters for comparative genomics","year":2003,"lang":"en","type":"article","venue":"Computational Biology and Chemistry","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":64,"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 à Montréal","funders":"","keywords":"Gene; Comparative genomics; Software; Gene cluster; Computer science; Computational biology; Genetics; Biology; Order (exchange); Genomics; Genome; Programming language","score_opus":0.01356422615412321,"score_gpt":0.26815958746315716,"score_spread":0.25459536130903393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045385587","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.80709624,0.0012043762,0.19087754,0.0000362187,0.0000470477,0.00017130765,0.000066906294,0.0000051203747,0.0004952209],"genre_scores_gemma":[0.95606273,0.000062877625,0.04190424,0.0000848228,0.00009887707,0.000016031443,0.0014866992,0.000008501188,0.00027521094],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994413,0.000017417671,0.00017481874,0.00021047414,0.000033757406,0.00012221327],"domain_scores_gemma":[0.99964833,0.000022167958,0.000097981385,0.00008370487,0.00009514479,0.000052639436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007972494,0.00010397851,0.00013062518,0.000014319727,0.000053921303,0.000005072465,0.00006779369,0.00012586861,0.000013138912],"category_scores_gemma":[0.000025068064,0.00010736221,0.000045756104,0.00003550555,0.000091280286,0.0000024741812,0.000023118082,0.00003010283,7.864539e-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.000068401656,0.000038133065,0.0015598893,0.000042797234,0.000121959005,1.2916027e-7,0.000110374545,0.0042658783,0.9925271,0.00026262162,0.00051430473,0.0004884052],"study_design_scores_gemma":[0.0013334878,0.00013258013,0.000461853,0.0000040180553,0.000027083073,0.000025907395,0.00013126941,0.0017529833,0.98398405,0.0030703386,0.008902457,0.00017399243],"about_ca_topic_score_codex":0.0000014370298,"about_ca_topic_score_gemma":5.5956457e-7,"teacher_disagreement_score":0.1489733,"about_ca_system_score_codex":0.000012057102,"about_ca_system_score_gemma":0.000121169294,"threshold_uncertainty_score":0.4378104},"labels":[],"label_agreement":null},{"id":"W2047165041","doi":"10.1186/1471-2105-9-55","title":"Designing multiple degenerate primers via consecutive pairwise alignments","year":2008,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"McGill University","funders":"University of Tehran","keywords":"Degenerate energy levels; Primer (cosmetics); Computation; Pairwise comparison; Computer science; Algorithm; Cover (algebra); Reduction (mathematics); Computational biology; Theoretical computer science; Biology; Mathematics; Engineering; Physics; Artificial intelligence","score_opus":0.026146798081331638,"score_gpt":0.2254022577459897,"score_spread":0.19925545966465807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047165041","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.3722151,0.0003485558,0.62461233,0.00001628593,0.00022353389,0.0005923575,0.000035729012,0.000050946666,0.001905163],"genre_scores_gemma":[0.45825806,0.00022734837,0.53969365,0.00032443742,0.0001341893,0.000045829092,0.00033961725,0.000039683087,0.0009372106],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988401,0.000045684774,0.00035256823,0.00018535467,0.00021302131,0.000363257],"domain_scores_gemma":[0.99926716,0.000019098,0.00015867224,0.0003339327,0.000088403314,0.000132708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017138565,0.0002152136,0.00016250572,0.000061434075,0.00018210689,0.000019927349,0.00019678724,0.00013741422,0.000018261922],"category_scores_gemma":[0.00006680587,0.0002075203,0.000098167235,0.00010339492,0.0001276286,0.000011908336,0.00012717447,0.00007058785,0.00014144483],"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.00028564173,0.0003516608,0.103669465,0.0002917294,0.0006072514,0.000030081907,0.003775755,0.0053217467,0.8598585,0.00002895882,0.01859016,0.0071890582],"study_design_scores_gemma":[0.0030251618,0.00046693507,0.004246083,0.000028087432,0.000062301275,0.00015717778,0.0009842671,0.079054676,0.89748853,0.000022707683,0.013606645,0.00085745123],"about_ca_topic_score_codex":0.000010131671,"about_ca_topic_score_gemma":0.0000085679185,"teacher_disagreement_score":0.09942338,"about_ca_system_score_codex":0.000031995445,"about_ca_system_score_gemma":0.00012873224,"threshold_uncertainty_score":0.8462432},"labels":[],"label_agreement":null},{"id":"W2049045223","doi":"10.1016/j.jda.2005.06.005","title":"Strictly chordal graphs are leaf powers","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":38,"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":"Chordal graph; Combinatorics; Mathematics; Interval graph; Block graph; Closeness; Tree (set theory); Graph; Adjacency list; Discrete mathematics; Computer science; 1-planar graph","score_opus":0.00895923626441606,"score_gpt":0.2502875828235165,"score_spread":0.24132834655910043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049045223","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.96318984,0.011544402,0.015489048,0.0031002946,0.0013308785,0.00038977765,0.00009934067,0.000027659253,0.0048287357],"genre_scores_gemma":[0.96520364,0.0018503966,0.028630823,0.00051649276,0.0023510305,0.0000055718506,0.00004077568,0.0000684592,0.0013328108],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983104,0.00006645351,0.0005362526,0.00025201574,0.00045335895,0.00038154158],"domain_scores_gemma":[0.9986573,0.0000110930205,0.00052395015,0.00031362887,0.00025861754,0.00023545192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038302407,0.00024032086,0.0003022703,0.00018207077,0.00008076623,0.000056478068,0.00043947966,0.00015325054,0.00008779672],"category_scores_gemma":[0.00006928981,0.00020400384,0.0003551213,0.00020194746,0.000081499784,0.00002293551,0.00009715795,0.00025826853,0.000026001053],"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.0008872907,0.001176943,0.027193485,0.00011747312,0.0029647218,0.00038575532,0.0008566653,0.0032580292,0.60137635,0.00025081105,0.11259141,0.24894106],"study_design_scores_gemma":[0.00762733,0.0037491617,0.030234413,0.00014564832,0.00039204457,0.0010509512,0.0018444307,0.0008734778,0.13705567,0.0005699955,0.81491655,0.0015403498],"about_ca_topic_score_codex":0.000005355664,"about_ca_topic_score_gemma":0.0000100465295,"teacher_disagreement_score":0.7023251,"about_ca_system_score_codex":0.00004392808,"about_ca_system_score_gemma":0.000087691806,"threshold_uncertainty_score":0.8319035},"labels":[],"label_agreement":null},{"id":"W2051551591","doi":"10.1089/cmb.2006.13.1340","title":"On the Similarity of Sets of Permutations and Its Applications to Genome Comparison","year":2006,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":47,"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é du Québec à Montréal","funders":"","keywords":"Genome; Chaining; Similarity (geometry); Generalization; Key (lock); Feature (linguistics); Computer science; Combinatorics; Mathematics; Computational biology; Theoretical computer science; Biology; Gene; Genetics; Artificial intelligence","score_opus":0.01775467834541102,"score_gpt":0.30163803439926734,"score_spread":0.28388335605385634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051551591","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.9580363,0.0005953928,0.03994491,0.0009441396,0.000028292861,0.00016740062,0.00006217216,9.897753e-7,0.00022038285],"genre_scores_gemma":[0.9966179,0.000016265467,0.0031087925,0.000103530976,0.000066803346,0.0000054246166,0.00006263322,0.0000042705815,0.000014383404],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99934316,0.00006141484,0.00034931957,0.00008395379,0.00009241202,0.000069735026],"domain_scores_gemma":[0.99913317,0.00012986863,0.00028986746,0.00006715939,0.00035084898,0.000029072735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000195618,0.00006233054,0.00014660782,0.00007686241,0.000038997132,0.0000035550106,0.00012110911,0.00004947882,0.000011297364],"category_scores_gemma":[0.00005114616,0.000046353693,0.000052745083,0.00008545511,0.000060878185,0.000001925239,0.000035329012,0.000058204714,0.0000017361962],"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.00016141363,0.000505545,0.009614994,0.000043970307,0.00025970532,8.18556e-7,0.00017851313,0.1897452,0.74452084,0.05178453,0.0014189645,0.0017654827],"study_design_scores_gemma":[0.0031309556,0.005330883,0.6939421,0.000050928316,0.00021639076,0.00016965278,0.00042419872,0.007104199,0.096697785,0.15250145,0.03983404,0.00059739006],"about_ca_topic_score_codex":0.0000025275813,"about_ca_topic_score_gemma":0.000002635558,"teacher_disagreement_score":0.6843271,"about_ca_system_score_codex":0.0000062339177,"about_ca_system_score_gemma":0.000051293748,"threshold_uncertainty_score":0.18902487},"labels":[],"label_agreement":null},{"id":"W2053714321","doi":"10.1109/itw.2007.4313080","title":"Is SP BP?","year":2007,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","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":"University of Ottawa","funders":"","keywords":"Constraint satisfaction problem; Formalism (music); Markov random field; Constraint (computer-aided design); Markov chain; Constraint satisfaction; Computer science; Markov process; Theoretical computer science; Mathematical optimization; Discrete mathematics; Mathematics; Artificial intelligence; Combinatorics; Machine learning; Statistics; Probabilistic logic","score_opus":0.011182997352021511,"score_gpt":0.2612817501280841,"score_spread":0.2500987527760626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053714321","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.8393559,0.00039380413,0.02065608,0.00032175926,0.00015410148,0.00011535429,0.0000031927839,0.000020193818,0.13897963],"genre_scores_gemma":[0.9727087,0.00004703453,0.005114014,0.0013582171,0.00025166865,0.0000018680888,0.000023956933,0.000012450439,0.020482065],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952763,0.000003836994,0.00007763936,0.00015134971,0.00007018781,0.00016936073],"domain_scores_gemma":[0.99971855,0.0000017931586,0.000014537583,0.00018739278,0.00002714626,0.00005057495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013762506,0.0000606482,0.000040591283,0.000020267053,0.000021786023,0.000007246053,0.000084461695,0.00005850443,0.00034917385],"category_scores_gemma":[0.000006203611,0.00005449771,0.000040318468,0.000042258434,0.00001728219,5.5515716e-7,0.000048187885,0.000023821136,0.00016889075],"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.000016714057,0.000037528247,0.009494917,0.000005441615,0.000041203482,0.0000044773847,0.000038156697,9.5233804e-7,0.94203776,0.00015103984,0.032145128,0.016026704],"study_design_scores_gemma":[0.00020435466,0.00006922352,0.0084451,7.9311036e-7,0.000003911094,0.0000050261892,0.000049129045,0.000005712393,0.54875386,0.000051412382,0.44231543,0.00009605835],"about_ca_topic_score_codex":0.000008529285,"about_ca_topic_score_gemma":0.000015192744,"teacher_disagreement_score":0.4101703,"about_ca_system_score_codex":0.0000043945515,"about_ca_system_score_gemma":0.000009296837,"threshold_uncertainty_score":0.38232088},"labels":[],"label_agreement":null},{"id":"W2054547415","doi":"10.1089/106652701300099119","title":"Perfect Phylogenetic Networks with Recombination","year":2001,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":216,"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":"Phylogenetic tree; Phylogenetic network; Recombination; Phylogenetics; Tree (set theory); Time complexity; Mathematics; Evolutionary biology; Biology; Combinatorics; Computer science; Genetics; Gene","score_opus":0.007125730998609258,"score_gpt":0.2408557460107803,"score_spread":0.23373001501217106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054547415","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.8393068,0.0008592559,0.1589122,0.00030176586,0.00017928574,0.00006899359,0.000001357799,0.000002855345,0.0003675018],"genre_scores_gemma":[0.9909842,0.00020687887,0.008125323,0.00015530421,0.00037260726,0.0000020572363,0.00006039335,0.000010424636,0.00008278765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993395,0.0000848976,0.00022941909,0.000118860786,0.000093816336,0.00013348575],"domain_scores_gemma":[0.9993204,0.00002888897,0.00022266063,0.00006948215,0.0003076611,0.000050918734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002184243,0.00009129107,0.000130274,0.00008235119,0.000040340397,0.000010664198,0.0001237713,0.00008013881,0.000031220065],"category_scores_gemma":[0.0000235292,0.00007083594,0.00006181233,0.00009773399,0.000056009976,0.0000032977887,0.000023305998,0.00008441081,0.0000042035613],"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.0009656858,0.0003835708,0.1649445,0.000013597299,0.0007019946,0.00005367761,0.000066414475,0.6868437,0.07161407,0.0006916008,0.0020511986,0.07167],"study_design_scores_gemma":[0.016442463,0.028968412,0.70174927,0.00011958741,0.00034403522,0.009834047,0.00021947027,0.041392572,0.008591129,0.023434257,0.16723296,0.0016718305],"about_ca_topic_score_codex":9.5031083e-7,"about_ca_topic_score_gemma":0.0000020294863,"teacher_disagreement_score":0.6454511,"about_ca_system_score_codex":0.000015855201,"about_ca_system_score_gemma":0.00006741132,"threshold_uncertainty_score":0.28886056},"labels":[],"label_agreement":null},{"id":"W2055696807","doi":"10.1109/tcbb.2007.1069","title":"Comparing Genomes with Duplications: A Computational Complexity Point of View","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Genome; Computational biology; Point (geometry); Computer science; Segmental duplication; Biology; Evolutionary biology; Genetics; Theoretical computer science; Mathematics; Gene","score_opus":0.02952972484559656,"score_gpt":0.28290634729385544,"score_spread":0.25337662244825887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055696807","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.18848999,0.00019288549,0.81036973,0.00020563377,0.00006308594,0.00027258572,0.00008657466,0.000019697569,0.0002998],"genre_scores_gemma":[0.7803793,0.00007529917,0.21891563,0.00020410119,0.00002772903,0.000011209953,0.0003591091,0.000009050386,0.000018593419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894637,0.000031697105,0.00046574205,0.00020384496,0.00014575558,0.0002066074],"domain_scores_gemma":[0.99917084,0.00012502585,0.00018722894,0.00021191253,0.00022128069,0.00008374116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030072418,0.0001799505,0.00022125227,0.00016179113,0.00019638494,0.000015248292,0.0001693527,0.00011309611,0.000018641129],"category_scores_gemma":[0.000009560265,0.00015534756,0.000063964224,0.00018087229,0.0003759683,0.000013972232,0.000013553834,0.00011987553,0.000010567714],"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.0020128135,0.0022249352,0.0390963,0.0010291801,0.0026647984,0.0000068740937,0.00254103,0.6746541,0.011225805,0.017907737,0.0003722493,0.24626417],"study_design_scores_gemma":[0.0194459,0.011139272,0.29762158,0.00055547856,0.00074618653,0.0013355708,0.004102292,0.52393824,0.03551609,0.085470356,0.015877623,0.004251422],"about_ca_topic_score_codex":0.0000077956365,"about_ca_topic_score_gemma":0.00002854173,"teacher_disagreement_score":0.59188926,"about_ca_system_score_codex":0.000020292997,"about_ca_system_score_gemma":0.00007222156,"threshold_uncertainty_score":0.63348895},"labels":[],"label_agreement":null},{"id":"W2057331967","doi":"10.1142/9781848161092_0025","title":"GENOME HALVING WITH DOUBLE CUT AND JOIN","year":2007,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Ottawa","funders":"","keywords":"Join (topology); Computer science; Genome; Genetics; Biology; Mathematics; Combinatorics; Gene","score_opus":0.00876260397656052,"score_gpt":0.22604301005480892,"score_spread":0.2172804060782484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057331967","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.96184397,0.0005205459,0.010019509,0.000070039496,0.000023301443,0.00012722016,9.041437e-7,0.000013237881,0.027381279],"genre_scores_gemma":[0.9885838,0.000064919615,0.0056817606,0.000103299724,0.0001109756,0.0000034485272,0.000021655122,0.000015114801,0.0054150242],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994425,0.000004123189,0.00007982945,0.0002010947,0.000072061994,0.00020038224],"domain_scores_gemma":[0.9997198,0.0000023513255,0.000021593376,0.00015677004,0.000029748011,0.000069756505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016035933,0.00008519936,0.000063208194,0.000029928817,0.00004263741,0.000019472922,0.000059013266,0.000049356076,0.000046110094],"category_scores_gemma":[0.0000023036007,0.000067247296,0.000016041507,0.000046334248,0.00003693678,0.0000017823611,0.00006136906,0.000033343884,0.000011245521],"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.00008801564,0.000023328043,0.008964124,0.00001165248,0.000049450788,0.0000094693605,0.00004821153,0.000007313617,0.98881567,0.00011763091,0.00009467245,0.0017704943],"study_design_scores_gemma":[0.0036489053,0.0008096787,0.108205795,0.000010998422,0.00004135391,0.00015526694,0.00052546273,0.00003150196,0.7328601,0.000060552436,0.15300955,0.000640879],"about_ca_topic_score_codex":0.000019375391,"about_ca_topic_score_gemma":0.00012857885,"teacher_disagreement_score":0.25595558,"about_ca_system_score_codex":0.0000058613846,"about_ca_system_score_gemma":0.000012826742,"threshold_uncertainty_score":0.27422652},"labels":[],"label_agreement":null},{"id":"W2060480089","doi":"10.1186/1471-2164-10-180","title":"Bos taurus genome assembly","year":2009,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":162,"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":"Norges Forskningsråd; Commonwealth Scientific and Industrial Research Organisation; AgResearch; Genome British Columbia; Robert J. Kleberg, Jr. and Helen C. Kleberg Foundation; National Human Genome Research Institute; Agricultural Research Service; Genome Canada; U.S. Department of Agriculture; Cooperative State Research, Education, and Extension Service; National Institutes of Health; U.S. Department of Health and Human Services","keywords":"Sequence assembly; Contig; Genome; Hybrid genome assembly; Biology; Reference genome; Computational biology; Genetics; Whole genome sequencing; Gene","score_opus":0.014638541849323276,"score_gpt":0.23950228109477223,"score_spread":0.22486373924544895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060480089","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.98406273,0.0013675633,0.00739494,0.00013358492,0.00016116012,0.00029166785,0.000019776204,0.0000312456,0.0065373266],"genre_scores_gemma":[0.97902274,0.0002752006,0.016558148,0.0005837864,0.0006776619,0.00001246874,0.00019476323,0.000036620877,0.0026385877],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988952,0.000031345342,0.00020939307,0.00038371971,0.00011740397,0.000362904],"domain_scores_gemma":[0.9992488,0.000004211023,0.00007466765,0.00050076767,0.000053421074,0.000118118776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015517687,0.00018959114,0.000148939,0.00005047889,0.00007575698,0.00004322021,0.00030839193,0.00014373774,0.000031999523],"category_scores_gemma":[0.000024522682,0.00020248395,0.00011888168,0.00007691946,0.000026936283,0.0000029099278,0.00008183186,0.00007403087,0.00017343211],"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.000029382612,0.00005893465,0.0004864053,0.000006550208,0.000024890318,0.0000030931474,0.000042210344,0.00030034166,0.9951603,0.00007274264,0.00077456696,0.0030405875],"study_design_scores_gemma":[0.0021081618,0.0011615984,0.061110478,0.0000069304124,0.000078848665,0.00006997824,0.00021036492,0.00041936972,0.33729425,0.0006580804,0.59569514,0.0011867986],"about_ca_topic_score_codex":0.0000047283047,"about_ca_topic_score_gemma":0.000018078508,"teacher_disagreement_score":0.657866,"about_ca_system_score_codex":0.00004408934,"about_ca_system_score_gemma":0.000103841485,"threshold_uncertainty_score":0.8257056},"labels":[],"label_agreement":null},{"id":"W2062258393","doi":"10.1142/9781860947995_0023","title":"EXPLORING GENOME REARRANGEMENTS USING VIRTUAL HYBRIDIZATION","year":2007,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","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":"Simon Fraser University; Université du Québec à Montréal","funders":"","keywords":"Computer science; Genome; Computational biology; Biology; Genetics; Gene","score_opus":0.09634611967119691,"score_gpt":0.27762762412352215,"score_spread":0.18128150445232524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062258393","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.86891395,0.00008877078,0.12712465,0.000012151092,0.00019715741,0.00015299226,0.000002670462,0.000022725455,0.0034849527],"genre_scores_gemma":[0.99092096,0.00010555587,0.0072593656,0.000094609546,0.0004204062,0.0000069252314,0.000096400094,0.000030237255,0.001065512],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990745,0.000016005662,0.00018464187,0.00027071903,0.00016209517,0.0002919968],"domain_scores_gemma":[0.99956983,0.0000031945353,0.0000478313,0.00023469642,0.000064657026,0.00007978432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033184243,0.000119789554,0.000079333244,0.00008067395,0.000076739816,0.000020866035,0.000118192824,0.000045403238,0.00006979247],"category_scores_gemma":[0.000021179936,0.00012444935,0.000047154117,0.00012419529,0.000023489874,0.000009185927,0.00009778088,0.000039593364,0.000036859397],"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.000021680633,0.000027243203,0.001273473,0.0000043632094,0.000037184436,0.000004084288,0.000043082993,0.00026667016,0.99354655,0.000050904364,0.000033292552,0.00469147],"study_design_scores_gemma":[0.0014161929,0.0004384554,0.030672964,0.000013248152,0.0000480222,0.00003077417,0.00085738825,0.00053235184,0.8914124,0.000030079578,0.07384336,0.0007047791],"about_ca_topic_score_codex":0.000018047442,"about_ca_topic_score_gemma":0.000011569564,"teacher_disagreement_score":0.122007065,"about_ca_system_score_codex":0.000031485317,"about_ca_system_score_gemma":0.000018231338,"threshold_uncertainty_score":0.5074897},"labels":[],"label_agreement":null},{"id":"W2062347965","doi":"10.1089/cmb.2011.0133","title":"Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sorting; Perspective (graphical); Listing (finance); Computer science; Genome; Algorithm; Genomics; Sequence (biology); Theoretical computer science; Biology; Artificial intelligence; Genetics; Gene","score_opus":0.05445580679385164,"score_gpt":0.28472176222363027,"score_spread":0.23026595542977862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062347965","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.9200696,0.0067302384,0.0706812,0.00073423114,0.00038722417,0.00012924308,0.000013487157,0.0000089819905,0.0012458323],"genre_scores_gemma":[0.90409917,0.00029091453,0.09489477,0.00015344385,0.00043845057,6.826693e-7,0.000018524868,0.000008991486,0.0000950457],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928683,0.000066329245,0.00025755484,0.00015991571,0.00008593273,0.00014346068],"domain_scores_gemma":[0.9993468,0.000031333613,0.00025050214,0.000060209368,0.00021057301,0.000100613295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002222769,0.000101940874,0.00015201504,0.000073027404,0.000037666403,0.0000108982385,0.00013615451,0.000087577806,0.000031576863],"category_scores_gemma":[0.000087103756,0.000087525026,0.00006588558,0.000047112073,0.00011524953,0.000007189139,0.000055666707,0.000097218894,0.0000030032602],"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.0022284966,0.0013972746,0.14600131,0.00015615043,0.0065740934,0.0005699886,0.030934097,0.008449995,0.4805055,0.018939244,0.019603396,0.28464043],"study_design_scores_gemma":[0.021366963,0.028086003,0.34019214,0.00030926339,0.0009822119,0.016385254,0.015664266,0.0070210686,0.039964307,0.39535177,0.13068266,0.0039940886],"about_ca_topic_score_codex":0.000025334857,"about_ca_topic_score_gemma":0.0000025008953,"teacher_disagreement_score":0.4405412,"about_ca_system_score_codex":0.000016630675,"about_ca_system_score_gemma":0.0001441644,"threshold_uncertainty_score":0.3569167},"labels":[],"label_agreement":null},{"id":"W2064296763","doi":"10.1089/cmb.2006.13.554","title":"Stability of Rearrangement Measures in the Comparison of Genome Sequences","year":2006,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":19,"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 Ottawa","funders":"","keywords":"Genome; Biology; Evolutionary biology; Gene rearrangement; Tree (set theory); Computational biology; Genetics; Mathematics; Combinatorics; Gene","score_opus":0.030405882720506743,"score_gpt":0.3033162470871048,"score_spread":0.27291036436659805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064296763","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.991118,0.001893924,0.006270658,0.00027146444,0.000063074964,0.00009771679,0.000015684807,6.011874e-7,0.00026883473],"genre_scores_gemma":[0.99646384,0.0000296023,0.0033357786,0.000024646113,0.0000984481,0.0000016122837,0.00004058669,0.0000029975806,0.0000024880824],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99881417,0.00021501996,0.0005992687,0.000087804285,0.00019002371,0.00009371173],"domain_scores_gemma":[0.9990484,0.000068553825,0.00047171736,0.000089891415,0.00030785787,0.000013582034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000817855,0.00006965898,0.00021827631,0.00007622092,0.00001617541,0.0000034388943,0.00022616689,0.00005753408,0.000013305694],"category_scores_gemma":[0.000045953107,0.000047648406,0.00008814359,0.0000965348,0.00015000555,0.000002944466,0.000026116302,0.00007225223,4.1777184e-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.00013231521,0.0003465162,0.15429041,0.000027449552,0.00008321943,0.0000013820327,0.00023099929,0.028994048,0.8138351,0.0006371843,0.00014423043,0.0012771847],"study_design_scores_gemma":[0.0019241027,0.0026688064,0.87595695,0.000028006298,0.000058374513,0.000055110682,0.0010675635,0.0005184408,0.092170276,0.0187437,0.006597318,0.00021136749],"about_ca_topic_score_codex":0.000033439785,"about_ca_topic_score_gemma":0.000033267195,"teacher_disagreement_score":0.7216665,"about_ca_system_score_codex":0.000014197359,"about_ca_system_score_gemma":0.00008786871,"threshold_uncertainty_score":0.19430457},"labels":[],"label_agreement":null},{"id":"W2065935611","doi":"10.1186/1471-2164-15-s6-s1","title":"Near-medians that avoid the corners; a combinatorial probability approach","year":2014,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Equidistant; Phylogenetic tree; Median; Context (archaeology); Biology; Set (abstract data type); Breakpoint; Evolutionary biology; Artifact (error); Statistics; Computational biology; Combinatorics; Mathematics; Genetics; Computer science; Gene; Paleontology","score_opus":0.0211863178538946,"score_gpt":0.214371047926238,"score_spread":0.1931847300723434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065935611","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.9809899,0.0002081067,0.0121190455,0.00014617534,0.0006851767,0.0006916777,0.000017292463,0.000025244208,0.0051173824],"genre_scores_gemma":[0.9898326,0.000031125786,0.008596608,0.00019270448,0.0007452988,0.00007589131,0.00014302453,0.000038001403,0.00034478394],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987472,0.00016331252,0.00017628128,0.00042103892,0.00016186012,0.000330279],"domain_scores_gemma":[0.998961,0.00002819197,0.00009085771,0.00077018,0.000055575732,0.00009421185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000633868,0.00018804496,0.00015869376,0.00001395905,0.00018530923,0.00007917208,0.00045821085,0.00016080734,0.000010550784],"category_scores_gemma":[0.00010902929,0.00014561953,0.0001246725,0.00006565689,0.00021223474,0.0000025699553,0.00020691632,0.00013525989,0.00004479843],"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.0016620986,0.0031627195,0.22387752,0.0011653687,0.0011303163,0.000004957449,0.0077017983,0.01891171,0.653117,0.020702455,0.041902717,0.02666135],"study_design_scores_gemma":[0.0060234624,0.0010056255,0.018662889,0.00001152491,0.00018883486,0.000051269635,0.001058307,0.01915878,0.05341065,0.009261411,0.8896119,0.0015553518],"about_ca_topic_score_codex":0.000022663093,"about_ca_topic_score_gemma":0.000042344487,"teacher_disagreement_score":0.8477092,"about_ca_system_score_codex":0.00004138096,"about_ca_system_score_gemma":0.00014027173,"threshold_uncertainty_score":0.5938192},"labels":[],"label_agreement":null},{"id":"W2066454279","doi":"10.1142/s0129054106004194","title":"SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"National Natural Science Foundation of China; McMaster University","keywords":"Mathematics; Social connectedness; Combinatorics; Permutation (music); Sorting; Parity of a permutation; Sign (mathematics); Discrete mathematics; Cyclic permutation; Algorithm; Symmetric group; Physics","score_opus":0.006583382107404011,"score_gpt":0.27276763834056134,"score_spread":0.26618425623315733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066454279","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.4880419,0.000097773256,0.50999165,0.0006292023,0.0006405345,0.00005216557,0.000011518547,0.0000032009657,0.00053203275],"genre_scores_gemma":[0.95603657,0.000016311335,0.043367613,0.00005907181,0.00036646408,0.0000010818337,0.000027451888,0.000004770393,0.000120671444],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880093,0.00002146713,0.0004139533,0.00013500062,0.00051727745,0.00011135357],"domain_scores_gemma":[0.99818015,0.000023924067,0.0004303027,0.00012120445,0.0012038331,0.000040559487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043903038,0.0000679742,0.000086468244,0.00019592686,0.00008371772,0.000092997245,0.00067535473,0.000024121906,0.000021221136],"category_scores_gemma":[0.00008713226,0.00006598588,0.00007722531,0.00017411009,0.00020084534,0.000049077422,0.00010356781,0.000048851027,0.000003525676],"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.000016696778,0.00018614353,0.003243521,0.0000037065176,0.00008427081,0.0000037565892,0.00009704444,0.0057290415,0.9704975,0.0014475867,0.004583904,0.014106869],"study_design_scores_gemma":[0.004439203,0.0016134303,0.052287742,0.00020816519,0.000119306664,0.0006062855,0.00027410654,0.026725484,0.84514964,0.009366341,0.058278065,0.0009322471],"about_ca_topic_score_codex":0.0000148478,"about_ca_topic_score_gemma":0.000003631293,"teacher_disagreement_score":0.46799463,"about_ca_system_score_codex":0.000040959752,"about_ca_system_score_gemma":0.00021849817,"threshold_uncertainty_score":0.26908258},"labels":[],"label_agreement":null},{"id":"W2068396445","doi":"10.1089/cmb.2006.13.567","title":"On Sorting by Translocations","year":2006,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"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é du Québec à Montréal","funders":"","keywords":"Sorting; Chromosomal translocation; Sorting algorithm; Genome; Chromosome; Computer science; Algorithm; Computational biology; Biology; Mathematics; Genetics; Gene","score_opus":0.005620043957935987,"score_gpt":0.250474535487991,"score_spread":0.24485449153005498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068396445","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.86175144,0.0007365888,0.13505606,0.00091114326,0.00017292309,0.000056613142,0.000018005729,0.0000034599582,0.00129374],"genre_scores_gemma":[0.99415714,0.000012487188,0.0050654025,0.00020218689,0.0002673261,0.0000013201092,0.0001586531,0.0000066963585,0.00012876278],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994162,0.000042931835,0.00027596907,0.00008649193,0.00008115253,0.0000973027],"domain_scores_gemma":[0.9995526,0.000035988392,0.00018620529,0.00004733671,0.00015063024,0.000027207985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014262491,0.000065291766,0.000091506336,0.00005722681,0.00003967055,0.0000072673274,0.000095746116,0.000058927584,0.000020197083],"category_scores_gemma":[0.00002663336,0.000056961984,0.00007155283,0.000048649545,0.000039148523,0.0000019913668,0.000008529249,0.00006280567,0.000007396128],"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.0001459891,0.0004265773,0.0049916417,0.000010278387,0.0001986626,0.0000050717726,0.000029740246,0.10675262,0.81718624,0.014003871,0.045339026,0.010910304],"study_design_scores_gemma":[0.01007514,0.0084992815,0.05249779,0.00007361763,0.00017508084,0.00072016445,0.00013746913,0.0045510773,0.1546614,0.49553394,0.27174905,0.0013260014],"about_ca_topic_score_codex":0.0000026988175,"about_ca_topic_score_gemma":0.0000012841041,"teacher_disagreement_score":0.6625248,"about_ca_system_score_codex":0.0000103882885,"about_ca_system_score_gemma":0.000051344374,"threshold_uncertainty_score":0.23228423},"labels":[],"label_agreement":null},{"id":"W2068463402","doi":"10.1016/j.endm.2009.07.020","title":"On the Gapped Consecutive-Ones Property","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"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":"Parameterized complexity; Conjecture; Combinatorics; Mathematics; Logical matrix; Graph; Function (biology); Binary number; Discrete mathematics; Physics","score_opus":0.01140264538665462,"score_gpt":0.24975593032888882,"score_spread":0.2383532849422342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068463402","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.97911745,0.0007781969,0.008137813,0.0038705936,0.00004877774,0.0008882445,0.0000072205576,0.00003133414,0.007120349],"genre_scores_gemma":[0.99742484,0.00014267232,0.0009590374,0.00045058562,0.00006207602,0.000034500543,0.000020422212,0.00002089671,0.00088495814],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99884015,0.00006154357,0.00022004593,0.0002539689,0.00017065088,0.0004536421],"domain_scores_gemma":[0.99931955,0.000074666146,0.00007725046,0.0004670476,0.000028740267,0.000032724398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035408104,0.00018930556,0.00015973627,0.000038349597,0.00006867506,0.000030143237,0.0003031338,0.0000852638,0.000051057003],"category_scores_gemma":[0.0003022982,0.00010488027,0.000074722346,0.00012429104,0.00007331786,0.0000026092239,0.000050523337,0.00018508057,0.0000392319],"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.00033555823,0.0013336434,0.00058175944,0.00014469356,0.00035805284,0.000022437978,0.0021165875,0.0005286176,0.77586925,0.1981078,0.004712037,0.015889574],"study_design_scores_gemma":[0.0033213224,0.0051510097,0.0016915991,0.00032879668,0.00011396711,0.00009636401,0.00080064975,0.008174038,0.57009816,0.38781458,0.020593964,0.0018155779],"about_ca_topic_score_codex":0.0000036589151,"about_ca_topic_score_gemma":0.000021024802,"teacher_disagreement_score":0.2057711,"about_ca_system_score_codex":0.000042129293,"about_ca_system_score_gemma":0.000076846474,"threshold_uncertainty_score":0.42768934},"labels":[],"label_agreement":null},{"id":"W2068896404","doi":"10.1109/tcbb.2007.1011","title":"Perfect Sorting by Reversals Is Not Always Difficult","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Université du Québec à Montréal","funders":"","keywords":"Sorting; Pairwise comparison; Simple (philosophy); Computation; Class (philosophy); Time complexity; Computer science; Combinatorics; Permutation (music); Mathematics; Algorithm; Discrete mathematics; Theoretical computer science; Artificial intelligence; Physics","score_opus":0.012927118915298616,"score_gpt":0.27049988287745647,"score_spread":0.25757276396215784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068896404","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.31895941,0.00012415487,0.6793383,0.0005007189,0.00024917617,0.00022457093,0.00022954067,0.000032533342,0.0003416304],"genre_scores_gemma":[0.95550036,0.00018056425,0.041855253,0.0016555791,0.000089653535,0.000009467003,0.0003942273,0.00001446926,0.0003004209],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989361,0.000027944678,0.0003970185,0.0002281806,0.00012701575,0.00028373318],"domain_scores_gemma":[0.99936175,0.00010364885,0.00012775659,0.00018956384,0.00012026923,0.00009699486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003209673,0.00019325707,0.00015742247,0.00009594992,0.00026288457,0.000024843033,0.0001528478,0.00022612473,0.000035102894],"category_scores_gemma":[0.000028336395,0.0001735307,0.00008141452,0.00012996381,0.00013829843,0.00001139016,0.000011104213,0.00015473708,0.000037906935],"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.00095240166,0.0009939123,0.0049525835,0.00035556845,0.0015493018,0.0000084468375,0.0029149952,0.012864915,0.4591749,0.00037530952,0.017044673,0.498813],"study_design_scores_gemma":[0.009832058,0.005669083,0.01274497,0.00015179295,0.00043170387,0.00044282977,0.0028346968,0.061677516,0.8020977,0.003706299,0.096952565,0.003458812],"about_ca_topic_score_codex":0.0000063694374,"about_ca_topic_score_gemma":0.0000057306647,"teacher_disagreement_score":0.637483,"about_ca_system_score_codex":0.000019108518,"about_ca_system_score_gemma":0.000037232658,"threshold_uncertainty_score":0.7076376},"labels":[],"label_agreement":null},{"id":"W2072483773","doi":"10.1089/cmb.2009.0088","title":"Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes","year":2009,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Computation; Computer science; Mathematics; Biology; Algorithm","score_opus":0.008552402600034597,"score_gpt":0.2568928983666118,"score_spread":0.24834049576657719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072483773","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.95950824,0.0015230919,0.03824703,0.00047239903,0.000059767834,0.00010726889,0.0000056341987,0.000002645985,0.00007391326],"genre_scores_gemma":[0.98301435,0.00012260319,0.016494554,0.00013523715,0.00016728081,7.5847197e-7,0.00004999593,0.000006755937,0.000008462247],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99922216,0.00007396891,0.00031305687,0.00013585275,0.0001423979,0.00011254059],"domain_scores_gemma":[0.9991968,0.000021891228,0.00031377716,0.00006256929,0.00035058483,0.00005435682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023129654,0.00010584195,0.00021279416,0.00010772106,0.000034743505,0.00000714548,0.00008586742,0.00007116406,0.0000067115507],"category_scores_gemma":[0.00002619178,0.0000830135,0.0000616211,0.000077840465,0.000088367284,0.0000060429384,0.000020111285,0.000074364325,9.496379e-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.0007141981,0.00044002073,0.023066455,0.00009055869,0.0007372381,0.000029914783,0.0003364206,0.11351725,0.80791014,0.00038950113,0.0004844184,0.05228387],"study_design_scores_gemma":[0.02263088,0.049352948,0.747265,0.0005103792,0.000670305,0.003979736,0.00072104845,0.031032935,0.10246027,0.02279153,0.016788106,0.0017968667],"about_ca_topic_score_codex":0.0000015717912,"about_ca_topic_score_gemma":5.792617e-7,"teacher_disagreement_score":0.7241985,"about_ca_system_score_codex":0.000012799292,"about_ca_system_score_gemma":0.00008686195,"threshold_uncertainty_score":0.33851925},"labels":[],"label_agreement":null},{"id":"W2075485134","doi":"10.1007/s10878-010-9366-y","title":"Exact and approximation algorithms for the complementary maximal strip recovery problem","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"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; National Natural Science Foundation of China","keywords":"Substring; Approximation algorithm; Combinatorics; Mathematics; Theory of computation; Algorithm; Sequence (biology); Set (abstract data type); Constant (computer programming); Running time; Discrete mathematics; Computer science","score_opus":0.011198615586671824,"score_gpt":0.24746728216516203,"score_spread":0.23626866657849022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075485134","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.089321636,0.0004912101,0.90213,0.0011682094,0.0053857258,0.0012356322,0.00003508827,0.000009281092,0.00022322449],"genre_scores_gemma":[0.4381807,0.0008004349,0.55662256,0.00013389069,0.003751811,0.000048546986,0.00029163936,0.000058798312,0.00011163371],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992357,0.000035949473,0.0003165726,0.00011487244,0.00017345005,0.0001234537],"domain_scores_gemma":[0.9991395,0.000041764466,0.00033988134,0.00012184663,0.00030772196,0.000049293514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053758,0.00010137512,0.00012469248,0.000052121224,0.00011676004,0.000066988454,0.00014460227,0.00008943036,0.000016516691],"category_scores_gemma":[0.00008229517,0.000076931545,0.00007358737,0.000063873355,0.00003861131,0.000022658645,0.000042808882,0.00012548645,2.444475e-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.0044637527,0.0016487209,0.0034824044,0.0003539813,0.0020026148,0.0000081606695,0.00069339585,0.22014649,0.5423642,0.007985799,0.021570416,0.19528009],"study_design_scores_gemma":[0.053527985,0.017805582,0.006210411,0.00016327872,0.001600029,0.0006922011,0.0013814457,0.4993156,0.13009997,0.045595154,0.2412765,0.0023318664],"about_ca_topic_score_codex":0.0000031664563,"about_ca_topic_score_gemma":9.017182e-7,"teacher_disagreement_score":0.4122642,"about_ca_system_score_codex":0.000014157877,"about_ca_system_score_gemma":0.00006210518,"threshold_uncertainty_score":0.31371775},"labels":[],"label_agreement":null},{"id":"W2079686199","doi":"10.1007/11415770_46","title":"Stability of Rearrangement Measures in the Comparison of Genome Sequences","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Genome; Computer science; Resolution (logic); Tree (set theory); Gene rearrangement; Independence (probability theory); Biology; Evolutionary biology; Genetics; Mathematics; Artificial intelligence; Statistics; Combinatorics; Gene","score_opus":0.034748471050933656,"score_gpt":0.27701866142005477,"score_spread":0.24227019036912112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079686199","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.24576272,0.014324232,0.7285269,0.0008444995,0.00066628575,0.0021451104,0.000077334415,0.000016661545,0.007636286],"genre_scores_gemma":[0.98502916,0.00014709576,0.014515171,0.00008865523,0.00016192211,0.000006812985,0.000017329881,0.000011436223,0.0000223927],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979844,0.000060428254,0.0005060619,0.0005569117,0.0006340198,0.00025816067],"domain_scores_gemma":[0.9987648,0.000058202102,0.00026965069,0.00071407127,0.00016129256,0.00003196569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235685,0.00023047786,0.0003715367,0.00017961455,0.000038086022,0.000022683227,0.0011056758,0.00017692825,0.000022584894],"category_scores_gemma":[0.000053137544,0.00017224034,0.00009307216,0.00017622949,0.00075007975,0.0000057847938,0.00026206518,0.00023621405,0.0000013627391],"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.00008201086,0.0003276189,0.0107703805,0.0002846812,0.000080842925,0.00000818853,0.0046846527,0.04742687,0.58073825,0.00036865403,0.000016492597,0.35521138],"study_design_scores_gemma":[0.002962486,0.004968384,0.04356297,0.001090747,0.00017392992,0.00005018431,0.000084431085,0.023701062,0.86948717,0.021667548,0.02909423,0.0031568434],"about_ca_topic_score_codex":0.00004045139,"about_ca_topic_score_gemma":0.00049212127,"teacher_disagreement_score":0.73926646,"about_ca_system_score_codex":0.000061523824,"about_ca_system_score_gemma":0.00019298626,"threshold_uncertainty_score":0.7023757},"labels":[],"label_agreement":null},{"id":"W2088319085","doi":"10.1016/j.tcs.2004.02.036","title":"An algorithmic view of gene teams","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"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 à Montréal","funders":"","keywords":"Computer science; Genome; Comparative genomics; Divide and conquer algorithms; Computational complexity theory; Theoretical computer science; Computational genomics; Partition (number theory); Algorithm; Time complexity; Genomics; Identification (biology); Function (biology); Gene; Mathematics; Biology; Genetics; Combinatorics","score_opus":0.005230644258047232,"score_gpt":0.24631887927356755,"score_spread":0.24108823501552032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088319085","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.49406144,0.00009715454,0.5051232,0.00007116502,0.00011552562,0.000104392835,0.0000030121653,0.000012062806,0.0004120506],"genre_scores_gemma":[0.8718079,0.000019244757,0.12787925,0.000119625445,0.00015304705,0.0000032410396,0.0000066743764,0.000007936842,0.0000031090754],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99885553,0.000031843112,0.00016209093,0.0003914545,0.00027633883,0.00028274357],"domain_scores_gemma":[0.9991878,0.000004593538,0.00003827813,0.0005064133,0.00011562801,0.00014726454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005035059,0.00010790122,0.00011926158,0.000051841365,0.000083098435,0.00003172261,0.00070639764,0.000046791276,0.000021962536],"category_scores_gemma":[0.000014713646,0.00009143218,0.000044728728,0.00024789947,0.0015789348,0.000008190427,0.00016737537,0.000052880332,0.00001679964],"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.0000108982595,0.00014008228,0.000065178596,0.000009294536,0.000008515382,0.0000032099017,0.00009972847,0.0006788857,0.8723323,0.09008138,0.0000038092364,0.036566753],"study_design_scores_gemma":[0.00059732946,0.0012412042,0.0013249794,0.00001722825,0.000010091845,0.00004229587,0.000014488571,0.005580472,0.97232115,0.018321292,0.00028059783,0.00024884043],"about_ca_topic_score_codex":0.0000036996448,"about_ca_topic_score_gemma":4.1005526e-7,"teacher_disagreement_score":0.37774643,"about_ca_system_score_codex":0.000018196624,"about_ca_system_score_gemma":0.00011010726,"threshold_uncertainty_score":0.5817651},"labels":[],"label_agreement":null},{"id":"W2088586122","doi":"10.1089/cmb.2008.0118","title":"Descendants of Whole Genome Duplication within Gene Order Phylogeny","year":2008,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"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 Ottawa","funders":"","keywords":"Genome; Phylogenetics; Gene duplication; Biology; Evolutionary biology; Genomics; Genetic algorithm; Genetics; Computational biology; Gene","score_opus":0.016306235639022143,"score_gpt":0.2577301740039923,"score_spread":0.24142393836497014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088586122","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.9484831,0.00089414447,0.0501471,0.00014934897,0.00014573967,0.000077556455,0.000031160063,0.0000022032684,0.00006963125],"genre_scores_gemma":[0.96127623,0.00012391935,0.03798792,0.000106214335,0.0002527341,0.0000018081507,0.00017276018,0.000010473803,0.00006792694],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.999078,0.000069623966,0.000464849,0.00013496076,0.0001305282,0.000122038575],"domain_scores_gemma":[0.9986845,0.000020174873,0.0004980531,0.00010850711,0.00063217035,0.000056549874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002234267,0.00009813076,0.00019400603,0.00010627046,0.00004727732,0.0000029204039,0.00018627291,0.00009828921,0.00001791982],"category_scores_gemma":[0.00006167545,0.00008651284,0.00008753191,0.00011931791,0.00012899282,0.0000044648796,0.000045163633,0.00007768886,0.000009225059],"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.00007296766,0.000094692456,0.006123426,0.0000066182,0.00013137185,0.0000045505667,0.00007510553,0.016619632,0.97606266,0.000076633645,0.0001589016,0.0005734541],"study_design_scores_gemma":[0.006551888,0.0046667997,0.57764375,0.000034223787,0.00013602214,0.0036389064,0.00014108449,0.00252273,0.3595146,0.009118296,0.035207395,0.0008242955],"about_ca_topic_score_codex":0.0000019863664,"about_ca_topic_score_gemma":7.9961154e-7,"teacher_disagreement_score":0.61654806,"about_ca_system_score_codex":0.000015906406,"about_ca_system_score_gemma":0.00019705862,"threshold_uncertainty_score":0.35278913},"labels":[],"label_agreement":null},{"id":"W2094669477","doi":"10.1186/1756-0500-5-123","title":"Efficient computation of spaced seeds","year":2012,"lang":"en","type":"article","venue":"BMC Research Notes","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":21,"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":"Heuristics; Heuristic; Computer science; Software; Computation; Quadratic equation; Speedup; Algorithm; Range (aeronautics); Artificial intelligence; Mathematics; Parallel computing","score_opus":0.1217591416811094,"score_gpt":0.4019966040498242,"score_spread":0.2802374623687148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094669477","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.98610777,0.0010827553,0.011590245,0.000053209944,0.00007064935,0.0002104788,0.000004524681,0.0000055044575,0.0008748672],"genre_scores_gemma":[0.99471647,0.00001867017,0.004825993,0.0000048085667,0.00020831988,0.0000130919425,0.000028864635,0.0000117952195,0.00017198427],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894994,0.00015103882,0.000108187116,0.00013247857,0.0003279629,0.00033040976],"domain_scores_gemma":[0.9994464,0.00006023595,0.000030869905,0.00018341643,0.00019315147,0.00008591364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009989771,0.00006160065,0.00007499451,0.00009188785,0.00005072396,0.000009797709,0.00010873901,0.00005996875,0.000017671682],"category_scores_gemma":[0.00034728687,0.000056077755,0.00004402792,0.0001695862,0.0000961793,0.0000012568527,0.00013532398,0.00006706828,0.000045208206],"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.000043750704,0.00015972219,0.0546786,0.00006740959,0.000023522205,2.0086941e-7,0.00015959384,0.0018769635,0.9403244,0.000098909266,0.000364414,0.0022025143],"study_design_scores_gemma":[0.0008016528,0.00041238847,0.16701151,0.000025915291,0.000009655241,0.0000039751358,0.00034447067,0.004847208,0.82293975,0.00007021256,0.0033373623,0.00019586827],"about_ca_topic_score_codex":0.000030728857,"about_ca_topic_score_gemma":0.0000068305358,"teacher_disagreement_score":0.11738463,"about_ca_system_score_codex":0.000013768613,"about_ca_system_score_gemma":0.00005150466,"threshold_uncertainty_score":0.22867845},"labels":[],"label_agreement":null},{"id":"W2095893411","doi":"10.1186/jbiol162","title":"The where and wherefore of evolutionary breakpoints","year":2009,"lang":"en","type":"review","venue":"Journal of Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Breakpoint; Biology; Genome; Evolutionary biology; Genetics; Genomics; Gene; Epigenetics; Computational biology; Chromosome","score_opus":0.015166523662506566,"score_gpt":0.30253171449128424,"score_spread":0.28736519082877765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095893411","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021680187,0.9990382,0.000027822196,0.00009277136,0.00022043138,0.00013690966,0.000022748723,9.909937e-7,0.00024333369],"genre_scores_gemma":[0.000087476714,0.9986368,0.0004369387,0.000012727131,0.00045608132,0.0000023986927,0.000026561045,0.000014666166,0.00032635732],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987655,0.00019036801,0.0006376714,0.00015064931,0.00008015864,0.00017565377],"domain_scores_gemma":[0.9986084,0.00004066837,0.00091145554,0.00022331315,0.00015838603,0.000057758287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034987484,0.00019038965,0.00070874905,0.00007278124,0.000049901206,0.000007460171,0.00032884112,0.0003573194,0.000009703719],"category_scores_gemma":[0.00006105384,0.000105232924,0.00033588277,0.00006464533,0.00017579236,0.0000019137594,0.000101144,0.00021592177,0.0000024237725],"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.000019087493,0.00002454576,0.000046601348,0.00053485035,0.00032875626,0.000003971934,0.0000046764585,1.3297083e-7,0.00030931208,0.000046729325,0.0031108512,0.9955705],"study_design_scores_gemma":[0.00018085058,0.0007015411,0.00007716585,0.00064657966,0.0001856879,0.0006474368,0.000013634686,3.2620233e-7,0.000011291602,0.00026408286,0.99717194,0.000099472454],"about_ca_topic_score_codex":0.0000023320729,"about_ca_topic_score_gemma":0.0000062696336,"teacher_disagreement_score":0.995471,"about_ca_system_score_codex":0.000021317237,"about_ca_system_score_gemma":0.00020380298,"threshold_uncertainty_score":0.4291274},"labels":[],"label_agreement":null},{"id":"W2096149709","doi":"10.1093/bioinformatics/bti1037","title":"Reversal distance for partially ordered genomes","year":2005,"lang":"en","type":"article","venue":"Computer applications in the biosciences","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":27,"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 Ottawa","funders":"","keywords":"Genome; Position (finance); Chromosome; Computer science; Representation (politics); Order (exchange); Gene; Mutation; Genetics; Computational biology; Biology; Algorithm","score_opus":0.014496985183509515,"score_gpt":0.27133429649502283,"score_spread":0.2568373113115133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096149709","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.07748479,0.001390144,0.9173352,0.0022032273,0.00010316981,0.0010418409,0.000024694624,0.000015725174,0.0004012216],"genre_scores_gemma":[0.9251399,0.00012518081,0.07307196,0.00045973883,0.0005482941,0.00042839747,0.000049113933,0.0000059975214,0.00017141984],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993659,0.00002069285,0.00011856325,0.00025247387,0.000087158296,0.00015516499],"domain_scores_gemma":[0.99960196,0.000020221687,0.00004054664,0.00028527554,0.00003149695,0.000020493555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024484773,0.00007053955,0.00005444142,0.000026301384,0.00012915776,0.000044298165,0.00057400984,0.00002963359,0.0000023879584],"category_scores_gemma":[0.0000050211706,0.000050232637,0.000034877077,0.00017824199,0.00011804232,0.0000045178135,0.000057713558,0.000024373652,0.000005978916],"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.000069126974,0.0012923183,0.028919587,0.00009310161,0.000090808055,8.1985576e-7,0.0033873457,0.0065757614,0.18382594,0.032230977,0.034022648,0.70949155],"study_design_scores_gemma":[0.00023281139,0.000093832474,0.0044442043,0.0000024874666,0.0000060396956,0.0000020552518,0.00011893387,0.0041493904,0.004370305,0.00050123624,0.985938,0.00014070449],"about_ca_topic_score_codex":0.000001754161,"about_ca_topic_score_gemma":0.00004612869,"teacher_disagreement_score":0.9519153,"about_ca_system_score_codex":0.000009264976,"about_ca_system_score_gemma":0.000029917106,"threshold_uncertainty_score":0.20484275},"labels":[],"label_agreement":null},{"id":"W2098324440","doi":"10.1007/978-3-642-00727-9_15","title":"Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"University of Waterloo","funders":"","keywords":"Probabilistic logic; Hamming distance; Computer science; Motif (music); Sequence motif; Sequence (biology); Set (abstract data type); Algorithm; Artificial intelligence; Pattern recognition (psychology); Data mining; Genetics; DNA; Biology","score_opus":0.03155034304489479,"score_gpt":0.2733723973246741,"score_spread":0.24182205427977932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098324440","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.020578675,0.00085490354,0.9758027,0.00010939553,0.00048229718,0.0012680896,0.00003078582,0.000030660616,0.0008424739],"genre_scores_gemma":[0.9068519,0.00003692478,0.09130258,0.00063968496,0.0006835816,0.000026980122,0.00015920296,0.000060360926,0.00023878539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969378,0.00002955199,0.00039039872,0.0015930933,0.0004266931,0.00062242744],"domain_scores_gemma":[0.9982505,0.000057623904,0.00013914167,0.0013486405,0.00008066888,0.00012341162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007550848,0.0003956488,0.00034326952,0.0005134438,0.00014427272,0.00014984848,0.0017176729,0.00029950452,0.000007634158],"category_scores_gemma":[0.00026214775,0.00039153732,0.00005085579,0.00036595788,0.000114713075,0.000017346383,0.0017102145,0.00045061755,0.000014870297],"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.000022171322,0.00006785606,0.00049704645,0.00012908371,0.000026611138,0.00010940573,0.0011607836,0.06658615,0.032210413,0.00010270407,0.000016109978,0.8990717],"study_design_scores_gemma":[0.003660602,0.002209528,0.00430121,0.003699306,0.00010735649,0.00026164987,0.000013127322,0.84626997,0.03980794,0.045565475,0.047724515,0.006379302],"about_ca_topic_score_codex":0.000014734419,"about_ca_topic_score_gemma":0.0005529145,"teacher_disagreement_score":0.8926924,"about_ca_system_score_codex":0.00015427318,"about_ca_system_score_gemma":0.00020979972,"threshold_uncertainty_score":0.9998537},"labels":[],"label_agreement":null},{"id":"W2101963711","doi":"10.1093/bioinformatics/18.suppl_1.s303","title":"Multiple genome rearrangement: a general approach via the evolutionary genome graph","year":2002,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"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 New Brunswick","funders":"","keywords":"Genome; Phylogenetic tree; Graph; Set (abstract data type); Computer science; Theoretical computer science; Biology; Computational biology; Evolutionary biology; Gene; Genetics","score_opus":0.015668192281693593,"score_gpt":0.2004549549426579,"score_spread":0.1847867626609643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101963711","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.6182411,0.019350193,0.2629491,0.0012480028,0.0010874228,0.004996834,0.000572151,0.00032929968,0.09122593],"genre_scores_gemma":[0.8457707,0.0024233605,0.13786817,0.0015346202,0.0014868893,0.00032377985,0.00206393,0.00012049107,0.008408065],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851626,0.000045707126,0.00041068226,0.00023959135,0.00031924603,0.00046851605],"domain_scores_gemma":[0.99892074,0.00000874833,0.00015182457,0.00071512896,0.00008722072,0.00011635698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022799533,0.000257473,0.00016711756,0.00009071006,0.0002704993,0.000056521763,0.00050044205,0.00014831129,0.00012372533],"category_scores_gemma":[0.000026258605,0.00019629255,0.0001696185,0.00023015622,0.00014512481,0.0000157088,0.00023450468,0.00013199457,0.00025069172],"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.0002384051,0.002118013,0.008471968,0.0010066184,0.0026499133,0.000022418339,0.011049992,0.015744483,0.8510019,0.0007810065,0.068036094,0.038879193],"study_design_scores_gemma":[0.003172499,0.0006342842,0.026548844,0.000011818769,0.0001654095,0.00022930674,0.0010005381,0.23859705,0.0015672529,0.00018653665,0.7264309,0.0014555819],"about_ca_topic_score_codex":0.000010069083,"about_ca_topic_score_gemma":0.0000029145185,"teacher_disagreement_score":0.8494346,"about_ca_system_score_codex":0.000038317663,"about_ca_system_score_gemma":0.00001734444,"threshold_uncertainty_score":0.8004578},"labels":[],"label_agreement":null},{"id":"W2105091000","doi":"10.1093/bioinformatics/btn295","title":"Poisson adjacency distributions in genome comparison: multichromosomal, circular, signed and unsigned cases","year":2008,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Poisson distribution; Phylogenetic tree; Mathematics; Statistics; Limiting; Adjacency list; Similarity (geometry); Chromosome; Probability distribution; Genome; Adjacency matrix; Poisson regression; Biology; Combinatorics; Genetics; Computer science; Artificial intelligence; Population","score_opus":0.02415182833651396,"score_gpt":0.2510118703173962,"score_spread":0.22686004198088222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105091000","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.99145263,0.0016033344,0.0057685943,0.00006701178,0.00006704829,0.0003866092,0.000101018944,0.000024586696,0.0005291412],"genre_scores_gemma":[0.9898266,0.00044166934,0.008889754,0.00005265719,0.000055759552,0.00002250957,0.00058791554,0.000015069866,0.00010806752],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99888843,0.000031428826,0.00042091386,0.00018325693,0.00015350894,0.00032244044],"domain_scores_gemma":[0.99938494,0.000017742577,0.00011241112,0.0002994123,0.00006532556,0.000120179015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109082466,0.00019118964,0.00021895385,0.00007870338,0.00014675931,0.000024455094,0.00014318862,0.00014028345,0.000022061604],"category_scores_gemma":[0.00009231289,0.00019120151,0.000056373032,0.00016743648,0.0001321588,0.000013825305,0.00012053358,0.00008272818,0.000030845757],"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.00022308542,0.0014968622,0.14633138,0.00080057763,0.00042179556,0.00035854243,0.006770027,0.0007193899,0.8298768,0.00029393588,0.0047135917,0.007994058],"study_design_scores_gemma":[0.022062525,0.005872791,0.574461,0.0002794324,0.00040216377,0.0042199097,0.008711556,0.054082043,0.2030797,0.0002841307,0.120317414,0.0062273266],"about_ca_topic_score_codex":0.000021198899,"about_ca_topic_score_gemma":0.000021045187,"teacher_disagreement_score":0.6267971,"about_ca_system_score_codex":0.00003503863,"about_ca_system_score_gemma":0.00007470136,"threshold_uncertainty_score":0.7796971},"labels":[],"label_agreement":null},{"id":"W2106532429","doi":"10.1093/bioinformatics/btm422","title":"Multiple spaced seeds for homology search","year":2007,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":67,"is_retracted":false,"has_abstract":true,"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","keywords":"Homology (biology); Exponential function; Heuristic; Algorithm; Computer science; Time complexity; Mathematics; Sensitivity (control systems); Smith–Waterman algorithm; Artificial intelligence; Sequence alignment; Biology; Genetics; Amino acid; Gene; Peptide sequence","score_opus":0.018724202756338102,"score_gpt":0.27138495041828953,"score_spread":0.2526607476619514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106532429","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.58455735,0.0002038807,0.40855637,0.00015232226,0.00034803958,0.0008170143,0.000055441014,0.000038131348,0.005271468],"genre_scores_gemma":[0.8106944,0.00006873452,0.18527806,0.000379498,0.0004279371,0.00003055193,0.00052136095,0.000038201593,0.0025612544],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910766,0.000008349244,0.00024940446,0.000117999145,0.00011667048,0.00039991725],"domain_scores_gemma":[0.9994282,0.000030490182,0.00005952685,0.00027683174,0.00011043742,0.000094511095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004911626,0.00012151825,0.00011208975,0.00007744926,0.00007788214,0.000018300598,0.0001724899,0.00015392802,0.000011404611],"category_scores_gemma":[0.00008624225,0.000115660216,0.00008173957,0.00008424645,0.000058810696,0.000004307614,0.00009369968,0.000055568773,0.000051391056],"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.00085182965,0.00042433987,0.033172533,0.0008618591,0.0006207796,0.000011827401,0.0029370084,0.00048000345,0.77379704,0.0012634855,0.033546027,0.1520333],"study_design_scores_gemma":[0.004769404,0.001582113,0.011483536,0.000017558863,0.000055573844,0.000075243086,0.0024110689,0.017145133,0.47027552,0.000106663596,0.49123478,0.000843395],"about_ca_topic_score_codex":0.0000053118533,"about_ca_topic_score_gemma":0.000026321617,"teacher_disagreement_score":0.45768875,"about_ca_system_score_codex":0.000018656088,"about_ca_system_score_gemma":0.000045933786,"threshold_uncertainty_score":0.4716487},"labels":[],"label_agreement":null},{"id":"W2107320771","doi":"10.1093/bioinformatics/bts457","title":"ANGES: reconstructing ANcestral GEnomeS maps","year":2012,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Genome; Extant taxon; Python (programming language); Merge (version control); Biology; Suite; Evolutionary biology; Computer science; Computational biology; Genetics; Geography; Archaeology; Programming language; Information retrieval","score_opus":0.02167448892732243,"score_gpt":0.24648847665906595,"score_spread":0.22481398773174352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107320771","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.9695575,0.0028059792,0.0020805846,0.0000518197,0.0010061684,0.0002515994,0.000049395534,0.000046126934,0.02415079],"genre_scores_gemma":[0.88197595,0.0005656312,0.11486829,0.00022727533,0.0012309676,0.00001972032,0.00030334885,0.00003241757,0.0007763773],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991887,0.000012334109,0.00023062107,0.00008120059,0.000108887936,0.0003782248],"domain_scores_gemma":[0.9995021,0.000006941365,0.00010471783,0.00023937388,0.000033626988,0.00011322001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001921272,0.00012718397,0.000099702556,0.000042477113,0.00006831459,0.000028261078,0.00014165211,0.000092792696,0.00003815902],"category_scores_gemma":[0.000034633686,0.00011881371,0.000059163984,0.00007196906,0.000050864463,0.000017255325,0.00008119176,0.000058088386,0.00012180725],"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.00005293127,0.00021300964,0.53749114,0.00052971335,0.00042827745,0.0000025294435,0.003917962,0.00006469828,0.06897915,0.00073694915,0.024045268,0.36353835],"study_design_scores_gemma":[0.0016416346,0.00042240226,0.025497872,0.000050144557,0.00008903991,0.00027952596,0.006046236,0.0011071891,0.07515888,0.00012426535,0.888227,0.0013558011],"about_ca_topic_score_codex":0.0000017000716,"about_ca_topic_score_gemma":0.0000013163514,"teacher_disagreement_score":0.86418176,"about_ca_system_score_codex":0.000015119486,"about_ca_system_score_gemma":0.000027181526,"threshold_uncertainty_score":0.48450825},"labels":[],"label_agreement":null},{"id":"W2107757889","doi":"10.1186/1471-2164-15-s6-s8","title":"Gene families as soft cliques with backbones: Amborellacontrasted with other flowering plants","year":2014,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chaining; Biology; Cluster analysis; Gene Annotation; Genome; Annotation; Gene; Computational biology; Genetics; Computer science; Artificial intelligence","score_opus":0.008034647044978072,"score_gpt":0.20962162820967978,"score_spread":0.2015869811647017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107757889","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.96651644,0.00034140554,0.030568339,0.000018144723,0.00006447274,0.00028321458,0.000022227026,0.000035310273,0.002150464],"genre_scores_gemma":[0.96923584,0.00019000717,0.02898397,0.00026897457,0.00035500963,0.000031898988,0.00010770978,0.00009815632,0.00072845595],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988464,0.000044551383,0.00018199174,0.0004325478,0.0001385853,0.00035592017],"domain_scores_gemma":[0.9992807,0.000014218893,0.00009395865,0.00044358202,0.00006384937,0.000103714796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014329363,0.00026064267,0.00021423392,0.000050291386,0.00007430661,0.00004632854,0.00021162772,0.00012322048,0.000019223853],"category_scores_gemma":[0.0000131328625,0.00020722771,0.000048268746,0.000052457428,0.000087106826,0.0000041870676,0.00007054882,0.000072837516,0.00005371605],"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.00072092126,0.000078452846,0.01887717,0.000056038974,0.00023994714,0.00000499713,0.00032537334,0.002731378,0.9726952,0.000030327994,0.00013211655,0.0041081244],"study_design_scores_gemma":[0.0038991992,0.0021357874,0.010399699,0.00006204975,0.00010867004,0.00013438023,0.00096853625,0.001318527,0.8854939,0.00007891936,0.094186045,0.0012142832],"about_ca_topic_score_codex":0.00007239924,"about_ca_topic_score_gemma":0.0006729588,"teacher_disagreement_score":0.09405393,"about_ca_system_score_codex":0.000024518498,"about_ca_system_score_gemma":0.00010822942,"threshold_uncertainty_score":0.8450501},"labels":[],"label_agreement":null},{"id":"W2108998942","doi":"10.1093/bioinformatics/btg1025","title":"Detection and validation of single gene inversions","year":2003,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":56,"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 Ottawa; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Computational biology; Gene; Genetics; Biology","score_opus":0.013892619292329735,"score_gpt":0.21265513003258144,"score_spread":0.1987625107402517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108998942","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.97751147,0.000096149946,0.01983516,0.000007009563,0.00006511732,0.000098325174,0.0000050888852,0.0000048880597,0.002376794],"genre_scores_gemma":[0.9829342,0.00007328147,0.016840253,0.000021160973,0.000013888159,0.000002282609,0.000025664209,0.0000044591343,0.00008481773],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99969417,0.000011089802,0.00012328284,0.000046444242,0.0000577304,0.00006729224],"domain_scores_gemma":[0.9997647,0.0000027845563,0.000062308,0.00010466533,0.000038289385,0.00002727064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008328168,0.000047583297,0.00004588434,0.0000324911,0.000029056944,0.0000071941395,0.000028169461,0.0000499605,0.000006204891],"category_scores_gemma":[0.000046126414,0.000046526155,0.00001863956,0.00005026438,0.00002518628,0.0000045462475,0.000020219157,0.000015391981,0.000004523985],"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.0000038000574,0.000019143032,0.00056977355,0.000029428382,0.000015518403,5.416691e-8,0.00010435769,0.000027288375,0.9960832,0.000026050515,0.00007189199,0.0030495182],"study_design_scores_gemma":[0.00023624685,0.0001334839,0.00026792087,0.0000028199045,0.000010389685,0.0000070694396,0.00015759781,0.00030052487,0.99165344,0.000033015684,0.00713889,0.00005861568],"about_ca_topic_score_codex":0.0000013016273,"about_ca_topic_score_gemma":0.0000011950714,"teacher_disagreement_score":0.007066998,"about_ca_system_score_codex":0.0000058330006,"about_ca_system_score_gemma":0.000011814172,"threshold_uncertainty_score":0.18972816},"labels":[],"label_agreement":null},{"id":"W2109028614","doi":"10.1093/bioinformatics/btp600","title":"Ancestors 1.0: a web server for ancestral sequence reconstruction","year":2009,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec à Montréal","funders":"","keywords":"Synteny; Inference; Computer science; Indel; Genome; Context (archaeology); Sequence (biology); Web server; Biology; Computational biology; Artificial intelligence; The Internet; Genetics; World Wide Web; Gene","score_opus":0.0301068154565614,"score_gpt":0.2728592275455003,"score_spread":0.24275241208893888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109028614","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.98964804,0.00019181575,0.006592888,0.00020014854,0.00038922802,0.0004606845,0.000054220516,0.00003872082,0.0024242692],"genre_scores_gemma":[0.8978003,0.00025188076,0.100370035,0.00042902396,0.00035714576,0.000026086705,0.00019932367,0.000012573969,0.000553605],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993486,0.000006520721,0.00021825997,0.00011728109,0.00009080331,0.00021857134],"domain_scores_gemma":[0.99956954,0.0000032967878,0.00010304061,0.00020433548,0.00006210753,0.000057702287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011882777,0.000113487644,0.00009410379,0.000035836845,0.00006397141,0.000029924277,0.0001312424,0.00009428737,0.000007934121],"category_scores_gemma":[0.000027920416,0.00010830413,0.000069010166,0.0000757665,0.00003874844,0.000016820983,0.000014757783,0.000038745955,0.000014586452],"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.00017774166,0.00012776343,0.0053589796,0.00028822623,0.00012933998,0.0000021315307,0.00044507385,0.0004677919,0.30554318,0.0008804376,0.012458717,0.6741206],"study_design_scores_gemma":[0.009188114,0.007247868,0.021680757,0.00026833077,0.0002158845,0.0006045551,0.0018923783,0.092266336,0.33182508,0.004080085,0.5274303,0.003300289],"about_ca_topic_score_codex":9.874361e-7,"about_ca_topic_score_gemma":0.000004583802,"teacher_disagreement_score":0.67082036,"about_ca_system_score_codex":0.00002061712,"about_ca_system_score_gemma":0.0000713604,"threshold_uncertainty_score":0.4416514},"labels":[],"label_agreement":null},{"id":"W2109550992","doi":"10.1093/bioinformatics/bth946","title":"Into the heart of darkness: large-scale clustering of human non-coding DNA","year":2004,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Human genome; Biology; Genome; Computational biology; Conserved sequence; Cluster analysis; Genetics; Gene; Coding region; Computer science; Peptide sequence; Artificial intelligence","score_opus":0.009885294791323542,"score_gpt":0.24885973694188881,"score_spread":0.23897444215056526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109550992","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.94103163,0.00012948114,0.0550522,0.00010536553,0.000115474366,0.00026935825,0.000013783683,0.000008159042,0.003274516],"genre_scores_gemma":[0.9797614,0.00004144003,0.019939885,0.00007199179,0.000057347173,0.000006231495,0.000042435815,0.000011133448,0.00006809169],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925834,0.000008568634,0.00034747925,0.00007454331,0.00014438243,0.00016667391],"domain_scores_gemma":[0.9994085,0.0000043180185,0.0001508689,0.0003386747,0.00006562649,0.000032035285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024606526,0.00009853231,0.00014349217,0.000039854855,0.000078396486,0.000010964941,0.000214727,0.000070948496,0.000007744926],"category_scores_gemma":[0.000015480025,0.0000758222,0.00008072639,0.00008777041,0.000075062606,0.0000070614115,0.00018907634,0.000048491827,0.0000065384656],"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.000015847021,0.00009260131,0.00093697605,0.0004692294,0.000075673845,3.2190894e-7,0.007953673,0.0007837158,0.9880705,0.000116433606,0.0003058026,0.0011792384],"study_design_scores_gemma":[0.0015842088,0.00047684187,0.0032886255,0.00012888401,0.000042758908,0.000008969277,0.004928622,0.0038266538,0.9790202,0.00015482635,0.006267874,0.00027156714],"about_ca_topic_score_codex":0.000018302148,"about_ca_topic_score_gemma":0.000041017403,"teacher_disagreement_score":0.03872978,"about_ca_system_score_codex":0.000013090591,"about_ca_system_score_gemma":0.000036782534,"threshold_uncertainty_score":0.30919397},"labels":[],"label_agreement":null},{"id":"W2109823739","doi":"10.1007/978-3-642-29627-7_10","title":"Evolution of Genome Organization by Duplication and Loss: An Alignment Approach","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"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":"Genome; Gene duplication; Heuristic; Phylogenetic tree; Computational biology; Gene; Biology; Comparative genomics; Computer science; Genome evolution; Genomics; Genetics; Algorithm; Artificial intelligence","score_opus":0.007321950418532535,"score_gpt":0.20728510171778303,"score_spread":0.1999631512992505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109823739","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.015291143,0.0023279309,0.98180443,0.000026683641,0.00008265993,0.00026516567,0.000012649622,0.0000074250834,0.0001819208],"genre_scores_gemma":[0.96065825,0.00023836337,0.038401406,0.000051553274,0.00024291247,0.0000043206082,0.00029364167,0.000024010988,0.00008555752],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988898,0.00001351583,0.00017846774,0.00049864245,0.0002449896,0.00017460847],"domain_scores_gemma":[0.99926543,0.000005262652,0.00014016542,0.0003797717,0.000145414,0.00006396554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026381938,0.0001667659,0.00013908111,0.00010968338,0.000052556083,0.000027002554,0.0002865143,0.00021150982,0.00000694168],"category_scores_gemma":[0.000012297829,0.00016410768,0.000017686943,0.00011048704,0.00024654722,0.0000119941315,0.00020090937,0.00008578001,0.0000017563603],"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.000012755234,0.00016098734,0.0043870956,0.00013577646,0.00003829108,6.2177236e-7,0.00054925826,0.009257595,0.88117796,0.0011015758,0.00001679806,0.10316131],"study_design_scores_gemma":[0.0053059226,0.005315805,0.07401519,0.00049946207,0.00048324626,0.00047108417,0.000017981472,0.16206776,0.67397183,0.040725872,0.029082246,0.008043629],"about_ca_topic_score_codex":0.0000080429045,"about_ca_topic_score_gemma":0.000002505811,"teacher_disagreement_score":0.9453671,"about_ca_system_score_codex":0.000087755034,"about_ca_system_score_gemma":0.00007389413,"threshold_uncertainty_score":0.6692117},"labels":[],"label_agreement":null},{"id":"W2110628507","doi":"10.1093/bioinformatics/18.suppl_2.s54","title":"Common intervals and sorting by reversals: a marriage of necessity","year":2002,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":41,"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é du Québec à Montréal","funders":"","keywords":"Sorting; Computer science; Econometrics; Psychology; Algorithm; Mathematics","score_opus":0.014919944998585408,"score_gpt":0.23653411034470762,"score_spread":0.22161416534612222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110628507","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.98983824,0.0020367869,0.00232028,0.00010949905,0.00006343333,0.00018720518,0.000049323105,0.000012957891,0.005382259],"genre_scores_gemma":[0.9893255,0.00089360046,0.008958167,0.00016774803,0.00003489896,0.0000041578637,0.000059750575,0.000010943117,0.0005451871],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993933,0.000017425216,0.00029312077,0.00007538983,0.00008922449,0.00013156801],"domain_scores_gemma":[0.999555,0.000007813128,0.00017391244,0.00018792451,0.000028030221,0.000047354504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001665944,0.000088505505,0.00013050526,0.000024330442,0.00003354035,0.000016256652,0.00010929099,0.00007290824,0.000038163947],"category_scores_gemma":[0.000046753958,0.00008264268,0.000037879923,0.000045210814,0.00005260525,0.000007419681,0.0001263516,0.000042209886,0.000009212468],"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.00006026268,0.00035439586,0.046992,0.0016221332,0.00042519416,0.000003981964,0.0048598554,0.000020583953,0.49251232,0.000087366156,0.14793147,0.30513042],"study_design_scores_gemma":[0.006487629,0.0023918028,0.007108728,0.00064365164,0.00028367512,0.000106161875,0.0048326035,0.08319234,0.6569391,0.0004061601,0.23548834,0.0021198164],"about_ca_topic_score_codex":0.000007144971,"about_ca_topic_score_gemma":0.0000031133288,"teacher_disagreement_score":0.3030106,"about_ca_system_score_codex":0.0000052945907,"about_ca_system_score_gemma":0.0000037124598,"threshold_uncertainty_score":0.33700705},"labels":[],"label_agreement":null},{"id":"W2111945870","doi":"10.1016/j.tcs.2014.07.011","title":"On the approximability of the exemplar adjacency number problem for genomes with gene repetitions","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"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 Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Alberta Innovates - Technology Futures; National Science Foundation","keywords":"Combinatorics; Parameterized complexity; Adjacency list; Mathematics; Genome; Approximation algorithm; Set (abstract data type); Alphabet; Measure (data warehouse); Discrete mathematics; Gene; Computer science; Biology; Genetics","score_opus":0.006080399229874966,"score_gpt":0.21752872795666095,"score_spread":0.21144832872678598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111945870","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.53973156,0.000012370261,0.45480514,0.0011452792,0.00007567905,0.0006201798,0.00000995397,0.0000088220295,0.0035910183],"genre_scores_gemma":[0.96043843,0.0000025577217,0.03916703,0.00023701243,0.000074017036,0.000044969627,0.00000288355,0.0000075750995,0.000025508216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894357,0.00008830669,0.00013118457,0.0003533964,0.00024954186,0.00023400785],"domain_scores_gemma":[0.99893206,0.00008733643,0.000057598143,0.00071833516,0.00015465867,0.00004998797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095785205,0.000100290286,0.00009233764,0.000012543661,0.00025367516,0.000030230321,0.0006949551,0.000032751093,0.00002554791],"category_scores_gemma":[0.00008467056,0.00004853751,0.00006187077,0.00018861207,0.0021653129,0.000003495983,0.00023707493,0.00006203934,0.000003481398],"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.000038261493,0.00009546541,0.0005063132,0.00001714476,0.000011854372,6.36761e-8,0.00007800728,0.0001806275,0.041507564,0.9551978,0.00007814967,0.002288756],"study_design_scores_gemma":[0.0010777251,0.0020038113,0.005131266,0.0000641013,0.000051142564,0.000028892375,0.000031136668,0.019699208,0.58436817,0.38314724,0.00391967,0.00047761263],"about_ca_topic_score_codex":7.9931567e-7,"about_ca_topic_score_gemma":6.459906e-7,"teacher_disagreement_score":0.5720505,"about_ca_system_score_codex":0.000010476983,"about_ca_system_score_gemma":0.000055462395,"threshold_uncertainty_score":0.79781854},"labels":[],"label_agreement":null},{"id":"W2113127959","doi":"10.1093/bioinformatics/btr461","title":"Reconstructing the architecture of the ancestral amniote genome","year":2011,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Amniote; Genome; Biology; Vertebrate; Evolutionary biology; Extant taxon; Phylogenomics; Genomics; Most recent common ancestor; Ancestor; Python (programming language); Context (archaeology); Phylogenetics; Genetics; Computer science; Gene; Paleontology; Clade; Geography","score_opus":0.020882426988871196,"score_gpt":0.20813427935761294,"score_spread":0.18725185236874176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113127959","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.9815723,0.000196505,0.0030396702,0.00012707658,0.0003107304,0.00033966964,0.000029450986,0.000009965013,0.014374637],"genre_scores_gemma":[0.9688665,0.000059905353,0.030410886,0.00016194856,0.00013297984,0.0000069884163,0.000012979408,0.000012204802,0.00033558076],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994308,0.00002089208,0.00022240034,0.00006602241,0.00010130672,0.00015860212],"domain_scores_gemma":[0.9993692,0.000005010214,0.00016765686,0.00039754793,0.000035989066,0.00002460423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014847715,0.00008972945,0.00007416779,0.000015760595,0.000080024074,0.000009351912,0.00037728605,0.000060562095,0.000020851572],"category_scores_gemma":[0.000031287556,0.0000430506,0.000083648956,0.000083165134,0.00015705348,0.0000031696711,0.00013891,0.00008654865,0.000006270373],"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.00021708901,0.00024900152,0.099203736,0.0009224696,0.0011750163,0.0000032237706,0.03605448,0.00096220523,0.5490372,0.0016689246,0.0022290014,0.30827767],"study_design_scores_gemma":[0.0023743098,0.0009933835,0.16799033,0.0001422802,0.00025286226,0.00046530433,0.009625424,0.0031799208,0.6608431,0.0025581673,0.15016624,0.0014086845],"about_ca_topic_score_codex":0.000007501683,"about_ca_topic_score_gemma":0.0000065456175,"teacher_disagreement_score":0.30686897,"about_ca_system_score_codex":0.0000048059346,"about_ca_system_score_gemma":0.00003931464,"threshold_uncertainty_score":0.17555526},"labels":[],"label_agreement":null},{"id":"W2117980752","doi":"10.1186/1471-2105-13-s19-s11","title":"Linearization of ancestral multichromosomal genomes","year":2012,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Row; Combinatorics; Linearization; Mathematics; Biology; Genetics; Computer science; Gene; Physics; Nonlinear system","score_opus":0.021088227291032657,"score_gpt":0.25444365989167667,"score_spread":0.233355432600644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117980752","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.8634479,0.0012451793,0.13095772,0.000012007104,0.0003454442,0.00033604598,0.000043322663,0.000022219798,0.0035901575],"genre_scores_gemma":[0.74861896,0.00010761576,0.2505093,0.000033024597,0.00026926096,0.0000068076506,0.00021578856,0.00001257921,0.00022668076],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993453,0.0000125694305,0.0002549426,0.000056362172,0.000115714494,0.00021507991],"domain_scores_gemma":[0.9995503,0.0000055604505,0.00012415346,0.00019860928,0.000055391276,0.00006602459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012633753,0.000093189,0.000095036834,0.00003599452,0.000027641267,0.000009004944,0.00010827831,0.000085385975,0.000022282768],"category_scores_gemma":[0.000034429813,0.00008570489,0.000053360705,0.000074657684,0.000047638092,0.000013062582,0.00006100167,0.000032132386,0.00003265784],"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.0001058758,0.0005943042,0.71501666,0.0012279961,0.00024547498,4.2245406e-7,0.0030110944,0.0033787685,0.2408195,0.000714394,0.001598724,0.03328681],"study_design_scores_gemma":[0.0040236292,0.0010762907,0.19024706,0.000073906354,0.00018668246,0.00006630269,0.002280305,0.16480869,0.55763155,0.000051862597,0.07816115,0.0013925692],"about_ca_topic_score_codex":0.0000017338093,"about_ca_topic_score_gemma":0.0000021498104,"teacher_disagreement_score":0.5247696,"about_ca_system_score_codex":0.000007172881,"about_ca_system_score_gemma":0.00003693889,"threshold_uncertainty_score":0.3494944},"labels":[],"label_agreement":null},{"id":"W2118651376","doi":"10.1093/bioinformatics/bth240","title":"A practical and robust sequence search strategy for structural genomics target selection","year":2004,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"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 Toronto","funders":"Medical Research Council","keywords":"Prioritization; Genome; Selection (genetic algorithm); Computer science; Sequence (biology); Structural genomics; Computational biology; Genomics; Software; Sequence alignment; Similarity (geometry); Data mining; Gene; Biology; Genetics; Artificial intelligence; Protein structure; Peptide sequence; Image (mathematics)","score_opus":0.051150241365374265,"score_gpt":0.31169337020729015,"score_spread":0.2605431288419159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118651376","genre_codex":"empirical","genre_gemma":"methods","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.68563855,0.00013310481,0.31254563,0.00031405227,0.000106180734,0.00074250664,0.00008419564,0.000026706983,0.00040908455],"genre_scores_gemma":[0.36357462,0.000119841025,0.6356838,0.00009836366,0.00016446329,0.0000203671,0.00023367196,0.00001821415,0.00008666187],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993015,0.000009045616,0.00019514996,0.00013658321,0.00010391567,0.00025381203],"domain_scores_gemma":[0.9996279,0.000006865988,0.00006122657,0.000121194156,0.000099105724,0.00008373069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015056206,0.00012080024,0.00009471796,0.000035477402,0.00010959518,0.00006764845,0.000073795214,0.00011611818,0.000005476654],"category_scores_gemma":[0.000042096526,0.00011345636,0.00003613802,0.000059920265,0.00006190712,0.000017796305,0.000056039127,0.00007716635,0.0000059502836],"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.0007675344,0.0002442474,0.0032792503,0.0016790207,0.00078591274,0.0000116872925,0.0033483994,0.23076154,0.6992347,0.014437673,0.0043105814,0.041139394],"study_design_scores_gemma":[0.008952244,0.0051363385,0.0032498983,0.000054901247,0.0001763581,0.0011494415,0.00484264,0.5515269,0.3859953,0.0045429124,0.032341223,0.0020318327],"about_ca_topic_score_codex":0.000007443544,"about_ca_topic_score_gemma":0.000010258528,"teacher_disagreement_score":0.32313818,"about_ca_system_score_codex":0.00004997875,"about_ca_system_score_gemma":0.00025920803,"threshold_uncertainty_score":0.4626616},"labels":[],"label_agreement":null},{"id":"W2124599625","doi":"10.1186/1471-2164-11-516","title":"Large synteny blocks revealed between Caenorhabditis elegans and Caenorhabditis briggsae genomes using OrthoCluster","year":2010,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":24,"is_retracted":false,"has_abstract":true,"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; Canadian Institutes of Health Research; Michael Smith Health Research BC","keywords":"Synteny; Biology; Caenorhabditis; Genome; Comparative genomics; Caenorhabditis elegans; Genetics; Genomics; Gene; Computational biology","score_opus":0.013762408690220348,"score_gpt":0.24099508531301253,"score_spread":0.22723267662279217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124599625","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.9924145,0.0012256977,0.004374788,0.00007075045,0.0004049878,0.0005320233,0.0004427715,0.000034648318,0.0004998706],"genre_scores_gemma":[0.97746277,0.00034451627,0.018364318,0.00017261229,0.0015374252,0.000024198678,0.0003756134,0.0001150367,0.0016035321],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99779207,0.00007204403,0.00044764124,0.00075761456,0.00019297961,0.00073764054],"domain_scores_gemma":[0.9986243,0.00003233422,0.00019205341,0.00072887633,0.00013779942,0.00028464102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039767855,0.00039301437,0.00039945784,0.00012062205,0.00028431363,0.00011128225,0.0003683366,0.00039841715,0.00009852489],"category_scores_gemma":[0.000066082146,0.0004293249,0.00015787291,0.000123178,0.00014836449,0.000012383625,0.00043054932,0.0003179107,0.000025821842],"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.000036281603,0.00007161968,0.34034643,0.000093934024,0.00022038136,0.000021398779,0.0003340989,0.00004084374,0.65472007,0.00003809243,0.0006898096,0.0033870044],"study_design_scores_gemma":[0.00693465,0.00077777146,0.19854377,0.00007063191,0.0008614485,0.0008700413,0.0010676776,0.002067003,0.12176894,0.00048763095,0.662865,0.0036854576],"about_ca_topic_score_codex":0.00009714845,"about_ca_topic_score_gemma":0.0016151299,"teacher_disagreement_score":0.6621752,"about_ca_system_score_codex":0.000049029622,"about_ca_system_score_gemma":0.00021120252,"threshold_uncertainty_score":0.9998159},"labels":[],"label_agreement":null},{"id":"W2125598538","doi":"10.1093/bioinformatics/17.2.149","title":"An information-based sequence distance and its application to whole mitochondrial genome phylogeny","year":2001,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":542,"is_retracted":false,"has_abstract":true,"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; City University of Hong Kong","keywords":"Phylogenetics; Sequence (biology); Biology; Genome; Distance matrices in phylogeny; Evolutionary biology; Mitochondrial DNA; Edit distance; Computational biology; Computer science; Genetics; Algorithm; Bioinformatics; Gene","score_opus":0.009646601906384321,"score_gpt":0.2431462677942042,"score_spread":0.23349966588781987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125598538","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.49269444,0.00014397074,0.5046146,0.0002354014,0.0001295964,0.0010104902,0.00021930998,0.000046854333,0.00090533495],"genre_scores_gemma":[0.97039413,0.000058933823,0.027022788,0.0009484094,0.00019575501,0.00010653045,0.0011565064,0.000014391764,0.00010253975],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918425,0.000012109439,0.00028499748,0.0001324242,0.00016357155,0.0002226687],"domain_scores_gemma":[0.99925584,0.0000043705168,0.00010695152,0.00035178065,0.00012211445,0.0001589556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093799405,0.00014329536,0.000099940575,0.00006889979,0.0000943647,0.000071138435,0.00021863291,0.00009365513,0.000007206448],"category_scores_gemma":[0.000032243217,0.00014377093,0.000028117473,0.00015282743,0.000027986742,0.000043834993,0.000048067235,0.000045040902,0.0001401819],"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.00013179964,0.000075272386,0.0012424609,0.00014262169,0.000033980803,0.0000010386902,0.0008031449,0.0061979694,0.9622129,0.00019319492,0.00044248378,0.028523091],"study_design_scores_gemma":[0.0018028765,0.00084252463,0.0067250156,0.000021420943,0.000034341047,0.000024992583,0.00049561635,0.18870299,0.036102936,0.000058737074,0.7643053,0.0008832723],"about_ca_topic_score_codex":0.0000040509353,"about_ca_topic_score_gemma":0.0000103562015,"teacher_disagreement_score":0.92611,"about_ca_system_score_codex":0.000025671146,"about_ca_system_score_gemma":0.000055012857,"threshold_uncertainty_score":0.5862808},"labels":[],"label_agreement":null},{"id":"W2127234426","doi":"10.1109/iccabs.2011.5729939","title":"Invited: Fast and theoretically strong algorithms for kinship discovery","year":2011,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","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":"University of Waterloo","funders":"","keywords":"Computer science; Probabilistic logic; Simple (philosophy); Kinship; Inheritance (genetic algorithm); Inference; Population; Domain (mathematical analysis); Theoretical computer science; Task (project management); Algorithm; Mathematics; Artificial intelligence; Biology","score_opus":0.03405946729272449,"score_gpt":0.25248821490545437,"score_spread":0.21842874761272987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127234426","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.52200556,0.0005315835,0.46213916,0.0005130541,0.0002129217,0.00081123126,0.00008722101,0.00003894731,0.0136603005],"genre_scores_gemma":[0.96146196,0.0000906281,0.03610504,0.00058307126,0.00020080703,0.00006443817,0.0001061562,0.000034429497,0.0013534741],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99920565,0.000021037296,0.00013239257,0.00031502687,0.00007427148,0.00025163012],"domain_scores_gemma":[0.9995996,0.000010619991,0.00003254576,0.00022986131,0.000044997993,0.000082412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015092702,0.00013725722,0.000105547224,0.000031519474,0.000051421088,0.000035657264,0.00013100395,0.00009873394,0.000029122253],"category_scores_gemma":[0.00003330983,0.000113941795,0.000059311475,0.00003503178,0.00012491642,0.000006103988,0.00011559773,0.000042819836,0.0000033568538],"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.00084632053,0.000731949,0.039640304,0.00024569881,0.0008492642,0.0000147711935,0.0011546856,0.000010191737,0.71374124,0.08206401,0.010359402,0.15034217],"study_design_scores_gemma":[0.007632404,0.0055324957,0.06493933,0.00005716718,0.00032569183,0.00008586283,0.0031084258,0.0028163905,0.8278707,0.022720343,0.062316407,0.0025947741],"about_ca_topic_score_codex":0.000011533855,"about_ca_topic_score_gemma":0.000012136652,"teacher_disagreement_score":0.43945637,"about_ca_system_score_codex":0.0000051044253,"about_ca_system_score_gemma":0.0000108303675,"threshold_uncertainty_score":0.46464115},"labels":[],"label_agreement":null},{"id":"W2128591967","doi":"10.1093/bioinformatics/18.3.440","title":"PatternHunter: faster and more sensitive homology search","year":2002,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":863,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bioinformatics Solutions (Canada)","funders":"","keywords":"Computer science; Java; Homology (biology); Genomics; MIT License; Computational biology; Computation; License; Biology; Bioinformatics; Data mining; Algorithm; Genome; Genetics; Operating system; Gene","score_opus":0.015699973549434185,"score_gpt":0.23243666661569154,"score_spread":0.21673669306625737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128591967","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.98848367,0.00026441837,0.0051837377,0.00044462783,0.00009455485,0.00021106936,0.000036866815,0.000016053684,0.0052650124],"genre_scores_gemma":[0.99048287,0.0003417295,0.0061800475,0.0009150857,0.0001250664,0.0000069784887,0.00007551162,0.000017311162,0.0018554161],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999371,0.000018692752,0.00016192853,0.00012060222,0.000101253856,0.00022653774],"domain_scores_gemma":[0.9996264,0.000005954258,0.000036962283,0.00021008245,0.00004951935,0.0000710594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076897035,0.000115939205,0.000100428704,0.000047610767,0.000048613667,0.000028532893,0.00008244366,0.00009835843,0.000049069113],"category_scores_gemma":[0.000010571296,0.00010455193,0.000033862387,0.00004153347,0.00009690647,0.000006085493,0.00015048162,0.00006578237,0.000117093405],"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.00017184723,0.00059568457,0.06667341,0.0011626919,0.0012517155,0.00016431883,0.035497352,0.00020059163,0.2175867,0.0002517019,0.06521757,0.61122644],"study_design_scores_gemma":[0.0125396615,0.005318941,0.13003814,0.00020893323,0.00031044902,0.0030727433,0.023731776,0.2770445,0.29549056,0.000081926715,0.24754833,0.004614041],"about_ca_topic_score_codex":0.000004509628,"about_ca_topic_score_gemma":0.0000025701747,"teacher_disagreement_score":0.6066124,"about_ca_system_score_codex":0.0000075764324,"about_ca_system_score_gemma":0.000005767653,"threshold_uncertainty_score":0.42635038},"labels":[],"label_agreement":null},{"id":"W2129978006","doi":"10.1186/1471-2105-9-329","title":"Evaluation of genomic island predictors using a comparative genomics approach","year":2008,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":284,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Institutes of Health Research; Genome Canada; Michael Smith Health Research BC; Cystic Fibrosis Foundation","keywords":"Genome; Identification (biology); Comparative genomics; Genomics; Computational biology; Precision and recall; Computer science; Sequence (biology); Data mining; Biology; Genetics; Artificial intelligence; Gene; Ecology","score_opus":0.10055274526987305,"score_gpt":0.2917008819532804,"score_spread":0.19114813668340735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129978006","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.89628476,0.0004488592,0.0993044,8.383773e-7,0.000059016846,0.00048224014,0.000046887213,0.0000068131585,0.0033661807],"genre_scores_gemma":[0.8089316,0.00007856076,0.19048314,0.000013157276,0.00010148844,0.000014608124,0.00030493023,0.000015033303,0.000057477548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998863,0.000067457746,0.00038274433,0.00012755951,0.0003822313,0.00017700411],"domain_scores_gemma":[0.99914193,0.00000604198,0.00023616946,0.00029351327,0.00027088023,0.000051481267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056251086,0.00014279541,0.00018553829,0.00007335793,0.000077574034,0.000009155508,0.00016052536,0.00010603372,0.0000151321065],"category_scores_gemma":[0.0000283122,0.00013591898,0.00007826338,0.00008275979,0.00011397254,0.000008922517,0.000089267516,0.000051528306,0.000010426092],"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.00023485244,0.00067627954,0.053456314,0.0006661546,0.0012899151,8.285951e-7,0.02007513,0.51341707,0.40460765,0.0000558897,0.0031247716,0.0023951153],"study_design_scores_gemma":[0.0012608216,0.00013403552,0.0083569195,0.000005453959,0.00015531763,0.00004250646,0.0008964478,0.9764179,0.011675484,0.000016301869,0.00083297637,0.00020580892],"about_ca_topic_score_codex":0.000008225478,"about_ca_topic_score_gemma":0.000010919612,"teacher_disagreement_score":0.46300083,"about_ca_system_score_codex":0.000068660214,"about_ca_system_score_gemma":0.00036525997,"threshold_uncertainty_score":0.5542615},"labels":[],"label_agreement":null},{"id":"W2130062792","doi":"10.1093/bioinformatics/btu687","title":"E-MEM: efficient computation of maximal exact matches for very large genomes","year":2014,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":33,"is_retracted":false,"has_abstract":true,"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; Compute Canada","keywords":"Compressed suffix array; Computer science; Computation; Genome; Suffix; Suffix array; Source code; Code (set theory); Algorithm; Parallel computing; Theoretical computer science; Data structure; Suffix tree; Set (abstract data type); Programming language; Biology","score_opus":0.010695451651004901,"score_gpt":0.23836099971157,"score_spread":0.22766554806056508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130062792","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.571646,0.00026540877,0.42615533,0.00003209816,0.00017358879,0.0003928044,0.00007299923,0.000015982478,0.0012458161],"genre_scores_gemma":[0.9492652,0.000041453088,0.050048433,0.00007688302,0.00011220627,0.000016962887,0.00032060774,0.000016336438,0.00010195228],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999266,0.000012413275,0.0002925768,0.000096867814,0.00012406384,0.00020802887],"domain_scores_gemma":[0.9995113,0.0000148782265,0.00015657464,0.00018030821,0.00009342678,0.00004348979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002867302,0.000111766225,0.00014101918,0.00005185331,0.000048882164,0.000016571352,0.000120426266,0.0000809865,0.000005084784],"category_scores_gemma":[0.00003898563,0.00010372753,0.000087416076,0.00005223588,0.000032782576,0.0000037356542,0.00006908927,0.00002598557,0.000015923306],"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.001017486,0.0021640726,0.01510547,0.010702926,0.0014819382,0.00000179991,0.008419343,0.05280419,0.550809,0.005400803,0.026039345,0.3260536],"study_design_scores_gemma":[0.005407262,0.0019740204,0.00744104,0.000093566756,0.00014571084,0.000014912647,0.0016529432,0.67229646,0.18482032,0.0003656027,0.12485601,0.0009321305],"about_ca_topic_score_codex":0.0000011304202,"about_ca_topic_score_gemma":0.0000011748508,"teacher_disagreement_score":0.6194923,"about_ca_system_score_codex":0.000011157606,"about_ca_system_score_gemma":0.000028062612,"threshold_uncertainty_score":0.4229886},"labels":[],"label_agreement":null},{"id":"W2130654549","doi":"10.1186/1748-7188-8-20","title":"Fast half-sibling population reconstruction: theory and algorithms","year":2013,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Kinship; Computer science; Heuristic; Population; Inference; Inheritance (genetic algorithm); Cluster analysis; Integer (computer science); Theoretical computer science; Data mining; Machine learning; Artificial intelligence; Biology; Demography","score_opus":0.00999279403419891,"score_gpt":0.26674908478950504,"score_spread":0.25675629075530615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130654549","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.5255697,0.0026739882,0.4683041,0.00055994414,0.00079982553,0.0014485786,0.000056912777,0.000071477225,0.00051547226],"genre_scores_gemma":[0.79469323,0.0005288451,0.19849664,0.0010617139,0.0010085899,0.0009168734,0.0018724181,0.00016645697,0.001255219],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99798954,0.00020248847,0.00038800188,0.00078183674,0.00010301525,0.0005351047],"domain_scores_gemma":[0.998984,0.00005146137,0.00016107055,0.00043347757,0.0002109994,0.00015899465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005171353,0.00033059338,0.0003128301,0.00016921766,0.00018847409,0.00006718929,0.00022349198,0.00037907605,0.00006849908],"category_scores_gemma":[0.0001521316,0.00032301768,0.00016561753,0.00015470428,0.00019450807,0.000017191325,0.00016307115,0.0001262511,0.000024761466],"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.000055105684,0.000054112024,0.0030690862,0.000036085632,0.0002963767,0.00000272659,0.00004312048,0.000034379016,0.5428882,0.004776669,0.00022933079,0.44851476],"study_design_scores_gemma":[0.01546735,0.0072932374,0.029942695,0.00017629229,0.00074248324,0.0020378302,0.0021485758,0.0199335,0.55919623,0.26314178,0.09350741,0.006412616],"about_ca_topic_score_codex":0.00011863173,"about_ca_topic_score_gemma":0.000008980289,"teacher_disagreement_score":0.44210213,"about_ca_system_score_codex":0.000024932284,"about_ca_system_score_gemma":0.00003290236,"threshold_uncertainty_score":0.9999222},"labels":[],"label_agreement":null},{"id":"W2131148812","doi":"10.1371/journal.pcbi.1000234","title":"A Methodological Framework for the Reconstruction of Contiguous Regions of Ancestral Genomes and Its Application to Mammalian Genomes","year":2008,"lang":"en","type":"article","venue":"PLoS Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":143,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Centre National de la Recherche Scientifique; Simon Fraser University; Agence Nationale de la Recherche","keywords":"Genome; Extant taxon; Biology; Evolutionary biology; Computational biology; Convergent evolution; Genomics; Comparative genomics; Genome evolution; Phylogenetics; Gene; Genetics","score_opus":0.11499072256397742,"score_gpt":0.33633754883627,"score_spread":0.22134682627229257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131148812","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.6553483,0.0019673249,0.3415329,0.00052797014,0.00004838275,0.00048804661,0.00006488851,0.000004943913,0.000017231334],"genre_scores_gemma":[0.85833657,0.00032064863,0.14096333,0.000076796154,0.00009724082,0.00009566194,0.000087489476,0.000006143877,0.00001612015],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99929965,0.00008116947,0.00022257442,0.00022745074,0.00005200162,0.00011716281],"domain_scores_gemma":[0.9992633,0.00026760253,0.00014410351,0.000108574124,0.00018096977,0.000035470675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015335594,0.00008480569,0.00017770607,0.000045315614,0.00007509357,0.000001918438,0.00011761779,0.000113712194,0.000005139131],"category_scores_gemma":[0.0001470434,0.000065754226,0.000055913617,0.000080533275,0.00017604536,0.000002179454,0.000045977453,0.00004244924,0.0000010563982],"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.0004806634,0.00019889169,0.034970943,0.00012132399,0.00058431085,6.8552754e-7,0.0004723046,0.007856111,0.840632,0.058088,0.00010243934,0.05649228],"study_design_scores_gemma":[0.0040835883,0.0073317774,0.34600505,0.000084990585,0.00040631255,0.00060759933,0.0009278418,0.025906619,0.34421077,0.25256673,0.016474523,0.0013941984],"about_ca_topic_score_codex":0.0000032384276,"about_ca_topic_score_gemma":0.0000018117508,"teacher_disagreement_score":0.49642128,"about_ca_system_score_codex":0.0000060057982,"about_ca_system_score_gemma":0.0000363725,"threshold_uncertainty_score":0.26813796},"labels":[],"label_agreement":null},{"id":"W2131414388","doi":"10.1186/1471-2105-10-s1-s5","title":"ComPhy: prokaryotic composite distance phylogenies inferred from whole-genome gene sets","year":2009,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"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":"University of Missouri; University of Maryland, Baltimore County; National Science Foundation","keywords":"Genome; Phylogenetic tree; Biology; Phylogenetics; Computational biology; Gene; Distance matrices in phylogeny; Bacterial genome size; Distance matrix; Genetics; Evolutionary biology; Bioinformatics; Computer science; Algorithm","score_opus":0.013734137712329139,"score_gpt":0.2341514672249999,"score_spread":0.22041732951267076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131414388","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.80870694,0.0026034352,0.1823835,0.00020552574,0.00032645446,0.0010232734,0.0010568793,0.0001206058,0.0035733723],"genre_scores_gemma":[0.77461416,0.000150442,0.21845339,0.00073121046,0.00028828546,0.000020764222,0.0053244,0.000035103745,0.00038222005],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99857175,0.000032279077,0.00048054184,0.00025348127,0.0002570348,0.00040492436],"domain_scores_gemma":[0.9989442,0.000011905421,0.00019911237,0.000611519,0.000092441864,0.00014080427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011009567,0.00029975662,0.00027335063,0.00006571109,0.0001262248,0.000094815674,0.00039259443,0.0001599057,0.000016033036],"category_scores_gemma":[0.000019589008,0.0002876834,0.0001313783,0.00014021934,0.00008885885,0.000018021059,0.00012437256,0.00010861108,0.00016340277],"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.0002777004,0.00044887612,0.01960936,0.00023772828,0.00036078956,0.00001209158,0.0015140944,0.005073528,0.9565291,0.00011611006,0.0021118778,0.013708744],"study_design_scores_gemma":[0.008612321,0.0023358886,0.5349775,0.00016692869,0.00039053799,0.00010324371,0.0010430121,0.13865201,0.10761555,0.0018632876,0.20040387,0.0038358471],"about_ca_topic_score_codex":0.000006532988,"about_ca_topic_score_gemma":0.000016813421,"teacher_disagreement_score":0.84891355,"about_ca_system_score_codex":0.00003522571,"about_ca_system_score_gemma":0.000068972564,"threshold_uncertainty_score":0.9999575},"labels":[],"label_agreement":null},{"id":"W2131813051","doi":"10.1093/bioinformatics/btu762","title":"EPGA: <i>de novo</i> assembly using the distributions of reads and insert size","year":2014,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"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":"Contig; Sequence assembly; Hybrid genome assembly; De Bruijn graph; Computer science; Sequence (biology); Insert (composites); Genome; De Bruijn sequence; Graph; Extension (predicate logic); Reference genome; Algorithm; Computational biology; Biology; Theoretical computer science; Genetics; Mathematics; Combinatorics","score_opus":0.011039391652501954,"score_gpt":0.24156995759420027,"score_spread":0.23053056594169832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131813051","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.9385754,0.00012545177,0.059388787,0.0000944111,0.00005198189,0.00012183665,0.000038629707,0.0000067411975,0.0015967462],"genre_scores_gemma":[0.9806467,0.000107955835,0.018881638,0.00014225167,0.000069590664,0.000003834654,0.000041216328,0.00000791077,0.000098843346],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994871,0.000022311522,0.00019072962,0.00006185513,0.000084944346,0.0001530612],"domain_scores_gemma":[0.99952745,0.00003418355,0.000097566364,0.00024178888,0.000057085443,0.000041909963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026283297,0.000081303595,0.00008696079,0.000012505338,0.00007717452,0.000020737016,0.000121105106,0.00006820361,0.0000015888139],"category_scores_gemma":[0.0002044556,0.00006017957,0.0000362048,0.000066929206,0.00008356795,0.0000048402976,0.000098177276,0.000043904693,0.0000020757739],"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.000024435009,0.000115968265,0.014297439,0.00030652087,0.00018119867,6.6799583e-7,0.0010656421,0.00020673446,0.9678826,0.002358935,0.0031049522,0.010454933],"study_design_scores_gemma":[0.0029689411,0.0010314395,0.038835526,0.00011705908,0.00032828044,0.0002771586,0.001950388,0.08319799,0.6194039,0.0010086005,0.2500797,0.0008010657],"about_ca_topic_score_codex":0.00000799857,"about_ca_topic_score_gemma":0.0000036545875,"teacher_disagreement_score":0.3484787,"about_ca_system_score_codex":0.000009315894,"about_ca_system_score_gemma":0.00003804818,"threshold_uncertainty_score":0.24540515},"labels":[],"label_agreement":null},{"id":"W2132150084","doi":"10.1109/tcbb.2010.66","title":"Rearrangement Phylogeny of Genomes in Contig Form","year":2010,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","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 Ottawa","funders":"","keywords":"Contig; Genome; Phylogenetic tree; Phylogenetic network; Phylogenetics; Biology; Computational biology; DNA sequencing; Genetics; Sequence (biology); Evolutionary biology; Gene","score_opus":0.010385221333538187,"score_gpt":0.25995265995164707,"score_spread":0.24956743861810887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132150084","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.91168183,0.0001129623,0.08690968,0.0001708769,0.00033473433,0.00029450993,0.0001320243,0.000010686162,0.00035270766],"genre_scores_gemma":[0.9538415,0.00017461945,0.045587834,0.00014601441,0.000039909643,0.000019502646,0.00013083551,0.000007365502,0.000052415173],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923253,0.000020610167,0.00034294932,0.00015151253,0.000083793304,0.00016862302],"domain_scores_gemma":[0.99952286,0.000047250312,0.000098656055,0.00019905111,0.00008264202,0.00004956454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018873591,0.00013394261,0.00015725984,0.00015496889,0.000068990266,0.000008895233,0.00015117877,0.0001699691,0.000032752654],"category_scores_gemma":[0.000013888569,0.000121136036,0.000060061797,0.0001044385,0.00016660053,0.000008132021,0.000010204301,0.00015306585,0.000008671026],"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.0003871362,0.00072786893,0.011989952,0.00024482826,0.0004750251,0.0000025967818,0.0012807997,0.011333807,0.693843,0.0011731628,0.0002182337,0.27832356],"study_design_scores_gemma":[0.026178231,0.010633836,0.29456386,0.0002373298,0.00042117192,0.00040926583,0.0034602494,0.134901,0.41252536,0.04840061,0.06387504,0.00439404],"about_ca_topic_score_codex":0.000008112923,"about_ca_topic_score_gemma":0.000070424074,"teacher_disagreement_score":0.2825739,"about_ca_system_score_codex":0.0000074400887,"about_ca_system_score_gemma":0.000047636833,"threshold_uncertainty_score":0.49397844},"labels":[],"label_agreement":null},{"id":"W2132582429","doi":"10.1109/tcbb.2010.37","title":"An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss","year":2010,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","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":"Dalhousie University; Carleton University; McGill University","funders":"","keywords":"Tree (set theory); Metric (unit); Phylogenetic tree; Set (abstract data type); Feature (linguistics); Extinction (optical mineralogy); Mathematics; Phylogenetic diversity; Taxon; Biodiversity; Mathematical optimization; Algorithm; Computer science; Combinatorics; Ecology; Biology; Paleontology; Economics","score_opus":0.006912731528881497,"score_gpt":0.24926561226483848,"score_spread":0.24235288073595698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132582429","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.02221957,0.000041943324,0.9757423,0.0006394359,0.0002892308,0.00076532195,0.00023014755,0.000025521977,0.000046555404],"genre_scores_gemma":[0.2421377,0.00007520077,0.75582755,0.0004510396,0.00027116295,0.00020729308,0.0008956071,0.00002039547,0.00011406856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992619,0.00002951681,0.00020479075,0.00020559155,0.00010256266,0.0001956034],"domain_scores_gemma":[0.99917746,0.0001329368,0.00010589574,0.00026528648,0.00025141894,0.00006697706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024839948,0.00018318623,0.00013509848,0.00006639318,0.00039399797,0.000052233703,0.0002076411,0.00021520958,0.000007995157],"category_scores_gemma":[0.000013154232,0.000117479394,0.000062160834,0.000095844174,0.00022725016,0.000020467683,0.000004952406,0.00021676483,0.0000043000505],"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.00091322523,0.0004853108,0.0003563149,0.00014486846,0.00075672165,9.4529213e-7,0.0006303783,0.043952283,0.014951955,0.0005763985,0.0007392785,0.9364923],"study_design_scores_gemma":[0.010729476,0.004039557,0.0019412438,0.000035373174,0.0003227237,0.00026472742,0.00064052653,0.9225961,0.020179903,0.006693089,0.031508457,0.0010488384],"about_ca_topic_score_codex":0.0000029641485,"about_ca_topic_score_gemma":0.000024636163,"teacher_disagreement_score":0.93544346,"about_ca_system_score_codex":0.0000063786883,"about_ca_system_score_gemma":0.000064807624,"threshold_uncertainty_score":0.47906706},"labels":[],"label_agreement":null},{"id":"W2134425468","doi":"10.1186/1471-2105-13-s10-s9","title":"Gene order in rosid phylogeny, inferred from pairwise syntenies among extant genomes","year":2012,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extant taxon; Phylogenetics; Biology; Evolutionary biology; Genome; Pairwise comparison; DNA microarray; Computational biology; Gene; Genetics; Computer science; Gene expression; Artificial intelligence","score_opus":0.016163955662212754,"score_gpt":0.22764341752703593,"score_spread":0.21147946186482316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134425468","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.9808698,0.0032941857,0.013958527,0.00001584549,0.00028641525,0.00040146074,0.000095171556,0.000031810858,0.0010467779],"genre_scores_gemma":[0.89108264,0.0005350047,0.10692526,0.00014497277,0.0003373369,0.000057669702,0.0005729714,0.000040022656,0.000304115],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985257,0.00004251947,0.00049894146,0.00017491679,0.0002077532,0.0005501666],"domain_scores_gemma":[0.99908614,0.000020794954,0.00016464911,0.0004966773,0.0000762017,0.00015553024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026496281,0.00026276257,0.00024152716,0.00010930011,0.00005870976,0.0000485501,0.00026867975,0.00021584895,0.00006294993],"category_scores_gemma":[0.0000917441,0.00024062798,0.00009484306,0.00018847326,0.00009765255,0.00003127438,0.00024533647,0.00010922621,0.00010880984],"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.00007581915,0.00029109456,0.8717564,0.00015111393,0.00017995441,0.00000278155,0.0025641362,0.0007102893,0.113889694,0.000024591824,0.0010083985,0.00934572],"study_design_scores_gemma":[0.0030719105,0.0002901339,0.84237957,0.000063406296,0.000102708356,0.000022188531,0.003302441,0.028903602,0.09986559,0.00011246847,0.020354358,0.0015315943],"about_ca_topic_score_codex":0.0000564332,"about_ca_topic_score_gemma":0.00014276452,"teacher_disagreement_score":0.09296673,"about_ca_system_score_codex":0.000039495993,"about_ca_system_score_gemma":0.00007281918,"threshold_uncertainty_score":0.98125243},"labels":[],"label_agreement":null},{"id":"W2135398177","doi":"10.1186/1471-2105-14-s15-s5","title":"Gene tree correction guided by orthology","year":2013,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":28,"is_retracted":false,"has_abstract":true,"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":"Tree (set theory); Synteny; Ensembl; Set (abstract data type); Gene; Clade; Biology; Phylogenetic tree; Computer science; Computational biology; Mathematics; Genetics; Combinatorics; Genomics; Genome; Programming language","score_opus":0.012322689451228852,"score_gpt":0.22914997419534575,"score_spread":0.2168272847441169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135398177","genre_codex":"empirical","genre_gemma":"methods","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.6785019,0.0006110576,0.28767163,0.00021549537,0.0016401085,0.0011671323,0.000040813142,0.000114551876,0.030037338],"genre_scores_gemma":[0.31604248,0.00093610166,0.6230793,0.0028750096,0.0010662797,0.00045154395,0.0041179787,0.00016065907,0.05127064],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914354,0.000023384213,0.0003150436,0.00013755212,0.00011763326,0.00026282397],"domain_scores_gemma":[0.99935865,0.0000072436237,0.00011865662,0.00033742937,0.00009619171,0.00008182051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110102905,0.00014742241,0.00012095073,0.00004686024,0.000061186176,0.00003912703,0.00016873586,0.00016494645,0.00012581052],"category_scores_gemma":[0.00005592528,0.00013534114,0.00006851213,0.00008428608,0.00005297369,0.000010899824,0.00009309748,0.00006152007,0.0005625338],"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.000016569415,0.0000966537,0.01021359,0.000068259724,0.00008398179,5.68235e-7,0.00020808594,0.00023687365,0.20453298,0.000012285886,0.73396605,0.05056411],"study_design_scores_gemma":[0.003988043,0.0013537419,0.024865717,0.000024491212,0.00011205054,0.00034496107,0.0014382392,0.15870397,0.44020066,0.00016994399,0.3671286,0.0016695759],"about_ca_topic_score_codex":0.000024878542,"about_ca_topic_score_gemma":0.000019726987,"teacher_disagreement_score":0.3668374,"about_ca_system_score_codex":0.000016824717,"about_ca_system_score_gemma":0.000039834198,"threshold_uncertainty_score":0.72304213},"labels":[],"label_agreement":null},{"id":"W2136598303","doi":"10.1186/1471-2164-13-s1-s8","title":"A model for biased fractionation after whole genome duplication","year":2012,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gene duplication; Biology; Computational biology; Genome; DNA microarray; Genetics; Evolutionary biology; Gene","score_opus":0.03258605097939829,"score_gpt":0.2637175313312905,"score_spread":0.2311314803518922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136598303","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.62056005,0.00055897824,0.37807238,0.00006444696,0.00009539033,0.0004093308,0.00009611267,0.000011444241,0.00013188444],"genre_scores_gemma":[0.9498094,0.000041855612,0.04671337,0.00017201816,0.0005592681,0.00035273947,0.0009371386,0.000034770794,0.0013794777],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993174,0.000013544186,0.0001498551,0.00020766114,0.00007180422,0.00023975204],"domain_scores_gemma":[0.99949396,0.0000074862896,0.00007379195,0.00026897356,0.000081196085,0.00007458861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018101496,0.00011021075,0.000075161006,0.000043722623,0.000058291356,0.000018798024,0.00009465564,0.0001114203,0.000014108364],"category_scores_gemma":[0.000027433412,0.00012192216,0.000080903956,0.000039304105,0.000016111284,0.000008842804,0.00004278462,0.000032493488,0.000060418988],"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.000089392284,0.00008596905,0.0032118806,0.000023567081,0.000026589754,2.4253223e-8,0.0001520115,0.00486526,0.99037296,0.000047888836,0.00039820012,0.0007262444],"study_design_scores_gemma":[0.0033133158,0.00026931163,0.0924623,0.000007630212,0.00018818061,0.000013819789,0.00030351977,0.22747031,0.10576221,0.0009676016,0.56795835,0.0012834485],"about_ca_topic_score_codex":0.0000021892436,"about_ca_topic_score_gemma":0.00001581867,"teacher_disagreement_score":0.8846108,"about_ca_system_score_codex":0.00005876344,"about_ca_system_score_gemma":0.000058740083,"threshold_uncertainty_score":0.49718413},"labels":[],"label_agreement":null},{"id":"W2139251761","doi":"10.1186/1471-2105-13-s19-s8","title":"A consolidation algorithm for genomes fractionated after higher order polyploidization","year":2012,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Genome; Algorithm; Gene duplication; Consolidation (business); Biology; Fractionation; Computer science; Computational biology; Gene; Genetics; Chemistry","score_opus":0.015573472473317742,"score_gpt":0.25466988657805234,"score_spread":0.2390964141047346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139251761","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.0113223335,0.0010039398,0.98533213,0.000051202856,0.00055903936,0.0006337859,0.00010521096,0.000038615297,0.0009537576],"genre_scores_gemma":[0.065059274,0.00018701638,0.928033,0.00055429904,0.0009263175,0.0002961765,0.0022800849,0.00005252208,0.0026113335],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999172,0.000017460668,0.00027247972,0.00010552157,0.00013349597,0.00029905664],"domain_scores_gemma":[0.99936706,0.000014484674,0.00013035671,0.00020969662,0.00019239706,0.00008600742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016623148,0.00014736601,0.0001041036,0.000069911635,0.000073586816,0.00003705665,0.00008269647,0.00015643975,0.00013255465],"category_scores_gemma":[0.000033925502,0.00013994254,0.000062068735,0.00012799875,0.00003496257,0.000033809385,0.00004843625,0.000041989464,0.00008974608],"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.00091551134,0.0021231954,0.12303025,0.0019069684,0.0019098762,0.0000014104171,0.0043853363,0.0026541124,0.08202413,0.0017295711,0.06025903,0.7190606],"study_design_scores_gemma":[0.0031966115,0.00035533306,0.026276104,0.000023460932,0.00017994118,0.000023927603,0.0005791609,0.14762954,0.025999215,0.00011864475,0.7945789,0.0010391765],"about_ca_topic_score_codex":0.0000018659885,"about_ca_topic_score_gemma":0.0000019566585,"teacher_disagreement_score":0.73431987,"about_ca_system_score_codex":0.000027340946,"about_ca_system_score_gemma":0.000054987806,"threshold_uncertainty_score":0.5706691},"labels":[],"label_agreement":null},{"id":"W2139856280","doi":"10.1093/bioinformatics/bts392","title":"Fractionation, rearrangement and subgenome dominance","year":2012,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fractionation; Polyploid; Biology; Gene duplication; Genome; Computer science; Gene; Genetics; Chemistry; Chromatography","score_opus":0.010925370706434448,"score_gpt":0.23500801163734025,"score_spread":0.2240826409309058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139856280","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.96457636,0.0031779131,0.01681772,0.00026613337,0.0004861393,0.00043237477,0.000024865878,0.000029738338,0.014188755],"genre_scores_gemma":[0.9666914,0.00082492357,0.030300833,0.00029237327,0.00038285524,0.000027871756,0.00012736843,0.000015780306,0.0013366408],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994396,0.000009336771,0.00016476966,0.00007003064,0.00011428749,0.00020195686],"domain_scores_gemma":[0.9996265,0.0000044821873,0.00007262181,0.00017158565,0.00004572669,0.00007907739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019957474,0.00009037541,0.00006726849,0.000036617275,0.000066919856,0.000019863797,0.00006406844,0.00006117195,0.000030236868],"category_scores_gemma":[0.000027770831,0.00008540658,0.000024055942,0.000052487325,0.000034100845,0.000016623708,0.00006607482,0.00003467863,0.00007079688],"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.00020324725,0.00074877293,0.21244152,0.0008086173,0.0006692751,0.0000021750334,0.0076016854,0.00010874373,0.4218367,0.006007081,0.07891098,0.27066118],"study_design_scores_gemma":[0.0007798968,0.0001341798,0.084221795,0.000009852126,0.000028998924,0.000032989963,0.0004894317,0.00048111592,0.015984213,0.000056078647,0.8974363,0.0003451324],"about_ca_topic_score_codex":0.0000025660108,"about_ca_topic_score_gemma":0.0000014861268,"teacher_disagreement_score":0.8185253,"about_ca_system_score_codex":0.000014218639,"about_ca_system_score_gemma":0.00001343113,"threshold_uncertainty_score":0.34827793},"labels":[],"label_agreement":null},{"id":"W2140148213","doi":"10.1007/978-3-642-04744-2_2","title":"Natural Parameter Values for Generalized Gene Adjacency","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Genome; Adjacency list; Probabilistic logic; Computer science; Class (philosophy); Value (mathematics); Gene; Computational biology; Theoretical computer science; Biology; Algorithm; Genetics; Artificial intelligence; Machine learning","score_opus":0.01418708943590188,"score_gpt":0.25423753411011996,"score_spread":0.24005044467421807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140148213","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.0053506284,0.0053868745,0.9859048,0.00030403383,0.0014794294,0.0008802281,0.000026922764,0.000032679083,0.0006344019],"genre_scores_gemma":[0.08376796,0.00060131744,0.9034378,0.0027879807,0.0028938984,0.000045108096,0.00035408983,0.00010456273,0.0060072695],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99773765,0.000017848439,0.0003066546,0.0010693504,0.00035554773,0.0005129446],"domain_scores_gemma":[0.99883074,0.00004888001,0.00014843326,0.00069005025,0.00018934808,0.000092539114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003269934,0.00041562316,0.00034660476,0.00021681131,0.00012120517,0.00010816614,0.0008437008,0.00032968633,0.000013430858],"category_scores_gemma":[0.00007929885,0.00037312577,0.00020430915,0.000098930235,0.00029742098,0.000008076317,0.00027138076,0.00024085397,0.000007418364],"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.00006399591,0.000039270526,0.000030659754,0.000050755483,0.00006405651,0.000015411166,0.000103769984,0.0050365836,0.1480853,0.00019755636,0.0002598556,0.84605277],"study_design_scores_gemma":[0.0045720567,0.0032477546,0.00066120905,0.0003973332,0.00022250254,0.00020711857,4.7212663e-7,0.09583921,0.6011949,0.20630231,0.082762465,0.0045926156],"about_ca_topic_score_codex":0.0000034956809,"about_ca_topic_score_gemma":0.000014324401,"teacher_disagreement_score":0.84146017,"about_ca_system_score_codex":0.00007038617,"about_ca_system_score_gemma":0.00017893923,"threshold_uncertainty_score":0.9998721},"labels":[],"label_agreement":null},{"id":"W2141071417","doi":"10.1016/j.jpdc.2005.05.029","title":"Asserting the utility of using the Cowichan Problem Set","year":2005,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"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; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canada Research Chairs; University of Alberta","keywords":"Computer science; Set (abstract data type); Theoretical computer science; Programming language","score_opus":0.025154598173859424,"score_gpt":0.28250104566475664,"score_spread":0.25734644749089725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141071417","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.89646155,0.0013989768,0.10138167,0.00054097583,0.00004171844,0.000088849694,0.000010036949,0.0000019147067,0.00007428376],"genre_scores_gemma":[0.9938332,0.00003974648,0.005777784,0.000051058985,0.00027473544,2.8598862e-7,0.00001062206,0.0000053758877,0.000007190412],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991099,0.00009235603,0.0003919446,0.000094350224,0.00014732836,0.00016412228],"domain_scores_gemma":[0.99917585,0.000034318313,0.00045329388,0.00013121136,0.00016269682,0.00004264773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000800398,0.00009177842,0.00014505246,0.000015898946,0.00015916734,0.000029218532,0.00020036263,0.000046735946,0.0000046139116],"category_scores_gemma":[0.000056607303,0.00005208,0.000088086475,0.00008188698,0.00007242059,0.0000051863362,0.00012419472,0.00013529437,1.8573743e-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.00066324306,0.0005995117,0.20692599,0.00029629862,0.001741277,0.000026061827,0.0035944846,0.18081301,0.5053639,0.0003660611,0.0074106143,0.09219955],"study_design_scores_gemma":[0.005925846,0.0010440288,0.15257396,0.00038466766,0.0006053648,0.0015421537,0.008940895,0.74799824,0.036461,0.0011269645,0.04247615,0.00092075847],"about_ca_topic_score_codex":0.000008817338,"about_ca_topic_score_gemma":0.000004550962,"teacher_disagreement_score":0.56718516,"about_ca_system_score_codex":0.000008210258,"about_ca_system_score_gemma":0.00004656092,"threshold_uncertainty_score":0.21237607},"labels":[],"label_agreement":null},{"id":"W2141443639","doi":"10.1163/15685241-12341240","title":"Evolution and Emergence: A Re-Evaluation of the “New Synthesis”","year":2012,"lang":"en","type":"article","venue":"KronoScope","topic":"Genome Rearrangement Algorithms","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":"University of Windsor","funders":"","keywords":"Reductionism; Biology; Genome; Categorization; Evolutionary biology; Epistemology; Body plan; Cognitive science; Gene; Genetics; Psychology; Philosophy","score_opus":0.0225425961857126,"score_gpt":0.27731825767611085,"score_spread":0.25477566149039826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141443639","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.9917621,0.004934043,0.0006009913,0.00015208301,0.00024537387,0.00021525766,0.000003296735,0.0000027795315,0.0020840452],"genre_scores_gemma":[0.99888885,0.00007161373,0.00051315746,0.000013321152,0.00017858158,0.000016141432,0.00000412131,0.0000066224334,0.00030756573],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994597,0.00007576671,0.0000907008,0.000099444485,0.00015662993,0.000117780764],"domain_scores_gemma":[0.99964315,0.0000041411586,0.00005404936,0.00020846102,0.00005020183,0.000040002604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004308659,0.000057154288,0.000052234525,0.0000137750285,0.000035501893,0.0000033691695,0.000081046324,0.00004825534,0.00012675309],"category_scores_gemma":[0.00012843125,0.000043259664,0.000027271046,0.00005752188,0.00003380846,0.000003842011,0.000066903696,0.000023635557,0.000007833431],"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.000016834965,0.00005363149,0.05035411,0.000019846317,0.00005140168,1.3354403e-8,0.00024744324,0.000053143973,0.92756903,0.00014893571,0.008093949,0.013391641],"study_design_scores_gemma":[0.00040585897,0.000074522504,0.28676638,0.000025284344,0.0001686322,0.000002406535,0.00027921554,0.00020803379,0.6984728,0.00025245635,0.013185067,0.0001593651],"about_ca_topic_score_codex":0.000023034545,"about_ca_topic_score_gemma":0.000014318037,"teacher_disagreement_score":0.23641227,"about_ca_system_score_codex":0.000012865427,"about_ca_system_score_gemma":0.00006270752,"threshold_uncertainty_score":0.17640778},"labels":[],"label_agreement":null},{"id":"W2142027180","doi":"10.1093/bioinformatics/bts716","title":"SCARPA: scaffolding reads with practical algorithms","year":2012,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"SickKids Foundation; Hospital for Sick Children; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; University of Toronto","keywords":"Scaffold; Contig; Computer science; Algorithm; Heuristic; Process (computing); Genome; Biology; Artificial intelligence; Programming language; Genetics","score_opus":0.021609353128708805,"score_gpt":0.2760012413538531,"score_spread":0.2543918882251443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142027180","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.7777434,0.0013853833,0.1630442,0.0006407886,0.0010062525,0.0011563167,0.000052333657,0.00017451837,0.054796834],"genre_scores_gemma":[0.63254124,0.00016357609,0.36497253,0.00029368798,0.0008176852,0.000034240777,0.0001925581,0.00004952505,0.0009349442],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988878,0.000020395528,0.00023865391,0.000119161945,0.00025675836,0.00047727255],"domain_scores_gemma":[0.99924093,0.000011565291,0.000116292555,0.0003617461,0.00007755056,0.00019192061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000312186,0.00017993314,0.00013456609,0.00005433242,0.000090142894,0.000045934656,0.00012787363,0.00012817173,0.00003230295],"category_scores_gemma":[0.00005146603,0.00014266037,0.000053463922,0.00012586763,0.00007214023,0.00003238073,0.000117281255,0.00008393248,0.00015136386],"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.0011280233,0.0034423512,0.25608456,0.0018032527,0.0036725271,0.00006845351,0.011055846,0.0006894957,0.22395438,0.009257323,0.19975731,0.2890865],"study_design_scores_gemma":[0.00445413,0.0021639676,0.017048873,0.00013332463,0.00039043181,0.0014315028,0.004736749,0.012098815,0.15227202,0.000045505833,0.80272204,0.0025026302],"about_ca_topic_score_codex":0.0000029078203,"about_ca_topic_score_gemma":0.0000015055513,"teacher_disagreement_score":0.60296476,"about_ca_system_score_codex":0.000024542538,"about_ca_system_score_gemma":0.00006431904,"threshold_uncertainty_score":0.5817521},"labels":[],"label_agreement":null},{"id":"W2143438047","doi":"10.1093/bioinformatics/btr224","title":"Mapping ancestral genomes with massive gene loss: A matrix sandwich problem","year":2011,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":true,"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; Agence Nationale de la Recherche","keywords":"Genome; Extant taxon; Biology; Gene; Computational biology; Heuristic; Gene duplication; Genetics; Evolutionary biology; Computer science; Artificial intelligence","score_opus":0.018437889191453578,"score_gpt":0.22572372873115842,"score_spread":0.20728583953970484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143438047","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.9335054,0.0014743154,0.04149363,0.00008038468,0.00015321784,0.0010278737,0.000073917545,0.00008211629,0.022109134],"genre_scores_gemma":[0.52021426,0.0005174914,0.47737506,0.00013622905,0.00020684983,0.00006410352,0.00020885398,0.000043841424,0.0012333015],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989671,0.000013070092,0.0003026802,0.00017426875,0.00017327421,0.00036958585],"domain_scores_gemma":[0.99929076,0.0000027013205,0.00017428592,0.00033446978,0.00009346853,0.00010431813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011512796,0.00020769575,0.00016116191,0.000075764314,0.00007806101,0.000035204146,0.00024447267,0.00011184525,0.000051846826],"category_scores_gemma":[0.000005489391,0.00016630536,0.00005955572,0.00014281501,0.00008992968,0.000015053424,0.00010284193,0.000074813914,0.00007417513],"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.0018828328,0.0017832131,0.3622558,0.0050473143,0.0056174034,0.00042255307,0.06463186,0.0014479343,0.4001594,0.0021648323,0.017068543,0.13751833],"study_design_scores_gemma":[0.016830094,0.008751523,0.0751034,0.0005506192,0.00053032534,0.0014603918,0.02086022,0.009898743,0.5904527,0.0015138335,0.26694795,0.0071002427],"about_ca_topic_score_codex":0.000007953504,"about_ca_topic_score_gemma":0.0000063067987,"teacher_disagreement_score":0.43588144,"about_ca_system_score_codex":0.000019992718,"about_ca_system_score_gemma":0.00009162502,"threshold_uncertainty_score":0.67817354},"labels":[],"label_agreement":null},{"id":"W2143705025","doi":"10.1371/journal.pgen.1000483","title":"Reconstructing the History of Yeast Genomes","year":2009,"lang":"en","type":"letter","venue":"PLoS Genetics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Biology; Evolutionary biology; Genome; Computational biology; Yeast; Genetics; Gene","score_opus":0.023683523490867234,"score_gpt":0.2063120663949922,"score_spread":0.18262854290412495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143705025","genre_codex":"review","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20799112,0.40928715,0.00039498895,0.27928513,0.012749169,0.0052345484,0.00087565655,0.00019673519,0.0839855],"genre_scores_gemma":[0.026603559,0.020137126,0.02333326,0.73227715,0.050499957,0.0002342617,0.0043061567,0.0009959405,0.14161257],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852335,0.00009251655,0.0003535831,0.0004026894,0.00029194367,0.00033589444],"domain_scores_gemma":[0.99865854,0.000014150854,0.00031887725,0.0008381318,0.00013594299,0.000034366924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110321926,0.00028818878,0.00028519993,0.00006833742,0.00003584583,0.000012261822,0.0005778266,0.0005508993,0.000081820115],"category_scores_gemma":[0.000028154578,0.00024389927,0.00018333313,0.00005100681,0.00020284808,8.936298e-7,0.0001430213,0.0004933227,0.000021682685],"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.0000051483303,0.000025111636,0.0002564317,0.00011244856,0.0002600995,0.00001138258,0.00013516835,0.00001367221,0.10741745,7.322562e-7,0.8852459,0.006516418],"study_design_scores_gemma":[0.00014652529,0.00013822023,0.000026452588,0.000025071806,0.00013353158,0.000022367867,0.000023963155,0.00007960487,0.023572553,0.000039466035,0.9755168,0.00027547075],"about_ca_topic_score_codex":0.000002149917,"about_ca_topic_score_gemma":0.0000024542983,"teacher_disagreement_score":0.45299205,"about_ca_system_score_codex":0.00008872238,"about_ca_system_score_gemma":0.00024934518,"threshold_uncertainty_score":0.99459237},"labels":[],"label_agreement":null},{"id":"W2144178222","doi":"10.1109/tcbb.2008.121","title":"Generalized Gene Adjacencies, Graph Bandwidth, and Clusters in Yeast Evolution","year":2008,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Phylogenetic tree; Parameterized complexity; Phylogenetics; Biology; Graph; Genome; Phylogenetic network; Evolutionary biology; Cluster analysis; Computational biology; Gene; Theoretical computer science; Computer science; Genetics; Algorithm; Artificial intelligence","score_opus":0.014631648770693796,"score_gpt":0.23713750611594622,"score_spread":0.22250585734525244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144178222","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.7018226,0.00033026573,0.29719222,0.00016498077,0.00015270206,0.0001844922,0.00008404382,0.00001393009,0.00005476207],"genre_scores_gemma":[0.9463801,0.0009047282,0.052074134,0.0002649863,0.000041740877,0.000019787403,0.0002318624,0.000008558972,0.00007410421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992131,0.00004693547,0.00027350814,0.00019305745,0.00008470514,0.00018868195],"domain_scores_gemma":[0.9996455,0.000027256712,0.00006495144,0.00013738844,0.000055889246,0.000069039415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011637178,0.00015349849,0.0001443908,0.00017592068,0.00019377485,0.000010831727,0.000089605965,0.00016604818,0.00000794589],"category_scores_gemma":[0.000010110278,0.00014372249,0.000045605517,0.00013803436,0.00022754785,0.0000135188075,0.000010462873,0.00010755452,0.0000064889764],"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.0032044894,0.002414572,0.09667238,0.00078999565,0.0022009187,0.000060850845,0.0073522697,0.4506281,0.21009664,0.0026478057,0.0033120262,0.22061995],"study_design_scores_gemma":[0.039352935,0.008066388,0.34928244,0.00026057207,0.00042202082,0.0041782395,0.0027169182,0.50439376,0.046520855,0.024142127,0.015064098,0.0055996594],"about_ca_topic_score_codex":0.000016995904,"about_ca_topic_score_gemma":0.000029828689,"teacher_disagreement_score":0.25261006,"about_ca_system_score_codex":0.0000220783,"about_ca_system_score_gemma":0.00006032451,"threshold_uncertainty_score":0.5860833},"labels":[],"label_agreement":null},{"id":"W2145757848","doi":"10.1186/1471-2105-10-s1-s2","title":"Genome aliquoting with double cut and join","year":2009,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society; Royal Society of Canada","keywords":"Genome; Sign (mathematics); Heuristic; Combinatorics; Genetics; Biology; Gene; Human genome; Computational biology; Mathematics; Computer science; Artificial intelligence","score_opus":0.012803395977688994,"score_gpt":0.2268005749068623,"score_spread":0.2139971789291733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145757848","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.9192895,0.0006457091,0.061633706,0.0001717425,0.000056092318,0.00053561846,0.0000123966565,0.000051665247,0.017603539],"genre_scores_gemma":[0.6640418,0.00027127963,0.3327975,0.00069502933,0.00026487408,0.000014541653,0.00024378495,0.000032947486,0.0016382261],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993229,0.000007224119,0.00019552158,0.0001239975,0.00011870646,0.00023168004],"domain_scores_gemma":[0.9995493,0.0000030955339,0.00008590897,0.00023669995,0.0000434313,0.00008152412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012674025,0.00013749815,0.00011147141,0.0000425385,0.00007074678,0.00005360029,0.00010658757,0.0000778548,0.000008060942],"category_scores_gemma":[0.0000057703655,0.00011168527,0.000028814362,0.000073399555,0.00003948029,0.0000095317955,0.0000520753,0.00005431332,0.000019249115],"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.0027712737,0.0010739627,0.079717904,0.0025880027,0.0013829252,0.000047399506,0.0111239515,0.009583924,0.7777722,0.0048961253,0.005452507,0.10358983],"study_design_scores_gemma":[0.036597464,0.014266641,0.25129667,0.00038504848,0.0007347377,0.0015661247,0.008488043,0.10880211,0.24500977,0.000958173,0.3247843,0.0071109207],"about_ca_topic_score_codex":0.0000021140959,"about_ca_topic_score_gemma":0.0000120568,"teacher_disagreement_score":0.5327624,"about_ca_system_score_codex":0.000008622177,"about_ca_system_score_gemma":0.00003998547,"threshold_uncertainty_score":0.4554393},"labels":[],"label_agreement":null},{"id":"W2148088562","doi":"10.1142/s0219720010005002","title":"A GRAPH-BASED ALGORITHM FOR MINING MULTI-LEVEL PATTERNS IN GENOMIC DATA","year":2010,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Genome Rearrangement Algorithms","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 Waterloo; University of Guelph","funders":"","keywords":"Genome; Comparative genomics; Genomics; Computer science; Graph; Computational biology; Data mining; Gene; Theoretical computer science; Biology; Genetics","score_opus":0.039847663363638125,"score_gpt":0.2978313042449222,"score_spread":0.2579836408812841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148088562","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.406325,0.0001704728,0.59274274,0.00015043338,0.00018507581,0.00011456381,0.00030532965,0.0000013744385,0.000004990564],"genre_scores_gemma":[0.24808002,0.00007630982,0.75080264,0.00022179243,0.00013509917,0.0000038123842,0.0006669362,0.000008203542,0.0000051685347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992058,0.000017247283,0.00045209116,0.000111064655,0.0000651232,0.00014867527],"domain_scores_gemma":[0.9993192,0.000053058873,0.00029142704,0.00013414703,0.0001429578,0.000059197686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043889665,0.00010209739,0.00016329593,0.00016016801,0.000039580435,0.000022326069,0.00025893986,0.00010753639,0.000003787225],"category_scores_gemma":[0.000039011502,0.00008781124,0.000050548264,0.000047292266,0.000057306243,0.000011047,0.00010572477,0.000105821644,5.930394e-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.00012987471,0.00031758155,0.032715257,0.00012556065,0.0002902465,0.0000061027736,0.00030024297,0.002820868,0.033629756,0.00015149172,0.00069532666,0.9288177],"study_design_scores_gemma":[0.004224426,0.00070356816,0.03631204,0.000023234677,0.000029939667,0.00012820619,0.00020731457,0.9511013,0.00046097243,0.00055474485,0.006005828,0.0002484438],"about_ca_topic_score_codex":0.0000041281296,"about_ca_topic_score_gemma":0.000037053727,"teacher_disagreement_score":0.9482804,"about_ca_system_score_codex":0.0000053235103,"about_ca_system_score_gemma":0.0001153123,"threshold_uncertainty_score":0.35808384},"labels":[],"label_agreement":null},{"id":"W2151053705","doi":"10.1007/11554714_2","title":"Genes Order and Phylogenetic Reconstruction: Application to γ-Proteobacteria","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université du Québec à Montréal","funders":"","keywords":"Phylogenetic tree; Genome; Phylogenetic network; Phylogenetics; Biology; Computational biology; Gene; Phylogenetic relationship; Genetics; Evolutionary biology","score_opus":0.007438903979484146,"score_gpt":0.22311328112350712,"score_spread":0.21567437714402296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151053705","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.019287378,0.0012170793,0.97745544,0.0003511787,0.0004163321,0.0005987423,0.000007840233,0.000014758586,0.0006512701],"genre_scores_gemma":[0.22545725,0.00082849304,0.76741904,0.001359308,0.003311699,0.00009516102,0.00006312113,0.000089454305,0.0013765026],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99853617,0.0000098019755,0.00019669594,0.00083349267,0.00018120451,0.00024266279],"domain_scores_gemma":[0.9992003,0.00000890855,0.000084544656,0.00047897224,0.00013150217,0.00009580518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016449412,0.00024402773,0.00017706711,0.00017382519,0.00008223954,0.00007500771,0.00034852975,0.00021309008,0.000024318259],"category_scores_gemma":[0.00001454501,0.00024239086,0.000030727282,0.000128084,0.0002428458,0.0000048158945,0.0003212502,0.000118542746,0.00001892399],"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.0000055502856,0.000004340411,0.00012154485,0.000010894816,0.000007473328,8.340507e-7,0.000024973962,0.00201481,0.15612856,0.00002068258,0.0000037875125,0.84165657],"study_design_scores_gemma":[0.0024541123,0.0024906301,0.009729883,0.00062406744,0.00013212403,0.0012157102,0.0000022818926,0.044824284,0.640045,0.023452403,0.26922572,0.0058037825],"about_ca_topic_score_codex":0.0000042681286,"about_ca_topic_score_gemma":0.000053079675,"teacher_disagreement_score":0.8358528,"about_ca_system_score_codex":0.00004239626,"about_ca_system_score_gemma":0.00010685333,"threshold_uncertainty_score":0.9884412},"labels":[],"label_agreement":null},{"id":"W2152272083","doi":"10.1007/s13173-012-0064-8","title":"Gene clusters as intersections of powers of paths","year":2012,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"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 Toronto; University of Ottawa","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Combinatorics; Graph; Induced subgraph; Path (computing); Intersection (aeronautics); Mathematics; Genome; Set (abstract data type); Computer science; Discrete mathematics; Gene; Biology; Genetics; Vertex (graph theory)","score_opus":0.007209846335613205,"score_gpt":0.23459485128222765,"score_spread":0.22738500494661446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152272083","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.9848185,0.0005302243,0.012899899,0.00028215727,0.0012653926,0.00007958674,0.0000063068937,0.0000015763342,0.00011636456],"genre_scores_gemma":[0.9870451,0.00008537914,0.011964057,0.00024656105,0.000508065,4.6641182e-7,0.0000017498213,0.000010934485,0.00013770322],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992374,0.000056427587,0.0003137369,0.00007058964,0.00017556445,0.00014626337],"domain_scores_gemma":[0.9991322,0.000010493314,0.00040214421,0.00022917111,0.00015949603,0.00006650318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030275498,0.00008813916,0.00015739189,0.0000213398,0.000037808,0.0000065044987,0.0003324762,0.00007701108,0.000012729665],"category_scores_gemma":[0.000011132009,0.0000637857,0.000544654,0.00008922325,0.00009595143,0.000008816027,0.00018806999,0.00011310769,0.0000013153598],"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.000084538035,0.00045987335,0.03937242,0.0000992169,0.0013621126,0.0000010312463,0.0047925157,0.0010505794,0.89795876,0.0000155922,0.046240285,0.008563058],"study_design_scores_gemma":[0.0031707329,0.0018576187,0.102390215,0.00019320766,0.00034708847,0.00049082213,0.0022718678,0.0009910848,0.8553307,0.00010527827,0.03237296,0.00047844762],"about_ca_topic_score_codex":0.0000032519008,"about_ca_topic_score_gemma":9.1284664e-7,"teacher_disagreement_score":0.06301779,"about_ca_system_score_codex":0.000023624945,"about_ca_system_score_gemma":0.00005282083,"threshold_uncertainty_score":0.26011056},"labels":[],"label_agreement":null},{"id":"W2152386885","doi":"10.1186/1471-2164-15-s6-s5","title":"Gene order alignment on trees with multiOrthoAlign","year":2014,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"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 Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inference; Phylogenetic tree; Heuristic; Dynamic programming; Biology; Genome; Order (exchange); Tree (set theory); Phylogenetics; DNA microarray; Phylogenetic network; Multiple sequence alignment; Computational biology; Computer science; Gene; Artificial intelligence; Algorithm; Genetics; Sequence alignment; Mathematics; Combinatorics","score_opus":0.011554744179341155,"score_gpt":0.21932736903887448,"score_spread":0.20777262485953332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152386885","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.9669645,0.000114714625,0.03016477,0.00005919587,0.000098763594,0.000268931,0.000013129334,0.000018086463,0.0022979479],"genre_scores_gemma":[0.9518206,0.00007323764,0.045485657,0.00033093378,0.0003777065,0.000041768395,0.00015002972,0.00005256043,0.0016674787],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990417,0.00004679401,0.00014492068,0.0003737109,0.00013609926,0.0002567753],"domain_scores_gemma":[0.99930805,0.000009174789,0.000067001296,0.0004755081,0.000054160177,0.00008609085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001467987,0.00018245111,0.00012712952,0.000036021553,0.00006403183,0.000024890358,0.00017205159,0.000087381624,0.000019541681],"category_scores_gemma":[0.00001949288,0.00015589951,0.000051771647,0.00005431803,0.00004089556,0.0000013995772,0.00006456417,0.000043498265,0.000080553364],"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.00020684906,0.00018126411,0.009393071,0.00001870967,0.000118879434,0.0000022798367,0.0001050122,0.010857762,0.969789,0.00015633696,0.0009187234,0.008252056],"study_design_scores_gemma":[0.0026766637,0.0015584782,0.013588828,0.000010784831,0.000060225764,0.000018154382,0.00012623229,0.0013079832,0.7698759,0.00006763151,0.21003933,0.0006697967],"about_ca_topic_score_codex":0.00001124639,"about_ca_topic_score_gemma":0.00014078224,"teacher_disagreement_score":0.20912062,"about_ca_system_score_codex":0.000029074949,"about_ca_system_score_gemma":0.00005373477,"threshold_uncertainty_score":0.63573974},"labels":[],"label_agreement":null},{"id":"W2153542855","doi":"10.1186/1471-2105-13-s19-s5","title":"Medians seek the corners, and other conjectures","year":2012,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computational biology; Biology","score_opus":0.017517362560641996,"score_gpt":0.2381653842075965,"score_spread":0.22064802164695452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153542855","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.8358201,0.011308549,0.102556445,0.00059185096,0.0011667339,0.0015900286,0.0001875253,0.000097752265,0.04668101],"genre_scores_gemma":[0.9240016,0.00038041742,0.068183325,0.004382892,0.0010938077,0.00004574665,0.000116260446,0.000055024528,0.0017409376],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994672,0.000019521187,0.00013665509,0.00005703911,0.00009537008,0.00022424741],"domain_scores_gemma":[0.99961036,0.000015988026,0.000059106776,0.00022245424,0.000018627688,0.000073441784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002067534,0.0001015643,0.000069399124,0.000018124372,0.00006732573,0.000026967115,0.00011674041,0.00007776143,0.000025595304],"category_scores_gemma":[0.00003909303,0.00006422785,0.000033716602,0.000039012382,0.0001024436,0.000005254334,0.00007929298,0.000050995484,0.000042497995],"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.0002380535,0.0004306763,0.64921474,0.0011896875,0.0010836826,0.0000018112526,0.029141374,0.0005515237,0.048659198,0.0063808705,0.19102699,0.0720814],"study_design_scores_gemma":[0.001136361,0.00020197302,0.02131391,0.000015088864,0.00008545859,0.00010274249,0.0043733506,0.007058533,0.009944755,0.00009558969,0.9551529,0.000519312],"about_ca_topic_score_codex":0.000005355294,"about_ca_topic_score_gemma":0.0000140778275,"teacher_disagreement_score":0.76412594,"about_ca_system_score_codex":0.0000045226952,"about_ca_system_score_gemma":0.000021523323,"threshold_uncertainty_score":0.26191357},"labels":[],"label_agreement":null},{"id":"W2155919888","doi":"10.1186/gb-2003-4-4-r25","title":"Genome-wide detection of segmental duplications and potential assembly errors in the human genome sequence","year":2003,"lang":"en","type":"article","venue":"Genome biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":259,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Hospital for Sick Children","funders":"Canadian Institutes of Health Research; Hospital for Sick Children; Centre de Regulació Genòmica; Genome Canada; Howard Hughes Medical Institute","keywords":"Segmental duplication; Biology; Genome; Human genome; Genetics; Sequence (biology); Whole genome sequencing; Genome evolution; Computational biology; Gene","score_opus":0.015445461969819893,"score_gpt":0.25942643087095557,"score_spread":0.2439809689011357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155919888","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.99567586,0.001284615,0.001906782,0.0000828066,0.00008081443,0.00042090553,0.000048536287,0.000007677883,0.00049198064],"genre_scores_gemma":[0.99862725,0.00027297228,0.00041008895,0.00011075944,0.00007336276,0.00007054822,0.00030086236,0.000017064085,0.00011706956],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99867344,0.00021421428,0.0003029914,0.0004144907,0.0000786584,0.0003161877],"domain_scores_gemma":[0.99936706,0.000013007094,0.00013206754,0.00038618103,0.000050995604,0.0000506737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042107186,0.00017145969,0.00017645748,0.000112566624,0.00013205303,0.0000133721305,0.00026708507,0.00017422528,0.000024416579],"category_scores_gemma":[0.000034453096,0.00014835871,0.0000664541,0.00016845616,0.00020480464,0.0000050297303,0.00008537695,0.00011260982,0.000009193765],"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.000007624091,0.00005014052,0.005364575,0.0000100981915,0.000036212772,0.0000018752155,0.00012580023,0.000047754154,0.99408996,0.000099710756,0.0000010417848,0.00016519074],"study_design_scores_gemma":[0.0015924859,0.0012595737,0.8177316,0.000004619755,0.000079058205,0.00018754246,0.0010762041,0.00002047075,0.13742924,0.0009054133,0.039068904,0.00064487493],"about_ca_topic_score_codex":0.000038630966,"about_ca_topic_score_gemma":0.000067732944,"teacher_disagreement_score":0.8566607,"about_ca_system_score_codex":0.00003634348,"about_ca_system_score_gemma":0.00003865747,"threshold_uncertainty_score":0.6049893},"labels":[],"label_agreement":null},{"id":"W2156841116","doi":"","title":"Quadratic Binary Programming Models in Computational Biology","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Heuristics; Solver; Quadratic equation; Linearization; Quadratic programming; Binary number; Computer science; Mathematical optimization; Mathematics; Applied mathematics; Arithmetic","score_opus":0.08857950310823591,"score_gpt":0.376263285187368,"score_spread":0.2876837820791321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156841116","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.95569694,0.0010026298,0.04063311,0.00073731516,0.000091929236,0.0009535961,0.000022697512,0.000023923933,0.0008378724],"genre_scores_gemma":[0.9465602,0.0002703623,0.051137585,0.00004082101,0.00017825987,0.00030751442,0.0005235353,0.000025560641,0.0009561751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981796,0.00030511772,0.00028545855,0.00044938797,0.0002955605,0.0004848479],"domain_scores_gemma":[0.9992237,0.000034206954,0.000013501121,0.00030307894,0.0003347333,0.00009074996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006703459,0.00013269462,0.00014038647,0.00034565318,0.0003750526,0.000039676106,0.00027688418,0.00013803445,0.000040464703],"category_scores_gemma":[0.00008187629,0.00013420303,0.000047321344,0.0005427008,0.00027940777,0.000017234508,0.00018402048,0.00026348044,0.00007736741],"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.00009285207,0.0015792862,0.008348989,0.00006206506,0.00021427967,0.00015858305,0.002370486,0.7480882,0.18725213,0.0075681475,0.002349522,0.041915495],"study_design_scores_gemma":[0.0022550288,0.001200208,0.005471899,0.00002836993,0.0000071336003,0.00017394255,0.0007356458,0.9762401,0.0030034392,0.0023187057,0.0079719005,0.00059364387],"about_ca_topic_score_codex":0.00025327964,"about_ca_topic_score_gemma":0.0001521977,"teacher_disagreement_score":0.22815193,"about_ca_system_score_codex":0.00006192633,"about_ca_system_score_gemma":0.0003784755,"threshold_uncertainty_score":0.5472641},"labels":[],"label_agreement":null},{"id":"W2156923845","doi":"10.1093/bioinformatics/btn146","title":"Guided genome halving: hardness, heuristics and the history of the Hemiascomycetes","year":2008,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Canada Research Chairs","keywords":"Genome; Ancestor; Heuristics; Computer science; Event (particle physics); Genome evolution; Heuristic; Biology; Evolutionary biology; Computational biology; Genetics; Gene; Artificial intelligence; Physics","score_opus":0.018734386632463865,"score_gpt":0.20116576835242958,"score_spread":0.1824313817199657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156923845","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.93188536,0.021207806,0.004393684,0.0011094318,0.0024325156,0.0015760984,0.00008205777,0.000047264315,0.03726578],"genre_scores_gemma":[0.975642,0.0028086335,0.009267862,0.0007933566,0.00021021854,0.000024655032,0.00005219569,0.000031369866,0.011169674],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992376,0.000031492436,0.00031634522,0.00008591053,0.00017426285,0.00015438754],"domain_scores_gemma":[0.9991925,0.000016789005,0.00019415513,0.0004739988,0.0000858456,0.000036757672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021734736,0.000121023986,0.0001495068,0.000020727364,0.000096153926,0.0000074508625,0.00030895093,0.000073219104,0.000009945221],"category_scores_gemma":[0.0001476332,0.00007071679,0.00008977245,0.000052131727,0.00060204224,0.0000045913434,0.0002475285,0.000071430186,0.000005170099],"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.0005071972,0.00045603502,0.0473452,0.0021729898,0.001545904,0.000013981118,0.032368153,0.00061022013,0.22976711,0.0049841595,0.67213523,0.008093805],"study_design_scores_gemma":[0.004496999,0.00016082021,0.020932203,0.00004168945,0.00015250567,0.00028623396,0.0006772723,0.0064851693,0.013320609,0.0002273591,0.9526491,0.0005700146],"about_ca_topic_score_codex":0.000009417969,"about_ca_topic_score_gemma":0.0000016169425,"teacher_disagreement_score":0.28051388,"about_ca_system_score_codex":0.000035301447,"about_ca_system_score_gemma":0.00013601745,"threshold_uncertainty_score":0.2883747},"labels":[],"label_agreement":null},{"id":"W2157761435","doi":"10.1016/j.dam.2005.02.033","title":"Advances on sorting by reversals","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":109,"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 à Montréal","funders":"","keywords":"Sorting; Sequence (biology); Mathematics; Time complexity; Computational complexity theory; Genome; Combinatorics; Computational problem; Algorithm; Discrete mathematics; Theoretical computer science; Computer science; Gene; Biology; Genetics","score_opus":0.005108295393556165,"score_gpt":0.22816705948609153,"score_spread":0.22305876409253536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157761435","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.4867094,0.0013885499,0.071311206,0.00024446737,0.00016545113,0.0011518227,0.000088421846,0.00013178895,0.4388089],"genre_scores_gemma":[0.94645214,0.00019693241,0.049516406,0.00020819851,0.00034315986,0.000107479435,0.00050260505,0.000082423365,0.0025906775],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990702,0.0000062722615,0.00024107537,0.00026001935,0.0001775651,0.00024485093],"domain_scores_gemma":[0.9994756,0.000013334588,0.00013682191,0.0003166501,0.00001925207,0.0000383379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012241626,0.00016762898,0.0001507616,0.000022747417,0.00006614352,0.000025730613,0.00015918068,0.00007917015,0.000024396939],"category_scores_gemma":[0.000016011718,0.000150402,0.000058402213,0.000059489987,0.000042029693,0.000002356275,0.00005851937,0.00005733739,0.00006621376],"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.000014481339,0.000112914335,0.000049035876,0.0000954446,0.000026006475,0.0000010673313,0.000049784947,0.0001296401,0.9776293,0.008649105,0.010224755,0.0030184535],"study_design_scores_gemma":[0.0011471479,0.00021505934,0.00006226824,0.000048903486,0.000062554725,0.000005606801,0.00062736,0.00035576063,0.8534718,0.023497557,0.11971723,0.0007887046],"about_ca_topic_score_codex":0.000002261447,"about_ca_topic_score_gemma":0.0000023477314,"teacher_disagreement_score":0.45974272,"about_ca_system_score_codex":0.000010821525,"about_ca_system_score_gemma":0.000009087755,"threshold_uncertainty_score":0.6133216},"labels":[],"label_agreement":null},{"id":"W2158055157","doi":"10.1186/1471-2105-14-s15-s7","title":"Phase change for the accuracy of the median value in estimating divergence time","year":2013,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Divergence (linguistics); Statistics; Phase (matter); Value (mathematics); Mathematics; Computer science; Physics","score_opus":0.03238774637538646,"score_gpt":0.27991624986510255,"score_spread":0.24752850348971608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158055157","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.806235,0.00080742076,0.18315029,0.0016060837,0.0009876788,0.0062902216,0.00018155108,0.000024998084,0.0007167397],"genre_scores_gemma":[0.5738331,0.0001537824,0.42330483,0.0007126885,0.0005629764,0.00079680374,0.00015272718,0.00004195576,0.00044114457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993114,0.000019363059,0.00028313388,0.00007413602,0.00012486047,0.00018713051],"domain_scores_gemma":[0.99929076,0.00008552521,0.00018418043,0.00034493537,0.00006470702,0.000029868635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023937554,0.00009768807,0.00009370494,0.00002383678,0.000070803944,0.000019713543,0.00038170695,0.000062789775,0.000028125514],"category_scores_gemma":[0.00036311778,0.00005676977,0.000074645766,0.00010231369,0.000068932066,0.000014484503,0.0001725865,0.000048733316,0.000029510655],"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.00020539157,0.001512335,0.020518148,0.0034616927,0.0005368419,7.6911294e-7,0.025309894,0.019906553,0.22204022,0.0006681363,0.03045185,0.67538816],"study_design_scores_gemma":[0.0009666038,0.00012586718,0.0015058473,0.000033110457,0.000019358276,0.0000019529634,0.00038895314,0.98633367,0.008732813,0.00013468864,0.0016435086,0.00011361739],"about_ca_topic_score_codex":0.00004862668,"about_ca_topic_score_gemma":0.000012755953,"teacher_disagreement_score":0.96642715,"about_ca_system_score_codex":0.000009293272,"about_ca_system_score_gemma":0.00004302735,"threshold_uncertainty_score":0.23150042},"labels":[],"label_agreement":null},{"id":"W2159070430","doi":"10.1186/1471-2105-12-s9-s2","title":"Evolution of orthologous tandemly arrayed gene clusters","year":2011,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bombardier (Canada); Université de Montréal","funders":"","keywords":"DNA microarray; Genetics; Biology; Computational biology; Gene; Evolutionary biology; Gene expression","score_opus":0.021895325964833415,"score_gpt":0.21869581851453831,"score_spread":0.1968004925497049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159070430","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.5280354,0.00026192854,0.46049184,0.0000047880985,0.00023647708,0.00033932805,0.00003153991,0.000026887185,0.010571834],"genre_scores_gemma":[0.7077473,0.00007155851,0.29163226,0.000049855007,0.00006975533,0.000011556952,0.00009501062,0.000017262997,0.00030547776],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991936,0.00002100035,0.0003448132,0.00010810595,0.0001304542,0.00020199872],"domain_scores_gemma":[0.9993235,0.000003829415,0.00018707836,0.00033988777,0.00008731524,0.000058405978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018297341,0.00012385074,0.00013204078,0.000066291635,0.000036234094,0.0000058246924,0.00018351906,0.00013493614,0.00003757906],"category_scores_gemma":[0.00003696432,0.00011401045,0.00008716347,0.000095675736,0.00008742521,0.000007186913,0.00009290682,0.000047020687,0.000048875878],"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.0013541286,0.0012758162,0.31035468,0.0020360542,0.0010520421,0.000013401063,0.011064961,0.0033526558,0.62943727,0.0020524696,0.009634345,0.028372178],"study_design_scores_gemma":[0.008552311,0.0043479856,0.20031159,0.0001151582,0.00043620975,0.0003084943,0.007542001,0.082448006,0.67337686,0.0011833096,0.018923141,0.0024549202],"about_ca_topic_score_codex":0.000011723481,"about_ca_topic_score_gemma":0.000017363078,"teacher_disagreement_score":0.17971186,"about_ca_system_score_codex":0.000021173048,"about_ca_system_score_gemma":0.00007858512,"threshold_uncertainty_score":0.46492112},"labels":[],"label_agreement":null},{"id":"W2159640103","doi":"10.1093/bioinformatics/btq216","title":"Next-generation VariationHunter: combinatorial algorithms for transposon insertion discovery","year":2010,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":221,"is_retracted":false,"has_abstract":true,"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; National Institutes of Health; Genome British Columbia; National Human Genome Research Institute; Howard Hughes Medical Institute","keywords":"Transposable element; Algorithm; Genome; Computer science; Human genome; Structural variation; Scope (computer science); Computational biology; Biology; Genetics; Gene","score_opus":0.024851415321221256,"score_gpt":0.2506231169510057,"score_spread":0.22577170162978444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159640103","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.6862942,0.000044049226,0.30817923,0.00019845906,0.0036910304,0.000875853,0.0001296174,0.000037469228,0.00055009907],"genre_scores_gemma":[0.9315189,0.000059063208,0.06319182,0.00018876688,0.0019714218,0.00011805253,0.0025868993,0.000032864846,0.00033222075],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991543,0.00001245638,0.00031887094,0.00015278762,0.00015473395,0.0002068474],"domain_scores_gemma":[0.999423,0.000009249713,0.00011967257,0.0002692263,0.00011948934,0.000059325837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000225154,0.00014859656,0.00011270105,0.000053566455,0.00012232494,0.00014493855,0.00015503042,0.00019695537,0.000010043165],"category_scores_gemma":[0.00005894599,0.00014376262,0.00009757781,0.00006896388,0.00003207286,0.00005474866,0.000026925161,0.00008631478,0.0000135245045],"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.000058232275,0.00009757836,0.00022278483,0.00006135858,0.000056353052,1.560039e-7,0.00025427394,0.00004919974,0.98207414,0.002122373,0.0015224547,0.013481094],"study_design_scores_gemma":[0.007180573,0.001607073,0.0026688483,0.00002164735,0.00016831185,0.000022571485,0.00032742452,0.20518202,0.59175277,0.0011256066,0.18875588,0.0011872663],"about_ca_topic_score_codex":0.000005654709,"about_ca_topic_score_gemma":0.000023711727,"teacher_disagreement_score":0.39032137,"about_ca_system_score_codex":0.000014393964,"about_ca_system_score_gemma":0.00006668355,"threshold_uncertainty_score":0.58624697},"labels":[],"label_agreement":null},{"id":"W2161481677","doi":"10.1093/bioinformatics/btq255","title":"Pathgroups, a dynamic data structure for genome reconstruction problems","year":2010,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":18,"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 Montréal; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Computer science; Heuristic; Greedy algorithm; Genome; Set (abstract data type); Data structure; Sequence (biology); Algorithm; Scheme (mathematics); Theoretical computer science; Data mining; Computational biology; Gene; Artificial intelligence; Biology; Mathematics; Genetics","score_opus":0.012882705248054703,"score_gpt":0.24099728298190282,"score_spread":0.2281145777338481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161481677","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.9100072,0.00029570682,0.08266717,0.00017085036,0.0015938501,0.001747681,0.0026209194,0.000068235124,0.0008283978],"genre_scores_gemma":[0.5644222,0.00019472347,0.42221504,0.00017647745,0.00060823024,0.00005799195,0.011741981,0.0000619678,0.0005213859],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991396,0.0000065538215,0.00028599487,0.0002148789,0.00010613901,0.00024685165],"domain_scores_gemma":[0.99882245,0.0000055484625,0.00014618742,0.0008710044,0.000084605264,0.00007019028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018202586,0.00015168008,0.00011681339,0.000049192087,0.00009165758,0.0000550873,0.00046116317,0.00019134463,0.000029222227],"category_scores_gemma":[0.00006392669,0.00013796492,0.00004513282,0.00006469738,0.000060205344,0.000019620393,0.00020739011,0.00011787576,0.00001271148],"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.000022236325,0.000029407982,0.0003564784,0.00024587958,0.00009904806,2.463367e-7,0.00017293055,0.00004792817,0.9078903,0.00007107865,0.00081164984,0.09025277],"study_design_scores_gemma":[0.004048096,0.0009177964,0.0046396875,0.00004321941,0.00019973193,0.0004988504,0.00079568423,0.20712677,0.020097518,0.0019474493,0.75799763,0.0016875432],"about_ca_topic_score_codex":0.0000022438408,"about_ca_topic_score_gemma":0.00009542309,"teacher_disagreement_score":0.8877928,"about_ca_system_score_codex":0.00000990373,"about_ca_system_score_gemma":0.00006355299,"threshold_uncertainty_score":0.5626046},"labels":[],"label_agreement":null},{"id":"W2165336044","doi":"10.1186/1471-2105-11-304","title":"Scaffold filling, contig fusion and comparative gene order inference","year":2010,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":57,"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 Montréal; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Contig; Synteny; Biology; Computational biology; Phylogenetic tree; Comparative genomics; Hybrid genome assembly; DNA microarray; Gene; Genetics; Genomics","score_opus":0.027260786510222387,"score_gpt":0.26934092065029847,"score_spread":0.24208013414007606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165336044","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.93880624,0.00019980261,0.05572917,0.00003260403,0.00024132662,0.00031849768,0.0000318365,0.000022579394,0.004617953],"genre_scores_gemma":[0.6563189,0.00023499806,0.34188962,0.00018340291,0.00016998748,0.000018594359,0.00026257755,0.000013362681,0.0009085601],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993038,0.0000123293175,0.00023203256,0.00013520055,0.00012066316,0.0001959362],"domain_scores_gemma":[0.99938136,0.000015588763,0.000106255175,0.00027484485,0.0001305742,0.00009135938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013671655,0.00014826618,0.00013943324,0.000042480155,0.00008668814,0.000053100914,0.0001396681,0.0001434268,0.000045364835],"category_scores_gemma":[0.000059745435,0.0001289141,0.00003255368,0.00007905237,0.00010273866,0.000009812163,0.00015260499,0.00010204101,0.00004810653],"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.000102208156,0.00019717,0.044775236,0.0003001366,0.00017585747,0.0000019975835,0.0028710996,0.0005427844,0.92808294,0.0013628901,0.0063463314,0.015241319],"study_design_scores_gemma":[0.0051786355,0.0010947179,0.044830725,0.000069959686,0.0001275168,0.00010204049,0.002057209,0.3017126,0.38399926,0.0002887277,0.25862598,0.0019126111],"about_ca_topic_score_codex":0.0000065476015,"about_ca_topic_score_gemma":0.000093902825,"teacher_disagreement_score":0.5440837,"about_ca_system_score_codex":0.000003487766,"about_ca_system_score_gemma":0.0000589538,"threshold_uncertainty_score":0.5256964},"labels":[],"label_agreement":null},{"id":"W2167155214","doi":"10.1186/1471-2105-10-192","title":"OrthoClusterDB: an online platform for synteny blocks","year":2009,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":33,"is_retracted":false,"has_abstract":true,"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; Michael Smith Health Research BC; Universities Space Research Association","keywords":"Synteny; Genome; Comparative genomics; Identification (biology); Biology; Block (permutation group theory); Visualization; Computational biology; Genomics; Computer science; Gene; Genetics; Data mining; Mathematics","score_opus":0.03838297489699107,"score_gpt":0.276687611470927,"score_spread":0.23830463657393594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167155214","genre_codex":"empirical","genre_gemma":"methods","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.54859394,0.00030739728,0.4451663,0.00019961142,0.0003428044,0.0014373637,0.0003410707,0.000111934496,0.0034996197],"genre_scores_gemma":[0.15437809,0.00012063593,0.83738196,0.001762828,0.0007863014,0.00003874164,0.003283192,0.00004652319,0.0022017492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998984,0.0000067128194,0.00036188168,0.00016629077,0.00014328385,0.0003378476],"domain_scores_gemma":[0.99918365,0.000009342451,0.00012394154,0.0004452663,0.000109276305,0.00012854609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017216842,0.00018932302,0.00015953694,0.00006232822,0.000078601945,0.000046245994,0.00026565403,0.00016976394,0.000013204384],"category_scores_gemma":[0.000056969002,0.00017007231,0.000113459435,0.000074442345,0.000030475047,0.00001694965,0.000055377786,0.00006379824,0.000013091721],"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.0016634107,0.0031831313,0.0072432472,0.0013611228,0.0005973144,0.0000090243675,0.003351867,0.007896173,0.10782463,0.001812196,0.042476095,0.82258177],"study_design_scores_gemma":[0.0075394074,0.007953158,0.010550933,0.00009542498,0.00021986953,0.00016128735,0.0032504238,0.6653719,0.027445,0.001129997,0.27417025,0.0021123914],"about_ca_topic_score_codex":0.0000014887412,"about_ca_topic_score_gemma":0.000038673817,"teacher_disagreement_score":0.8204694,"about_ca_system_score_codex":0.000016205646,"about_ca_system_score_gemma":0.00007244393,"threshold_uncertainty_score":0.69353473},"labels":[],"label_agreement":null},{"id":"W2168695474","doi":"10.1142/s0219720008003254","title":"THE DISTRIBUTION OF DISTANCES BETWEEN RANDOMLY CONSTRUCTED GENOMES: GENERATING FUNCTION, EXPECTATION, VARIANCE AND LIMITS","year":2008,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Genome Rearrangement Algorithms","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 Ottawa","funders":"","keywords":"Genome; Combinatorics; Limit (mathematics); Biology; Graph; Breakpoint; Mathematics; Variance (accounting); Function (biology); Genetics; Chromosome; Gene; Evolutionary biology","score_opus":0.010180695695394211,"score_gpt":0.22572594971298096,"score_spread":0.21554525401758676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168695474","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.81536293,0.0028734785,0.18140523,0.000128256,0.00008700126,0.00007367217,0.00004006177,0.0000015377541,0.000027825417],"genre_scores_gemma":[0.98923767,0.0014581134,0.008966593,0.000029579849,0.00013328873,0.0000017603891,0.00015988284,0.0000031556392,0.000009964912],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991937,0.000044605003,0.00051157636,0.00006292922,0.00009511904,0.00009206945],"domain_scores_gemma":[0.9989439,0.00010941763,0.0004940778,0.000049498885,0.00036132633,0.000041731928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024099404,0.00008013505,0.00015952025,0.000031830437,0.00020737453,0.000016552278,0.00006805199,0.000056577606,0.0000011474237],"category_scores_gemma":[0.000074777956,0.000055009383,0.000038655642,0.00006572015,0.0002539142,0.000012669188,0.000025415036,0.000055518423,2.201178e-7],"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.002312354,0.00024244993,0.5654405,0.00045494785,0.004022992,0.000009611428,0.0056498344,0.016349688,0.083984405,0.019375606,0.0050055976,0.29715207],"study_design_scores_gemma":[0.020150976,0.0072765206,0.8201932,0.000161248,0.00048377996,0.0021641992,0.0062557105,0.067020126,0.0088204015,0.02164893,0.04451932,0.0013056238],"about_ca_topic_score_codex":9.623607e-7,"about_ca_topic_score_gemma":7.20686e-7,"teacher_disagreement_score":0.29584643,"about_ca_system_score_codex":0.0000064883598,"about_ca_system_score_gemma":0.00007699049,"threshold_uncertainty_score":0.22432175},"labels":[],"label_agreement":null},{"id":"W2169283658","doi":"10.1007/978-3-642-15294-8_7","title":"Reconstruction of Ancestral Genome Subject to Whole Genome Duplication, Speciation, Rearrangement and Loss","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"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":"Gene duplication; Genome; Computer science; Genetic algorithm; Subject (documents); Gene rearrangement; Biology; Evolutionary biology; Genetics; Gene","score_opus":0.009919362723931286,"score_gpt":0.22878160918426516,"score_spread":0.21886224646033386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169283658","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.22540113,0.00097453984,0.770012,0.00063511933,0.000799597,0.000965076,0.000079952944,0.000019049397,0.0011135156],"genre_scores_gemma":[0.7500913,0.0006042696,0.24533163,0.0004669763,0.0021041245,0.000035225905,0.00024265239,0.00007372271,0.0010500907],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983136,0.000012202769,0.00033355466,0.0007863822,0.0002879727,0.00026625674],"domain_scores_gemma":[0.9988605,0.0000144355445,0.00020779714,0.00056848413,0.0002457652,0.000103038954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038558018,0.00024338803,0.00024513458,0.00027676506,0.00008899229,0.0000579114,0.00044288463,0.00023683191,0.000027119366],"category_scores_gemma":[0.000033614153,0.00024815518,0.00005167265,0.0001628255,0.0004096313,0.000011445085,0.00026200069,0.00020835774,0.000010036242],"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.000018759367,0.000017653061,0.0011059982,0.00004474564,0.000024682453,0.0000026687294,0.0002238972,0.0018461193,0.89908034,0.00007867567,0.0000033215726,0.09755314],"study_design_scores_gemma":[0.0038306625,0.0043873326,0.22527628,0.00071519794,0.0002104912,0.00076856016,0.000008999513,0.0032863815,0.50026995,0.05115557,0.20437104,0.0057195136],"about_ca_topic_score_codex":0.000010861073,"about_ca_topic_score_gemma":0.00011486256,"teacher_disagreement_score":0.52469015,"about_ca_system_score_codex":0.00006218379,"about_ca_system_score_gemma":0.00014560205,"threshold_uncertainty_score":0.9999971},"labels":[],"label_agreement":null},{"id":"W2170748243","doi":"10.1109/tcbb.2011.64","title":"An Efficient Method for Exploring the Space of Gene Tree/Species Tree Reconciliations in a Probabilistic Framework","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Tree (set theory); Probabilistic logic; Computer science; Subspace topology; Set (abstract data type); Posterior probability; Data mining; Algorithm; Computational biology; Biology; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.05947419300127574,"score_gpt":0.29739306547873,"score_spread":0.23791887247745427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170748243","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.16663592,0.000040250947,0.8323986,0.00014208107,0.00019543624,0.00039482678,0.00010214948,0.000009046726,0.000081691825],"genre_scores_gemma":[0.5210516,0.00004117609,0.47859773,0.000057386907,0.00003326121,0.00012271314,0.00007252691,0.0000068803965,0.00001672294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918264,0.0000705902,0.00034121453,0.00017114985,0.000072449664,0.00016195583],"domain_scores_gemma":[0.9992486,0.00024136603,0.000109542336,0.0002393311,0.00011913927,0.00004197306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033318077,0.00013132399,0.00015080217,0.00011382656,0.00013521798,0.000009885416,0.00017891848,0.00011389619,0.000008606743],"category_scores_gemma":[0.000064792024,0.00010084859,0.000069350106,0.0001469582,0.00013929291,0.000009896001,0.000005569945,0.00010350958,0.0000016021078],"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.0010611521,0.0017572589,0.0021931683,0.00037647857,0.0005751498,0.0000011524393,0.017642763,0.6864787,0.035188075,0.013072409,0.00006791999,0.24158582],"study_design_scores_gemma":[0.0033482944,0.0047037797,0.038707994,0.000119586395,0.0002466005,0.0000485394,0.0053515327,0.8092762,0.10165432,0.03449601,0.0010796369,0.0009674697],"about_ca_topic_score_codex":0.000010289425,"about_ca_topic_score_gemma":0.00006106393,"teacher_disagreement_score":0.35441568,"about_ca_system_score_codex":0.000017168742,"about_ca_system_score_gemma":0.00005721333,"threshold_uncertainty_score":0.41124862},"labels":[],"label_agreement":null},{"id":"W2170998535","doi":"10.1186/1471-2105-13-s9-s8","title":"Generalized adjacency and the conservation of gene clusters in genetic networks defined by synthetic lethals","year":2012,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Adjacency list; Biology; Schizosaccharomyces pombe; Computational biology; Genetics; Adjacency matrix; Gene; Vertex (graph theory); Saccharomyces cerevisiae; Computer science; Theoretical computer science; Graph; Algorithm","score_opus":0.01116216227566326,"score_gpt":0.21711234933954202,"score_spread":0.20595018706387874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170998535","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.89926535,0.0076760394,0.091858394,0.00012849265,0.00013509003,0.0005787258,0.00001703291,0.0000075742582,0.00033330644],"genre_scores_gemma":[0.8463642,0.0021733542,0.15035154,0.0005728571,0.00010803793,0.00006765903,0.00018887923,0.000028346489,0.0001451173],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897844,0.00009011167,0.00045198103,0.0000916748,0.00012172839,0.000266093],"domain_scores_gemma":[0.9993813,0.00004298632,0.00020093871,0.0002790916,0.000038269114,0.000057385263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005014861,0.00013937448,0.00019100348,0.00004165866,0.00003853546,0.000012456468,0.00013903543,0.00012218695,0.000007076706],"category_scores_gemma":[0.00008279203,0.000103809776,0.000054250006,0.00010446806,0.00016013854,0.000009794939,0.00008119079,0.00005831456,0.0000030210242],"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.002456252,0.0011652509,0.7183301,0.0022837091,0.00090011925,0.0000018570906,0.009289633,0.03411695,0.16501684,0.0028548804,0.022842877,0.040741514],"study_design_scores_gemma":[0.017862478,0.0004111583,0.07246462,0.00011707291,0.00030034632,0.00010291935,0.0015175701,0.8607949,0.033056576,0.00014938149,0.012006498,0.0012164874],"about_ca_topic_score_codex":0.00003158502,"about_ca_topic_score_gemma":0.000019528243,"teacher_disagreement_score":0.8266779,"about_ca_system_score_codex":0.00001108487,"about_ca_system_score_gemma":0.000026034004,"threshold_uncertainty_score":0.42332396},"labels":[],"label_agreement":null},{"id":"W2171285552","doi":"10.1089/cmb.2007.a002","title":"Gene Maps Linearization Using Genomic Rearrangement Distances","year":2007,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"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; McGill University","funders":"","keywords":"Genome; Linearization; Mathematics; Dynamic programming; Bounded function; Heuristic; Breakpoint; Combinatorics; Algorithm; Biology; Gene; Genetics; Mathematical optimization; Chromosome; Nonlinear system","score_opus":0.01605486950027104,"score_gpt":0.2870756702324307,"score_spread":0.2710208007321597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171285552","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.6910418,0.0009079596,0.30748057,0.00008242387,0.00030082476,0.00005978663,0.000010809507,0.0000022363608,0.000113540074],"genre_scores_gemma":[0.9288026,0.00008243825,0.06995755,0.00013686807,0.0008101945,4.6066683e-7,0.00015739155,0.000011618093,0.000040881645],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99911124,0.0000496137,0.0004183169,0.00012996016,0.000125991,0.00016485892],"domain_scores_gemma":[0.9992072,0.00002461783,0.00033872222,0.00007389469,0.0002933195,0.00006225053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005576147,0.00009588592,0.00013966029,0.00011725115,0.000054810505,0.000012493721,0.00013727718,0.0000854849,0.000016781503],"category_scores_gemma":[0.00003513528,0.00008621228,0.0000832209,0.00008530573,0.0000601435,0.0000049168343,0.000042681288,0.00007037406,0.0000043192144],"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.00016446212,0.000065187676,0.008895938,0.000007729877,0.00015414658,0.00000917783,0.000042493888,0.02548033,0.95832056,0.00023085084,0.00021736407,0.0064117503],"study_design_scores_gemma":[0.012003281,0.0063406434,0.25672472,0.000112864655,0.00043087505,0.0022629797,0.0006546877,0.011272424,0.40008828,0.04407986,0.26401073,0.0020186696],"about_ca_topic_score_codex":0.0000024953083,"about_ca_topic_score_gemma":0.0000030358713,"teacher_disagreement_score":0.5582323,"about_ca_system_score_codex":0.00004286344,"about_ca_system_score_gemma":0.00009254544,"threshold_uncertainty_score":0.35156348},"labels":[],"label_agreement":null},{"id":"W2171916652","doi":"10.1007/978-3-642-15294-8_9","title":"Listing All Sorting Reversals in Quadratic Time","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université du Québec à Montréal; University of Ottawa","funders":"","keywords":"Permutation (music); Computer science; Sorting; Listing (finance); Identity (music); Algorithm; Time complexity; Quadratic equation; Sorting algorithm; Theoretical computer science; Parallel computing; Mathematics","score_opus":0.013114758895020085,"score_gpt":0.24658099505152317,"score_spread":0.23346623615650308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171916652","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.036687557,0.0015744439,0.9464307,0.0007352492,0.001685443,0.0011757568,0.0000139850135,0.00006599207,0.011630863],"genre_scores_gemma":[0.506941,0.00014121452,0.48240435,0.0025939841,0.0026905884,0.000025253055,0.00016936808,0.0001787444,0.0048554367],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997969,0.000020849147,0.00037988654,0.00085666083,0.00032238985,0.00045122858],"domain_scores_gemma":[0.99898905,0.00006177176,0.0002128085,0.0005747147,0.00008314026,0.00007853701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075081654,0.00030516458,0.0002937789,0.00025767885,0.00007166608,0.00009708502,0.00073176797,0.00038985215,0.000042712636],"category_scores_gemma":[0.0002115968,0.00030276412,0.000074732954,0.00012826643,0.00028553512,0.0000081146045,0.00050563103,0.0005501863,0.000040050265],"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.000015228507,0.000043190706,0.0006532806,0.00010622973,0.00003424521,0.00010163836,0.0006011175,0.007650882,0.7484535,0.00010117155,0.00003448096,0.24220502],"study_design_scores_gemma":[0.0047831386,0.002382847,0.0027370276,0.0038334758,0.00018204907,0.00054023386,0.000004267898,0.3190017,0.4780804,0.116837494,0.0618899,0.009727443],"about_ca_topic_score_codex":0.000021200096,"about_ca_topic_score_gemma":0.00018303761,"teacher_disagreement_score":0.4702535,"about_ca_system_score_codex":0.00006275155,"about_ca_system_score_gemma":0.00020245269,"threshold_uncertainty_score":0.9999424},"labels":[],"label_agreement":null},{"id":"W2173266544","doi":"10.1007/978-3-642-01551-9_17","title":"Rearrangement Phylogeny of Genomes in Contig Form","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Contig; Genome; Phylogenetic tree; Phylogenetic network; Phylogenetics; DNA sequencing; Biology; Computational biology; Genetics; Computer science; Gene","score_opus":0.010978752870814238,"score_gpt":0.23249390881743448,"score_spread":0.22151515594662025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173266544","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.0713521,0.021842832,0.8727519,0.00066521694,0.0019393505,0.0029924165,0.00007458388,0.00005105319,0.028330568],"genre_scores_gemma":[0.9365297,0.0011013757,0.05971474,0.00063780247,0.00057074946,0.000013288626,0.00006773145,0.000050079525,0.0013145478],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99810505,0.000013866544,0.0003879989,0.00072989444,0.00037661233,0.00038657754],"domain_scores_gemma":[0.99899507,0.000019465446,0.0001810612,0.0006244325,0.00011625209,0.0000637379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004310013,0.0003031066,0.00036733338,0.00037498857,0.00003542588,0.00003086072,0.0007487896,0.00026137297,0.000023409508],"category_scores_gemma":[0.000022609333,0.0002902478,0.00010521526,0.00016108515,0.00031534728,0.000005813865,0.00032185874,0.00021428402,0.0000058347637],"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.000031018848,0.000060390223,0.0005667295,0.00006152309,0.00003155663,0.00002623042,0.00027664626,0.003886095,0.16874269,0.00018716606,0.000027888229,0.8261021],"study_design_scores_gemma":[0.010164026,0.008842629,0.047541298,0.0025626845,0.00019011549,0.00019598436,0.000008413853,0.029217517,0.5620808,0.15338387,0.17798965,0.007823015],"about_ca_topic_score_codex":0.000012860076,"about_ca_topic_score_gemma":0.00015388844,"teacher_disagreement_score":0.8651776,"about_ca_system_score_codex":0.00008589455,"about_ca_system_score_gemma":0.00017297111,"threshold_uncertainty_score":0.99995494},"labels":[],"label_agreement":null},{"id":"W2173358556","doi":"10.1186/1471-2164-16-s10-s8","title":"Syntenic block overlap multiplicities with a panel of reference genomes provide a signature of ancient polyploidization events","year":2015,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Synteny; Biology; Signature (topology); Genome; Block (permutation group theory); Genetics; Evolutionary biology; Computational biology; DNA microarray; Gene; Mathematics; Combinatorics","score_opus":0.03445907479753576,"score_gpt":0.23498496349477102,"score_spread":0.20052588869723525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173358556","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.99492216,0.0025792557,0.0017817293,0.000011432167,0.00004963788,0.000412796,0.000076338176,0.000008210862,0.0001584157],"genre_scores_gemma":[0.98967034,0.00013806803,0.009620033,0.000031380052,0.00005416918,0.000021654161,0.00011255741,0.000027920187,0.00032390718],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99899894,0.000040917945,0.00026849093,0.0002771253,0.00020855597,0.000205964],"domain_scores_gemma":[0.99899983,0.00000928181,0.00025235352,0.00036373158,0.00029107564,0.00008374263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015388867,0.00016233987,0.00020833622,0.000064312284,0.000022526596,0.0000065918002,0.00021892502,0.00012618743,0.0000025577042],"category_scores_gemma":[0.000052047333,0.00014193723,0.000055618173,0.00010862897,0.00006753404,0.00000487435,0.00012063879,0.00006092367,0.0000025717943],"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.00027175498,0.000112102294,0.023973705,0.00011609412,0.000082087565,6.043935e-7,0.00051067636,0.0033070138,0.9712291,0.000023730006,0.00009494204,0.0002782036],"study_design_scores_gemma":[0.003891121,0.0021201244,0.029103097,0.000097797194,0.00016971213,0.000032392156,0.004121094,0.0015716605,0.94787836,0.00010563045,0.01019538,0.000713619],"about_ca_topic_score_codex":0.00004081048,"about_ca_topic_score_gemma":0.00007786057,"teacher_disagreement_score":0.023350714,"about_ca_system_score_codex":0.000046245525,"about_ca_system_score_gemma":0.00034693946,"threshold_uncertainty_score":0.57880324},"labels":[],"label_agreement":null},{"id":"W2182787860","doi":"","title":"Phase transitions for the distance of random walks with applications to genome rearrangements","year":2006,"lang":"en","type":"other","venue":"OpenGrey (Institut de l'Information Scientifique et Technique)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Random walk; Coalescence (physics); Sketch; Visitor pattern; Combinatorics; Mathematics; Conjecture; Phase transition; Genealogy; Art history; Discrete mathematics; Physics; Computer science; Art; History; Quantum mechanics; Statistics; Algorithm","score_opus":0.013114375615084016,"score_gpt":0.27792789349460084,"score_spread":0.26481351787951685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182787860","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.000028027951,0.00016330658,0.8894057,0.0003672783,0.00007469961,0.017104266,0.0017149037,0.0000644139,0.09107736],"genre_scores_gemma":[0.019225016,0.0009959188,0.45506343,0.002574592,0.00075241225,0.10214466,0.024667064,0.0007461418,0.39383078],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862945,0.000044449305,0.00041794032,0.0003219888,0.00030111053,0.0002850387],"domain_scores_gemma":[0.9984498,0.000014797228,0.00033539656,0.0007697551,0.00034174288,0.00008851497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008867012,0.00026559806,0.00025216147,0.00027552774,0.00018969913,0.00012416497,0.0005815298,0.00020560336,0.00005808607],"category_scores_gemma":[0.000037319758,0.0002089532,0.00012582933,0.00037455116,0.00017285935,0.00003390387,0.00006944582,0.00011619901,0.000017409484],"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.0006733915,0.0007008879,0.000012615662,0.0016093907,0.00049064745,0.0000018593767,0.00074294413,0.0017909475,0.18521799,0.00404377,0.7479709,0.056744646],"study_design_scores_gemma":[0.0019494632,0.000119804994,0.000009579329,0.00015241561,0.00007169303,0.000004057508,0.000041793995,0.000070259586,0.016227273,0.000030369869,0.9810549,0.0002684011],"about_ca_topic_score_codex":0.00006602108,"about_ca_topic_score_gemma":0.0005624202,"teacher_disagreement_score":0.43434232,"about_ca_system_score_codex":0.00005400999,"about_ca_system_score_gemma":0.00022695842,"threshold_uncertainty_score":0.8520864},"labels":[],"label_agreement":null},{"id":"W2183793754","doi":"10.1016/j.dam.2016.02.005","title":"Greedy flipping of pancakes and burnt pancakes","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"McGill University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Stack (abstract data type); Greedy algorithm; Combinatorics; Conjecture; Algorithm; Computer science","score_opus":0.008942931205573162,"score_gpt":0.21994627724948979,"score_spread":0.21100334604391663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183793754","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.9512573,0.0004977591,0.042526018,0.00017670034,0.00003873419,0.0003439372,0.00003843488,0.000018625455,0.00510253],"genre_scores_gemma":[0.9756016,0.00033346016,0.02351234,0.000026710062,0.00010960305,0.000034094108,0.000016384869,0.000030101244,0.00033571283],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991781,0.000006676368,0.00024604754,0.00022595646,0.00014167419,0.00020152419],"domain_scores_gemma":[0.9994126,0.000020966594,0.00013340573,0.0003362519,0.000037835878,0.000058956808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013727334,0.00015311815,0.00020487489,0.00004500248,0.0000359033,0.000011073797,0.00013551356,0.000083137034,0.000016264985],"category_scores_gemma":[0.000029933542,0.00010364188,0.000050427596,0.000060928833,0.000122057434,0.0000027846509,0.00012503746,0.000028745742,0.000009701138],"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.00001040709,0.000029736804,0.00025083136,0.00013831524,0.000064065,5.265652e-7,0.00018976786,0.000001258575,0.9828201,0.0060961484,0.000077216515,0.010321637],"study_design_scores_gemma":[0.0022627618,0.0003198281,0.0033013506,0.00023343404,0.0001290937,0.000024414761,0.0013753249,0.00012043193,0.9603147,0.020639086,0.010488092,0.0007915116],"about_ca_topic_score_codex":0.0000012591554,"about_ca_topic_score_gemma":0.0000018854242,"teacher_disagreement_score":0.024344333,"about_ca_system_score_codex":0.000007923989,"about_ca_system_score_gemma":0.000022116692,"threshold_uncertainty_score":0.42263934},"labels":[],"label_agreement":null},{"id":"W2184313932","doi":"10.46298/dmtcs.2346","title":"Some simple varieties of trees arising in permutation analysis","year":2013,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Arity; Permutation (music); Tree (set theory); Philosophy","score_opus":0.008859976454495487,"score_gpt":0.2535330054201947,"score_spread":0.2446730289656992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184313932","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.49814793,0.0010009405,0.4990088,0.00059328834,0.00017955333,0.00033853084,0.000015623507,0.00000885822,0.00070646126],"genre_scores_gemma":[0.9128287,0.00008925878,0.0867627,0.000057435616,0.00012706347,0.000014682189,0.00003099023,0.000016928729,0.00007227517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975631,0.00012260396,0.0006321655,0.00056315464,0.00054690416,0.0005720345],"domain_scores_gemma":[0.99862576,0.00010850339,0.00021019192,0.0006270197,0.00026371292,0.00016483486],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010251022,0.00026189705,0.00045697385,0.00034348818,0.00012176263,0.00023394189,0.00070314837,0.00014798585,0.0002255951],"category_scores_gemma":[0.00014323262,0.00023756527,0.00021342681,0.0011957308,0.0030271662,0.00006042894,0.00051560224,0.00014282548,0.000028757231],"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.000007899311,0.00033695664,0.0014484978,0.00023905677,0.00024364004,0.0000038645585,0.003220595,0.004090326,0.03990327,0.9444295,0.000044225304,0.0060321675],"study_design_scores_gemma":[0.00025105858,0.00025874935,0.0041206866,0.000057832993,0.00021932046,0.000005149453,0.0005135554,0.65673697,0.011397251,0.32609624,0.0000328774,0.00031030818],"about_ca_topic_score_codex":0.000046509347,"about_ca_topic_score_gemma":0.000014584809,"teacher_disagreement_score":0.65264666,"about_ca_system_score_codex":0.000043047807,"about_ca_system_score_gemma":0.0000971573,"threshold_uncertainty_score":0.999686},"labels":[],"label_agreement":null},{"id":"W2219944153","doi":"","title":"Genome halving with an outgroup.","year":2007,"lang":"en","type":"article","venue":"PubMed","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"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 Ottawa","funders":"","keywords":"Genome; Sorghum; Ancestor; Biology; Event (particle physics); Genomics; Evolutionary biology; Reference genome; Genetics; Gene; History; Ecology","score_opus":0.012265331825541287,"score_gpt":0.20856244825861361,"score_spread":0.19629711643307232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219944153","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.984177,0.00036079666,0.0069075776,0.000051000196,0.00007427133,0.00038492307,0.0000033843983,0.000025248408,0.008015818],"genre_scores_gemma":[0.99615365,0.000017166758,0.0018148717,0.00012302298,0.0003387258,0.000131699,0.00006684888,0.000026114512,0.0013278812],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99907875,0.000014132437,0.00010644726,0.00026981285,0.00012040054,0.00041046066],"domain_scores_gemma":[0.9994691,0.0000029732958,0.000039074177,0.0002954543,0.00004077497,0.00015263684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003947006,0.00010640662,0.000076114484,0.000042822787,0.00004730074,0.000025077154,0.0001540567,0.00006447126,0.000012695263],"category_scores_gemma":[0.000014509043,0.00009255932,0.00002912303,0.000076073884,0.00003746081,0.000003985412,0.00004996426,0.000048867416,0.0000066476305],"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.00060774334,0.00043342914,0.08258169,0.00005432515,0.0004032301,0.00010290285,0.00030062205,0.00010970798,0.40028375,0.00013607857,0.00017263404,0.5148139],"study_design_scores_gemma":[0.00059358135,0.0001596896,0.94459647,0.0000010331754,0.000017682662,0.000024751893,0.00009974117,0.0000057153843,0.024478616,0.000020729518,0.029755387,0.0002466116],"about_ca_topic_score_codex":0.00000995793,"about_ca_topic_score_gemma":0.00006677045,"teacher_disagreement_score":0.8620148,"about_ca_system_score_codex":0.000016994238,"about_ca_system_score_gemma":0.00001015138,"threshold_uncertainty_score":0.37744597},"labels":[],"label_agreement":null},{"id":"W2235443461","doi":"10.1186/s12864-015-2294-6","title":"Locating rearrangement events in a phylogeny based on highly fragmented assemblies","year":2016,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":553,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Breakpoint; Genome; Biology; Phylogenetics; Phylogenetic tree; Evolutionary biology; Context (archaeology); Phylogenomics; Computational biology; Gene rearrangement; Genome evolution; Inference; Genomics; Genetics; Chromosome; Computer science; Paleontology; Gene; Artificial intelligence; Clade","score_opus":0.01656397032794648,"score_gpt":0.24130043227835782,"score_spread":0.22473646195041133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235443461","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.9879137,0.00015161629,0.010271503,0.00020888983,0.00016331344,0.00040686622,0.000022187105,0.000016803862,0.00084511994],"genre_scores_gemma":[0.99363154,0.000057420577,0.0050988467,0.00023784359,0.00016247907,0.000079057834,0.00005634345,0.000041907435,0.0006345765],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99864596,0.00008678677,0.00027338398,0.00045135166,0.00018015919,0.00036238044],"domain_scores_gemma":[0.9992514,0.000026109177,0.000102811275,0.00049632916,0.00004843591,0.0000748667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031401624,0.00020637471,0.00015688407,0.00012408251,0.000047561254,0.000010902276,0.00025353552,0.000116751195,0.000028854674],"category_scores_gemma":[0.00007562689,0.00016831605,0.000083605235,0.00010877812,0.000029377605,0.0000030875365,0.0001053863,0.00005433966,0.00008474586],"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.0001233919,0.00014064908,0.03942579,0.00002590393,0.000022877315,0.000001906812,0.000029895462,0.0008806924,0.9556909,0.000017610226,0.00021940394,0.0034209425],"study_design_scores_gemma":[0.009622421,0.0013299276,0.18287013,0.00020574653,0.000051706644,0.00000471287,0.00029044782,0.002990528,0.7624567,0.0002682867,0.038640454,0.0012689173],"about_ca_topic_score_codex":0.000019187542,"about_ca_topic_score_gemma":0.00014537206,"teacher_disagreement_score":0.19323424,"about_ca_system_score_codex":0.00013110535,"about_ca_system_score_gemma":0.000107332424,"threshold_uncertainty_score":0.68637294},"labels":[],"label_agreement":null},{"id":"W2248589095","doi":"10.1007/978-3-662-48221-6_18","title":"Models and Algorithms for Genome Rearrangement with Positional Constraints","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"McGill University","funders":"","keywords":"Computer science; Weighting; Generalization; Set (abstract data type); Binary number; Algorithm; Function (biology); Representation (politics); Combinatorics; Genome; Time complexity; Mathematics; Biology; Arithmetic","score_opus":0.030940958249045095,"score_gpt":0.2589133075014396,"score_spread":0.2279723492523945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248589095","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.000572168,0.0013560512,0.99521613,0.00020350916,0.00016418583,0.00067291316,0.000100022786,0.00001159396,0.0017034338],"genre_scores_gemma":[0.16098045,0.00026933735,0.83424914,0.000914763,0.001375361,0.00009116856,0.00057539786,0.00011353785,0.0014308197],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820435,0.000009798257,0.0001968442,0.0008482255,0.00040095884,0.00033983987],"domain_scores_gemma":[0.9990842,0.000024243893,0.00010438805,0.00035805107,0.0002930319,0.00013611095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042592463,0.000303896,0.00025256161,0.00016405935,0.00009481353,0.00008291935,0.00035602524,0.00019722008,0.000012391402],"category_scores_gemma":[0.000011247045,0.00026369528,0.000047688573,0.000059420363,0.0007723912,0.000010546496,0.00025367184,0.00014570271,0.0000021753717],"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.00031637208,0.00013919374,0.000071574694,0.0002723961,0.00037480937,0.000083211286,0.00074023573,0.12465966,0.049768053,0.0050632576,0.0002255457,0.8182857],"study_design_scores_gemma":[0.013884604,0.012420412,0.0007736962,0.0013073533,0.0004013901,0.0015608309,0.000009557777,0.42653802,0.013797817,0.45296776,0.068734296,0.0076042553],"about_ca_topic_score_codex":0.000003052287,"about_ca_topic_score_gemma":0.000016035168,"teacher_disagreement_score":0.81068146,"about_ca_system_score_codex":0.00007595213,"about_ca_system_score_gemma":0.00031081127,"threshold_uncertainty_score":0.9999815},"labels":[],"label_agreement":null},{"id":"W2289374179","doi":"","title":"On factorisations of cyclic permutations into transpositions","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.00587812331910578,"score_gpt":0.24369172887370713,"score_spread":0.23781360555460135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289374179","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.99662083,0.0000267577,0.00024677513,0.00017598933,0.00069439795,0.00014985856,0.000027079059,0.000013340047,0.0020449639],"genre_scores_gemma":[0.9989409,0.000012959187,0.0006167939,0.000032382377,0.000015585267,0.00003001433,0.00018174289,0.00001550206,0.0001541096],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943155,0.000021888696,0.00014484109,0.00017160301,0.00011329827,0.000116831005],"domain_scores_gemma":[0.99948233,0.00002123897,0.000048238304,0.0003023112,0.00008697289,0.00005892526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006141525,0.00009258356,0.000084069965,0.00005873473,0.00009586819,0.000009232672,0.00013961777,0.00009680752,0.00006739069],"category_scores_gemma":[0.000048766593,0.00009716599,0.00007391272,0.00010769807,0.000067306086,0.0000034269149,0.000017359856,0.00011072248,0.000025416883],"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.000007600848,0.00017601823,0.0015849519,0.0000071201052,0.000039401748,4.551427e-7,0.00024506057,0.000022457445,0.88105,0.116210096,0.00034553933,0.00031132984],"study_design_scores_gemma":[0.002082274,0.0008986319,0.059880055,0.00001676903,0.000091840986,0.0000066449115,0.00021827084,0.000067069814,0.6382672,0.2890557,0.008929339,0.0004862034],"about_ca_topic_score_codex":0.000022224884,"about_ca_topic_score_gemma":0.000040042785,"teacher_disagreement_score":0.24278276,"about_ca_system_score_codex":0.000007731775,"about_ca_system_score_gemma":0.0000408012,"threshold_uncertainty_score":0.39623138},"labels":[],"label_agreement":null},{"id":"W2289737386","doi":"10.1016/j.tcs.2006.09.011","title":"Preface","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Computer science; Philosophy","score_opus":0.003825225736326931,"score_gpt":0.21797820993581318,"score_spread":0.21415298419948625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289737386","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.6129356,0.00006737547,0.37293485,0.00019145648,0.00018424039,0.00010091768,0.0000015154508,0.00002512185,0.013558902],"genre_scores_gemma":[0.9740733,0.0000025706906,0.025376396,0.00011566934,0.000298317,0.0000030147603,0.0000049083396,0.00000608044,0.00011975798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99907905,0.000020739175,0.000090654765,0.0003248581,0.00021326158,0.00027143935],"domain_scores_gemma":[0.99954337,0.0000059911713,0.000017758657,0.00030422249,0.00006208427,0.00006658097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031963427,0.00007933192,0.000057497924,0.000032382413,0.000109430344,0.00005711673,0.0004207322,0.00003172396,0.000038852057],"category_scores_gemma":[0.000012107937,0.0000669745,0.000029911895,0.0001710978,0.0011508379,0.0000035282806,0.0002770745,0.000039188522,0.000055980112],"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.000013376275,0.00008014745,0.0007342894,0.0000050851945,0.000004734939,0.0000035562166,0.000019319416,0.00037732112,0.42443502,0.563682,0.0007518347,0.009893278],"study_design_scores_gemma":[0.0009771878,0.0009554908,0.025014587,0.000016611133,0.000016873155,0.000071759496,0.0000095227715,0.037611313,0.81887764,0.0930397,0.022606267,0.0008030689],"about_ca_topic_score_codex":0.0000023205234,"about_ca_topic_score_gemma":5.594235e-7,"teacher_disagreement_score":0.47064236,"about_ca_system_score_codex":0.000009250545,"about_ca_system_score_gemma":0.000033837263,"threshold_uncertainty_score":0.42403102},"labels":[],"label_agreement":null},{"id":"W2294802772","doi":"10.1007/978-3-642-21204-8_9","title":"An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Alberta","funders":"","keywords":"Substring; Approximation algorithm; Combinatorics; Algorithm; STRIPS; Sequence (biology); Set (abstract data type); Mathematics; Computer science; Discrete mathematics","score_opus":0.018308779091921582,"score_gpt":0.24182019847335337,"score_spread":0.2235114193814318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294802772","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.000087355584,0.00047559204,0.9968508,0.000117266834,0.00057003,0.0014073282,0.000097641525,0.000019288538,0.00037470512],"genre_scores_gemma":[0.010269832,0.00016602989,0.98610806,0.0007627331,0.0014068661,0.000126647,0.0006574119,0.00007777774,0.0004246476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805146,0.000020860334,0.0003253197,0.0009027386,0.00027201942,0.00042760544],"domain_scores_gemma":[0.99871886,0.000047878053,0.00021203603,0.0007646446,0.00018001217,0.00007658399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064002554,0.00034533342,0.00023069019,0.00014638917,0.000213586,0.00012878097,0.0010732833,0.00022875152,0.000027147411],"category_scores_gemma":[0.000011444778,0.000270443,0.00011816198,0.00008814982,0.0003237812,0.000019418123,0.0003334517,0.00022944447,0.000003629808],"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.000023178283,0.000033586635,0.00000779846,0.000025542107,0.000039546514,0.000001150508,0.000085352935,0.00096476864,0.007778725,0.00007087206,0.000036495705,0.990933],"study_design_scores_gemma":[0.0021127053,0.004415232,0.00023020242,0.00015617919,0.00013994788,0.00006245195,0.00000383758,0.833672,0.03911793,0.089289814,0.028967453,0.0018322837],"about_ca_topic_score_codex":0.00003269689,"about_ca_topic_score_gemma":0.00007306455,"teacher_disagreement_score":0.9891007,"about_ca_system_score_codex":0.00007577083,"about_ca_system_score_gemma":0.00021868871,"threshold_uncertainty_score":0.9999748},"labels":[],"label_agreement":null},{"id":"W2311756675","doi":"10.14288/1.0052159","title":"Variants of the Consecutive-Ones Property motivated by the reconstruction of ancestral species","year":2012,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Genome Rearrangement Algorithms","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 British Columbia","funders":"","keywords":"Property (philosophy); Evolutionary biology; Genealogy; Biology; Computer science; Artificial intelligence; History; Epistemology; Philosophy","score_opus":0.010378079868684052,"score_gpt":0.16583373967757836,"score_spread":0.1554556598088943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311756675","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.99795896,0.0003021078,0.00008796458,0.000058078454,0.00013068841,0.00019373177,0.0001827951,0.0000034492443,0.0010822375],"genre_scores_gemma":[0.9981551,0.00015532083,0.00014525907,0.0000070916417,0.000024499177,3.016235e-7,0.000014238437,0.0000050091853,0.0014931364],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9994631,0.00007142889,0.00009254268,0.00012593297,0.000112466245,0.00013452006],"domain_scores_gemma":[0.9994738,0.000007499334,0.00016054556,0.00020278875,0.00012643135,0.000028907505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012830393,0.000031627264,0.000119675584,0.000008320642,0.000091088594,0.000008058731,0.00023399563,0.00006798356,0.000045265264],"category_scores_gemma":[0.000024339397,0.000051579096,0.00007791313,0.00011541006,0.00055812096,0.000013725716,0.0001018375,0.00004940821,8.106533e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000253622,0.0001701795,0.2569789,0.00006491177,0.00016333356,8.7999825e-7,0.00023081082,0.0000031425525,0.6496567,0.0000016288172,0.0047926097,0.08791152],"study_design_scores_gemma":[0.00039858444,0.00005918762,0.9935942,0.000039143586,0.000030132172,0.00003930371,0.0013288603,0.000007399388,0.0036816965,0.0000133421545,0.0007413696,0.000066756416],"about_ca_topic_score_codex":0.007851265,"about_ca_topic_score_gemma":0.00510124,"teacher_disagreement_score":0.7366153,"about_ca_system_score_codex":0.000010182481,"about_ca_system_score_gemma":0.000040663675,"threshold_uncertainty_score":0.9987555},"labels":[],"label_agreement":null},{"id":"W2318890347","doi":"10.1109/tcbb.2016.2528239","title":"Algorithms and Complexity Results for Genome Mapping Problems","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo; Pacific Institute for the Mathematical Sciences","keywords":"Genome; Cardinality (data modeling); Combinatorics; Set (abstract data type); Mathematics; Time complexity; Biology; Genetics; Computational biology; Algorithm; Computer science; Gene; Data mining","score_opus":0.04400346907763863,"score_gpt":0.2755237657622126,"score_spread":0.23152029668457397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318890347","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.044138256,0.00013840273,0.9527168,0.0012410438,0.00016754513,0.00046031558,0.0010112901,0.00002556937,0.000100759484],"genre_scores_gemma":[0.6301075,0.00056178815,0.3676624,0.00046481934,0.00016015182,0.00009318572,0.0006209337,0.00001992469,0.00030928545],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990831,0.000028947403,0.0003448589,0.00025100194,0.00007078152,0.00022131705],"domain_scores_gemma":[0.9993953,0.00012853746,0.00010773326,0.00017344847,0.00011311891,0.00008182152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023317173,0.00016767526,0.00015409422,0.00010153211,0.0002372263,0.000022020111,0.000117946605,0.00015437878,0.000005052077],"category_scores_gemma":[0.000028987373,0.00012312482,0.00005576776,0.00006471999,0.00026663832,0.000013084351,0.000013555499,0.00006036852,0.000007845501],"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.0011388701,0.0005466433,0.0007449233,0.00058044423,0.0015044329,0.0000018907858,0.0017093491,0.008302427,0.13556787,0.0017617341,0.000881075,0.84726036],"study_design_scores_gemma":[0.06456896,0.019789917,0.05317297,0.0007312497,0.00073263334,0.0010088698,0.0023258375,0.24547833,0.048208635,0.1994623,0.3572798,0.0072404696],"about_ca_topic_score_codex":0.0000027779583,"about_ca_topic_score_gemma":0.0000062276126,"teacher_disagreement_score":0.8400199,"about_ca_system_score_codex":0.000013248525,"about_ca_system_score_gemma":0.000036142814,"threshold_uncertainty_score":0.5020884},"labels":[],"label_agreement":null},{"id":"W2366192345","doi":"10.1089/cmb.2010.0121","title":"A Statistically Fair Comparison of Ancestral Genome Reconstructions, Based on Breakpoint and Rearrangement Distances","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","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 Ottawa","funders":"","keywords":"Breakpoint; Genome; Evolutionary biology; Biology; Algorithm; Mathematics; Computer science; Computational biology; Genetics; Chromosome; Gene","score_opus":0.010238726149141007,"score_gpt":0.2954890485433716,"score_spread":0.2852503223942306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2366192345","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.94328105,0.00022113278,0.055388927,0.0004222047,0.00029423131,0.000088384666,0.00008080539,0.0000023232749,0.00022094573],"genre_scores_gemma":[0.9315124,0.000024096958,0.068162955,0.00005940111,0.00015311278,0.0000020235188,0.00007211259,0.0000059333465,0.000007945538],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99911606,0.000062921405,0.00043775645,0.00014127039,0.00012781534,0.00011417902],"domain_scores_gemma":[0.9991565,0.0000757541,0.00036806113,0.00008412281,0.00024593883,0.00006963286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024963892,0.000097711614,0.00021683075,0.00009524835,0.00004051122,0.000010365502,0.00011034676,0.00007702359,0.00003687468],"category_scores_gemma":[0.00007188073,0.00008250899,0.00006084562,0.00005046623,0.00022703892,0.000004141817,0.000021545775,0.0001464424,0.0000013542102],"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.00094793027,0.00058452506,0.08747565,0.000080670354,0.00033498093,0.000008049854,0.00012266202,0.019884946,0.8357921,0.0051937,0.0005856817,0.048989087],"study_design_scores_gemma":[0.008377523,0.014638894,0.84172577,0.00011286607,0.0002101909,0.00055646774,0.000555617,0.018509591,0.025500601,0.03902843,0.04980779,0.0009762567],"about_ca_topic_score_codex":0.0000024054968,"about_ca_topic_score_gemma":0.000011470372,"teacher_disagreement_score":0.8102915,"about_ca_system_score_codex":0.00000898324,"about_ca_system_score_gemma":0.0001088822,"threshold_uncertainty_score":0.33646187},"labels":[],"label_agreement":null},{"id":"W2369729543","doi":"10.1089/cmb.2010.0092","title":"Yeast Ancestral Genome Reconstructions: The Possibilities of Computational Methods II","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":39,"is_retracted":false,"has_abstract":true,"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; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Genome; Yeast; Biology; Computational biology; Evolutionary biology; Genetics; Gene","score_opus":0.017120286307819903,"score_gpt":0.3258122984228377,"score_spread":0.3086920121150178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2369729543","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.9531656,0.0004526774,0.04483038,0.0005229912,0.0006832316,0.00008747362,0.000058389225,0.0000027377587,0.0001965377],"genre_scores_gemma":[0.77908224,0.000022956652,0.22025797,0.00007770301,0.00041805924,0.000002260345,0.0000725726,0.000006851925,0.000059365946],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989531,0.00016070205,0.0005013099,0.00013227512,0.00012231091,0.00013030179],"domain_scores_gemma":[0.9987287,0.00011122728,0.0004602667,0.00011337172,0.0005375447,0.000048910708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667657,0.000102897735,0.00018972144,0.000095311116,0.000108327564,0.000011111474,0.00025731858,0.00010319568,0.00008317684],"category_scores_gemma":[0.00012748338,0.00007420869,0.00014764689,0.00009451482,0.00040060174,0.00000811241,0.00007139796,0.00020507321,0.0000024370638],"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.00017803638,0.00020063456,0.0053014606,0.000024105742,0.00056099927,0.0000017098155,0.00035592995,0.059038647,0.897699,0.008680503,0.00047947475,0.027479518],"study_design_scores_gemma":[0.005239018,0.005342685,0.28992757,0.000047370853,0.00022901426,0.0042090635,0.0014808704,0.004848118,0.050943125,0.5505681,0.086180225,0.000984806],"about_ca_topic_score_codex":0.0000034828738,"about_ca_topic_score_gemma":0.000003123155,"teacher_disagreement_score":0.84675586,"about_ca_system_score_codex":0.000009520005,"about_ca_system_score_gemma":0.00024641285,"threshold_uncertainty_score":0.30261427},"labels":[],"label_agreement":null},{"id":"W2371739233","doi":"10.5539/jmr.v9n3p75","title":"A Note on the Structure of Roller Coaster Permutations","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Roller coaster; Permutation (music); Mathematics; Combinatorics; Class (philosophy); Parity of a permutation; Discrete mathematics; Cyclic permutation; Computer science; Symmetric group; Artificial intelligence; Physics","score_opus":0.08276545519588571,"score_gpt":0.40399260830792855,"score_spread":0.32122715311204286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2371739233","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.9950089,0.00009579983,0.00088745763,0.0019737976,0.0000715621,0.00015628163,0.000013118808,5.2037905e-7,0.0017925862],"genre_scores_gemma":[0.99613607,0.00006563809,0.0026667204,0.000018288038,0.00018285372,0.0000010384693,0.0000012045961,0.000012074827,0.0009161263],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988807,0.00008162675,0.00024802258,0.00007004871,0.00057161314,0.00014799861],"domain_scores_gemma":[0.9984879,0.00009991066,0.00030429146,0.0005065344,0.00055469474,0.000046708334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010215006,0.00006479886,0.00013018184,0.00008076568,0.00020496464,0.000069233894,0.0006028895,0.000064585605,0.00009429973],"category_scores_gemma":[0.00091474707,0.000037344216,0.00009065559,0.000035808676,0.00016155698,0.0000044233307,0.00014940093,0.0002528326,0.000008686846],"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.000060878683,0.00019464517,0.00039461788,0.000088008775,0.00016757891,0.000008930238,0.0011197685,0.00010073397,0.99065214,0.0011623929,0.004875042,0.0011752408],"study_design_scores_gemma":[0.0025667408,0.0023588352,0.0090728225,0.00038671502,0.00008248972,0.00020004311,0.0034410753,0.001575752,0.94033045,0.025359664,0.014323483,0.00030195623],"about_ca_topic_score_codex":0.000002279575,"about_ca_topic_score_gemma":0.000008568271,"teacher_disagreement_score":0.05032174,"about_ca_system_score_codex":0.000013222401,"about_ca_system_score_gemma":0.00009863965,"threshold_uncertainty_score":0.1576443},"labels":[],"label_agreement":null},{"id":"W2385435022","doi":"10.1089/cmb.2011.0087","title":"Genome Aliquoting Revisited","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"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 Ottawa","funders":"","keywords":"Genome; Breakpoint; Polyploid; Approximation algorithm; Ancestor; Combinatorics; Mathematics; Biology; Computer science; Algorithm; Genetics; Gene; Chromosome","score_opus":0.02241927681391968,"score_gpt":0.2626114851712909,"score_spread":0.24019220835737123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2385435022","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.9485713,0.0012312426,0.047784556,0.00010723335,0.00020266863,0.00007036035,0.000008490972,0.000004372183,0.002019738],"genre_scores_gemma":[0.9680806,0.00006153277,0.031188495,0.00019102465,0.0003580011,8.120528e-7,0.000055495762,0.000009012933,0.000055044966],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9992966,0.00007311178,0.00032313698,0.000106497544,0.00007581787,0.00012483964],"domain_scores_gemma":[0.9992823,0.000015319978,0.00028239845,0.00007384205,0.00028955034,0.000056575132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002942559,0.000080201695,0.0001383471,0.000088678564,0.000031066644,0.000005331602,0.00016856677,0.00007405424,0.00009067058],"category_scores_gemma":[0.000043068198,0.000068855865,0.00009509841,0.00006529511,0.000048739937,0.0000033079807,0.00004904136,0.00007465699,0.000014832392],"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.00038685935,0.00027649399,0.03600427,0.00003321638,0.0009915481,0.00004430107,0.0004538218,0.0024369746,0.9469806,0.003247686,0.0007976466,0.008346579],"study_design_scores_gemma":[0.0065134694,0.008523244,0.7010957,0.00008225476,0.0003021989,0.0027528193,0.00035823902,0.0007420756,0.050602127,0.07451977,0.1531727,0.0013353727],"about_ca_topic_score_codex":0.000001087633,"about_ca_topic_score_gemma":2.5023732e-7,"teacher_disagreement_score":0.89637846,"about_ca_system_score_codex":0.000010243046,"about_ca_system_score_gemma":0.000060399132,"threshold_uncertainty_score":0.28078607},"labels":[],"label_agreement":null},{"id":"W2397772671","doi":"","title":"Genus Distributions For Double Pearl-Ladder Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pearl; Mathematics; Genus; Combinatorics; Zoology; Biology; Geography; Archaeology","score_opus":0.02311697636307435,"score_gpt":0.24479139443601777,"score_spread":0.2216744180729434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397772671","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.9889145,0.00062025705,0.0010354625,0.00008264374,0.0012828469,0.0005928049,0.000079702666,0.000039100352,0.007352678],"genre_scores_gemma":[0.9966875,0.000045484776,0.0014267571,0.00003909509,0.000023688368,0.000151173,0.00032604468,0.000026805896,0.0012735081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916714,0.00001629944,0.00014610233,0.00028546219,0.0000888193,0.00029619405],"domain_scores_gemma":[0.99936223,0.000005163555,0.000052867912,0.00036531469,0.00012251023,0.000091890535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012397165,0.00013620536,0.00010976472,0.000032935703,0.000121761346,0.000017225604,0.00021532018,0.00011313989,0.00006117565],"category_scores_gemma":[0.000018981182,0.00014021965,0.00012249078,0.000096893236,0.00005826262,0.0000041978606,0.00008452407,0.000054432927,0.000036038113],"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.0005468165,0.0012752604,0.01677167,0.000091210684,0.0008068626,0.000012975317,0.0006450946,0.0000026788537,0.16745183,0.73628116,0.07180247,0.004312014],"study_design_scores_gemma":[0.010813267,0.0017780684,0.02212625,0.000019535115,0.00023633213,0.000027325179,0.00029244708,0.00004131261,0.38230866,0.29897237,0.2821046,0.00127984],"about_ca_topic_score_codex":0.000030936557,"about_ca_topic_score_gemma":0.0000074223044,"teacher_disagreement_score":0.43730876,"about_ca_system_score_codex":0.000013330426,"about_ca_system_score_gemma":0.000037330214,"threshold_uncertainty_score":0.57179916},"labels":[],"label_agreement":null},{"id":"W2405206615","doi":"10.1186/s13015-016-0065-9","title":"Models and algorithms for genome rearrangement with positional constraints","year":2016,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Generalization; Weighting; Set (abstract data type); Computer science; Function (biology); Polynomial; Binary number; Representation (politics); Algorithm; Time complexity; Combinatorics; Simple (philosophy); Mathematics; Biology","score_opus":0.020969453984812,"score_gpt":0.27897863154934466,"score_spread":0.2580091775645327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405206615","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.056543488,0.001183028,0.93793404,0.0010560687,0.00015335488,0.0017156968,0.001140681,0.000035370806,0.00023826485],"genre_scores_gemma":[0.6040577,0.0006054549,0.3876633,0.0011310172,0.00074203557,0.002175168,0.0024294888,0.00020982692,0.0009859342],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977945,0.000067694695,0.00033865092,0.0009616715,0.00014599063,0.000691499],"domain_scores_gemma":[0.9988543,0.000060779148,0.00014625282,0.00042734656,0.00031532825,0.00019598776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036806145,0.00038845662,0.00035893166,0.00011741956,0.00015900569,0.000028914224,0.00026524538,0.0002885809,0.0000241996],"category_scores_gemma":[0.000045190456,0.0002829697,0.0001739227,0.00007880978,0.0005178722,0.0000124067265,0.00013378265,0.000058353875,0.000004733683],"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.00027865975,0.000088238645,0.0000933875,0.000037138172,0.00051690015,0.0000063508814,0.00002574646,0.00003377543,0.94604164,0.0053331093,0.00016118433,0.047383837],"study_design_scores_gemma":[0.046811957,0.025253052,0.0022144772,0.00024284764,0.0010828464,0.001070471,0.00039035245,0.0056876424,0.6014639,0.09060687,0.21957687,0.005598721],"about_ca_topic_score_codex":0.0000068967884,"about_ca_topic_score_gemma":0.000005654251,"teacher_disagreement_score":0.55027074,"about_ca_system_score_codex":0.00004019689,"about_ca_system_score_gemma":0.0001048484,"threshold_uncertainty_score":0.9999623},"labels":[],"label_agreement":null},{"id":"W2430030760","doi":"10.1007/978-1-61779-582-4_15","title":"Analysis of Gene Order Evolution Beyond Single-Copy Genes","year":2012,"lang":"en","type":"review","venue":"Methods in molecular biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"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 Ottawa; Université de Montréal","funders":"","keywords":"Genome; Gene duplication; Synteny; Comparative genomics; Biology; Gene; Genetics; Segmental duplication; Genomics; Genome evolution; Tandem exon duplication; Gene family; Computational biology; Evolutionary biology","score_opus":0.051685950103184435,"score_gpt":0.4084582904954483,"score_spread":0.35677234039226385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2430030760","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004293072,0.56902,0.43009484,0.000002848133,0.0002195531,0.0003384276,0.00006308423,0.0000066547536,0.00021169898],"genre_scores_gemma":[0.000009129666,0.56952345,0.42875016,0.000019652158,0.00010752458,0.00009950284,0.001350685,0.000058443984,0.00008142816],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99467623,0.0025751202,0.0010530824,0.0009239944,0.00013940704,0.0006321514],"domain_scores_gemma":[0.9978687,0.00008816289,0.00064822804,0.001113932,0.00017530096,0.00010566693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017192427,0.0005969448,0.0022539806,0.0011565732,0.000032198033,0.0000100143925,0.00062369194,0.0012361911,0.00007265467],"category_scores_gemma":[0.00024109418,0.0005465115,0.0010050678,0.001958669,0.00022119095,0.0000026376313,0.00032938988,0.00026504364,0.000008233561],"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.000008807263,0.0001486215,0.00034477486,0.0007841344,0.0031931992,0.000004227594,0.000012350192,0.000039772825,0.27493462,0.00013670597,0.000004152922,0.72038865],"study_design_scores_gemma":[0.0003422339,0.00032286608,0.000035999972,0.00015936863,0.010191867,0.000024994739,0.000013256911,0.000042081632,0.029104847,0.00019724277,0.9586342,0.00093102903],"about_ca_topic_score_codex":0.000035756148,"about_ca_topic_score_gemma":0.00002177713,"teacher_disagreement_score":0.9586301,"about_ca_system_score_codex":0.00011221031,"about_ca_system_score_gemma":0.00017379751,"threshold_uncertainty_score":0.99969864},"labels":[],"label_agreement":null},{"id":"W2464694747","doi":"10.1007/978-3-319-43681-4_9","title":"The Gene Family-Free Median of Three","year":2016,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Breakpoint; Adjacency list; Computational biology; Gene family; Gene; Similarity (geometry); Comparative genomics; Genetics; Graph; Gene prediction; Sequence (biology); Extant taxon; Biology; Genomics; Combinatorics; Computer science; Mathematics; Artificial intelligence; Evolutionary biology","score_opus":0.013326989472017992,"score_gpt":0.24279449548607634,"score_spread":0.22946750601405835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464694747","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.14520027,0.0015479712,0.8505817,0.0009680425,0.0013684176,0.0002659526,0.00001795217,0.000008160019,0.000041557945],"genre_scores_gemma":[0.90112966,0.00028076,0.0976226,0.00018721588,0.00072711584,0.000022147051,0.000010224888,0.000017504244,0.000002772244],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981618,0.000043765875,0.00027387126,0.0006939919,0.00042585545,0.0004007267],"domain_scores_gemma":[0.99786854,0.00007395148,0.00016578163,0.0016532867,0.00016929608,0.00006915834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006876203,0.00022187228,0.0002004936,0.00010403981,0.00010552095,0.0000714036,0.0026195222,0.00021624444,0.0000019220902],"category_scores_gemma":[0.0001889933,0.00013909105,0.0000949053,0.00022094499,0.00076070946,0.0000030163656,0.003422504,0.00022499035,0.0000029064183],"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.00001654698,0.000029955436,0.004062342,0.00003619385,0.000038545433,0.000005145267,0.00011803391,0.004508166,0.43967193,0.00002228557,0.00007027325,0.55142057],"study_design_scores_gemma":[0.0009871217,0.0003782191,0.023924774,0.00022182016,0.000023863919,0.000014078883,0.0000012571273,0.025496367,0.82566965,0.12078018,0.0016586141,0.0008440386],"about_ca_topic_score_codex":0.00003196671,"about_ca_topic_score_gemma":0.00024165671,"teacher_disagreement_score":0.7559294,"about_ca_system_score_codex":0.000039972645,"about_ca_system_score_gemma":0.00035084528,"threshold_uncertainty_score":0.56719685},"labels":[],"label_agreement":null},{"id":"W2474345237","doi":"10.1186/s12859-016-1142-2","title":"A De-Novo Genome Analysis Pipeline (DeNoGAP) for large-scale comparative prokaryotic genomics studies","year":2016,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational biology; Genomics; Genome; DNA microarray; Comparative genomics; Biology; Pipeline (software); Genetics; Computer science; Gene; Gene expression","score_opus":0.03974294721149125,"score_gpt":0.30524999874263525,"score_spread":0.265507051531144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474345237","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.19661567,0.001034703,0.8005386,0.00010060218,0.0000951801,0.0007834665,0.0003922236,0.000029613686,0.0004099541],"genre_scores_gemma":[0.30778104,0.0009870029,0.68204284,0.0005227225,0.00066096924,0.00035344355,0.0008378835,0.00007116284,0.0067428956],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985268,0.00003496538,0.0005189517,0.00025086667,0.00015476298,0.00051364664],"domain_scores_gemma":[0.99882025,0.000053314954,0.00023620269,0.0004793057,0.00028954993,0.00012140176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047252927,0.00025433133,0.0004191554,0.00016057295,0.00013660571,0.00003981081,0.00029198077,0.00013464304,0.000022385055],"category_scores_gemma":[0.00009307109,0.00018203106,0.00027375066,0.00024706457,0.00009142423,0.000014601451,0.0001951909,0.000046488236,0.00005597892],"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.0035669787,0.0032963527,0.108848214,0.006518138,0.04175349,0.000018522538,0.08640235,0.031178715,0.6588272,0.00223563,0.034622688,0.022731757],"study_design_scores_gemma":[0.019150965,0.0030119577,0.017245438,0.00016000065,0.006620999,0.000095550524,0.03599751,0.42413425,0.07831462,0.0012577787,0.40985957,0.004151358],"about_ca_topic_score_codex":8.629342e-7,"about_ca_topic_score_gemma":0.000109715416,"teacher_disagreement_score":0.5805125,"about_ca_system_score_codex":0.00010175983,"about_ca_system_score_gemma":0.00013023663,"threshold_uncertainty_score":0.7423011},"labels":[],"label_agreement":null},{"id":"W2508423234","doi":"10.1093/bioinformatics/btw467","title":"A program for verification of phylogenetic network models","year":2016,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Phylogenetic tree; Computer science; Phylogenetic network; Biology; Genetics; Gene","score_opus":0.018765223702526555,"score_gpt":0.2517337533348999,"score_spread":0.23296852963237333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508423234","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.2526697,0.0006846046,0.74068403,0.0001586669,0.00025024926,0.0021973148,0.000110521796,0.000047962356,0.003196944],"genre_scores_gemma":[0.725163,0.00028877106,0.2735422,0.000047592293,0.0002055194,0.00022293844,0.00011554695,0.00002074305,0.00039372066],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941665,0.0000071076597,0.00023583339,0.00008489475,0.000079047895,0.00017647947],"domain_scores_gemma":[0.9994756,0.000008084149,0.00012320271,0.00025930404,0.000098228506,0.00003557199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012476883,0.0000810026,0.00008821221,0.000019955336,0.00002554018,0.0000068338486,0.00012672479,0.000073832525,0.0000040255113],"category_scores_gemma":[0.000020996438,0.000057804293,0.00006202833,0.00005166616,0.0000427133,0.000004563363,0.00003607839,0.000010355188,0.0000053536196],"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.00013990926,0.00018698147,0.0009224625,0.00034176107,0.00019038195,9.9729114e-8,0.00020112436,0.0021390351,0.26676118,0.0018637285,0.009002742,0.7182506],"study_design_scores_gemma":[0.007813994,0.005751349,0.0054803314,0.0002548408,0.00023210583,0.000016488028,0.00030317478,0.14712925,0.42274964,0.009210731,0.39957023,0.0014878939],"about_ca_topic_score_codex":4.3573593e-7,"about_ca_topic_score_gemma":9.191637e-7,"teacher_disagreement_score":0.7167627,"about_ca_system_score_codex":0.000007182464,"about_ca_system_score_gemma":0.000032853273,"threshold_uncertainty_score":0.23571907},"labels":[],"label_agreement":null},{"id":"W2520464109","doi":"10.1093/bioinformatics/btw597","title":"BOSS: a novel scaffolding algorithm based on an optimized scaffold graph","year":2016,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":39,"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":"National Outstanding Youth Science Fund Project of National Natural Science Foundation of China; National Natural Science Foundation of China","keywords":"Boss; Scaffold; Computer science; Contig; Algorithm; Graph; Theoretical computer science; Genome; Database; Engineering; Biology","score_opus":0.014237031693811538,"score_gpt":0.2406790377023678,"score_spread":0.22644200600855624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520464109","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.075816534,0.00008942605,0.9179114,0.0003307593,0.00044482286,0.00068919687,0.00023522053,0.00012868496,0.0043539153],"genre_scores_gemma":[0.17942503,0.00016293791,0.8172947,0.0012690912,0.00048064627,0.00008517815,0.00034559474,0.0000958216,0.00084098254],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856496,0.000026389604,0.00038220076,0.0002704384,0.0003187491,0.0004372742],"domain_scores_gemma":[0.99882406,0.00002216652,0.00016272081,0.000689161,0.00010342141,0.00019845915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035151103,0.00027364917,0.0002026338,0.00016437931,0.00011333894,0.00006614591,0.00035527782,0.00018545332,0.000056463185],"category_scores_gemma":[0.000055315257,0.00019604152,0.00014671155,0.0001556295,0.00008493907,0.000023781644,0.00009051754,0.00004701662,0.00008506131],"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.00042106595,0.0011153818,0.0006939019,0.00017062995,0.0003438146,0.000009639845,0.00033079795,0.0025200648,0.54049563,0.0003613061,0.0075224475,0.44601533],"study_design_scores_gemma":[0.024931394,0.005011867,0.0017241708,0.00049641426,0.00020587283,0.00006653381,0.0007416149,0.49538234,0.37281114,0.00020274929,0.09521796,0.003207958],"about_ca_topic_score_codex":0.0000036691151,"about_ca_topic_score_gemma":0.0000015919675,"teacher_disagreement_score":0.49286225,"about_ca_system_score_codex":0.00003617818,"about_ca_system_score_gemma":0.00008028825,"threshold_uncertainty_score":0.7994341},"labels":[],"label_agreement":null},{"id":"W2545557069","doi":"10.1109/iembs.2004.1403797","title":"Globally optimal classification and pairing of human chromosomes","year":2005,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Pairing; Chromosome; Heuristic; Graph; Computer science; Algorithm; Matching (statistics); Mathematics; Time complexity; Theoretical computer science; Artificial intelligence; Biology; Gene; Genetics","score_opus":0.015292125115704347,"score_gpt":0.26280959448326047,"score_spread":0.24751746936755611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545557069","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.9924496,0.00036738484,0.00070938066,0.0001686304,0.000010519126,0.00006876642,0.0000021940803,0.0000075838784,0.0062159603],"genre_scores_gemma":[0.99223906,0.00006979471,0.006709666,0.000034310797,0.0000915853,0.0000036023605,0.000025119933,0.0000057313623,0.0008211353],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961144,0.000008946128,0.00010015845,0.00013475171,0.000061588165,0.00008313563],"domain_scores_gemma":[0.9997823,0.0000012872122,0.000034196702,0.0001251775,0.000029456727,0.000027538976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000070649556,0.0000549009,0.00005596938,0.000016077445,0.000024771512,0.000008348278,0.00006759914,0.000044103777,0.000036841004],"category_scores_gemma":[0.0000052709097,0.000051787007,0.000021425867,0.000024528426,0.000036966114,0.000002060929,0.000052081923,0.000016381133,0.000003972517],"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.0000031831237,0.00002385839,0.004860015,0.000007950853,0.000017731774,1.022174e-7,0.000017678385,0.000017460081,0.9874227,0.00030390394,0.00030444193,0.0070209634],"study_design_scores_gemma":[0.00082809,0.0003990046,0.129602,0.000009968229,0.000023324941,0.000009442356,0.00021090092,0.0008420381,0.8386869,0.00003499758,0.029115422,0.00023792624],"about_ca_topic_score_codex":0.0000045460033,"about_ca_topic_score_gemma":0.000012578935,"teacher_disagreement_score":0.14873582,"about_ca_system_score_codex":0.000005709949,"about_ca_system_score_gemma":0.000008644674,"threshold_uncertainty_score":0.21118128},"labels":[],"label_agreement":null},{"id":"W2562995081","doi":"10.1186/s12859-016-1340-y","title":"Compromise or optimize? The breakpoint anti-median","year":2016,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Compromise; Phylogenetic tree; Generality; Biology; Adjacency list; Computational biology; Computer science; Data mining; Mathematics; Algorithm; Genetics; Gene","score_opus":0.020010118488466774,"score_gpt":0.2385707755167301,"score_spread":0.21856065702826333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562995081","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.31226182,0.00047374563,0.66673064,0.0043417863,0.0012922849,0.0022444152,0.0002612306,0.00015992003,0.012234133],"genre_scores_gemma":[0.3700041,0.0016774379,0.6083492,0.0021105723,0.001363159,0.00017203591,0.00026539588,0.00012999156,0.015928118],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990479,0.000029013092,0.00031411773,0.0001367841,0.00017400684,0.00029820387],"domain_scores_gemma":[0.9991205,0.00003517389,0.00012427448,0.0005643858,0.000059573504,0.00009610613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024859075,0.00016536089,0.00013737618,0.000033876808,0.00009671807,0.000041741194,0.00036650532,0.000106545696,0.00011947897],"category_scores_gemma":[0.00009932909,0.000075562886,0.000093933355,0.000079089,0.00014255126,0.0000088042125,0.00018552384,0.000050742427,0.0002739503],"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.0015981308,0.00094867987,0.032868575,0.0013309099,0.0013851383,0.000033542594,0.003912799,0.0025287275,0.30948022,0.00077796925,0.2482603,0.396875],"study_design_scores_gemma":[0.015927602,0.001921635,0.024217958,0.0003142274,0.00026115243,0.00050205336,0.0030769203,0.09601589,0.13554332,0.0003193346,0.719231,0.0026689102],"about_ca_topic_score_codex":0.0000032988569,"about_ca_topic_score_gemma":0.000017535016,"teacher_disagreement_score":0.4709707,"about_ca_system_score_codex":0.000016022823,"about_ca_system_score_gemma":0.00009010013,"threshold_uncertainty_score":0.35211685},"labels":[],"label_agreement":null},{"id":"W2572198690","doi":"","title":"Cayley Graphs Isomorphic To The Product Of Two Cayley Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Combinatorics; Vertex-transitive graph; Cayley's theorem; Graph product; Indifference graph; Chordal graph; Discrete mathematics; 1-planar graph; Graph; Line graph; Voltage graph","score_opus":0.009701600424847185,"score_gpt":0.23588011871223694,"score_spread":0.22617851828738975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572198690","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.9952423,0.00077762856,0.00003124232,0.0015026839,0.0012624147,0.0005000001,0.000038141137,0.000018422019,0.00062718056],"genre_scores_gemma":[0.998646,0.0001653293,0.00014766504,0.00014995829,0.000029974542,0.00006307478,0.000023466122,0.000026171108,0.0007483286],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986181,0.000095663636,0.0002523359,0.0004489704,0.00024433105,0.00034059907],"domain_scores_gemma":[0.9986535,0.00001760176,0.00010771517,0.0009194402,0.00019170027,0.00011004875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037640124,0.00019642287,0.000191553,0.00007874138,0.00008172416,0.000014117615,0.0005055054,0.00006699841,0.000038840302],"category_scores_gemma":[0.00010582107,0.00012348103,0.00012789699,0.0002887686,0.000120904384,0.000004826665,0.00020351815,0.00006891062,0.00008149292],"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.000056730267,0.0001585634,0.020833462,0.000020611113,0.00017583279,0.0000039262472,0.00012855894,0.0000050384174,0.9250435,0.0301357,0.019001702,0.004436326],"study_design_scores_gemma":[0.003010143,0.0008646588,0.016563134,0.000055585417,0.00008453417,0.000020422964,0.000065168824,0.0000024185579,0.84808296,0.06497161,0.06567891,0.00060042465],"about_ca_topic_score_codex":0.00007302618,"about_ca_topic_score_gemma":0.000042687676,"teacher_disagreement_score":0.076960556,"about_ca_system_score_codex":0.000015127619,"about_ca_system_score_gemma":0.000059530328,"threshold_uncertainty_score":0.503541},"labels":[],"label_agreement":null},{"id":"W2581995084","doi":"10.1007/978-3-319-29516-9","title":"Combinatorial Algorithms","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"McMaster University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.008256833814438739,"score_gpt":0.2373441480858435,"score_spread":0.22908731427140477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581995084","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.00042411932,0.0008039025,0.9882112,0.00020262257,0.0046354276,0.00038033267,0.000022366336,0.00002851919,0.0052915104],"genre_scores_gemma":[0.32171026,0.0020300332,0.5293133,0.0068448726,0.07617559,0.00029156348,0.001146844,0.0009465477,0.061540943],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975598,0.00003554941,0.00026839858,0.0010541603,0.00053116103,0.00055096764],"domain_scores_gemma":[0.99872196,0.00004532834,0.0001343385,0.00081298465,0.00016244371,0.00012297663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046672625,0.00035989127,0.00029474436,0.00023725153,0.00010395831,0.000096849595,0.0011656446,0.0004124648,0.000027350616],"category_scores_gemma":[0.00007504845,0.00029571127,0.0001095457,0.00021399479,0.0005494118,0.000007010528,0.00071667065,0.0002693111,0.000058995687],"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.000032588803,0.00008843305,0.00018949079,0.00006274351,0.000060947063,0.00005545996,0.00012062029,0.0008649409,0.03029007,0.00036427507,0.0019824132,0.965888],"study_design_scores_gemma":[0.0065590674,0.0031651063,0.00063008827,0.0010322398,0.00008788815,0.00022547103,5.383276e-7,0.012491384,0.17454535,0.26659444,0.52956194,0.0051064836],"about_ca_topic_score_codex":0.0000036062875,"about_ca_topic_score_gemma":0.000008691131,"teacher_disagreement_score":0.9607815,"about_ca_system_score_codex":0.00017788468,"about_ca_system_score_gemma":0.00083672104,"threshold_uncertainty_score":0.9999495},"labels":[],"label_agreement":null},{"id":"W2592818772","doi":"10.1186/s13015-017-0096-x","title":"Approximating the correction of weighted and unweighted orthology and paralogy relations","year":2017,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"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 Montréal; University of Ottawa","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Maximization; Mathematics; Conjecture; Converse; Approximation algorithm; Graph; Tree (set theory); Satisfiability; Discrete mathematics; Mathematical optimization","score_opus":0.013963136237448284,"score_gpt":0.2910071363754212,"score_spread":0.2770440001379729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592818772","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.85887885,0.0016127026,0.13719,0.00069280877,0.0004239015,0.0006602527,0.00004077041,0.000013037363,0.00048765852],"genre_scores_gemma":[0.977585,0.00022025974,0.021439318,0.000096914635,0.000105030864,0.00011251686,0.000198093,0.000026500382,0.0002163595],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989201,0.0001024845,0.00027535539,0.0003987351,0.000047437457,0.00025589752],"domain_scores_gemma":[0.99897665,0.000052498108,0.0003007819,0.00049944135,0.00012051372,0.00005010096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033060633,0.00016649431,0.00023011779,0.000056798766,0.00040876446,0.000024628085,0.00022108444,0.0002468972,0.0000045350484],"category_scores_gemma":[0.00020571533,0.00013076815,0.0000708978,0.00003925788,0.0005889432,0.0000058847536,0.00021932038,0.00009648102,0.0000010217557],"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.00011003804,0.00006924754,0.026445223,0.00004095523,0.0004266329,0.0000040257883,0.00017675298,0.000015024903,0.8667229,0.0063179336,0.00023165785,0.09943962],"study_design_scores_gemma":[0.0128297,0.007296402,0.164276,0.00009522825,0.0010742308,0.00089051994,0.0009537284,0.07104128,0.6142832,0.050107747,0.07474507,0.0024068935],"about_ca_topic_score_codex":0.00005329914,"about_ca_topic_score_gemma":0.000029916624,"teacher_disagreement_score":0.25243968,"about_ca_system_score_codex":0.000005703349,"about_ca_system_score_gemma":0.000029947154,"threshold_uncertainty_score":0.533257},"labels":[],"label_agreement":null},{"id":"W259623631","doi":"10.1007/978-3-319-13075-0_28","title":"An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"","keywords":"Multiset; Partition (number theory); Combinatorics; Partition problem; Integer (computer science); Cardinality (data modeling); Approximation algorithm; Mathematics; Discrete mathematics; Algorithm; Computer science","score_opus":0.010974862968068358,"score_gpt":0.24466394039994496,"score_spread":0.2336890774318766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W259623631","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.0001584795,0.00025629476,0.9976141,0.0002479017,0.00046360787,0.0010075935,0.000018100207,0.000019070125,0.00021487713],"genre_scores_gemma":[0.19063722,0.00011324694,0.8027294,0.0015467717,0.0030041356,0.00029166695,0.00069467264,0.000118186865,0.0008646514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984352,0.000024903471,0.0002736745,0.0007101412,0.00023607242,0.00031999775],"domain_scores_gemma":[0.99882364,0.00006428396,0.00018507915,0.00068374607,0.0001802547,0.00006302113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006832454,0.00027698578,0.00021115343,0.00010914912,0.00017194968,0.00014560987,0.0007336242,0.00026428502,0.000006487196],"category_scores_gemma":[0.000019424957,0.00020728773,0.00009213223,0.00007521917,0.00031999632,0.000010333569,0.00018299566,0.00020557348,0.0000042366687],"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.000010471526,0.000019789073,0.000006611815,0.000030133053,0.000017721952,4.2343638e-7,0.00009560739,0.0030515995,0.017539276,0.0001504551,0.00003463086,0.9790433],"study_design_scores_gemma":[0.0004055273,0.00074604567,0.000025395979,0.00006188642,0.000027831857,0.000010805663,6.4619485e-7,0.9561447,0.01934941,0.0134587055,0.009361576,0.00040747056],"about_ca_topic_score_codex":0.000008113172,"about_ca_topic_score_gemma":0.00005743226,"teacher_disagreement_score":0.9786358,"about_ca_system_score_codex":0.00005161053,"about_ca_system_score_gemma":0.00010895526,"threshold_uncertainty_score":0.8452948},"labels":[],"label_agreement":null},{"id":"W2598062060","doi":"","title":"Covering things with things","year":2002,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","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":"Carleton University","funders":"","keywords":"Dimension (graph theory); Time complexity; Running time; Combinatorics; Computer science; Binary logarithm; Algorithm; Computational geometry; Notation; Discrete mathematics; Mathematics","score_opus":0.008676048206527117,"score_gpt":0.18644820402235965,"score_spread":0.17777215581583253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598062060","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.8158806,0.0008413286,0.016340837,0.00089778006,0.00010779218,0.0002585352,0.0000019929776,0.00008270093,0.16558841],"genre_scores_gemma":[0.97014993,0.00012595516,0.010219738,0.001069687,0.00011404588,0.000009771768,0.000012741371,0.00002547283,0.018272644],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943966,0.000007715599,0.000070405076,0.00020357799,0.00010589376,0.00017272681],"domain_scores_gemma":[0.9996949,0.0000022540337,0.000025369036,0.00020155171,0.000028606215,0.000047364156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000054755696,0.00009441878,0.00006396579,0.000018910514,0.00004617414,0.000026422393,0.00011391703,0.00005138301,0.00035495183],"category_scores_gemma":[0.000008229601,0.000073574105,0.000029142495,0.000049981812,0.000026693082,0.000006428657,0.000058176476,0.000047203463,0.000092889735],"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.000036064997,0.00011907172,0.004476587,0.000035625348,0.00018314093,0.000020117346,0.0006386749,0.00009901535,0.96603644,0.0004203696,0.014408475,0.01352643],"study_design_scores_gemma":[0.0021608837,0.00083818607,0.0017203728,0.00003019561,0.000049223683,0.00012275146,0.00042776283,0.0027399734,0.39344436,0.000099459765,0.5974327,0.00093418435],"about_ca_topic_score_codex":0.00001545271,"about_ca_topic_score_gemma":0.000002922693,"teacher_disagreement_score":0.5830242,"about_ca_system_score_codex":0.0000065001104,"about_ca_system_score_gemma":0.0000046413998,"threshold_uncertainty_score":0.38864738},"labels":[],"label_agreement":null},{"id":"W2601448663","doi":"10.1007/978-3-319-68705-6_29","title":"On Strongly Chordal Graphs That Are Not Leaf Powers","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Ottawa","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Graph; Tree (set theory); Treewidth; Discrete mathematics; Pathwidth; Computer science; Line graph; 1-planar graph","score_opus":0.017459307098969427,"score_gpt":0.2463024197857206,"score_spread":0.22884311268675117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601448663","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.02559481,0.0017097847,0.93719155,0.0012960357,0.0057384763,0.0013743022,0.00013088925,0.000086718384,0.026877439],"genre_scores_gemma":[0.979879,0.00018169913,0.015122985,0.0010304027,0.0007426397,0.000010801403,0.00006930669,0.000077104014,0.002886033],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975069,0.000016636952,0.0001971305,0.0011843246,0.00058847567,0.000506501],"domain_scores_gemma":[0.9981264,0.00003468865,0.0002783435,0.0013276347,0.00010504582,0.00012789668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031902536,0.00045022456,0.00032871022,0.00028001267,0.00023191007,0.00020690817,0.0014887718,0.0003839656,0.00003489089],"category_scores_gemma":[0.00006552721,0.00041301048,0.00016822891,0.000045627865,0.0006720998,0.0000099317585,0.0005453869,0.00044508302,0.000034916033],"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.00034342532,0.00023834812,0.0026181056,0.00020100627,0.0003265971,0.00039455923,0.00053038314,0.032125756,0.045201145,0.0035033727,0.001310381,0.91320693],"study_design_scores_gemma":[0.011569342,0.012275286,0.030648237,0.0046230615,0.00037266163,0.0005110236,0.0000094808265,0.02841695,0.47722045,0.18149814,0.23612753,0.016727867],"about_ca_topic_score_codex":0.000009167112,"about_ca_topic_score_gemma":0.000083855986,"teacher_disagreement_score":0.9542842,"about_ca_system_score_codex":0.000071623115,"about_ca_system_score_gemma":0.00016923208,"threshold_uncertainty_score":0.99983215},"labels":[],"label_agreement":null},{"id":"W2602821676","doi":"10.1186/s12864-017-3499-7","title":"Visualization of consensus genome structure without using a reference genome","year":2017,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"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":"National Bioscience Database Center; Institute of Genetics; Ministry of Economy, Trade and Industry","keywords":"Biology; Genome; Computational biology; Visualization; DNA microarray; Reference genome; Genetics; Evolutionary biology; Computer science; Data mining; Gene; Gene expression","score_opus":0.0435979460085297,"score_gpt":0.3038346240048962,"score_spread":0.2602366779963665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602821676","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.992017,0.00043953364,0.006389035,0.000009389861,0.00012060051,0.00029946523,0.00014780539,0.00000857921,0.00056862104],"genre_scores_gemma":[0.98110634,0.00008722133,0.01806393,0.000023079665,0.00021191293,0.0000033287108,0.00020429317,0.000042295924,0.00025762332],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989151,0.000043606826,0.00028791334,0.00036760585,0.00013153293,0.0002542828],"domain_scores_gemma":[0.99844503,0.0000044397502,0.000417611,0.00088955805,0.00016605282,0.00007732746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014140707,0.00019081622,0.0002238867,0.0000556401,0.0002115183,0.000060535647,0.0004445938,0.00018119915,0.00003055121],"category_scores_gemma":[0.000073762545,0.00020047849,0.000068650486,0.000033233664,0.00015792038,0.0000041037224,0.00026566462,0.00006245119,0.0000061142127],"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.00005231107,0.00001768069,0.013685629,0.000046931513,0.00004989179,9.583986e-7,0.00007579821,0.0011538741,0.98473203,0.00007789658,0.0000047860326,0.00010223908],"study_design_scores_gemma":[0.0046980362,0.0007074498,0.28513283,0.000050350598,0.000345795,0.00013555387,0.0004983081,0.006340674,0.6654917,0.00095014053,0.033795435,0.0018537476],"about_ca_topic_score_codex":0.00005277906,"about_ca_topic_score_gemma":0.00012672036,"teacher_disagreement_score":0.3192403,"about_ca_system_score_codex":0.00004461704,"about_ca_system_score_gemma":0.00019384763,"threshold_uncertainty_score":0.81752753},"labels":[],"label_agreement":null},{"id":"W2605308568","doi":"10.71781/9810","title":"De nouveaux algorithmes de tri par transpositions","year":2007,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"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":"Computer science","score_opus":0.00426770253656391,"score_gpt":0.1911624727399402,"score_spread":0.18689477020337628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605308568","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.87787586,0.06154927,0.018901883,0.0006130736,0.0014775181,0.00083526014,0.0004465133,0.00009907925,0.038201563],"genre_scores_gemma":[0.8843158,0.0060923244,0.016994104,0.0004519827,0.00115407,0.00008873048,0.0050891824,0.00013088112,0.08568291],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968611,0.00019943442,0.0005167796,0.00086672005,0.00053971435,0.0010162666],"domain_scores_gemma":[0.9980007,0.000052120868,0.00033663362,0.000518421,0.00046212974,0.000630037],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003770335,0.0006525774,0.00045629687,0.00033433922,0.0050288714,0.0000813168,0.0005842491,0.0011942331,0.00009390364],"category_scores_gemma":[0.000052213498,0.00084806996,0.0006292838,0.00034005515,0.000375859,0.0000363121,0.00010641072,0.000545826,0.00006091026],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016709774,0.0010287354,0.018769762,0.00052695244,0.0021396978,0.004028845,0.029164145,0.0064039296,0.9106679,0.004724493,0.0018819178,0.018992653],"study_design_scores_gemma":[0.0046488023,0.00092916744,0.09501173,0.00053698366,0.0022816644,0.003430682,0.041846346,0.0036428345,0.5215717,0.00038841605,0.32320192,0.0025097816],"about_ca_topic_score_codex":0.011398952,"about_ca_topic_score_gemma":0.0049506533,"teacher_disagreement_score":0.38909623,"about_ca_system_score_codex":0.004528533,"about_ca_system_score_gemma":0.0033256046,"threshold_uncertainty_score":0.999397},"labels":[],"label_agreement":null},{"id":"W2625912121","doi":"10.1186/s13059-017-1241-z","title":"Lineage-specific rediploidization is a mechanism to explain time-lags between genome duplication and evolutionary diversification","year":2017,"lang":"en","type":"article","venue":"Genome biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":202,"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":"Fisheries and Oceans Canada; Karl-Franzens-Universität Graz; University of Glasgow; Natural Environment Research Council; Sight Research UK","keywords":"Biology; Lineage (genetic); Evolutionary biology; Adaptive radiation; Phylogenomics; Adaptation (eye); Gene duplication; Genome; Most recent common ancestor; Phylogenetics; Gene; Clade; Genetics","score_opus":0.021477206144566524,"score_gpt":0.25393995527762847,"score_spread":0.23246274913306195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625912121","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.96200275,0.0011866754,0.033258736,0.0016842927,0.00015406951,0.0008052183,0.00033960232,0.000039808576,0.00052885816],"genre_scores_gemma":[0.98904663,0.00092417793,0.005545621,0.0001923705,0.00083194906,0.00008300326,0.00220777,0.000032446842,0.0011360113],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9986096,0.000065922846,0.00025028703,0.0006808539,0.00009298873,0.00030031722],"domain_scores_gemma":[0.998651,0.0000105928075,0.00020520316,0.00081513944,0.00017709553,0.00014094892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028043045,0.00019596975,0.00019402395,0.00011714985,0.00047033126,0.000054178752,0.0004361645,0.00026906768,0.000080398844],"category_scores_gemma":[0.000062522486,0.00021142852,0.000047942165,0.000080313504,0.00011220992,0.000013346254,0.0004110254,0.00007155895,0.00029825364],"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.00002987049,0.000020968318,0.0028202094,0.000007476847,0.00005177976,5.1285315e-7,0.00014712024,0.0000051723755,0.99432,0.00020106239,0.00037848265,0.0020173683],"study_design_scores_gemma":[0.001406247,0.0010433181,0.4610514,0.000010907982,0.00008044766,0.000016065462,0.00012075895,0.00012225859,0.08010124,0.0018036056,0.4533386,0.0009051386],"about_ca_topic_score_codex":0.000013863453,"about_ca_topic_score_gemma":0.00000174195,"teacher_disagreement_score":0.9142187,"about_ca_system_score_codex":0.000054353288,"about_ca_system_score_gemma":0.000034160767,"threshold_uncertainty_score":0.8621805},"labels":[],"label_agreement":null},{"id":"W2727458370","doi":"10.1016/j.tcs.2017.06.014","title":"Asymptotic medians of random permutations sampled from reversal random walks","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Median; Random walk; Mathematics; Random permutation; Combinatorics; Discrete mathematics; Statistics; Symmetric group","score_opus":0.009401001321547755,"score_gpt":0.2585849957158825,"score_spread":0.24918399439433475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727458370","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.5691241,0.00005131813,0.42851272,0.0004116683,0.00035984445,0.00019371697,0.000025252888,0.000010444495,0.0013109478],"genre_scores_gemma":[0.9788406,0.000021108182,0.020762479,0.000078093406,0.0002385908,0.0000066700654,0.000022788101,0.000009290019,0.000020366764],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986826,0.000070627604,0.00021131974,0.0004149094,0.0003367509,0.0002837659],"domain_scores_gemma":[0.9986738,0.00009283428,0.000113268055,0.00081679167,0.0001566047,0.00014672207],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00066763884,0.00012591202,0.00020942789,0.00004787836,0.0004271906,0.0001256972,0.0010831094,0.00006373359,0.00010156761],"category_scores_gemma":[0.0004165469,0.00010530303,0.000092642775,0.00007250951,0.002883864,0.000014665073,0.0004444543,0.000074666365,0.000019555559],"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.0008578672,0.0002814157,0.0040605525,0.00003295633,0.00019055784,0.00001936826,0.0016027599,0.0004259991,0.86193204,0.10063902,0.00035554232,0.029601939],"study_design_scores_gemma":[0.037590913,0.0019708078,0.09672148,0.00020767837,0.00037984218,0.000053747983,0.00019247746,0.17214102,0.5297148,0.15724826,0.0018853034,0.0018936591],"about_ca_topic_score_codex":0.000027800661,"about_ca_topic_score_gemma":0.000006274136,"teacher_disagreement_score":0.40971652,"about_ca_system_score_codex":0.00001162743,"about_ca_system_score_gemma":0.000096895266,"threshold_uncertainty_score":0.9998297},"labels":[],"label_agreement":null},{"id":"W2737931494","doi":"10.1186/s12920-017-0279-9","title":"Secure approximation of edit distance on genomic data","year":2017,"lang":"en","type":"article","venue":"BMC Medical Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Zayed University","keywords":"Edit distance; Plaintext; Computer science; Similarity (geometry); String (physics); Set (abstract data type); Intersection (aeronautics); Metric (unit); Sequence (biology); Algorithm; Domain (mathematical analysis); Approximation algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Encryption; Image (mathematics); Biology","score_opus":0.03924657293843731,"score_gpt":0.29895002474403315,"score_spread":0.25970345180559584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737931494","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.9290714,0.00073717843,0.064147264,0.00041114437,0.0008358856,0.00041097903,0.00028955942,0.000013296845,0.004083258],"genre_scores_gemma":[0.98125994,0.0007879956,0.01435117,0.00016800284,0.0016813298,0.000014234468,0.0010981838,0.00004033144,0.00059883465],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880224,0.000037522666,0.00025226825,0.00040698482,0.00030246383,0.00019853815],"domain_scores_gemma":[0.9977087,0.000021014373,0.00023310655,0.0018616286,0.000040663544,0.00013489407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051061006,0.00012965812,0.00016696383,0.000021687476,0.00011456892,0.000030705014,0.0014473689,0.00018315368,0.00006233341],"category_scores_gemma":[0.0006042371,0.00012160134,0.00005108248,0.000016628954,0.00017686939,0.0000054295283,0.0006951806,0.000103407394,0.00003393425],"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.0013357464,0.0014300428,0.04564323,0.0015092428,0.000758615,0.00004064493,0.00054070243,0.00062599964,0.7392786,0.00888247,0.055325113,0.14462955],"study_design_scores_gemma":[0.0078704655,0.0011919873,0.06766063,0.00028485752,0.00020728516,0.00004805027,0.00032406702,0.040891577,0.08658893,0.0021227761,0.79110396,0.001705435],"about_ca_topic_score_codex":0.000009630128,"about_ca_topic_score_gemma":0.00010431641,"teacher_disagreement_score":0.7357788,"about_ca_system_score_codex":0.000021845213,"about_ca_system_score_gemma":0.0003242098,"threshold_uncertainty_score":0.49587587},"labels":[],"label_agreement":null},{"id":"W2754375282","doi":"10.1007/978-3-319-67979-2_2","title":"A Tractable Variant of the Single Cut or Join Distance with Duplicated Genes","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"Simon Fraser University","funders":"","keywords":"Gene duplication; Joins; Segmental duplication; Computer science; Genome; Descendant; Context (archaeology); Gene; Join (topology); Genetics; Biology; Algorithm; Combinatorics; Gene family; Mathematics","score_opus":0.016029355772590664,"score_gpt":0.22797697004693618,"score_spread":0.21194761427434552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754375282","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.0047023455,0.0011918297,0.9898682,0.00032770642,0.0004245993,0.0005641389,0.00003142254,0.000012149731,0.0028775884],"genre_scores_gemma":[0.9355418,0.00018872682,0.05638911,0.00030007176,0.0004966223,0.000018422932,0.000026366662,0.00006956443,0.006969281],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985171,0.000013293574,0.00020804346,0.00064669905,0.00033151516,0.00028335958],"domain_scores_gemma":[0.9983169,0.000023249111,0.00029995764,0.0011659173,0.00014436024,0.000049655122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020627145,0.0002567073,0.00026426069,0.00006724811,0.00015550185,0.00008650325,0.0012215042,0.00017919214,0.000014108704],"category_scores_gemma":[0.000039630868,0.00015185076,0.00006742556,0.00008083726,0.0007080492,0.0000076148403,0.00039731126,0.00018006997,0.0000020474743],"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.0003425628,0.0002729135,0.0009158282,0.00027937404,0.00020192993,0.0001279888,0.0004511215,0.016218876,0.52010196,0.0004925225,0.000121166115,0.46047378],"study_design_scores_gemma":[0.0024902697,0.002733868,0.0025370256,0.0017350783,0.00016802236,0.0006036454,0.000001567672,0.019123005,0.8484591,0.008537198,0.11114586,0.0024653308],"about_ca_topic_score_codex":0.000016347623,"about_ca_topic_score_gemma":0.0003704934,"teacher_disagreement_score":0.93347913,"about_ca_system_score_codex":0.000040533338,"about_ca_system_score_gemma":0.00032555766,"threshold_uncertainty_score":0.61922944},"labels":[],"label_agreement":null},{"id":"W2763456665","doi":"10.1093/bioinformatics/btx648","title":"SAGE2: parallel human genome assembly","year":2017,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Sequence assembly; Computer science; Human genome; License; Graph; MIT License; Computational biology; Biology; Theoretical computer science; Genetics; Gene","score_opus":0.022374859411655616,"score_gpt":0.2756007835409523,"score_spread":0.2532259241292967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763456665","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.87959325,0.000331208,0.013498221,0.00029693387,0.00036378717,0.0005476691,0.00005114918,0.000054787128,0.10526298],"genre_scores_gemma":[0.96660274,0.00016573368,0.027235527,0.00023309214,0.0004002107,0.000022840119,0.00027632588,0.000031504896,0.0050320094],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991649,0.000009546212,0.00024933068,0.00013621447,0.00015704571,0.00028296892],"domain_scores_gemma":[0.9986806,0.0000020990303,0.00021739105,0.00094907585,0.0000554162,0.000095402494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017797193,0.00015318194,0.00012881018,0.00003489812,0.00044026645,0.00017961649,0.0005792519,0.000121766825,0.00003497936],"category_scores_gemma":[0.000046545225,0.00014443665,0.00008604561,0.000017600485,0.00008605978,0.000014138661,0.0002947809,0.00006661599,0.00021383252],"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.000055913377,0.00025042475,0.00904915,0.00034129323,0.00051976385,0.000021208914,0.00089246954,0.00019552493,0.94680315,0.0016795251,0.0155043285,0.02468724],"study_design_scores_gemma":[0.004188852,0.0010597797,0.2617343,0.00004915238,0.00012033057,0.000062068146,0.00057934056,0.0027855586,0.04054151,0.00044705198,0.68664855,0.0017834844],"about_ca_topic_score_codex":0.00000958903,"about_ca_topic_score_gemma":0.000013616251,"teacher_disagreement_score":0.9062616,"about_ca_system_score_codex":0.000013776054,"about_ca_system_score_gemma":0.000031858406,"threshold_uncertainty_score":0.5889956},"labels":[],"label_agreement":null},{"id":"W2765773784","doi":"10.1186/s12859-017-1830-6","title":"DCJ-RNA - double cut and join for RNA secondary structures","year":2017,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","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":"University of Ottawa","funders":"National Plan for Science, Technology and Innovation; King Saud University","keywords":"Nucleic acid secondary structure; Protein secondary structure; Genome; Computer science; Join (topology); RNA; Similarity (geometry); Algorithm; Time complexity; Sequence (biology); Data structure; Representation (politics); Theoretical computer science; Computational biology; Mathematics; Biology; Genetics; Combinatorics; Gene; Artificial intelligence","score_opus":0.02485877873433138,"score_gpt":0.2729704115021062,"score_spread":0.24811163276777484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765773784","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.88868904,0.0013326863,0.0704722,0.00030660167,0.0010820857,0.0017934704,0.00034276184,0.000054641296,0.035926502],"genre_scores_gemma":[0.58870125,0.00049432955,0.40394333,0.0004917872,0.000863009,0.00010125662,0.0006101512,0.00007718085,0.0047176997],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925786,0.000005716287,0.00023839872,0.00014780991,0.00010055966,0.0002496595],"domain_scores_gemma":[0.99907255,0.000008471005,0.00020439636,0.0005625988,0.00006286166,0.000089109315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001563203,0.00016085035,0.00014849867,0.000036764093,0.00031224926,0.00019090975,0.00029155923,0.00014445321,0.000023131981],"category_scores_gemma":[0.00005608081,0.00014211233,0.00007433375,0.000013795118,0.00011019898,0.000020037942,0.00021516868,0.0000682741,0.000009898308],"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.002206927,0.00030983496,0.02510094,0.007946783,0.0016702098,0.00000999978,0.0040281033,0.00051720906,0.30957752,0.010164375,0.17051409,0.467954],"study_design_scores_gemma":[0.017464308,0.0013895163,0.037350576,0.00009536394,0.0002453551,0.00010220174,0.001496696,0.035593376,0.50572294,0.0043286015,0.3941538,0.0020572974],"about_ca_topic_score_codex":0.00000938094,"about_ca_topic_score_gemma":0.000047151585,"teacher_disagreement_score":0.4658967,"about_ca_system_score_codex":0.000008279227,"about_ca_system_score_gemma":0.000076327866,"threshold_uncertainty_score":0.5795173},"labels":[],"label_agreement":null},{"id":"W2800043800","doi":"10.1186/s12859-018-2131-4","title":"On the rank-distance median of 3 permutations","year":2018,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"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; Canadian Institutes of Health Research; Fundação de Amparo à Pesquisa do Estado de São Paulo; Genome Canada; Alfred P. Sloan Foundation","keywords":"Combinatorics; Permutation (music); Mathematics; Median; Rank (graph theory); Distance matrix; Matrix (chemical analysis); Heuristic; Discrete mathematics; Algorithm; Mathematical optimization","score_opus":0.015539769042076981,"score_gpt":0.24492022515144965,"score_spread":0.22938045610937266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800043800","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.4333993,0.00021198849,0.4963158,0.0008597361,0.0005582187,0.0008909753,0.00016335552,0.000033177035,0.067567445],"genre_scores_gemma":[0.96245074,0.000040229883,0.035997443,0.00042488615,0.0001903313,0.000018885316,0.000087383305,0.000013844897,0.0007762774],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945843,0.00001676959,0.00019689476,0.00006531526,0.00013679382,0.00012577031],"domain_scores_gemma":[0.99941885,0.000026634783,0.0000967659,0.00032689783,0.000098669276,0.000032187978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015559328,0.00007825606,0.000067317604,0.000027410942,0.0000739059,0.000011952766,0.00018775385,0.00005225,0.000070255715],"category_scores_gemma":[0.00013190595,0.00005327127,0.00004981539,0.00009041734,0.00017004416,0.0000029404073,0.00004097122,0.000036744044,0.00010436096],"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.0013248045,0.0015233345,0.021365564,0.002317949,0.001652047,0.000004710703,0.037908968,0.0031190317,0.24660836,0.22367105,0.38315398,0.07735021],"study_design_scores_gemma":[0.0054213516,0.0043626614,0.0160832,0.00024780116,0.00021249878,0.00004115915,0.011105017,0.23925364,0.40003127,0.009603036,0.31186208,0.0017762783],"about_ca_topic_score_codex":0.0000017366227,"about_ca_topic_score_gemma":0.000031323714,"teacher_disagreement_score":0.5290514,"about_ca_system_score_codex":0.0000062885883,"about_ca_system_score_gemma":0.000050044444,"threshold_uncertainty_score":0.21723393},"labels":[],"label_agreement":null},{"id":"W2802730037","doi":"10.1186/s12864-018-4462-y","title":"Resolution effects in reconstructing ancestral genomes","year":2018,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Synteny; Genome; Biology; Evolutionary biology; Computational biology; Comparative genomics; Resolution (logic); Genomics; DNA microarray; Genetics; Gene; Computer science; Artificial intelligence","score_opus":0.01774716360236049,"score_gpt":0.2492426251077188,"score_spread":0.23149546150535832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802730037","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.9940593,0.00090694753,0.0027055605,0.000016046299,0.00035965772,0.00022606742,0.000004143969,0.000011852528,0.0017104128],"genre_scores_gemma":[0.9575892,0.00011021947,0.04115915,0.00004998486,0.0007692902,0.000016344871,0.000033164913,0.000022915556,0.00024969628],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910724,0.000049256945,0.00017948056,0.00030858154,0.000059806007,0.0002956138],"domain_scores_gemma":[0.9995844,0.000010059114,0.00006700828,0.00025183283,0.00003680095,0.000049937586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001975441,0.00012022748,0.00011024014,0.00006198394,0.000061092374,0.00002082828,0.00015071014,0.00010745259,0.0000113803],"category_scores_gemma":[0.00004525163,0.00013354658,0.000047769245,0.00009122835,0.00009263654,0.000003552029,0.0000871347,0.00006134864,0.00004751313],"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.00008571572,0.000038891878,0.1615052,0.000058323552,0.000028600683,0.0000035626895,0.00022672476,0.00022416552,0.8188922,0.00010267774,0.0002452602,0.018588666],"study_design_scores_gemma":[0.004555421,0.0015308808,0.18206473,0.00007790454,0.00005441718,0.00012233798,0.00080737396,0.0057723713,0.72613275,0.0019945155,0.07545158,0.0014357219],"about_ca_topic_score_codex":0.000018461002,"about_ca_topic_score_gemma":0.00031811846,"teacher_disagreement_score":0.09275945,"about_ca_system_score_codex":0.000053906664,"about_ca_system_score_gemma":0.000083461855,"threshold_uncertainty_score":0.54458714},"labels":[],"label_agreement":null},{"id":"W2803081544","doi":"10.1186/s12864-018-4466-7","title":"Phylogenetic signal from rearrangements in 18 Anopheles species by joint scaffolding extant and ancestral genomes","year":2018,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":true,"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; Agence Nationale de la Recherche; Western Canada Research Grid; Compute Canada","keywords":"Biology; Genome; Phylogenetic tree; Evolutionary biology; Phylogenetics; Genome evolution; Genetics; Comparative genomics; Gene; Computational biology; Genomics","score_opus":0.03257559653135373,"score_gpt":0.24063597032159498,"score_spread":0.20806037379024125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803081544","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.9912561,0.0065683094,0.00093718356,0.00002139515,0.00013851094,0.00028574024,0.00012576816,0.00001094534,0.00065605703],"genre_scores_gemma":[0.98515755,0.0015817805,0.012019956,0.00007831327,0.00057666976,0.000019982006,0.0001601899,0.000040252533,0.00036528573],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998532,0.000054893997,0.00030742167,0.00055884314,0.00013763396,0.00040921106],"domain_scores_gemma":[0.9994341,0.000009640082,0.00010456819,0.00030324102,0.000044443663,0.00010400099],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001678296,0.0002407473,0.00022626037,0.00007191517,0.000089790934,0.00006955394,0.00021189728,0.00012684584,0.00024716603],"category_scores_gemma":[0.000011919622,0.00025495118,0.000056911056,0.00008657143,0.00019716148,0.000006130992,0.00020439361,0.00006125452,0.000025668776],"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.000047082223,0.00004089522,0.055982392,0.000013096574,0.000039222574,0.0000023444918,0.00013945004,0.000021918786,0.93992656,0.0000033609228,0.00067533745,0.0031083368],"study_design_scores_gemma":[0.0017526086,0.00052023097,0.14621964,0.000029243169,0.000041038875,0.0000076062206,0.00064290914,0.0004422152,0.81891006,0.00035730295,0.03043119,0.0006459418],"about_ca_topic_score_codex":0.000072744275,"about_ca_topic_score_gemma":0.000410712,"teacher_disagreement_score":0.121016495,"about_ca_system_score_codex":0.000054291333,"about_ca_system_score_gemma":0.0000622299,"threshold_uncertainty_score":0.9999903},"labels":[],"label_agreement":null},{"id":"W2810570362","doi":"10.1093/bioinformatics/bty586","title":"Fast characterization of segmental duplications in genome assemblies","year":2018,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":107,"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 British Columbia","funders":"National Institute of General Medical Sciences; National Institutes of Health","keywords":"Genome; Structural variation; Computer science; Sequence assembly; Computational biology; Segmental duplication; Gene duplication; Jaccard index; Biology; Genetics; Artificial intelligence; Pattern recognition (psychology); Gene","score_opus":0.010153928465806603,"score_gpt":0.23674114807972357,"score_spread":0.22658721961391698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810570362","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.9865226,0.000017101094,0.010504161,0.000034871675,0.000057167228,0.00018902165,0.000049432078,0.0000066527914,0.0026189568],"genre_scores_gemma":[0.9916752,0.00007475698,0.007141993,0.000063844374,0.00010160398,0.000014517245,0.0006480937,0.0000087659955,0.00027125646],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994848,0.0000075193993,0.00024319586,0.000070013455,0.00008050336,0.00011399006],"domain_scores_gemma":[0.9996065,0.0000016691097,0.00010548475,0.00019457797,0.00006646597,0.000025297664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082018814,0.00006927014,0.00007426847,0.000073917356,0.000026725063,0.0000112648995,0.00011227345,0.00005634182,0.00002449434],"category_scores_gemma":[0.000011335133,0.0000692621,0.000024808141,0.00012331057,0.000059110593,0.000008758772,0.00006690378,0.00002236286,0.00004173902],"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.0000063387934,0.000036453486,0.0025904896,0.000025516209,0.000012490566,5.8490347e-8,0.00043343354,0.0000037410384,0.9945099,0.00003889292,0.00003136827,0.0023113384],"study_design_scores_gemma":[0.0011035833,0.0006223602,0.29457408,0.00003141913,0.000021355823,0.0000112033595,0.0010815022,0.005281434,0.67387444,0.000027274875,0.022965536,0.00040583877],"about_ca_topic_score_codex":0.0000021635378,"about_ca_topic_score_gemma":0.00000734173,"teacher_disagreement_score":0.32063547,"about_ca_system_score_codex":0.000012549221,"about_ca_system_score_gemma":0.000026996862,"threshold_uncertainty_score":0.28244266},"labels":[],"label_agreement":null},{"id":"W2811221372","doi":"10.1007/978-3-319-94776-1_3","title":"A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Bottleneck; Approximation algorithm; Decomposition; Combinatorics; Algorithm; Time complexity; Computer science; Randomized algorithm; Mathematics; Discrete mathematics; Biology","score_opus":0.008534293592855747,"score_gpt":0.25558125869686,"score_spread":0.24704696510400426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811221372","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.00020330875,0.0002384194,0.9961612,0.00008271621,0.00018850766,0.0024142894,0.000025907877,0.000024793151,0.00066084316],"genre_scores_gemma":[0.005666564,0.00004829609,0.99160796,0.0002486255,0.0011135185,0.00063766324,0.0003282718,0.00005083671,0.00029823295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982333,0.000027022677,0.00029957737,0.0008278581,0.00031401656,0.00029821755],"domain_scores_gemma":[0.9987964,0.000085251915,0.00025740956,0.0004939633,0.00029853082,0.000068438814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069710886,0.00029738253,0.00034827867,0.00020526997,0.00016061684,0.000116697855,0.00050984905,0.00019919926,0.000014042186],"category_scores_gemma":[0.000023827353,0.00025307166,0.00011502486,0.0001069909,0.00052729726,0.000011235995,0.00017316523,0.00013122123,0.000009708567],"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.00081635447,0.000050791125,0.0000031194306,0.00006445909,0.00008956855,0.000001982552,0.00012914758,0.005089068,0.005048686,0.00028252386,0.000022545557,0.9884018],"study_design_scores_gemma":[0.036114678,0.00075942895,0.000004535218,0.00024218785,0.00011637999,0.00008659957,7.916771e-7,0.8232389,0.030629562,0.10012513,0.007604342,0.0010774739],"about_ca_topic_score_codex":0.000004897471,"about_ca_topic_score_gemma":0.000016800826,"teacher_disagreement_score":0.9873243,"about_ca_system_score_codex":0.00006927167,"about_ca_system_score_gemma":0.00013236832,"threshold_uncertainty_score":0.99999213},"labels":[],"label_agreement":null},{"id":"W2888316782","doi":"10.1093/bib/bby072","title":"Machine learning meets genome assembly","year":2018,"lang":"en","type":"review","venue":"Briefings in Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":28,"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":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Vale Canada Limited","keywords":"Computer science; Nondeterministic algorithm; Task (project management); Artificial intelligence; Field (mathematics); Data science; Machine learning; Theoretical computer science; Systems engineering; Mathematics; Engineering","score_opus":0.025435231494263796,"score_gpt":0.28452855821886774,"score_spread":0.25909332672460395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888316782","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018383016,0.9938464,0.00047330014,0.00002696811,0.00016442475,0.00065135746,0.000059296784,0.000037490463,0.0047223344],"genre_scores_gemma":[0.0000052340374,0.98680484,0.009525866,0.00017170695,0.00030296497,0.000059867525,0.0017408372,0.00009744202,0.0012912297],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975937,0.00008940977,0.001059703,0.00039513805,0.0002830295,0.000579024],"domain_scores_gemma":[0.99856377,0.000025468305,0.0006367319,0.00057773787,0.00008027275,0.000116048985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006123021,0.0005697991,0.0010112053,0.00028479515,0.000103505954,0.00010475451,0.0006322122,0.0006210117,0.000036458612],"category_scores_gemma":[0.00019353807,0.0005241641,0.00036659322,0.00033335172,0.000100002384,0.000010474564,0.0005117877,0.00044093587,0.00033024902],"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.00001106467,0.000098216646,0.000014961216,0.019050464,0.0004463147,0.000018748606,0.00032112806,0.000022830367,0.0000581133,0.000061365565,0.0029981886,0.9768986],"study_design_scores_gemma":[0.00026336857,0.00016202776,0.0000036064005,0.0013308163,0.00012619379,0.00008303303,0.000014442623,0.00030544333,0.0000138596715,0.0000053162667,0.9971162,0.0005756878],"about_ca_topic_score_codex":0.00002750885,"about_ca_topic_score_gemma":0.000018946035,"teacher_disagreement_score":0.99411803,"about_ca_system_score_codex":0.00008720356,"about_ca_system_score_gemma":0.00020511459,"threshold_uncertainty_score":0.999721},"labels":[],"label_agreement":null},{"id":"W2888977297","doi":"10.1007/s10878-018-0346-y","title":"An approximation algorithm for genome sorting by reversals to recover all adjacencies","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"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 Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Georgia Southern University; Office of the Vice President for Research and Economic Development, University at Buffalo; National Science Foundation","keywords":"Genome; Sorting; Approximation algorithm; Biology; Genomics; Gene; Computational biology; Mathematics; Algorithm; Computer science; Genetics","score_opus":0.01089987414633301,"score_gpt":0.2672347587110028,"score_spread":0.25633488456466974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888977297","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.041656353,0.000119731,0.95585734,0.00015950363,0.0016773684,0.00040250964,0.00002048454,0.000007850932,0.0000988679],"genre_scores_gemma":[0.12758325,0.00015153685,0.867142,0.00034286862,0.00408482,0.000023787501,0.00040539715,0.00006501001,0.00020130664],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99893856,0.00006204771,0.00042307252,0.00017393424,0.00021604933,0.00018633838],"domain_scores_gemma":[0.9984623,0.000010779877,0.0004314407,0.0001592901,0.0008174365,0.000118752585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063930365,0.00012148082,0.00017354907,0.00008739629,0.00008110592,0.00006463183,0.00019755491,0.0001217734,0.000020125226],"category_scores_gemma":[0.00016280396,0.00012063959,0.00007873838,0.000113856506,0.000023855457,0.000036715748,0.000030157547,0.000052293763,0.0000024777669],"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.0005394031,0.00043738354,0.000120821176,0.00003255417,0.0002793747,0.0000012399298,0.00066327036,0.040912174,0.9182376,0.00013126196,0.013362559,0.025282321],"study_design_scores_gemma":[0.013977831,0.025352031,0.00035864906,0.00011195575,0.0004596783,0.000068376314,0.00064291304,0.19862525,0.5371566,0.0029992496,0.21858229,0.0016651814],"about_ca_topic_score_codex":0.0000019847564,"about_ca_topic_score_gemma":2.7756954e-7,"teacher_disagreement_score":0.38108104,"about_ca_system_score_codex":0.000056372977,"about_ca_system_score_gemma":0.00006545308,"threshold_uncertainty_score":0.49195397},"labels":[],"label_agreement":null},{"id":"W2914186449","doi":"10.1016/j.dam.2016.01.034","title":"Odd gossiping","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"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":"Gossip; Asynchronous communication; Upper and lower bounds; Computer science; Pairwise comparison; Node (physics); Conjecture; Computer network; Theoretical computer science; Mathematics; Combinatorics; Physics","score_opus":0.00998681482184194,"score_gpt":0.23207651812410954,"score_spread":0.2220897033022676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914186449","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.52806973,0.0002910874,0.36680603,0.0005049313,0.00018855264,0.0007780023,0.00004363665,0.00011209956,0.10320591],"genre_scores_gemma":[0.95188546,0.00011174,0.044994842,0.00011391216,0.00026345009,0.000079665166,0.000032533764,0.000059009875,0.0024593952],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991574,0.0000056985295,0.00018969794,0.00024750314,0.00014443365,0.0002552382],"domain_scores_gemma":[0.99937576,0.000013837326,0.000078304314,0.00043676203,0.000025451476,0.00006987427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013077259,0.00015068913,0.00013367974,0.00002775186,0.000051845393,0.000020107525,0.00020235403,0.000084801344,0.000077392935],"category_scores_gemma":[0.000028444767,0.000100557765,0.00006428985,0.000053080938,0.00006190246,0.0000020826894,0.0001295764,0.000031481057,0.00021195818],"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.000007219146,0.000029381234,0.000041865576,0.00003670621,0.000045261175,8.288816e-7,0.00008100894,0.0000015503401,0.9842048,0.007723627,0.00093035813,0.0068973694],"study_design_scores_gemma":[0.0021757588,0.00017242396,0.000475926,0.00010349982,0.0000831218,0.000021997776,0.00059642736,0.000094605566,0.8912499,0.018853564,0.08520243,0.00097034394],"about_ca_topic_score_codex":4.1669807e-7,"about_ca_topic_score_gemma":0.0000012302208,"teacher_disagreement_score":0.4238157,"about_ca_system_score_codex":0.00001255837,"about_ca_system_score_gemma":0.000018654757,"threshold_uncertainty_score":0.41006267},"labels":[],"label_agreement":null},{"id":"W2921221051","doi":"10.46298/dmtcs.8383","title":"Token Swapping on Trees","year":2023,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"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; University of Waterloo","keywords":"Security token; Vertex (graph theory); Combinatorics; Swap (finance); Conjecture; Graph; Computer science; Mathematics; Approximation algorithm; Discrete mathematics; Computer network","score_opus":0.02295515797936839,"score_gpt":0.28151294631101326,"score_spread":0.2585577883316449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921221051","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.16039869,0.00009478662,0.8238065,0.0010324667,0.0016397393,0.001028096,0.000075387026,0.00021505667,0.011709259],"genre_scores_gemma":[0.8821378,0.000069230344,0.11623807,0.00024640156,0.00070411037,0.00007255786,0.000111583504,0.00009007817,0.00033018333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684656,0.00006892322,0.00044133986,0.0011545419,0.00083045405,0.00065819087],"domain_scores_gemma":[0.9978648,0.000077725796,0.00017712024,0.0014870052,0.00015746056,0.00023590433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012509644,0.00043631718,0.00039416092,0.00020152978,0.00023480147,0.00037707743,0.0018796974,0.00023892483,0.000053799155],"category_scores_gemma":[0.00019865792,0.00036509815,0.00022947202,0.000288836,0.00159226,0.0000053348904,0.0038395235,0.0003850668,0.00025564453],"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.00006248918,0.00051439414,0.0000941794,0.0008555146,0.00036206868,0.0000640165,0.0024372488,0.006333715,0.06533155,0.91370964,0.0028253547,0.007409806],"study_design_scores_gemma":[0.00074485753,0.001118724,0.00075674744,0.0011183592,0.00014680806,0.00003011349,0.0002463978,0.44353965,0.0357406,0.51322955,0.0011535566,0.0021746543],"about_ca_topic_score_codex":0.0000018295419,"about_ca_topic_score_gemma":0.0000013452254,"teacher_disagreement_score":0.7217391,"about_ca_system_score_codex":0.00004015547,"about_ca_system_score_gemma":0.00014006207,"threshold_uncertainty_score":0.9998801},"labels":[],"label_agreement":null},{"id":"W2941817316","doi":"10.1016/j.dam.2019.04.002","title":"On the computational complexity of closest genome problems","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Genome; Breakpoint; Pairwise comparison; Mathematics; Hamming distance; Combinatorics; Gene rearrangement; Edit distance; Computational biology; Algorithm; Biology; Genetics; Chromosome; Gene","score_opus":0.021683806899107934,"score_gpt":0.2354475112205545,"score_spread":0.21376370432144656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941817316","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.95322883,0.000042871136,0.0150966775,0.00017115143,0.000037836533,0.0009401387,0.000062307125,0.000013009764,0.030407175],"genre_scores_gemma":[0.98598164,0.0000073065135,0.013388555,0.000108021086,0.00003151854,0.0000357645,0.0002037274,0.000023570907,0.00021990752],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920976,0.00001152705,0.00022326084,0.00018558503,0.00021837222,0.00015148985],"domain_scores_gemma":[0.9993534,0.000038265724,0.00014324841,0.00039180636,0.000043698175,0.000029575753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017788044,0.00013057452,0.00015801143,0.000022591747,0.000040914507,0.000013796398,0.00024363714,0.00005478032,0.00014328174],"category_scores_gemma":[0.000011465792,0.00009133745,0.000066268585,0.00006661882,0.00012533966,0.0000011313396,0.000100955505,0.000065870016,0.00013671766],"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.000028011042,0.0002278314,0.00007928515,0.00030520486,0.00017045313,2.606311e-7,0.0005475112,0.006888676,0.52307135,0.46820787,0.0003515937,0.00012199438],"study_design_scores_gemma":[0.0044452646,0.0015252794,0.0077709034,0.00017445804,0.00018924529,0.000023241042,0.0027265046,0.020824911,0.12255302,0.82633376,0.011656476,0.001776945],"about_ca_topic_score_codex":0.000001117467,"about_ca_topic_score_gemma":0.0000010597516,"teacher_disagreement_score":0.4005183,"about_ca_system_score_codex":0.000008146706,"about_ca_system_score_gemma":0.000021435351,"threshold_uncertainty_score":0.37246332},"labels":[],"label_agreement":null},{"id":"W2949819205","doi":"10.1101/026310","title":"Evolution of genes neighborhood within reconciled phylogenies: an ensemble approach","year":2015,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Genome Rearrangement Algorithms","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":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"Simon Fraser University; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Synteny; Context (archaeology); Genome; Phylogenetic tree; Comparative genomics; Evolutionary algorithm; Biology; Genomics; Evolutionary biology; Gene; Mathematics; Genetics; Mathematical optimization; Paleontology","score_opus":0.019209503556083418,"score_gpt":0.22169500342206028,"score_spread":0.20248549986597686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949819205","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.98030865,0.006657291,0.010844265,0.000013778454,0.0008372056,0.0008873723,0.00027121868,0.00009984237,0.00008034654],"genre_scores_gemma":[0.9795289,0.00023492811,0.018990021,0.000026839436,0.0008514817,0.00019381288,0.000008908163,0.00015007911,0.000015022342],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968978,0.00024459005,0.00066979957,0.0012487175,0.00043030252,0.0005087509],"domain_scores_gemma":[0.996113,0.0000075311164,0.0006742014,0.0018505298,0.0010362613,0.0003184851],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000987922,0.0005981766,0.0006256869,0.00020743943,0.000083152714,0.00007456838,0.0007701286,0.0008789578,0.000011049252],"category_scores_gemma":[0.00015273353,0.0006548704,0.00020025737,0.00029001042,0.00015610388,0.000014921309,0.0005977692,0.0003670292,0.000014917389],"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.0000675146,0.00025464236,0.0054317163,0.00028657846,0.00027159406,0.0000035836595,0.000020920914,0.00095765985,0.99239415,0.0001408723,0.00016589806,0.000004860559],"study_design_scores_gemma":[0.0012573849,0.00050195976,0.009636489,0.000105788225,0.00024989576,8.916942e-8,0.00004953501,0.002967089,0.9823509,0.000018942745,0.0016013253,0.0012605966],"about_ca_topic_score_codex":0.000060442202,"about_ca_topic_score_gemma":0.0000060077186,"teacher_disagreement_score":0.010043254,"about_ca_system_score_codex":0.00022520422,"about_ca_system_score_gemma":0.0012512155,"threshold_uncertainty_score":0.9995903},"labels":[],"label_agreement":null},{"id":"W2952313717","doi":"10.1142/s1793830911001280","title":"AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS","year":2011,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Genome Rearrangement Algorithms","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":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Permutation (music); Sorting; Mathematics; Combinatorics; Sequence (biology); Interval (graph theory); Class (philosophy); Identity (music); Discrete mathematics; Computer science; Algorithm; Physics","score_opus":0.01799824759812478,"score_gpt":0.2727716805417889,"score_spread":0.2547734329436641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952313717","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.19780862,0.0036075788,0.79038745,0.000067533845,0.00006294441,0.0020359263,0.0021755872,0.00004657413,0.0038077557],"genre_scores_gemma":[0.8742527,0.0023969715,0.11536528,0.00005477944,0.0002765611,0.0013655555,0.004520497,0.00013969495,0.0016279725],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828625,0.00003631175,0.000622612,0.0006336694,0.00017958424,0.00024159555],"domain_scores_gemma":[0.99817586,0.000029906856,0.00059825013,0.0009256021,0.00015051062,0.00011985329],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036191352,0.00033021646,0.00058548315,0.00017558766,0.0001229307,0.000054142365,0.00029090207,0.00028340865,0.000055431978],"category_scores_gemma":[0.000031217318,0.0003192465,0.00033055578,0.00027298418,0.0001271615,0.0000034643062,0.00060692185,0.00018860372,0.0000038947496],"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.00013000547,0.007281496,0.008586027,0.01666132,0.09429369,0.00019375695,0.020953927,0.012521421,0.5960395,0.033273958,0.011079062,0.19898584],"study_design_scores_gemma":[0.0061770305,0.0016467982,0.0022295928,0.001140071,0.06051506,0.0009018341,0.011868405,0.53342247,0.22698799,0.08087213,0.06078034,0.013458245],"about_ca_topic_score_codex":0.0000745569,"about_ca_topic_score_gemma":0.000010374876,"teacher_disagreement_score":0.67644405,"about_ca_system_score_codex":0.0000131310535,"about_ca_system_score_gemma":0.000039798266,"threshold_uncertainty_score":0.999926},"labels":[],"label_agreement":null},{"id":"W2953949806","doi":"10.1093/bioinformatics/btz343","title":"Large-scale mammalian genome rearrangements coincide with chromatin interactions","year":2019,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Breakpoint; Chromosomal rearrangement; Biology; Genome; Chromatin; Chromosome; Genetics; Gene rearrangement; Computational biology; Gene; Gene duplication; Karyotype","score_opus":0.006863780160027628,"score_gpt":0.22537573313091283,"score_spread":0.21851195297088521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953949806","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.9610608,0.000066812034,0.008326279,0.00009915113,0.00020794928,0.00060611696,0.00008961514,0.00003873124,0.029504538],"genre_scores_gemma":[0.9376072,0.000054868233,0.04991502,0.0004912926,0.00019386469,0.00004993744,0.000996749,0.000055727283,0.010635301],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989422,0.000017652921,0.00029052192,0.0001807251,0.0002215969,0.00034733603],"domain_scores_gemma":[0.9991536,0.000004651696,0.0001500143,0.0005098506,0.00008209071,0.00009977149],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015505741,0.00018621807,0.00015626369,0.000073416435,0.00007766414,0.000051634725,0.0002192224,0.00007581233,0.0005106963],"category_scores_gemma":[0.000008627127,0.0001593664,0.000064906715,0.00012276275,0.00003110399,0.000019724726,0.00013432273,0.00008815944,0.00096056465],"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.00064624526,0.0011188817,0.064787775,0.001585668,0.0014772766,0.000027992339,0.011352365,0.0015513527,0.8765152,0.00024290162,0.033239037,0.007455305],"study_design_scores_gemma":[0.0054880623,0.0017877091,0.0383356,0.00012253052,0.00013146832,0.00017502581,0.011443297,0.009371596,0.033511993,0.000028788983,0.89820695,0.0013969927],"about_ca_topic_score_codex":0.0000055673554,"about_ca_topic_score_gemma":0.00004384368,"teacher_disagreement_score":0.8649679,"about_ca_system_score_codex":0.000034909815,"about_ca_system_score_gemma":0.000047527596,"threshold_uncertainty_score":0.9998173},"labels":[],"label_agreement":null},{"id":"W2963428252","doi":"10.1007/978-3-319-21840-3_51","title":"Swapping Colored Tokens on Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 British Columbia","funders":"","keywords":"Computer science; Colored; Programming language; Theoretical computer science","score_opus":0.022237511735712326,"score_gpt":0.2514341319779747,"score_spread":0.2291966202422624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963428252","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.009463439,0.0028332158,0.94036394,0.0006167641,0.0030731368,0.0011124949,0.000039037935,0.000079006815,0.042418946],"genre_scores_gemma":[0.85901064,0.00049468584,0.12383197,0.004207213,0.0030232,0.000044235498,0.00030656415,0.00022065634,0.008860811],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980242,0.00001607058,0.00021992337,0.0008680485,0.00047866127,0.0003930522],"domain_scores_gemma":[0.9989062,0.000025507532,0.000115655195,0.0006524756,0.00017368128,0.00012649871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039804776,0.00032602242,0.00025223455,0.00028717425,0.000087547785,0.00007614088,0.00074787455,0.0003043226,0.000026085832],"category_scores_gemma":[0.000052758493,0.00030416038,0.000093006616,0.0001457018,0.00036997805,0.0000044115923,0.00041919368,0.0002948848,0.000049413327],"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.00019546285,0.00018708668,0.0003827624,0.00014621307,0.0002260509,0.00022412644,0.00090102217,0.06380818,0.1065477,0.0042052665,0.0034453268,0.8197308],"study_design_scores_gemma":[0.00551861,0.008850598,0.0011191904,0.0016083294,0.00015728462,0.00031402626,0.0000039993947,0.042808726,0.14028937,0.2632594,0.52847415,0.007596278],"about_ca_topic_score_codex":0.0000049819087,"about_ca_topic_score_gemma":0.000030073392,"teacher_disagreement_score":0.8495472,"about_ca_system_score_codex":0.00009071711,"about_ca_system_score_gemma":0.00024750494,"threshold_uncertainty_score":0.99994105},"labels":[],"label_agreement":null},{"id":"W2963443301","doi":"10.1007/978-3-319-43681-4_9","title":"The Gene Family-Free Median of Three","year":2016,"lang":"en","type":"book-chapter","venue":"Infoscience (Ecole Polytechnique Fédérale de Lausanne)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University","funders":"","keywords":"Genome; Adjacency list; Similarity (geometry); Gene family; Computer science; Breakpoint; Computational biology; Comparative genomics; Graph; Gene prediction; Gene; Sequence (biology); Genomics; Genetics; Biology; Algorithm; Theoretical computer science; Artificial intelligence; Image (mathematics)","score_opus":0.013052179550391256,"score_gpt":0.22672466204799427,"score_spread":0.213672482497603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963443301","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071181953,0.009455568,0.047529865,0.0026329246,0.0015954288,0.0035627612,0.0012550458,0.0002656066,0.9265846],"genre_scores_gemma":[0.04855555,0.020343412,0.04115836,0.0019594731,0.0030596536,0.00091171707,0.00025572968,0.0005515798,0.8832045],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974456,0.00003250468,0.00059440406,0.0006548109,0.0005593392,0.00071334466],"domain_scores_gemma":[0.997029,0.00006254926,0.0005013075,0.0019553187,0.00023751713,0.00021427576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083161495,0.00045878752,0.0003807508,0.00017011256,0.00023255903,0.000056787336,0.0023127582,0.0006901873,0.00006826054],"category_scores_gemma":[0.00017346341,0.00034672196,0.0002857842,0.000089617024,0.001034934,0.00001257502,0.00087505544,0.00029660176,0.000048806734],"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.00008150279,0.00004313136,0.00048785267,0.0000672627,0.00015932896,0.000026529702,0.000046916837,0.0000078076155,0.89270574,0.029343966,0.018193442,0.05883653],"study_design_scores_gemma":[0.0006135328,0.00075601746,0.00070024375,0.00028312526,0.00007147444,0.000047024732,0.000016910826,0.00004467161,0.3559758,0.04418621,0.596287,0.001017962],"about_ca_topic_score_codex":0.000033525816,"about_ca_topic_score_gemma":0.0003216039,"teacher_disagreement_score":0.5780936,"about_ca_system_score_codex":0.00008699711,"about_ca_system_score_gemma":0.0004887928,"threshold_uncertainty_score":0.9998985},"labels":[],"label_agreement":null},{"id":"W2964468345","doi":"10.1186/s13015-019-0153-8","title":"A branching process for homology distribution-based inference of polyploidy, speciation and loss","year":2019,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inference; Genome; Biology; Gene; Branching process; Computational biology; Divergence (linguistics); Evolutionary biology; Genetics; Mathematics; Computer science; Statistics; Artificial intelligence","score_opus":0.010480602920940392,"score_gpt":0.30435643497677517,"score_spread":0.2938758320558348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964468345","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.5632573,0.00047220368,0.43472585,0.00012821548,0.00016431154,0.00084158167,0.00037915516,0.00000953638,0.000021891608],"genre_scores_gemma":[0.98882645,0.000032315944,0.008127507,0.00013512,0.00010550555,0.00021337387,0.002475225,0.000031098898,0.000053411277],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987095,0.000050517992,0.00029889212,0.0005120881,0.00007201343,0.00035697024],"domain_scores_gemma":[0.99912745,0.000067037465,0.00019710162,0.0002877356,0.00025890232,0.00006176394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024208889,0.00020463855,0.00029978176,0.00006934174,0.00005710179,0.000010188719,0.00019649255,0.00026793845,0.000007741454],"category_scores_gemma":[0.00018985312,0.0002062703,0.00013387785,0.000099490295,0.0001394985,0.000004994067,0.00005868919,0.00006221517,0.0000019376516],"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.00027048725,0.00013799315,0.019038165,0.0002900008,0.00020745439,0.0000010462667,0.00004471116,0.00031675954,0.9666096,0.0032998142,0.00003315112,0.009750791],"study_design_scores_gemma":[0.006724248,0.004636963,0.0044998378,0.00004855981,0.00014643301,0.000023405675,0.00008940699,0.01154832,0.94969857,0.01011034,0.01164261,0.00083132327],"about_ca_topic_score_codex":0.000014846252,"about_ca_topic_score_gemma":0.0000061217875,"teacher_disagreement_score":0.42659834,"about_ca_system_score_codex":0.000016626287,"about_ca_system_score_gemma":0.000110659705,"threshold_uncertainty_score":0.8411459},"labels":[],"label_agreement":null},{"id":"W2965995818","doi":"10.1186/s13015-019-0150-y","title":"A cubic algorithm for the generalized rank median of three genomes","year":2019,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Canadian Institutes of Health Research; Fundação de Amparo à Pesquisa do Estado de São Paulo; Genome Canada; Alfred P. Sloan Foundation","keywords":"Genome; Linear subspace; Heuristics; Time complexity; Combinatorics; Rank (graph theory); Matrix (chemical analysis); Computer science; Algorithm; Omega; Polynomial; Upper and lower bounds; Mathematics; Mathematical optimization; Biology; Pure mathematics; Physics; Genetics","score_opus":0.014778039241469792,"score_gpt":0.2761304000805498,"score_spread":0.26135236083908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965995818","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.06969948,0.011399888,0.91274714,0.0006622706,0.0011080909,0.0036969993,0.000533474,0.000028465362,0.00012416995],"genre_scores_gemma":[0.2516938,0.0022236055,0.7307538,0.0018993083,0.0021217023,0.0037541704,0.004693109,0.00044842926,0.0024121092],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978553,0.00008040982,0.00049710216,0.0007323525,0.00016069488,0.0006741312],"domain_scores_gemma":[0.9983023,0.00012798524,0.00025600923,0.0008899378,0.00031891596,0.00010488266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057581393,0.0003719539,0.0005051466,0.000117083866,0.00011550045,0.000019573827,0.00073921157,0.0003660994,0.000050984214],"category_scores_gemma":[0.000075709155,0.00028638064,0.00055824936,0.00017412197,0.00023518616,0.0000049513533,0.00019892493,0.0001038174,0.00001586482],"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.0001202136,0.00007871547,0.00046022097,0.000056131354,0.0008902061,0.0000012208684,0.00003883112,0.00009206147,0.75624883,0.0013442955,0.00038706514,0.2402822],"study_design_scores_gemma":[0.011649076,0.0041985405,0.00045825093,0.000024386605,0.00053645315,0.00005011141,0.00017048593,0.049240932,0.6271867,0.011423257,0.29378346,0.0012783329],"about_ca_topic_score_codex":0.000045466695,"about_ca_topic_score_gemma":0.000025094281,"teacher_disagreement_score":0.29339638,"about_ca_system_score_codex":0.000022646589,"about_ca_system_score_gemma":0.00012877284,"threshold_uncertainty_score":0.9999588},"labels":[],"label_agreement":null},{"id":"W2976303698","doi":"10.1186/s13015-020-00171-4","title":"Evolution through segmental duplications and losses: a Super-Reconciliation approach","year":2020,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"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; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Data science","score_opus":0.02459881913070271,"score_gpt":0.2817939826194368,"score_spread":0.25719516348873406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976303698","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.17415662,0.0019074085,0.8213707,0.0009958174,0.00009499831,0.00089526386,0.00017228715,0.000037696518,0.0003691826],"genre_scores_gemma":[0.8747342,0.0001670532,0.12037965,0.0012711302,0.00039095653,0.00042086717,0.0025035534,0.00005222281,0.000080371516],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986123,0.00006344821,0.00024559707,0.00067793694,0.000079017715,0.00032168932],"domain_scores_gemma":[0.99941957,0.000011851538,0.000085373555,0.0002574649,0.00011229457,0.000113472364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011841578,0.00021794575,0.00019983889,0.00003340186,0.00012238054,0.00002351437,0.00018534392,0.00023047488,0.000008275613],"category_scores_gemma":[0.000087637054,0.00022547337,0.00011668024,0.00013541177,0.00014205855,0.000009632851,0.0001335154,0.00007869864,0.000009975574],"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.000050662482,0.00008113417,0.0011013553,0.000045644083,0.00015972283,8.497879e-7,0.00017982915,0.0000755735,0.989991,0.0036128757,0.0004714923,0.004229864],"study_design_scores_gemma":[0.01262431,0.0078109493,0.0041110944,0.000026417581,0.00061334495,0.00023479019,0.0024405748,0.05840942,0.6762274,0.012789918,0.2215699,0.0031418677],"about_ca_topic_score_codex":0.000026344056,"about_ca_topic_score_gemma":0.0000028071333,"teacher_disagreement_score":0.7009911,"about_ca_system_score_codex":0.00003091088,"about_ca_system_score_gemma":0.00005976975,"threshold_uncertainty_score":0.91945374},"labels":[],"label_agreement":null},{"id":"W2998682161","doi":"10.1186/s12859-019-3293-4","title":"Rearrangement analysis of multiple bacterial genomes","year":2019,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"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":"National Institute for Basic Biology; Institute of Genetics; National Cancer Institute; National Bioscience Database Center; Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Genome; Computational biology; Bacterial genome size; DNA microarray; Biology; Computer science; Genetics; Gene; Gene expression","score_opus":0.011779181864968055,"score_gpt":0.22678324183369095,"score_spread":0.2150040599687229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998682161","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.98531574,0.00015893132,0.010391007,0.000009412275,0.00021156065,0.00036090004,0.000096530726,0.000011928515,0.00344399],"genre_scores_gemma":[0.89287436,0.00019879594,0.1037493,0.00007701505,0.00012965134,0.000019056595,0.0014723429,0.000026011234,0.001453487],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990773,0.0000197155,0.0003808504,0.00013762226,0.00018644871,0.00019806645],"domain_scores_gemma":[0.9991735,0.000013125203,0.00018666242,0.00049438723,0.0000794068,0.00005289709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019052728,0.0001310098,0.00024688276,0.00017631316,0.000021519074,0.00001872387,0.00020455151,0.000094323754,0.00027588563],"category_scores_gemma":[0.00002662732,0.00011954566,0.00020022507,0.0002859056,0.000032632015,0.000006527774,0.00012876837,0.000033908036,0.000090941365],"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.00027781274,0.00022702357,0.4697801,0.000563244,0.0037964918,4.9329395e-7,0.0010692999,0.009005863,0.5041354,0.00010521423,0.0016629009,0.009376211],"study_design_scores_gemma":[0.0066964007,0.0014863829,0.26240185,0.00004736423,0.0023668716,0.0000058022874,0.002618462,0.39619532,0.11325571,0.00002534195,0.21336025,0.0015402258],"about_ca_topic_score_codex":0.000008427372,"about_ca_topic_score_gemma":0.000038888666,"teacher_disagreement_score":0.39087966,"about_ca_system_score_codex":0.000013819619,"about_ca_system_score_gemma":0.00004369099,"threshold_uncertainty_score":0.48749304},"labels":[],"label_agreement":null},{"id":"W3016609671","doi":"10.1186/s12864-020-6612-2","title":"Operon-based approach for the inference of rRNA and tRNA evolutionary histories in bacteria","year":2020,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Operon; Genome; Gene; Biology; Inference; Transfer RNA; Identification (biology); Computational biology; Genetics; Evolutionary biology; Ribosomal RNA; Computer science; RNA; Artificial intelligence","score_opus":0.032078327823401614,"score_gpt":0.23679383645061686,"score_spread":0.20471550862721524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016609671","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.8633202,0.0029210774,0.13261132,0.0002831268,0.00007285421,0.00058432296,0.00007732807,0.0000051231723,0.00012466664],"genre_scores_gemma":[0.9560119,0.00008957704,0.04354187,0.00009242983,0.00008002047,0.000045319975,0.00009150517,0.000011839222,0.000035540812],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995169,0.000020235486,0.00013728483,0.00017885178,0.000041772768,0.000104922474],"domain_scores_gemma":[0.9997125,0.000024689412,0.00005201513,0.00014402499,0.000034132707,0.000032607044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008745881,0.00008051535,0.00009887159,0.000014020358,0.00003156271,0.0000078453295,0.00014467533,0.000055437966,0.000003517078],"category_scores_gemma":[0.000064611806,0.00006782607,0.000035850593,0.000039890034,0.00006857695,0.0000018162159,0.0000658206,0.000033232387,3.537673e-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.0003722049,0.000076245306,0.026279772,0.00024060743,0.000044407254,2.1425859e-7,0.00064273126,0.009003355,0.96070284,0.0001507252,0.00040633476,0.0020805371],"study_design_scores_gemma":[0.010642266,0.0024607992,0.13708593,0.000030494704,0.00022198536,0.000007709794,0.003235019,0.37346688,0.25970167,0.0002738945,0.21129532,0.0015780556],"about_ca_topic_score_codex":0.000013824442,"about_ca_topic_score_gemma":0.000013275845,"teacher_disagreement_score":0.7010012,"about_ca_system_score_codex":0.000021142696,"about_ca_system_score_gemma":0.00012665208,"threshold_uncertainty_score":0.27658668},"labels":[],"label_agreement":null},{"id":"W3021210550","doi":"10.1186/s13015-020-00169-y","title":"The distance and median problems in the single-cut-or-join model with single-gene duplications","year":2020,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"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; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Genome Canada","keywords":"Join (topology); Computer science; Gene duplication; Algorithm; Gene; Data mining; Genetics; Biology; Mathematics; Combinatorics","score_opus":0.0360477283324637,"score_gpt":0.26491551964678256,"score_spread":0.22886779131431886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021210550","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.0756222,0.0034877681,0.9011319,0.017138578,0.00007531593,0.0020761308,0.0001681935,0.000031193806,0.00026870612],"genre_scores_gemma":[0.9655007,0.00042752858,0.030152166,0.0021731989,0.00019376595,0.0008132875,0.0005333999,0.00006874539,0.00013716618],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984596,0.000106054045,0.00028062402,0.0005835151,0.00011887518,0.00045135702],"domain_scores_gemma":[0.99916375,0.00006582122,0.00011573502,0.00045798032,0.00009477088,0.00010196661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027084694,0.0002478381,0.00019647265,0.00003117519,0.00019631117,0.000056513436,0.0004751017,0.00015859361,0.0000012416348],"category_scores_gemma":[0.00012495084,0.0001427216,0.00007026335,0.00022612713,0.00033823863,0.0000053682465,0.00011591479,0.00013128592,0.000001821459],"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.00018932536,0.00016229699,0.00031415134,0.00003764236,0.00016349897,0.000009244377,0.0005669069,0.001360601,0.97629774,0.0015190137,0.00029520676,0.019084405],"study_design_scores_gemma":[0.011774066,0.016805159,0.0006847589,0.00008661173,0.0004695391,0.00040640114,0.002335441,0.14999932,0.4535613,0.016833935,0.3439086,0.0031348458],"about_ca_topic_score_codex":0.000009739445,"about_ca_topic_score_gemma":0.0002258115,"teacher_disagreement_score":0.8898786,"about_ca_system_score_codex":0.000017962258,"about_ca_system_score_gemma":0.000072012335,"threshold_uncertainty_score":0.58200186},"labels":[],"label_agreement":null},{"id":"W3022258227","doi":"10.1016/j.tcs.2018.03.016","title":"Swapping colored tokens on graphs","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"University of British Columbia; University of Saskatchewan","funders":"Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Colored; Security token; Combinatorics; Vertex (graph theory); Parameterized complexity; Bipartite graph; Mathematics; Time complexity; Discrete mathematics; Computer science; Graph","score_opus":0.008224338296942463,"score_gpt":0.2485510264796883,"score_spread":0.24032668818274583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022258227","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.88588846,0.000016244629,0.09765671,0.00027084196,0.00046665067,0.0001458341,0.0000020982736,0.00003072552,0.015522427],"genre_scores_gemma":[0.98718464,0.0000049405235,0.011689529,0.00071724236,0.00034724496,0.0000041143035,0.000003154002,0.000007979349,0.000041137682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987871,0.000035989546,0.00010945485,0.0004400211,0.00026618605,0.00036125805],"domain_scores_gemma":[0.9992947,0.000013604895,0.000025682652,0.0004013539,0.0001299136,0.00013476073],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00046067644,0.00010946241,0.00008325305,0.000070842085,0.00022876647,0.00006544404,0.0005450222,0.000046617028,0.000084798216],"category_scores_gemma":[0.00004285984,0.00009155743,0.000042261974,0.00029565237,0.0027469813,0.0000039965057,0.00032024263,0.000059859565,0.0001711025],"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.00008390301,0.00010601502,0.00024627266,0.000005729153,0.000019912537,0.000005452059,0.00020620445,0.000024003159,0.4215004,0.56062734,0.0009415682,0.016233167],"study_design_scores_gemma":[0.0011477191,0.006041272,0.0075393454,0.000047557045,0.000019977484,0.000046139256,0.0000365287,0.02670308,0.88840884,0.056881223,0.0123003265,0.00082801486],"about_ca_topic_score_codex":6.606565e-7,"about_ca_topic_score_gemma":4.8490364e-7,"teacher_disagreement_score":0.5037461,"about_ca_system_score_codex":0.00001259468,"about_ca_system_score_gemma":0.00004104435,"threshold_uncertainty_score":0.999967},"labels":[],"label_agreement":null},{"id":"W3037723652","doi":"10.1101/2020.06.25.170522","title":"<i>rearrvisr</i> : an R package to detect, classify, and visualize genome rearrangements","year":2020,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Genome Rearrangement Algorithms","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":"University of Calgary","funders":"Alberta Innovates; Alberta Innovates - Health Solutions","keywords":"Genome; Identification (biology); R package; Computer science; Software; Precision and recall; Relevance (law); Set (abstract data type); Computational biology; Data mining; Artificial intelligence; Gene; Biology; Genetics; Programming language","score_opus":0.017673707371746925,"score_gpt":0.24483885738298944,"score_spread":0.22716515001124252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037723652","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.9893121,0.0016403794,0.0056783436,0.00049444346,0.00056306145,0.0015028532,0.0005502371,0.00022170659,0.000036872978],"genre_scores_gemma":[0.9817798,0.00076552574,0.014531656,0.0011923938,0.0011052927,0.00030643336,0.000009068654,0.0002870578,0.000022768538],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960765,0.00021526705,0.00053113914,0.0019510344,0.00045178397,0.00077426195],"domain_scores_gemma":[0.9967911,0.0000104539495,0.00027555492,0.0017083196,0.00030165186,0.0009128791],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004854921,0.0007892369,0.0006207701,0.00020197307,0.00017051923,0.00031392506,0.00081771053,0.00065106153,0.000041811112],"category_scores_gemma":[0.00014669004,0.000909037,0.00015887649,0.00033645483,0.00011554235,0.000016199965,0.0016879893,0.0005079217,0.000115743205],"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.00007381856,0.000068960304,0.0011337706,0.000228391,0.0002402351,0.000042271993,0.000018305556,0.000011174212,0.997605,0.00001882058,0.00054482115,0.000014395631],"study_design_scores_gemma":[0.0014243006,0.00087170786,0.114992335,0.00015099999,0.00026271425,1.07718655e-7,0.000014657714,0.00008278553,0.74667764,0.000006702017,0.13330798,0.0022080769],"about_ca_topic_score_codex":0.00003664001,"about_ca_topic_score_gemma":0.000008598718,"teacher_disagreement_score":0.2509274,"about_ca_system_score_codex":0.00010285659,"about_ca_system_score_gemma":0.00027567506,"threshold_uncertainty_score":0.999336},"labels":[],"label_agreement":null},{"id":"W3119842321","doi":"10.1007/s11590-020-01677-x","title":"On the approximability of the fixed-tree balanced minimum evolution problem","year":2021,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"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":"Université Catholique de Louvain; University of British Columbia","keywords":"Tree (set theory); Mathematics; Binary number; Combinatorics; Set (abstract data type); Binary tree; Function (biology); Discrete mathematics; Computer science; Arithmetic; Biology","score_opus":0.005297643925768434,"score_gpt":0.18982560180343933,"score_spread":0.1845279578776709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119842321","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.75279063,0.00012160635,0.222461,0.020391624,0.00028082865,0.0007380476,0.000023159448,0.000016019525,0.0031770628],"genre_scores_gemma":[0.9878645,0.000014634278,0.010075984,0.0014717075,0.00006603252,0.000038326878,0.00008117874,0.000013755919,0.00037385704],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929345,0.00011800625,0.00013616735,0.00020186655,0.00014075203,0.00010973794],"domain_scores_gemma":[0.999371,0.000016944052,0.000087540015,0.00042419837,0.00008520091,0.000015146772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013473914,0.000080062084,0.000066272696,0.000011072491,0.00007125012,0.000012814999,0.00015521311,0.000048422036,0.000048562233],"category_scores_gemma":[0.000102104204,0.000052217267,0.000073182164,0.00015364998,0.00007385388,0.0000024940016,0.00007212792,0.00005324589,0.0000024218775],"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.000032419808,0.000087679735,0.0024554424,0.00002351078,0.000052083225,3.4481715e-7,0.000057670193,0.29749346,0.69335884,0.0003671993,0.0058039795,0.00026738612],"study_design_scores_gemma":[0.0030687272,0.00034080897,0.025538621,0.00010716996,0.00013734009,0.000012252255,0.00042187472,0.0932933,0.86869735,0.00065822323,0.006944876,0.00077947375],"about_ca_topic_score_codex":0.0000021105382,"about_ca_topic_score_gemma":0.0000033123804,"teacher_disagreement_score":0.23507388,"about_ca_system_score_codex":0.000023367691,"about_ca_system_score_gemma":0.00003799767,"threshold_uncertainty_score":0.21293584},"labels":[],"label_agreement":null},{"id":"W3122720315","doi":"10.3390/a14060169","title":"Sorting by Multi-Cut Rearrangements","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"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":"Deutscher Akademischer Austauschdienst; Providence Health Care","keywords":"Combinatorics; Parameterized complexity; String (physics); Multiset; Sorting; Permutation (music); Mathematics; Block (permutation group theory); Alphabet; Discrete mathematics; Algorithm; Physics","score_opus":0.01653608025971589,"score_gpt":0.2673613106534354,"score_spread":0.2508252303937195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122720315","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.8563374,0.018293362,0.10248299,0.0015267291,0.0023048997,0.0010640892,0.00028871527,0.00023499959,0.01746677],"genre_scores_gemma":[0.7124993,0.003074442,0.16528307,0.0031464202,0.002237494,0.0002630086,0.004735826,0.0003609178,0.1083995],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984765,0.00006409003,0.0002590993,0.0005481611,0.00022964847,0.00042252045],"domain_scores_gemma":[0.9991589,0.00000671347,0.00008622957,0.00047356967,0.00014731867,0.00012725717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018362825,0.00020255835,0.00017261706,0.000030088147,0.0001167213,0.00005198853,0.00020740421,0.00013872545,0.00016250112],"category_scores_gemma":[0.000081657054,0.00021871304,0.00011403793,0.00015439291,0.0000469462,0.0000056577214,0.00021464407,0.00010638619,0.00013590985],"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.000008824631,0.00023280733,0.002755881,0.000020200374,0.00019922295,0.000061361796,0.00007195386,0.000013289249,0.9402368,0.0000085429865,0.019124847,0.03726624],"study_design_scores_gemma":[0.0022434436,0.00015930692,0.0015230284,0.000021000858,0.000056385645,0.00008233418,0.00035082258,0.0009736693,0.65529007,0.000051018007,0.3386182,0.00063073507],"about_ca_topic_score_codex":0.000021025544,"about_ca_topic_score_gemma":0.000020355556,"teacher_disagreement_score":0.31949335,"about_ca_system_score_codex":0.000021263015,"about_ca_system_score_gemma":0.00006137412,"threshold_uncertainty_score":0.89188594},"labels":[],"label_agreement":null},{"id":"W3151350767","doi":"10.1007/978-3-642-16181-0_21","title":"Consistency of Sequence-Based Gene Clusters","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"Simon Fraser University","funders":"","keywords":"Consistency (knowledge bases); Gene cluster; Gene; Genome; Computational biology; Completeness (order theory); Sequence (biology); Genomics; Biology; Set (abstract data type); Cluster (spacecraft); Comparative genomics; Genetics; Gene sequence; Evolutionary biology; Computer science; Mathematics; Artificial intelligence; Phylogenetic tree","score_opus":0.016975422149013188,"score_gpt":0.24131757281208133,"score_spread":0.22434215066306815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151350767","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.007822099,0.00067356444,0.98767775,0.0002162064,0.0009856111,0.00039565135,0.00003527742,0.000015138065,0.0021786976],"genre_scores_gemma":[0.5806397,0.00009357478,0.41688457,0.0010535653,0.00061537605,0.000010167243,0.00011833842,0.00006203139,0.00052266306],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99824136,0.000014547383,0.00031215395,0.0007356873,0.000383224,0.00031302162],"domain_scores_gemma":[0.99867314,0.00003642482,0.00020681738,0.0007884086,0.0002084441,0.00008675808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003383207,0.00029066342,0.00029136162,0.00024230866,0.000070469105,0.00003513443,0.00079418486,0.00039107978,0.000031724718],"category_scores_gemma":[0.000051488776,0.00027473562,0.0001224108,0.00011452559,0.0010766577,0.000003978514,0.0002987033,0.00032494793,0.000007177574],"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.000023032248,0.000033343684,0.0002378562,0.00008308474,0.000030995692,0.000025664138,0.00007349145,0.007878417,0.8680592,0.000105393505,0.000009982927,0.1234395],"study_design_scores_gemma":[0.00090694445,0.00072031,0.00018245116,0.00022816416,0.000041253046,0.000060511396,2.7035094e-7,0.01631268,0.9661192,0.0074182115,0.006995995,0.0010139552],"about_ca_topic_score_codex":0.000011972689,"about_ca_topic_score_gemma":0.00006437603,"teacher_disagreement_score":0.5728176,"about_ca_system_score_codex":0.000041809242,"about_ca_system_score_gemma":0.0005666477,"threshold_uncertainty_score":0.9999705},"labels":[],"label_agreement":null},{"id":"W3160029165","doi":"10.3390/a14050152","title":"Predicting the Evolution of Syntenies—An Algorithmic Review","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"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 Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gene; Gene duplication; Gene family; Generalization; Extant taxon; Biology; Similarity (geometry); Order (exchange); Tree (set theory); Phylogenetic tree; Genetics; Computational biology; Evolutionary biology; Genome; Computer science; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.010713509042368726,"score_gpt":0.2546116138955052,"score_spread":0.24389810485313645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160029165","genre_codex":"review","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.42980513,0.4824841,0.06947684,0.0041015614,0.0024694873,0.002561992,0.0003064114,0.0001721903,0.0086222915],"genre_scores_gemma":[0.9080466,0.045724127,0.03461503,0.0016836672,0.002819993,0.0003108408,0.0010906716,0.00018825078,0.005520811],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99849355,0.00017388805,0.00035375045,0.00040467997,0.00029196835,0.00028217403],"domain_scores_gemma":[0.99864537,0.000019462315,0.00015426139,0.00075968757,0.00034407206,0.000077153134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004932361,0.0001735403,0.00023082165,0.00002880199,0.0001119834,0.000017306678,0.00033244735,0.000101032434,0.0000677852],"category_scores_gemma":[0.0001810297,0.00013841559,0.00014946828,0.00027833646,0.00010062881,0.000008870571,0.0001871148,0.00012654795,0.000016046022],"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.000041798074,0.0006926986,0.0093350075,0.0015865377,0.00094545085,0.00008471055,0.0004441796,0.0001847795,0.77754647,0.00055563595,0.0071486076,0.20143415],"study_design_scores_gemma":[0.005730233,0.0035734763,0.040036798,0.004054596,0.0020356039,0.003014932,0.009575222,0.02717264,0.59125537,0.0021951038,0.30774215,0.0036138443],"about_ca_topic_score_codex":0.00007850927,"about_ca_topic_score_gemma":0.000027421514,"teacher_disagreement_score":0.47824147,"about_ca_system_score_codex":0.00004068407,"about_ca_system_score_gemma":0.0001968274,"threshold_uncertainty_score":0.5644424},"labels":[],"label_agreement":null},{"id":"W3189850282","doi":"10.1142/s0219720021400096","title":"Small parsimony for natural genomes in the DCJ-indel model","year":2021,"lang":"en","type":"preprint","venue":"Journal of Bioinformatics and Computational Biology","topic":"Genome Rearrangement Algorithms","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":"Simon Fraser University","funders":"","keywords":"Indel; Genome; Phylogenetic tree; Tree (set theory); Maximum parsimony; Biology; Gene duplication; Computational biology; Gene; Evolutionary biology; Genetics; Computer science; Algorithm; Combinatorics; Mathematics","score_opus":0.026352074951493613,"score_gpt":0.26751098967713766,"score_spread":0.24115891472564405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189850282","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.79377955,0.007963656,0.19629681,0.0009439637,0.00041509914,0.00039844526,0.000095039184,0.0000021116268,0.0001053273],"genre_scores_gemma":[0.84584475,0.001152864,0.15116823,0.000810359,0.00024072711,0.00001668261,0.0007323035,0.000011090638,0.000022973385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988853,0.00005315211,0.0006348498,0.0001347122,0.00011453634,0.00017749675],"domain_scores_gemma":[0.99891,0.00007247556,0.0005146015,0.0001333807,0.00032955594,0.000039988117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055182807,0.00017689998,0.00029647932,0.00012141539,0.000051268256,0.000073429335,0.00032279943,0.00022763091,0.000001089985],"category_scores_gemma":[0.000051036935,0.0001247715,0.00018223662,0.000046244346,0.00007044049,0.000005498611,0.00024118621,0.0002839761,2.2632577e-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.0004766244,0.0005045582,0.0044094194,0.0011460162,0.0016405403,0.000020802303,0.005776588,0.854935,0.005897915,0.0030383323,0.0026965241,0.11945772],"study_design_scores_gemma":[0.0019433217,0.0006660376,0.0023613374,0.00008867993,0.000111272406,0.00024412418,0.0021324675,0.967231,0.00021253769,0.021935701,0.0026357614,0.00043778773],"about_ca_topic_score_codex":0.0000017608797,"about_ca_topic_score_gemma":0.000009392935,"teacher_disagreement_score":0.11901993,"about_ca_system_score_codex":0.00001880039,"about_ca_system_score_gemma":0.00030710406,"threshold_uncertainty_score":0.50880337},"labels":[],"label_agreement":null},{"id":"W3191052428","doi":"10.1186/1471-2105-12-s9-s5","title":"Fractionation statistics","year":2011,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Biology; Genome; Gene; Gene duplication; Genetics; Chromosome; Function (biology); Copy-number variation; Computational biology; Binomial distribution; Gene dosage; Statistics; Mathematics; Gene expression","score_opus":0.0331666259512709,"score_gpt":0.236926421764829,"score_spread":0.2037597958135581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191052428","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.011486044,0.000056371908,0.96234083,0.000006282182,0.00022925605,0.00017376879,0.000056641267,0.00002411412,0.02562667],"genre_scores_gemma":[0.032777306,0.00008091435,0.9650706,0.00015081631,0.00012279615,0.000015459023,0.00041558212,0.0000171781,0.0013493265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999465,0.000010590967,0.00019173304,0.00007727787,0.0001192603,0.00013616092],"domain_scores_gemma":[0.99957144,0.000004925366,0.00008855106,0.00020394854,0.00008289121,0.000048225775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001016951,0.000085548716,0.000057648052,0.000041153813,0.00004687176,0.000013757075,0.000105462976,0.000074810276,0.00013612057],"category_scores_gemma":[0.000049139384,0.00008281319,0.000029599165,0.000053316286,0.00003066147,0.0000071907693,0.00004782589,0.000040401374,0.00022480832],"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.00082022545,0.0020707054,0.20149815,0.0020550117,0.0012463334,0.000017322662,0.01310492,0.0016901859,0.056379624,0.0496559,0.30721346,0.36424816],"study_design_scores_gemma":[0.00471749,0.001963699,0.19720802,0.000048277263,0.00021956803,0.00013423724,0.0037368732,0.18896995,0.09213482,0.00606456,0.5023964,0.0024061014],"about_ca_topic_score_codex":0.000005169946,"about_ca_topic_score_gemma":0.000012891379,"teacher_disagreement_score":0.36184207,"about_ca_system_score_codex":0.000010344993,"about_ca_system_score_gemma":0.00004569055,"threshold_uncertainty_score":0.33770236},"labels":[],"label_agreement":null},{"id":"W3203344580","doi":"10.1089/cmb.2021.0468","title":"Escape from Parsimony of a Double-Cut-and-Join Genome Evolution Process","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","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":"University of Ottawa","funders":"","keywords":"Genome; Genome evolution; Join (topology); Mathematics; Tree (set theory); Combinatorics; Computer science; Biology; Evolutionary biology; Algorithm; Genetics; Gene","score_opus":0.014499664592782298,"score_gpt":0.27818453764423773,"score_spread":0.26368487305145544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203344580","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.9900828,0.0010958511,0.008064759,0.0004079208,0.00014809992,0.00007970161,0.000037855036,0.0000049298988,0.000078080055],"genre_scores_gemma":[0.9972265,0.0001513509,0.0020702924,0.000040448827,0.00025674558,0.0000027251347,0.00021732843,0.00000884019,0.00002579324],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9991924,0.000053392912,0.0003586561,0.00014155985,0.00012407372,0.0001298946],"domain_scores_gemma":[0.999215,0.000040148694,0.00031690177,0.00006861809,0.00030557215,0.00005376548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024976936,0.0000901901,0.00019083719,0.000141694,0.000031028165,0.000006422078,0.00013657117,0.00010180187,0.000018306733],"category_scores_gemma":[0.000034920366,0.00007964748,0.00007421153,0.00015028221,0.00008232598,0.000005382241,0.000057203608,0.000073901094,0.000008649372],"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.00083962403,0.0001609842,0.032899857,0.000056821176,0.0007139197,0.000013951881,0.00034522652,0.040774357,0.9195945,0.00093410286,0.0007404814,0.0029261291],"study_design_scores_gemma":[0.013151849,0.0043613366,0.7658941,0.00010425665,0.00023065488,0.00030380566,0.00096189795,0.007939657,0.042673558,0.14414081,0.019321267,0.00091677887],"about_ca_topic_score_codex":0.0000063803054,"about_ca_topic_score_gemma":0.0000027312694,"teacher_disagreement_score":0.876921,"about_ca_system_score_codex":0.000013789903,"about_ca_system_score_gemma":0.00011553174,"threshold_uncertainty_score":0.32479298},"labels":[],"label_agreement":null},{"id":"W3216894728","doi":"10.1142/s0219720021400084","title":"The monoploid chromosome complement of reconstructed ancestral genomes in a phylogeny","year":2021,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Genome Rearrangement Algorithms","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 Saskatchewan; University of Ottawa","funders":"","keywords":"Genome; Extant taxon; Phylogenetics; Ancestor; Complement (music); Ploidy","score_opus":0.011550101814240892,"score_gpt":0.2524576239165685,"score_spread":0.2409075221023276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216894728","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.99361175,0.0032698673,0.0025210297,0.0002440378,0.00012408158,0.00006606494,0.000028269153,7.5641503e-7,0.00013411984],"genre_scores_gemma":[0.9734649,0.0014979284,0.024829915,0.00007201597,0.00006159914,0.0000015180744,0.00005812878,0.0000034473615,0.000010570984],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99913776,0.0000429734,0.0005564419,0.000060254588,0.000081593054,0.00012095794],"domain_scores_gemma":[0.9992599,0.000047866462,0.00035366122,0.00006948264,0.00023324316,0.00003588434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024100252,0.00007347194,0.00016468538,0.00005451957,0.000043777534,0.000014931234,0.00010677975,0.000048439102,0.000007242775],"category_scores_gemma":[0.00003050967,0.000052955147,0.000056224977,0.0000850531,0.000118617725,0.0000054701336,0.000065267566,0.00006730675,4.986005e-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.0005024431,0.00049245055,0.15755594,0.0003284414,0.0016314954,0.000038114784,0.0016464415,0.013810238,0.44522625,0.013067073,0.00090943405,0.36479166],"study_design_scores_gemma":[0.019514307,0.008844026,0.617441,0.000333016,0.00022938657,0.005017853,0.010887678,0.078325294,0.08649759,0.075328946,0.09587673,0.0017041715],"about_ca_topic_score_codex":0.000001353681,"about_ca_topic_score_gemma":0.00000885214,"teacher_disagreement_score":0.45988506,"about_ca_system_score_codex":0.000010439403,"about_ca_system_score_gemma":0.00015656192,"threshold_uncertainty_score":0.21594483},"labels":[],"label_agreement":null},{"id":"W38163742","doi":"10.1007/978-3-319-12418-6_17","title":"Scaffolding of Ancient Contigs and Ancestral Reconstruction in a Phylogenetic Framework","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University","funders":"","keywords":"Genome; Contig; Ancient DNA; Phylogenetic tree; Sequence assembly; Evolutionary biology; DNA sequencing; Extant taxon; Phylogenetics; Genomics; Biology; Computational biology; Computer science; DNA; Genetics; Gene","score_opus":0.00798738282598577,"score_gpt":0.23732986533636347,"score_spread":0.2293424825103777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38163742","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.5494529,0.00019169542,0.4501402,0.00002648122,0.0001297112,0.00005372828,4.3740616e-7,0.0000016219494,0.0000031868626],"genre_scores_gemma":[0.87569433,0.00002337675,0.12410876,0.00008813479,0.000078314384,0.0000027680228,0.0000010132514,0.000003155027,1.4584187e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991853,0.000030938587,0.00013767695,0.00033382824,0.00011091554,0.00020131156],"domain_scores_gemma":[0.99968445,0.000025073849,0.0000516839,0.00016808118,0.00003517837,0.000035504785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036307058,0.000079007084,0.00010540345,0.00011216253,0.000029073199,0.000023301582,0.00017228189,0.000065954664,0.0000013505021],"category_scores_gemma":[0.00008575612,0.000075135256,0.000015999021,0.00033730982,0.0002665392,0.0000055139685,0.00010063354,0.00006417646,2.7361313e-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.0000049508762,0.00001248468,0.08866618,0.0000113946935,0.0000014528363,5.054018e-7,0.00010539204,0.0047379397,0.56062603,0.000012805753,1.92738e-7,0.3458207],"study_design_scores_gemma":[0.00056048256,0.00044230156,0.35643235,0.00015397265,0.0000033299962,0.00004913157,0.0000028822283,0.10103853,0.53812027,0.0028975017,0.000051549116,0.00024770782],"about_ca_topic_score_codex":0.000009680159,"about_ca_topic_score_gemma":0.000031732598,"teacher_disagreement_score":0.34557298,"about_ca_system_score_codex":0.000013978142,"about_ca_system_score_gemma":0.000035078418,"threshold_uncertainty_score":0.30639267},"labels":[],"label_agreement":null},{"id":"W407506873","doi":"10.71781/15466","title":"Cartographie génétique fine par le graphe de recombinaison ancestral","year":2003,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Art","score_opus":0.02072250828766926,"score_gpt":0.2910406362934385,"score_spread":0.27031812800576926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W407506873","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.9619156,0.006837865,0.0001919192,0.00031343466,0.0008953344,0.0010275447,0.00011406104,0.0000013907161,0.028702855],"genre_scores_gemma":[0.89879656,0.0033880973,0.03374436,0.00007525691,0.00033077356,0.00026941238,0.00739666,0.0001525347,0.055846356],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99751616,0.0002562116,0.00046590544,0.0009115126,0.00016885402,0.00068138354],"domain_scores_gemma":[0.99870306,0.000012735671,0.00031963456,0.0005764731,0.00016177206,0.00022631508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047779732,0.00050089514,0.00045743806,0.00012042019,0.0002546495,0.0002116238,0.00078449864,0.0008005615,0.0009131762],"category_scores_gemma":[0.00004930813,0.0005892716,0.00029548054,0.00033014774,0.00014645715,0.0000155728,0.00008269405,0.00034136281,0.00013070258],"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.00025637817,0.0008179541,0.0141045675,0.00019278214,0.00069505617,0.00006131681,0.0009945303,0.000057213245,0.8473253,0.000118470816,0.004298453,0.13107798],"study_design_scores_gemma":[0.001442281,0.00068500865,0.0046203155,0.00015476083,0.00020258829,0.000038540296,0.0010622105,0.000013340242,0.70936257,0.00022362589,0.28134617,0.0008485897],"about_ca_topic_score_codex":0.00070743926,"about_ca_topic_score_gemma":0.004801929,"teacher_disagreement_score":0.27704772,"about_ca_system_score_codex":0.00003826826,"about_ca_system_score_gemma":0.0006701098,"threshold_uncertainty_score":0.9998639},"labels":[],"label_agreement":null},{"id":"W4221035067","doi":"10.1186/s13015-022-00210-2","title":"Fast characterization of segmental duplication structure in multiple genome assemblies","year":2022,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Michael Smith Health Research BC; Canada Foundation for Innovation","keywords":"Computer science; Gene duplication; Characterization (materials science); Genome; Segmental duplication; Computational biology; Data mining; Biology; Genetics; Gene; Materials science","score_opus":0.010479508507829034,"score_gpt":0.2527592989903266,"score_spread":0.2422797904824976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221035067","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.93653554,0.00026900583,0.06121333,0.000082739025,0.00017325475,0.0007546977,0.00093998836,0.000010315263,0.00002113565],"genre_scores_gemma":[0.9838135,0.000036917165,0.0057524825,0.00012356591,0.00007697014,0.00031585887,0.009774067,0.000035975605,0.000070621085],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987458,0.000106698055,0.00031472647,0.000444435,0.00010683258,0.00028153797],"domain_scores_gemma":[0.9993873,0.000010050595,0.00018402282,0.00030752577,0.00007269258,0.000038396935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017308546,0.00017208346,0.00021032523,0.00016098659,0.000093353316,0.000007204369,0.00027462258,0.00012246887,0.000038429556],"category_scores_gemma":[0.000028670705,0.00019402393,0.00010141333,0.00020271302,0.00006522267,0.00000456022,0.00024039687,0.00009400321,9.3843954e-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.000063354186,0.00008536788,0.0027671407,0.000016345215,0.000058032107,0.0000012119422,0.0000719422,0.00033618094,0.99190104,0.00012350126,0.000004889654,0.0045709917],"study_design_scores_gemma":[0.0023297209,0.0012652512,0.019674718,0.000003422845,0.00003211703,0.000029239503,0.00023781974,0.0023673852,0.9607378,0.0004592745,0.012431967,0.00043125663],"about_ca_topic_score_codex":0.000017991451,"about_ca_topic_score_gemma":0.000010517536,"teacher_disagreement_score":0.055460848,"about_ca_system_score_codex":0.000049093665,"about_ca_system_score_gemma":0.00004880096,"threshold_uncertainty_score":0.7912066},"labels":[],"label_agreement":null},{"id":"W4229948048","doi":"10.7551/mitpress/2022.003.0011","title":"Genome Rearrangements","year":2000,"lang":"en","type":"book-chapter","venue":"Computational Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Biology; Genome; Evolutionary biology; Computational biology; Genetics; Gene","score_opus":0.011003411650683718,"score_gpt":0.25263264037600275,"score_spread":0.24162922872531903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229948048","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040853233,0.008219239,0.07067835,0.0003083057,0.00049189443,0.0010752577,0.0005255043,0.0000839355,0.9145322],"genre_scores_gemma":[0.20963292,0.001962233,0.032668706,0.004266974,0.002709556,0.00019972416,0.06410005,0.00083907595,0.68362075],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981277,0.000049403978,0.0003977329,0.0008484932,0.00021958437,0.0003570984],"domain_scores_gemma":[0.99903,0.000011523016,0.00018230236,0.0004914653,0.00015553428,0.00012918399],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011071501,0.00046968195,0.0003592577,0.00017926424,0.000080727055,0.000024489946,0.0004184114,0.00061358506,0.0011022873],"category_scores_gemma":[0.000012533752,0.00052410644,0.00027778046,0.00003179943,0.00019816434,0.0000017800209,0.00021756011,0.00021664896,0.0007574189],"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.00045499185,0.000269717,0.00014584162,0.00017148296,0.0047563286,0.00034820137,0.00007397182,0.014094787,0.5156622,0.4081106,0.0060554775,0.049856428],"study_design_scores_gemma":[0.0007562272,0.00045540518,0.0002290153,0.00002366421,0.00009234469,0.000057251415,0.0000014047143,0.000044087632,0.00028953227,0.3534071,0.64385974,0.00078419084],"about_ca_topic_score_codex":0.000002318166,"about_ca_topic_score_gemma":0.0000017256275,"teacher_disagreement_score":0.63780427,"about_ca_system_score_codex":0.000042314434,"about_ca_system_score_gemma":0.00013444146,"threshold_uncertainty_score":0.9998108},"labels":[],"label_agreement":null},{"id":"W4233853535","doi":"10.1089/106652700750050925","title":"Early Eukaryote Evolution Based on Mitochondrial Gene Order Breakpoints","year":2000,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":34,"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é du Québec à Montréal; Université de Montréal","funders":"","keywords":"Genome; Breakpoint; Phylogenetic tree; Eukaryote; Biology; Phylogenetics; Evolutionary biology; Gene; Genetics; Computational biology; Synteny; Phylogenetic network","score_opus":0.005654480235721184,"score_gpt":0.236491253388888,"score_spread":0.2308367731531668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233853535","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.94151145,0.00019841274,0.05647129,0.0005600732,0.00044975776,0.000105845356,0.000024320641,0.0000051797997,0.00067367364],"genre_scores_gemma":[0.97451526,0.000019759329,0.02370906,0.00041090106,0.0009946378,0.0000024932554,0.00012512907,0.00001426373,0.00020850271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9990246,0.00012326488,0.0003379013,0.00017291117,0.00017283505,0.00016848605],"domain_scores_gemma":[0.9992909,0.00003498361,0.00018082283,0.000110163935,0.0003077088,0.00007544098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015461557,0.00012357532,0.00016170646,0.00011478375,0.00005260652,0.0000127633975,0.00016630883,0.0001320325,0.00025583204],"category_scores_gemma":[0.00004528992,0.0001079931,0.00012033165,0.00010821726,0.00006107796,0.000004965706,0.000015336593,0.000115597126,0.000065095504],"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.0036457803,0.00075699657,0.009322753,0.000014391692,0.0005100394,0.000043886685,0.00006920593,0.5111493,0.4190677,0.00047799517,0.0058760573,0.049065933],"study_design_scores_gemma":[0.031377465,0.025888775,0.63740414,0.00014704872,0.0003132022,0.0013212889,0.000038324095,0.049697068,0.040006667,0.03890184,0.17275907,0.002145129],"about_ca_topic_score_codex":0.000004714375,"about_ca_topic_score_gemma":8.7534727e-7,"teacher_disagreement_score":0.6280814,"about_ca_system_score_codex":0.000034884928,"about_ca_system_score_gemma":0.00017303332,"threshold_uncertainty_score":0.4403831},"labels":[],"label_agreement":null},{"id":"W4236822633","doi":"10.21203/rs.2.23403/v1","title":"The Distance and Median Problems in the Single-Cut-or-Join model with Single-Gene Duplications","year":2020,"lang":"en","type":"preprint","venue":"Research Square","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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é de Sherbrooke; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Genome Canada","keywords":"Join (topology); Computer science; Mathematics; Combinatorics","score_opus":0.10306511559544625,"score_gpt":0.3429970566339653,"score_spread":0.23993194103851906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236822633","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.66108644,0.040363077,0.10149201,0.15800652,0.0003236481,0.023389231,0.0017189425,0.00017337572,0.013446786],"genre_scores_gemma":[0.99340785,0.002454086,0.0015387338,0.00007783096,0.00021655552,0.0010349931,0.00048223554,0.000054402957,0.0007333005],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99741596,0.00034851034,0.00025844257,0.0007342927,0.00069497956,0.0005478118],"domain_scores_gemma":[0.9983249,0.00012773776,0.000089829075,0.0010520379,0.00027145393,0.00013405041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010614558,0.00024261036,0.00018740456,0.00007493986,0.0003245978,0.00028276315,0.00086495455,0.00021344125,0.0000035548396],"category_scores_gemma":[0.0002773956,0.00013520723,0.00005697904,0.00033626417,0.0004349295,0.0000041183825,0.00084488495,0.00078370434,0.000005399838],"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.0017539117,0.0026160427,0.0088071665,0.00476173,0.0010583506,0.00019368094,0.016819077,0.041001786,0.84330475,0.0026956545,0.017711896,0.059275966],"study_design_scores_gemma":[0.011648747,0.01579661,0.022662545,0.004626811,0.00041860458,0.00031277526,0.024760732,0.20390457,0.11222379,0.06428267,0.53199756,0.0073645855],"about_ca_topic_score_codex":0.000048796308,"about_ca_topic_score_gemma":0.0022686769,"teacher_disagreement_score":0.73108095,"about_ca_system_score_codex":0.00007821415,"about_ca_system_score_gemma":0.00035618996,"threshold_uncertainty_score":0.55135906},"labels":[],"label_agreement":null},{"id":"W4244097892","doi":"10.1177/117693430600200028","title":"Genome Halving with an Outgroup","year":2006,"lang":"en","type":"article","venue":"Evolutionary Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"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 Ottawa","funders":"","keywords":"Genome; Sorghum; Ancestor; Biology; Evolutionary biology; Event (particle physics); Genomics; Reference genome; Genetics; Gene; History; Ecology","score_opus":0.005241479274325251,"score_gpt":0.19728826833299867,"score_spread":0.19204678905867342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244097892","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.9136191,0.0008859559,0.058061052,0.00013181526,0.00014307484,0.00044825647,0.00007398637,0.000096596705,0.026540188],"genre_scores_gemma":[0.875268,0.000036148223,0.12062639,0.00011657676,0.000457748,0.000023007724,0.0016841944,0.000031197087,0.0017567438],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99909675,0.000017184095,0.00024004174,0.00015986219,0.00020547764,0.00028070898],"domain_scores_gemma":[0.9993985,0.0000033904373,0.00009138617,0.0003502728,0.00008484561,0.00007158924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010755796,0.00015851144,0.000099391735,0.00006581614,0.00013592801,0.00003240975,0.00018385993,0.00008775294,0.000049641563],"category_scores_gemma":[0.0000064482815,0.00013899007,0.000044070377,0.00010982673,0.00007896501,0.000024516594,0.00007361503,0.000063143554,0.00007676899],"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.0013668552,0.0034267595,0.21084191,0.001075456,0.0012512597,0.000119143595,0.0022224514,0.067827106,0.6423472,0.010830567,0.0335988,0.025092462],"study_design_scores_gemma":[0.003715489,0.0033630622,0.72405785,0.000048566035,0.00012126593,0.00053569576,0.0014155789,0.047664385,0.004992157,0.0010594691,0.21095333,0.0020731443],"about_ca_topic_score_codex":0.000021436666,"about_ca_topic_score_gemma":0.000023341237,"teacher_disagreement_score":0.6373551,"about_ca_system_score_codex":0.00003493926,"about_ca_system_score_gemma":0.00006259154,"threshold_uncertainty_score":0.56678504},"labels":[],"label_agreement":null},{"id":"W4244198405","doi":"10.1016/j.ic.2021.104784","title":"An improved approximation algorithm for the minimum common integer partition problem","year":2021,"lang":"en","type":"article","venue":"Information and Computation","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiset; Partition (number theory); Mathematics; Partition problem; Combinatorics; Integer (computer science); Approximation algorithm; Cardinality (data modeling); Discrete mathematics; Algorithm; Computer science","score_opus":0.009168018734978614,"score_gpt":0.2545742650991512,"score_spread":0.2454062463641726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244198405","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.04265694,0.00010461553,0.9561564,0.00032359062,0.00009958234,0.00044040242,0.000020013289,0.00001809552,0.00018040853],"genre_scores_gemma":[0.936751,0.00008502136,0.0576246,0.0006649269,0.0001536191,0.0002052474,0.0044401693,0.000010226425,0.0000651645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999513,0.000029267085,0.0002001836,0.00009459247,0.000073556264,0.00008943493],"domain_scores_gemma":[0.9995445,0.000013573965,0.000099916935,0.00009874427,0.00021388655,0.000029389385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017469523,0.00007214755,0.000056136072,0.000025913572,0.00012818952,0.00012158952,0.00004504441,0.000057497884,0.0000038048029],"category_scores_gemma":[0.000011142933,0.00006035194,0.000028040888,0.000062002306,0.000020712474,0.000052725387,0.000021349146,0.00003334698,0.0000037733982],"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.000020764975,0.00003743283,0.000051864696,0.000039739076,0.000030815758,6.834093e-8,0.0005246653,0.0017813711,0.015324601,0.00021059497,0.00046709157,0.981511],"study_design_scores_gemma":[0.00078388344,0.00019700159,0.0010391037,0.0000062863414,0.000020505242,0.000010592564,0.0008710055,0.96926117,0.013228852,0.0007868974,0.013677327,0.00011734795],"about_ca_topic_score_codex":0.0000051100665,"about_ca_topic_score_gemma":0.000007765423,"teacher_disagreement_score":0.98139364,"about_ca_system_score_codex":0.000009596788,"about_ca_system_score_gemma":0.000034585435,"threshold_uncertainty_score":0.24610807},"labels":[],"label_agreement":null},{"id":"W4251061433","doi":"10.1177/117693430800400004","title":"The ABCs of MGR with DCJ","year":2008,"lang":"en","type":"article","venue":"Evolutionary Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":26,"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 Ottawa","funders":"","keywords":"Reciprocal; Genome; Computer science; Block (permutation group theory); Transposition (logic); Metric (unit); Algorithm; Computational biology; Theoretical computer science; Biology; Mathematics; Combinatorics; Genetics; Artificial intelligence; Gene","score_opus":0.007014163308789451,"score_gpt":0.19113191090578116,"score_spread":0.1841177475969917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251061433","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.9356852,0.004180887,0.026476452,0.0006118062,0.00033398956,0.0007479192,0.00007374892,0.000047531128,0.03184247],"genre_scores_gemma":[0.958021,0.001482439,0.03701197,0.00010347651,0.0001501835,0.00002174644,0.00016797133,0.000019048042,0.0030222002],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993251,0.000013324507,0.0002188472,0.0000708673,0.0002015345,0.00017032486],"domain_scores_gemma":[0.99942195,0.000012609364,0.00011013901,0.0003029714,0.00011226123,0.00004003665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009518684,0.00009325373,0.000076304736,0.000025118503,0.00020189148,0.0000048358365,0.00018264438,0.000054602206,0.000009036743],"category_scores_gemma":[0.000023728004,0.000060033482,0.00004621535,0.00009863998,0.00024116259,0.0000065482877,0.0000706364,0.00004970358,0.000027061096],"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.002053848,0.0014585141,0.22519702,0.00093314284,0.0029576493,0.00006013923,0.007115431,0.010038748,0.09451642,0.0134002045,0.5913007,0.05096815],"study_design_scores_gemma":[0.0031434908,0.002474099,0.1660363,0.000050953324,0.00008186914,0.000987153,0.0019434148,0.016454663,0.023879884,0.00046365912,0.7835113,0.00097324775],"about_ca_topic_score_codex":0.0000032244911,"about_ca_topic_score_gemma":0.0000032802277,"teacher_disagreement_score":0.19221053,"about_ca_system_score_codex":0.000012500835,"about_ca_system_score_gemma":0.00010601071,"threshold_uncertainty_score":0.24480945},"labels":[],"label_agreement":null},{"id":"W4285225080","doi":"10.2139/ssrn.4087991","title":"Whole Genome Alignment: Algorithmic Aspects and Current Challenges","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Guelph","funders":"","keywords":"Current (fluid); Genome; Computational biology; Computer science; Data science; Biology; Genetics; Engineering; Electrical engineering","score_opus":0.009513101580729192,"score_gpt":0.228827964580948,"score_spread":0.21931486300021882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285225080","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.5194373,0.47263876,0.003003988,0.0023429373,0.0006444108,0.00045954643,0.000044588443,0.00002855518,0.0013998955],"genre_scores_gemma":[0.9239843,0.074184574,0.00008586139,0.000052612042,0.00062017207,0.000040818097,0.000062810366,0.00003928991,0.000929569],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772614,0.0001190156,0.00018506232,0.00033142755,0.00028350484,0.0013548344],"domain_scores_gemma":[0.9995521,0.000004158431,0.00011003704,0.00020228486,0.000033571105,0.000097858756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092656724,0.00017238529,0.00013816229,0.00008634463,0.00034499908,0.000029946115,0.00027370895,0.000039115836,0.000035433575],"category_scores_gemma":[0.000009308594,0.0001779553,0.00008300711,0.000070994014,0.000037012072,0.00000551161,0.00028070516,0.0008256063,0.0000106926345],"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.00017463205,0.00065656373,0.0005242041,0.00005888742,0.0012195174,0.0000343432,0.0008657846,0.00037131898,0.466707,0.028638184,0.00045184934,0.5002977],"study_design_scores_gemma":[0.0030828288,0.0034821983,0.0023570415,0.000010102838,0.00011499478,0.0028416086,0.0057276958,0.00010947723,0.0015493403,0.06809928,0.911764,0.0008613822],"about_ca_topic_score_codex":0.0000036442027,"about_ca_topic_score_gemma":0.00003301093,"teacher_disagreement_score":0.9113122,"about_ca_system_score_codex":0.00032132273,"about_ca_system_score_gemma":0.00052120246,"threshold_uncertainty_score":0.72568065},"labels":[],"label_agreement":null},{"id":"W4301661837","doi":"","title":"Inferring Gene Orders from Gene Maps using the Breakpoint Distance","year":2006,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal; Computer Research Institute of Montréal; McGill University","funders":"","keywords":"Breakpoint; Gene; Computer science; Computational biology; Genetics; Biology; Chromosome","score_opus":0.008480156208416956,"score_gpt":0.20614083147653417,"score_spread":0.1976606752681172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301661837","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.72321385,0.0014574904,0.2687008,0.0012976849,0.00007796018,0.0001832213,0.00005640512,0.00003319097,0.004979403],"genre_scores_gemma":[0.95427436,0.00016379601,0.04293916,0.00007963377,0.00007186888,0.000016281283,0.0006678411,0.000031806565,0.0017552271],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980487,0.00086465344,0.00024393576,0.000392589,0.00019307372,0.0002570154],"domain_scores_gemma":[0.9982149,0.00009379729,0.00015378628,0.0010458973,0.00043359172,0.000058022186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010635268,0.00016323656,0.00012004185,0.000034813176,0.00027997603,0.00012639897,0.00050723273,0.00009472437,0.00004192329],"category_scores_gemma":[0.0001421013,0.00014746026,0.0000918265,0.00017422982,0.00014259294,0.000009109963,0.0003012925,0.00011579908,0.000011717516],"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.00000817936,0.00012290478,0.004917517,0.0000072424764,0.000044083983,0.0000020025263,0.00036879122,0.00032775776,0.9877161,0.0018608908,0.0004113501,0.0042132256],"study_design_scores_gemma":[0.00052656623,4.6892112e-7,0.0072968816,0.0000656879,0.00002911103,0.000009265078,0.00006872345,0.003565537,0.9427718,0.0009844474,0.044407904,0.00027363046],"about_ca_topic_score_codex":0.00224079,"about_ca_topic_score_gemma":0.0019518922,"teacher_disagreement_score":0.23106055,"about_ca_system_score_codex":0.000040239112,"about_ca_system_score_gemma":0.000065372806,"threshold_uncertainty_score":0.60132545},"labels":[],"label_agreement":null},{"id":"W4320817603","doi":"10.1093/bioinformatics/btad087","title":"Generalizations of the genomic rank distance to indels","year":2023,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"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; Foreign, Commonwealth and Development Office; Fundação de Amparo à Pesquisa do Estado de São Paulo; Medical Research Council; Alfred P. Sloan Foundation","keywords":"Indel; Rank (graph theory); Computer science; Genetics; Biology; Computational biology; Mathematics; Combinatorics; Single-nucleotide polymorphism; Gene; Genotype","score_opus":0.013477248210070252,"score_gpt":0.23895492266185675,"score_spread":0.2254776744517865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320817603","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.9626412,0.00009051235,0.033136457,0.00039782695,0.0003073256,0.00046878957,0.000114657814,0.000026198974,0.0028170662],"genre_scores_gemma":[0.9875557,0.00014439691,0.00878691,0.00043260033,0.00011212914,0.000030271895,0.00015493477,0.000021068869,0.0027620294],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946123,0.000010813602,0.00020446058,0.00006696488,0.00011476593,0.00014174829],"domain_scores_gemma":[0.99947655,0.0000035372002,0.00009241206,0.00034054715,0.000049407285,0.000037547332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010086171,0.00007010646,0.00006866316,0.00004098302,0.000057388203,0.000011300601,0.00024326431,0.000045126697,0.0000102837275],"category_scores_gemma":[0.00004902401,0.000053079864,0.000053425287,0.00029984908,0.00003142626,0.0000025416425,0.00017726599,0.00002403597,0.00007260018],"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.000044091084,0.000088057655,0.024829207,0.00036397285,0.00026233256,9.849475e-7,0.003932688,0.031773448,0.81868464,0.002912293,0.097169094,0.019939179],"study_design_scores_gemma":[0.0017304184,0.0003082269,0.15194131,0.00007647476,0.00008137737,0.000010574513,0.0012324058,0.033254273,0.23185015,0.00042241454,0.57822317,0.0008691934],"about_ca_topic_score_codex":0.000002897002,"about_ca_topic_score_gemma":0.00000998037,"teacher_disagreement_score":0.5868345,"about_ca_system_score_codex":0.000009722144,"about_ca_system_score_gemma":0.0000400052,"threshold_uncertainty_score":0.2164534},"labels":[],"label_agreement":null},{"id":"W4377079709","doi":"10.1109/tcbb.2023.3277733","title":"Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance","year":2023,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"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":"Medical Research Council; Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Sorting; Rank (graph theory); Genome; Biology; Computer science; Computational biology; Evolutionary biology; Mathematics; Genetics; Combinatorics; Algorithm; Gene","score_opus":0.016729817740307722,"score_gpt":0.2735063017091181,"score_spread":0.25677648396881037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377079709","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.17454152,0.00041678382,0.8231018,0.00091436127,0.0003471547,0.00042626896,0.00018230807,0.00003794351,0.00003186752],"genre_scores_gemma":[0.9823497,0.0009492629,0.015723176,0.00040541592,0.00011011843,0.00006848407,0.000251241,0.0000124072185,0.00013018107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933493,0.000017704875,0.0002421924,0.00015169499,0.00006252524,0.00019093731],"domain_scores_gemma":[0.9994324,0.00025050977,0.00008898544,0.00012323531,0.00006818706,0.000036683545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002632526,0.00012054634,0.000105113984,0.00006703198,0.00039129885,0.000036294925,0.00011712789,0.00008974548,0.0000033093904],"category_scores_gemma":[0.000034719505,0.00008984115,0.000048771108,0.0001003614,0.00017227183,0.000009002133,0.000013503277,0.00008389522,0.0000074889667],"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.0004209053,0.00011401355,0.005322993,0.00051329605,0.0009842862,0.0000019296206,0.0024889146,0.09546324,0.009775736,0.0008708703,0.0010452367,0.8829986],"study_design_scores_gemma":[0.003170738,0.00090736896,0.0103064235,0.00006730624,0.00016573929,0.00005585099,0.0020635722,0.946854,0.0027391503,0.007370258,0.025583727,0.0007158822],"about_ca_topic_score_codex":0.0000018115485,"about_ca_topic_score_gemma":0.0000097170705,"teacher_disagreement_score":0.8822827,"about_ca_system_score_codex":0.000007260127,"about_ca_system_score_gemma":0.000029248185,"threshold_uncertainty_score":0.3663616},"labels":[],"label_agreement":null},{"id":"W4382316216","doi":"10.1186/1471-2105-16-s19-s6","title":"Evolution of genes neighborhood within reconciled phylogenies: an ensemble approach","year":2015,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","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":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"Simon Fraser University; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Evolutionary biology; Computer science; Gene; Computational biology; Biology; Genetics","score_opus":0.0365057201472548,"score_gpt":0.2460932431510488,"score_spread":0.20958752300379402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382316216","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.52983415,0.0012382679,0.45510438,0.000007037355,0.00030516754,0.00053597754,0.00004538417,0.00003943773,0.012890183],"genre_scores_gemma":[0.69260556,0.0000318598,0.306597,0.000029745199,0.00017853596,0.00002219915,0.0002696235,0.000022411627,0.00024306962],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998921,0.0000462892,0.00043132337,0.00015795015,0.00022692361,0.00021654913],"domain_scores_gemma":[0.99891144,0.0000048556462,0.0002479558,0.00047520746,0.00021932044,0.00014123989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042774325,0.0001625996,0.00018397252,0.00007052039,0.000036937843,0.000021263111,0.00024292042,0.00016623396,0.000004244687],"category_scores_gemma":[0.00007977587,0.00014841714,0.00007279173,0.00013538353,0.00006932314,0.00001838458,0.00009503544,0.000054875938,0.000019545425],"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.0014381589,0.0025221007,0.15251374,0.0031756745,0.0011094493,0.0000032428404,0.023005677,0.09328416,0.65989554,0.006952097,0.009560427,0.04653972],"study_design_scores_gemma":[0.0050214804,0.0027791413,0.002715197,0.00003862822,0.0001656122,0.00009379724,0.021951267,0.8177098,0.14162906,0.0011687435,0.005523955,0.0012033231],"about_ca_topic_score_codex":0.000014282668,"about_ca_topic_score_gemma":0.000022366714,"teacher_disagreement_score":0.7244256,"about_ca_system_score_codex":0.000041985735,"about_ca_system_score_gemma":0.00027975146,"threshold_uncertainty_score":0.60522753},"labels":[],"label_agreement":null},{"id":"W4386468657","doi":"10.2139/ssrn.4564108","title":"Improved Block Rearrangement Algorithm","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Algorithm; Block (permutation group theory); Computer science; Mathematics; Combinatorics","score_opus":0.006399613239146773,"score_gpt":0.2335443410322673,"score_spread":0.2271447277931205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386468657","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.9557122,0.007419402,0.029920042,0.0022021406,0.0012874991,0.0007663305,0.000026737378,0.0001899012,0.0024757262],"genre_scores_gemma":[0.92482847,0.027926564,0.0022502707,0.00028404492,0.0029403,0.000067425324,0.00021726098,0.00015706131,0.04132858],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.996984,0.000059695725,0.00024063142,0.0003107732,0.00023459204,0.0021703127],"domain_scores_gemma":[0.9994019,0.000005298881,0.000101474514,0.0002874971,0.000094407136,0.0001093986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012625318,0.00018885852,0.00014121438,0.00012719021,0.0001781484,0.000046289504,0.00032478824,0.00011262422,0.000021560607],"category_scores_gemma":[0.000034060155,0.00017748213,0.00015343886,0.0002603842,0.000035750287,0.0000052530886,0.00012582028,0.00060715125,0.00014672248],"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.000075568256,0.00012233658,0.0005916177,0.000013143324,0.0009294837,0.000018604991,0.000100707744,0.000093329894,0.7157826,0.00089771894,0.0055499994,0.2758249],"study_design_scores_gemma":[0.015017526,0.0099989,0.0055368803,0.00007788603,0.0005040498,0.003636915,0.009862118,0.008929454,0.10878509,0.068944536,0.7648958,0.0038108178],"about_ca_topic_score_codex":0.000015567368,"about_ca_topic_score_gemma":0.00008841905,"teacher_disagreement_score":0.7593458,"about_ca_system_score_codex":0.00018313475,"about_ca_system_score_gemma":0.0006555916,"threshold_uncertainty_score":0.7237511},"labels":[],"label_agreement":null},{"id":"W4388490419","doi":"10.1186/s13015-023-00240-4","title":"Relative timing information and orthology in evolutionary scenarios","year":2023,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","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":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Stockholms Universitet; Deutsche Forschungsgemeinschaft","keywords":"Extant taxon; Combinatorics; Vertex (graph theory); Graph; Time complexity; Computer science; Biology; Mathematics; Theoretical computer science; Discrete mathematics; Evolutionary biology","score_opus":0.015933397475702864,"score_gpt":0.2869197491809849,"score_spread":0.270986351705282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388490419","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.8690407,0.0013398537,0.12625833,0.0010581745,0.0003945296,0.0011824849,0.00013496021,0.000079149926,0.00051180896],"genre_scores_gemma":[0.95331514,0.00064519775,0.040384892,0.0006632029,0.00016536332,0.0004951426,0.0039702575,0.000052949614,0.00030787237],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880505,0.00008135899,0.00029261023,0.00034910918,0.00006410106,0.0004077752],"domain_scores_gemma":[0.999518,0.000032280223,0.000088635774,0.00021214208,0.000088417575,0.000060567752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032346213,0.00017409706,0.0001838937,0.00028088913,0.00007894129,0.000011589787,0.00013341605,0.00028895368,0.0000052863006],"category_scores_gemma":[0.00018597172,0.00018229475,0.000072318864,0.0002718244,0.00013157792,0.000016306549,0.00018616521,0.00010227569,0.000032108375],"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.00036742564,0.00014605971,0.033146113,0.00016493081,0.0005223102,0.00006424625,0.0009610136,0.0016826491,0.782557,0.015208674,0.0023473876,0.16283219],"study_design_scores_gemma":[0.021657959,0.00818051,0.13932757,0.00014547695,0.0002976772,0.00062441966,0.0024942376,0.081748076,0.08400148,0.070400774,0.58666617,0.0044556744],"about_ca_topic_score_codex":0.000027501437,"about_ca_topic_score_gemma":0.000012991266,"teacher_disagreement_score":0.6985555,"about_ca_system_score_codex":0.000023905406,"about_ca_system_score_gemma":0.000063393716,"threshold_uncertainty_score":0.74337643},"labels":[],"label_agreement":null},{"id":"W4392250648","doi":"10.1007/978-981-97-0566-5_2","title":"Reasons to Fall (More) in Love with Combinatorial Reconfiguration","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Control reconfiguration; Computer science; Presentation (obstetrics); Field (mathematics); Operations research; Mathematics; Embedded system","score_opus":0.008346411241869746,"score_gpt":0.23288005987219013,"score_spread":0.22453364863032038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392250648","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.029108593,0.0014171359,0.9303947,0.0046846997,0.0054476094,0.0020520156,0.00005120219,0.000056808614,0.02678721],"genre_scores_gemma":[0.93400806,0.00011252071,0.057378236,0.0014083221,0.0023591893,0.000029059567,0.00015630794,0.00013308394,0.00441524],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982429,0.000010493119,0.0002108663,0.0008936359,0.00033180867,0.0003102543],"domain_scores_gemma":[0.9992588,0.000021730231,0.00006220051,0.00046847513,0.00009945625,0.00008932607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027073378,0.00028064803,0.00022186575,0.00031661318,0.000025968846,0.00011953828,0.00048027013,0.00024398064,0.000013518316],"category_scores_gemma":[0.00002867219,0.0002458002,0.00004619644,0.00022963251,0.00017775386,0.000006708402,0.00024698622,0.00030161432,0.00006981557],"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.0007541189,0.00036124268,0.0026333223,0.0005744291,0.00032339146,0.0009404657,0.009329271,0.09795691,0.12521917,0.01473162,0.0010845175,0.74609154],"study_design_scores_gemma":[0.011022997,0.017135255,0.0073872176,0.00854825,0.00033128797,0.0008614207,0.000031534724,0.06836746,0.23327419,0.31215617,0.3269156,0.013968627],"about_ca_topic_score_codex":0.000033981087,"about_ca_topic_score_gemma":0.0005018176,"teacher_disagreement_score":0.9048994,"about_ca_system_score_codex":0.00011976198,"about_ca_system_score_gemma":0.00024489235,"threshold_uncertainty_score":0.9999994},"labels":[],"label_agreement":null},{"id":"W4394741953","doi":"10.1002/9781394284252.ch5","title":"A Century of Genomic Rearrangements","year":2024,"lang":"en","type":"other","venue":"","topic":"Genome Rearrangement Algorithms","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":"Université du Québec à Montréal","funders":"","keywords":"Citation; Annotation; Genome; Genealogy; Biology; Philosophy; Art history; Genetics; Computer science; Art; Gene; History; Library science","score_opus":0.0067875243579550324,"score_gpt":0.23582319430339957,"score_spread":0.22903566994544453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394741953","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038882875,0.018972492,0.0001498036,0.000021508176,0.0005249157,0.00031475443,0.00011342617,0.00004323815,0.979471],"genre_scores_gemma":[0.0007511525,0.0029878763,0.0022008207,0.000044715714,0.00047352983,0.000017868617,0.00024072475,0.0005052105,0.9927781],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991781,0.000015581843,0.00015542416,0.00035859094,0.00012358637,0.0001686794],"domain_scores_gemma":[0.99943095,6.7995296e-7,0.00008235574,0.00042741554,0.00001548857,0.00004308024],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00006092762,0.00019340745,0.00018604778,0.0001337191,0.000004519121,0.000008883567,0.00019869991,0.00024497724,0.0031326103],"category_scores_gemma":[0.0000037180932,0.00017505379,0.0001226997,0.000047420453,0.000039625025,2.4339187e-7,0.00017874525,0.00006171778,0.0011036827],"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.0000054377656,0.000025733929,0.00002762951,0.00021674739,0.00034315826,0.000002973446,0.000009744614,1.7056904e-7,0.116944134,0.000044736644,0.8805244,0.0018551605],"study_design_scores_gemma":[0.0001789564,0.00006952978,0.000024011477,0.000053625867,0.00005742486,0.0000020856658,0.000021013955,7.236731e-7,0.0025801524,0.000020625172,0.99681634,0.00017551657],"about_ca_topic_score_codex":0.000055075554,"about_ca_topic_score_gemma":0.00003431191,"teacher_disagreement_score":0.11629196,"about_ca_system_score_codex":0.000008983365,"about_ca_system_score_gemma":0.000030810796,"threshold_uncertainty_score":0.9996741},"labels":[],"label_agreement":null},{"id":"W4394792605","doi":"10.1007/978-3-031-58072-7_10","title":"Sampling Gene Adjacencies and Geodesic Points of Random Genomes","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Genome; Geodesic; Set (abstract data type); Combinatorics; Breakpoint; Construct (python library); Mathematics; Gene; Biology; Computer science; Genetics; Geometry","score_opus":0.015875031682795904,"score_gpt":0.24092682373111507,"score_spread":0.22505179204831915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394792605","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.020464322,0.031308684,0.94548476,0.00018987118,0.0007604327,0.00045501735,0.000034992983,0.000021921682,0.001279975],"genre_scores_gemma":[0.6402041,0.0056496845,0.34933978,0.00056863436,0.0014379804,0.000018678138,0.00010422116,0.00014121298,0.0025357336],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984383,0.000009458852,0.00026587583,0.0007304792,0.0002791007,0.00027681515],"domain_scores_gemma":[0.9992815,0.000047643127,0.00010284921,0.0004066145,0.000095885494,0.00006550449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038860433,0.00027399036,0.00031124725,0.00025293644,0.000056431858,0.00007022258,0.00041621528,0.0001977058,0.00001242242],"category_scores_gemma":[0.000029899289,0.00024361462,0.00008426906,0.00010538279,0.00051193347,0.0000051977013,0.0005624335,0.00018982794,0.0000058390265],"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.000094499796,0.00003680888,0.00050186407,0.0005765253,0.00022674978,0.000045421617,0.0009089186,0.0113968905,0.40965775,0.0009835935,0.000027482236,0.57554346],"study_design_scores_gemma":[0.0054592993,0.0022615313,0.0015928632,0.0023275437,0.00040120137,0.0005280181,0.0000065604536,0.058219884,0.6341539,0.24718067,0.04323894,0.004629605],"about_ca_topic_score_codex":0.0000056159065,"about_ca_topic_score_gemma":0.000016281263,"teacher_disagreement_score":0.6197398,"about_ca_system_score_codex":0.000032509615,"about_ca_system_score_gemma":0.00013455076,"threshold_uncertainty_score":0.99343157},"labels":[],"label_agreement":null},{"id":"W4402992802","doi":"10.1007/s00453-024-01276-7","title":"Permutation-constrained Common String Partitions with Applications","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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é de Sherbrooke","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Combinatorics; Theory of computation; String (physics); Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Physics","score_opus":0.006847243086547082,"score_gpt":0.24767939474062836,"score_spread":0.24083215165408128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402992802","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.25156978,0.0047935788,0.7184628,0.0027989561,0.00037636768,0.002061107,0.00046258105,0.0004968687,0.018977938],"genre_scores_gemma":[0.9879607,0.00005427733,0.009729578,0.00007893435,0.00035657064,0.00032648075,0.0005616833,0.000034050467,0.00089775573],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992035,0.000019823756,0.00013896856,0.00031926122,0.00011750019,0.00020095846],"domain_scores_gemma":[0.9995813,0.000014992001,0.000023147759,0.0002562772,0.00005064812,0.00007364374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000733038,0.00012684599,0.000087723456,0.00006160695,0.000108697524,0.00007499799,0.00012096408,0.00006332312,0.00006269035],"category_scores_gemma":[0.0000041816193,0.00011531146,0.000053566542,0.00019831558,0.00008639695,0.0000064374976,0.000037911508,0.00008821825,0.00009846465],"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.00006695251,0.0004939358,0.00197086,0.0003591989,0.0015293419,0.0001223986,0.0006145311,0.00174997,0.41528678,0.028859721,0.009604628,0.5393417],"study_design_scores_gemma":[0.0015459748,0.00088942447,0.002443352,0.00015146406,0.00035697827,0.00041521896,0.0008677725,0.008317544,0.15090121,0.005583374,0.82713765,0.001390054],"about_ca_topic_score_codex":0.000008946865,"about_ca_topic_score_gemma":0.000016663915,"teacher_disagreement_score":0.817533,"about_ca_system_score_codex":0.000017836897,"about_ca_system_score_gemma":0.00008011136,"threshold_uncertainty_score":0.47022647},"labels":[],"label_agreement":null},{"id":"W4403377282","doi":"10.1112/jlms.70006","title":"Tubings, chord diagrams, and Dyson–Schwinger equations","year":2024,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"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; Canada Research Chairs; Simons Foundation","keywords":"Chord (peer-to-peer); Mathematics; Computer science","score_opus":0.01016424374496358,"score_gpt":0.24801442757112296,"score_spread":0.23785018382615938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403377282","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.9290247,0.009468313,0.05392996,0.006181188,0.0005013115,0.00026409043,0.0000079789,0.000016009282,0.0006064483],"genre_scores_gemma":[0.9858589,0.0006485181,0.011024769,0.00029441278,0.0005986221,0.0000055859828,0.0000022603483,0.000027866316,0.0015390705],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992386,0.00003568497,0.00025314584,0.000109619075,0.00022001987,0.00014292473],"domain_scores_gemma":[0.99956125,0.000064456086,0.00008269276,0.00015533713,0.00006623361,0.00007005136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047773967,0.00009801995,0.00013458656,0.000012716393,0.000077829434,0.000098300196,0.00018280148,0.00008704232,0.000035964702],"category_scores_gemma":[0.00014625028,0.000058425965,0.00031000786,0.00009333733,0.00008243002,0.000007964557,0.00012615984,0.00019281312,0.000010738518],"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.000038850478,0.00042809302,0.0021374838,0.0011145953,0.0017607383,0.000019206982,0.0031156708,0.00013221,0.88090146,0.013646768,0.06984025,0.026864665],"study_design_scores_gemma":[0.0055849934,0.0023128723,0.009736967,0.0026985677,0.0026939702,0.001840595,0.0032889997,0.043380216,0.18033127,0.18473388,0.56098944,0.0024082286],"about_ca_topic_score_codex":3.164869e-7,"about_ca_topic_score_gemma":3.704191e-7,"teacher_disagreement_score":0.7005702,"about_ca_system_score_codex":0.000021611979,"about_ca_system_score_gemma":0.00004226143,"threshold_uncertainty_score":0.23825417},"labels":[],"label_agreement":null},{"id":"W4403464505","doi":"10.1016/j.tcs.2024.114907","title":"Path partitions of phylogenetic networks","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"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; Division of Mathematical Sciences; National University of Singapore","keywords":"Phylogenetic tree; Path (computing); Mathematics; Computer science; Combinatorics; Theoretical computer science; Biology; Genetics; Computer network; Gene","score_opus":0.00600925611002742,"score_gpt":0.23862277593828973,"score_spread":0.2326135198282623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403464505","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.26759124,0.00076193194,0.7294924,0.000114975766,0.00035881993,0.00009687326,0.0000047111093,0.000022128832,0.0015568947],"genre_scores_gemma":[0.9905111,0.000049708644,0.009118809,0.000062001694,0.00022234351,0.0000054159505,0.0000059228046,0.0000075292273,0.000017149983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991318,0.000028510309,0.00012399322,0.00031074387,0.00017309417,0.00023185143],"domain_scores_gemma":[0.9995483,0.000016175074,0.000013940742,0.00027774434,0.00006005481,0.00008377343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036094117,0.00007836115,0.00007373793,0.000047986447,0.00006280065,0.000051290725,0.00032415413,0.0000375441,0.000048747585],"category_scores_gemma":[0.00001414381,0.00006491158,0.000049824528,0.00030952145,0.0013262987,0.0000032719172,0.00022634957,0.00005426538,0.00001672035],"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.000014884049,0.000103376864,0.0003608586,0.00006422115,0.000041158495,0.000012866407,0.00012654607,0.0044017783,0.3110556,0.63388604,0.00058390124,0.049348764],"study_design_scores_gemma":[0.00034483313,0.0013909471,0.004513015,0.00014034516,0.000053504482,0.000065475266,0.000017092709,0.7775579,0.16087341,0.0501466,0.004341592,0.00055526034],"about_ca_topic_score_codex":4.776735e-7,"about_ca_topic_score_gemma":1.7509731e-7,"teacher_disagreement_score":0.77315617,"about_ca_system_score_codex":0.0000067020865,"about_ca_system_score_gemma":0.00005346466,"threshold_uncertainty_score":0.48868027},"labels":[],"label_agreement":null},{"id":"W4413106099","doi":"10.55016/ojs/cdm.v4i1.61995","title":"{-1,2}-hypomorphy and hereditary hypomorphy coincide for posets","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Star product","score_opus":0.008793655662201274,"score_gpt":0.2777571475324041,"score_spread":0.26896349187020285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106099","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.4773568,0.0024668004,0.50247335,0.008013033,0.0002957155,0.0033985751,0.003700173,0.000109309985,0.0021862143],"genre_scores_gemma":[0.94345415,0.00007647934,0.053254575,0.00084852666,0.00041817193,0.00014297923,0.00091262255,0.00003633483,0.0008561493],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988871,0.000021203456,0.00027839857,0.000307013,0.00013480792,0.00037143938],"domain_scores_gemma":[0.99905115,0.000038717837,0.000079897545,0.00039008274,0.0002333226,0.00020680623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024594206,0.00020549865,0.00024258529,0.00006154317,0.0001737994,0.000052848663,0.00017736758,0.00011742076,0.000013502385],"category_scores_gemma":[0.00040612905,0.000195957,0.000104358165,0.0001107051,0.000057719448,0.000006268074,0.00008360972,0.000059790917,0.000022829248],"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.00016932098,0.00046798252,0.00014855358,0.00015067635,0.0003316849,0.000020534011,0.00045075783,0.00009702201,0.90262026,0.020466845,0.06835335,0.0067230146],"study_design_scores_gemma":[0.012854758,0.008931102,0.010246871,0.00040761477,0.0010348598,0.00076278904,0.0015404425,0.008292315,0.44155058,0.11700619,0.39334205,0.004030417],"about_ca_topic_score_codex":0.0000021483831,"about_ca_topic_score_gemma":0.0000049047576,"teacher_disagreement_score":0.46609735,"about_ca_system_score_codex":0.000031391766,"about_ca_system_score_gemma":0.000049023252,"threshold_uncertainty_score":0.7990895},"labels":[],"label_agreement":null},{"id":"W4417448051","doi":"10.64898/2025.12.15.694404","title":"On Deriving Synteny Blocks by Compacting Elements","year":2025,"lang":"","type":"article","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Genome Rearrangement Algorithms","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":"Simon Fraser University","funders":"","keywords":"Synteny; Genome; Block (permutation group theory); Breakpoint; Sequence (biology); Comparative genomics","score_opus":0.006094927196160357,"score_gpt":0.21699918882956304,"score_spread":0.21090426163340267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417448051","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.9855254,0.005782009,0.0050600553,0.0004774861,0.0015540547,0.0009642236,0.00022358696,0.00011222654,0.0003009112],"genre_scores_gemma":[0.99598885,0.00070462277,0.0017044891,0.0008991762,0.00031289688,0.000084975814,0.0000013265922,0.00013530646,0.00016837899],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99566376,0.0002120249,0.0008854297,0.0014985772,0.00046640748,0.0012738227],"domain_scores_gemma":[0.9972312,0.00007189164,0.00045067348,0.001453718,0.00042546788,0.00036703388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000779441,0.0008279407,0.00060185796,0.00029289746,0.0005336704,0.00030891632,0.00078194897,0.00055505446,0.00014478402],"category_scores_gemma":[0.0004743775,0.000985341,0.00024527608,0.00081173773,0.00017724639,0.000020839716,0.00043528603,0.00051047886,0.00009509509],"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.00007230295,0.00042709155,0.0139485365,0.00018026998,0.0006971656,0.00001727026,0.000003953312,0.000022390233,0.97831464,0.00013102649,0.006153879,0.000031458676],"study_design_scores_gemma":[0.001757214,0.00032974067,0.007580653,0.000553103,0.00023382553,1.6138808e-8,0.000018274457,0.0005982614,0.91568106,9.608981e-7,0.07221591,0.0010309553],"about_ca_topic_score_codex":0.000021302014,"about_ca_topic_score_gemma":0.0000018970087,"teacher_disagreement_score":0.066062026,"about_ca_system_score_codex":0.0003064734,"about_ca_system_score_gemma":0.00045502224,"threshold_uncertainty_score":0.9992597},"labels":[],"label_agreement":null},{"id":"W6901872667","doi":"10.6084/m9.figshare.12143934","title":"Additional file 1 of Comparing copy-number profiles under multi-copy amplifications and deletions","year":2020,"lang":"en","type":"article","venue":"Figshare","topic":"Genome Rearrangement Algorithms","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":"Université de Sherbrooke","funders":"","keywords":"Data file; Missing data; Set (abstract data type); File format","score_opus":0.06439949345124832,"score_gpt":0.2676304554516659,"score_spread":0.2032309620004176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901872667","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037827974,0.000047768386,0.000068510875,0.00008472309,0.0000039718116,0.0001389913,0.9981185,0.00001235422,0.0011468539],"genre_scores_gemma":[0.047643173,0.0000026357288,0.0058499966,0.00012795032,0.00008133489,0.0004386237,0.94549173,0.000012465903,0.0003520613],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953604,0.000013298341,0.000104838065,0.00018318628,0.00006749286,0.000095144],"domain_scores_gemma":[0.99962336,0.000047622132,0.00005963029,0.000107763924,0.000095019124,0.00006658917],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000058370288,0.00007528942,0.00007725798,0.000010923548,0.000054422006,0.000013169348,0.000086700784,0.000053979034,0.88734734],"category_scores_gemma":[0.00032676916,0.000080730744,0.000036013003,0.00006253018,0.000014932078,0.0000030527729,0.00009022194,0.00004663507,0.00072554254],"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.0000023842806,0.000022875858,0.00007384535,0.000034964396,0.00002251712,2.2500873e-7,0.000014089274,0.000022107799,0.0025596635,0.000003833738,0.9971542,0.000089328496],"study_design_scores_gemma":[0.00020419284,0.000030043619,0.009255483,0.00012703837,0.0000061713704,0.0000036499725,0.0000657998,0.0006049234,0.00405386,0.000005831032,0.98551697,0.00012605604],"about_ca_topic_score_codex":0.0000011860739,"about_ca_topic_score_gemma":0.0000047154845,"teacher_disagreement_score":0.8866218,"about_ca_system_score_codex":0.000004329571,"about_ca_system_score_gemma":0.00004204076,"threshold_uncertainty_score":0.93256235},"labels":[],"label_agreement":null},{"id":"W6901885613","doi":"10.6084/m9.figshare.12375419","title":"Additional file 1 of Evolution through segmental duplications and losses: a Super-Reconciliation approach","year":2020,"lang":"en","type":"article","venue":"Open MIND","topic":"Genome Rearrangement Algorithms","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":"Université de Sherbrooke; Université de Montréal","funders":"","keywords":"Sequence (biology); Point (geometry); Set (abstract data type); Encoding (memory)","score_opus":0.03282092309180433,"score_gpt":0.25828407934860426,"score_spread":0.2254631562567999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901885613","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13941629,0.0003206915,0.009833733,0.00083131075,0.000040684812,0.0017559202,0.7868122,0.000003844628,0.06098533],"genre_scores_gemma":[0.28912604,0.000028339839,0.26167253,0.00019714131,0.00031184417,0.0006122078,0.44484663,0.000027020693,0.003178267],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995068,0.000017514629,0.00011097416,0.00022461526,0.00006910249,0.000071020106],"domain_scores_gemma":[0.9997433,0.000016891565,0.000056013545,0.00010190815,0.000045584766,0.000036330515],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00002887634,0.00006162615,0.00006995233,0.000008014283,0.00004203451,0.000021121077,0.00011671723,0.00004834012,0.16659814],"category_scores_gemma":[0.00007659273,0.00006474275,0.000023759067,0.00006305227,0.000046402296,0.000011541032,0.00012288862,0.00002714734,0.00007706028],"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.000033157,0.00012513045,0.00013295082,0.00001743034,0.000069972164,2.7607248e-7,0.00036982296,0.000024820134,0.10815668,0.0000148812605,0.8822141,0.008840741],"study_design_scores_gemma":[0.0004716466,0.00021260527,0.0021806438,0.000013315912,0.00001879874,0.000007801338,0.00079410244,0.0009042288,0.015497785,0.00002692106,0.97971874,0.0001534006],"about_ca_topic_score_codex":0.00000814443,"about_ca_topic_score_gemma":0.000005808055,"teacher_disagreement_score":0.3419656,"about_ca_system_score_codex":0.000011348716,"about_ca_system_score_gemma":0.00006592012,"threshold_uncertainty_score":0.8341637},"labels":[],"label_agreement":null},{"id":"W6920625562","doi":"10.6084/m9.figshare.12246953.v1","title":"Additional file 1 of The distance and median problems in the single-cut-or-join model with single-gene duplications","year":2020,"lang":"en","type":"article","venue":"Figshare","topic":"Genome Rearrangement Algorithms","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":"Université de Sherbrooke; Simon Fraser University","funders":"","keywords":"Sequence (biology); Set (abstract data type); Term (time); Data file","score_opus":0.04439725489829278,"score_gpt":0.20813185161936137,"score_spread":0.1637345967210686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920625562","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030092712,0.00007960639,0.000034440985,0.0008689867,0.0000020696175,0.00027577684,0.9975594,0.00000427294,0.0008745067],"genre_scores_gemma":[0.123722754,0.00000337832,0.0015397893,0.000586277,0.00009228443,0.001014207,0.8726038,0.000019095318,0.00041840953],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994939,0.00002022941,0.00009565261,0.00017429494,0.000115909286,0.000100000376],"domain_scores_gemma":[0.99960256,0.000056795318,0.00007009747,0.0001887513,0.000049845155,0.000031963977],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00001214223,0.00007813658,0.000060660255,0.000008404862,0.00004274257,0.000014948448,0.00020014287,0.000042037394,0.15203382],"category_scores_gemma":[0.0003525421,0.000045235865,0.000023926605,0.00013228215,0.000024430943,0.0000034627728,0.00007240134,0.00005751177,0.000016006079],"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.0000076102565,0.000041799514,0.0000063211,0.000040022936,0.000009778956,5.911245e-7,0.00014955376,0.00041274578,0.007098592,0.0000011988641,0.99189353,0.00033825144],"study_design_scores_gemma":[0.00035365814,0.000267946,0.0012025511,0.00046352137,0.00000946078,0.0000134457405,0.00013955233,0.00472467,0.0067280442,0.00004461946,0.98585016,0.00020238537],"about_ca_topic_score_codex":6.1803655e-7,"about_ca_topic_score_gemma":0.00010255035,"teacher_disagreement_score":0.15201782,"about_ca_system_score_codex":0.000006465609,"about_ca_system_score_gemma":0.0000620143,"threshold_uncertainty_score":0.84874135},"labels":[],"label_agreement":null},{"id":"W6920739187","doi":"10.6084/m9.figshare.12246953","title":"Additional file 1 of The distance and median problems in the single-cut-or-join model with single-gene duplications","year":2020,"lang":"en","type":"article","venue":"Figshare","topic":"Genome Rearrangement Algorithms","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":"Université de Sherbrooke; Simon Fraser University","funders":"","keywords":"Sequence (biology); Set (abstract data type); Term (time); Data file","score_opus":0.04439725489829278,"score_gpt":0.20813185161936137,"score_spread":0.1637345967210686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920739187","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030092712,0.00007960639,0.000034440985,0.0008689867,0.0000020696175,0.00027577684,0.9975594,0.00000427294,0.0008745067],"genre_scores_gemma":[0.123722754,0.00000337832,0.0015397893,0.000586277,0.00009228443,0.001014207,0.8726038,0.000019095318,0.00041840953],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994939,0.00002022941,0.00009565261,0.00017429494,0.000115909286,0.000100000376],"domain_scores_gemma":[0.99960256,0.000056795318,0.00007009747,0.0001887513,0.000049845155,0.000031963977],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00001214223,0.00007813658,0.000060660255,0.000008404862,0.00004274257,0.000014948448,0.00020014287,0.000042037394,0.15203382],"category_scores_gemma":[0.0003525421,0.000045235865,0.000023926605,0.00013228215,0.000024430943,0.0000034627728,0.00007240134,0.00005751177,0.000016006079],"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.0000076102565,0.000041799514,0.0000063211,0.000040022936,0.000009778956,5.911245e-7,0.00014955376,0.00041274578,0.007098592,0.0000011988641,0.99189353,0.00033825144],"study_design_scores_gemma":[0.00035365814,0.000267946,0.0012025511,0.00046352137,0.00000946078,0.0000134457405,0.00013955233,0.00472467,0.0067280442,0.00004461946,0.98585016,0.00020238537],"about_ca_topic_score_codex":6.1803655e-7,"about_ca_topic_score_gemma":0.00010255035,"teacher_disagreement_score":0.15201782,"about_ca_system_score_codex":0.000006465609,"about_ca_system_score_gemma":0.0000620143,"threshold_uncertainty_score":0.84874135},"labels":[],"label_agreement":null},{"id":"W6929336237","doi":"10.4224/20374374","title":"International Road Tunnel Fire Detection Research Project - Phase II Task 2: Full-Scale Fire Tests in a Laboratory Tunnel","year":2008,"lang":"en","type":"report","venue":"NPARC","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fire Protection Research Foundation","keywords":"Fire detection; Task (project management); Fire safety; Phase (matter); Task group","score_opus":0.04371455905197361,"score_gpt":0.35184911887248105,"score_spread":0.3081345598205074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929336237","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.970872,0.0022013201,0.000023677674,0.00018451053,0.001192838,0.0012255497,0.00060674426,0.000048667334,0.02364468],"genre_scores_gemma":[0.9658885,0.012928376,0.00070139166,0.000036003923,0.0025895983,0.0006615783,0.0020861826,0.00014463463,0.014963735],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961894,0.00022660899,0.00057282083,0.0010436905,0.00131308,0.000654389],"domain_scores_gemma":[0.99775,0.000021322308,0.00023726409,0.00072379777,0.0011373567,0.00013029508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011552989,0.00041622936,0.0004018424,0.00039376324,0.00025023404,0.00005453592,0.0005937385,0.0008060753,0.00016006328],"category_scores_gemma":[0.00053898676,0.0004409408,0.00018235455,0.00056057906,0.00019440941,0.000012292025,0.0005309142,0.0008730657,0.00003927436],"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.0001769913,0.00068100187,0.00019147224,0.00010951445,0.00014252818,0.0001254995,0.00020518606,0.0000055616815,0.85310036,1.3215232e-7,0.060665444,0.08459633],"study_design_scores_gemma":[0.0029492676,0.002157814,0.0030324764,0.0002500369,0.000042384872,0.0002872423,0.00019320246,0.00052286,0.029725835,0.000028296388,0.95991874,0.00089185726],"about_ca_topic_score_codex":0.00038104242,"about_ca_topic_score_gemma":0.0007315135,"teacher_disagreement_score":0.8992533,"about_ca_system_score_codex":0.00047870917,"about_ca_system_score_gemma":0.0020364646,"threshold_uncertainty_score":0.99980426},"labels":[],"label_agreement":null},{"id":"W6929816126","doi":"10.5281/zenodo.10094706","title":"FIGURE 113 in Revision of the metallic species of Lasioglossum (Dialictus) in Canada (Hymenoptera, Halictidae, Halictini) 2591","year":2010,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Metal; Proterozoic; Ooid; Baltica","score_opus":0.014851775761824337,"score_gpt":0.21470483950155567,"score_spread":0.19985306373973133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929816126","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100175194,0.0016849987,0.0000608743,0.0004102518,0.00044161547,0.0015877674,0.0009956558,0.00006114134,0.8945825],"genre_scores_gemma":[0.72772497,0.0023901332,0.0004396464,0.00015936699,0.00049393345,2.7934436e-7,0.003662532,0.0054603782,0.2596688],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838686,0.00026183095,0.00035799266,0.0003696642,0.00036077213,0.00026289356],"domain_scores_gemma":[0.99878836,0.000008319002,0.00028687925,0.0007019886,0.00015306684,0.00006137843],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003345703,0.00019285645,0.0002798858,0.00021778427,0.00010938277,0.00004537414,0.0010190485,0.0001783185,0.010485036],"category_scores_gemma":[0.00030808782,0.00017052883,0.000068987574,0.00039836348,0.00012465092,0.0000049449764,0.0008483823,0.00029909768,0.0000939784],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077298224,0.00022887925,0.0005391604,0.00051292666,0.00018756671,0.000012914017,0.00042451674,0.00004723021,0.17418137,0.0004198452,0.8003114,0.0230569],"study_design_scores_gemma":[0.00038850246,0.00007245291,0.0016353488,0.00015065688,0.000012639809,0.000005472642,0.00009747652,0.000007332752,0.008300363,0.0000049631954,0.9891759,0.00014889802],"about_ca_topic_score_codex":0.049601015,"about_ca_topic_score_gemma":0.02958537,"teacher_disagreement_score":0.63491374,"about_ca_system_score_codex":0.00009646733,"about_ca_system_score_gemma":0.000041806466,"threshold_uncertainty_score":0.9904195},"labels":[],"label_agreement":null},{"id":"W6930165213","doi":"10.5281/zenodo.10848029","title":"Enhancing VGOS Operations: Insights from R&D Sessions and Pathways Ahead","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Genome Rearrangement Algorithms","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":"Natural Resources Canada","funders":"","keywords":"Milestone; Baseline (sea); Work (physics); Earth system science; Focus (optics)","score_opus":0.02320379240569045,"score_gpt":0.24041640004350426,"score_spread":0.2172126076378138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930165213","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.9379825,0.005636145,0.028079359,0.0006726014,0.00030501766,0.0006563771,0.00043618894,0.00057905866,0.025652733],"genre_scores_gemma":[0.9941334,0.0005469622,0.00096405944,0.00008741866,0.0002889638,1.2413608e-7,0.0027541628,0.000550487,0.0006743959],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990216,0.00012402248,0.00014636594,0.00039220165,0.00014446554,0.00017134772],"domain_scores_gemma":[0.9994603,0.000007850053,0.000015926878,0.0002643883,0.00014345637,0.000108083506],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014305522,0.00010620896,0.0000760554,0.00009608933,0.0008636481,0.0005924612,0.00026595875,0.000067239496,0.0013601787],"category_scores_gemma":[0.00014845486,0.0001028746,0.000029910369,0.00017852228,0.00006733124,0.00002031336,0.0006155905,0.00012150175,0.0013185588],"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.000009769977,0.000036156485,0.0000014402709,0.00003214964,0.00005666905,0.000010400782,0.000806046,0.000031032978,0.9534152,0.0010289174,0.01147551,0.033096667],"study_design_scores_gemma":[0.00023326029,0.0001650067,0.00025810272,0.000056663688,0.000016817092,0.000032337255,0.00041023784,0.0009497728,0.04041351,0.00021203927,0.95708096,0.00017131097],"about_ca_topic_score_codex":0.000014643675,"about_ca_topic_score_gemma":0.0000023343034,"teacher_disagreement_score":0.94560546,"about_ca_system_score_codex":0.000029092536,"about_ca_system_score_gemma":0.0000063457173,"threshold_uncertainty_score":0.9995527},"labels":[],"label_agreement":null},{"id":"W6930287452","doi":"10.5281/zenodo.10667948","title":"Acalypha ankaranensis I. Montero & Cardiel","year":2023,"lang":"fr","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Genome Rearrangement Algorithms","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":"Canadian Museum of Nature","funders":"","keywords":"Evergreen; Deciduous; Endemism; Massif; Threatened species; Altitude (triangle)","score_opus":0.031882309299681694,"score_gpt":0.2509176555672677,"score_spread":0.219035346267586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930287452","genre_codex":"other","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.45151305,0.02234516,0.009704932,0.023048235,0.0041604214,0.003292489,0.004332068,0.0028651156,0.47873855],"genre_scores_gemma":[0.89591414,0.00961018,0.00066570536,0.00053956883,0.0020472468,2.5577813e-7,0.0159357,0.004896184,0.07039104],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974827,0.0004210324,0.00029985464,0.00068737153,0.000373164,0.0007358878],"domain_scores_gemma":[0.9983911,0.0000105277195,0.000096281765,0.00071825454,0.0005135685,0.00027029664],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00075849966,0.0002498552,0.00021623023,0.00022542215,0.0013586783,0.0004957549,0.0009289762,0.00022558265,0.0051137605],"category_scores_gemma":[0.00037314862,0.00030222826,0.0001616737,0.0007656635,0.0002690295,0.000023546838,0.0018691578,0.00026922757,0.025161127],"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.00006510636,0.00012651215,0.000010554104,0.00016909205,0.0002970797,0.00007058198,0.00065960933,0.00021722549,0.0681632,0.00046677236,0.66188157,0.2678727],"study_design_scores_gemma":[0.0006500331,0.00038706913,0.0008244359,0.00003723128,0.000050201073,0.00012323138,0.00037618564,0.00056705304,0.0031549714,0.000069199035,0.99346155,0.00029885935],"about_ca_topic_score_codex":0.000029403702,"about_ca_topic_score_gemma":7.33209e-7,"teacher_disagreement_score":0.4444011,"about_ca_system_score_codex":0.000102373495,"about_ca_system_score_gemma":0.0000065184545,"threshold_uncertainty_score":0.99994296},"labels":[],"label_agreement":null},{"id":"W6930574667","doi":"10.5281/zenodo.15157413","title":"TABLE 1 in Pluteus flammans, a new brightly coloured species in Pluteus sect. Celluloderma (Pluteaceae) from Central Europe","year":2023,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Genome Rearrangement Algorithms","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":"University of New Brunswick","funders":"","keywords":"Table (database); Sensu; Column (typography); Taxonomy (biology); Nomenclature","score_opus":0.022783062642466233,"score_gpt":0.22379125080321333,"score_spread":0.2010081881607471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930574667","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014091488,0.0009571464,0.0002643393,0.0005569799,0.0006846762,0.0014554429,0.9779066,0.00030327975,0.0037800416],"genre_scores_gemma":[0.0007815172,0.002935361,0.00014463419,0.00009981943,0.0008352382,2.9489533e-7,0.986111,0.0014153908,0.0076767835],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996276,0.00051678275,0.00058596826,0.0011195582,0.00052687596,0.00097477477],"domain_scores_gemma":[0.9982144,0.000019585876,0.00022395639,0.001000038,0.00023790501,0.00030406576],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00049937406,0.0004511532,0.00043551685,0.00047967202,0.00044954193,0.0006133694,0.001923051,0.00038453433,0.003700722],"category_scores_gemma":[0.0004685791,0.00051855535,0.00009551097,0.0010281622,0.00013891325,0.000024879368,0.0023179073,0.0007139345,0.008615033],"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.00013415904,0.00014824189,0.000008993654,0.00007795456,0.000094353134,0.0002190031,0.00020567603,0.00017482339,0.016442481,0.0000090100375,0.9811774,0.0013078997],"study_design_scores_gemma":[0.0015201771,0.00022641265,0.0017732233,0.00008642288,0.000030993444,0.000024419547,0.00009933102,0.00007008498,0.001045528,0.000022265041,0.99458593,0.0005151989],"about_ca_topic_score_codex":0.0015737558,"about_ca_topic_score_gemma":0.00041231708,"teacher_disagreement_score":0.015396954,"about_ca_system_score_codex":0.00021679662,"about_ca_system_score_gemma":0.00005947853,"threshold_uncertainty_score":0.9997266},"labels":[],"label_agreement":null},{"id":"W6930691599","doi":"10.5281/zenodo.15621348","title":"Computation-Ready Experimental Metal-Organic Framework (CoRE MOF) 2025 Dataset","year":2025,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Genome Rearrangement Algorithms","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":"University of Toronto","funders":"","keywords":"Limiting; Core (optical fiber); MIT License; Classifier (UML); Many core; Plan (archaeology); Multi-core processor","score_opus":0.04298091688852869,"score_gpt":0.30699918185872804,"score_spread":0.26401826497019937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930691599","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003822421,0.00083748606,0.0017006518,0.00011676335,0.00032671512,0.0006840192,0.9939286,0.00012816521,0.0018953192],"genre_scores_gemma":[0.0008047614,0.00045636506,0.00053360284,0.0003010413,0.00039592985,3.144474e-7,0.99616885,0.00060860283,0.00073051284],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974428,0.00028330355,0.0004040987,0.0009368383,0.00045531584,0.0004776501],"domain_scores_gemma":[0.99798167,0.000019060753,0.0002139474,0.001218378,0.00037613083,0.00019080567],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039550662,0.0003923162,0.0003189153,0.0002715493,0.0011838779,0.0005183475,0.0017701751,0.00036835027,0.009569075],"category_scores_gemma":[0.0004749035,0.0004403477,0.00010073031,0.00043570588,0.00017989957,0.000016722415,0.0030963088,0.0004967987,0.002913628],"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.00004642813,0.00023658125,2.6380758e-7,0.00011345579,0.00025091728,0.000013919211,0.000030419138,0.000022049506,0.011259351,0.000039816237,0.9863684,0.0016183722],"study_design_scores_gemma":[0.00046282727,0.00034064607,0.000010925458,0.000052489824,0.00008684534,0.000037995687,0.000102216254,0.000024228542,0.0018893658,0.000031585896,0.99656177,0.00039910947],"about_ca_topic_score_codex":0.000027478474,"about_ca_topic_score_gemma":9.1139566e-7,"teacher_disagreement_score":0.010193338,"about_ca_system_score_codex":0.00012349652,"about_ca_system_score_gemma":0.000020847414,"threshold_uncertainty_score":0.99980485},"labels":[],"label_agreement":null},{"id":"W6930705248","doi":"10.5281/zenodo.15243553","title":"Krylov.jl: A Julia basket of hand-picked Krylov methods","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Genome Rearrangement Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Workspace; Solver; Serialization; Interface (matter); Preconditioner; Iterated function; User interface","score_opus":0.022491827066955516,"score_gpt":0.29193666807802726,"score_spread":0.26944484101107175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930705248","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002517571,0.0012789562,0.03526821,0.0001648479,0.00025614264,0.0007692091,0.00079470477,0.00026970997,0.96094644],"genre_scores_gemma":[0.0039427173,0.0016138454,0.018785438,0.00018477763,0.0007371354,3.2756517e-7,0.010952869,0.009595252,0.95418763],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99794954,0.0004873348,0.00030291194,0.00062643684,0.00027768753,0.00035610402],"domain_scores_gemma":[0.9983956,0.000009477255,0.00023269748,0.0008520526,0.00038395493,0.0001261858],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005651051,0.00027067302,0.0003112491,0.0003637365,0.00036888695,0.00018265127,0.0010926537,0.00030415002,0.019700417],"category_scores_gemma":[0.00047894887,0.0002914317,0.00012922198,0.00036094693,0.000244846,0.0000044475446,0.001437158,0.00022454436,0.0014381147],"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.00004583694,0.00012847073,0.0000030218862,0.00021407068,0.00028430283,0.0000035600578,0.000085078405,0.0000028538182,0.07188334,0.00025144572,0.85001004,0.07708798],"study_design_scores_gemma":[0.0005912478,0.00026511113,0.000091961345,0.000077759934,0.000055030807,0.000011752234,0.00003890627,0.00001566402,0.007973405,0.000034713168,0.9905884,0.0002560432],"about_ca_topic_score_codex":0.000039433606,"about_ca_topic_score_gemma":0.0000012823737,"teacher_disagreement_score":0.14057837,"about_ca_system_score_codex":0.000042581247,"about_ca_system_score_gemma":0.000017187249,"threshold_uncertainty_score":0.9999538},"labels":[],"label_agreement":null},{"id":"W6932039836","doi":"10.5281/zenodo.6522487","title":"FIGURE 12 in A revision of Chrysopidae (Neuroptera) from the late Eocene Florissant Formation Colorado, with description of new species","year":2022,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Genome Rearrangement Algorithms","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":"Royal British Columbia Museum","funders":"","keywords":"Paratype; Holotype; Neuroptera; Scale (ratio); Genus; Confusion","score_opus":0.029231292794393113,"score_gpt":0.21651266430771404,"score_spread":0.18728137151332092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6932039836","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22732554,0.0054109916,0.007797069,0.0009914747,0.00039574507,0.0039953324,0.0021859624,0.00032343244,0.75157446],"genre_scores_gemma":[0.45146388,0.012310789,0.0026116474,0.00027923632,0.0014155277,5.991589e-7,0.046740394,0.009560081,0.47561786],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987726,0.00025037027,0.00024860914,0.00025483733,0.00031096642,0.00016262273],"domain_scores_gemma":[0.9991115,0.000005931946,0.00028254974,0.00044533072,0.00010967123,0.000045020515],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025557476,0.00014971149,0.00018504208,0.00015009711,0.00017178142,0.00006992118,0.00057666947,0.00008488865,0.014718729],"category_scores_gemma":[0.000096844786,0.00012390772,0.000047918275,0.0002559917,0.00008141915,0.000011462306,0.0005643128,0.00016714497,0.00012402068],"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.00026509992,0.00010937737,0.00009360261,0.00020811135,0.00010149678,0.0000055557657,0.0008849381,0.00013374868,0.054692477,0.000049429807,0.9235681,0.019888062],"study_design_scores_gemma":[0.00060321356,0.0004540424,0.0012345323,0.00012251818,0.000022846403,0.0000058304613,0.00025983417,0.000040484716,0.001828452,0.0000071281897,0.9952975,0.00012364247],"about_ca_topic_score_codex":0.000099545745,"about_ca_topic_score_gemma":0.000009683469,"teacher_disagreement_score":0.2759566,"about_ca_system_score_codex":0.000048735303,"about_ca_system_score_gemma":0.000008288811,"threshold_uncertainty_score":0.986182},"labels":[],"label_agreement":null},{"id":"W6957922121","doi":"10.6084/m9.figshare.12375419.v1","title":"Additional file 1 of Evolution through segmental duplications and losses: a Super-Reconciliation approach","year":2020,"lang":"en","type":"article","venue":"Figshare","topic":"Genome Rearrangement Algorithms","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":"Université de Sherbrooke; Université de Montréal","funders":"","keywords":"Sequence (biology); Point (geometry); Set (abstract data type); Encoding (memory)","score_opus":0.0275737538932857,"score_gpt":0.22171393758755775,"score_spread":0.19414018369427205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957922121","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029617664,0.00011704151,0.000092327886,0.00005688293,0.0000031310515,0.00016176469,0.9970854,0.000008872947,0.0021784245],"genre_scores_gemma":[0.017328814,0.000002344856,0.0039759036,0.00010259608,0.00012067107,0.0004995843,0.97778577,0.000008332159,0.0001760151],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995526,0.000011797717,0.00009295478,0.00018888753,0.00007857422,0.000075189935],"domain_scores_gemma":[0.99972314,0.00002511957,0.000053619195,0.00009052006,0.00007060511,0.00003698682],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000006185597,0.00006573064,0.000058587564,0.000009036009,0.000036322515,0.000008503264,0.00006545778,0.000058324298,0.78253245],"category_scores_gemma":[0.00038788212,0.00007088152,0.000034064582,0.000067308276,0.000010058127,0.000007205936,0.0000648168,0.000031759908,0.00019716057],"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.000003521565,0.000020564765,0.000006917698,0.00004680318,0.000015369933,8.862892e-8,0.000040849332,0.000008587646,0.0052170586,0.0000027358917,0.9944192,0.00021829133],"study_design_scores_gemma":[0.00021063331,0.00011308907,0.0025690878,0.0000726976,0.0000062192557,0.0000053388153,0.00016810872,0.0009248624,0.0032752368,0.000013824377,0.99251735,0.00012355344],"about_ca_topic_score_codex":0.000001492918,"about_ca_topic_score_gemma":0.0000012823499,"teacher_disagreement_score":0.7823353,"about_ca_system_score_codex":0.000011439945,"about_ca_system_score_gemma":0.00004997732,"threshold_uncertainty_score":0.28904647},"labels":[],"label_agreement":null},{"id":"W6981747025","doi":"","title":"Expertise publique sous influence? Rapports publics français et québécois relatifs à l'expression religieuse dans les institutions publiques","year":2011,"lang":"fr","type":"article","venue":"Cadmus - EUI Research Repository (European University Institute)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Publics; Identity (music); Context (archaeology); Exportation","score_opus":0.06436582482663261,"score_gpt":0.2819829911010942,"score_spread":0.2176171662744616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6981747025","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.7379487,0.0059320917,0.0046816776,0.0011056714,0.0012731351,0.0009265476,0.00007821102,0.00019653016,0.24785739],"genre_scores_gemma":[0.9536815,0.008860894,0.002059008,0.0002084111,0.00049783377,0.000014072582,0.0002912639,0.00011732809,0.034269687],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.991993,0.0032877075,0.00074672705,0.0015733101,0.0010147438,0.0013845148],"domain_scores_gemma":[0.9944103,0.000064688094,0.00035821582,0.0020359536,0.001985795,0.0011450542],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0023299134,0.00066522264,0.00045087776,0.00089098775,0.0021395788,0.00045460262,0.0019964373,0.0007853793,0.00004823718],"category_scores_gemma":[0.0011894013,0.0007649161,0.0003888688,0.0010566156,0.003081508,0.0006283281,0.0021370954,0.0017655091,0.00014949362],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014604053,0.0047715427,0.056129683,0.0009554552,0.0016690631,0.027406694,0.11713294,0.0016599483,0.6200682,0.054666776,0.09825883,0.015820453],"study_design_scores_gemma":[0.0011780502,0.0006209314,0.021352032,0.0003814874,0.00009354279,0.00033072077,0.003792241,0.000047249567,0.034470897,0.00003702121,0.93680286,0.0008929776],"about_ca_topic_score_codex":0.04484144,"about_ca_topic_score_gemma":0.005875504,"teacher_disagreement_score":0.838544,"about_ca_system_score_codex":0.0009239526,"about_ca_system_score_gemma":0.0049560615,"threshold_uncertainty_score":0.9996315},"labels":[],"label_agreement":null},{"id":"W6981903517","doi":"","title":"Fluid resource and conservation frontiers in Switzerland and beyond: Futurity, visuality, and materiality","year":2023,"lang":"en","type":"dissertation","venue":"Zurich Open Repository and Archive (University of Zurich)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Materiality (auditing); Solidarity; Citizen journalism; Biodiversity; Resource (disambiguation); Vulnerability (computing)","score_opus":0.007476292255566398,"score_gpt":0.22290779049317402,"score_spread":0.21543149823760763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6981903517","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.9963373,0.0010973687,0.00009338516,0.0001192852,0.00015939676,0.00048830285,0.00007054203,0.000009152285,0.0016252958],"genre_scores_gemma":[0.96854734,0.007380014,0.0071024997,0.00010384322,0.00017771333,0.000007613531,0.003419176,0.00007745443,0.013184343],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9986008,0.00034763353,0.00018940147,0.00057250814,0.00012242504,0.00016723236],"domain_scores_gemma":[0.9994048,0.000044997672,0.00020400228,0.00019582159,0.000045037337,0.00010534231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054526905,0.00020790509,0.00036298833,0.00014966408,0.00026350073,0.000096126954,0.00019953739,0.00020674616,0.0000024903345],"category_scores_gemma":[0.000016791411,0.00025157523,0.000031105355,0.000090493704,0.00018805965,0.000026629108,0.0005347837,0.00012181343,3.7106872e-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.00454753,0.00033624558,0.2815069,0.0035031112,0.0009963646,0.00025301546,0.01973513,0.000003747938,0.6426402,0.00044318466,0.03491578,0.011118818],"study_design_scores_gemma":[0.00293622,0.0005551786,0.9488495,0.00023687449,0.00027183726,0.000050293806,0.02304598,0.00016664546,0.0050630094,0.0017715904,0.01627635,0.0007765404],"about_ca_topic_score_codex":0.0012734126,"about_ca_topic_score_gemma":0.0009076699,"teacher_disagreement_score":0.6673426,"about_ca_system_score_codex":0.000010613739,"about_ca_system_score_gemma":0.00005357533,"threshold_uncertainty_score":0.9999936},"labels":[],"label_agreement":null},{"id":"W6982024967","doi":"","title":"Gold mineralizations at the syenite-hosted Beattie gold deposit at Duparquet, neoarchean Abitibi belt, Quebec, Canada","year":2012,"lang":"fr","type":"other","venue":"Archipelago (Université du Québec à Montréal)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Liquation; Limiting; SLATES; Table (database)","score_opus":0.004378601457508355,"score_gpt":0.15790101989117158,"score_spread":0.15352241843366324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6982024967","genre_codex":"empirical","genre_gemma":"other","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.84550965,0.08968692,0.0005894917,0.012585388,0.0010607719,0.0018404564,0.00088115723,0.000084554325,0.047761627],"genre_scores_gemma":[0.28344217,0.0028592083,0.0002722891,0.0008777304,0.00084329944,0.000039169307,0.0026157447,0.00040205152,0.7086483],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99588996,0.00046098785,0.0005276301,0.0011279463,0.0006124477,0.0013810449],"domain_scores_gemma":[0.9967619,0.00018991386,0.0004974665,0.0016191287,0.00019768954,0.00073386234],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017359805,0.0010559199,0.000701681,0.00021872591,0.0008643687,0.00006496716,0.0012732183,0.0006129876,0.0036857321],"category_scores_gemma":[0.00006562301,0.0010115845,0.00049114245,0.00039465557,0.000694159,0.000023905715,0.0018147873,0.0004952279,0.000330358],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005914834,0.0006108592,0.033562556,0.00056281744,0.0038015824,0.0007063013,0.021247204,0.0011674801,0.06172373,0.0009989749,0.8187101,0.05631691],"study_design_scores_gemma":[0.0015330242,0.00014728936,0.020097788,0.0001184787,0.00091960764,0.00017969293,0.0022926729,0.0002904918,0.0009362391,0.000008381289,0.9722154,0.0012609176],"about_ca_topic_score_codex":0.9937028,"about_ca_topic_score_gemma":0.99994516,"teacher_disagreement_score":0.6608867,"about_ca_system_score_codex":0.0029229033,"about_ca_system_score_gemma":0.0016294592,"threshold_uncertainty_score":0.9992334},"labels":[],"label_agreement":null},{"id":"W6982146353","doi":"","title":"Here’s why the Canadian dollar just hit a 26-month high | rewfinancialcontent","year":2017,"lang":"en","type":"other","venue":"","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Liberian dollar; Government (linguistics); Payment; Exchange-rate flexibility; Investment (military)","score_opus":0.017941582718880696,"score_gpt":0.23406591194533624,"score_spread":0.21612432922645555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6982146353","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015466762,0.0058470857,0.000121244484,0.0019321595,0.0011299094,0.0008149941,0.00017453328,0.00005488071,0.98977053],"genre_scores_gemma":[0.009047016,0.0009634584,0.00045038408,0.0012502415,0.0016890028,0.00007806644,0.0002661813,0.00043869897,0.98581696],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854666,0.00004858632,0.0001512286,0.0005255925,0.00021012894,0.0005177943],"domain_scores_gemma":[0.9981097,0.0000026918967,0.00019444247,0.001420157,0.00006838844,0.00020461455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017611436,0.00036345707,0.00028318458,0.00009178289,0.00027054243,0.000114572475,0.00084953377,0.000617713,0.00080906396],"category_scores_gemma":[0.000047217527,0.00026063906,0.00016140688,0.000041018902,0.00014608602,0.0000011582821,0.00015605966,0.00017070913,0.00025992125],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055621776,0.000013478318,0.00013452441,0.00002036763,0.00018088685,0.00001940583,0.000009206619,5.659317e-7,0.00056355324,0.00015004467,0.9959076,0.0029948049],"study_design_scores_gemma":[0.00036703018,0.000079437785,0.00024126128,0.000042425683,0.00006412081,0.0000066855623,0.000036720427,0.000001446554,0.000455281,0.000019763747,0.9983258,0.00036001747],"about_ca_topic_score_codex":0.4124461,"about_ca_topic_score_gemma":0.9434101,"teacher_disagreement_score":0.53096396,"about_ca_system_score_codex":0.00008178743,"about_ca_system_score_gemma":0.0005124222,"threshold_uncertainty_score":0.99998456},"labels":[],"label_agreement":null},{"id":"W6982525193","doi":"","title":"Interview with Kimo Lyman","year":2019,"lang":"en","type":"article","venue":"ScholarSpace (University of Hawaii at Manoa)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Interview; George (robot); Metis; Period (music); Indigenous; Identity (music); Narrative","score_opus":0.005354830764730804,"score_gpt":0.16888877859510493,"score_spread":0.16353394783037412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6982525193","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.97959524,0.0004762391,0.00052824005,0.0013117001,0.00007017732,0.00024317199,0.000011197319,0.000016817728,0.017747223],"genre_scores_gemma":[0.95044917,0.00023253707,0.0032112435,0.00010267997,0.00002387325,3.1848296e-7,0.000056661098,0.000021996073,0.045901503],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914676,0.00006064436,0.000054233227,0.00034387677,0.00018311664,0.00021135717],"domain_scores_gemma":[0.9992434,0.000003945928,0.00009265517,0.0004847584,0.00009187323,0.000083411345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017490405,0.0001350272,0.00017365381,0.00006939039,0.00008816941,0.000012364398,0.00034658384,0.00010185252,0.00048161534],"category_scores_gemma":[0.0000039146057,0.00014852299,0.00009866337,0.00012109704,0.00008292979,0.000017027987,0.00036780463,0.00009693933,0.00035341902],"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.00055944273,0.00024394323,0.09757243,0.0004063381,0.0007396719,0.00007263308,0.000604565,0.00013382413,0.87356025,0.00076132396,0.01715756,0.008187999],"study_design_scores_gemma":[0.0032310048,0.0011878243,0.067864046,0.00011720078,0.000115847295,0.000040946357,0.004399008,0.00003289254,0.018013567,0.000019443944,0.9043934,0.0005848406],"about_ca_topic_score_codex":0.000021565447,"about_ca_topic_score_gemma":0.00019578275,"teacher_disagreement_score":0.8872358,"about_ca_system_score_codex":0.000037535865,"about_ca_system_score_gemma":0.000035781995,"threshold_uncertainty_score":0.6056591},"labels":[],"label_agreement":null},{"id":"W6992934553","doi":"","title":"NEXT-GENERATION SEQUENCING AND MOTIF GRAFTING APPLICATIONS IN SYNTHETIC ANTIBODY DISCOVERY","year":2017,"lang":"en","type":"dissertation","venue":"University Library - University of Saskatchewan (University of Saskatchewan)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"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":"Western Economic Diversification Canada; Canadian Institutes of Health Research; University of Toronto; Canadian Light Source","keywords":"Antibody; Motif (music); Drug discovery; DNA sequencing; Peptide sequence; Sequence motif; Sequence (biology); DNA; Cell culture","score_opus":0.013153271362810056,"score_gpt":0.19838227254741364,"score_spread":0.1852290011846036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992934553","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.9944709,0.00046725868,0.0016492871,0.000098798926,0.000116184354,0.0006682705,0.00042547047,0.00004476746,0.0020590809],"genre_scores_gemma":[0.9398401,0.0012903136,0.0035315764,0.0000069788466,0.00006878716,7.1042734e-8,0.004557264,0.000048007536,0.050656945],"study_design_codex":"bench_or_experimental","study_design_gemma":"qualitative","domain_scores_codex":[0.99787456,0.0001586384,0.00024208351,0.0009815852,0.00032659576,0.00041654205],"domain_scores_gemma":[0.99796873,0.000040657244,0.00081000687,0.0008343849,0.00014765417,0.0001985675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017589304,0.0004730564,0.0007169599,0.00062862714,0.00065251364,0.00006060074,0.0011817145,0.00069605664,0.00011875045],"category_scores_gemma":[0.000011420907,0.0007323665,0.00034053606,0.00033776616,0.00055171706,0.00043057732,0.00046337105,0.00039511017,0.000006256613],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013406018,0.0005893945,0.024419075,0.0018854588,0.0011893995,0.00036848115,0.16779219,0.00030976007,0.7899796,0.00006745151,0.00030412007,0.011754519],"study_design_scores_gemma":[0.0019386205,0.00023360972,0.009761607,0.00041399855,0.00047220732,0.000006547307,0.96865785,0.00022131168,0.013324607,0.000078832476,0.0039814976,0.0009093273],"about_ca_topic_score_codex":0.011814995,"about_ca_topic_score_gemma":0.02432836,"teacher_disagreement_score":0.80086565,"about_ca_system_score_codex":0.00013697849,"about_ca_system_score_gemma":0.0010689922,"threshold_uncertainty_score":0.99951273},"labels":[],"label_agreement":null},{"id":"W6999555181","doi":"","title":"On the detection of non-adjoining dependencies in molecular sequences","year":2003,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Position (finance); Markov chain; Vertex (graph theory); Graph; Sequence (biology); Random variable; Markov process; Variable (mathematics); Graph theory","score_opus":0.011014154970261557,"score_gpt":0.23260106582551565,"score_spread":0.2215869108552541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999555181","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.97007847,0.00061029993,0.0000035798953,0.0000063352945,0.00047161744,0.00058800436,0.00011189868,0.000015747097,0.028114041],"genre_scores_gemma":[0.99676937,0.00031824652,0.00029839174,0.000114997114,0.00001882688,0.0001478342,0.0003062816,0.000098966564,0.0019270602],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99731857,0.000318994,0.0005925086,0.00076285563,0.0005523179,0.00045477416],"domain_scores_gemma":[0.9985288,0.00006143051,0.0004486117,0.00065436156,0.0002205016,0.000086331755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084166124,0.000494322,0.00041040295,0.00026823027,0.0002752813,0.000031404343,0.0005220169,0.00065050635,0.000051691146],"category_scores_gemma":[0.0005734162,0.0004404821,0.00026216096,0.00039556788,0.00006143727,0.00001572052,0.000070143586,0.00070038385,0.000033360582],"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.0000843794,0.00006590126,0.000022592141,0.000095392206,0.00011552159,0.000017060114,0.0000057295165,0.00013068639,0.9833722,0.0017303926,8.48024e-7,0.014359281],"study_design_scores_gemma":[0.0004279518,0.00036344246,0.00054319884,0.00018119537,0.000062876556,0.000010051819,0.00043035936,0.000014577962,0.99258673,0.002662891,0.0022458492,0.0004708555],"about_ca_topic_score_codex":0.00014488131,"about_ca_topic_score_gemma":0.001094357,"teacher_disagreement_score":0.026690919,"about_ca_system_score_codex":0.0001477648,"about_ca_system_score_gemma":0.00006326421,"threshold_uncertainty_score":0.9998047},"labels":[],"label_agreement":null},{"id":"W7003489788","doi":"","title":"Genome Graphs","year":2010,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Genome; Hybrid genome assembly; Shotgun sequencing; Reference genome; Genomics; Sequence (biology); Sequence assembly; DNA sequencing","score_opus":0.0018563477962475325,"score_gpt":0.14450785988361572,"score_spread":0.1426515120873682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7003489788","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.7150158,0.0015002886,0.000007786872,0.00029973884,0.0005841953,0.00025249075,0.00033041814,0.0000049455107,0.2820043],"genre_scores_gemma":[0.9043161,0.0010075583,0.0007701504,0.0003275538,0.00017763414,0.000020157471,0.0010817504,0.000062356674,0.092236705],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982742,0.000024795656,0.00023355981,0.00033239875,0.0008771053,0.00025794253],"domain_scores_gemma":[0.9993381,0.00001590522,0.00018044916,0.00027945227,7.8922557e-7,0.00018531186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0000067740543,0.00024820137,0.00022534691,0.000023780307,0.00009845982,0.000015896261,0.00027029365,0.00011064508,0.00005083777],"category_scores_gemma":[0.0000021330573,0.00025780933,0.000048293386,0.000040828978,0.00003760124,0.000008115268,0.000078645055,0.00018940933,2.8139107e-9],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023652102,0.000016649305,0.0016585372,0.00020668955,0.00014662785,0.00001928437,0.000029041741,0.000004402775,0.99179953,0.0020255458,0.00030116006,0.0035560075],"study_design_scores_gemma":[0.00042057416,0.00014093264,0.10130111,0.000056828365,0.0000638909,0.0000064127025,0.0015281123,0.000023633784,0.6958097,0.0006620454,0.19937634,0.00061040063],"about_ca_topic_score_codex":0.00070939347,"about_ca_topic_score_gemma":0.074711874,"teacher_disagreement_score":0.2959898,"about_ca_system_score_codex":0.0000016019778,"about_ca_system_score_gemma":0.0013485531,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W7006553062","doi":"","title":"Upper bounds for the likelihood of a phylogeny","year":2004,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Phylogenetics; Phylogenetic tree; Computational phylogenetics; Maximum likelihood; Set (abstract data type); Supertree; Tree rearrangement","score_opus":0.010170742007581031,"score_gpt":0.24097516632723243,"score_spread":0.2308044243196514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7006553062","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.9760512,0.0041999966,0.000005421346,0.000025886646,0.001389349,0.0017991347,0.0020996733,0.000042116037,0.014387206],"genre_scores_gemma":[0.9851687,0.0008785281,0.0014601246,0.00017843336,0.00020833,0.0005312427,0.0033051476,0.0002435086,0.008026018],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971764,0.000095953525,0.0006742114,0.00089899637,0.00047810556,0.0006763143],"domain_scores_gemma":[0.99771667,0.00006488083,0.00052257924,0.00100696,0.0005303083,0.00015862093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006208188,0.00062064244,0.00052515126,0.00015530983,0.00059926143,0.000046125726,0.00089758367,0.00084291847,0.00007611233],"category_scores_gemma":[0.00034132486,0.0005366034,0.000696583,0.00024051414,0.000086739485,0.00001312985,0.00014105371,0.0004806508,0.000040669674],"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.00032444746,0.00021412512,0.000021179858,0.00042991896,0.00081504154,0.0000033970637,0.000008851084,0.000032458032,0.92813706,0.004041473,0.000023851038,0.06594821],"study_design_scores_gemma":[0.0019972483,0.0007245943,0.0015745236,0.00017787016,0.0005579075,0.00001511451,0.00033805662,0.0000071131144,0.75002927,0.009329912,0.23431344,0.00093492866],"about_ca_topic_score_codex":0.00012119469,"about_ca_topic_score_gemma":0.00063388975,"teacher_disagreement_score":0.23428959,"about_ca_system_score_codex":0.00015807294,"about_ca_system_score_gemma":0.00015726383,"threshold_uncertainty_score":0.99970853},"labels":[],"label_agreement":null},{"id":"W7010344886","doi":"","title":"Homologous Gene Finding with a Hidden Markov Model","year":2007,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"York University","keywords":"Homology (biology); Homologous chromosome; Gene; Gene prediction; Homologous recombination; Hidden Markov model","score_opus":0.00846722209348909,"score_gpt":0.21199633650509625,"score_spread":0.20352911441160715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7010344886","genre_codex":"empirical","genre_gemma":"other","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.9971899,0.00030423078,0.0005111239,0.000058502825,0.00008547513,0.00026368754,0.000049483555,0.00001818399,0.0015194521],"genre_scores_gemma":[0.13775636,0.00040117986,0.054372374,0.000018147084,0.00008616158,0.0000010281216,0.003205906,0.0000692367,0.8040896],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888575,0.000023400567,0.000096136835,0.00044739456,0.0002278855,0.00031942135],"domain_scores_gemma":[0.99919176,0.0000040315567,0.00019467117,0.00036706752,0.00015287932,0.000089602174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000118515854,0.00025501376,0.00027856356,0.00020004417,0.00011926997,0.000010950428,0.00035327303,0.00041513698,0.000059143837],"category_scores_gemma":[0.000004298652,0.00028295815,0.00012990713,0.00010925814,0.000073481664,0.000006102764,0.00007937987,0.00015683158,0.000016775793],"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.0018568705,0.00021927858,0.0011818147,0.00051541236,0.0010600474,0.0002848375,0.028090686,0.0005104911,0.9443275,0.000015219743,0.0035019633,0.018435914],"study_design_scores_gemma":[0.009507718,0.0037870249,0.015190498,0.00065345597,0.00213933,0.00014891961,0.20238788,0.0035358693,0.7546161,0.00019263261,0.003201144,0.004639462],"about_ca_topic_score_codex":0.0020123345,"about_ca_topic_score_gemma":0.012206123,"teacher_disagreement_score":0.85943353,"about_ca_system_score_codex":0.000041056246,"about_ca_system_score_gemma":0.00011817329,"threshold_uncertainty_score":0.9999623},"labels":[],"label_agreement":null},{"id":"W7026479717","doi":"","title":"Apatite forming ability of alkali-treated titanium oxide-coated pure titanium in simulated body environment","year":2001,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Titanium; Apatite; Titanium alloy; Titanio; Simulated body fluid","score_opus":0.002395965843308382,"score_gpt":0.14498616430902003,"score_spread":0.14259019846571164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7026479717","genre_codex":"other","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.2675132,0.003509876,0.00024125917,0.0004523506,0.00024303302,0.0015092137,0.0022043798,0.000026744432,0.72429997],"genre_scores_gemma":[0.8563782,0.00175097,0.0009551037,0.00017111973,0.00008402318,0.000014105151,0.00039528406,0.00022595671,0.14002523],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99799466,0.00006797907,0.000391016,0.00041769224,0.00080043107,0.00032823643],"domain_scores_gemma":[0.9991413,0.000026633086,0.00029255266,0.00038869123,7.806065e-7,0.00015008054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000017205883,0.00032167006,0.00040365895,0.000052183226,0.00003205735,0.000006906063,0.00023493526,0.00014334031,0.00025680565],"category_scores_gemma":[0.000003242856,0.000328615,0.000050000017,0.00008053336,0.000087343,0.0000107615215,0.000183709,0.0001252771,1.3504124e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030663842,0.00012841882,0.05838124,0.0004838716,0.0004045535,0.00008770455,0.00001732988,0.0002557896,0.93191016,0.00028590416,0.006571509,0.001166879],"study_design_scores_gemma":[0.0016124245,0.00030023645,0.033519052,0.00037464875,0.00010304124,0.0000076587085,0.00052438094,0.0008063525,0.5488138,0.00007571955,0.4129565,0.00090618484],"about_ca_topic_score_codex":0.008158309,"about_ca_topic_score_gemma":0.034304313,"teacher_disagreement_score":0.58886504,"about_ca_system_score_codex":0.000014887619,"about_ca_system_score_gemma":0.00040991473,"threshold_uncertainty_score":0.9999166},"labels":[],"label_agreement":null},{"id":"W7028427061","doi":"","title":"Exploring Structural Variant Identification using Current Software, Whole-Genome Alignment Methods, and a Preliminary Study into Graph-based Alternatives","year":2023,"lang":"en","type":"dissertation","venue":"University Library (University of Saskatchewan)","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"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":"Jaccard index; Identification (biology); Consistency (knowledge bases); Pipeline (software); Sequence (biology); Process (computing); Genome","score_opus":0.03294998648727451,"score_gpt":0.2604196258925165,"score_spread":0.22746963940524198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028427061","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.9906578,0.00053313863,0.0072991173,0.0000333311,0.00043171624,0.0007265049,0.00023019257,0.00007302367,0.000015171008],"genre_scores_gemma":[0.9461726,0.00059455895,0.042063553,0.000005596576,0.000105584564,0.0000013029592,0.0062438548,0.000089567206,0.0047234036],"study_design_codex":"bench_or_experimental","study_design_gemma":"qualitative","domain_scores_codex":[0.9981663,0.0002912524,0.00020821815,0.00079089636,0.00028816715,0.00025514344],"domain_scores_gemma":[0.99887055,0.000033399054,0.00041460336,0.00043942616,0.000097169235,0.0001448679],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018003915,0.0003482923,0.00037855143,0.00058051397,0.000373396,0.00004000241,0.00058391225,0.0001721494,0.00002703649],"category_scores_gemma":[0.000010555804,0.00048270184,0.00019003176,0.0003980068,0.0001297631,0.0001460294,0.00042239114,0.00020948908,0.000004251785],"study_design_candidate":"qualitative","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.006831208,0.0018581359,0.031176386,0.004455501,0.0056872014,0.00095016585,0.334743,0.004259271,0.50627416,0.000042442418,0.00025063203,0.103471905],"study_design_scores_gemma":[0.003910353,0.0013295294,0.15247795,0.0003800052,0.0014092495,0.000006033268,0.82116205,0.00091538037,0.014054894,0.00039403178,0.0023557723,0.0016047318],"about_ca_topic_score_codex":0.00071360363,"about_ca_topic_score_gemma":0.0003275715,"teacher_disagreement_score":0.49221927,"about_ca_system_score_codex":0.00007005071,"about_ca_system_score_gemma":0.00027032662,"threshold_uncertainty_score":0.9997625},"labels":[],"label_agreement":null},{"id":"W7030163746","doi":"","title":"Model experiments for analyzing Ro-Ro ferry damage stability","year":2001,"lang":"en","type":"article","venue":"NPARC","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Survivability; Set (abstract data type); Stability (learning theory); Interval (graph theory)","score_opus":0.05082315182245935,"score_gpt":0.3011415891147698,"score_spread":0.25031843729231046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030163746","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.9578561,0.00016199857,0.034628995,0.000119536955,0.000065801825,0.00030799943,0.000025585749,0.0000168346,0.0068171],"genre_scores_gemma":[0.9798679,0.000061098566,0.018415228,0.0000898359,0.0001293854,0.000079625424,0.00011306721,0.000023585128,0.0012203264],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990984,0.00002240009,0.00015321147,0.00034143074,0.00010423425,0.00028029378],"domain_scores_gemma":[0.99942136,0.000005379359,0.000042289787,0.00038279823,0.00006901862,0.00007915013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017900635,0.00012878301,0.00011862869,0.000028000177,0.00007690736,0.00002168858,0.00017472549,0.00008759709,0.00011311397],"category_scores_gemma":[0.000032887874,0.00013081204,0.00009559344,0.000056048597,0.00003551881,0.0000042725483,0.000094941934,0.00004457759,0.000007925482],"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.00005203906,0.00007703621,0.0032520592,0.00001148608,0.000038112677,9.194696e-7,0.00007058416,0.00016040745,0.99362546,0.000032186264,0.0008435423,0.0018361732],"study_design_scores_gemma":[0.0020151513,0.00033885235,0.0021447968,0.000009520232,0.00005901785,0.00000455751,0.00025698042,0.04466758,0.92629784,0.002451699,0.021188622,0.0005654089],"about_ca_topic_score_codex":0.0000033441713,"about_ca_topic_score_gemma":0.000008041238,"teacher_disagreement_score":0.06732764,"about_ca_system_score_codex":0.000026689107,"about_ca_system_score_gemma":0.00003573416,"threshold_uncertainty_score":0.533436},"labels":[],"label_agreement":null},{"id":"W7038746833","doi":"","title":"Johnson Controls reports second quarter results and increases share repurchase program by $500 million","year":2017,"lang":"en","type":"other","venue":"","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Revenue; Control (management)","score_opus":0.007449392656329122,"score_gpt":0.252823783909769,"score_spread":0.24537439125343988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038746833","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01002838,0.04043895,0.00009637824,0.00027361294,0.0004953877,0.00405886,0.0036198047,0.0002829634,0.94070566],"genre_scores_gemma":[0.006534326,0.0019941514,0.0011144492,0.0001335837,0.00063328166,0.00023474336,0.007432174,0.0002836712,0.9816396],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99819875,0.000051758147,0.00031021642,0.0009336852,0.00017664535,0.00032895672],"domain_scores_gemma":[0.9980886,0.000007136291,0.0005046204,0.0011710239,0.000057871734,0.00017074351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021015514,0.000383471,0.00037377744,0.00008612408,0.00007640407,0.00012072344,0.00018053046,0.00055860024,0.0008543699],"category_scores_gemma":[0.00012398906,0.00033345135,0.00010883667,0.000023274319,0.00010692885,0.0000033538506,0.00013886121,0.00011790446,0.0000150003225],"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.000072543815,0.00010919452,0.00007336803,0.00007996596,0.00017263948,0.00007040843,0.0000052800638,2.3543105e-8,0.010341868,4.4702472e-7,0.9777939,0.0112803895],"study_design_scores_gemma":[0.0012434992,0.00055101264,0.00009882676,0.000111441346,0.000050510167,0.00008099411,0.0000091645,0.0000046593564,0.0029325264,0.000005401577,0.9944988,0.00041317812],"about_ca_topic_score_codex":0.0003477006,"about_ca_topic_score_gemma":0.00062129734,"teacher_disagreement_score":0.040933955,"about_ca_system_score_codex":0.000011760141,"about_ca_system_score_gemma":0.000049286933,"threshold_uncertainty_score":0.9999117},"labels":[],"label_agreement":null},{"id":"W7084105114","doi":"10.1101/2025.09.18.25335809","title":"DLBCLone: A unified framework for neighbourhood-based genetic subtyping of lymphomas","year":2025,"lang":"en","type":"preprint","venue":"medRxiv","topic":"Genome Rearrangement Algorithms","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":"Canada's Michael Smith Genome Sciences Centre; University of British Columbia; Spinal Cord Injury BC; Simon Fraser University","funders":"Canadian Institutes of Health Research","keywords":"Subtyping; Limiting; Class (philosophy); Genetic algorithm; Mutation; Contrast (vision)","score_opus":0.0186729604971734,"score_gpt":0.2818992990495089,"score_spread":0.2632263385523355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084105114","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.7164688,0.0037316896,0.27610996,0.00028595803,0.0009921535,0.0012768897,0.00035359344,0.00003647566,0.0007444867],"genre_scores_gemma":[0.89913833,0.00027688223,0.09864403,0.00020462158,0.0003864075,0.00029800864,0.00052235083,0.000057030935,0.00047235654],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981201,0.000088427216,0.00047886994,0.00073483185,0.00019759388,0.00038013133],"domain_scores_gemma":[0.99817324,0.00007111349,0.000324603,0.0011004526,0.0002395502,0.00009106601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028717925,0.00036476937,0.00045854773,0.00015519274,0.00005870438,0.000027910002,0.00064667506,0.00070060114,0.00004227823],"category_scores_gemma":[0.00031443292,0.00039162286,0.00038164103,0.00014481822,0.00008702308,8.63731e-7,0.00047059156,0.00021243363,0.0000029697535],"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.001956487,0.0019594193,0.27160022,0.016026229,0.0044933716,0.000041849493,0.0005860278,0.029739121,0.6082147,0.00839719,0.0023375794,0.05464784],"study_design_scores_gemma":[0.005464037,0.0009549432,0.10933957,0.0018836337,0.00097648246,0.0000065340905,0.000108172186,0.009543845,0.8130791,0.024969634,0.031230086,0.0024439339],"about_ca_topic_score_codex":0.000035355948,"about_ca_topic_score_gemma":0.0000142002955,"teacher_disagreement_score":0.20486446,"about_ca_system_score_codex":0.00003746228,"about_ca_system_score_gemma":0.00054880657,"threshold_uncertainty_score":0.99985355},"labels":[],"label_agreement":null},{"id":"W7091305516","doi":"10.6084/m9.figshare.c.8089790.v1","title":"Thyroid hormone receptor beta signaling is a targetable driver of prostate cancer growth","year":2025,"lang":"en","type":"other","venue":"Figshare","topic":"Genome Rearrangement Algorithms","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":"University of Toronto","funders":"","keywords":"Prostate cancer; Androgen receptor; Carcinogenesis; Thyroid; Thyroid hormone receptor; Thyroid cancer; Context (archaeology); Cell growth; Signal transduction; Receptor","score_opus":0.010329327390976901,"score_gpt":0.23284376242034968,"score_spread":0.2225144350293728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7091305516","genre_codex":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014381303,0.072455004,0.0000073426545,0.00011577363,0.0001611624,0.0011149275,0.7817142,0.00006022204,0.14422753],"genre_scores_gemma":[0.0005522266,0.0022469955,0.0008183572,0.00017515117,0.0005719653,0.00041955608,0.2045497,0.0003319161,0.7903341],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887204,0.000025527366,0.00019114824,0.00045730599,0.00017826234,0.00027572876],"domain_scores_gemma":[0.9991963,0.000005047142,0.00023751764,0.00034706653,0.00015512155,0.000058976162],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000028015313,0.00028101934,0.00029914262,0.00010538426,0.000027239565,0.000017651166,0.00030998565,0.00034671425,0.15679081],"category_scores_gemma":[0.000047259495,0.00027814845,0.0001437827,0.00012209464,0.000012262089,0.0000020729572,0.0002257531,0.00011828873,0.00035176834],"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.000011642239,0.000022440488,0.000035256442,0.00041998713,0.0002549789,0.0000011802459,0.000025652715,0.0000022057195,0.07081255,8.044152e-7,0.92807716,0.00033613847],"study_design_scores_gemma":[0.0003431639,0.00006264123,0.000031591408,0.00093196874,0.00003854928,2.294232e-7,0.000008811517,0.0000027212584,0.13373448,0.0000039399747,0.86456823,0.0002736387],"about_ca_topic_score_codex":0.000118426025,"about_ca_topic_score_gemma":0.000017067412,"teacher_disagreement_score":0.6461066,"about_ca_system_score_codex":0.000019919988,"about_ca_system_score_gemma":0.00020622203,"threshold_uncertainty_score":0.9999671},"labels":[],"label_agreement":null},{"id":"W7096689549","doi":"","title":"Resource Utilization and Costs during the Initial Years of Lung Cancer Screening with Computed Tomography in Canada","year":2016,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computed tomography; Lung cancer screening; Work (physics); Lung cancer; Resource (disambiguation); Download; Cost–benefit analysis","score_opus":0.009082101914287466,"score_gpt":0.2293904949381381,"score_spread":0.22030839302385063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096689549","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.9979375,0.00042223095,0.0012744892,0.000085776446,0.000012579895,0.00010752411,0.000009925901,0.0000019768304,0.00014801176],"genre_scores_gemma":[0.9995882,0.0000614949,0.0002402353,0.000035198012,0.000022832706,0.0000060526145,0.000005971415,0.0000062165286,0.000033797147],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996293,0.000022218985,0.00007244392,0.00010771428,0.00007579477,0.00009252778],"domain_scores_gemma":[0.99983007,0.000008382229,0.000031239666,0.00008669324,0.000023316392,0.000020296713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004179292,0.000046202287,0.000050321876,0.000025056761,0.000017361444,0.0000037247903,0.000053861477,0.000018791958,0.000007503247],"category_scores_gemma":[0.0000039160327,0.00002844876,0.000007625669,0.00008509402,0.000031797208,0.0000016058823,0.000040915445,0.000017722177,2.4513525e-8],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013263067,0.000010051236,0.8406047,0.00002526324,0.0000940311,0.000005534722,0.00006416494,0.00014966514,0.09527079,0.000012498096,0.00019814982,0.063432485],"study_design_scores_gemma":[0.0011287866,0.000040606374,0.93430716,0.00008580589,0.000009927026,0.000003104065,0.00013983274,0.00036255817,0.061796125,7.220164e-7,0.0020172452,0.00010815701],"about_ca_topic_score_codex":0.11484603,"about_ca_topic_score_gemma":0.54594475,"teacher_disagreement_score":0.4310987,"about_ca_system_score_codex":0.00002262334,"about_ca_system_score_gemma":0.00007163565,"threshold_uncertainty_score":0.8910483},"labels":[],"label_agreement":null},{"id":"W7097356128","doi":"","title":"Author manuscript, published in &amp;quot;4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), Montréal: Canada (2007)&amp;quot; How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation","year":2009,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Heuristics; Genome; Comparative genomics; Heuristic; Adjacency list; Benchmark (surveying); Genomics; Matching (statistics); Dynamic programming","score_opus":0.0286502336682927,"score_gpt":0.2574770019929055,"score_spread":0.22882676832461282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097356128","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.9231902,0.009621023,0.04062757,0.01662746,0.0014901608,0.0041385596,0.0002991694,0.00019880215,0.0038070653],"genre_scores_gemma":[0.88100785,0.0011421843,0.064638436,0.001514493,0.0006492614,0.00021439088,0.0061486834,0.00014769773,0.044536985],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956663,0.0002555795,0.00089464185,0.0013187539,0.000589495,0.0012752231],"domain_scores_gemma":[0.99783075,0.00003499492,0.0004369826,0.0008925508,0.00035369358,0.00045103396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007089086,0.00073469,0.00074516656,0.00024547847,0.00024270636,0.00043414754,0.00062590285,0.0002995846,0.000092285234],"category_scores_gemma":[0.00006994283,0.0007562429,0.00017305394,0.00059038453,0.000103555125,0.00004581546,0.0001729486,0.0004403757,0.000019699266],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017962042,0.0027712758,0.015025834,0.00047722968,0.0016916079,0.0002212107,0.009995981,0.01846222,0.26234007,0.00030058308,0.43503615,0.25188166],"study_design_scores_gemma":[0.0021516776,0.00031847288,0.018540122,0.000065640204,0.0000753004,0.00002603476,0.0028316993,0.00083947246,0.002005936,0.00015939982,0.97154766,0.0014385751],"about_ca_topic_score_codex":0.039545897,"about_ca_topic_score_gemma":0.7524306,"teacher_disagreement_score":0.7128847,"about_ca_system_score_codex":0.0009183622,"about_ca_system_score_gemma":0.00043454417,"threshold_uncertainty_score":0.99948883},"labels":[],"label_agreement":null},{"id":"W7098987033","doi":"","title":"MBA Student","year":2008,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Venture capital; Courage; Product (mathematics); New product development; Field (mathematics); Work (physics)","score_opus":0.01374260424786082,"score_gpt":0.24926694741770833,"score_spread":0.2355243431698475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098987033","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.9637939,0.00032478405,0.0011686644,0.00008566296,0.000066002496,0.00008085161,9.66268e-7,0.000013163845,0.034466047],"genre_scores_gemma":[0.98446095,0.00025129158,0.0017416485,0.0002139585,0.00014612927,0.00000864558,0.000020872441,0.000008810218,0.013147723],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959856,0.000008637905,0.000061735955,0.00013662351,0.00008275276,0.00011166093],"domain_scores_gemma":[0.99975413,9.471135e-7,0.000011635298,0.00017209344,0.000023125815,0.000038070488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034815133,0.00005575747,0.00004301246,0.000013064547,0.000039832164,0.0000037628565,0.00009662518,0.000034088578,0.0001318868],"category_scores_gemma":[0.0000044700087,0.000048639442,0.000034278717,0.000028621957,0.000025336432,4.9826565e-7,0.00006472305,0.000019550684,0.00012472263],"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.000014993613,0.00019897512,0.066757396,0.000005428983,0.00010989477,0.000025485377,0.00015429057,0.00003045147,0.875747,0.00018269557,0.053808764,0.002964584],"study_design_scores_gemma":[0.0010691219,0.000409618,0.13699579,0.000001931595,0.00001166684,0.00009840094,0.00016491125,0.000019618186,0.2822552,0.000035440764,0.57857686,0.0003614345],"about_ca_topic_score_codex":0.000006273215,"about_ca_topic_score_gemma":0.0000056986487,"teacher_disagreement_score":0.59349185,"about_ca_system_score_codex":0.0000039728293,"about_ca_system_score_gemma":0.000014350425,"threshold_uncertainty_score":0.1983459},"labels":[],"label_agreement":null},{"id":"W7117471630","doi":"10.1186/s12915-025-02455-w","title":"ntSynt: multi-genome synteny detection using minimizer graph mappings","year":2025,"lang":"en","type":"article","venue":"BMC Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Canada's Michael Smith Genome Sciences Centre","funders":"Canadian Institutes of Health Research","keywords":"Synteny; Scalability; Graph; Tree (set theory); Supertree; Graph theory","score_opus":0.025885339511566394,"score_gpt":0.28384065305423656,"score_spread":0.25795531354267015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117471630","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.7632699,0.0016185772,0.23362659,0.000051933424,0.0005607322,0.00029913045,0.000020696889,0.00003210363,0.00052032736],"genre_scores_gemma":[0.9802768,0.00012825258,0.017338691,0.00025948117,0.00017152837,0.000041801315,0.000101270176,0.000022094287,0.001660039],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987749,0.0001063224,0.00024126479,0.00048861344,0.000042513668,0.00034642793],"domain_scores_gemma":[0.9994184,0.000014614739,0.00008299277,0.0003488478,0.00008446401,0.00005072207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018217732,0.00019130563,0.00019723488,0.00017414837,0.000110438064,0.000015099648,0.00021390273,0.0003136238,0.000028032393],"category_scores_gemma":[0.0000879697,0.0001866654,0.00013537063,0.00020168505,0.00012651268,0.0000025763206,0.00017534068,0.00009137498,0.000024646837],"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.000048072612,0.000042997406,0.0070390664,0.00002696065,0.00009267688,7.3351583e-7,0.000013174621,0.00004305301,0.9908297,0.00003645776,0.000022269753,0.0018048513],"study_design_scores_gemma":[0.005731404,0.0007137824,0.08427231,0.000068170615,0.00028807405,0.00008295334,0.0005006131,0.0041282284,0.6841591,0.001020279,0.21752165,0.0015134623],"about_ca_topic_score_codex":0.000075121214,"about_ca_topic_score_gemma":0.00011114929,"teacher_disagreement_score":0.3066706,"about_ca_system_score_codex":0.000030361376,"about_ca_system_score_gemma":0.00006145224,"threshold_uncertainty_score":0.7611995},"labels":[],"label_agreement":null},{"id":"W7117674191","doi":"10.6084/m9.figshare.30969884.v1","title":"Additional file 1 of ntSynt: multi-genome synteny detection using minimizer graph mappings","year":2025,"lang":"","type":"article","venue":"Open MIND","topic":"Genome Rearrangement Algorithms","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":"University of British Columbia; Canada's Michael Smith Genome Sciences Centre","funders":"","keywords":"Graph; Table (database); Graph theory; Synteny","score_opus":0.028402739039979523,"score_gpt":0.2784894535852914,"score_spread":0.2500867145453119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117674191","genre_codex":"dataset","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06589926,0.0014206625,0.0073593454,0.00011903474,0.00074091385,0.0025506692,0.89816594,0.0000028929887,0.02374129],"genre_scores_gemma":[0.31912893,0.00035951243,0.34781107,0.000261879,0.00072878425,0.00095936423,0.20440401,0.00018266204,0.1261638],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977936,0.000120446595,0.00062495825,0.0008259806,0.00020421625,0.00043079493],"domain_scores_gemma":[0.99851364,0.00011328364,0.00039738632,0.0005466554,0.00031999534,0.00010902893],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020519888,0.00034928654,0.0004169841,0.00024327752,0.00021850236,0.00012442906,0.00066267356,0.00038075788,0.61454535],"category_scores_gemma":[0.0003564384,0.00040549756,0.00026642703,0.00046541108,0.00023828296,0.000019329065,0.0007693608,0.00016881696,0.00022357817],"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.0002549994,0.00060121727,0.00002235767,0.00011837595,0.0010916704,0.000010701392,0.00013672454,0.00012370013,0.8189632,5.9162943e-7,0.06129612,0.117380336],"study_design_scores_gemma":[0.0011020275,0.00015801296,0.00074909074,0.00039442582,0.0001653194,0.00001488328,0.00043289954,0.0013854401,0.08031063,0.000012687909,0.9148524,0.00042222723],"about_ca_topic_score_codex":0.000053128602,"about_ca_topic_score_gemma":0.00007064039,"teacher_disagreement_score":0.8535562,"about_ca_system_score_codex":0.000073750525,"about_ca_system_score_gemma":0.0004242496,"threshold_uncertainty_score":0.99983966},"labels":[],"label_agreement":null},{"id":"W7130718553","doi":"10.6084/m9.figshare.30969884","title":"Additional file 1 of ntSynt: multi-genome synteny detection using minimizer graph mappings","year":2025,"lang":"","type":"article","venue":"Figshare","topic":"Genome Rearrangement Algorithms","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":"University of British Columbia; Canada's Michael Smith Genome Sciences Centre","funders":"","keywords":"Graph; Table (database); Graph theory; Synteny","score_opus":0.023872351935037495,"score_gpt":0.24132222048815394,"score_spread":0.21744986855311643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7130718553","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023442369,0.0011747424,0.00012895021,0.000016536458,0.00012096005,0.0004948177,0.99610454,0.00001581654,0.0017092142],"genre_scores_gemma":[0.013966334,0.000023110377,0.0036371618,0.00010968899,0.00022948981,0.0006683093,0.9756464,0.000045572975,0.0056739524],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799156,0.000081582046,0.00052898127,0.0006982702,0.00023593439,0.0004636787],"domain_scores_gemma":[0.99831223,0.00017362964,0.00038717542,0.00049647543,0.0005196312,0.000110844616],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000041913154,0.0003796049,0.0003520124,0.00028459038,0.0001907835,0.00004926273,0.000372521,0.0004755955,0.97105837],"category_scores_gemma":[0.0019528692,0.00045338567,0.00039628492,0.0005105715,0.000048908696,0.000012027644,0.0004033584,0.00020258992,0.0006077791],"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.00004285661,0.00016678406,0.0000017913237,0.00059569563,0.00040410494,0.0000057190523,0.000023557071,0.000073682895,0.08001336,1.7350862e-7,0.9140959,0.004576403],"study_design_scores_gemma":[0.00060095376,0.000101135185,0.0011183907,0.003014202,0.00006718578,0.000012294102,0.0001067178,0.0018288615,0.020345077,0.000007905107,0.9723735,0.00042381533],"about_ca_topic_score_codex":0.00000936342,"about_ca_topic_score_gemma":0.000015927346,"teacher_disagreement_score":0.97045064,"about_ca_system_score_codex":0.00007876324,"about_ca_system_score_gemma":0.000333101,"threshold_uncertainty_score":0.9997918},"labels":[],"label_agreement":null},{"id":"W7132883117","doi":"","title":"Genome Graphs","year":2010,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Genome Rearrangement Algorithms","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":"University of Toronto","funders":"","keywords":"Genome; Hybrid genome assembly; Shotgun sequencing; DNA sequencing; Reference genome; Genomics; Sequence (biology); Sequence assembly","score_opus":0.008151719719698882,"score_gpt":0.28928679028769594,"score_spread":0.2811350705679971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132883117","genre_codex":"empirical","genre_gemma":"other","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.9464577,0.0020405839,0.00002677818,0.000046378416,0.00078979786,0.0002582976,0.000010179322,0.000023880313,0.050346415],"genre_scores_gemma":[0.44156894,0.0015557094,0.0024002735,0.00012329177,0.0012090943,0.00013045344,0.015447219,0.00022250887,0.5373425],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990814,0.000016883652,0.00012544452,0.0003837211,0.00015166821,0.00024092832],"domain_scores_gemma":[0.9992615,0.0000022233155,0.00010601511,0.00046588457,0.00008550687,0.000078887715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008158321,0.00023107548,0.00016223824,0.00007506169,0.000056286506,0.000026389383,0.00025548387,0.0005197136,0.00031498962],"category_scores_gemma":[0.000021856926,0.00024171185,0.0001330637,0.00007214902,0.000022061735,7.4702183e-7,0.000033690903,0.00025703674,0.00015192677],"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.000025767888,0.000021859449,0.000040536885,0.00004336408,0.00006899361,0.0000029189325,0.00030053678,0.000001085635,0.99759555,0.000026856764,0.00074292574,0.0011296354],"study_design_scores_gemma":[0.0005628098,0.00024242082,0.015631767,0.0000215798,0.00011752702,0.00001040169,0.0013558614,0.000002478284,0.26497272,0.00026403964,0.7159409,0.00087749783],"about_ca_topic_score_codex":0.000026482163,"about_ca_topic_score_gemma":0.0002843677,"teacher_disagreement_score":0.7326228,"about_ca_system_score_codex":0.0000073147767,"about_ca_system_score_gemma":0.00007434961,"threshold_uncertainty_score":0.98567235},"labels":[],"label_agreement":null},{"id":"W84701360","doi":"","title":"On the Analysis of an Algorithm to Generate a Random Cyclic Permutation.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Random permutation; Permutation (music); Algorithm; Combinatorics; Symmetric group","score_opus":0.011586855971283309,"score_gpt":0.23659800854443166,"score_spread":0.22501115257314835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84701360","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.9981652,0.00016857704,0.00038756448,0.00023867494,0.00020301915,0.00023879872,0.00002254536,0.0000089961095,0.00056663196],"genre_scores_gemma":[0.9983219,0.00004145143,0.0007124881,0.0002990219,0.00001735561,0.000044332955,0.00008254485,0.000016470833,0.0004644694],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905205,0.00011677877,0.0001875012,0.000274644,0.00019401772,0.0001750266],"domain_scores_gemma":[0.9992269,0.000030092584,0.00007106415,0.0004921663,0.00009835527,0.00008138302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002234678,0.00012648053,0.00018766572,0.00012588443,0.00007879459,0.000023737684,0.00024470052,0.000063775784,0.00015657922],"category_scores_gemma":[0.00006587619,0.00009805001,0.00013223647,0.0005292078,0.000034019293,0.0000031211766,0.00004926517,0.00005300565,0.00003669147],"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.00035907645,0.0024932292,0.0020890748,0.000028695595,0.008660871,0.00003378307,0.003269355,0.014891315,0.7967958,0.036176994,0.016940098,0.118261725],"study_design_scores_gemma":[0.01747866,0.0057023535,0.040335357,0.000042967466,0.003841301,0.0000168532,0.0010114483,0.23503532,0.63637596,0.03758526,0.020006573,0.0025679795],"about_ca_topic_score_codex":0.000016360398,"about_ca_topic_score_gemma":0.0000063744105,"teacher_disagreement_score":0.22014399,"about_ca_system_score_codex":0.000013263442,"about_ca_system_score_gemma":0.000008492488,"threshold_uncertainty_score":0.39983633},"labels":[],"label_agreement":null},{"id":"W976619511","doi":"10.1007/978-1-4471-5298-9_11","title":"Fractionation, Rearrangement, Consolidation, Reconstruction","year":2013,"lang":"en","type":"book-chapter","venue":"Computational biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Genome; Synteny; Biology; Adjacency list; Extant taxon; Computational biology; Evolutionary biology; Gene; Genetics; Computer science; Algorithm","score_opus":0.016141983210919347,"score_gpt":0.24900711394946295,"score_spread":0.23286513073854362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W976619511","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034665621,0.002484734,0.050100755,0.001225834,0.0024205898,0.0014249297,0.000430769,0.00011977017,0.93832606],"genre_scores_gemma":[0.040966213,0.0015918532,0.031023365,0.001451301,0.0037822365,0.00022190926,0.037566494,0.00022606808,0.88317055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986331,0.00003960903,0.00040906324,0.0005766105,0.00014882028,0.00019283457],"domain_scores_gemma":[0.9986778,0.000037103873,0.00034683818,0.00026390812,0.0005987108,0.00007567229],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012597842,0.0002948808,0.00023462134,0.00017998478,0.0001236994,0.000031102976,0.00017511105,0.0005116204,0.0029992845],"category_scores_gemma":[0.00004688492,0.00032107648,0.00012558156,0.000028270408,0.00019887168,0.000007191756,0.00009501634,0.00017356704,0.001274037],"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.00013137686,0.00013332172,0.0015287804,0.00013277333,0.0023934627,0.000006046557,0.0000644483,0.003563522,0.044267982,0.42487723,0.26490992,0.25799114],"study_design_scores_gemma":[0.00051755726,0.00018109544,0.000611256,0.000023029917,0.000047841975,0.00007569751,0.0000072676326,0.0002608432,0.00023521655,0.10414737,0.89343905,0.00045375386],"about_ca_topic_score_codex":0.0000053797326,"about_ca_topic_score_gemma":0.0000044450344,"teacher_disagreement_score":0.62852913,"about_ca_system_score_codex":0.00005939408,"about_ca_system_score_gemma":0.00015121255,"threshold_uncertainty_score":0.9999241},"labels":[],"label_agreement":null}]}