{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05544776,0.004152322,0.8786302,0.0062885513,0.00064187584,0.0005623337,0.002953848,0.0058298223,0.045493323],"genre_scores_gemma":[0.1773624,0.002173557,0.7905567,0.0009805266,0.00064912456,0.0009341147,0.0062896265,0.0019452681,0.019108651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962483,0.00076735346,0.00022410582,0.0011225934,0.0009899859,0.00064758724],"domain_scores_gemma":[0.98657066,0.009648491,0.0005680776,0.0019737412,0.0007642407,0.00047480146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003117749,0.0030399053,0.0031415753,0.0022353705,0.0026135535,0.0077398284,0.0076185674,0.0040884465,0.021555413],"category_scores_gemma":[0.016811715,0.0017871215,0.0036800103,0.006440784,0.003251,0.015324936,0.0048555895,0.008740991,0.00497341],"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.0023800104,0.0011120979,0.0012408716,0.0013694864,0.00027281893,0.00016512348,0.000850567,0.13695064,0.0065531298,0.32439837,0.09214701,0.43255985],"study_design_scores_gemma":[0.0007351755,0.000111993904,0.00051329343,0.00009206193,0.00015554496,0.00021729518,0.00028731354,0.28810543,0.0029351013,0.6953311,0.011449991,0.000065726905],"about_ca_topic_score_codex":0.0059500365,"about_ca_topic_score_gemma":0.009248283,"teacher_disagreement_score":0.021555413,"about_ca_system_score_codex":0.0064146584,"about_ca_system_score_gemma":0.0057342877,"threshold_uncertainty_score":0.07211006},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07082122,0.0035059548,0.75540084,0.0053927675,0.00096666336,0.00037364196,0.0011900214,0.002693942,0.1596549],"genre_scores_gemma":[0.39672428,0.0011011406,0.55466,0.0014098424,0.0005216813,0.00042213892,0.0019424614,0.0009929503,0.042225488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981704,0.0005795416,0.00011967811,0.00037270912,0.00058565376,0.00017193165],"domain_scores_gemma":[0.9945365,0.003008067,0.0003465375,0.0009552098,0.0008939426,0.0002597442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002830452,0.00058814976,0.0010404909,0.0020823604,0.0011852583,0.0029757328,0.0023688483,0.0020102628,0.02641507],"category_scores_gemma":[0.020895774,0.00039776138,0.0007645214,0.0023850312,0.0014367022,0.0035548513,0.00269741,0.0021431963,0.0044844127],"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.00016764725,0.00010299901,0.0017803757,0.00021652255,0.00004477554,0.00008899552,0.00012178662,0.049738165,0.00077261426,0.6754056,0.026284201,0.24527635],"study_design_scores_gemma":[0.000091942995,0.000069416645,0.0006927727,0.00007354983,0.00003795558,0.000256192,0.000090483896,0.5296799,0.0011809132,0.43098512,0.036816414,0.00002548696],"about_ca_topic_score_codex":0.0047928942,"about_ca_topic_score_gemma":0.0054195337,"teacher_disagreement_score":0.02641507,"about_ca_system_score_codex":0.0018249785,"about_ca_system_score_gemma":0.0020055883,"threshold_uncertainty_score":0.088367224},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04604973,0.0010358439,0.9422526,0.00054806325,0.00014402396,0.0003165756,0.0005965597,0.0048598894,0.004196678],"genre_scores_gemma":[0.14247334,0.0004307988,0.84750646,0.00025556228,0.00006808229,0.00048791317,0.0019411909,0.00065536227,0.0061811884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776685,0.00044283713,0.00022726686,0.00072205154,0.00059105566,0.000249934],"domain_scores_gemma":[0.9964798,0.0017115908,0.00033157974,0.0006613894,0.00070588687,0.00010984842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032249957,0.0015671536,0.002012423,0.0040839715,0.0022649493,0.003610592,0.0032507589,0.0024159465,0.0077417744],"category_scores_gemma":[0.008452042,0.0011137452,0.0034273802,0.0034341654,0.001322249,0.0028139881,0.0026388867,0.0018485051,0.002240319],"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.0006744532,0.00022833991,0.010395026,0.0007963137,0.0004692958,0.0006138653,0.0013908555,0.2490228,0.015635602,0.04320828,0.007678914,0.6698863],"study_design_scores_gemma":[0.00018021942,0.00022807586,0.0047235643,0.0002379028,0.0003768391,0.00073759357,0.00064280146,0.8617725,0.017588032,0.079715796,0.033681586,0.00011512163],"about_ca_topic_score_codex":0.0073238565,"about_ca_topic_score_gemma":0.0087324055,"teacher_disagreement_score":0.0077417744,"about_ca_system_score_codex":0.0021978396,"about_ca_system_score_gemma":0.0029802306,"threshold_uncertainty_score":0.025898814},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001487612,0.00035384885,0.95097107,0.001004694,0.0005251257,0.00038933344,0.0012386114,0.022532806,0.021496868],"genre_scores_gemma":[0.012355549,0.00027349652,0.95003545,0.0005677225,0.00017958267,0.00041836008,0.0026925828,0.0045208563,0.028956346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981389,0.0002727866,0.00018281881,0.0006081083,0.0006222179,0.00017528441],"domain_scores_gemma":[0.9978732,0.0008144717,0.00009806613,0.0004780914,0.0005544127,0.00018181033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018743086,0.002369589,0.0010227658,0.002971106,0.0017435952,0.0036353858,0.0039247824,0.0018645205,0.092851594],"category_scores_gemma":[0.007506367,0.0014492266,0.0022862472,0.0024836857,0.0014718791,0.0051984102,0.0052052974,0.002985858,0.04160555],"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.0003569211,0.00022640817,0.0007120279,0.0005345669,0.00008785208,0.00024889584,0.0002892156,0.004171619,0.004038871,0.15153944,0.15525983,0.6825343],"study_design_scores_gemma":[0.000325334,0.00009755451,0.0003831427,0.00021459712,0.00009600325,0.00083180884,0.00028703935,0.06620135,0.01315935,0.35186678,0.5664209,0.00011609582],"about_ca_topic_score_codex":0.0018761024,"about_ca_topic_score_gemma":0.00340023,"teacher_disagreement_score":0.092851594,"about_ca_system_score_codex":0.0019909022,"about_ca_system_score_gemma":0.0027405561,"threshold_uncertainty_score":0.31061953},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006936894,0.0023868599,0.9701376,0.0007031416,0.00031034715,0.00005364167,0.0009342564,0.007358243,0.0111790635],"genre_scores_gemma":[0.07611661,0.0015053326,0.9097438,0.00052785076,0.00019928109,0.00019424212,0.0034944883,0.0029936486,0.0052248035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979595,0.0008586337,0.00008292094,0.0004879752,0.00053638127,0.00007458889],"domain_scores_gemma":[0.99209845,0.0048746895,0.00017574757,0.0022358974,0.0004928041,0.00012237817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004267144,0.0012693035,0.0018574197,0.0034059903,0.0011657581,0.0021403683,0.005064525,0.0018030608,0.018079314],"category_scores_gemma":[0.014656635,0.0008411847,0.0013622604,0.0041590747,0.0014416656,0.006835052,0.0041561015,0.002187248,0.0058636456],"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.0005435323,0.00014252782,0.0014456176,0.0007366805,0.00046665577,0.0001554447,0.00022978474,0.0678794,0.00962084,0.18972297,0.03827421,0.6907824],"study_design_scores_gemma":[0.000060758313,0.0000659641,0.0006594605,0.000100895486,0.00010522513,0.00038164624,0.0000897626,0.31670162,0.0074202865,0.6186009,0.055761177,0.000052260188],"about_ca_topic_score_codex":0.0016533147,"about_ca_topic_score_gemma":0.0017734297,"teacher_disagreement_score":0.018079314,"about_ca_system_score_codex":0.0008578986,"about_ca_system_score_gemma":0.0010282956,"threshold_uncertainty_score":0.06048131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057245656,0.0009165837,0.9726609,0.00015964545,0.00006246478,0.0003885144,0.0020736395,0.016633427,0.0013802303],"genre_scores_gemma":[0.00946773,0.00033709093,0.98225164,0.000047178404,0.000020880378,0.00038946228,0.005530447,0.0007292532,0.0012262749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984756,0.0002623572,0.00020779295,0.00039539515,0.0005371884,0.00012164889],"domain_scores_gemma":[0.9938945,0.003871179,0.00034272694,0.0007541169,0.000976315,0.00016113339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003249852,0.0028751392,0.0024549938,0.006477661,0.0017609935,0.0042524585,0.004919573,0.00222929,0.015637504],"category_scores_gemma":[0.01157337,0.0020524296,0.0027810188,0.0073703416,0.001074248,0.00420128,0.0033588714,0.0030575534,0.011978664],"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.0005375574,0.00017512037,0.0012514453,0.0010202351,0.00022668853,0.00021023225,0.00045344493,0.01211212,0.022784201,0.017250404,0.027671114,0.9163074],"study_design_scores_gemma":[0.00093025994,0.00041188192,0.0068721003,0.00048964063,0.00068319455,0.0018590513,0.0009338728,0.5730445,0.07119621,0.23487796,0.108429834,0.0002714373],"about_ca_topic_score_codex":0.0039442205,"about_ca_topic_score_gemma":0.0073253023,"teacher_disagreement_score":0.015637504,"about_ca_system_score_codex":0.0012142105,"about_ca_system_score_gemma":0.002297139,"threshold_uncertainty_score":0.05231273},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064729685,0.004801626,0.93210983,0.003154769,0.00037998694,0.000039701154,0.000282178,0.0005391497,0.05221984],"genre_scores_gemma":[0.30318668,0.0152183,0.61969924,0.0025065944,0.0024407166,0.00043077674,0.0015110795,0.00096107187,0.054045532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992834,0.00018040542,0.000040988838,0.00019727004,0.00022324032,0.000074762735],"domain_scores_gemma":[0.99921024,0.000391398,0.00005156911,0.00021850536,0.00007313571,0.00005505777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008942262,0.000894101,0.0010440248,0.002321258,0.0015985805,0.004496584,0.0033723596,0.0023205578,0.011716181],"category_scores_gemma":[0.0022847871,0.00065136224,0.0015459226,0.0030315265,0.0040891995,0.012058482,0.0026925707,0.0033752937,0.0023378],"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.000005409169,0.0000027873957,0.00004820882,0.000021415273,0.00000257957,0.00002158437,0.00008617116,0.002406912,0.00024349226,0.9834208,0.001292483,0.012448187],"study_design_scores_gemma":[0.0000029169619,0.0000029511602,0.000031964064,0.000008244686,0.0000036096562,0.000047293102,0.000026086069,0.006757229,0.00010101037,0.9828965,0.010118354,0.0000037748757],"about_ca_topic_score_codex":0.0019416912,"about_ca_topic_score_gemma":0.001715017,"teacher_disagreement_score":0.011716181,"about_ca_system_score_codex":0.0010521584,"about_ca_system_score_gemma":0.00062283454,"threshold_uncertainty_score":0.039194524},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44439784,0.0015540426,0.53985536,0.00023614315,0.000113928356,0.00020799869,0.0040535624,0.004796419,0.004784639],"genre_scores_gemma":[0.56266564,0.00066319166,0.4197433,0.000121398596,0.00014365387,0.00014352569,0.013824118,0.0005380928,0.0021571128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884796,0.00013746868,0.00007844174,0.000554197,0.00027609387,0.000105767926],"domain_scores_gemma":[0.9968088,0.0019942648,0.00031216932,0.00049510726,0.0002534153,0.0001361268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011166981,0.0007813073,0.0014331609,0.005736961,0.0008732862,0.0015347112,0.00255657,0.0014869672,0.0049193026],"category_scores_gemma":[0.0076013035,0.00087328407,0.0013809031,0.0061337883,0.00064514944,0.0028651187,0.0020841616,0.00095027493,0.0016485042],"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.0033459924,0.0006031124,0.049147513,0.0012453687,0.00040568665,0.0036034526,0.001407431,0.04955104,0.087272495,0.042201355,0.011267359,0.74994916],"study_design_scores_gemma":[0.00051894045,0.0006921526,0.016368829,0.00019005394,0.0007674419,0.0036041625,0.001563145,0.7234358,0.059921883,0.17849474,0.014330186,0.000112671114],"about_ca_topic_score_codex":0.002054503,"about_ca_topic_score_gemma":0.0036393171,"teacher_disagreement_score":0.005736961,"about_ca_system_score_codex":0.0004216048,"about_ca_system_score_gemma":0.0006585556,"threshold_uncertainty_score":0.016456664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11120433,0.0029664328,0.48186442,0.002921819,0.0019365083,0.000121665624,0.00051563286,0.0018123199,0.3966569],"genre_scores_gemma":[0.65944326,0.0017082483,0.106655546,0.0010489962,0.00082557014,0.00017665631,0.0006437738,0.0013943347,0.22810362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992207,0.00014130643,0.00004647857,0.0002417029,0.00021935262,0.00013048807],"domain_scores_gemma":[0.9978243,0.00093196245,0.000102238344,0.00075951044,0.00024136306,0.00014064384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007176361,0.00059490756,0.0009829135,0.0010094523,0.0015630532,0.0018626056,0.0014271159,0.0012397063,0.024015814],"category_scores_gemma":[0.0070870607,0.0005842444,0.0007118634,0.0010369952,0.0022107488,0.004472255,0.003008741,0.003066364,0.006889328],"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.00009066753,0.000018794766,0.00019808802,0.00007394163,0.0000068351414,0.00012283248,0.000108050845,0.0017926466,0.0015896576,0.93061495,0.006228957,0.059154563],"study_design_scores_gemma":[0.000017923121,0.000049375598,0.00015883283,0.000020501473,0.000011536181,0.00031912787,0.000062037274,0.0063006687,0.0023781003,0.9669543,0.02370742,0.000020173253],"about_ca_topic_score_codex":0.00033263504,"about_ca_topic_score_gemma":0.00052418525,"teacher_disagreement_score":0.024015814,"about_ca_system_score_codex":0.00048886635,"about_ca_system_score_gemma":0.00053353695,"threshold_uncertainty_score":0.08034092},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078403234,0.00050566683,0.8616874,0.0005628292,0.00029928173,0.00019875882,0.00081294344,0.0019830018,0.055546857],"genre_scores_gemma":[0.2680612,0.00045938048,0.70588785,0.0002573335,0.000059462964,0.0001434613,0.0022382943,0.000663969,0.022229088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994993,0.00007684759,0.00003801856,0.00013696677,0.00013697043,0.000111784335],"domain_scores_gemma":[0.99904877,0.0002687699,0.000047979604,0.0003602567,0.00016962523,0.00010457815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005367957,0.000438404,0.0006695419,0.00084811356,0.0012309983,0.001309209,0.0016347776,0.00094715826,0.01023703],"category_scores_gemma":[0.0017262601,0.00055448647,0.0010162765,0.00082450337,0.001083468,0.0020183339,0.002680291,0.0021261375,0.0029203142],"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.0003081791,0.00011622402,0.0014439251,0.0009161775,0.00006676514,0.00030674879,0.0010311427,0.011905194,0.0515519,0.5845662,0.017148659,0.33063892],"study_design_scores_gemma":[0.00007562506,0.00026066933,0.0022492178,0.00025969392,0.00015339107,0.0006839551,0.00047032975,0.051943842,0.05249252,0.795473,0.09585443,0.00008330094],"about_ca_topic_score_codex":0.0008898884,"about_ca_topic_score_gemma":0.0019047462,"teacher_disagreement_score":0.01023703,"about_ca_system_score_codex":0.001008677,"about_ca_system_score_gemma":0.00084047596,"threshold_uncertainty_score":0.034246325},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7768802,0.00047167813,0.20783453,0.001073942,0.00013939689,0.0002822974,0.0028832199,0.0019839446,0.00845083],"genre_scores_gemma":[0.9391905,0.00007299655,0.05261514,0.0002854183,0.00015727278,0.00015552176,0.0055483067,0.00026707805,0.0017077718],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99142164,0.0035007922,0.0005212771,0.0020793309,0.0016519894,0.00082493946],"domain_scores_gemma":[0.881454,0.10119206,0.0040135668,0.0059484295,0.004584999,0.0028070377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050237756,0.0011369176,0.0019607935,0.0039436324,0.0015959115,0.0023276494,0.0037809897,0.0030079558,0.0077565564],"category_scores_gemma":[0.06596929,0.0005582176,0.0014006096,0.0030640794,0.002490078,0.003054864,0.0028613217,0.0014784975,0.0011910581],"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.013139284,0.0012083501,0.3478239,0.0014247508,0.0021127085,0.0030426236,0.000919594,0.18554233,0.049027987,0.11068976,0.019391306,0.26567745],"study_design_scores_gemma":[0.00097119255,0.0016434161,0.04761937,0.0001018216,0.0005348267,0.0023773003,0.0010680195,0.6311369,0.020704709,0.28979063,0.0038843,0.00016750189],"about_ca_topic_score_codex":0.0011984115,"about_ca_topic_score_gemma":0.001783606,"teacher_disagreement_score":0.0077565564,"about_ca_system_score_codex":0.0005806128,"about_ca_system_score_gemma":0.0015069734,"threshold_uncertainty_score":0.026568592},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4934127,0.00018946889,0.48996338,0.00034361889,0.00010548575,0.00036499012,0.0008683636,0.0025104072,0.012241653],"genre_scores_gemma":[0.6401065,0.00015002751,0.3520146,0.00008756921,0.000038962247,0.00016292681,0.0027960031,0.00040637128,0.004237015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988175,0.00021116105,0.00011698468,0.00028048718,0.0003462364,0.00022754134],"domain_scores_gemma":[0.99693465,0.0016248989,0.000325587,0.00060562097,0.00033942834,0.00016972049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005567404,0.00078121043,0.0011650476,0.0007842881,0.0008481183,0.0020329752,0.0013629242,0.0010313665,0.0060201995],"category_scores_gemma":[0.005893437,0.0007025269,0.0011899616,0.0012772987,0.001204342,0.002961222,0.0016877474,0.0009798076,0.0011076359],"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.0011546308,0.0003227734,0.008820598,0.00064694526,0.00010705768,0.0011952155,0.00064956996,0.5173606,0.058280535,0.07567759,0.0059359428,0.3298485],"study_design_scores_gemma":[0.00014151157,0.00035633083,0.0016060309,0.000045104505,0.00005247296,0.0003219012,0.0004411552,0.82688504,0.035236787,0.12798208,0.0068827015,0.00004889879],"about_ca_topic_score_codex":0.0021564008,"about_ca_topic_score_gemma":0.0036959192,"teacher_disagreement_score":0.0060201995,"about_ca_system_score_codex":0.0010358972,"about_ca_system_score_gemma":0.0009851336,"threshold_uncertainty_score":0.020139515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03791762,0.17693666,0.6645897,0.0073460094,0.0038585858,0.00007215716,0.0011793339,0.0009402964,0.10715959],"genre_scores_gemma":[0.42918018,0.13198017,0.38304535,0.0019702185,0.006248927,0.00020401904,0.002968396,0.00092283386,0.04347989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987312,0.00027531543,0.000056040506,0.00042141363,0.00045235056,0.000063637905],"domain_scores_gemma":[0.99731475,0.0016247148,0.00016970249,0.00034693503,0.00043994267,0.000104029205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014335418,0.00087214273,0.0013121589,0.002660203,0.0006031699,0.0016032966,0.002000201,0.0010925548,0.0077558453],"category_scores_gemma":[0.007802241,0.0005484222,0.0006482398,0.004086678,0.0013080948,0.0053473325,0.0027307668,0.0027586808,0.0027757764],"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.00009517225,0.000030991516,0.0010440378,0.00075275206,0.00006153602,0.000058097183,0.000110831716,0.020433808,0.0044338377,0.58319515,0.011237471,0.37854627],"study_design_scores_gemma":[0.000026332891,0.00007039705,0.0016892055,0.0002443361,0.00006496082,0.00043090965,0.00011773389,0.08267736,0.0060301083,0.7241226,0.18446541,0.000060613984],"about_ca_topic_score_codex":0.0010982685,"about_ca_topic_score_gemma":0.0009963613,"teacher_disagreement_score":0.0077558453,"about_ca_system_score_codex":0.0020051054,"about_ca_system_score_gemma":0.00075568317,"threshold_uncertainty_score":0.025945902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21078037,0.0017600674,0.69564915,0.004678311,0.00048895524,0.00027908984,0.00065910857,0.00043009783,0.085274816],"genre_scores_gemma":[0.6905023,0.0022854398,0.26754355,0.0011222861,0.0014526094,0.0004250875,0.0027903067,0.0006742562,0.03320419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976125,0.0008765941,0.00016432967,0.00051144604,0.00058706506,0.00024817558],"domain_scores_gemma":[0.9886077,0.0091053005,0.00045636258,0.0008087943,0.0006176529,0.0004042493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002552091,0.00091855455,0.0018497743,0.0015950456,0.0023703373,0.0039500324,0.0029789165,0.004194746,0.013208769],"category_scores_gemma":[0.017474433,0.0010528439,0.0019142466,0.00389933,0.0038293118,0.012555367,0.004542298,0.0063565164,0.0014975193],"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.00019466178,0.00010533432,0.00074522285,0.00027040497,0.00003053418,0.00043748683,0.0005039204,0.015086094,0.0016304227,0.9334171,0.0061727874,0.041406047],"study_design_scores_gemma":[0.000031139312,0.000020663369,0.00029320002,0.000031317435,0.000012010451,0.00018204108,0.00008344956,0.026268883,0.00035420698,0.96906,0.003646048,0.000016929569],"about_ca_topic_score_codex":0.0014199838,"about_ca_topic_score_gemma":0.00091864466,"teacher_disagreement_score":0.013208769,"about_ca_system_score_codex":0.0011719592,"about_ca_system_score_gemma":0.00088634144,"threshold_uncertainty_score":0.044187784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20986913,0.0018585047,0.77230173,0.0009906042,0.00022011234,0.00019766527,0.00067909056,0.0027343428,0.011148912],"genre_scores_gemma":[0.64356107,0.0010291713,0.34780553,0.0002843258,0.00027292542,0.00029516354,0.0014864156,0.0008551101,0.0044103987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802566,0.0007966843,0.00010729922,0.000373543,0.00040414598,0.00029268407],"domain_scores_gemma":[0.9631005,0.031640522,0.0008564828,0.0025183875,0.0011049462,0.0007792461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005939782,0.0018187551,0.0030652594,0.0029910693,0.0015407226,0.0032272558,0.005641181,0.0035808606,0.0083070025],"category_scores_gemma":[0.041309077,0.0013726746,0.0017743331,0.004640024,0.0024208226,0.008641298,0.0041794525,0.0037099996,0.0011986295],"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.00065562956,0.00014477555,0.00311379,0.0001380315,0.00007536874,0.0000834466,0.00016200723,0.8801674,0.0011035654,0.039311174,0.0032037061,0.07184112],"study_design_scores_gemma":[0.000021767799,0.000020299885,0.00020173388,0.000010346998,0.0000110033825,0.000020739744,0.000022073069,0.9629416,0.00028635413,0.036280293,0.0001751493,0.0000086236505],"about_ca_topic_score_codex":0.007156958,"about_ca_topic_score_gemma":0.006187384,"teacher_disagreement_score":0.0083070025,"about_ca_system_score_codex":0.001943901,"about_ca_system_score_gemma":0.0015693376,"threshold_uncertainty_score":0.03141296},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12775266,0.0012141531,0.85339105,0.00027900893,0.00027017237,0.00020463429,0.000613177,0.0025286283,0.013746511],"genre_scores_gemma":[0.40535036,0.0016583089,0.5732431,0.00017756148,0.000111990776,0.0001764302,0.002428442,0.0010425984,0.01581115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995005,0.000090450056,0.00003419249,0.00022151189,0.000100442994,0.00005284999],"domain_scores_gemma":[0.9990854,0.00049913116,0.00012172469,0.00020518323,0.0000528156,0.000035834124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008161678,0.0005073848,0.000843285,0.0009514581,0.00046530575,0.0011267118,0.0012906664,0.0006810676,0.006026354],"category_scores_gemma":[0.0021329536,0.00061419,0.0012773874,0.0015696253,0.0011744536,0.0016254637,0.0008923911,0.0010758927,0.002335749],"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.0010085328,0.00014386888,0.0053981617,0.00089111255,0.00015372607,0.0007178423,0.00048551537,0.07994037,0.1855119,0.15675266,0.0075097797,0.56148654],"study_design_scores_gemma":[0.00029362534,0.0006870913,0.006369035,0.00016191999,0.00038978958,0.0040276386,0.0005121235,0.39129788,0.18837442,0.33979917,0.06792962,0.00015764452],"about_ca_topic_score_codex":0.0005213942,"about_ca_topic_score_gemma":0.00096718123,"teacher_disagreement_score":0.006026354,"about_ca_system_score_codex":0.00037148158,"about_ca_system_score_gemma":0.00037909046,"threshold_uncertainty_score":0.020160198},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035426437,0.0005329983,0.9923673,0.00060900714,0.000054061507,0.000021394211,0.00015768613,0.00075611356,0.0019587297],"genre_scores_gemma":[0.028234899,0.00057753705,0.96845543,0.00014083255,0.000058430924,0.00007693642,0.00031137685,0.000670002,0.0014745874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953866,0.0001312038,0.000030433366,0.0001644558,0.000104304534,0.00003110828],"domain_scores_gemma":[0.9986842,0.0010226095,0.000051961273,0.00012243276,0.00006899102,0.000049779646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015307122,0.0009259859,0.0012301315,0.0011002341,0.0007163887,0.002674686,0.0024209956,0.0016224611,0.007376613],"category_scores_gemma":[0.00567143,0.0012267459,0.001553037,0.0017586089,0.001451243,0.0053164447,0.0016856464,0.0035379922,0.0019985503],"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.0001341852,0.000084955194,0.00095140445,0.00049453677,0.00018573953,0.0001310587,0.00027330377,0.29342458,0.0043172394,0.17049812,0.018098803,0.511406],"study_design_scores_gemma":[0.000024680789,0.000015664218,0.00013706456,0.00005191228,0.000041775627,0.00009293775,0.000045213408,0.58875686,0.00158672,0.40161866,0.0076017547,0.000026846807],"about_ca_topic_score_codex":0.0015982061,"about_ca_topic_score_gemma":0.0028126931,"teacher_disagreement_score":0.007376613,"about_ca_system_score_codex":0.0007236356,"about_ca_system_score_gemma":0.0009760569,"threshold_uncertainty_score":0.024677217},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5298603,0.02018764,0.38706723,0.005169132,0.0017559333,0.00031139833,0.011760689,0.008243919,0.035643805],"genre_scores_gemma":[0.66235495,0.0055969134,0.29188803,0.001838218,0.00061881676,0.00024128216,0.02312175,0.0035445457,0.010795542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760026,0.0005425272,0.00020932413,0.00077981857,0.00069264276,0.0001754483],"domain_scores_gemma":[0.9874178,0.008646905,0.0008720527,0.0017687662,0.0009455224,0.00034881674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020528652,0.0007997067,0.0024506953,0.0039869687,0.0019829103,0.0047051804,0.001876239,0.0023382339,0.009019137],"category_scores_gemma":[0.019425686,0.0010496171,0.0011269732,0.0057067433,0.0015237377,0.010853079,0.003540809,0.0019109087,0.004453651],"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.002251071,0.00033527298,0.019814564,0.0032613452,0.0011623097,0.0014351583,0.0014288224,0.038764726,0.049902428,0.12906973,0.057491995,0.6950826],"study_design_scores_gemma":[0.00018480167,0.00029408658,0.0075855264,0.00033674983,0.0005392614,0.0035707932,0.0018473921,0.0368729,0.035244692,0.8306692,0.08268181,0.0001726824],"about_ca_topic_score_codex":0.00044219973,"about_ca_topic_score_gemma":0.000626381,"teacher_disagreement_score":0.009019137,"about_ca_system_score_codex":0.0006535243,"about_ca_system_score_gemma":0.0007061909,"threshold_uncertainty_score":0.03017199},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037646294,0.00068669027,0.94373167,0.000589783,0.00015053485,0.0001218357,0.00046024556,0.0007188389,0.015894122],"genre_scores_gemma":[0.20618844,0.0010884416,0.77127814,0.00032697027,0.0001609328,0.0003770022,0.0015724597,0.00083328097,0.018174322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949694,0.00012466358,0.000022016542,0.00013146747,0.0001402117,0.00008466212],"domain_scores_gemma":[0.9979849,0.0012317903,0.00019711893,0.00027048675,0.00017632375,0.00013940723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086310477,0.0012738876,0.0013323753,0.0015227259,0.00084912387,0.001794236,0.0019764155,0.0012319279,0.014841818],"category_scores_gemma":[0.0076897065,0.0011482195,0.0012578652,0.0020626376,0.0009197403,0.0033040014,0.00282197,0.0030362008,0.0021580637],"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.00051437074,0.00021798821,0.0007429649,0.0004494301,0.00009326535,0.00018644676,0.0005557814,0.31009513,0.007812405,0.37110433,0.035008207,0.27321962],"study_design_scores_gemma":[0.00006770624,0.000039822567,0.00018290205,0.000039375667,0.000020785565,0.0000821093,0.00014297041,0.37825832,0.0011396422,0.61372715,0.006282971,0.00001626103],"about_ca_topic_score_codex":0.0017368062,"about_ca_topic_score_gemma":0.0026512747,"teacher_disagreement_score":0.014841818,"about_ca_system_score_codex":0.0010573554,"about_ca_system_score_gemma":0.0007855424,"threshold_uncertainty_score":0.049650848},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085666195,0.0016016387,0.21890178,0.0012123854,0.0031513593,0.00025467895,0.0025579084,0.003871528,0.68278265],"genre_scores_gemma":[0.6210827,0.0012273547,0.088508785,0.0013012777,0.000658693,0.00024776792,0.004897992,0.002178536,0.2798968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993043,0.00004515235,0.00003098683,0.0002428894,0.00021526833,0.00016137435],"domain_scores_gemma":[0.99922884,0.00009683258,0.00006873934,0.00034758466,0.00014443486,0.00011355975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003313156,0.00051951775,0.0006689273,0.0013605024,0.0016675727,0.0021734217,0.0010925713,0.0008860704,0.060474146],"category_scores_gemma":[0.0017827649,0.000446486,0.00053858565,0.0012715124,0.0014516348,0.00228352,0.001993812,0.0014148363,0.012232646],"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.00015007136,0.00005377258,0.00048026958,0.00026617217,0.000023540031,0.0002132222,0.0001471405,0.0038369896,0.016621806,0.7861577,0.049392734,0.14265649],"study_design_scores_gemma":[0.00007212055,0.0001165449,0.0011580088,0.00009535623,0.000055279448,0.0012239121,0.00025378919,0.014712922,0.02708749,0.69491875,0.26022577,0.00008009105],"about_ca_topic_score_codex":0.0007302803,"about_ca_topic_score_gemma":0.0011839669,"teacher_disagreement_score":0.060474146,"about_ca_system_score_codex":0.00057000347,"about_ca_system_score_gemma":0.00092620123,"threshold_uncertainty_score":0.20230615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1615032,0.0017713903,0.7497161,0.0033967325,0.0007395942,0.0008256162,0.005072498,0.02218521,0.054789715],"genre_scores_gemma":[0.24763761,0.00068184285,0.7025075,0.0009282737,0.00029203887,0.0005903414,0.0055086515,0.0032614497,0.038592335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645585,0.00066174887,0.00035530957,0.0008791904,0.0008071919,0.0008407864],"domain_scores_gemma":[0.9911719,0.004927934,0.00036621437,0.0025792252,0.0006363722,0.00031836896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023937307,0.0015505627,0.0023582827,0.0020909263,0.0036100617,0.00641727,0.0058716587,0.0025331671,0.037448887],"category_scores_gemma":[0.0083102,0.0012451938,0.003175249,0.0059949798,0.00209821,0.012470066,0.0044226428,0.0028060058,0.008159871],"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.0023433547,0.00086293573,0.0021244786,0.0011927676,0.00027167285,0.00041254296,0.00085239677,0.056471568,0.01648254,0.23374073,0.06556904,0.6196759],"study_design_scores_gemma":[0.00041051948,0.00027682493,0.00064723624,0.00022422626,0.00037735642,0.00050249614,0.00038097816,0.21260701,0.02004406,0.73763937,0.026725605,0.00016434654],"about_ca_topic_score_codex":0.005480486,"about_ca_topic_score_gemma":0.010631911,"teacher_disagreement_score":0.037448887,"about_ca_system_score_codex":0.003559357,"about_ca_system_score_gemma":0.005049231,"threshold_uncertainty_score":0.12527901},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011182804,0.0011282227,0.963944,0.001154164,0.0005968617,0.00020203328,0.00042843987,0.006676595,0.014686856],"genre_scores_gemma":[0.3445652,0.0005624772,0.6232464,0.0011570058,0.0016055149,0.0010519809,0.0016544632,0.003496143,0.0226608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98930115,0.005498368,0.0004046978,0.0012156343,0.002695028,0.0008851206],"domain_scores_gemma":[0.951668,0.03247414,0.0008770696,0.010250214,0.0036488483,0.0010817522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0100576235,0.0018908655,0.0030104122,0.002222562,0.0015912835,0.0026625555,0.0054304083,0.001965085,0.0325903],"category_scores_gemma":[0.06954664,0.0010866864,0.0018561461,0.0030269844,0.0024106735,0.005184895,0.005087019,0.0041834796,0.0068852906],"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.0025997495,0.00036317518,0.002671276,0.00046293397,0.00022147714,0.00022378094,0.00021933294,0.089736365,0.0042480845,0.20604749,0.058681127,0.6345252],"study_design_scores_gemma":[0.00023052307,0.00017115661,0.00068075594,0.000046317098,0.00008222505,0.00013643088,0.00004645007,0.5676666,0.0044499007,0.4172893,0.009166961,0.000033335127],"about_ca_topic_score_codex":0.0017407159,"about_ca_topic_score_gemma":0.002996673,"teacher_disagreement_score":0.0325903,"about_ca_system_score_codex":0.0015351739,"about_ca_system_score_gemma":0.0024612783,"threshold_uncertainty_score":0.10902542},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24475881,0.0005831229,0.72158515,0.0022434732,0.00017115666,0.00019787397,0.001231269,0.0019500335,0.02727909],"genre_scores_gemma":[0.60822314,0.00031179367,0.37826222,0.0007020424,0.00009191805,0.0002807338,0.002175275,0.00034839436,0.009604485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813676,0.00043704067,0.00012433922,0.0006326962,0.00042271966,0.0002463744],"domain_scores_gemma":[0.99368876,0.0038703887,0.0004921877,0.0010535296,0.0005047305,0.00039043042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011514341,0.0005930784,0.00088936544,0.00086438906,0.0013982208,0.0016897869,0.001428762,0.0015425729,0.0094200885],"category_scores_gemma":[0.010200625,0.00046169874,0.0012491642,0.0012457073,0.0018640591,0.005479737,0.003717812,0.002268195,0.0016451033],"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.0008618272,0.0002077558,0.0073994165,0.0006979429,0.00009545914,0.0007155272,0.0015232079,0.13197377,0.03734942,0.49514067,0.013661,0.31037402],"study_design_scores_gemma":[0.000052548898,0.00017335739,0.0012730425,0.00007539252,0.000044713168,0.0004246165,0.00036046634,0.2517782,0.012562946,0.7185188,0.014686331,0.000049656453],"about_ca_topic_score_codex":0.0012413734,"about_ca_topic_score_gemma":0.0013858237,"teacher_disagreement_score":0.0094200885,"about_ca_system_score_codex":0.0015294425,"about_ca_system_score_gemma":0.0008361083,"threshold_uncertainty_score":0.031513393},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13114062,0.0020731532,0.10799465,0.0074103638,0.0018788701,0.000080368154,0.0005973494,0.0012595913,0.7475651],"genre_scores_gemma":[0.8924076,0.0003745168,0.021840436,0.0009494007,0.00022804728,0.000069060596,0.00029422762,0.0005616833,0.083275065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910635,0.00024470995,0.000040813393,0.00024574736,0.00017020703,0.00019217105],"domain_scores_gemma":[0.9972088,0.0009149138,0.00019576117,0.0010173602,0.000430536,0.00023258434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008499228,0.0003972665,0.0005654411,0.0008758686,0.0022229722,0.0026833264,0.00082865305,0.0010804428,0.029279374],"category_scores_gemma":[0.009966924,0.00035712228,0.00053522625,0.00076483627,0.0039552553,0.0038777497,0.0016411697,0.0027290299,0.0029059185],"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.000054104203,0.0000075441135,0.0002227192,0.000017241397,0.000005812408,0.00007508767,0.00024857427,0.00040488533,0.0003945903,0.97677326,0.0048161726,0.016979868],"study_design_scores_gemma":[0.00001592366,0.000011164795,0.00026826066,0.00001552173,0.000006287113,0.00017800496,0.0001704081,0.0011853368,0.0003729849,0.9717288,0.026037658,0.000009629035],"about_ca_topic_score_codex":0.0020679631,"about_ca_topic_score_gemma":0.0024176592,"teacher_disagreement_score":0.029279374,"about_ca_system_score_codex":0.0010320718,"about_ca_system_score_gemma":0.000706648,"threshold_uncertainty_score":0.09794927},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01620848,0.0006977073,0.98175013,0.00011805,0.000025560772,0.000028902978,0.00012356923,0.00042061548,0.0006270586],"genre_scores_gemma":[0.27900565,0.0009367218,0.7143124,0.00013553274,0.00021009306,0.0003508522,0.0012010547,0.0005837076,0.0032640472],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577314,0.0025349963,0.0001856919,0.00062284083,0.00072784594,0.00015544565],"domain_scores_gemma":[0.92941314,0.0631146,0.0017866713,0.0032192732,0.0018634087,0.0006027974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01254329,0.00087473483,0.0015568971,0.0032306858,0.00060075935,0.0016804273,0.0037715293,0.0023149247,0.0036982638],"category_scores_gemma":[0.08582938,0.0015614801,0.00082167826,0.0029506988,0.0025743858,0.0042932294,0.0023814396,0.0020930166,0.0009496038],"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.000508686,0.00011488959,0.01554778,0.0004794914,0.000231718,0.00010503473,0.00036978922,0.30221817,0.005994386,0.2930179,0.0045629903,0.37684923],"study_design_scores_gemma":[0.000095295916,0.00013587013,0.004947062,0.000113108865,0.00006145607,0.00034368568,0.00010888263,0.63314694,0.0057055615,0.3515594,0.0037138418,0.00006884748],"about_ca_topic_score_codex":0.0008766798,"about_ca_topic_score_gemma":0.0011990886,"teacher_disagreement_score":0.01254329,"about_ca_system_score_codex":0.0012036304,"about_ca_system_score_gemma":0.0008918155,"threshold_uncertainty_score":0.066336036},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8371778,0.0012793851,0.13592225,0.0011795715,0.00042611305,0.00026142932,0.0022798327,0.0039387094,0.017534874],"genre_scores_gemma":[0.85052955,0.00032030666,0.1396921,0.00026546884,0.00009575672,0.00017829722,0.003598879,0.0006142089,0.004705501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950937,0.0019453808,0.00045957442,0.0010476282,0.001061917,0.00039182903],"domain_scores_gemma":[0.90687764,0.076308906,0.0017391436,0.01045269,0.0033056946,0.0013158962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051304153,0.0011421813,0.00127766,0.0012897255,0.0015929147,0.0022193992,0.0031780968,0.0020513681,0.014810456],"category_scores_gemma":[0.04289457,0.0007588135,0.0009660287,0.0030572324,0.0022915702,0.007315548,0.0012276067,0.0019543178,0.0015085139],"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.018490052,0.0045530093,0.025693998,0.0025654864,0.0006337165,0.0005069104,0.0009886979,0.24544789,0.11218105,0.23138149,0.02585442,0.33170322],"study_design_scores_gemma":[0.0014125374,0.0021365315,0.0042741797,0.00012457132,0.00025693045,0.00044425426,0.0005259534,0.65751123,0.13773084,0.18641108,0.009035349,0.00013651623],"about_ca_topic_score_codex":0.002502387,"about_ca_topic_score_gemma":0.002569307,"teacher_disagreement_score":0.014810456,"about_ca_system_score_codex":0.0015823315,"about_ca_system_score_gemma":0.0013005134,"threshold_uncertainty_score":0.049545884},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038725127,0.0001651333,0.9536608,0.00042398155,0.00005347261,0.00007890276,0.000014454212,0.00030115616,0.0065770866],"genre_scores_gemma":[0.33564034,0.0002670804,0.65790635,0.00018817799,0.000084246174,0.00011675482,0.00005867711,0.000106118874,0.0056322855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994106,0.00021275785,0.000024042874,0.00012780924,0.00015618456,0.00006850961],"domain_scores_gemma":[0.99946386,0.00033110933,0.000038078462,0.000040058327,0.0000730442,0.000053862954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011767542,0.00045217338,0.0006685134,0.00065648794,0.0007761332,0.0011626624,0.0014451782,0.001020986,0.0028615177],"category_scores_gemma":[0.003571074,0.00029082166,0.00045768922,0.0007782146,0.0012762406,0.0016949318,0.0011790353,0.0012181979,0.00044174766],"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.0002110592,0.00025797513,0.0013536888,0.0001402951,0.000040148232,0.00035115835,0.0007208933,0.3689097,0.0116856005,0.34221616,0.0025016807,0.27161154],"study_design_scores_gemma":[0.00007702239,0.0001385195,0.00017929928,0.000010996744,0.000022232301,0.00010357885,0.000106909916,0.8800313,0.0033554733,0.11000555,0.005954617,0.000014468655],"about_ca_topic_score_codex":0.0032916525,"about_ca_topic_score_gemma":0.0021066915,"teacher_disagreement_score":0.0032916525,"about_ca_system_score_codex":0.0011045318,"about_ca_system_score_gemma":0.0010825611,"threshold_uncertainty_score":0.009572744},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097765654,0.00068000477,0.88733137,0.00022952052,0.0001504977,0.00017589208,0.001776166,0.006634674,0.0052562333],"genre_scores_gemma":[0.13005167,0.0005534443,0.86183953,0.000058865342,0.000041276802,0.00014037143,0.0038795294,0.0009936639,0.0024416987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996706,0.000078849545,0.000028786444,0.00009248826,0.00008747874,0.00004170371],"domain_scores_gemma":[0.998672,0.0007775335,0.00009079397,0.00025833954,0.00013704225,0.0000643188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004010851,0.0008298703,0.0011892284,0.0015336485,0.0008799302,0.0015441468,0.0012787142,0.00058483076,0.006673036],"category_scores_gemma":[0.0026739978,0.00093512074,0.0010382789,0.0032625904,0.0005965542,0.0023107096,0.00096747995,0.0010311499,0.0014255322],"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.0009163018,0.00020474958,0.004129948,0.0012258047,0.000121183744,0.0006408645,0.000889776,0.18441431,0.067016646,0.08568174,0.011304496,0.6434542],"study_design_scores_gemma":[0.00011479978,0.0002884693,0.0014307939,0.00014469142,0.00012316242,0.00039003848,0.0004232332,0.6891086,0.046645135,0.23248383,0.02875959,0.00008764696],"about_ca_topic_score_codex":0.0019840505,"about_ca_topic_score_gemma":0.0067829476,"teacher_disagreement_score":0.006673036,"about_ca_system_score_codex":0.0006647989,"about_ca_system_score_gemma":0.0008111359,"threshold_uncertainty_score":0.022323549},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036354351,0.00053295185,0.98141646,0.00021456924,0.00069194275,0.00011286857,0.00018759233,0.006418029,0.0067902515],"genre_scores_gemma":[0.025401322,0.00064435875,0.9461806,0.00026932175,0.00027781955,0.0002557337,0.0007697628,0.0017249444,0.024476042],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99798155,0.00021686197,0.00015316842,0.0005239431,0.00095432834,0.00017010917],"domain_scores_gemma":[0.9986382,0.00032003934,0.00005795017,0.00059215695,0.00031577516,0.00007576124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086038443,0.0020143182,0.0026025602,0.0027058574,0.0018146434,0.003029194,0.003653294,0.0017100087,0.02229506],"category_scores_gemma":[0.0021486855,0.001150035,0.0022841536,0.0042622294,0.0015667432,0.0053182933,0.0030987482,0.0032916572,0.012719648],"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.0003695136,0.0001911367,0.0002530245,0.00043866766,0.00010827944,0.00012889858,0.00020965628,0.007707824,0.06213419,0.101759255,0.028798357,0.7979011],"study_design_scores_gemma":[0.00049529865,0.00050403347,0.000839904,0.00016002158,0.0003348151,0.0021850632,0.00020020254,0.24051623,0.14726935,0.2817408,0.32538214,0.000372164],"about_ca_topic_score_codex":0.0021060167,"about_ca_topic_score_gemma":0.0022754506,"teacher_disagreement_score":0.02229506,"about_ca_system_score_codex":0.0011730426,"about_ca_system_score_gemma":0.001670631,"threshold_uncertainty_score":0.074584424},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0935617,0.0013846874,0.8846797,0.00055993185,0.00031825496,0.000092735274,0.0004515285,0.0014944152,0.017457074],"genre_scores_gemma":[0.68524224,0.0016004946,0.27935117,0.00034165964,0.00029455064,0.00027573164,0.0027510559,0.0011005494,0.029042525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993635,0.00018282015,0.00002814568,0.00020985573,0.00015296244,0.00006273234],"domain_scores_gemma":[0.9984108,0.0009158537,0.00014399354,0.0003511504,0.00008843799,0.00008973762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007558114,0.00046418558,0.00088516745,0.00095375796,0.00073584943,0.0013032249,0.0013838671,0.00086738606,0.010161026],"category_scores_gemma":[0.005517196,0.0006617955,0.00096779515,0.0011372057,0.0011230503,0.0019172006,0.0019527086,0.0011443186,0.0017436751],"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.00075381337,0.00008026957,0.0022308526,0.00057537487,0.00012780164,0.0005427425,0.0005576134,0.280896,0.041616898,0.46105278,0.01046514,0.20110075],"study_design_scores_gemma":[0.00004502793,0.00011745728,0.0010087957,0.000056712353,0.000038950962,0.0005156954,0.00014253515,0.5314744,0.016745487,0.4362096,0.01360425,0.000041059906],"about_ca_topic_score_codex":0.0004433372,"about_ca_topic_score_gemma":0.0005738477,"teacher_disagreement_score":0.010161026,"about_ca_system_score_codex":0.00058745785,"about_ca_system_score_gemma":0.00027483358,"threshold_uncertainty_score":0.033991992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05201231,0.016596457,0.85607386,0.01190039,0.0008987139,0.00009605132,0.0007218037,0.0005200688,0.061180364],"genre_scores_gemma":[0.5550757,0.02063264,0.34314513,0.0027868077,0.0042192987,0.0002942396,0.0035284471,0.0012840795,0.069033764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999356,0.00022136352,0.00003908692,0.00020692505,0.00012766106,0.00004900803],"domain_scores_gemma":[0.9960406,0.0031325456,0.00017171932,0.00037776757,0.0001273287,0.00015008684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012961747,0.00088158314,0.0016673909,0.0013185053,0.0018894991,0.0034426276,0.0024094193,0.0028322022,0.014591284],"category_scores_gemma":[0.0077918605,0.0009884646,0.0017481077,0.0042836843,0.0038404984,0.009362049,0.0027307123,0.0050114635,0.0017813136],"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.00007595219,0.00004124069,0.00070072577,0.00037744368,0.000047287693,0.00017671763,0.00057223486,0.045416225,0.00081077777,0.83025116,0.019181179,0.10234899],"study_design_scores_gemma":[0.000008711756,0.0000075655275,0.00031230281,0.000032946155,0.000009431241,0.00009044787,0.000054034495,0.02041867,0.00014934038,0.9703226,0.008584439,0.0000095275645],"about_ca_topic_score_codex":0.0020327284,"about_ca_topic_score_gemma":0.0013111713,"teacher_disagreement_score":0.014591284,"about_ca_system_score_codex":0.0013107163,"about_ca_system_score_gemma":0.000538828,"threshold_uncertainty_score":0.048812687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006274716,0.0002332008,0.9895594,0.0001963388,0.00009730457,0.00010203833,0.00020659658,0.0017698888,0.0015605239],"genre_scores_gemma":[0.03632014,0.000099558994,0.9594067,0.0000797276,0.000074091804,0.00019130272,0.0008399783,0.0003384846,0.0026500614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765646,0.00029384054,0.0001376709,0.0007274135,0.0009670801,0.00021741536],"domain_scores_gemma":[0.996507,0.0016617494,0.00019052622,0.0007439539,0.00061762996,0.00027912486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014258933,0.0016169801,0.002426494,0.0026153987,0.0013547183,0.0031902727,0.004036628,0.0018734478,0.012428115],"category_scores_gemma":[0.0065164026,0.0009680123,0.0014639567,0.0035649661,0.0012075205,0.005494267,0.004513793,0.00358213,0.0037911385],"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.0007387693,0.00032840393,0.0012011583,0.0004812176,0.00016352999,0.00018137078,0.00031979408,0.06341115,0.01992285,0.07332149,0.018084856,0.8218454],"study_design_scores_gemma":[0.00050842843,0.0003120217,0.000872475,0.00004819549,0.00012693777,0.00050984236,0.00021466483,0.8084107,0.0155879315,0.1504939,0.022813182,0.00010176358],"about_ca_topic_score_codex":0.0034563772,"about_ca_topic_score_gemma":0.005003827,"teacher_disagreement_score":0.012428115,"about_ca_system_score_codex":0.0015775611,"about_ca_system_score_gemma":0.0023597942,"threshold_uncertainty_score":0.041576147},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01064182,0.00071951235,0.97325855,0.0012479003,0.00007171185,0.00024458053,0.0005320237,0.0011001849,0.012183674],"genre_scores_gemma":[0.112186916,0.0012595187,0.87593275,0.00029410957,0.000062692794,0.00040149322,0.0017280341,0.00040599625,0.007728552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998528,0.0005165923,0.00009912392,0.0004429922,0.0002672798,0.0001459852],"domain_scores_gemma":[0.9978282,0.0015694707,0.00015023722,0.00024550676,0.00012911056,0.00007750679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016865083,0.0012498874,0.0007875275,0.0011365348,0.0013135338,0.0027061135,0.0020360956,0.0017062341,0.009381244],"category_scores_gemma":[0.005557061,0.000722356,0.0023387435,0.0014268435,0.0039711604,0.0040142187,0.0028364463,0.0022377998,0.0012782642],"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.00022367093,0.00009467504,0.0009224944,0.0008529913,0.00007050899,0.00042747092,0.00083467574,0.322138,0.0044909595,0.5208199,0.007977569,0.14114712],"study_design_scores_gemma":[0.00008688226,0.00007367121,0.0002439959,0.0001177074,0.000047801175,0.00027607466,0.0004348681,0.2842565,0.007855745,0.663393,0.04315886,0.00005486697],"about_ca_topic_score_codex":0.0063175065,"about_ca_topic_score_gemma":0.005658757,"teacher_disagreement_score":0.009381244,"about_ca_system_score_codex":0.0017341479,"about_ca_system_score_gemma":0.0019807327,"threshold_uncertainty_score":0.031383336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072925285,0.0007386342,0.91337425,0.00023674814,0.000088107125,0.00007340069,0.0003382017,0.0012016929,0.011023669],"genre_scores_gemma":[0.38773414,0.0010428879,0.5963828,0.00010582881,0.00008983074,0.00018310446,0.0019489742,0.00047850047,0.012034011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967754,0.00009684031,0.00001702781,0.00009559478,0.00007786193,0.000035191042],"domain_scores_gemma":[0.99910873,0.00063369714,0.00005655347,0.00013029714,0.000041477088,0.000029220319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050407136,0.0004138732,0.00052554527,0.00068028754,0.00051936356,0.0010883616,0.0009810746,0.00054195063,0.004959602],"category_scores_gemma":[0.0022603914,0.000575249,0.0006880911,0.0013632813,0.00075235346,0.0017827343,0.0009999417,0.0007453614,0.00084766385],"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.00039195523,0.0000475886,0.0013597582,0.00036462906,0.000046504036,0.00038499356,0.0004319968,0.24601735,0.023042262,0.4020094,0.005982708,0.3199209],"study_design_scores_gemma":[0.000057281773,0.00006530028,0.0006824462,0.000045797413,0.0000327398,0.00033749142,0.000114115224,0.43182388,0.013409796,0.5373249,0.016077977,0.000028327559],"about_ca_topic_score_codex":0.0005688385,"about_ca_topic_score_gemma":0.0010606176,"teacher_disagreement_score":0.004959602,"about_ca_system_score_codex":0.0004096762,"about_ca_system_score_gemma":0.00026400492,"threshold_uncertainty_score":0.016591549},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9125273,0.0014484617,0.07502661,0.00048578894,0.00012654068,0.000029457282,0.00017444835,0.0003242764,0.0098571405],"genre_scores_gemma":[0.9220868,0.00073905184,0.0701674,0.00033653888,0.000051999563,0.000039775263,0.0003339358,0.00012467813,0.0061198627],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996817,0.000052872234,0.00001840607,0.00013980604,0.00006130994,0.00004606007],"domain_scores_gemma":[0.99932003,0.0003492536,0.00009272045,0.00008940605,0.00006807215,0.00008057314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066334254,0.00026251824,0.0004592451,0.00069968414,0.0007179504,0.0008434263,0.0009837319,0.0012162124,0.0027931784],"category_scores_gemma":[0.0016583384,0.0004265948,0.0006649313,0.0012241098,0.00087451143,0.0012432662,0.0009382711,0.0014016405,0.0007053894],"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.00068188267,0.00015500732,0.017466396,0.00036819067,0.00025554706,0.002677366,0.0013616711,0.038181655,0.6713986,0.110723175,0.0014971569,0.15523343],"study_design_scores_gemma":[0.00046130456,0.0013714741,0.077200934,0.00041891928,0.0008583898,0.017546365,0.0021030433,0.29784238,0.21326683,0.30276895,0.085752584,0.00040881167],"about_ca_topic_score_codex":0.00040604267,"about_ca_topic_score_gemma":0.00094096945,"teacher_disagreement_score":0.0027931784,"about_ca_system_score_codex":0.00071734784,"about_ca_system_score_gemma":0.00029592944,"threshold_uncertainty_score":0.009344161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98353887,0.00031419046,0.014176085,0.00007701132,0.000006660006,0.00001676292,0.00024362346,0.00010194912,0.0015247436],"genre_scores_gemma":[0.99356383,0.00006908959,0.0056213653,0.000027261756,0.0000074216136,0.000012305333,0.00036940002,0.00001464298,0.00031452347],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99979204,0.000027219321,0.000007365857,0.000079495054,0.00006909358,0.000024720495],"domain_scores_gemma":[0.9992694,0.0002976875,0.00017869078,0.000080517595,0.0001373931,0.000036373967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016922929,0.000117669166,0.00017506402,0.0008537515,0.00024457698,0.00033076043,0.0002308943,0.000236168,0.0011589294],"category_scores_gemma":[0.0012120648,0.00012707671,0.00022052939,0.00058240216,0.0006126734,0.00018821169,0.00026212508,0.00022791787,0.00031385274],"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.00066935254,0.000067491244,0.25654024,0.0003315672,0.00023306286,0.0017413319,0.0007481138,0.022974992,0.6406651,0.012086637,0.0019273354,0.06201477],"study_design_scores_gemma":[0.000079703015,0.0003649827,0.7736281,0.00004233532,0.00016575753,0.0042080623,0.00038716054,0.08286594,0.114204936,0.018574284,0.005392564,0.00008617391],"about_ca_topic_score_codex":0.0011792673,"about_ca_topic_score_gemma":0.0011074772,"teacher_disagreement_score":0.0011792673,"about_ca_system_score_codex":0.00043565175,"about_ca_system_score_gemma":0.00025828503,"threshold_uncertainty_score":0.0038769841},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14877678,0.0015614618,0.71747947,0.0007930091,0.00031216865,0.00040698473,0.024617577,0.09734614,0.008706449],"genre_scores_gemma":[0.20978124,0.00088104536,0.7215487,0.00024918639,0.00012648074,0.0004829335,0.054019913,0.009716018,0.0031944865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902177,0.000252555,0.000049804927,0.0003688846,0.00021420047,0.000092785915],"domain_scores_gemma":[0.9981871,0.0009483974,0.0001800273,0.00039701402,0.00018062853,0.00010675496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024130817,0.0017981671,0.0013016714,0.0038437522,0.0013724628,0.002248875,0.0032731195,0.0014031878,0.011646428],"category_scores_gemma":[0.0047697774,0.0011136805,0.0030685079,0.002131011,0.0011390792,0.0022210586,0.0024290564,0.0027755587,0.0041966843],"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.0031766514,0.0005112398,0.03529162,0.0034981528,0.0016130444,0.0014902594,0.0018666586,0.2669381,0.0481947,0.063269116,0.11034238,0.46380806],"study_design_scores_gemma":[0.0004760973,0.0004697691,0.007801188,0.00027771475,0.0004118699,0.0016879824,0.00053363893,0.79552287,0.028134273,0.0654148,0.099098966,0.00017085572],"about_ca_topic_score_codex":0.0028298604,"about_ca_topic_score_gemma":0.00413429,"teacher_disagreement_score":0.011646428,"about_ca_system_score_codex":0.00076699664,"about_ca_system_score_gemma":0.0018947014,"threshold_uncertainty_score":0.038961172},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008799916,0.00037247082,0.68043405,0.00043776302,0.00024017146,0.00026089593,0.017265089,0.28556255,0.0066269883],"genre_scores_gemma":[0.08114571,0.0006816982,0.8337934,0.00044447728,0.00005913353,0.0012581879,0.033150762,0.04172583,0.0077408175],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996451,0.000083878345,0.000043140077,0.00006533611,0.00011886063,0.000043693413],"domain_scores_gemma":[0.9984193,0.0010855203,0.00012138013,0.00012407124,0.00015153964,0.00009822101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012947329,0.0013540908,0.0009385796,0.0026069556,0.00076498167,0.001845952,0.0029437838,0.0012463827,0.08129339],"category_scores_gemma":[0.004119486,0.001092471,0.0013826981,0.001539465,0.00045366396,0.001885461,0.002649766,0.0020000811,0.012057283],"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.0016930287,0.00031772195,0.0049882038,0.004428632,0.0005072469,0.0024683087,0.0015646104,0.044880856,0.04168286,0.041013926,0.51592356,0.340531],"study_design_scores_gemma":[0.0007242729,0.00023168013,0.00538925,0.00052812055,0.00014070494,0.002479536,0.00037340945,0.40076828,0.02908208,0.069105364,0.49087614,0.0003012109],"about_ca_topic_score_codex":0.0025105688,"about_ca_topic_score_gemma":0.0031631645,"teacher_disagreement_score":0.08129339,"about_ca_system_score_codex":0.00067195215,"about_ca_system_score_gemma":0.0011376971,"threshold_uncertainty_score":0.27195346},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24235822,0.00040790506,0.7138421,0.00071116444,0.0003252568,0.00019539236,0.00052593986,0.00067132286,0.04096271],"genre_scores_gemma":[0.70778155,0.00039345401,0.26016393,0.00032011542,0.00010036842,0.00023132573,0.0009685954,0.0005748082,0.029465852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993481,0.00013691367,0.00005883969,0.0001649517,0.00017809494,0.00011310765],"domain_scores_gemma":[0.99508685,0.003038915,0.00025203978,0.0007367716,0.0005103064,0.00037503353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014978831,0.00040009225,0.00088068476,0.0012214239,0.0015934578,0.0024705434,0.0021903797,0.0018840851,0.012514607],"category_scores_gemma":[0.010277082,0.0005730065,0.001483632,0.0011819899,0.0023188253,0.004022478,0.0020814468,0.002917944,0.0011889085],"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.00016725984,0.00008237973,0.0010625317,0.00013332561,0.000027130744,0.00027715985,0.00033443372,0.06245102,0.0021043264,0.8837164,0.004282154,0.045361843],"study_design_scores_gemma":[0.00003637658,0.000034318356,0.00020790704,0.000034438188,0.000019418001,0.00010547054,0.000083995874,0.196446,0.0014883961,0.7987878,0.0027327589,0.000023099152],"about_ca_topic_score_codex":0.0020502624,"about_ca_topic_score_gemma":0.003959311,"teacher_disagreement_score":0.012514607,"about_ca_system_score_codex":0.0007676917,"about_ca_system_score_gemma":0.0010117283,"threshold_uncertainty_score":0.041865587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06785267,0.0004863928,0.8542687,0.0017988067,0.00045396067,0.00039770373,0.0034165154,0.00603419,0.065290965],"genre_scores_gemma":[0.30783954,0.00049508916,0.64912593,0.00070242485,0.0002384272,0.00035585344,0.010009329,0.0025788671,0.028654447],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837744,0.000405918,0.00010388414,0.0005228352,0.00036860973,0.00022132526],"domain_scores_gemma":[0.9967372,0.0018715832,0.0001216868,0.00086123904,0.00028759582,0.000120734534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013022232,0.00098024,0.0010049581,0.0017654997,0.0015916048,0.003103173,0.0018231735,0.0012918623,0.019970508],"category_scores_gemma":[0.0069221994,0.0005168873,0.0022254663,0.0017530626,0.0014724531,0.0035564578,0.0022856873,0.0025223596,0.006544543],"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.00066466164,0.0005587823,0.0029734496,0.00090395444,0.0002506069,0.0003728613,0.00049910916,0.03951123,0.019438243,0.4047863,0.06363925,0.46640155],"study_design_scores_gemma":[0.0001038168,0.00013053461,0.0008114023,0.000084389016,0.00013945065,0.0003589789,0.0003489771,0.08508052,0.0130328555,0.86305445,0.036801882,0.00005273894],"about_ca_topic_score_codex":0.0017766511,"about_ca_topic_score_gemma":0.003935632,"teacher_disagreement_score":0.019970508,"about_ca_system_score_codex":0.0010075134,"about_ca_system_score_gemma":0.0022553222,"threshold_uncertainty_score":0.066807985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011796114,0.00015968375,0.9831034,0.000083215564,0.000046141235,0.00006103889,0.00044931326,0.0031155671,0.0011855146],"genre_scores_gemma":[0.084533736,0.00013890395,0.90966535,0.000081958955,0.00003582889,0.00013034417,0.0029494197,0.0008876133,0.0015769291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994141,0.000087688546,0.00003358771,0.00021811643,0.00018888181,0.000057643727],"domain_scores_gemma":[0.99918145,0.00031917714,0.00006038038,0.00021509432,0.00014945627,0.00007444898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008799402,0.00087888114,0.0010277702,0.0023351172,0.00089167675,0.0014199453,0.0022232113,0.0012648171,0.008806879],"category_scores_gemma":[0.0029915061,0.00066046324,0.0017025312,0.0017486655,0.00058037904,0.0013056515,0.0021523884,0.0019370274,0.0026476914],"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.0005630547,0.00018478918,0.005313705,0.00055462914,0.0003192195,0.0012658398,0.0007775476,0.23657693,0.04144832,0.048142564,0.0130556375,0.65179783],"study_design_scores_gemma":[0.000074015894,0.00007449879,0.0011427928,0.000048902348,0.00007357547,0.0006368937,0.00010545001,0.9513507,0.008985594,0.02578259,0.011676155,0.000048805858],"about_ca_topic_score_codex":0.0025157975,"about_ca_topic_score_gemma":0.0029962056,"teacher_disagreement_score":0.008806879,"about_ca_system_score_codex":0.0005431372,"about_ca_system_score_gemma":0.0012203977,"threshold_uncertainty_score":0.02946198},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01650274,0.010661967,0.8820641,0.034367394,0.0015275031,0.00006528653,0.00087973225,0.004363665,0.04956765],"genre_scores_gemma":[0.34510174,0.018901272,0.5931804,0.006960344,0.0023147697,0.000342012,0.0019931968,0.0027143043,0.028491914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990183,0.00035747088,0.00003999479,0.00023251137,0.0002491801,0.00010253831],"domain_scores_gemma":[0.99533784,0.0033591609,0.00017427701,0.0006616456,0.000327319,0.00013962066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026253797,0.0012876525,0.0016157373,0.0024603163,0.0010571833,0.005063915,0.003272623,0.0020015142,0.01029721],"category_scores_gemma":[0.017700149,0.0007835041,0.0012326081,0.0031977831,0.0039576734,0.018251013,0.0019589653,0.0035646795,0.004586878],"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.000080663354,0.000029211657,0.0011996474,0.00028220456,0.00010642264,0.00010567906,0.00020355686,0.015093678,0.0007932971,0.7835957,0.027614228,0.17089576],"study_design_scores_gemma":[0.00000553655,0.0000028831066,0.00011847931,0.000027281963,0.000011454342,0.00004331188,0.000055510915,0.017699884,0.00042378364,0.97056735,0.011036496,0.000007992714],"about_ca_topic_score_codex":0.00275161,"about_ca_topic_score_gemma":0.0016728044,"teacher_disagreement_score":0.01029721,"about_ca_system_score_codex":0.0016739172,"about_ca_system_score_gemma":0.0014977312,"threshold_uncertainty_score":0.03444761},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008005528,0.011288308,0.94842035,0.0015821074,0.00045378372,0.00007735488,0.0003766014,0.001770346,0.028025664],"genre_scores_gemma":[0.16893065,0.01591323,0.78518707,0.0005619106,0.0006260692,0.0003086357,0.0018399108,0.00095513504,0.025677344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999158,0.00023090505,0.0000399392,0.0002994215,0.00020711818,0.00006456378],"domain_scores_gemma":[0.99849975,0.00095928245,0.000077355224,0.00031338847,0.00010112817,0.000049050075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014194084,0.0010104625,0.0012941529,0.0018119203,0.00087804074,0.0033817433,0.003152254,0.0014349964,0.006706188],"category_scores_gemma":[0.0050625126,0.000772783,0.0010998469,0.004191869,0.003295425,0.007433465,0.0020677634,0.0023552242,0.002740143],"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.00009951975,0.000037665806,0.00069361913,0.00041861556,0.000063641935,0.000103605125,0.0001905213,0.037795004,0.0015746725,0.5129042,0.020270241,0.42584866],"study_design_scores_gemma":[0.000019081808,0.000018230785,0.00025701648,0.0000685356,0.00003045672,0.0003327976,0.00008992988,0.100421876,0.002309191,0.85218495,0.044240896,0.000027095948],"about_ca_topic_score_codex":0.0011800021,"about_ca_topic_score_gemma":0.001762644,"teacher_disagreement_score":0.006706188,"about_ca_system_score_codex":0.0011815599,"about_ca_system_score_gemma":0.0013114017,"threshold_uncertainty_score":0.022434413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.543058,0.00080491154,0.42947662,0.0027952811,0.000086602726,0.000200308,0.0005339789,0.00080234185,0.02224199],"genre_scores_gemma":[0.94809264,0.00024113471,0.049935505,0.00024408,0.00005340833,0.00035431734,0.00024757307,0.00014738864,0.00068389723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975574,0.0013174646,0.00009848677,0.00049314916,0.00034483813,0.00018862748],"domain_scores_gemma":[0.9427756,0.048704453,0.0029211533,0.0024929338,0.0013965332,0.0017092595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054873065,0.0006041633,0.00079884566,0.0026483487,0.0012780525,0.0022106133,0.0016357657,0.002599502,0.004506266],"category_scores_gemma":[0.07248765,0.00055134186,0.0006452374,0.0010659101,0.0036559885,0.005760673,0.0022369192,0.0022798479,0.00042358806],"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.00029165563,0.0001463068,0.0069217957,0.00031271813,0.000075553566,0.00031783615,0.00056801905,0.17979972,0.006405469,0.7835379,0.003587393,0.018035622],"study_design_scores_gemma":[0.000073334275,0.00007379858,0.0017216761,0.00007111775,0.000021968415,0.0004295179,0.00020807124,0.2171486,0.0012284549,0.7776109,0.0013153681,0.00009733325],"about_ca_topic_score_codex":0.0004262755,"about_ca_topic_score_gemma":0.0006964875,"teacher_disagreement_score":0.0054873065,"about_ca_system_score_codex":0.0011163614,"about_ca_system_score_gemma":0.0006352911,"threshold_uncertainty_score":0.029020011},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13902344,0.0014536327,0.8234567,0.001441305,0.00010757252,0.00008890536,0.0003186667,0.00056975044,0.033540003],"genre_scores_gemma":[0.8203724,0.0010930438,0.16269772,0.00040599212,0.0001525279,0.0001669437,0.0007211823,0.0001593389,0.014230796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985613,0.00028158902,0.00008511191,0.00041044972,0.00044852128,0.00021296136],"domain_scores_gemma":[0.9975534,0.0013268885,0.00033183536,0.00038859397,0.0002073371,0.00019200708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010362398,0.0005938513,0.00046657847,0.0009985523,0.0007114229,0.0026024783,0.00209887,0.0017156915,0.0077864802],"category_scores_gemma":[0.0035329422,0.0003601618,0.0010335658,0.001275554,0.0022784967,0.0059987996,0.0018894523,0.0022513994,0.0008322527],"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.000042392086,0.000032297936,0.00027290048,0.000049610364,0.000009259403,0.00008387257,0.00010569353,0.019860175,0.0020488794,0.9669154,0.0007363262,0.009843183],"study_design_scores_gemma":[0.000029438057,0.000060736842,0.00015204752,0.000015564303,0.000013946645,0.00028731275,0.00012239158,0.096360534,0.003121104,0.89278674,0.0070294966,0.00002062372],"about_ca_topic_score_codex":0.0012096622,"about_ca_topic_score_gemma":0.0011448419,"teacher_disagreement_score":0.0077864802,"about_ca_system_score_codex":0.0015905595,"about_ca_system_score_gemma":0.0007055414,"threshold_uncertainty_score":0.026048362},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010231441,0.000106428815,0.98708457,0.00015503683,0.000011347622,0.000034252735,0.00018140652,0.00048135035,0.0017140862],"genre_scores_gemma":[0.135508,0.00023058508,0.861411,0.00010145699,0.000032684464,0.00012304146,0.0010017186,0.00027664588,0.0013148512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991886,0.00024777697,0.000042621097,0.00026777462,0.0001771157,0.000076087854],"domain_scores_gemma":[0.9992048,0.00041227866,0.00009108409,0.00012365788,0.0001216776,0.000046389578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009100357,0.0007592135,0.00087624637,0.0023615551,0.0009412801,0.0014907669,0.0020728754,0.0011960035,0.0053179376],"category_scores_gemma":[0.0035129718,0.0007150719,0.0013928848,0.0024655764,0.0008337374,0.0029289525,0.0015225353,0.0018369247,0.0010327528],"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.0002597299,0.00017414182,0.004820784,0.0003230224,0.00013463979,0.00053801714,0.0004212615,0.4881794,0.021335758,0.20115489,0.0030099098,0.27964848],"study_design_scores_gemma":[0.000030493204,0.00007034252,0.00075455284,0.000036923248,0.000046940604,0.0003247223,0.00009902087,0.8369155,0.006537052,0.1478542,0.007300151,0.000030210404],"about_ca_topic_score_codex":0.0019635388,"about_ca_topic_score_gemma":0.0019040446,"teacher_disagreement_score":0.0053179376,"about_ca_system_score_codex":0.0010591621,"about_ca_system_score_gemma":0.0012117409,"threshold_uncertainty_score":0.017790258},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99273807,0.0011971833,0.0052246326,0.000052037845,0.0000020394518,0.0000123896,0.0002796451,0.00004209064,0.00045193636],"genre_scores_gemma":[0.9942316,0.0004605606,0.0045280494,0.000017893135,0.0000036774443,0.000024332412,0.0005761707,0.000021576448,0.00013622997],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99957603,0.00010354548,0.000024131119,0.00014777662,0.00009261172,0.000055826746],"domain_scores_gemma":[0.99788433,0.0011769072,0.00044630715,0.00015666944,0.00019150323,0.00014421727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007445251,0.00034892347,0.00041650562,0.0017788386,0.00061619084,0.0006551051,0.0005177983,0.0008107476,0.00088579056],"category_scores_gemma":[0.0042403406,0.00030820814,0.0005827986,0.0011490324,0.0008318012,0.0009961744,0.00063672895,0.00039713946,0.00031402634],"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.0006622819,0.00010737939,0.821588,0.0004360797,0.00037150097,0.0006315149,0.0014055577,0.07742052,0.04253925,0.006481203,0.0004516708,0.04790501],"study_design_scores_gemma":[0.000045444936,0.00032310575,0.77958333,0.0001597171,0.00016185119,0.0034552254,0.00077089365,0.17359622,0.009090197,0.026335679,0.0063730944,0.00010533988],"about_ca_topic_score_codex":0.002355269,"about_ca_topic_score_gemma":0.0014444869,"teacher_disagreement_score":0.002355269,"about_ca_system_score_codex":0.0010787694,"about_ca_system_score_gemma":0.00042929093,"threshold_uncertainty_score":0.0078270435},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054064628,0.00020417402,0.94445735,0.00025979275,0.00002229105,0.000019818111,0.00009399429,0.00020578539,0.0006720631],"genre_scores_gemma":[0.44568968,0.00023806417,0.5522702,0.00011620504,0.00006889209,0.00013756825,0.0003866987,0.00015967347,0.0009329522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987997,0.0006754508,0.00005217147,0.00022121539,0.00020186658,0.00004971888],"domain_scores_gemma":[0.9936103,0.0051728426,0.0003253861,0.0005038087,0.00020307956,0.00018449317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003042668,0.00038069097,0.000887484,0.0016121768,0.00058636285,0.001138269,0.0018873115,0.001043051,0.0011248303],"category_scores_gemma":[0.013634111,0.00050979486,0.0011517007,0.0016140552,0.0018492707,0.0023066336,0.0025392107,0.0015893914,0.0001869718],"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.00023652974,0.000052238513,0.003067979,0.000056608194,0.000065430984,0.00011740805,0.0001367906,0.79019743,0.0024276804,0.16232076,0.0005369499,0.040784128],"study_design_scores_gemma":[0.000018684304,0.000019879231,0.00018856952,0.0000055048913,0.0000063908733,0.00003337356,0.000010172364,0.93272614,0.00037377095,0.066143654,0.0004647783,0.000009018706],"about_ca_topic_score_codex":0.0024377191,"about_ca_topic_score_gemma":0.0019516737,"teacher_disagreement_score":0.003042668,"about_ca_system_score_codex":0.0010788379,"about_ca_system_score_gemma":0.00077803415,"threshold_uncertainty_score":0.016091347},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12557505,0.0009037747,0.74343914,0.0027417047,0.0010853802,0.0006643594,0.001441091,0.0025507654,0.12159867],"genre_scores_gemma":[0.5707283,0.00058654015,0.3558057,0.0012006249,0.00030506853,0.0009676962,0.001837286,0.0009235742,0.06764517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917245,0.00018874863,0.0000416393,0.0002191415,0.00019882552,0.00017923562],"domain_scores_gemma":[0.9982486,0.00071834686,0.000082113984,0.0006032277,0.00016578434,0.00018205156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007894897,0.0011800443,0.0014201994,0.0009957383,0.0015312392,0.0014900587,0.002048586,0.0024852504,0.036021665],"category_scores_gemma":[0.005912019,0.0006098226,0.001042732,0.001752456,0.0012728046,0.0027893344,0.00392774,0.0026180297,0.0052929046],"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.0011719995,0.00030959188,0.00074929924,0.00039837873,0.00009936306,0.000345665,0.00023574712,0.15324344,0.010237761,0.4113294,0.07200154,0.34987786],"study_design_scores_gemma":[0.00019797878,0.00016285632,0.00026349947,0.000056386558,0.000037357597,0.00024240286,0.000079543504,0.4370917,0.0035072267,0.5441827,0.014140296,0.00003808315],"about_ca_topic_score_codex":0.00083359797,"about_ca_topic_score_gemma":0.0015058416,"teacher_disagreement_score":0.036021665,"about_ca_system_score_codex":0.00082917506,"about_ca_system_score_gemma":0.001098877,"threshold_uncertainty_score":0.1205045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70094705,0.00017238945,0.2970203,0.00012619836,0.000007869088,0.000030611416,0.0001784776,0.0008736434,0.0006435972],"genre_scores_gemma":[0.5872527,0.000117404205,0.41122854,0.000050735303,0.00000750875,0.000043067485,0.000714931,0.00018244663,0.00040267466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963486,0.00018225363,0.00002340916,0.00007751336,0.000051988318,0.000030085661],"domain_scores_gemma":[0.99837697,0.00093341013,0.000121347904,0.00028565523,0.00021218177,0.000070395734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020208103,0.00038626738,0.000783854,0.0012829156,0.00046795257,0.0010411692,0.0009009856,0.0006636597,0.00055681576],"category_scores_gemma":[0.0075018066,0.0005895919,0.0005575853,0.00083402905,0.00048177573,0.0007817463,0.0008329481,0.0008376182,0.00027142596],"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.0003844764,0.000112805836,0.034656234,0.00011089775,0.00009030028,0.00019368729,0.00067055033,0.77337074,0.031721372,0.011617665,0.0005577106,0.14651357],"study_design_scores_gemma":[0.000025864701,0.000047994487,0.0020851456,0.000010879393,0.000014818102,0.000036099635,0.00006037238,0.98870635,0.0038021754,0.00474243,0.00045881735,0.000009010238],"about_ca_topic_score_codex":0.0035119639,"about_ca_topic_score_gemma":0.0053945826,"teacher_disagreement_score":0.0035119639,"about_ca_system_score_codex":0.00063332426,"about_ca_system_score_gemma":0.0010802812,"threshold_uncertainty_score":0.010687172},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067032943,0.00017492,0.9901869,0.00031578456,0.000029342165,0.000066252425,0.000112758724,0.00070788164,0.0017029161],"genre_scores_gemma":[0.059607197,0.0002870419,0.93617696,0.00016881968,0.000064628766,0.00028551713,0.000510204,0.00047747727,0.002422062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989436,0.00047474046,0.000041474268,0.0001980766,0.00026769747,0.00007447514],"domain_scores_gemma":[0.99628663,0.0020903312,0.00022189795,0.0008470333,0.00039402765,0.00016012185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021819284,0.00082075293,0.00088696915,0.002050245,0.001532781,0.0013987948,0.0021608027,0.0012533183,0.008660936],"category_scores_gemma":[0.009253174,0.0006415754,0.00096173916,0.002331432,0.0017141968,0.0033732941,0.0036417143,0.002345934,0.0023626934],"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.0003716851,0.00014760782,0.0014558613,0.0002872597,0.00007916675,0.0002304477,0.00072407373,0.2979069,0.010608015,0.35109407,0.00722886,0.32986614],"study_design_scores_gemma":[0.00006795024,0.0001436838,0.0003529819,0.00004795157,0.000022839235,0.000144014,0.00009768918,0.59349674,0.003814361,0.37853083,0.023232218,0.000048761725],"about_ca_topic_score_codex":0.003313835,"about_ca_topic_score_gemma":0.005003103,"teacher_disagreement_score":0.008660936,"about_ca_system_score_codex":0.0011301124,"about_ca_system_score_gemma":0.0014409039,"threshold_uncertainty_score":0.028973758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044606633,0.006032674,0.8729165,0.01867837,0.0012080731,0.0003280895,0.0018587626,0.001974725,0.05239624],"genre_scores_gemma":[0.45328483,0.006171632,0.48429695,0.0062492965,0.0028501966,0.0016052367,0.00627805,0.0029717055,0.03629202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942772,0.0015886159,0.00019107704,0.0010181672,0.0017529072,0.0011720603],"domain_scores_gemma":[0.9475352,0.042211007,0.0014025553,0.0040302547,0.0022587932,0.0025621818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061273267,0.0030000925,0.00459135,0.0035033138,0.0034935377,0.008299644,0.010018554,0.007656091,0.033460267],"category_scores_gemma":[0.049448743,0.001588647,0.0026905816,0.0054956875,0.0040731,0.016030155,0.00910792,0.016426183,0.0054185675],"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.0023154065,0.0010179946,0.0029707775,0.0014074622,0.00035546516,0.00030388398,0.0007748288,0.26114145,0.0065913545,0.4486678,0.08727141,0.18718229],"study_design_scores_gemma":[0.00036764002,0.0002454777,0.00075650244,0.00016996189,0.00016971827,0.0002813302,0.00020286087,0.48232123,0.0016684509,0.5016749,0.012088158,0.000053809425],"about_ca_topic_score_codex":0.0022458448,"about_ca_topic_score_gemma":0.002952251,"teacher_disagreement_score":0.033460267,"about_ca_system_score_codex":0.0045267213,"about_ca_system_score_gemma":0.0036448785,"threshold_uncertainty_score":0.111935735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2144339,0.00041555343,0.77911276,0.0009663096,0.000031778756,0.00018161703,0.0007249441,0.00078635034,0.0033468925],"genre_scores_gemma":[0.70794886,0.00029222778,0.28610504,0.00024172265,0.000050810908,0.00018741135,0.0026125512,0.00034794753,0.0022134553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943475,0.0021697497,0.00030277058,0.0015280938,0.0012685014,0.0003835017],"domain_scores_gemma":[0.96492165,0.026368268,0.0018714431,0.0042677606,0.0020407331,0.00053007907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047468916,0.0006076701,0.0011425279,0.0017838752,0.001350133,0.0027234512,0.003516606,0.0016147301,0.0032257668],"category_scores_gemma":[0.03336502,0.0010811193,0.0015832975,0.0023935284,0.0032701558,0.0061318143,0.0028491647,0.0021360859,0.00057473796],"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.0012473802,0.00026485918,0.02186365,0.00056434056,0.00025486673,0.0005149528,0.0016143885,0.40269503,0.009695374,0.44886193,0.004726171,0.10769703],"study_design_scores_gemma":[0.00009158939,0.00009421141,0.0011052317,0.00004295817,0.00005184804,0.0002844648,0.00031207417,0.5273168,0.0076549053,0.46046382,0.002543057,0.000039098974],"about_ca_topic_score_codex":0.003115962,"about_ca_topic_score_gemma":0.0024986975,"teacher_disagreement_score":0.0047468916,"about_ca_system_score_codex":0.0017312173,"about_ca_system_score_gemma":0.0019929875,"threshold_uncertainty_score":0.025104284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9131031,0.00019622706,0.08533095,0.00024125293,0.000009057297,0.00004678748,0.0001770314,0.00023173603,0.00066390197],"genre_scores_gemma":[0.97747225,0.00015584308,0.020792335,0.000041348296,0.000009336871,0.00006616001,0.00042851435,0.00007170474,0.000962555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993643,0.00022029574,0.000020520203,0.00020094206,0.00010652947,0.00008743008],"domain_scores_gemma":[0.98677826,0.010415881,0.0012898518,0.00056561234,0.0003924737,0.00055801263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016843042,0.000339759,0.00039347072,0.0019436752,0.0004838514,0.0008850789,0.0011647847,0.0010151888,0.0021280553],"category_scores_gemma":[0.01475661,0.0004538597,0.00051709375,0.000923782,0.0014458589,0.0019783182,0.00095854513,0.0007757594,0.00014431615],"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.0005711898,0.00009669109,0.025203612,0.00016094916,0.00012128138,0.0004935609,0.00047237557,0.8050572,0.0090235965,0.14072703,0.0013211934,0.016751245],"study_design_scores_gemma":[0.00006989932,0.00008561843,0.005143783,0.000016928998,0.000025381782,0.00023765505,0.000087766,0.92417186,0.0020362642,0.06740241,0.0006904035,0.000032032254],"about_ca_topic_score_codex":0.003189733,"about_ca_topic_score_gemma":0.0031742984,"teacher_disagreement_score":0.003189733,"about_ca_system_score_codex":0.0013987888,"about_ca_system_score_gemma":0.00047165249,"threshold_uncertainty_score":0.0101489425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36723462,0.0007082193,0.5924688,0.0017777391,0.00016846921,0.0010799946,0.0041949647,0.0053483145,0.027018953],"genre_scores_gemma":[0.3643394,0.00031053016,0.62104946,0.00027321195,0.00005205209,0.00039011848,0.005191972,0.00064554124,0.0077476706],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991196,0.00016130805,0.000051224863,0.00026057186,0.00019295354,0.00021436592],"domain_scores_gemma":[0.996585,0.0018970248,0.00027889042,0.0005919367,0.00028522874,0.0003617919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008023351,0.00094894716,0.0014458245,0.0010997049,0.0010483235,0.0018727722,0.0027569064,0.0015953804,0.014910257],"category_scores_gemma":[0.0047686775,0.00088518305,0.0013092783,0.0014341493,0.0010184281,0.0031401645,0.0035744607,0.001852279,0.002894428],"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.0024756119,0.0010368313,0.006685603,0.00262857,0.0002468338,0.0005884745,0.0018088118,0.16666867,0.08597558,0.16960475,0.039324082,0.5229563],"study_design_scores_gemma":[0.0009086793,0.000863198,0.004481699,0.00023626184,0.00029975726,0.0005327656,0.001391661,0.5417827,0.045881998,0.37860885,0.024880737,0.00013164381],"about_ca_topic_score_codex":0.0018548666,"about_ca_topic_score_gemma":0.00517662,"teacher_disagreement_score":0.014910257,"about_ca_system_score_codex":0.0018262063,"about_ca_system_score_gemma":0.001938872,"threshold_uncertainty_score":0.04987973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35248965,0.0040613133,0.6281381,0.0013385416,0.00075952895,0.00020208763,0.0030550503,0.002850753,0.0071050776],"genre_scores_gemma":[0.63300854,0.0010176069,0.35443312,0.0003255862,0.00026995674,0.00026489416,0.0064929817,0.0013796085,0.0028076912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98544127,0.008317447,0.0007650161,0.002035643,0.0029006486,0.0005399604],"domain_scores_gemma":[0.86639494,0.10371965,0.0024281465,0.019606281,0.00608137,0.001769615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.035877448,0.0011159839,0.002019679,0.0060476284,0.0020380577,0.005078533,0.0040043136,0.003297443,0.009312458],"category_scores_gemma":[0.15275738,0.0008429696,0.0018537545,0.0047507677,0.005683834,0.0066864286,0.0052741943,0.002521826,0.0013794906],"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.01242866,0.00043193754,0.057663746,0.001566032,0.0025799759,0.0010635166,0.0017169332,0.2839749,0.029816912,0.24974655,0.018864637,0.34014627],"study_design_scores_gemma":[0.00056788017,0.0009867558,0.02338882,0.00021666208,0.0005217905,0.0013671478,0.00085759285,0.51557064,0.018340047,0.42914647,0.008754816,0.00028138288],"about_ca_topic_score_codex":0.001301698,"about_ca_topic_score_gemma":0.0020639747,"teacher_disagreement_score":0.035877448,"about_ca_system_score_codex":0.0018105297,"about_ca_system_score_gemma":0.0017005355,"threshold_uncertainty_score":0.18974036},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19528082,0.00033349206,0.7953925,0.00049231265,0.000059042904,0.00016301367,0.00021738648,0.0006300574,0.007431367],"genre_scores_gemma":[0.5480293,0.00033505884,0.44439062,0.00015989762,0.00006319555,0.00032214043,0.0005439192,0.00020673255,0.005949122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995307,0.0002223699,0.000017160393,0.00009593644,0.00007485124,0.000059111208],"domain_scores_gemma":[0.997382,0.002153639,0.00014800538,0.00015275003,0.00008235124,0.0000811469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010387354,0.00048609878,0.0008049503,0.0008145191,0.0006313084,0.0011443518,0.0011917214,0.00093709445,0.0039884364],"category_scores_gemma":[0.004269236,0.0006657115,0.00083406555,0.0011306631,0.00085601694,0.0017853685,0.0011793582,0.0009927077,0.0003218996],"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.00030859266,0.000092284965,0.0009034389,0.00008836119,0.000036074747,0.00011698277,0.00013536723,0.8317138,0.0029437947,0.08883903,0.0014867493,0.07333552],"study_design_scores_gemma":[0.000071676965,0.00006424757,0.00017581797,0.000011596098,0.000017056087,0.000033111864,0.00004039034,0.92897755,0.0014103168,0.06806978,0.0011190847,0.000009301204],"about_ca_topic_score_codex":0.0018926437,"about_ca_topic_score_gemma":0.0027993307,"teacher_disagreement_score":0.0039884364,"about_ca_system_score_codex":0.00083945197,"about_ca_system_score_gemma":0.0007095957,"threshold_uncertainty_score":0.013342679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7904807,0.005590356,0.19565763,0.0016906766,0.00007103203,0.000042164345,0.00043923187,0.0009399694,0.005088199],"genre_scores_gemma":[0.97963357,0.000910467,0.017893102,0.00016165106,0.0000561482,0.000038667782,0.0003524901,0.00006021491,0.00089375407],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950063,0.0000647617,0.00002986552,0.0001974332,0.00014748827,0.000059713697],"domain_scores_gemma":[0.99806875,0.0006264711,0.0008409795,0.00016473174,0.00018129169,0.00011783282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007263591,0.00032184253,0.00048438204,0.0003032725,0.0005770032,0.0012592209,0.00092477887,0.00097565394,0.0020546038],"category_scores_gemma":[0.0022956063,0.00021948999,0.0003622456,0.00054831617,0.0009755117,0.0015293529,0.0009567592,0.0011018808,0.00095585163],"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.00029600374,0.00012493334,0.095198795,0.0008060044,0.00026216276,0.0006058665,0.00033763124,0.063929185,0.6436731,0.015931865,0.0016867194,0.17714772],"study_design_scores_gemma":[0.00004243437,0.00088701124,0.32747093,0.0002319897,0.00026372776,0.0022842824,0.0005403679,0.2700203,0.29833233,0.07484058,0.024903676,0.00018230558],"about_ca_topic_score_codex":0.0006187355,"about_ca_topic_score_gemma":0.0008290894,"teacher_disagreement_score":0.0020546038,"about_ca_system_score_codex":0.0006144175,"about_ca_system_score_gemma":0.00048334198,"threshold_uncertainty_score":0.0068733096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79690737,0.0021795863,0.18357338,0.0010020734,0.00006617577,0.00014685057,0.0020448905,0.0006229793,0.013456682],"genre_scores_gemma":[0.90662336,0.0023589768,0.07556103,0.00020568329,0.0000791283,0.00023779694,0.0027932245,0.00039739403,0.01174344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968755,0.00006153711,0.000014125702,0.00012567945,0.000070418944,0.00004068115],"domain_scores_gemma":[0.99595416,0.00282133,0.00049760245,0.00028721453,0.00019606944,0.00024372163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033857845,0.00041741008,0.0005129349,0.002288329,0.0009948105,0.0013141292,0.0010768131,0.0010260859,0.004735423],"category_scores_gemma":[0.004862715,0.0007493754,0.0007070939,0.002384288,0.0010567144,0.002228779,0.0007776953,0.0010377582,0.00034379063],"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.000583028,0.00012786368,0.012769906,0.0007646526,0.00018988854,0.00093107217,0.0018109591,0.2086022,0.017187536,0.6249088,0.012092349,0.1200318],"study_design_scores_gemma":[0.000038752936,0.000049731672,0.0047109905,0.000057475685,0.000058000154,0.0005710376,0.00031732177,0.12277598,0.0022980738,0.8632536,0.00583786,0.000031229563],"about_ca_topic_score_codex":0.002492985,"about_ca_topic_score_gemma":0.003452388,"teacher_disagreement_score":0.004735423,"about_ca_system_score_codex":0.0008568301,"about_ca_system_score_gemma":0.00045447057,"threshold_uncertainty_score":0.015841544},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041279126,0.00048548708,0.93969166,0.00044973497,0.00021380701,0.00038951542,0.0022427253,0.01273672,0.0025111777],"genre_scores_gemma":[0.06802652,0.00010302635,0.9214744,0.00015845061,0.000041043397,0.00029745893,0.0061949817,0.001368651,0.0023354178],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977744,0.00047451712,0.00015752498,0.0008173411,0.0005512506,0.00022487591],"domain_scores_gemma":[0.99490225,0.0020061478,0.00022154271,0.002238279,0.00044824253,0.00018359075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031582953,0.001561773,0.0020197183,0.0022200455,0.0016428063,0.0023425126,0.004189081,0.0024906183,0.010633572],"category_scores_gemma":[0.009420035,0.0008485116,0.002329997,0.0028796198,0.0012998936,0.0029084287,0.0045289174,0.0030219879,0.0037080473],"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.002346661,0.0005014622,0.00455268,0.000794201,0.00041779428,0.00046093398,0.00070967677,0.15750274,0.02991259,0.05165251,0.043578554,0.70757014],"study_design_scores_gemma":[0.0006459417,0.00031360972,0.0010607804,0.00005618591,0.0001200826,0.00067423895,0.00040580073,0.8249719,0.04629456,0.093670905,0.03170373,0.00008231971],"about_ca_topic_score_codex":0.001966744,"about_ca_topic_score_gemma":0.0026284857,"teacher_disagreement_score":0.010633572,"about_ca_system_score_codex":0.0007156054,"about_ca_system_score_gemma":0.0019392236,"threshold_uncertainty_score":0.035572767},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007827696,0.000057276207,0.99802184,0.000085424435,0.000028148748,0.00003619769,0.000049581853,0.00040554634,0.00053327176],"genre_scores_gemma":[0.026793567,0.00012164533,0.9701217,0.00008719581,0.00007862804,0.00032919503,0.0003119221,0.00034183986,0.0018144586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990502,0.000261979,0.000052890104,0.00017224558,0.00037255962,0.00009013511],"domain_scores_gemma":[0.9968606,0.001963105,0.00017448557,0.00035436268,0.00050025934,0.00014720901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002056938,0.0010919597,0.0012519534,0.0017166075,0.0011628169,0.0014071367,0.0027802836,0.0018788,0.0106415665],"category_scores_gemma":[0.007647647,0.00063234114,0.0014602551,0.002002217,0.00083469565,0.0023122402,0.003257705,0.003920838,0.0027031181],"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.0001791644,0.0001421212,0.0007437016,0.00035063285,0.000104953724,0.0002310384,0.00018709096,0.5166972,0.008260273,0.108788736,0.015713608,0.34860158],"study_design_scores_gemma":[0.0000669264,0.00003807134,0.00012252785,0.000019829722,0.000012008928,0.0001069944,0.000028012275,0.91777635,0.001457516,0.07251944,0.00783023,0.000022034],"about_ca_topic_score_codex":0.0022424336,"about_ca_topic_score_gemma":0.0039004008,"teacher_disagreement_score":0.0106415665,"about_ca_system_score_codex":0.0010478961,"about_ca_system_score_gemma":0.002199307,"threshold_uncertainty_score":0.03559959},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5663281,0.0033219538,0.38393584,0.011502087,0.00031678617,0.0006760486,0.009369931,0.0024341603,0.022115072],"genre_scores_gemma":[0.8932323,0.0015249504,0.088506594,0.001092401,0.00038348234,0.000544859,0.007443473,0.00059731357,0.006674715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951391,0.0014514045,0.0002889248,0.0012926258,0.000872168,0.00095566],"domain_scores_gemma":[0.9528995,0.039515514,0.0026222658,0.002170115,0.001446426,0.0013462303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023259295,0.0019268795,0.0027349163,0.00084585935,0.0018255294,0.005509721,0.0035309219,0.0032767802,0.00888516],"category_scores_gemma":[0.024193859,0.0010109552,0.0018382794,0.0020166507,0.0021953427,0.01029412,0.0031467092,0.0038750449,0.0011643698],"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.0035468428,0.00075074454,0.0061381543,0.0022925423,0.00038620847,0.0010176442,0.0011003735,0.7446222,0.012998277,0.1284802,0.030761981,0.067904815],"study_design_scores_gemma":[0.00039632825,0.00015514281,0.00090671616,0.00007262028,0.00006935167,0.0003710383,0.00025555366,0.7363548,0.0025894288,0.25666767,0.0021072284,0.00005411394],"about_ca_topic_score_codex":0.007684738,"about_ca_topic_score_gemma":0.0061521344,"teacher_disagreement_score":0.00888516,"about_ca_system_score_codex":0.0037056576,"about_ca_system_score_gemma":0.003616247,"threshold_uncertainty_score":0.029723883},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081481447,0.00034108435,0.9165559,0.0016676986,0.00087409036,0.0001414261,0.002270013,0.020803208,0.056531753],"genre_scores_gemma":[0.051190827,0.0013015821,0.8078175,0.0023436479,0.0011428422,0.0010374218,0.0059798136,0.023328755,0.10585764],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985279,0.00040291584,0.00011645016,0.00026432637,0.00059013226,0.00009827789],"domain_scores_gemma":[0.9948591,0.0016234965,0.00012466336,0.0014415729,0.0014866143,0.0004646565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017048881,0.001574071,0.0006610854,0.002330701,0.0010828245,0.00664754,0.002761181,0.0017466681,0.14662495],"category_scores_gemma":[0.012937816,0.0007762778,0.0010601893,0.0016550526,0.0017763162,0.005699121,0.003911928,0.0025073886,0.07886268],"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.00025223973,0.00006880285,0.0005668489,0.00059248874,0.00004206179,0.00015629074,0.00095651887,0.0023574296,0.009903743,0.24405554,0.34004584,0.40100223],"study_design_scores_gemma":[0.00004537746,0.000040719948,0.0004259195,0.00022510531,0.0000274174,0.0003328831,0.00028830356,0.017635528,0.005297455,0.23242667,0.7431914,0.000063244166],"about_ca_topic_score_codex":0.0013169008,"about_ca_topic_score_gemma":0.0015806322,"teacher_disagreement_score":0.14662495,"about_ca_system_score_codex":0.0005237365,"about_ca_system_score_gemma":0.000749963,"threshold_uncertainty_score":0.49050933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45250252,0.0003502045,0.54304665,0.00030452435,0.000030266398,0.00009619723,0.0011594713,0.0013792095,0.0011309198],"genre_scores_gemma":[0.66788167,0.00014419405,0.3280809,0.00005074776,0.00001104385,0.000077903336,0.002884929,0.00013279828,0.000735753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991842,0.00014755157,0.000063823965,0.000315138,0.0001993245,0.00009000124],"domain_scores_gemma":[0.99564844,0.0031122186,0.00040757467,0.0003611187,0.000299072,0.00017149138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007079671,0.00048708302,0.00087399327,0.0020727946,0.0006946083,0.0011837414,0.0016064721,0.0012209424,0.002218449],"category_scores_gemma":[0.008276398,0.00045763166,0.00070383254,0.0012679271,0.0005143753,0.0019610026,0.0011316463,0.0010034293,0.00031703207],"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.0009780694,0.00020726652,0.017127184,0.0004023442,0.00015424553,0.000403017,0.0003800852,0.7010577,0.021946032,0.026072819,0.0020653636,0.22920586],"study_design_scores_gemma":[0.00005679223,0.00011705996,0.0026675698,0.00001861784,0.000028004291,0.00021210387,0.0001519965,0.94598466,0.009351668,0.04004478,0.0013411258,0.00002558833],"about_ca_topic_score_codex":0.0036694568,"about_ca_topic_score_gemma":0.0032662165,"teacher_disagreement_score":0.0036694568,"about_ca_system_score_codex":0.0011637405,"about_ca_system_score_gemma":0.0010098679,"threshold_uncertainty_score":0.008443534},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06661698,0.0008906453,0.920488,0.0031885107,0.00009036107,0.00043393587,0.0026331167,0.0012660264,0.0043924847],"genre_scores_gemma":[0.27431345,0.0006543481,0.71584517,0.00071981386,0.00019167113,0.00034867594,0.005519241,0.00045501796,0.0019526585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956968,0.0011199365,0.00044771854,0.0014055849,0.00093875104,0.00039121864],"domain_scores_gemma":[0.96585774,0.028134745,0.002168694,0.0018298114,0.0015740029,0.00043505037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052575315,0.001252267,0.0016088859,0.001731659,0.0013066852,0.0032506275,0.003984474,0.0030024399,0.00879307],"category_scores_gemma":[0.027050292,0.0013351535,0.0037460984,0.0031369822,0.0026138034,0.0076819276,0.0028424475,0.004503978,0.0009807004],"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.0010453077,0.0009421889,0.01671897,0.004145111,0.00076846685,0.0020694174,0.0018244596,0.35332713,0.019253358,0.26005036,0.021810059,0.31804514],"study_design_scores_gemma":[0.00021699918,0.00009513801,0.0015901462,0.00018214728,0.00017194735,0.0008250742,0.000373596,0.4540396,0.010578718,0.5260338,0.005822779,0.00007002431],"about_ca_topic_score_codex":0.0054474636,"about_ca_topic_score_gemma":0.005629547,"teacher_disagreement_score":0.00879307,"about_ca_system_score_codex":0.002051137,"about_ca_system_score_gemma":0.0032232853,"threshold_uncertainty_score":0.029415727},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10212111,0.000947016,0.8907256,0.00042705104,0.00004720296,0.00012507856,0.00053169567,0.0008241883,0.0042510633],"genre_scores_gemma":[0.40978357,0.0010166473,0.5810831,0.00022609966,0.000103146034,0.00029582667,0.0020651242,0.0005096104,0.004916835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981117,0.0004355437,0.000104961335,0.0006666091,0.00039860583,0.00028255954],"domain_scores_gemma":[0.9948343,0.0034339505,0.00055198633,0.000689608,0.00026138948,0.0002288724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013790249,0.0010621839,0.0016204988,0.00088667386,0.00073063595,0.0016856464,0.0025239533,0.0016389638,0.0057035894],"category_scores_gemma":[0.007156853,0.00062638515,0.0014800872,0.0016736782,0.0013178367,0.005324553,0.0031618988,0.0024939862,0.0009034033],"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.0010111495,0.00037652868,0.0020050511,0.001157191,0.00015283817,0.00042822093,0.0006946795,0.6211913,0.0239849,0.15159632,0.007012292,0.19038953],"study_design_scores_gemma":[0.00014646772,0.00046390423,0.0009088566,0.00007697423,0.000070088776,0.0006222982,0.00030071373,0.758785,0.016422283,0.21395147,0.008185126,0.00006680956],"about_ca_topic_score_codex":0.0013210167,"about_ca_topic_score_gemma":0.0011986917,"teacher_disagreement_score":0.0057035894,"about_ca_system_score_codex":0.0011353629,"about_ca_system_score_gemma":0.0010774856,"threshold_uncertainty_score":0.01908046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5904153,0.00021021256,0.4057472,0.00031762273,0.000051613304,0.00005944582,0.00037446685,0.001248911,0.0015752657],"genre_scores_gemma":[0.7188681,0.00019532956,0.27837703,0.000062917854,0.0000295665,0.00004758029,0.0008896856,0.00030989462,0.0012199323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999783,0.00005748178,0.000016260043,0.00007948244,0.000036914113,0.00002687391],"domain_scores_gemma":[0.9988564,0.00070537126,0.00008939969,0.00019609096,0.00009734741,0.000055347566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000892984,0.00041233975,0.00072445907,0.0015654482,0.0006837949,0.0009965309,0.0011772498,0.0010296367,0.0025097725],"category_scores_gemma":[0.0044290153,0.0008407796,0.0011332607,0.0012216851,0.00065407826,0.0010256212,0.0007107517,0.0012644171,0.0005097885],"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.0016197334,0.00019085214,0.026339253,0.0003753182,0.00026199935,0.0010706201,0.00084755046,0.53180736,0.07729416,0.05196447,0.0016146024,0.306614],"study_design_scores_gemma":[0.000110491674,0.00014810117,0.0031438905,0.000027381202,0.00011924415,0.00043588673,0.00022834072,0.94569504,0.014103409,0.03377555,0.0021748657,0.00003779359],"about_ca_topic_score_codex":0.001570665,"about_ca_topic_score_gemma":0.0022288233,"teacher_disagreement_score":0.0025097725,"about_ca_system_score_codex":0.0005468318,"about_ca_system_score_gemma":0.00068051997,"threshold_uncertainty_score":0.0083960295},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68802184,0.00092350063,0.28070572,0.0026717458,0.00025681767,0.0003448764,0.004169624,0.0019389581,0.020966865],"genre_scores_gemma":[0.9034744,0.00030819606,0.08913213,0.00024150246,0.00007688745,0.00062881765,0.0033540234,0.00020454846,0.0025794765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992248,0.0004833324,0.000035999845,0.00009953887,0.000089056644,0.00006721951],"domain_scores_gemma":[0.9795202,0.018426126,0.00036249642,0.00048226514,0.0008004806,0.0004085333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002540612,0.0008424942,0.0007980475,0.0011771051,0.0009153547,0.0012447597,0.0018764006,0.0016421746,0.009913633],"category_scores_gemma":[0.01754119,0.000384219,0.0008447539,0.00097448425,0.0010721122,0.001080112,0.0012355731,0.0011329234,0.00067898526],"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.0001269594,0.00009060375,0.0032279356,0.0000784232,0.00003144612,0.00013622965,0.000047767913,0.97891325,0.00026383935,0.011892853,0.0013868755,0.0038038732],"study_design_scores_gemma":[0.000026728496,0.000018943783,0.00014346786,0.0000057600105,0.000004086403,0.000015096446,0.000013288268,0.9942821,0.00016759934,0.0050211255,0.00029852006,0.000003252392],"about_ca_topic_score_codex":0.0059065903,"about_ca_topic_score_gemma":0.002919365,"teacher_disagreement_score":0.009913633,"about_ca_system_score_codex":0.0011341004,"about_ca_system_score_gemma":0.0010388899,"threshold_uncertainty_score":0.033164382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99025625,0.00066564267,0.007749649,0.000070884016,0.0000062173544,0.000008517086,0.0006230448,0.00010188839,0.0005180299],"genre_scores_gemma":[0.9904612,0.00020597827,0.0072397157,0.000041225994,0.000009572007,0.00001777737,0.0017491373,0.000029558916,0.00024586442],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953187,0.000073889736,0.000026299402,0.00022939897,0.00007908349,0.000059374444],"domain_scores_gemma":[0.99819356,0.001049835,0.00038478518,0.00011564689,0.00014944597,0.00010667219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000591723,0.00019034962,0.00036755222,0.0014578631,0.00028653236,0.0005825848,0.00030817496,0.00056039955,0.0017456291],"category_scores_gemma":[0.002853412,0.0001373794,0.00030907235,0.0014413059,0.00048119266,0.00034067026,0.00043667643,0.0005065053,0.00034102524],"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.001320404,0.0000959194,0.5498107,0.0005249638,0.00036666557,0.0004185849,0.00059315254,0.006820493,0.38334545,0.0011348061,0.0003731723,0.055195544],"study_design_scores_gemma":[0.000024328127,0.00019058443,0.95151246,0.000023138822,0.000109302506,0.00089574,0.0002320628,0.010684004,0.032944802,0.0015914482,0.0017710527,0.000021023821],"about_ca_topic_score_codex":0.0012057235,"about_ca_topic_score_gemma":0.0015741909,"teacher_disagreement_score":0.0017456291,"about_ca_system_score_codex":0.0004282176,"about_ca_system_score_gemma":0.00015908701,"threshold_uncertainty_score":0.005839765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50023043,0.00060783926,0.4970161,0.0002615924,0.000015412565,0.00006720014,0.00005286721,0.00045409848,0.0012945206],"genre_scores_gemma":[0.91287917,0.00027665662,0.0858002,0.00008455046,0.00001904541,0.00008932216,0.0001455901,0.00013459373,0.0005709043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99381554,0.0033052217,0.00035052327,0.00091869826,0.0012815815,0.00032831973],"domain_scores_gemma":[0.93093276,0.054947767,0.0047655697,0.0069502327,0.0018653966,0.0005383703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012048721,0.0003324616,0.00095755345,0.0018952515,0.000664956,0.0015153916,0.0014067219,0.0012656112,0.0009499282],"category_scores_gemma":[0.086448856,0.0005198504,0.0007985168,0.001808678,0.002364228,0.0031182556,0.0030267427,0.0010732828,0.00021269785],"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.0009618098,0.00011987652,0.069180705,0.00025524842,0.00030984968,0.00031883953,0.0012830731,0.64032763,0.014155484,0.13805771,0.00047783417,0.13455188],"study_design_scores_gemma":[0.0000681734,0.00017323841,0.0068285028,0.00004468048,0.00007447339,0.00038688997,0.00012407942,0.86805004,0.012591393,0.10995343,0.0016487851,0.000056264653],"about_ca_topic_score_codex":0.0017832512,"about_ca_topic_score_gemma":0.0020384602,"teacher_disagreement_score":0.012048721,"about_ca_system_score_codex":0.0012968403,"about_ca_system_score_gemma":0.0010546558,"threshold_uncertainty_score":0.063720465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3736979,0.00019469496,0.62261146,0.00049076386,0.0000146647535,0.00013873054,0.0005760065,0.0006211986,0.0016545851],"genre_scores_gemma":[0.581124,0.00006651775,0.41611162,0.00011779083,0.000018928724,0.0001298299,0.0018067549,0.00011407938,0.0005104854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888915,0.0005077878,0.00007565536,0.00021285602,0.00022527082,0.00008933793],"domain_scores_gemma":[0.9874478,0.010393458,0.0006707114,0.0007421946,0.00054417585,0.0002016315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002580693,0.0004322378,0.0005350378,0.0012126883,0.00077309494,0.0010588131,0.0010410219,0.0008395715,0.002768974],"category_scores_gemma":[0.018066587,0.00054291,0.0008715384,0.00093105604,0.0010323112,0.0016034333,0.0010689512,0.0010809911,0.00023634508],"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.0015640205,0.00046336773,0.041140687,0.0003624522,0.00016789006,0.00072785263,0.000850243,0.6442428,0.018309971,0.084032424,0.004413174,0.2037251],"study_design_scores_gemma":[0.00006939225,0.000078630816,0.0020932192,0.00001842255,0.00002587236,0.00022985572,0.000111568326,0.9340234,0.0050005866,0.057554368,0.00077607867,0.00001866392],"about_ca_topic_score_codex":0.0017672132,"about_ca_topic_score_gemma":0.0025317639,"teacher_disagreement_score":0.002768974,"about_ca_system_score_codex":0.0005806554,"about_ca_system_score_gemma":0.0010454117,"threshold_uncertainty_score":0.013648152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96580094,0.000050007602,0.033735212,0.000026622334,0.0000016900082,0.000008676148,0.000029655494,0.00008321318,0.00026393944],"genre_scores_gemma":[0.9811624,0.000038720525,0.018413689,0.000012905371,0.000002958615,0.000014519561,0.0001298248,0.000031668027,0.0001933386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995889,0.0001582648,0.000017870232,0.000095554766,0.00009970362,0.00003965036],"domain_scores_gemma":[0.9977564,0.0014677856,0.0002751779,0.0002054672,0.00018289224,0.00011214608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015174529,0.00014136013,0.0004347749,0.00064597913,0.0003076548,0.0004954037,0.0005443305,0.00022217432,0.00036959597],"category_scores_gemma":[0.005760282,0.00014493603,0.00030989174,0.00041170735,0.00045389688,0.00035885,0.00047973215,0.0002904653,0.000058660757],"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.0016758287,0.00012874385,0.2596561,0.00018630586,0.0002875244,0.00074951485,0.00063408475,0.45669332,0.1355143,0.012160964,0.00036668326,0.1319466],"study_design_scores_gemma":[0.00003685196,0.0002175109,0.05858998,0.000012712302,0.000085486674,0.00043811416,0.00016063306,0.8981016,0.036051355,0.0056707705,0.0006084597,0.00002650055],"about_ca_topic_score_codex":0.0015689027,"about_ca_topic_score_gemma":0.0027799031,"teacher_disagreement_score":0.0015689027,"about_ca_system_score_codex":0.00040437584,"about_ca_system_score_gemma":0.00044104393,"threshold_uncertainty_score":0.008025169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13409266,0.00022080237,0.83090025,0.00031064302,0.00008015569,0.00020847234,0.00034887064,0.00086117414,0.03297698],"genre_scores_gemma":[0.5329524,0.00024014496,0.44622844,0.00018033775,0.000022470882,0.00025764972,0.0005142016,0.0002787378,0.0193256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997193,0.00005235943,0.000018395007,0.000077473946,0.000058679223,0.00007386082],"domain_scores_gemma":[0.9996294,0.000112116846,0.00004907186,0.00009597492,0.00007079676,0.000042673342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027482046,0.00039018015,0.0002952424,0.00053891045,0.0009748803,0.00060598966,0.0006879102,0.0004749994,0.0067725442],"category_scores_gemma":[0.0013360967,0.00028878808,0.00050590216,0.00053652993,0.0010398885,0.0013398724,0.0011229712,0.0005736767,0.0011036872],"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.000093586495,0.00005682347,0.0011728613,0.00018007557,0.000018090253,0.00027767027,0.00060537324,0.017614003,0.017001115,0.85984385,0.0029528898,0.10018364],"study_design_scores_gemma":[0.00004920402,0.00015256766,0.0007212455,0.00011551049,0.000044469853,0.00060429616,0.00024207268,0.11089443,0.04436292,0.782814,0.059930753,0.000068413094],"about_ca_topic_score_codex":0.0015725797,"about_ca_topic_score_gemma":0.002797771,"teacher_disagreement_score":0.0067725442,"about_ca_system_score_codex":0.0007417183,"about_ca_system_score_gemma":0.000902986,"threshold_uncertainty_score":0.02265644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63159484,0.0007299188,0.36168957,0.0022033418,0.000060220995,0.00010276559,0.00057797437,0.00049051887,0.00255082],"genre_scores_gemma":[0.97788846,0.0004119893,0.01894078,0.00019537883,0.000082378414,0.00012607065,0.00065252953,0.00010135356,0.0016009845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965581,0.001641805,0.00009656511,0.00086853054,0.00047866403,0.00035628738],"domain_scores_gemma":[0.91501355,0.073860645,0.00432218,0.003399695,0.0018432334,0.0015607205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008313745,0.00058527186,0.0012664921,0.0024203807,0.00068036723,0.002510884,0.002760086,0.0022257334,0.0029561003],"category_scores_gemma":[0.06952317,0.00093996676,0.0005957017,0.0016201192,0.0045988266,0.00563081,0.0018668,0.0024534971,0.00056857534],"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.0009925003,0.00018442063,0.034640793,0.0002496032,0.0001618387,0.0007487929,0.00046408907,0.56135595,0.007471198,0.3686987,0.0026155275,0.02241659],"study_design_scores_gemma":[0.00011159434,0.00011571784,0.0043317103,0.000032912878,0.000023067942,0.00022549709,0.00010167382,0.9066166,0.0019002326,0.08595257,0.0005251411,0.0000632662],"about_ca_topic_score_codex":0.0021803116,"about_ca_topic_score_gemma":0.0012754507,"teacher_disagreement_score":0.008313745,"about_ca_system_score_codex":0.0022324708,"about_ca_system_score_gemma":0.0007971787,"threshold_uncertainty_score":0.043967783},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085266813,0.000060078404,0.99789655,0.000084853666,0.000028090377,0.000035290126,0.000048909584,0.00043452036,0.00055897585],"genre_scores_gemma":[0.028522026,0.00012692186,0.96834004,0.00009004804,0.00007788602,0.0003282057,0.0003194015,0.00035795366,0.0018374381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990513,0.00025856882,0.000051641415,0.00018052252,0.00036563692,0.00009228898],"domain_scores_gemma":[0.99686265,0.0019439656,0.00017587254,0.00036756642,0.0005026271,0.00014729243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020617915,0.0011068,0.0012516004,0.0016846764,0.0012286877,0.0014477355,0.002778086,0.001948672,0.0104523925],"category_scores_gemma":[0.007730643,0.0006406561,0.0014366426,0.0020301214,0.00087653316,0.0023500288,0.0032455702,0.0038423615,0.0027773557],"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.00017080178,0.00014030356,0.00073026214,0.00033414233,0.000101454614,0.00020950614,0.00018039231,0.52453876,0.008253548,0.10574327,0.015466795,0.34413075],"study_design_scores_gemma":[0.00006718011,0.000038796858,0.00012857247,0.000020149553,0.000012349521,0.00010626665,0.000027664424,0.9163049,0.0015566206,0.07345234,0.008262641,0.000022574846],"about_ca_topic_score_codex":0.002329065,"about_ca_topic_score_gemma":0.0038230233,"teacher_disagreement_score":0.0104523925,"about_ca_system_score_codex":0.0010763449,"about_ca_system_score_gemma":0.0021518848,"threshold_uncertainty_score":0.034966707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015196265,0.00023143576,0.97280407,0.00060373597,0.00026117833,0.00025831873,0.00051546685,0.003786531,0.0063429847],"genre_scores_gemma":[0.059598166,0.00011140942,0.9305581,0.00029653727,0.000091422655,0.00025861434,0.0015495121,0.0005694881,0.006966836],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986626,0.00023217958,0.00006234058,0.00038250527,0.0004211018,0.00023927301],"domain_scores_gemma":[0.998147,0.00054115243,0.00009692341,0.00072654686,0.0003148064,0.00017347482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088352856,0.0020584762,0.0018709031,0.0018120384,0.00093413633,0.0022778877,0.0035338623,0.002099926,0.024658494],"category_scores_gemma":[0.004512328,0.00083635765,0.0019008758,0.0029675954,0.0007975712,0.0040845633,0.0029879257,0.004214315,0.0057211365],"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.0010790464,0.00083812524,0.0010549494,0.00038290065,0.00015903615,0.00020939406,0.00023280646,0.16640812,0.022726314,0.03968082,0.043151714,0.72407675],"study_design_scores_gemma":[0.000357334,0.0001788483,0.00045941683,0.000030367477,0.000088942885,0.00022199987,0.000090204754,0.92714536,0.0070663597,0.04734907,0.016975138,0.00003690124],"about_ca_topic_score_codex":0.00562571,"about_ca_topic_score_gemma":0.009707372,"teacher_disagreement_score":0.024658494,"about_ca_system_score_codex":0.0017616642,"about_ca_system_score_gemma":0.0022906326,"threshold_uncertainty_score":0.08249092},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011705465,0.00025674925,0.9821339,0.00009028067,0.00010355508,0.00008040688,0.00007601155,0.0007347005,0.0048190025],"genre_scores_gemma":[0.25171086,0.00047526378,0.73463213,0.00020300617,0.000082714345,0.00026622636,0.00055314787,0.00027190626,0.011804754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995271,0.00012039912,0.00002122894,0.00009988618,0.00017518637,0.000056315206],"domain_scores_gemma":[0.9996666,0.00014093253,0.00002894362,0.00007829503,0.00005524653,0.000029900404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042678314,0.0004936514,0.0005019765,0.00079381646,0.00063712173,0.00065802265,0.0010475847,0.00064821384,0.0045796125],"category_scores_gemma":[0.0011670542,0.00021117099,0.0005123106,0.00079608907,0.0005484272,0.0014877248,0.0011026821,0.0008405717,0.0009283662],"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.00023614592,0.00020401755,0.0013333615,0.00035392988,0.00007428238,0.0006595068,0.00029214605,0.10349179,0.037005942,0.20059824,0.008499543,0.64725107],"study_design_scores_gemma":[0.00018603193,0.0003484844,0.0007696054,0.00004849269,0.000070390306,0.0016546402,0.00010197832,0.79952776,0.039836995,0.10552246,0.05185383,0.00007929864],"about_ca_topic_score_codex":0.0008687033,"about_ca_topic_score_gemma":0.00092174485,"teacher_disagreement_score":0.0045796125,"about_ca_system_score_codex":0.00028124894,"about_ca_system_score_gemma":0.0007043022,"threshold_uncertainty_score":0.015320301},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100118935,0.000612297,0.8886854,0.0010336844,0.00008985025,0.00018899857,0.00045530606,0.001092929,0.007722563],"genre_scores_gemma":[0.5005555,0.0007266101,0.48479602,0.00048729888,0.00016623951,0.0003764753,0.0021875699,0.00041657852,0.0102876015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884796,0.00027373427,0.00005605529,0.000398816,0.00021865436,0.0002047955],"domain_scores_gemma":[0.9968162,0.00194917,0.00029123275,0.0005120127,0.00021004613,0.00022131047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011148704,0.00095708546,0.0013732689,0.0007794306,0.0012294768,0.002154321,0.0032701509,0.0019680911,0.0063508055],"category_scores_gemma":[0.004924482,0.0006012927,0.0016207905,0.0017774251,0.0014640172,0.0045205993,0.0021634684,0.0027740705,0.0008620137],"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.000838808,0.0004232949,0.0020201127,0.00060090516,0.00013504246,0.0005289027,0.00038098925,0.6305492,0.009360646,0.2336573,0.011680382,0.10982446],"study_design_scores_gemma":[0.00013623133,0.00016426618,0.0003796867,0.000024215242,0.000041538144,0.0005266589,0.00018303089,0.76030105,0.0058674263,0.22536325,0.0069710277,0.000041657317],"about_ca_topic_score_codex":0.0025382603,"about_ca_topic_score_gemma":0.0023628091,"teacher_disagreement_score":0.0063508055,"about_ca_system_score_codex":0.0014169295,"about_ca_system_score_gemma":0.0012529936,"threshold_uncertainty_score":0.021245599},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7126497,0.0012134903,0.26808128,0.002042044,0.00032036172,0.00051831995,0.0032012046,0.0020362742,0.009937338],"genre_scores_gemma":[0.9455726,0.0000733995,0.0500828,0.00025865666,0.000104432314,0.00032158,0.0028971985,0.00023325245,0.00045605743],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.94041204,0.03446022,0.0030958361,0.010948522,0.00841237,0.0026710376],"domain_scores_gemma":[0.5703571,0.39104718,0.0097966,0.017886637,0.007436914,0.0034755836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.033834055,0.0017444645,0.0024426663,0.00726632,0.0033164173,0.004318326,0.005739363,0.0045784106,0.0074162213],"category_scores_gemma":[0.24578106,0.00068127725,0.0036227677,0.007370237,0.008626021,0.0049080015,0.004011575,0.004191911,0.0008197547],"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.008357933,0.0009364958,0.54654586,0.001546138,0.008163648,0.0014775443,0.0018478485,0.15344313,0.009955445,0.08027362,0.009327758,0.17812449],"study_design_scores_gemma":[0.0009061079,0.002297132,0.15052825,0.0002180458,0.0013146151,0.0022793664,0.0024766203,0.64063925,0.013993229,0.17766437,0.007464046,0.00021895496],"about_ca_topic_score_codex":0.0012407522,"about_ca_topic_score_gemma":0.0008429813,"teacher_disagreement_score":0.033834055,"about_ca_system_score_codex":0.0016933806,"about_ca_system_score_gemma":0.0023010308,"threshold_uncertainty_score":0.17893374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021271095,0.0037597714,0.9291008,0.008481344,0.00026956017,0.000084719824,0.00053735025,0.0004707777,0.03602457],"genre_scores_gemma":[0.64150006,0.0036546038,0.3437979,0.002585526,0.0009111516,0.000545458,0.0010063641,0.0004972101,0.0055017923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98714185,0.006627362,0.0008075635,0.002996535,0.0018980777,0.00052851817],"domain_scores_gemma":[0.9554934,0.032619882,0.0022578982,0.007475631,0.0014882082,0.0006650384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016408348,0.00094770663,0.0019297575,0.004325571,0.0027457308,0.0067556994,0.0038880815,0.0029189417,0.009339636],"category_scores_gemma":[0.07031822,0.0009624716,0.0020779765,0.0040812804,0.0181064,0.013476497,0.0068602297,0.005304199,0.0016995547],"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.000015018089,0.0000072477987,0.0012426454,0.0001202249,0.00003624518,0.000049541148,0.00031220625,0.008943447,0.00012664126,0.97265327,0.001817332,0.014676179],"study_design_scores_gemma":[0.0000054656393,0.000005154328,0.00014368264,0.000035792873,0.0000043359196,0.000049293034,0.000033700988,0.0075135455,0.00010852222,0.9889557,0.0031376637,0.0000070716933],"about_ca_topic_score_codex":0.001956732,"about_ca_topic_score_gemma":0.001281994,"teacher_disagreement_score":0.016408348,"about_ca_system_score_codex":0.0033451938,"about_ca_system_score_gemma":0.0026558405,"threshold_uncertainty_score":0.08677673},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20678316,0.0023125361,0.7688207,0.004163487,0.00017477701,0.0002122409,0.000889545,0.0006937685,0.015949829],"genre_scores_gemma":[0.65201014,0.0014820445,0.3336347,0.0005916049,0.00034427558,0.00038131786,0.0019992504,0.0003410243,0.0092157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831843,0.00048058172,0.000101886784,0.0005262338,0.0003245873,0.00024833015],"domain_scores_gemma":[0.983809,0.013388575,0.00081266003,0.0008629047,0.0005172783,0.0006095163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023585842,0.0008184002,0.0014276467,0.00085260684,0.0012871872,0.0028288364,0.0031118176,0.0023927744,0.008719805],"category_scores_gemma":[0.013039163,0.00042578147,0.0015358076,0.0018290995,0.0018826006,0.005657102,0.0031069785,0.0036434657,0.00065896934],"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.0007630689,0.00033349713,0.0034879893,0.0011716547,0.00020301758,0.00037860754,0.0007240931,0.5284105,0.003127046,0.34279028,0.012152978,0.10645727],"study_design_scores_gemma":[0.00014321285,0.00012888217,0.00109844,0.000071525516,0.000073211704,0.00048623892,0.00032693532,0.4925035,0.0036372042,0.49562904,0.0058572832,0.000044462184],"about_ca_topic_score_codex":0.0014069618,"about_ca_topic_score_gemma":0.0016019731,"teacher_disagreement_score":0.008719805,"about_ca_system_score_codex":0.0022383076,"about_ca_system_score_gemma":0.0014097595,"threshold_uncertainty_score":0.029170632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82438487,0.00027289757,0.17368525,0.000107913474,0.000008817503,0.000022032356,0.00011706023,0.00016689055,0.0012343108],"genre_scores_gemma":[0.88086754,0.00021792695,0.1179612,0.000022097483,0.0000067402384,0.000028219614,0.00034151156,0.00010760116,0.00044721615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996051,0.00012355039,0.000021857033,0.00011942569,0.0000809602,0.000049159993],"domain_scores_gemma":[0.9987437,0.0007106102,0.0002443961,0.0001407372,0.00008088943,0.0000796883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009290808,0.0002850697,0.00056215696,0.0009735846,0.000629392,0.0013868706,0.0006870689,0.0006971389,0.0012829528],"category_scores_gemma":[0.005412018,0.000401336,0.00065693137,0.0010456099,0.00092736026,0.0012796706,0.0009334161,0.0010226142,0.00021917504],"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.0010857712,0.00015011367,0.064458445,0.0002810029,0.0002102087,0.00049741863,0.0008270083,0.6521976,0.10683586,0.062265474,0.00044655506,0.11074456],"study_design_scores_gemma":[0.00008325713,0.00038206493,0.05649712,0.00006999683,0.00010507006,0.0004539055,0.0005099913,0.77632767,0.037709482,0.12448451,0.0032929194,0.000084032006],"about_ca_topic_score_codex":0.0010445094,"about_ca_topic_score_gemma":0.002031629,"teacher_disagreement_score":0.0013868706,"about_ca_system_score_codex":0.00078963,"about_ca_system_score_gemma":0.00039906718,"threshold_uncertainty_score":0.0057291985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07545936,0.022336325,0.57003236,0.022814706,0.0068314164,0.00013183104,0.0005066009,0.0025203035,0.29936713],"genre_scores_gemma":[0.7312104,0.012418074,0.13287301,0.0066500353,0.0024760151,0.00027298238,0.0007290437,0.0020013487,0.11136918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907553,0.00015314341,0.00003979474,0.000333265,0.00027206106,0.0001262113],"domain_scores_gemma":[0.99719846,0.0011949337,0.00010948112,0.0011337652,0.00022373586,0.00013961857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017071717,0.00057076267,0.0012536675,0.0011992331,0.0017973584,0.002748763,0.0026291606,0.0020279237,0.015279269],"category_scores_gemma":[0.009048035,0.00048082194,0.00093494786,0.0016064652,0.003644347,0.0071669025,0.004657645,0.004009556,0.0021051744],"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.000043973192,0.000016394079,0.00021734092,0.00006574118,0.000009034047,0.00014485871,0.00014897164,0.0027134912,0.0021181442,0.94022745,0.004987743,0.049306937],"study_design_scores_gemma":[0.000020140356,0.000034534267,0.00031532743,0.000069879265,0.000020440631,0.00040141205,0.00013297226,0.015167448,0.009399284,0.92295027,0.05146432,0.000024077119],"about_ca_topic_score_codex":0.001004581,"about_ca_topic_score_gemma":0.0007424874,"teacher_disagreement_score":0.015279269,"about_ca_system_score_codex":0.0015087266,"about_ca_system_score_gemma":0.00094119896,"threshold_uncertainty_score":0.0511142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007050575,0.00023629164,0.9860902,0.00017954512,0.0000545756,0.00006206536,0.00018505135,0.0027859781,0.0033557175],"genre_scores_gemma":[0.10988459,0.00022425172,0.88195264,0.00012435271,0.00006165982,0.0003832207,0.00095527316,0.0014704844,0.0049435417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971468,0.0008909186,0.00020249463,0.00071987795,0.0006698316,0.00037003116],"domain_scores_gemma":[0.9861239,0.0092381025,0.00036927185,0.003067403,0.0008853194,0.00031604868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033869864,0.0021532981,0.0024224701,0.0022538172,0.0018114684,0.003398403,0.007786826,0.004046238,0.023844521],"category_scores_gemma":[0.023058599,0.0015383045,0.0027538864,0.0044986256,0.0026791438,0.007236435,0.00600733,0.004580262,0.0069058365],"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.0009710896,0.00033847857,0.00091237086,0.00048707484,0.00011599826,0.000116233685,0.0005187563,0.26373485,0.004477876,0.1760488,0.021349048,0.53092945],"study_design_scores_gemma":[0.00022773506,0.00008458362,0.00013713914,0.000056944948,0.00004051247,0.000079070116,0.00010069884,0.65705466,0.003206086,0.33336687,0.0055988985,0.000046842088],"about_ca_topic_score_codex":0.0034445517,"about_ca_topic_score_gemma":0.004619003,"teacher_disagreement_score":0.023844521,"about_ca_system_score_codex":0.0023154588,"about_ca_system_score_gemma":0.0026708662,"threshold_uncertainty_score":0.07976782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18432455,0.0029152208,0.71353525,0.015542538,0.0005492899,0.00043389262,0.005732563,0.0022018994,0.074764825],"genre_scores_gemma":[0.5522934,0.0029978096,0.39227876,0.0027095235,0.0016781207,0.0009898958,0.012036791,0.0023339475,0.03268177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939614,0.0019430651,0.00034694953,0.0017733093,0.001184121,0.0007912297],"domain_scores_gemma":[0.9745525,0.020408193,0.000732941,0.0024293067,0.0008299169,0.0010470633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005938037,0.002294818,0.0039755045,0.0029799955,0.004290436,0.008559569,0.0081075495,0.0054728887,0.023139756],"category_scores_gemma":[0.034224223,0.0016560418,0.0041755745,0.0068711084,0.004444219,0.021308737,0.0072414693,0.009842358,0.0022059125],"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.0005984522,0.0003057601,0.0010113383,0.00057352823,0.00014162528,0.0002224066,0.0006892135,0.061334874,0.000944622,0.8646168,0.025295626,0.044265743],"study_design_scores_gemma":[0.00012379719,0.000025975618,0.00017771558,0.00005476482,0.000048912912,0.00014483173,0.00011984152,0.087767296,0.00050076935,0.90685976,0.0041529574,0.000023331962],"about_ca_topic_score_codex":0.0036092761,"about_ca_topic_score_gemma":0.004447326,"teacher_disagreement_score":0.023139756,"about_ca_system_score_codex":0.0053573214,"about_ca_system_score_gemma":0.002847699,"threshold_uncertainty_score":0.07741016},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02614021,0.0015738241,0.9623738,0.0015895764,0.0002054076,0.000097396296,0.00024544855,0.000921078,0.006853293],"genre_scores_gemma":[0.27976963,0.0025056268,0.70367146,0.001044952,0.000730329,0.0004388787,0.0022947206,0.0012176528,0.008326771],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750394,0.0011937573,0.00013112639,0.00043966642,0.0005571075,0.00017440629],"domain_scores_gemma":[0.98826104,0.009262463,0.00038030552,0.0013205355,0.0005312945,0.00024429432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035120824,0.001155995,0.002743156,0.0021605573,0.0018309854,0.0024770624,0.0037224195,0.002595744,0.008934324],"category_scores_gemma":[0.019352784,0.0008948799,0.0008320866,0.005821414,0.0023069563,0.007896376,0.0045367065,0.003272205,0.0016329398],"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.00080560596,0.0002482467,0.0009291358,0.0003699045,0.00013360754,0.00020946474,0.0002791134,0.32613146,0.003490833,0.3142305,0.016103294,0.3370688],"study_design_scores_gemma":[0.000063706786,0.000044191864,0.00018765636,0.000029061388,0.00002247526,0.00006839944,0.000048252452,0.66938967,0.0009761366,0.32514933,0.0040071495,0.000013902816],"about_ca_topic_score_codex":0.0037888126,"about_ca_topic_score_gemma":0.003812054,"teacher_disagreement_score":0.008934324,"about_ca_system_score_codex":0.0016499244,"about_ca_system_score_gemma":0.0016832807,"threshold_uncertainty_score":0.029888272},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11801069,0.0004364701,0.87690705,0.00048614453,0.00005416008,0.00007728218,0.00022335206,0.0013390598,0.0024657412],"genre_scores_gemma":[0.40814656,0.00016324513,0.58666456,0.0001429414,0.0000370541,0.00012498164,0.0007879552,0.00033770222,0.0035949568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902713,0.00019976718,0.000047259327,0.00032650103,0.00025907572,0.00014032848],"domain_scores_gemma":[0.9974431,0.0014183364,0.00021548568,0.0004767496,0.0002855873,0.00016071704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036419,0.0007129459,0.001133373,0.0008815167,0.00067910046,0.0013295119,0.002217951,0.0011745056,0.003458322],"category_scores_gemma":[0.005160284,0.00045777496,0.0008390813,0.0010666212,0.0012041149,0.0022254824,0.0023783974,0.0016184973,0.00064543454],"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.00086372945,0.00016650147,0.0044834344,0.00032104345,0.00009618646,0.00040017863,0.00041661412,0.5755779,0.012435876,0.08321264,0.00555858,0.31646737],"study_design_scores_gemma":[0.00007095562,0.00012906503,0.0005511666,0.000016721166,0.000019383022,0.000281094,0.0001229851,0.908035,0.009017623,0.07853736,0.0031932024,0.000025351206],"about_ca_topic_score_codex":0.002119841,"about_ca_topic_score_gemma":0.0024222662,"teacher_disagreement_score":0.003458322,"about_ca_system_score_codex":0.00090409437,"about_ca_system_score_gemma":0.0012581107,"threshold_uncertainty_score":0.011569262},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38466945,0.0011078567,0.56194806,0.0019005025,0.00010193736,0.00047095274,0.0016599416,0.0005418726,0.047599554],"genre_scores_gemma":[0.8379594,0.00065738003,0.15156074,0.00031744997,0.00013598774,0.0005892562,0.002901884,0.0001821714,0.0056958026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716324,0.00088501145,0.00022782011,0.00064884685,0.00074143615,0.000333631],"domain_scores_gemma":[0.98751545,0.008609841,0.0010972338,0.00091809704,0.0010532682,0.00080610835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021076298,0.00062451104,0.0009683805,0.0041520083,0.002538113,0.004909173,0.0022438008,0.0027456915,0.010760482],"category_scores_gemma":[0.017528517,0.0009662174,0.001372989,0.0034618392,0.0028694374,0.0077014756,0.0033856314,0.0025903855,0.0010159938],"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.000085668325,0.000059427137,0.002211714,0.00018395497,0.000028622157,0.00018192873,0.00026765236,0.028389841,0.0018194781,0.9465942,0.0018168367,0.018360743],"study_design_scores_gemma":[0.000031002593,0.00004907318,0.00074597134,0.00005084228,0.00002560473,0.0006261311,0.00024067794,0.08402724,0.0018128367,0.9071211,0.005239655,0.000029853512],"about_ca_topic_score_codex":0.00039893386,"about_ca_topic_score_gemma":0.00044222188,"teacher_disagreement_score":0.010760482,"about_ca_system_score_codex":0.0014529887,"about_ca_system_score_gemma":0.0007668772,"threshold_uncertainty_score":0.03599739},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09165924,0.0018543652,0.805492,0.0020637193,0.000734928,0.00088960864,0.00887869,0.047360532,0.04106688],"genre_scores_gemma":[0.25066498,0.0007028634,0.69113624,0.0008328294,0.00020190957,0.00044973966,0.015495919,0.0035928767,0.036922716],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837273,0.00020091429,0.00017840552,0.00030557133,0.000631098,0.00031122248],"domain_scores_gemma":[0.9964193,0.0013498674,0.00028352466,0.0009926859,0.0007677502,0.00018688562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007699687,0.0017416494,0.0013990221,0.0014022953,0.0015251973,0.0032035094,0.0022247138,0.0010001041,0.04062846],"category_scores_gemma":[0.0052713933,0.0006443402,0.0010832389,0.0034824314,0.0005955452,0.00437428,0.0013165133,0.0013412066,0.0119547825],"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.00061141496,0.0004388433,0.0021317352,0.0007880526,0.00008104974,0.00023126697,0.0001546529,0.01648172,0.024565427,0.0166864,0.062701955,0.8751275],"study_design_scores_gemma":[0.0016099779,0.0012933094,0.005519204,0.00026519402,0.00034034997,0.0020342346,0.0010011116,0.28332913,0.1381874,0.34846523,0.21757087,0.00038391846],"about_ca_topic_score_codex":0.0031978758,"about_ca_topic_score_gemma":0.008839201,"teacher_disagreement_score":0.04062846,"about_ca_system_score_codex":0.0012314533,"about_ca_system_score_gemma":0.0037471363,"threshold_uncertainty_score":0.13591576},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03203152,0.00028296956,0.9578514,0.00059411384,0.000138953,0.00021054316,0.00035114514,0.0019527551,0.0065866127],"genre_scores_gemma":[0.13687368,0.00017885193,0.8560273,0.0002277277,0.00009622094,0.0002913826,0.0012091546,0.0003339764,0.0047617056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877685,0.00025768433,0.000063300446,0.00029498522,0.00035190867,0.00025514312],"domain_scores_gemma":[0.99758124,0.0012540442,0.00014109006,0.0005848071,0.00028301546,0.00015583994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012259264,0.0012816449,0.0019325082,0.0013603035,0.0011136698,0.002171248,0.003768438,0.0021337222,0.012542156],"category_scores_gemma":[0.0048483307,0.0007118644,0.0013246962,0.002568237,0.0009320594,0.0034512794,0.003062533,0.0030009344,0.0021690114],"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.0014570397,0.00081547064,0.0012898609,0.00048919045,0.00015046772,0.00027880317,0.0003375926,0.31603366,0.014557468,0.06629533,0.03249973,0.56579524],"study_design_scores_gemma":[0.00023788623,0.00010504541,0.00025407647,0.000019432075,0.00004182101,0.00013520473,0.00010091227,0.95583034,0.0025160962,0.037176743,0.0035599407,0.000022477245],"about_ca_topic_score_codex":0.004699418,"about_ca_topic_score_gemma":0.00591704,"teacher_disagreement_score":0.012542156,"about_ca_system_score_codex":0.0013825775,"about_ca_system_score_gemma":0.0028253412,"threshold_uncertainty_score":0.041957676},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018570751,0.00016936749,0.97737885,0.00009604435,0.000027706077,0.00017087892,0.00026587216,0.002168584,0.001151957],"genre_scores_gemma":[0.037560556,0.0001135699,0.9607691,0.000046955964,0.0000099724575,0.00012290015,0.00066788914,0.00027234055,0.00043679183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977642,0.000809913,0.00014434081,0.0006987792,0.0004419991,0.0001406791],"domain_scores_gemma":[0.9958799,0.0021844534,0.00025725982,0.0008301637,0.0007683781,0.00007993591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003853015,0.0014126243,0.0018443896,0.0045417505,0.0012788202,0.0017273288,0.0027259067,0.0011813573,0.0050993613],"category_scores_gemma":[0.015512232,0.0009849023,0.0017311012,0.0037832265,0.0011359098,0.001675195,0.0018441149,0.0018374772,0.00097417796],"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.0006213528,0.00038272733,0.004483038,0.0006600032,0.00042119325,0.0008732689,0.0010272964,0.34488544,0.07608199,0.06211932,0.003684112,0.50476027],"study_design_scores_gemma":[0.00017254431,0.00028051963,0.0031988677,0.00009285034,0.00022428496,0.00058465364,0.00037165437,0.89563847,0.024064528,0.050974347,0.024300307,0.000096965516],"about_ca_topic_score_codex":0.008550901,"about_ca_topic_score_gemma":0.011021764,"teacher_disagreement_score":0.008550901,"about_ca_system_score_codex":0.0016454103,"about_ca_system_score_gemma":0.002180631,"threshold_uncertainty_score":0.02037692},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13609767,0.00012374346,0.86168087,0.0002888991,0.0000196161,0.000096928125,0.000038209328,0.00023103929,0.0014230123],"genre_scores_gemma":[0.3174408,0.00015352445,0.68077046,0.000121626465,0.000030363148,0.0002172697,0.00012684765,0.0001742217,0.0009648818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679655,0.0018263651,0.000094098694,0.00030894467,0.0008134835,0.00016050476],"domain_scores_gemma":[0.98814875,0.009725152,0.0004310739,0.0011174143,0.0004588018,0.000118839336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066382545,0.0005793113,0.0006746356,0.0013092813,0.00078123505,0.0012083143,0.0012474819,0.0010324406,0.0011631758],"category_scores_gemma":[0.0281942,0.0007209813,0.0006879105,0.0027523574,0.0019660897,0.0026403945,0.0018957098,0.00097415515,0.00039624757],"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.00084616547,0.0002408927,0.014787044,0.0002268296,0.00011615978,0.00050186843,0.0012088236,0.6903276,0.043550704,0.08436837,0.0012196072,0.16260603],"study_design_scores_gemma":[0.00007786199,0.00031427047,0.0036296933,0.000033664262,0.00003955823,0.0002966279,0.00027659125,0.8884084,0.022378674,0.080291085,0.004199184,0.00005436825],"about_ca_topic_score_codex":0.0015340355,"about_ca_topic_score_gemma":0.002860934,"teacher_disagreement_score":0.0066382545,"about_ca_system_score_codex":0.0005513547,"about_ca_system_score_gemma":0.0008317553,"threshold_uncertainty_score":0.035106897},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012401371,0.000080189595,0.9960485,0.00012953929,0.000041072577,0.00003885734,0.00020222261,0.0012925706,0.00092691253],"genre_scores_gemma":[0.041722354,0.00023975392,0.95329714,0.00023351732,0.000092135546,0.00037728605,0.0010346514,0.0015727038,0.0014304222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637324,0.0012781945,0.00034540868,0.0008681462,0.0008709915,0.00026403862],"domain_scores_gemma":[0.99468696,0.0024977142,0.00031012794,0.0016378723,0.00054244976,0.0003248979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004847935,0.0014972812,0.0013080095,0.0026144052,0.0020682013,0.004499531,0.0059875567,0.0016654124,0.0064261206],"category_scores_gemma":[0.012854814,0.0015821861,0.0036393187,0.0036087395,0.0058702254,0.008003986,0.006831039,0.0055360864,0.0020826596],"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.00012133268,0.00003615648,0.0007309228,0.00021097664,0.000068097565,0.00012701751,0.00059645995,0.021189922,0.0026342596,0.92770314,0.006481029,0.0401007],"study_design_scores_gemma":[0.00007408552,0.00003984786,0.00020273769,0.00010445362,0.0000827434,0.00014106263,0.00015185133,0.10820061,0.0032971317,0.84296006,0.044702623,0.000042751893],"about_ca_topic_score_codex":0.006459048,"about_ca_topic_score_gemma":0.0076398775,"teacher_disagreement_score":0.006459048,"about_ca_system_score_codex":0.001723979,"about_ca_system_score_gemma":0.002547228,"threshold_uncertainty_score":0.02563858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012164366,0.00048352373,0.9852505,0.00009058486,0.00003863082,0.00013997489,0.00013334885,0.00094603014,0.0007530148],"genre_scores_gemma":[0.026987208,0.000310341,0.97147477,0.00006609143,0.000016056021,0.00017095043,0.0004664163,0.0001406488,0.00036752826],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966097,0.0009226489,0.0003314054,0.0014350404,0.0005065967,0.00019468743],"domain_scores_gemma":[0.996944,0.001658388,0.00048021265,0.00043325257,0.0003695331,0.00011455083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026634699,0.0018529458,0.0015318583,0.0014483125,0.00092343526,0.0010854143,0.0021663958,0.0014472874,0.003653988],"category_scores_gemma":[0.005505289,0.0013468497,0.0017383281,0.0014077654,0.0010077793,0.0013159435,0.0011929714,0.0024723632,0.0031863947],"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.00057641097,0.0002743621,0.0020624783,0.0032634374,0.00020866995,0.0005982952,0.00054137205,0.020911813,0.6566863,0.018341484,0.0032802792,0.2932551],"study_design_scores_gemma":[0.00013117705,0.0006332546,0.0012856633,0.0002146347,0.00018143184,0.00266136,0.00016071794,0.12051968,0.81066954,0.024954403,0.03847907,0.00010910225],"about_ca_topic_score_codex":0.00018215511,"about_ca_topic_score_gemma":0.0002837897,"teacher_disagreement_score":0.003653988,"about_ca_system_score_codex":0.0005511832,"about_ca_system_score_gemma":0.00086616876,"threshold_uncertainty_score":0.014085889},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20947012,0.0009170347,0.66967785,0.004014631,0.00041667037,0.00024748358,0.00059459446,0.001059914,0.11360169],"genre_scores_gemma":[0.80417126,0.0012363386,0.14088908,0.0012485399,0.0003093452,0.00024677996,0.00073473796,0.0006134869,0.05055054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990852,0.0002508188,0.00004463585,0.00023871726,0.00024385819,0.00013667364],"domain_scores_gemma":[0.9910597,0.0061142165,0.0004185557,0.0011715153,0.0005815943,0.0006543901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011255179,0.0005307553,0.0011405841,0.0010067961,0.0013598391,0.0034175958,0.0017299158,0.0011905199,0.016433926],"category_scores_gemma":[0.013909487,0.00073320523,0.0006963043,0.0014374377,0.0026235876,0.0071546547,0.0031313389,0.0032189908,0.0028690747],"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.00027289684,0.00007292064,0.0010447636,0.00015857098,0.000025560108,0.0001233783,0.0005727082,0.006344839,0.0028372847,0.9319465,0.007837155,0.04876337],"study_design_scores_gemma":[0.000053762444,0.000028125869,0.00018997033,0.000021119233,0.000014407835,0.000106537795,0.00015380878,0.020557556,0.0011153789,0.9710245,0.006726224,0.000008564468],"about_ca_topic_score_codex":0.00047815757,"about_ca_topic_score_gemma":0.0009722455,"teacher_disagreement_score":0.016433926,"about_ca_system_score_codex":0.00093476754,"about_ca_system_score_gemma":0.00069039443,"threshold_uncertainty_score":0.05497694},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055382982,0.001660963,0.9316987,0.0007789861,0.00010797239,0.00009956848,0.0002462671,0.00039390277,0.00963071],"genre_scores_gemma":[0.46596143,0.0017266924,0.528211,0.00035821495,0.00037071432,0.00026488805,0.0007232629,0.00024220326,0.0021416366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567574,0.0018705835,0.0003483229,0.0009259707,0.0010256923,0.00015366563],"domain_scores_gemma":[0.98090166,0.014728313,0.0012151948,0.0017935084,0.0009824448,0.00037894485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031528987,0.0005350556,0.0012793159,0.0062692487,0.001620211,0.0029049474,0.0018617513,0.0016161837,0.003810564],"category_scores_gemma":[0.034952935,0.0004852444,0.0010775909,0.009557774,0.0042039882,0.00798796,0.0043782294,0.002193735,0.0005436593],"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.00015486368,0.00006991206,0.0029228546,0.0001971792,0.000063809974,0.00017149467,0.0007156728,0.041939955,0.0028623894,0.77627903,0.0014904896,0.17313239],"study_design_scores_gemma":[0.000017744384,0.00007028441,0.00095071644,0.000054937434,0.000021500928,0.00032890492,0.0001619641,0.09038201,0.0013734871,0.90128815,0.005318718,0.00003166505],"about_ca_topic_score_codex":0.0013450987,"about_ca_topic_score_gemma":0.0007527321,"teacher_disagreement_score":0.0062692487,"about_ca_system_score_codex":0.0012441629,"about_ca_system_score_gemma":0.0006501448,"threshold_uncertainty_score":0.01667428},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16327639,0.00095970556,0.70339465,0.024841998,0.0010757482,0.00027775863,0.0015172305,0.0021623173,0.10249427],"genre_scores_gemma":[0.8104136,0.0010804029,0.15502664,0.0038395952,0.001485887,0.0003026957,0.0034395615,0.0009169256,0.023494778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677026,0.0007693082,0.00022525071,0.0011520007,0.00061002705,0.00047307942],"domain_scores_gemma":[0.9895572,0.0062897825,0.0005917357,0.0019081188,0.0011395854,0.00051371066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023142023,0.0004047565,0.0013747017,0.0007265429,0.0020351966,0.0030176912,0.0016275676,0.0016205265,0.014347876],"category_scores_gemma":[0.019429298,0.0004911052,0.0014060758,0.0011271434,0.0023560757,0.0078970445,0.0026587166,0.0044923364,0.0030100315],"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.00020800615,0.00021356587,0.0023459494,0.00038243926,0.00013700582,0.00036455216,0.0007760087,0.011304258,0.002130379,0.8268504,0.021576637,0.13371089],"study_design_scores_gemma":[0.000014783698,0.000028447723,0.00034258084,0.000016390335,0.000022642726,0.0001515051,0.0001792972,0.017809223,0.0007913982,0.9738893,0.006742402,0.00001202241],"about_ca_topic_score_codex":0.0028317876,"about_ca_topic_score_gemma":0.0019110915,"teacher_disagreement_score":0.014347876,"about_ca_system_score_codex":0.00073210034,"about_ca_system_score_gemma":0.0016085544,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06675501,0.0006502388,0.92484593,0.00083831564,0.000039177765,0.00006946025,0.0005688018,0.00039688605,0.005836207],"genre_scores_gemma":[0.6304662,0.0009481537,0.36144805,0.00022273783,0.00007224498,0.00016992594,0.0016792801,0.00012250949,0.0048708776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986696,0.0004848796,0.00006008064,0.0004529186,0.00019544944,0.00013698444],"domain_scores_gemma":[0.997012,0.0016589677,0.00048405447,0.0005158909,0.00013950757,0.00018945654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014498989,0.00045047037,0.0008006437,0.00069946516,0.0008810641,0.0017873793,0.0013429424,0.0013368605,0.0044431775],"category_scores_gemma":[0.0062906113,0.0004440577,0.0007353244,0.0014929076,0.0011611765,0.006117053,0.0019199289,0.0013133992,0.0004853471],"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.00028839541,0.0000715794,0.0018323147,0.00035363567,0.00006574775,0.0002665974,0.00024122492,0.38797942,0.0050801663,0.5067789,0.0050342283,0.09200776],"study_design_scores_gemma":[0.000041237952,0.00007643755,0.00042987164,0.000029816334,0.000033082484,0.00032148187,0.00009024101,0.47412822,0.0023025637,0.5106915,0.011833301,0.00002206109],"about_ca_topic_score_codex":0.00078863214,"about_ca_topic_score_gemma":0.00095758535,"teacher_disagreement_score":0.0044431775,"about_ca_system_score_codex":0.0008755982,"about_ca_system_score_gemma":0.0007657019,"threshold_uncertainty_score":0.014863908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053262927,0.0018030144,0.9295621,0.0064002876,0.00017981007,0.0001848124,0.00055325247,0.00094913057,0.007104604],"genre_scores_gemma":[0.27569836,0.0019559886,0.71528405,0.0010800553,0.00075825525,0.00045990138,0.0015647176,0.00035451696,0.002844214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574465,0.0015913204,0.00030249765,0.0009417868,0.0011693913,0.0002504285],"domain_scores_gemma":[0.9636248,0.031122297,0.0012978257,0.0026492074,0.00090304535,0.00040283115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038336252,0.0013525557,0.0017460221,0.0024568685,0.001234816,0.006224763,0.003927932,0.0023091128,0.005858508],"category_scores_gemma":[0.03156616,0.00088658807,0.0018718354,0.0033624296,0.002899905,0.012069865,0.0042215493,0.003561145,0.0009016723],"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.00045414196,0.00025762888,0.0067797406,0.0010748166,0.00038291237,0.00050837774,0.00054651615,0.5213937,0.004348663,0.26472956,0.007895531,0.19162844],"study_design_scores_gemma":[0.000054050608,0.000071641145,0.0008983397,0.000047661437,0.000060516606,0.000263521,0.000205572,0.66923475,0.0012303141,0.32442635,0.0034664895,0.000040805222],"about_ca_topic_score_codex":0.0039785285,"about_ca_topic_score_gemma":0.0050489916,"teacher_disagreement_score":0.006224763,"about_ca_system_score_codex":0.0029530383,"about_ca_system_score_gemma":0.0019053031,"threshold_uncertainty_score":0.021425903},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021151781,0.00028133113,0.9677394,0.00031821436,0.00015012099,0.0001572902,0.00040885026,0.0067846733,0.0030082955],"genre_scores_gemma":[0.09103671,0.000074270654,0.9032471,0.00014473958,0.000047313373,0.00023018653,0.001287343,0.0014306777,0.0025015734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803835,0.0005649775,0.000107930944,0.00050358754,0.00057099084,0.00021427019],"domain_scores_gemma":[0.99466467,0.0026535492,0.00018676052,0.001691398,0.0005753743,0.00022831719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035720803,0.001329833,0.0019245251,0.0020784698,0.00163259,0.0021446263,0.0039025743,0.002209775,0.014358434],"category_scores_gemma":[0.011323648,0.0009998297,0.001867014,0.0019216165,0.0013558653,0.0030258116,0.004782091,0.0032725486,0.0030765352],"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.002217508,0.00033267235,0.0022774437,0.00038217206,0.0002683478,0.00022892839,0.000635062,0.16468753,0.015220124,0.062966295,0.023285124,0.72749877],"study_design_scores_gemma":[0.00029968153,0.00020229875,0.0003633475,0.00004782916,0.00009541163,0.00017202798,0.00019832238,0.8725774,0.019665202,0.09444103,0.011896772,0.00004054078],"about_ca_topic_score_codex":0.0021704463,"about_ca_topic_score_gemma":0.00290731,"teacher_disagreement_score":0.014358434,"about_ca_system_score_codex":0.0009924845,"about_ca_system_score_gemma":0.0018737295,"threshold_uncertainty_score":0.048033714},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118516594,0.03725231,0.30978668,0.0030062834,0.0048292507,0.0016250538,0.3774854,0.03991334,0.10758516],"genre_scores_gemma":[0.081334844,0.006903753,0.22616263,0.0007613174,0.000792859,0.00059098727,0.64663064,0.0039091,0.032913897],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99920315,0.00010287456,0.00005796238,0.000369224,0.00018741722,0.0000793576],"domain_scores_gemma":[0.99949455,0.00007035944,0.00007591869,0.00009260691,0.0002154122,0.000051139516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009617831,0.0020919172,0.0010140751,0.0035271994,0.0017521565,0.0018615049,0.0012196434,0.0009935962,0.024940137],"category_scores_gemma":[0.0011785452,0.0005792809,0.001384846,0.002852309,0.00032696838,0.0008157954,0.0009961117,0.0013884181,0.026138153],"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.0018438416,0.00019584446,0.009624265,0.00407581,0.00042752875,0.0020523795,0.00079763535,0.006469546,0.4011184,0.010802098,0.18601571,0.37657705],"study_design_scores_gemma":[0.00013066038,0.00041231303,0.033001073,0.0005360949,0.0004906905,0.0027959251,0.00016087374,0.0111929085,0.093876116,0.004878673,0.852392,0.00013265928],"about_ca_topic_score_codex":0.005591537,"about_ca_topic_score_gemma":0.0051973253,"teacher_disagreement_score":0.024940137,"about_ca_system_score_codex":0.0011050985,"about_ca_system_score_gemma":0.0010026471,"threshold_uncertainty_score":0.08343303},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21124111,0.00035299186,0.77681005,0.00038880296,0.000045053937,0.00014316036,0.0008043947,0.003037412,0.0071770786],"genre_scores_gemma":[0.576194,0.00033888943,0.4196513,0.00014791342,0.000033714838,0.0004308245,0.0018102297,0.00021853915,0.0011746191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849164,0.00080437935,0.000040620394,0.0003858201,0.00017647742,0.0001010854],"domain_scores_gemma":[0.99720263,0.0020439725,0.00011740126,0.00043177136,0.000098463206,0.00010573982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023673242,0.00070794724,0.0010932158,0.0025287792,0.0009952518,0.0022158162,0.0019939344,0.0012190024,0.0040895706],"category_scores_gemma":[0.0064751576,0.0006484465,0.0015286541,0.0025347208,0.0013062181,0.002768416,0.0030671048,0.00079375366,0.00052445557],"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.00083309656,0.0002635858,0.009282827,0.00043973658,0.00039113683,0.0004948672,0.0010096248,0.591841,0.070733234,0.06885641,0.0025856327,0.25326884],"study_design_scores_gemma":[0.00007092464,0.00022546275,0.0026035865,0.000025041241,0.000084312764,0.00039399817,0.00035865337,0.86054623,0.020000098,0.10796005,0.007663899,0.00006771841],"about_ca_topic_score_codex":0.0010521464,"about_ca_topic_score_gemma":0.0008387687,"teacher_disagreement_score":0.0040895706,"about_ca_system_score_codex":0.0010707154,"about_ca_system_score_gemma":0.0005401562,"threshold_uncertainty_score":0.013680935},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012161638,0.0042832275,0.97451854,0.0020084428,0.00027558568,0.00010838349,0.00014109016,0.0012894477,0.005213655],"genre_scores_gemma":[0.049963705,0.0025958763,0.94256985,0.00054857496,0.0006137212,0.00015678939,0.000427449,0.0005494571,0.002574635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956873,0.0018482109,0.00028389518,0.0009375785,0.0009651943,0.00027771256],"domain_scores_gemma":[0.9767427,0.018414995,0.0008118663,0.0022721025,0.0013033435,0.0004548781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056742355,0.0023543513,0.002411754,0.003444853,0.0015509651,0.004198713,0.005391127,0.0039926064,0.0066967797],"category_scores_gemma":[0.027400298,0.0011828803,0.0017984291,0.005557175,0.002904801,0.016008703,0.0030012939,0.0072190054,0.0023508663],"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.00051415956,0.00046876143,0.001999222,0.0006389758,0.00011280528,0.00016042714,0.0004878766,0.1438499,0.004014689,0.32948452,0.011366548,0.5069021],"study_design_scores_gemma":[0.00012992251,0.00017520807,0.0003241705,0.00010661532,0.00005284378,0.00036087024,0.00017339835,0.56809914,0.0023024057,0.4154449,0.012751006,0.00007942981],"about_ca_topic_score_codex":0.0026438471,"about_ca_topic_score_gemma":0.0030864875,"teacher_disagreement_score":0.0066967797,"about_ca_system_score_codex":0.0018922079,"about_ca_system_score_gemma":0.0024133376,"threshold_uncertainty_score":0.030008554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6003475,0.001830345,0.39310926,0.00036998556,0.000063027204,0.00014636274,0.0013815964,0.0011821429,0.0015697513],"genre_scores_gemma":[0.9051006,0.00027484942,0.09124842,0.000100806625,0.00010816106,0.00024634687,0.0023245113,0.00028008464,0.00031626047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98740387,0.0052199787,0.0010840284,0.0030742784,0.0028750875,0.0003428039],"domain_scores_gemma":[0.8137041,0.15422459,0.013844448,0.011111815,0.0054895063,0.001625569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022730952,0.0006366331,0.0011630629,0.010661329,0.0009987197,0.003197531,0.0018324187,0.0014078632,0.0009523646],"category_scores_gemma":[0.15172575,0.00054105796,0.0008627669,0.0056408118,0.0038798314,0.0046816515,0.0024867733,0.0020486931,0.0003042267],"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.0019634585,0.0002658394,0.30305284,0.0009995366,0.0016093019,0.00051001506,0.0021444645,0.37462637,0.032444034,0.08372848,0.002129143,0.19652648],"study_design_scores_gemma":[0.00007184998,0.00058426516,0.077297226,0.00012901386,0.00018788493,0.0008665047,0.00060210907,0.7800738,0.017947797,0.119330764,0.0027172696,0.00019157089],"about_ca_topic_score_codex":0.0007903651,"about_ca_topic_score_gemma":0.00073603285,"teacher_disagreement_score":0.022730952,"about_ca_system_score_codex":0.0014824796,"about_ca_system_score_gemma":0.000653114,"threshold_uncertainty_score":0.120214164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010554225,0.00014465369,0.9865073,0.00017426748,0.000023198509,0.00006720149,0.000059653383,0.0003247614,0.0021447628],"genre_scores_gemma":[0.26957598,0.00032253034,0.72307694,0.0003576823,0.00020889267,0.00046070546,0.0005453208,0.0006440827,0.004807891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966503,0.0015092927,0.00015427411,0.00080744404,0.00066238194,0.00021646758],"domain_scores_gemma":[0.97531915,0.01809007,0.0016986853,0.0025913075,0.0014148849,0.0008859186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064052474,0.00097179646,0.0015870527,0.0031257428,0.0014541044,0.002880529,0.003485446,0.0023389016,0.0073541515],"category_scores_gemma":[0.03204895,0.0009997135,0.0016909353,0.0021007555,0.0028213637,0.004246216,0.003832243,0.0025066757,0.0014687526],"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.00027646587,0.00016248714,0.0038829397,0.00021149433,0.00011796168,0.00021818657,0.0003538408,0.5188021,0.0030758968,0.37383756,0.0037513536,0.095309764],"study_design_scores_gemma":[0.000042830263,0.000092578244,0.0004123102,0.000037766986,0.000025559975,0.00012500811,0.000045808316,0.7951686,0.0013477739,0.20024355,0.0024306595,0.0000275596],"about_ca_topic_score_codex":0.0011227535,"about_ca_topic_score_gemma":0.0011325798,"teacher_disagreement_score":0.0073541515,"about_ca_system_score_codex":0.001618713,"about_ca_system_score_gemma":0.0012619452,"threshold_uncertainty_score":0.03387457},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6265947,0.00047383396,0.35261038,0.0009303125,0.00009264248,0.00013380169,0.00046134362,0.00096029375,0.017742716],"genre_scores_gemma":[0.9100262,0.00049084565,0.08287829,0.00025019693,0.000069260386,0.00012689452,0.00083696406,0.00020252426,0.0051188916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989691,0.00029394808,0.0000937963,0.000277971,0.00022134303,0.00014384424],"domain_scores_gemma":[0.9959247,0.001974164,0.00071579067,0.00089354976,0.00030348112,0.00018833653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008332478,0.0004060059,0.0005869628,0.0012859771,0.00090593024,0.0020408584,0.0013381317,0.0013256201,0.0048049917],"category_scores_gemma":[0.0073815417,0.00034463577,0.00070576265,0.0015751491,0.0022949937,0.005005727,0.001862041,0.0009929825,0.0008340596],"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.0008365199,0.00017853,0.0052229776,0.0003060163,0.000060473467,0.0005156179,0.00087370153,0.09503827,0.026346372,0.6672122,0.0029825629,0.20042676],"study_design_scores_gemma":[0.00012644865,0.00021153413,0.0013335331,0.00006409064,0.00003521127,0.00043098017,0.00023526725,0.12241313,0.019164262,0.8479062,0.008013647,0.00006567775],"about_ca_topic_score_codex":0.00062671094,"about_ca_topic_score_gemma":0.00071382424,"teacher_disagreement_score":0.0048049917,"about_ca_system_score_codex":0.00091453956,"about_ca_system_score_gemma":0.0006902003,"threshold_uncertainty_score":0.0160743},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034021877,0.0032751847,0.93183255,0.0036688622,0.00068409,0.00013716368,0.0002873009,0.0014490923,0.024643922],"genre_scores_gemma":[0.32214,0.00942413,0.629141,0.0032304334,0.0011812473,0.00035825474,0.0015716333,0.0016005002,0.031352863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969837,0.0008428889,0.00021370171,0.0006913715,0.0008589983,0.00040924957],"domain_scores_gemma":[0.9943252,0.0038925742,0.00028370184,0.0007715434,0.0005513089,0.00017565188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002881999,0.0010878065,0.0014861921,0.0019113945,0.0023833592,0.003039651,0.0020763187,0.002303632,0.01198689],"category_scores_gemma":[0.016049925,0.0006181882,0.0017207348,0.00501953,0.005589408,0.012779253,0.0050746677,0.003919002,0.0028841167],"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.00019703491,0.00004933649,0.0004631003,0.0002572841,0.000020512602,0.00012383996,0.00031803627,0.037612636,0.0031223833,0.8282742,0.007769436,0.1217921],"study_design_scores_gemma":[0.00005906422,0.000042140102,0.00012294683,0.000047713937,0.0000143181,0.0001319008,0.00007467029,0.046787646,0.0023000345,0.9297373,0.020656709,0.000025560532],"about_ca_topic_score_codex":0.003100907,"about_ca_topic_score_gemma":0.0023303395,"teacher_disagreement_score":0.01198689,"about_ca_system_score_codex":0.0022550935,"about_ca_system_score_gemma":0.0017043297,"threshold_uncertainty_score":0.040100098},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31009936,0.0015313148,0.5495955,0.0049649295,0.0010451109,0.00010420639,0.00085445476,0.0010151523,0.13079001],"genre_scores_gemma":[0.90374327,0.0011918861,0.06941131,0.0019470976,0.0008381026,0.00021855625,0.0010914606,0.0007992492,0.02075903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989773,0.00023351646,0.00006072778,0.00032635464,0.00020247634,0.00019970616],"domain_scores_gemma":[0.9912846,0.0060457354,0.0006057014,0.0011418523,0.00046153177,0.00046047402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016305681,0.0008276216,0.001289908,0.0012411671,0.0019473324,0.0024748412,0.0019867234,0.0018717198,0.017403718],"category_scores_gemma":[0.01331182,0.0005494653,0.0010786632,0.0021241605,0.003261947,0.009247719,0.0038598033,0.0041814614,0.0021564746],"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.00016216234,0.000040398016,0.00040331014,0.00007755993,0.000012890339,0.00014591862,0.00014568807,0.0030237262,0.0011634384,0.97421604,0.003942909,0.016666044],"study_design_scores_gemma":[0.00003520727,0.000029625648,0.00011473665,0.000014194547,0.000007760691,0.00015564472,0.000030869174,0.0110014705,0.00048123207,0.9862446,0.0018741869,0.000010481434],"about_ca_topic_score_codex":0.0004517951,"about_ca_topic_score_gemma":0.00036424544,"teacher_disagreement_score":0.017403718,"about_ca_system_score_codex":0.00054358935,"about_ca_system_score_gemma":0.0006371788,"threshold_uncertainty_score":0.05822122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13019468,0.0004141186,0.85538864,0.0012517888,0.00018203251,0.00015008212,0.00031972388,0.0018279892,0.010271003],"genre_scores_gemma":[0.50366795,0.0004918116,0.48889372,0.0004686454,0.000120921846,0.00010701594,0.0011275687,0.00030600536,0.004816436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988275,0.00026875344,0.00010956024,0.00037458885,0.0002533987,0.00016625774],"domain_scores_gemma":[0.99703145,0.0014668553,0.0004161363,0.0007413474,0.000211259,0.0001330616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001373586,0.00063226913,0.00093371095,0.00076302316,0.0010029591,0.0019827697,0.0011859213,0.0013379176,0.008105384],"category_scores_gemma":[0.00547802,0.0005238585,0.0009966794,0.0012522718,0.001208937,0.0056892456,0.001501499,0.0015329155,0.0022646745],"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.00054416753,0.00023892998,0.004221832,0.00046747166,0.00014022827,0.00032447744,0.00022379003,0.10368334,0.03149708,0.39098278,0.011729139,0.45594677],"study_design_scores_gemma":[0.00013541715,0.00031202537,0.0008312785,0.000045360495,0.0000425396,0.0005742956,0.00028777024,0.17969625,0.016834363,0.7863017,0.014862326,0.0000766866],"about_ca_topic_score_codex":0.0005333933,"about_ca_topic_score_gemma":0.0011351461,"teacher_disagreement_score":0.008105384,"about_ca_system_score_codex":0.00056908367,"about_ca_system_score_gemma":0.0011111172,"threshold_uncertainty_score":0.027115226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59721464,0.00029711978,0.39128116,0.000678582,0.00003283513,0.00010284712,0.00090178987,0.0014308442,0.008060222],"genre_scores_gemma":[0.85565764,0.00014088502,0.14066775,0.00009569146,0.00001607489,0.000060434613,0.0016534475,0.00013019673,0.0015779044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992736,0.00014277625,0.000045384037,0.00027384254,0.000120867706,0.00014348017],"domain_scores_gemma":[0.9973455,0.0015722042,0.000313994,0.00043794894,0.00015525047,0.00017513288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070262025,0.0005242292,0.00061947136,0.0005204342,0.0007600181,0.0016274049,0.0013294189,0.001285895,0.003511777],"category_scores_gemma":[0.0046036313,0.0005302067,0.00072282297,0.0011679021,0.00096598273,0.0030380085,0.0015322143,0.00074530917,0.0003761549],"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.0005360581,0.000115973606,0.004183152,0.0003239092,0.00007167229,0.0004213278,0.00019642824,0.8409057,0.01208603,0.093508,0.0022928712,0.045358915],"study_design_scores_gemma":[0.000049502258,0.00007700761,0.00050267373,0.000014840738,0.000020503981,0.00023889595,0.00017332728,0.90722877,0.008526258,0.081140436,0.002010139,0.000017553848],"about_ca_topic_score_codex":0.0018127149,"about_ca_topic_score_gemma":0.0021369462,"teacher_disagreement_score":0.003511777,"about_ca_system_score_codex":0.0011833677,"about_ca_system_score_gemma":0.000889994,"threshold_uncertainty_score":0.0117480755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052891217,0.0009737351,0.9285538,0.0020770926,0.00019035993,0.00025938277,0.00076933013,0.0015512066,0.012733948],"genre_scores_gemma":[0.29582554,0.00063129544,0.69203156,0.00048776867,0.00024405828,0.00046245707,0.0019313237,0.00056212017,0.007823842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771655,0.000691413,0.00009474464,0.0005132567,0.0005245703,0.00045949343],"domain_scores_gemma":[0.99038434,0.0069827284,0.0005141954,0.0012328698,0.00049950543,0.00038630018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031415143,0.0019317745,0.0027066977,0.001709093,0.0014634827,0.0038204216,0.005300638,0.003166569,0.012828264],"category_scores_gemma":[0.012909476,0.0011787674,0.0017161294,0.0036256472,0.0022324454,0.00657764,0.0037910324,0.004439416,0.0016262572],"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.0011186429,0.00082876935,0.0012803379,0.00047559734,0.00014223222,0.00012126835,0.00029009106,0.6786722,0.00241862,0.10257067,0.025009328,0.18707219],"study_design_scores_gemma":[0.00013919614,0.000055675984,0.00019123744,0.000019211842,0.000030622654,0.000049019778,0.000088690074,0.91316247,0.0005756244,0.08443495,0.0012378072,0.000015566135],"about_ca_topic_score_codex":0.0068141217,"about_ca_topic_score_gemma":0.009485793,"teacher_disagreement_score":0.012828264,"about_ca_system_score_codex":0.003113337,"about_ca_system_score_gemma":0.0045514726,"threshold_uncertainty_score":0.042914808},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40340897,0.00513985,0.5847478,0.0006713266,0.000108077686,0.00008505903,0.0005990683,0.0008991588,0.004340609],"genre_scores_gemma":[0.8963793,0.0010695298,0.09901539,0.00010546758,0.000288059,0.00017926222,0.0011817437,0.0003235206,0.0014577246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947566,0.0021618193,0.0003219272,0.0012463632,0.0012677291,0.00024551337],"domain_scores_gemma":[0.93370193,0.05722046,0.0036324817,0.0024736763,0.0020721797,0.00089926226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009485547,0.00057578605,0.0015973435,0.0073618097,0.0010786302,0.003334225,0.0025313688,0.0016574559,0.0018960031],"category_scores_gemma":[0.05503546,0.0007196475,0.0008950589,0.0060044574,0.0041752774,0.006695632,0.00257436,0.0019969693,0.00042635255],"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.0016374661,0.00020477807,0.03690632,0.00074222777,0.0003923635,0.0003739325,0.001461239,0.26199386,0.02137997,0.40159523,0.0043150275,0.26899758],"study_design_scores_gemma":[0.00003578598,0.0002374127,0.008144095,0.00007214593,0.000060665076,0.00040071917,0.00019507881,0.59351975,0.006016452,0.38972592,0.0015226805,0.00006925553],"about_ca_topic_score_codex":0.00081619737,"about_ca_topic_score_gemma":0.0007038467,"teacher_disagreement_score":0.009485547,"about_ca_system_score_codex":0.0017324225,"about_ca_system_score_gemma":0.00064573664,"threshold_uncertainty_score":0.050164938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04353531,0.0007457457,0.8942462,0.0051387795,0.00016537747,0.00007357228,0.0001924096,0.0002725631,0.05563003],"genre_scores_gemma":[0.65793175,0.0015427548,0.30621827,0.00115559,0.0007178774,0.00045098498,0.00072673307,0.00032417497,0.030931883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839824,0.00058282545,0.000065237575,0.00032883178,0.00042534844,0.00019946255],"domain_scores_gemma":[0.9946827,0.0035255917,0.0003148365,0.0007146016,0.00040768954,0.00035457656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019573756,0.0006873731,0.00092977245,0.0019008766,0.0028178256,0.0045487,0.0041145007,0.0027437443,0.012588178],"category_scores_gemma":[0.009835134,0.00076099613,0.0015065445,0.0024223076,0.0052666473,0.009830037,0.003700684,0.0035527672,0.0011627217],"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.000008255944,0.000007999683,0.00010366403,0.000013934064,0.0000039670213,0.00001276208,0.00007284736,0.008666008,0.00007136775,0.98705286,0.0008973826,0.0030889849],"study_design_scores_gemma":[0.000008051697,0.000005130866,0.000040232382,0.000006418288,0.000003918537,0.000019240371,0.000036844423,0.030726517,0.000061802566,0.9671879,0.0019003691,0.0000034480497],"about_ca_topic_score_codex":0.0021718617,"about_ca_topic_score_gemma":0.0020415606,"teacher_disagreement_score":0.012588178,"about_ca_system_score_codex":0.002054907,"about_ca_system_score_gemma":0.0015376938,"threshold_uncertainty_score":0.042111635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7186205,0.0003277871,0.2770245,0.00017126394,0.000019281511,0.00004037046,0.0003586262,0.000478969,0.0029586237],"genre_scores_gemma":[0.8622728,0.00016929733,0.13348815,0.00005194734,0.000011707602,0.000037615264,0.0014836561,0.00010688136,0.002377954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972624,0.00005232984,0.000014342329,0.00012421388,0.00005510985,0.000027896474],"domain_scores_gemma":[0.99937123,0.00030167657,0.000079508296,0.00013409804,0.000061631734,0.000051924373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094728044,0.00021023037,0.00045744306,0.00077257503,0.0005279145,0.0009170889,0.000608918,0.00032862936,0.0019017345],"category_scores_gemma":[0.002761378,0.000277806,0.00056766946,0.00073435454,0.0004278779,0.0006897476,0.00082731294,0.00066893117,0.00030118437],"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.00091776095,0.00014387527,0.16742481,0.00043805665,0.00037540292,0.0011301708,0.0012156769,0.26763234,0.07777432,0.15188193,0.002205221,0.3288604],"study_design_scores_gemma":[0.00006138566,0.00020527697,0.054346345,0.000061564475,0.00014223366,0.0017630141,0.0006289084,0.78412306,0.032759864,0.11255995,0.013294244,0.00005420056],"about_ca_topic_score_codex":0.0011837386,"about_ca_topic_score_gemma":0.0030237727,"teacher_disagreement_score":0.0019017345,"about_ca_system_score_codex":0.00053542166,"about_ca_system_score_gemma":0.0005542651,"threshold_uncertainty_score":0.0063619614},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05714652,0.00018949123,0.935129,0.00013857988,0.00006908794,0.00009211017,0.0001835885,0.0032044048,0.0038472598],"genre_scores_gemma":[0.2303225,0.000106789135,0.76624274,0.00006491677,0.000029464107,0.00015376507,0.00059004046,0.0007868928,0.001702798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898,0.00021341343,0.00007192568,0.00019713042,0.00043824478,0.000099315104],"domain_scores_gemma":[0.9954165,0.0025233584,0.0003588957,0.0006065608,0.0008683786,0.00022635993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013525969,0.0010061269,0.0010799586,0.0017678197,0.0009191258,0.0014629903,0.0017767061,0.0013595594,0.008654865],"category_scores_gemma":[0.011873562,0.00064401544,0.00082268496,0.0018803602,0.0008029248,0.0021139383,0.0016830147,0.0010184229,0.0024226417],"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.0006492334,0.00021099766,0.007516416,0.0006170753,0.00013000255,0.00065873325,0.0005934816,0.51994956,0.032416064,0.09829675,0.011367396,0.3275943],"study_design_scores_gemma":[0.00006440138,0.00008202289,0.00051594496,0.000025510612,0.000020142175,0.00018103409,0.000049797913,0.9370759,0.009901301,0.048428115,0.00363355,0.000022321143],"about_ca_topic_score_codex":0.0015763524,"about_ca_topic_score_gemma":0.0020276613,"teacher_disagreement_score":0.008654865,"about_ca_system_score_codex":0.0011502681,"about_ca_system_score_gemma":0.0015940754,"threshold_uncertainty_score":0.028953373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005483755,0.98339385,0.007896449,0.0016990871,0.0012568954,0.00001305386,0.00007475559,0.0000709897,0.0050466782],"genre_scores_gemma":[0.0072818175,0.9804479,0.0056540696,0.00092285447,0.00083819317,0.000028368748,0.00014477009,0.000028779757,0.0046532685],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945647,0.00010419485,0.00006113627,0.0001773038,0.00016088625,0.000040040806],"domain_scores_gemma":[0.9989255,0.0006170603,0.00013822147,0.00006753937,0.00019892221,0.000052725725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001253236,0.0009618922,0.001414327,0.0019400415,0.00048318953,0.0023015977,0.0022367768,0.0022468497,0.0038338401],"category_scores_gemma":[0.0027862699,0.0005489471,0.00040467217,0.0021597443,0.0026751081,0.0050061215,0.0010213325,0.0022789075,0.0034611777],"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.00009893636,0.000017013928,0.00040267012,0.0054696347,0.00006478475,0.00021376595,0.00018187883,0.0012445828,0.0022281075,0.04862897,0.024673183,0.9167764],"study_design_scores_gemma":[0.000016601127,0.000042216278,0.0010705547,0.0021283934,0.000061476545,0.0017648281,0.00017110253,0.0004285789,0.0013426604,0.034250833,0.95867866,0.000043998367],"about_ca_topic_score_codex":0.001499208,"about_ca_topic_score_gemma":0.0019355936,"teacher_disagreement_score":0.0038338401,"about_ca_system_score_codex":0.0012273717,"about_ca_system_score_gemma":0.0011549686,"threshold_uncertainty_score":0.012825429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18995765,0.0006311771,0.7974959,0.0009434182,0.000056353118,0.00016784687,0.0015663591,0.0015523972,0.007628985],"genre_scores_gemma":[0.69490874,0.00042821997,0.29470038,0.00028180378,0.00007179704,0.00019876825,0.004676421,0.00032190155,0.0044119675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886584,0.00028623946,0.00007995704,0.00034831982,0.000334651,0.000085161],"domain_scores_gemma":[0.99233586,0.0054230737,0.0006555734,0.00074249075,0.00060153403,0.00024144305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015478845,0.00051805674,0.0007455262,0.0018808282,0.00063244934,0.0013168707,0.0016273941,0.00097226456,0.0047497707],"category_scores_gemma":[0.014152646,0.00035013538,0.0008449237,0.0012538227,0.0011353473,0.002365075,0.0013968326,0.0014058006,0.00070231996],"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.0004084943,0.00012078742,0.007507913,0.00041574964,0.000067639776,0.00035701648,0.00042000916,0.50579005,0.004643327,0.3123192,0.0041239117,0.16382588],"study_design_scores_gemma":[0.00003979311,0.00012124881,0.0012127571,0.000033782926,0.000017321998,0.00029259516,0.000108780376,0.6292209,0.0030758753,0.3615016,0.00434765,0.000027704664],"about_ca_topic_score_codex":0.0021534734,"about_ca_topic_score_gemma":0.0017188577,"teacher_disagreement_score":0.0047497707,"about_ca_system_score_codex":0.0014782477,"about_ca_system_score_gemma":0.0011315403,"threshold_uncertainty_score":0.015889585},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014667375,0.0011408255,0.98283017,0.00020613233,0.000019612482,0.00003005924,0.00024196033,0.0005872363,0.00027667754],"genre_scores_gemma":[0.10859359,0.0011740628,0.8879039,0.00011481827,0.000101557314,0.000102968195,0.0010348161,0.00020375864,0.0007704717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981865,0.0004006748,0.00018314636,0.00059506996,0.0005517087,0.000082893224],"domain_scores_gemma":[0.98880905,0.00930772,0.00058384,0.0007547429,0.0003799596,0.00016480313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028975783,0.000905227,0.0016459126,0.0034044192,0.0006074141,0.0020767702,0.0029445118,0.001498909,0.0016862876],"category_scores_gemma":[0.01417859,0.001304977,0.0019968867,0.0043229656,0.0012261507,0.0035140605,0.0022207852,0.0020543847,0.0007648881],"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.00031386185,0.00025771325,0.016480448,0.0010000188,0.0004325009,0.0004928326,0.00045991936,0.11904315,0.03158114,0.02365335,0.00503871,0.80124635],"study_design_scores_gemma":[0.000025515934,0.0000842472,0.003075751,0.000046870067,0.000095852396,0.0008445656,0.000088359724,0.8603823,0.005328682,0.12720084,0.0027747068,0.000052322754],"about_ca_topic_score_codex":0.001297282,"about_ca_topic_score_gemma":0.0027002643,"teacher_disagreement_score":0.0034044192,"about_ca_system_score_codex":0.00053823437,"about_ca_system_score_gemma":0.00071123877,"threshold_uncertainty_score":0.015324056},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039517535,0.00033351555,0.9933113,0.00038546932,0.000020570707,0.000056660992,0.00007573176,0.0002549369,0.0016100804],"genre_scores_gemma":[0.09437185,0.0011591429,0.90006256,0.00023124831,0.00009136697,0.00017358093,0.0005955194,0.00020231502,0.0031124938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985714,0.0005533349,0.000065801294,0.00039945095,0.00033063104,0.00007933745],"domain_scores_gemma":[0.99808073,0.0010658118,0.00012440138,0.0004057577,0.00022275084,0.00010050015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014006697,0.0008058835,0.0010198321,0.0029466166,0.0009776349,0.0021877976,0.0031978257,0.0017549829,0.0033029465],"category_scores_gemma":[0.0050147716,0.00048723276,0.001556814,0.003906608,0.0021267405,0.0056075817,0.0023484812,0.0020674171,0.0007582707],"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.00007318662,0.00007408492,0.0011565005,0.00039904576,0.000084159554,0.0002890915,0.00046290405,0.18399142,0.0036416303,0.6280483,0.0036153723,0.17816429],"study_design_scores_gemma":[0.000018294653,0.000034381374,0.00033069434,0.000037555128,0.00003621012,0.00035822034,0.0001299977,0.39882565,0.001425322,0.58433634,0.014438613,0.000028653905],"about_ca_topic_score_codex":0.0032949473,"about_ca_topic_score_gemma":0.0031368795,"teacher_disagreement_score":0.0033029465,"about_ca_system_score_codex":0.0016237629,"about_ca_system_score_gemma":0.001148261,"threshold_uncertainty_score":0.011781275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18115112,0.0006052313,0.8141348,0.0003740978,0.00003135564,0.00012982171,0.00025517316,0.00048507936,0.0028333608],"genre_scores_gemma":[0.8765454,0.0004623439,0.1197246,0.00012197511,0.000109556975,0.0003122548,0.0008242025,0.00017370682,0.0017259541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596184,0.0019198798,0.00021826994,0.0006114737,0.0010752723,0.00021326923],"domain_scores_gemma":[0.93411076,0.057736095,0.0031314609,0.0026950995,0.0016581366,0.0006683498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011438671,0.00035003174,0.00065021426,0.0038106348,0.00067138375,0.001960898,0.0024821255,0.0012605783,0.0028736577],"category_scores_gemma":[0.07450792,0.00040801475,0.0008975279,0.0025519258,0.0023708798,0.0029736385,0.0020034676,0.0012085364,0.000549564],"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.00037120326,0.00015183473,0.046258382,0.00024848455,0.000113367256,0.0018434415,0.0017491753,0.30054796,0.0036766513,0.5388729,0.0030816812,0.10308493],"study_design_scores_gemma":[0.000020518693,0.000037108093,0.005386295,0.000044332,0.000018882489,0.0015359441,0.00029049013,0.7141091,0.0017878299,0.27517098,0.0015416548,0.000056923633],"about_ca_topic_score_codex":0.0011109393,"about_ca_topic_score_gemma":0.00096183165,"teacher_disagreement_score":0.011438671,"about_ca_system_score_codex":0.0010993456,"about_ca_system_score_gemma":0.0005323627,"threshold_uncertainty_score":0.060494184},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018447483,0.0007575124,0.97257304,0.00036462318,0.000110805326,0.00013929258,0.00022234513,0.0028018833,0.0045829834],"genre_scores_gemma":[0.13393392,0.0003751345,0.8614751,0.00014398017,0.00009520719,0.0001705566,0.0007242115,0.00048622393,0.0025956412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986547,0.00036422646,0.000089320456,0.00032239174,0.00048261692,0.0000866786],"domain_scores_gemma":[0.9963554,0.0020199358,0.0002988882,0.0006935388,0.00045892567,0.00017331759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011471163,0.0009892649,0.001075533,0.0018070928,0.0008477544,0.001213626,0.0017172955,0.0016302251,0.010830717],"category_scores_gemma":[0.008444592,0.00060577306,0.00077217794,0.002963453,0.0014798957,0.0034254605,0.0018934329,0.0015386803,0.004336741],"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.00090456445,0.0002659057,0.0024882595,0.000899598,0.000082670835,0.00066259265,0.0004559658,0.16332577,0.035921335,0.23150165,0.022404114,0.54108757],"study_design_scores_gemma":[0.00015511546,0.00031706897,0.00049080886,0.00010196828,0.000033768094,0.0007924922,0.00008508831,0.6114537,0.024166444,0.34137094,0.020979464,0.000053111293],"about_ca_topic_score_codex":0.0006864952,"about_ca_topic_score_gemma":0.000713627,"teacher_disagreement_score":0.010830717,"about_ca_system_score_codex":0.0010526006,"about_ca_system_score_gemma":0.0008082291,"threshold_uncertainty_score":0.03623241},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036817454,0.00045410122,0.7344237,0.000424416,0.00026068508,0.00016982445,0.05305527,0.15853326,0.015861303],"genre_scores_gemma":[0.1397088,0.0005425074,0.6990315,0.0002213048,0.00009931942,0.00035865282,0.1238966,0.027990857,0.008150478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995209,0.000095972646,0.000027919594,0.00014049682,0.00015458692,0.000060274466],"domain_scores_gemma":[0.9990747,0.00038161717,0.00006119895,0.00022751096,0.0001755125,0.000079416735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013341988,0.0009833064,0.00080846174,0.0031818196,0.001136116,0.0019680846,0.0021198168,0.0007946169,0.03648748],"category_scores_gemma":[0.005272473,0.0010877257,0.0019596051,0.0020314443,0.00065375236,0.0021597163,0.0029819359,0.0017794297,0.009992307],"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.0013655855,0.00022022561,0.016800497,0.0024293936,0.00062097434,0.0013420455,0.0013347483,0.09654312,0.033356246,0.09764922,0.3432136,0.40512437],"study_design_scores_gemma":[0.00041817903,0.00014756067,0.008453042,0.00036285486,0.00018737392,0.001485589,0.0003904087,0.5122353,0.037387684,0.108795285,0.3299507,0.00018601898],"about_ca_topic_score_codex":0.0030654082,"about_ca_topic_score_gemma":0.004011122,"teacher_disagreement_score":0.03648748,"about_ca_system_score_codex":0.00059255096,"about_ca_system_score_gemma":0.001195851,"threshold_uncertainty_score":0.1220628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.725863,0.0004951274,0.2631662,0.00049535953,0.000022933005,0.00010159145,0.0014920728,0.001649041,0.0067147445],"genre_scores_gemma":[0.8522454,0.00011905533,0.14355926,0.00011627679,0.000017476907,0.00006944211,0.0020636239,0.00033176574,0.0014776656],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996567,0.000055445922,0.000015254218,0.00015258286,0.00008017908,0.000039829476],"domain_scores_gemma":[0.9982168,0.00068524654,0.0004571278,0.00033427795,0.00014566607,0.00016081777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005513198,0.00022468998,0.00023540366,0.0013769692,0.0010172955,0.0010607303,0.00068315037,0.00043800194,0.003841996],"category_scores_gemma":[0.0023841427,0.00021483877,0.0005478112,0.0017535992,0.0008438222,0.0011632527,0.00073721074,0.00051779236,0.0005438614],"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.0013825836,0.00033168338,0.20664425,0.0009138847,0.00036414352,0.0016117401,0.0034676322,0.071007445,0.31205377,0.18902749,0.010016879,0.20317852],"study_design_scores_gemma":[0.00013878896,0.00020967804,0.17744829,0.00020292994,0.0002632715,0.004730213,0.0018718056,0.40732762,0.0850425,0.26601076,0.056598745,0.00015536966],"about_ca_topic_score_codex":0.0029492993,"about_ca_topic_score_gemma":0.005861169,"teacher_disagreement_score":0.003841996,"about_ca_system_score_codex":0.00069236284,"about_ca_system_score_gemma":0.00048869516,"threshold_uncertainty_score":0.012852728},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67296934,0.00032431888,0.3225387,0.00017851843,0.00003945925,0.00008693268,0.00043210463,0.0010593255,0.0023712975],"genre_scores_gemma":[0.89850473,0.000051052924,0.09992329,0.000047432284,0.000008775363,0.000052646352,0.001031847,0.00007560886,0.000304634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584806,0.001612866,0.00028282864,0.0011041738,0.00095099764,0.00020104769],"domain_scores_gemma":[0.97284734,0.018915882,0.0018924283,0.0035148591,0.0024654134,0.00036393627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005511639,0.00044529288,0.0005065693,0.0017390472,0.00067222916,0.00092451024,0.0013292187,0.0009855194,0.0022389658],"category_scores_gemma":[0.041107025,0.00024382447,0.00046469513,0.0012658114,0.0014168331,0.0010188648,0.0010733717,0.00065709575,0.0005037347],"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.0025551438,0.0005262155,0.16553317,0.0012060043,0.0003603313,0.00057666615,0.0006830157,0.2968343,0.18753612,0.061546963,0.0015698242,0.2810723],"study_design_scores_gemma":[0.00012124624,0.00045229154,0.021249224,0.00004961256,0.00006145105,0.0007761273,0.00019228861,0.7325818,0.21270795,0.02962757,0.0021296847,0.000050735976],"about_ca_topic_score_codex":0.00083315646,"about_ca_topic_score_gemma":0.00068253605,"teacher_disagreement_score":0.005511639,"about_ca_system_score_codex":0.0007115626,"about_ca_system_score_gemma":0.000733698,"threshold_uncertainty_score":0.029148698},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01057189,0.0009318163,0.32333234,0.00037560807,0.00027892092,0.0003687048,0.09398909,0.559301,0.01085063],"genre_scores_gemma":[0.07042555,0.0009594668,0.49374127,0.00034974585,0.00019748922,0.0008901766,0.35873333,0.06229067,0.012412309],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919826,0.00015289239,0.00010129392,0.00018700834,0.00025438008,0.00010622003],"domain_scores_gemma":[0.9982728,0.0005399542,0.00018433837,0.0003788889,0.00040805663,0.00021597612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002455977,0.0014309543,0.0012872424,0.0030450483,0.0009034425,0.0017343179,0.0034785762,0.0012413994,0.057391223],"category_scores_gemma":[0.0071768686,0.001709342,0.0011318756,0.002642569,0.00039338687,0.0020173667,0.002258249,0.0024597615,0.045765538],"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.002028056,0.00023261746,0.0077202837,0.0018556027,0.00034413568,0.00093785126,0.00061235507,0.0075074118,0.020000558,0.01635679,0.6515255,0.29087883],"study_design_scores_gemma":[0.0012849849,0.00036230354,0.010455305,0.00057261286,0.00030025738,0.0029639455,0.00023720147,0.15694752,0.04492963,0.07191519,0.7095296,0.0005014393],"about_ca_topic_score_codex":0.0024575887,"about_ca_topic_score_gemma":0.0018298319,"teacher_disagreement_score":0.057391223,"about_ca_system_score_codex":0.00077881746,"about_ca_system_score_gemma":0.0017733664,"threshold_uncertainty_score":0.19199276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54751146,0.0021391325,0.44048175,0.0020989857,0.00013463928,0.0001349339,0.0018433934,0.002491508,0.0031641233],"genre_scores_gemma":[0.8110135,0.00051931565,0.1793771,0.00035584066,0.00009045187,0.00007028314,0.0056513585,0.00036490435,0.002557229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960333,0.000103657185,0.00001505429,0.00014067601,0.00010194624,0.000035287496],"domain_scores_gemma":[0.9984713,0.00083130377,0.00016602641,0.00021810464,0.00016627376,0.00014692945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010176455,0.00036691836,0.00037858574,0.0016628087,0.0007406157,0.00091957214,0.0007892904,0.00047723137,0.0014889423],"category_scores_gemma":[0.005081486,0.00021861131,0.00027321794,0.0016637848,0.0007844294,0.0007982517,0.0010697005,0.00059545814,0.00047326187],"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.0014261312,0.00030103407,0.09483663,0.0013269782,0.0004474193,0.00085405476,0.0028414272,0.1658921,0.14258271,0.074777775,0.040971503,0.47374225],"study_design_scores_gemma":[0.00014578867,0.00016377647,0.0795738,0.00014061871,0.00013555202,0.0008149602,0.0013263953,0.61880654,0.041758243,0.23207678,0.024958583,0.00009899122],"about_ca_topic_score_codex":0.0021811177,"about_ca_topic_score_gemma":0.0034285497,"teacher_disagreement_score":0.0021811177,"about_ca_system_score_codex":0.00047333472,"about_ca_system_score_gemma":0.00040997664,"threshold_uncertainty_score":0.005381882},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20727523,0.007977104,0.7656491,0.0017858,0.0002126389,0.000100440244,0.0009049796,0.0008530681,0.015241741],"genre_scores_gemma":[0.59428644,0.006532105,0.39110073,0.0005086692,0.0002024904,0.00015803671,0.0017505134,0.0008449388,0.0046161623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920887,0.00026960886,0.000042384072,0.00029597216,0.0001262015,0.000056978708],"domain_scores_gemma":[0.9987935,0.00064582366,0.0002220324,0.00018196637,0.000091026115,0.00006550696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016736973,0.00064478285,0.0013383159,0.002302188,0.00087602885,0.002317136,0.0017386418,0.0011399563,0.0026083481],"category_scores_gemma":[0.004551646,0.00084273063,0.0012488841,0.005496735,0.0012354503,0.00362435,0.001317877,0.0023425329,0.000914771],"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.001059974,0.00027831135,0.029993728,0.0011139967,0.0010619131,0.0012007729,0.0021545843,0.18123417,0.07566727,0.2162192,0.0057850988,0.48423102],"study_design_scores_gemma":[0.00014823349,0.00039277461,0.02577727,0.00017811223,0.00059186935,0.0015933767,0.0007862999,0.45251995,0.010864461,0.4848129,0.022188222,0.00014656366],"about_ca_topic_score_codex":0.0012821832,"about_ca_topic_score_gemma":0.001364744,"teacher_disagreement_score":0.0026083481,"about_ca_system_score_codex":0.0009734283,"about_ca_system_score_gemma":0.00063037203,"threshold_uncertainty_score":0.008851469},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021799585,0.0018265636,0.9593397,0.0018390426,0.00026952237,0.00004904118,0.00009394931,0.00030747207,0.014475086],"genre_scores_gemma":[0.49381006,0.0033750082,0.4922226,0.0012784171,0.001247253,0.00025734922,0.00030069822,0.00047035833,0.0070382548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943936,0.0016484556,0.00052094134,0.0013851918,0.0016208756,0.00043084775],"domain_scores_gemma":[0.97771126,0.016716603,0.0010336308,0.0025653448,0.0014723865,0.00050082896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058420873,0.00062506844,0.0014864774,0.0028765176,0.0023787166,0.005084956,0.0022869501,0.0019037358,0.0059887543],"category_scores_gemma":[0.030299373,0.0007765679,0.001903619,0.003491377,0.009510373,0.019218506,0.0055168164,0.004436852,0.0011588604],"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.00004978994,0.0000118210955,0.0003003992,0.00007520696,0.000008065777,0.00007109445,0.00028062655,0.0016014525,0.000587423,0.9656002,0.00069793244,0.030715875],"study_design_scores_gemma":[0.000013854711,0.000036052897,0.00018163692,0.000031551994,0.000010571678,0.00019221417,0.00011286753,0.0048240013,0.00069193303,0.9857091,0.008169621,0.000026520027],"about_ca_topic_score_codex":0.0009670229,"about_ca_topic_score_gemma":0.0005683513,"teacher_disagreement_score":0.0059887543,"about_ca_system_score_codex":0.0013133967,"about_ca_system_score_gemma":0.0012832223,"threshold_uncertainty_score":0.030896306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2610508,0.0017137341,0.70668733,0.0055894363,0.00025762644,0.00015848111,0.000839119,0.0019679659,0.021735517],"genre_scores_gemma":[0.67977333,0.0009920762,0.30502963,0.0009503437,0.00047292246,0.00030240274,0.002263524,0.0009134181,0.009302357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720997,0.0011217267,0.00012936817,0.00070121704,0.00046573984,0.00037198688],"domain_scores_gemma":[0.95618314,0.039268214,0.0010141981,0.0019590443,0.00085324177,0.00072208594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038859544,0.0018370942,0.00270085,0.0018521337,0.0019075687,0.0043707695,0.0059006936,0.004332919,0.011011249],"category_scores_gemma":[0.040039558,0.0010963195,0.002325687,0.0025603604,0.003882608,0.01002224,0.0040817126,0.0059195175,0.0011357156],"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.0010871767,0.00048307076,0.003473492,0.000671283,0.00018849413,0.00023567195,0.0007746795,0.6392479,0.0025116906,0.27464932,0.012322208,0.064354986],"study_design_scores_gemma":[0.000071944116,0.00004936458,0.00027088745,0.000038169426,0.00003516852,0.000101854945,0.00009796742,0.6882381,0.00053685845,0.30960774,0.0009353044,0.000016657725],"about_ca_topic_score_codex":0.006213332,"about_ca_topic_score_gemma":0.0065662493,"teacher_disagreement_score":0.011011249,"about_ca_system_score_codex":0.0030930617,"about_ca_system_score_gemma":0.0021639327,"threshold_uncertainty_score":0.036836267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9047986,0.0006022651,0.08029366,0.00031407268,0.000018314218,0.000035808258,0.0084886085,0.0024106328,0.003038044],"genre_scores_gemma":[0.80018324,0.00062480813,0.1683994,0.00013083406,0.000019638224,0.00007263425,0.029088592,0.00059963815,0.00088128453],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998652,0.000018970946,0.000007888425,0.00006302137,0.000027796455,0.00001720029],"domain_scores_gemma":[0.9996213,0.00014954786,0.00006264938,0.000055573386,0.00007140687,0.000039520604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034842017,0.0003655123,0.00030748206,0.0018158789,0.0004677198,0.00089117175,0.0005876597,0.000647059,0.0019198158],"category_scores_gemma":[0.0020742044,0.00045342097,0.0006569865,0.0014730596,0.0003355046,0.00062068045,0.00081125577,0.00061534956,0.0008852354],"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.00073671155,0.000166221,0.32632372,0.0011419285,0.000489672,0.0014233963,0.0019549557,0.21546146,0.31251386,0.013343864,0.0066647944,0.11977942],"study_design_scores_gemma":[0.000117333206,0.00028946262,0.35193133,0.00031397748,0.000522011,0.001982787,0.0012752973,0.52768993,0.053490955,0.033211395,0.029044563,0.00013086357],"about_ca_topic_score_codex":0.0054804618,"about_ca_topic_score_gemma":0.006064324,"teacher_disagreement_score":0.0054804618,"about_ca_system_score_codex":0.00044287086,"about_ca_system_score_gemma":0.0007901761,"threshold_uncertainty_score":0.01089716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23085354,0.0004451554,0.75800085,0.00070489047,0.00003076874,0.00014822898,0.0013482888,0.0016593016,0.0068090074],"genre_scores_gemma":[0.66925997,0.00040856077,0.319968,0.00026459896,0.000046224595,0.0001232315,0.004665072,0.00039999417,0.00486436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999468,0.00013325774,0.000025233705,0.00019868225,0.00009855127,0.000076207405],"domain_scores_gemma":[0.99786264,0.0013414568,0.00024643197,0.00031313836,0.0001375348,0.0000987857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058900024,0.0005062852,0.00060909335,0.00069206406,0.00057483005,0.0010201081,0.0010178811,0.0007460642,0.007759527],"category_scores_gemma":[0.0042327773,0.0005889629,0.0012795421,0.0007055982,0.000822968,0.0018764071,0.001590277,0.001539213,0.0011814298],"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.00074053614,0.00027780578,0.0073841936,0.0010151819,0.00015838341,0.00085651723,0.0010485555,0.6641191,0.040173486,0.12487734,0.00849467,0.15085422],"study_design_scores_gemma":[0.000070496986,0.0002047753,0.0021269738,0.000101731384,0.00006165862,0.0005399058,0.0003809839,0.7879854,0.025698192,0.17295772,0.0098249735,0.000047245736],"about_ca_topic_score_codex":0.0023626855,"about_ca_topic_score_gemma":0.0022499303,"teacher_disagreement_score":0.007759527,"about_ca_system_score_codex":0.0009708154,"about_ca_system_score_gemma":0.00066359644,"threshold_uncertainty_score":0.02595824},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009728422,0.00011189978,0.9850348,0.00010772797,0.000021148178,0.00017850593,0.00021895295,0.003838997,0.0007594439],"genre_scores_gemma":[0.060017265,0.00011489997,0.9364727,0.00013855063,0.000020831498,0.00030756806,0.0013254617,0.00047383519,0.0011289025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980019,0.00060241064,0.000111210116,0.00040736003,0.00077749544,0.00009967661],"domain_scores_gemma":[0.9977717,0.0009365337,0.00019760079,0.00037359577,0.0006125805,0.00010798899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028958349,0.001224778,0.0011554406,0.0014357325,0.00063049304,0.0010517972,0.0016029625,0.0011796952,0.005971606],"category_scores_gemma":[0.006867078,0.0005836964,0.00087901304,0.0014982739,0.0006856887,0.0012318605,0.0012058354,0.0015953918,0.0043101055],"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.0008947078,0.00042633957,0.002104715,0.0005679196,0.00017088829,0.0005226497,0.0001997817,0.052721832,0.4517286,0.0153781595,0.010516959,0.46476746],"study_design_scores_gemma":[0.00028287375,0.0011312484,0.0022223608,0.000057345147,0.00013482712,0.0019939626,0.00014461142,0.7484335,0.19811802,0.026704926,0.020638196,0.00013816931],"about_ca_topic_score_codex":0.00071846036,"about_ca_topic_score_gemma":0.0009895831,"teacher_disagreement_score":0.005971606,"about_ca_system_score_codex":0.00053189916,"about_ca_system_score_gemma":0.0009917425,"threshold_uncertainty_score":0.019977033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95337474,0.0008222683,0.036216952,0.00007205431,0.000015921292,0.00013995095,0.0057234154,0.0018141639,0.0018205661],"genre_scores_gemma":[0.8606829,0.00037968854,0.113936454,0.00005632568,0.000006614529,0.00023652676,0.02323633,0.00053831574,0.0009267696],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936086,0.00008980965,0.000065188346,0.00028200107,0.00013259973,0.00006955184],"domain_scores_gemma":[0.99888843,0.00039235986,0.00030969165,0.00017179857,0.0001091075,0.0001286827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072227005,0.00074298563,0.0006621274,0.0025596726,0.00075147743,0.00078062405,0.0005158861,0.0003080469,0.0020443012],"category_scores_gemma":[0.001892507,0.00038889528,0.00081963016,0.0019961237,0.00034730576,0.0005162135,0.0014272899,0.000461387,0.00057887635],"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.004889237,0.00015838664,0.07190817,0.0014382242,0.0004194454,0.0006330529,0.0014645277,0.006109175,0.8587011,0.0012476676,0.0015844202,0.051446594],"study_design_scores_gemma":[0.00040489092,0.0011050222,0.3824558,0.00033596033,0.0010567696,0.0027202514,0.0016687779,0.08634961,0.47878668,0.0037925977,0.041023575,0.00030004035],"about_ca_topic_score_codex":0.0026193634,"about_ca_topic_score_gemma":0.0045833895,"teacher_disagreement_score":0.0026193634,"about_ca_system_score_codex":0.00062015245,"about_ca_system_score_gemma":0.0009119053,"threshold_uncertainty_score":0.006838858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016813979,0.00052387326,0.97951275,0.00038023732,0.000040936964,0.000037298527,0.00033813782,0.0005370465,0.0018157044],"genre_scores_gemma":[0.23173308,0.0007497746,0.76382846,0.00015527535,0.00016505002,0.0001599009,0.0012470225,0.0002835426,0.0016778458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853134,0.0004682345,0.000114778086,0.00033746357,0.00047456697,0.00007358803],"domain_scores_gemma":[0.9892484,0.0076123807,0.0009012698,0.0007398419,0.0011545961,0.0003433778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023484319,0.00064795377,0.00061299,0.003895644,0.0008934652,0.0018600471,0.0015234003,0.0012122246,0.0027341973],"category_scores_gemma":[0.02084346,0.00034995383,0.0007375583,0.0045451517,0.00159407,0.0035751623,0.0028260788,0.0019215387,0.00083513284],"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.00025067243,0.00012134966,0.007961324,0.00060892734,0.00012178226,0.0003974965,0.00050615496,0.3486495,0.009097769,0.3029218,0.005748019,0.3236152],"study_design_scores_gemma":[0.000029885381,0.00010100302,0.0024745709,0.00007038544,0.000026557549,0.0005368614,0.00008712811,0.6953413,0.00508429,0.28732187,0.008865397,0.000060692822],"about_ca_topic_score_codex":0.001218242,"about_ca_topic_score_gemma":0.001192133,"teacher_disagreement_score":0.003895644,"about_ca_system_score_codex":0.0014716135,"about_ca_system_score_gemma":0.0014804066,"threshold_uncertainty_score":0.012419879},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004198667,0.0069943722,0.92143124,0.022857968,0.006719565,0.00024752712,0.0008347566,0.0054479963,0.03126778],"genre_scores_gemma":[0.12675908,0.008774746,0.74889016,0.010158974,0.016094593,0.0010059639,0.0051317094,0.00484478,0.07834008],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758995,0.0008555706,0.000109193286,0.00053141377,0.0006736008,0.00024032389],"domain_scores_gemma":[0.988794,0.008024625,0.00017897916,0.0010075218,0.001516648,0.00047827873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041915304,0.0025501386,0.0017883392,0.0016306823,0.0020525712,0.0033835857,0.0029485028,0.0035947775,0.03303902],"category_scores_gemma":[0.01850772,0.0009469209,0.0014261411,0.002771962,0.0019713382,0.0063073584,0.002956494,0.0058580246,0.020562476],"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.0006113628,0.00023386287,0.0006074393,0.000729076,0.00017475926,0.00017171989,0.00017643563,0.04397933,0.0027689142,0.13105755,0.42943618,0.3900534],"study_design_scores_gemma":[0.00033480578,0.00015050736,0.0005578322,0.00017227423,0.0000680061,0.00029692004,0.00009225335,0.26114327,0.0032696845,0.5043992,0.2293897,0.00012551519],"about_ca_topic_score_codex":0.0014187287,"about_ca_topic_score_gemma":0.0017512661,"teacher_disagreement_score":0.03303902,"about_ca_system_score_codex":0.0017319178,"about_ca_system_score_gemma":0.0015189442,"threshold_uncertainty_score":0.1105265},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013868901,0.0008828208,0.84301364,0.00060515996,0.00023861487,0.00027503248,0.0027233125,0.13461937,0.0037731477],"genre_scores_gemma":[0.049776576,0.00048304017,0.92336,0.00058328424,0.00014264949,0.00041134408,0.007873977,0.010428361,0.0069408193],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968233,0.00044315564,0.00028114155,0.0010749275,0.0011805026,0.00019697892],"domain_scores_gemma":[0.9952891,0.0019940701,0.0004999339,0.0013654841,0.0005805859,0.00027086408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025891943,0.0018042019,0.0018030462,0.0024759066,0.00072605285,0.0022850828,0.004231278,0.0018649447,0.024220955],"category_scores_gemma":[0.008742313,0.0014584346,0.0011508913,0.0035315445,0.00074487284,0.0065333447,0.0028748726,0.0025251496,0.013868891],"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.0019022463,0.0003199568,0.0030606522,0.0010887478,0.00025255355,0.00073802174,0.00028983242,0.0073050223,0.14363696,0.012978177,0.10388612,0.7245418],"study_design_scores_gemma":[0.0010766997,0.0005488943,0.0043755076,0.00020372699,0.00022828017,0.0037689193,0.0001401783,0.37958035,0.3611255,0.044925768,0.20365265,0.0003735303],"about_ca_topic_score_codex":0.0014486891,"about_ca_topic_score_gemma":0.0012399931,"teacher_disagreement_score":0.024220955,"about_ca_system_score_codex":0.0006994978,"about_ca_system_score_gemma":0.00085813866,"threshold_uncertainty_score":0.08102715},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8952181,0.0028165118,0.076170005,0.00026538954,0.000095121846,0.00035389996,0.016767813,0.005530246,0.0027830189],"genre_scores_gemma":[0.8021508,0.0004432451,0.14911555,0.0001333867,0.000057296893,0.0003201273,0.04691589,0.00027305976,0.0005906391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970708,0.0006620733,0.00023730897,0.001094773,0.00073895336,0.00019597894],"domain_scores_gemma":[0.9932696,0.0042043496,0.00040868268,0.0004237937,0.0014313279,0.00026212775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004061918,0.0016476514,0.0012853489,0.008217617,0.00086465024,0.0013701753,0.001652753,0.0012373903,0.0013707052],"category_scores_gemma":[0.008389838,0.00028847577,0.0015491231,0.0046664295,0.0006320661,0.0011411248,0.0011065356,0.00095643423,0.00071491656],"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.0039170156,0.0013810983,0.2529938,0.0030071232,0.0029688992,0.0009948784,0.0005008436,0.24180464,0.117192365,0.0029927497,0.012655223,0.3595913],"study_design_scores_gemma":[0.00010923546,0.0012184103,0.06775353,0.00010370155,0.00039922615,0.0007512395,0.0004301939,0.8779494,0.043907892,0.0021292255,0.0051624896,0.0000853983],"about_ca_topic_score_codex":0.008481373,"about_ca_topic_score_gemma":0.008542989,"teacher_disagreement_score":0.008481373,"about_ca_system_score_codex":0.0014999092,"about_ca_system_score_gemma":0.001364026,"threshold_uncertainty_score":0.021481752},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10595517,0.0014203032,0.85305744,0.00087187276,0.00023906931,0.00025197683,0.0037489322,0.024115192,0.010339995],"genre_scores_gemma":[0.13230567,0.0002978556,0.8590088,0.00022279608,0.00008053609,0.00032364955,0.004065426,0.0010086126,0.002686661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949825,0.000112047084,0.000040835945,0.00014551406,0.00014137318,0.00006184306],"domain_scores_gemma":[0.99872607,0.0007467474,0.000095830605,0.00020392124,0.00015724648,0.00007012153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000967714,0.0012462877,0.0009506467,0.001503265,0.0008022017,0.0011944369,0.002388109,0.0011919399,0.009440734],"category_scores_gemma":[0.0056436104,0.00062531687,0.000903337,0.0019313368,0.0007248738,0.0024922902,0.0018725708,0.001033653,0.0026307856],"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.0020551884,0.00044035897,0.0075942553,0.001791934,0.00039582126,0.00072421046,0.0005608489,0.21979387,0.04734785,0.04067432,0.08116866,0.5974527],"study_design_scores_gemma":[0.00038488724,0.00023899037,0.001940986,0.000116182375,0.00007519032,0.000531343,0.00024975135,0.8682296,0.043912265,0.060080294,0.024178399,0.00006201454],"about_ca_topic_score_codex":0.0016571885,"about_ca_topic_score_gemma":0.0026738462,"teacher_disagreement_score":0.009440734,"about_ca_system_score_codex":0.0006938914,"about_ca_system_score_gemma":0.0012252693,"threshold_uncertainty_score":0.031582355},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007748647,0.0003369909,0.9888713,0.00026202737,0.000022947504,0.00007337811,0.00015801165,0.0009014406,0.001625281],"genre_scores_gemma":[0.09128582,0.0003355918,0.9050992,0.00017164397,0.000053434822,0.0002933533,0.0008847924,0.0002372924,0.0016389601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986992,0.00047923016,0.00008372525,0.00027070876,0.00033497193,0.00013219172],"domain_scores_gemma":[0.99084693,0.006675729,0.00048106522,0.0010264642,0.0007571218,0.0002126512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034223448,0.0011406449,0.0012060824,0.002033811,0.0013798481,0.0016831052,0.004167564,0.0020738798,0.006487633],"category_scores_gemma":[0.014184856,0.00087193376,0.0015110939,0.0024926967,0.0014223651,0.0036243466,0.0025701944,0.0024919764,0.0017327286],"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.00024306554,0.0001759189,0.005311549,0.00036522263,0.00014265218,0.00020220355,0.00041689433,0.56996405,0.0016881813,0.110382035,0.011214378,0.29989377],"study_design_scores_gemma":[0.000030052744,0.000018771654,0.00026340934,0.00002718998,0.000015633053,0.00010757734,0.000048955088,0.9099054,0.00056882884,0.08758961,0.0014126434,0.000011825819],"about_ca_topic_score_codex":0.005080748,"about_ca_topic_score_gemma":0.004970049,"teacher_disagreement_score":0.006487633,"about_ca_system_score_codex":0.0015957534,"about_ca_system_score_gemma":0.0021098978,"threshold_uncertainty_score":0.021703303},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055128377,0.000050260984,0.99918944,0.000042052292,0.0000056775148,0.000012672531,0.000018379067,0.00006187668,0.00006839288],"genre_scores_gemma":[0.010799817,0.00014809272,0.9884956,0.00003352817,0.000020306557,0.00014746781,0.00014114538,0.00008503357,0.00012897624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99388194,0.0030895646,0.0005352591,0.0010152987,0.0013024751,0.00017540822],"domain_scores_gemma":[0.9874795,0.00861455,0.00070503925,0.0018940861,0.001016575,0.00029022247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011859366,0.0012133792,0.0013151823,0.0040972335,0.0015197672,0.0031197385,0.0043613613,0.0021984326,0.0020644355],"category_scores_gemma":[0.03133779,0.0014291083,0.0031611759,0.0036846288,0.004807872,0.0023561765,0.0042786556,0.0034286054,0.0008637629],"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.00008331837,0.00008106559,0.0015522081,0.00054252223,0.00020642953,0.00029384647,0.00047082495,0.30387816,0.012685183,0.5876483,0.0012338896,0.09132425],"study_design_scores_gemma":[0.00007214796,0.000099831734,0.0006149373,0.00012748147,0.000057815167,0.0003441665,0.000110070425,0.6182772,0.005710801,0.36111626,0.013391498,0.0000777833],"about_ca_topic_score_codex":0.0031171313,"about_ca_topic_score_gemma":0.0025497384,"teacher_disagreement_score":0.011859366,"about_ca_system_score_codex":0.0017966639,"about_ca_system_score_gemma":0.0034753873,"threshold_uncertainty_score":0.06271911},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08643736,0.0015029652,0.816574,0.0004477958,0.0002569602,0.0003323432,0.03305573,0.058060355,0.0033325222],"genre_scores_gemma":[0.18480724,0.00056878396,0.7505233,0.00019167512,0.00009156083,0.0007606639,0.05359188,0.008444301,0.0010205207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986292,0.00037317147,0.0000907622,0.0004923332,0.0003115448,0.000103041435],"domain_scores_gemma":[0.9949944,0.0030870435,0.00060836144,0.00062226475,0.00045038914,0.0002375567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025843226,0.001583903,0.0016730728,0.005166555,0.0016868309,0.0020377599,0.00227332,0.001406937,0.008045002],"category_scores_gemma":[0.010372395,0.0012810242,0.002359305,0.004428586,0.0008179379,0.002168963,0.0021434492,0.0028220653,0.0030787617],"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.0049526785,0.00061434525,0.06737282,0.009188286,0.0047991974,0.0019697594,0.0027614352,0.12663944,0.16998778,0.05253372,0.14425907,0.41492146],"study_design_scores_gemma":[0.00070412835,0.0004916958,0.041516684,0.000625024,0.0007615883,0.0028326164,0.00048177651,0.70361465,0.051783696,0.07054643,0.12625067,0.0003910709],"about_ca_topic_score_codex":0.0019301396,"about_ca_topic_score_gemma":0.0023283926,"teacher_disagreement_score":0.008045002,"about_ca_system_score_codex":0.0009488599,"about_ca_system_score_gemma":0.001875134,"threshold_uncertainty_score":0.026913166},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022279605,0.00030731133,0.9642116,0.00012466773,0.000033643486,0.00021767043,0.00052315264,0.011220331,0.001082084],"genre_scores_gemma":[0.099484645,0.00027512075,0.89437985,0.00013274618,0.000023676923,0.0002645084,0.002799868,0.0011001673,0.0015394026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884206,0.00027017097,0.00007412604,0.00043108774,0.00029580484,0.00008675589],"domain_scores_gemma":[0.99720097,0.0012874332,0.00047601468,0.00045497293,0.00049544696,0.00008518219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015970005,0.0023227457,0.0010191158,0.0021811053,0.0009747374,0.0014875578,0.0015329557,0.001122784,0.002697368],"category_scores_gemma":[0.0053905547,0.00079899945,0.0011908045,0.0018084412,0.0009048019,0.0017368022,0.0014250034,0.0013253178,0.0015182246],"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.0006576119,0.00027629192,0.019677859,0.0008840068,0.00036554175,0.000468098,0.00045604605,0.22771935,0.07156665,0.010725784,0.014163904,0.65303886],"study_design_scores_gemma":[0.000083989435,0.00029831927,0.0059443717,0.000069330454,0.00012729672,0.0005725258,0.00015456922,0.91406316,0.0510115,0.016759608,0.010849918,0.00006531466],"about_ca_topic_score_codex":0.0043203454,"about_ca_topic_score_gemma":0.0045482377,"teacher_disagreement_score":0.0043203454,"about_ca_system_score_codex":0.0009644153,"about_ca_system_score_gemma":0.0015699144,"threshold_uncertainty_score":0.009023607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59252745,0.00055037317,0.39471927,0.0003123238,0.000053466352,0.000078661906,0.0023613544,0.0020166535,0.0073804436],"genre_scores_gemma":[0.744683,0.0006469328,0.23740923,0.00012982596,0.000020434378,0.000097337674,0.0115221,0.00080938655,0.0046816734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937856,0.00021239341,0.00002845459,0.00019565031,0.00012364978,0.000061190825],"domain_scores_gemma":[0.9987847,0.0005021278,0.00015043002,0.00024607134,0.00026769776,0.00004910845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009757534,0.00036675629,0.00046535942,0.0018167581,0.0007652945,0.0013418333,0.0007948777,0.000556708,0.003243798],"category_scores_gemma":[0.0067706006,0.0005300215,0.00085093576,0.0024701403,0.0005261625,0.0012242001,0.00091186236,0.0007060869,0.0009083603],"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.0009450608,0.0001079074,0.07858127,0.000452624,0.0002354625,0.00080427283,0.0018827158,0.6010411,0.060044233,0.08544996,0.004893787,0.16556163],"study_design_scores_gemma":[0.000044914057,0.00025641525,0.04036412,0.00009339992,0.00007344928,0.00088946254,0.00066874,0.84040666,0.0091021005,0.08348317,0.024547804,0.00006975126],"about_ca_topic_score_codex":0.0056078555,"about_ca_topic_score_gemma":0.0064474335,"teacher_disagreement_score":0.0056078555,"about_ca_system_score_codex":0.0010319055,"about_ca_system_score_gemma":0.00072994246,"threshold_uncertainty_score":0.01115042},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03732811,0.0016230582,0.94183046,0.0027849108,0.00031660433,0.00054101914,0.0009018904,0.002863908,0.011810022],"genre_scores_gemma":[0.25088438,0.00067283167,0.73384887,0.0009546301,0.00032675648,0.0009772358,0.0022854414,0.0005464676,0.009503399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977785,0.00052376156,0.00013639586,0.00056527124,0.00045360607,0.0005423515],"domain_scores_gemma":[0.99442434,0.003956167,0.0003501226,0.0006229084,0.0003414559,0.00030494714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028032067,0.002426494,0.003133106,0.0012941775,0.001320833,0.0030432974,0.005551333,0.003913569,0.011689318],"category_scores_gemma":[0.009964821,0.0009139294,0.0020553675,0.0029039173,0.0013238909,0.005970573,0.003393931,0.0041846912,0.0026746402],"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.0011897673,0.00076679763,0.0019207054,0.0006111334,0.00017045255,0.0002453943,0.00035027435,0.65486723,0.0020841814,0.045523763,0.036159147,0.2561112],"study_design_scores_gemma":[0.00025102822,0.00010832976,0.00017822412,0.000025177156,0.000029628254,0.00011045953,0.00007026774,0.9603503,0.00031857446,0.036635477,0.0019057814,0.00001674386],"about_ca_topic_score_codex":0.009156076,"about_ca_topic_score_gemma":0.013841183,"teacher_disagreement_score":0.011689318,"about_ca_system_score_codex":0.0037466502,"about_ca_system_score_gemma":0.0044167656,"threshold_uncertainty_score":0.03910464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9826836,0.00066454883,0.012361138,0.00003876621,0.0000048368947,0.000019168716,0.0032418303,0.00026295063,0.00072308595],"genre_scores_gemma":[0.94650704,0.0004472775,0.039417926,0.000024319714,0.000007333786,0.00002531181,0.013218788,0.00008385218,0.0002681837],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998267,0.000030741703,0.000014910909,0.00008279767,0.000026195154,0.000018691147],"domain_scores_gemma":[0.9994516,0.00026163572,0.00011642457,0.00007956338,0.00004627001,0.000044547327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045142553,0.0004007656,0.00029363896,0.0023866347,0.0004705027,0.0005863774,0.00040678537,0.00037318072,0.0012959711],"category_scores_gemma":[0.0015769708,0.00020566866,0.00061129336,0.0013947715,0.00021517539,0.0004923818,0.00043388805,0.00045142442,0.0004896536],"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.0014432601,0.00016266666,0.53223425,0.001604844,0.000633139,0.0011219741,0.0017698106,0.05847232,0.2896627,0.004817207,0.0014796377,0.10659825],"study_design_scores_gemma":[0.00010407413,0.0004306629,0.7086554,0.00028481957,0.00097334554,0.0018368424,0.001348296,0.21772793,0.040916704,0.0108905835,0.016759152,0.00007227591],"about_ca_topic_score_codex":0.0026404862,"about_ca_topic_score_gemma":0.004740138,"teacher_disagreement_score":0.0026404862,"about_ca_system_score_codex":0.0005029198,"about_ca_system_score_gemma":0.00045184657,"threshold_uncertainty_score":0.0052502155},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08455418,0.00044521134,0.8989801,0.000491676,0.00036827815,0.00020939577,0.0012559316,0.011464043,0.0022312214],"genre_scores_gemma":[0.19921002,0.00011225486,0.7930656,0.00016394346,0.000074197706,0.00015272616,0.0025565638,0.002745051,0.0019196313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715495,0.0007647314,0.00018753154,0.001069155,0.0006114433,0.00021211272],"domain_scores_gemma":[0.98933977,0.0043355487,0.0009922938,0.0032181796,0.00183458,0.00027962655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046499074,0.00094811525,0.00093445985,0.0023294352,0.0012154261,0.0014330606,0.002185363,0.0013341734,0.01107523],"category_scores_gemma":[0.029999394,0.00065233704,0.0013832129,0.0022843818,0.0012472698,0.001821777,0.002327398,0.0023109491,0.0035939936],"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.0025942083,0.00024706646,0.03350505,0.0015240853,0.00048640597,0.0015156568,0.0014569771,0.041600473,0.17299153,0.05543047,0.02530464,0.6633433],"study_design_scores_gemma":[0.00029343963,0.00041432635,0.014788318,0.00020438543,0.00032796036,0.0027172877,0.00050179724,0.6632224,0.14359553,0.10898838,0.064808406,0.00013767811],"about_ca_topic_score_codex":0.0010055911,"about_ca_topic_score_gemma":0.0018701437,"teacher_disagreement_score":0.01107523,"about_ca_system_score_codex":0.0008343231,"about_ca_system_score_gemma":0.0016301785,"threshold_uncertainty_score":0.037050307},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4683323,0.0006594742,0.5170454,0.0019315671,0.00010166521,0.00020278133,0.0013476553,0.000837242,0.009541838],"genre_scores_gemma":[0.93730366,0.00041589912,0.040679183,0.00046845022,0.000055130244,0.00042440605,0.00096984266,0.00024025376,0.019443296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993093,0.00021016641,0.000032898326,0.00022198609,0.00009859248,0.00012699029],"domain_scores_gemma":[0.9951485,0.0032311557,0.0006946072,0.00037431496,0.00030583638,0.0002456169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027943288,0.0006444698,0.0011357995,0.0011653274,0.0006819132,0.0013935508,0.0034064678,0.003154342,0.0070797293],"category_scores_gemma":[0.011186304,0.00059251115,0.001565947,0.0012347614,0.0016484382,0.0020655517,0.001186327,0.0014302289,0.001099408],"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.0001728481,0.000060089584,0.004417078,0.00009169883,0.000058114314,0.00033691307,0.00027607882,0.8994848,0.003996394,0.08467269,0.0012897092,0.0051435344],"study_design_scores_gemma":[0.000070795744,0.00004798574,0.0009908709,0.000013171812,0.000027512906,0.00012244523,0.00003197201,0.9688111,0.00057256303,0.02850564,0.00077826437,0.0000276567],"about_ca_topic_score_codex":0.011013233,"about_ca_topic_score_gemma":0.0052280705,"teacher_disagreement_score":0.011013233,"about_ca_system_score_codex":0.0021976116,"about_ca_system_score_gemma":0.0008263107,"threshold_uncertainty_score":0.023684025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046846088,0.0002900934,0.94793195,0.00017294537,0.00004226237,0.00019323335,0.00016411203,0.0037474646,0.0006119849],"genre_scores_gemma":[0.11714923,0.00009639037,0.8799098,0.00013020329,0.00002980188,0.0002933765,0.0010762917,0.00036367617,0.00095122773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992206,0.00015184331,0.000106545136,0.00024733535,0.00017634388,0.000097432785],"domain_scores_gemma":[0.995752,0.0020295337,0.00046656665,0.00072003907,0.00083641894,0.00019546827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020051387,0.0008116288,0.0009589978,0.0015429307,0.00075512996,0.0012622715,0.0023010669,0.0012810627,0.0035437343],"category_scores_gemma":[0.0069608125,0.00055143854,0.0009467906,0.0020996241,0.0007143466,0.0018957683,0.0020335964,0.001278646,0.0012572112],"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.000707857,0.00023139635,0.008157827,0.00021040706,0.00015766111,0.00014930656,0.0004291301,0.14071466,0.025832446,0.009997276,0.0055131516,0.8078989],"study_design_scores_gemma":[0.00012721728,0.00010654764,0.0013888946,0.000019475901,0.000040478193,0.00013470426,0.000067897956,0.976253,0.009634549,0.007957624,0.004251272,0.00001839761],"about_ca_topic_score_codex":0.004302104,"about_ca_topic_score_gemma":0.004195051,"teacher_disagreement_score":0.004302104,"about_ca_system_score_codex":0.0010697442,"about_ca_system_score_gemma":0.0022191668,"threshold_uncertainty_score":0.011854947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43928915,0.0008898785,0.55441624,0.00039403455,0.000044373388,0.0000970744,0.00015284274,0.0008665591,0.0038498205],"genre_scores_gemma":[0.868574,0.00030975847,0.12879683,0.00017672464,0.00002379123,0.000063954285,0.00028891835,0.00021391617,0.0015520661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994553,0.00010304862,0.000032986827,0.0002212215,0.00012663851,0.00006080651],"domain_scores_gemma":[0.99647456,0.0020446521,0.0006263584,0.0004311534,0.0002555189,0.00016774799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012606075,0.00037916887,0.0004222198,0.00064976973,0.00048699038,0.0008663206,0.0007126887,0.0005221979,0.0025781302],"category_scores_gemma":[0.006871547,0.00024136416,0.00043345278,0.0008543159,0.001203255,0.0012984588,0.0011588543,0.00078174815,0.00034215493],"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.0009633574,0.00012510404,0.07159021,0.00065925537,0.00011932286,0.00048610766,0.0010303695,0.2193747,0.23786938,0.105002046,0.0023457098,0.36043438],"study_design_scores_gemma":[0.00010718375,0.00035822732,0.033187106,0.00006859394,0.000090399306,0.0011302446,0.00032866205,0.67253625,0.17249417,0.10834675,0.011279929,0.000072500916],"about_ca_topic_score_codex":0.002677566,"about_ca_topic_score_gemma":0.0026490316,"teacher_disagreement_score":0.002677566,"about_ca_system_score_codex":0.0007126056,"about_ca_system_score_gemma":0.0006925169,"threshold_uncertainty_score":0.0086247325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21862136,0.00084437296,0.7161548,0.0018592962,0.00020449092,0.00015012096,0.00083253207,0.0016719693,0.059661012],"genre_scores_gemma":[0.84277624,0.00039955846,0.14833456,0.00043280053,0.00015304894,0.00052181893,0.00062731514,0.00066126446,0.006093437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989242,0.0004419674,0.000052722895,0.00026900205,0.00019831353,0.00011373394],"domain_scores_gemma":[0.9891649,0.00785762,0.00054660166,0.0013427703,0.0005452636,0.0005428739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021215442,0.000615383,0.0007935756,0.0021942984,0.0011694445,0.0017929452,0.0021426415,0.0019546293,0.011397435],"category_scores_gemma":[0.02283746,0.00040377997,0.0005659782,0.0016763964,0.002576478,0.0051952945,0.001965577,0.0026079759,0.0010257136],"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.0000731065,0.00003779702,0.0004705571,0.00009264931,0.000012777918,0.00007609649,0.00020912201,0.01360469,0.002053004,0.9638692,0.002843384,0.01665762],"study_design_scores_gemma":[0.000013508722,0.000009096769,0.00014171508,0.000017043729,0.0000052591004,0.000092481554,0.000055333436,0.026825225,0.0003592329,0.9712545,0.0012108946,0.000015600786],"about_ca_topic_score_codex":0.00032118167,"about_ca_topic_score_gemma":0.0006407315,"teacher_disagreement_score":0.011397435,"about_ca_system_score_codex":0.00095310487,"about_ca_system_score_gemma":0.0005497741,"threshold_uncertainty_score":0.038128197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03711869,0.0011411455,0.7900246,0.036941834,0.0012056566,0.00014302452,0.00037815952,0.0006967973,0.13235012],"genre_scores_gemma":[0.6687995,0.0014510091,0.29682267,0.0064833793,0.0024284553,0.0005005182,0.00078064995,0.00074150634,0.021992238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98980063,0.0058963164,0.0003813514,0.0011311548,0.002063404,0.0007271663],"domain_scores_gemma":[0.88966143,0.094190635,0.0015524235,0.007898984,0.0050316965,0.0016647339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014737259,0.0012727743,0.0014882832,0.0027090604,0.0046307133,0.005349075,0.0047423807,0.003884436,0.012242208],"category_scores_gemma":[0.09240158,0.0008798036,0.0021578048,0.0027154298,0.0107247,0.019475188,0.010080047,0.010502621,0.0015702919],"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.00009480034,0.000051089664,0.00038555326,0.00008022836,0.000022756332,0.00004579517,0.00017021007,0.009046537,0.0001476832,0.97496915,0.005055661,0.009930445],"study_design_scores_gemma":[0.000019417557,0.000016217957,0.00006344727,0.000027369488,0.000008514698,0.00003567119,0.000062788204,0.0347619,0.00027101688,0.9615869,0.0031350409,0.000011869623],"about_ca_topic_score_codex":0.0034085698,"about_ca_topic_score_gemma":0.0034235676,"teacher_disagreement_score":0.014737259,"about_ca_system_score_codex":0.0025109092,"about_ca_system_score_gemma":0.0031856832,"threshold_uncertainty_score":0.07793903},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007327051,0.36045283,0.030401738,0.5472417,0.018175002,0.000044893706,0.00018239663,0.00021320587,0.03596116],"genre_scores_gemma":[0.5341358,0.26340505,0.03049525,0.102105804,0.0535595,0.00033396078,0.00031880545,0.0007132498,0.014932581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9866262,0.007012776,0.0009568979,0.0021735644,0.0027534647,0.0004770072],"domain_scores_gemma":[0.94934875,0.0368588,0.0012471557,0.0056341477,0.006008568,0.0009025243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03031991,0.0016860787,0.003500044,0.009517782,0.0034372285,0.013852799,0.0042710863,0.009138508,0.008054353],"category_scores_gemma":[0.038758572,0.00069449836,0.0016722924,0.0034614902,0.053055514,0.038613886,0.011331802,0.0150874015,0.0010240644],"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.00008997293,0.000017402437,0.0001978122,0.0008197372,0.00007436445,0.00013379895,0.002727231,0.00086727075,0.00014861795,0.9541686,0.009853752,0.03090134],"study_design_scores_gemma":[0.000023544895,0.000026303453,0.00024377219,0.0009495852,0.000032440432,0.00008521124,0.0019377812,0.00093621906,0.000122098,0.86959463,0.12601438,0.00003409566],"about_ca_topic_score_codex":0.004701408,"about_ca_topic_score_gemma":0.0035919757,"teacher_disagreement_score":0.03031991,"about_ca_system_score_codex":0.011836444,"about_ca_system_score_gemma":0.0057086432,"threshold_uncertainty_score":0.16034895},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032584714,0.00023467247,0.9559729,0.00022112565,0.0000702211,0.00014678904,0.0013170387,0.036399145,0.0023796454],"genre_scores_gemma":[0.03128113,0.00018018822,0.9575377,0.00019085415,0.00006545763,0.00043537217,0.0043244576,0.003972357,0.0020123874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977508,0.0006718731,0.00016141617,0.0006731067,0.0005985653,0.0001443134],"domain_scores_gemma":[0.99205244,0.004875791,0.00040459173,0.0016029307,0.00086919573,0.00019503683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003320474,0.0017750384,0.0012024025,0.0013698302,0.0012275769,0.0019857641,0.0035193793,0.0019684245,0.023336137],"category_scores_gemma":[0.02029159,0.0013743261,0.001300073,0.0024406165,0.0012225914,0.0026216654,0.002742869,0.0028699192,0.013103426],"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.0010452551,0.0002101913,0.0019942082,0.0017191207,0.00013386515,0.00045836504,0.0005362143,0.13787994,0.024741763,0.044768885,0.102857746,0.6836544],"study_design_scores_gemma":[0.0004089683,0.00022401387,0.00053988036,0.00015675435,0.000045748995,0.00049291115,0.00013969411,0.8002643,0.030306982,0.09174236,0.07559622,0.00008210001],"about_ca_topic_score_codex":0.0022341965,"about_ca_topic_score_gemma":0.002927397,"teacher_disagreement_score":0.023336137,"about_ca_system_score_codex":0.0008162389,"about_ca_system_score_gemma":0.002009928,"threshold_uncertainty_score":0.07806718},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119687624,0.0001310543,0.876386,0.0005084287,0.000026011623,0.00009353907,0.00025312626,0.00074244133,0.0021717965],"genre_scores_gemma":[0.31667912,0.00013782208,0.67950463,0.00015816018,0.00002829173,0.00014679087,0.0009922958,0.00021262126,0.0021403173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994203,0.0001944017,0.000030407136,0.00018721496,0.00010099991,0.0000666863],"domain_scores_gemma":[0.99730814,0.001858246,0.00017586624,0.00031414008,0.00017065613,0.00017301524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210551,0.0008628334,0.0009822302,0.00084692676,0.00075373094,0.0013374852,0.0017826374,0.0015171241,0.005971674],"category_scores_gemma":[0.006245815,0.00079213065,0.0010796691,0.0010995122,0.0009642238,0.002282309,0.0019725207,0.0014643304,0.0007791422],"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.0005348752,0.00024006549,0.004483825,0.00035089918,0.00008920479,0.0007100649,0.00039319127,0.7196151,0.0163091,0.07143383,0.004995082,0.18084483],"study_design_scores_gemma":[0.00009060389,0.00011857456,0.00068565615,0.000021607155,0.000028820903,0.00035772135,0.000119963704,0.91545767,0.006934821,0.074468896,0.0016907474,0.00002485809],"about_ca_topic_score_codex":0.002170656,"about_ca_topic_score_gemma":0.0018583243,"teacher_disagreement_score":0.005971674,"about_ca_system_score_codex":0.000645696,"about_ca_system_score_gemma":0.0009871385,"threshold_uncertainty_score":0.019977212},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56708837,0.037300795,0.33694223,0.005527817,0.0005871647,0.0001318321,0.011419348,0.004423306,0.03657919],"genre_scores_gemma":[0.88697785,0.013091615,0.08796467,0.000508574,0.0001621323,0.000049251354,0.008117682,0.0006913315,0.002436959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952686,0.00015706311,0.0000274089,0.00014470781,0.00010682221,0.000037103662],"domain_scores_gemma":[0.9986181,0.0005766946,0.0001555098,0.00030624398,0.00018504109,0.00015850332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096242526,0.00060285063,0.0004030587,0.003547191,0.0011391769,0.0027310564,0.0013533978,0.00092826324,0.0023946774],"category_scores_gemma":[0.006634532,0.00067733205,0.0004964482,0.0023713333,0.0012274805,0.0035596883,0.001887288,0.0023049433,0.0011291638],"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.00095215364,0.0001244262,0.13433294,0.0014638775,0.0004832593,0.0022120855,0.007518968,0.17755967,0.022117909,0.31917942,0.017831378,0.31622395],"study_design_scores_gemma":[0.00007702982,0.00013533578,0.052320253,0.0010680879,0.00027760997,0.0019718725,0.0055878963,0.19123572,0.008005708,0.4828143,0.25629288,0.00021329982],"about_ca_topic_score_codex":0.00594412,"about_ca_topic_score_gemma":0.005358468,"teacher_disagreement_score":0.00594412,"about_ca_system_score_codex":0.0012423948,"about_ca_system_score_gemma":0.0010558753,"threshold_uncertainty_score":0.011819065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88974684,0.00089364056,0.1055711,0.00038657183,0.0000073257524,0.000012892358,0.00012053113,0.000103366874,0.0031576871],"genre_scores_gemma":[0.9855979,0.00023169666,0.013455487,0.000023849054,0.000011789014,0.000017127119,0.00010175746,0.000036449906,0.00052398065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995908,0.00015221875,0.000018171584,0.00011149665,0.00007284594,0.000054562573],"domain_scores_gemma":[0.99559915,0.0028515412,0.0006832359,0.0003896556,0.00023162589,0.00024468865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091650797,0.00025462185,0.00039473892,0.0016352105,0.0007241019,0.0012534449,0.00069533783,0.0006643976,0.0010565756],"category_scores_gemma":[0.008289536,0.0003304046,0.00029581974,0.0020645622,0.001645444,0.0020989927,0.0011892114,0.00079456763,0.00007723635],"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.00017230415,0.000049638882,0.032094534,0.00009751753,0.00006085625,0.00017786796,0.0011288818,0.61231875,0.005394093,0.30572388,0.0005773517,0.042204272],"study_design_scores_gemma":[0.00002000331,0.000038633727,0.02119925,0.000034483408,0.00004504425,0.00026881034,0.00060802605,0.45094264,0.0018144308,0.52198213,0.0029934559,0.00005313217],"about_ca_topic_score_codex":0.004556384,"about_ca_topic_score_gemma":0.005076329,"teacher_disagreement_score":0.004556384,"about_ca_system_score_codex":0.0013272131,"about_ca_system_score_gemma":0.00036269758,"threshold_uncertainty_score":0.009629667},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048512515,0.00034475402,0.9455979,0.00026973124,0.000043270986,0.00022166822,0.00027874578,0.0014794486,0.0032519822],"genre_scores_gemma":[0.17793712,0.00014380881,0.817453,0.00010971282,0.000036925267,0.00025394332,0.00094344286,0.00033571786,0.0027862596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986143,0.00032902465,0.000086477594,0.00041914594,0.00042172047,0.00012932693],"domain_scores_gemma":[0.9953892,0.0029196213,0.00039940415,0.00078808685,0.00030225673,0.00020138998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199779,0.000978049,0.0012628459,0.0011152124,0.0010528404,0.0014223116,0.003097639,0.0016578252,0.007674374],"category_scores_gemma":[0.005850224,0.00052429514,0.0012764813,0.0016505521,0.0014405485,0.0023702201,0.0027521031,0.0018811811,0.0011534046],"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.0010300694,0.00034572798,0.003037727,0.00056697306,0.000117039446,0.00032804933,0.00065336004,0.5532245,0.020477505,0.07046112,0.005618352,0.34413964],"study_design_scores_gemma":[0.00015420369,0.00031511293,0.0005368114,0.000043071384,0.000063229134,0.00029077748,0.0001882792,0.8811033,0.019937372,0.08840463,0.008926275,0.00003695266],"about_ca_topic_score_codex":0.001558985,"about_ca_topic_score_gemma":0.0012995234,"teacher_disagreement_score":0.007674374,"about_ca_system_score_codex":0.0011570432,"about_ca_system_score_gemma":0.0011421286,"threshold_uncertainty_score":0.02567333},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003522482,0.0003069291,0.9921463,0.00018484396,0.000040137435,0.0002517978,0.00046228006,0.0027459513,0.0003392161],"genre_scores_gemma":[0.018430255,0.00017157382,0.9792509,0.000100664416,0.000015838297,0.00026980307,0.0012267337,0.00010512541,0.0004290878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755186,0.00048643522,0.00031003854,0.0008476449,0.00066960027,0.00013442202],"domain_scores_gemma":[0.99692696,0.0018497859,0.0002961073,0.00033638353,0.0005060738,0.000084730564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022334526,0.002059942,0.0017173354,0.0082519185,0.0013409933,0.0019124983,0.0033885047,0.002210854,0.0026853508],"category_scores_gemma":[0.007927157,0.0009234639,0.002456253,0.009146586,0.00104108,0.0040412527,0.0017427142,0.002198603,0.0014285246],"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.00023061773,0.0003331239,0.0046789474,0.0006080999,0.00039081185,0.0003182447,0.0002899672,0.12579694,0.008672174,0.014312957,0.012251258,0.83211684],"study_design_scores_gemma":[0.000083684055,0.00012557399,0.00080253225,0.00006002182,0.000066256514,0.00044905275,0.00012205395,0.9536445,0.0039921,0.030760398,0.009850899,0.000043007447],"about_ca_topic_score_codex":0.0071218433,"about_ca_topic_score_gemma":0.009653553,"teacher_disagreement_score":0.0082519185,"about_ca_system_score_codex":0.001224144,"about_ca_system_score_gemma":0.0024224722,"threshold_uncertainty_score":0.014160752},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0132141635,0.0010525102,0.97769076,0.00024040235,0.000081953,0.000037178237,0.0002121507,0.005093297,0.0023776253],"genre_scores_gemma":[0.049330253,0.0013330731,0.9453118,0.000066424385,0.00005422838,0.00006691198,0.00042197498,0.0010859629,0.002329323],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965286,0.000114486975,0.000028070772,0.00009290334,0.00009175043,0.00001991583],"domain_scores_gemma":[0.9980044,0.0014861847,0.000059717746,0.0001800955,0.00019927378,0.000070358394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014582388,0.0011525513,0.0014336673,0.0017368053,0.0012811621,0.0018649715,0.001840737,0.0011253254,0.008328678],"category_scores_gemma":[0.005257395,0.0012785717,0.001493438,0.00271718,0.00086387247,0.0015690147,0.0015300434,0.002691325,0.0026160544],"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.000361883,0.000115179646,0.0023816337,0.00054530776,0.00012606102,0.0003670623,0.0007013425,0.11676007,0.014962757,0.034276772,0.008008881,0.8213931],"study_design_scores_gemma":[0.00008312635,0.00004796631,0.00096778997,0.000052991127,0.00006925743,0.0003026258,0.00019002876,0.9024745,0.0073463875,0.078008056,0.010418548,0.00003867615],"about_ca_topic_score_codex":0.003913998,"about_ca_topic_score_gemma":0.005007694,"teacher_disagreement_score":0.008328678,"about_ca_system_score_codex":0.00057910726,"about_ca_system_score_gemma":0.000822921,"threshold_uncertainty_score":0.027862191},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5867534,0.0003672465,0.39868712,0.0005969379,0.000039514736,0.00043882325,0.00074020395,0.00080665847,0.01157012],"genre_scores_gemma":[0.66196436,0.0002396224,0.3295196,0.00009906753,0.00003749419,0.00021777143,0.0013286982,0.00028524935,0.006308254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988167,0.00022121199,0.00007565883,0.00041399262,0.00032639274,0.00014609622],"domain_scores_gemma":[0.9955389,0.0025363332,0.0007048505,0.00055182603,0.0004008801,0.00026715448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082586595,0.00040746006,0.00061118964,0.0018824474,0.0009402976,0.0013197535,0.0010410988,0.0005305083,0.0060051926],"category_scores_gemma":[0.006705629,0.00063265255,0.0006986311,0.0018764962,0.0014553394,0.0028864215,0.0017730513,0.0009865655,0.0005679701],"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.0014718068,0.00030177605,0.02880883,0.0007288276,0.00015781721,0.0014108367,0.0029940633,0.15833652,0.06351815,0.4961897,0.007270286,0.23881134],"study_design_scores_gemma":[0.00011071766,0.00020340667,0.0053470293,0.00010516421,0.00007498164,0.0009872812,0.00097509765,0.40385294,0.031018697,0.53794605,0.019322239,0.000056392164],"about_ca_topic_score_codex":0.001493217,"about_ca_topic_score_gemma":0.0014678856,"teacher_disagreement_score":0.0060051926,"about_ca_system_score_codex":0.0009957232,"about_ca_system_score_gemma":0.0006091209,"threshold_uncertainty_score":0.020089388},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05998426,0.00033608355,0.9346316,0.00024215273,0.000038274833,0.00008670165,0.00034244062,0.001861913,0.0024765797],"genre_scores_gemma":[0.21638913,0.00022028438,0.77975076,0.00013065054,0.00005478242,0.00012745312,0.0014232513,0.0005956596,0.0013080252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985972,0.00041263035,0.00006129268,0.00048792324,0.00031043898,0.00013044309],"domain_scores_gemma":[0.9975241,0.0012329711,0.0003183594,0.0005844173,0.00022057645,0.0001195859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012252307,0.0006829561,0.0013062913,0.0019446783,0.0010234305,0.0022475382,0.0014477059,0.0010510479,0.0030033763],"category_scores_gemma":[0.005562194,0.0005426645,0.001034719,0.0028229228,0.0011111388,0.0031398807,0.0019617009,0.0017362136,0.00096468366],"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.0004881631,0.0003099505,0.0036313182,0.00025894347,0.00010329786,0.00023774614,0.00033346107,0.51396066,0.013944255,0.08947236,0.003975134,0.37328476],"study_design_scores_gemma":[0.000034498407,0.00014048508,0.00058578537,0.000023603245,0.000014837906,0.00012320046,0.0000710848,0.8838301,0.005108916,0.10596357,0.0040851375,0.000018824536],"about_ca_topic_score_codex":0.002589511,"about_ca_topic_score_gemma":0.003925513,"teacher_disagreement_score":0.0030033763,"about_ca_system_score_codex":0.0010610416,"about_ca_system_score_gemma":0.0013246224,"threshold_uncertainty_score":0.010047317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28763074,0.004267938,0.6194941,0.021554666,0.0009744275,0.0001581268,0.0006981574,0.00091487495,0.06430698],"genre_scores_gemma":[0.89006585,0.0014767747,0.09473678,0.0025732527,0.0012135071,0.0002828752,0.0008222249,0.00030997096,0.008518797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973367,0.00091319304,0.00011177204,0.000906743,0.0004570215,0.00027456443],"domain_scores_gemma":[0.9461013,0.041842915,0.0034266755,0.004501985,0.0025578726,0.0015692691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006686919,0.0005714347,0.0012144286,0.0016510952,0.003032214,0.0036065355,0.0019101067,0.0032791751,0.017398287],"category_scores_gemma":[0.06414336,0.00052116567,0.001629073,0.0017948202,0.007444027,0.009770156,0.0031683561,0.003875358,0.001479332],"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.00023963104,0.00012359877,0.0063265464,0.000301552,0.00004527499,0.0001884516,0.00078219885,0.045373827,0.00075417093,0.9004198,0.010125288,0.035319738],"study_design_scores_gemma":[0.00004246518,0.000067552515,0.00071875314,0.00007378803,0.000012028759,0.0001073928,0.00028100298,0.04859026,0.0004914473,0.94573575,0.003856434,0.000023086552],"about_ca_topic_score_codex":0.0013512745,"about_ca_topic_score_gemma":0.00082154595,"teacher_disagreement_score":0.017398287,"about_ca_system_score_codex":0.0016007569,"about_ca_system_score_gemma":0.0013091536,"threshold_uncertainty_score":0.0582031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98105973,0.0009713148,0.016026823,0.00015822651,0.000013707717,0.000030905052,0.0006796777,0.00042648724,0.0006331485],"genre_scores_gemma":[0.96107966,0.0004260031,0.033712998,0.000079581965,0.000022651591,0.00003113667,0.0042117494,0.000055961304,0.000380239],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916196,0.00022222109,0.000071964445,0.000264495,0.00022761787,0.000051786763],"domain_scores_gemma":[0.99856037,0.0007505332,0.0002902667,0.00015445515,0.00019116787,0.000053290678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011323165,0.00031041718,0.000466221,0.0009308986,0.00029963147,0.00055368536,0.00035167084,0.0006025284,0.00093652814],"category_scores_gemma":[0.0044022,0.00023794181,0.00034217714,0.00088903366,0.00024300037,0.00032258747,0.00045127215,0.0005140334,0.000371849],"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.0023071154,0.0003053433,0.32379398,0.0013788027,0.000978015,0.0013984257,0.0008950107,0.0331441,0.4638338,0.0024808391,0.0035931652,0.16589144],"study_design_scores_gemma":[0.00018304377,0.0008530652,0.514744,0.00011925883,0.0010375978,0.0051422184,0.00040324125,0.16860573,0.29536203,0.0036646517,0.009807469,0.00007770184],"about_ca_topic_score_codex":0.0011233109,"about_ca_topic_score_gemma":0.002416275,"teacher_disagreement_score":0.0011323165,"about_ca_system_score_codex":0.00034664865,"about_ca_system_score_gemma":0.00037439176,"threshold_uncertainty_score":0.0059883},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009382922,0.005055963,0.94861275,0.005282731,0.00035174534,0.00010666737,0.0003374318,0.0002327631,0.030637],"genre_scores_gemma":[0.45888522,0.010572485,0.47734597,0.0022273757,0.0016446805,0.0008480158,0.0014582684,0.00026659758,0.046751406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997914,0.001205618,0.000059878796,0.0002445196,0.00040669614,0.00016923426],"domain_scores_gemma":[0.9951361,0.0038898995,0.0002521523,0.0002616149,0.00031208651,0.00014805268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028860976,0.001127978,0.00096526096,0.00081514614,0.0007347269,0.0023915,0.0016059238,0.0016244272,0.007856443],"category_scores_gemma":[0.008176479,0.00046278816,0.0008371773,0.0025865752,0.0024220035,0.003662304,0.0017794956,0.0035316532,0.0016807577],"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.000028060655,0.00005380957,0.00018690902,0.0001636666,0.000019021023,0.000033353434,0.0001077785,0.15019788,0.00014787215,0.8223038,0.006417637,0.020340199],"study_design_scores_gemma":[0.00002217366,0.000028399245,0.00009952284,0.00003543473,0.0000074107043,0.00002356083,0.000050532584,0.36988777,0.00013093762,0.61676925,0.012932106,0.000013084994],"about_ca_topic_score_codex":0.0053201024,"about_ca_topic_score_gemma":0.0038332553,"teacher_disagreement_score":0.007856443,"about_ca_system_score_codex":0.0020518622,"about_ca_system_score_gemma":0.0017250781,"threshold_uncertainty_score":0.02628237},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66807586,0.0013369756,0.31648028,0.0010395761,0.00004951643,0.00010838718,0.0010211143,0.00209208,0.009796258],"genre_scores_gemma":[0.67033094,0.00062451855,0.32319707,0.00025726936,0.000019898831,0.00013438753,0.002560941,0.0006241551,0.002250837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996761,0.00011348248,0.0000198769,0.00008352709,0.00006451395,0.000042511234],"domain_scores_gemma":[0.9971343,0.0020709212,0.00022016144,0.00026786755,0.00018690203,0.00011987962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014091992,0.00053870986,0.0006737949,0.00083922956,0.001046429,0.0018193403,0.0014414438,0.0010328597,0.0036225356],"category_scores_gemma":[0.0075305407,0.00040251188,0.0007847692,0.0009843165,0.00095159095,0.0016816437,0.0009784078,0.0012913309,0.00053665735],"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.0006123274,0.00016098535,0.02109708,0.00044472422,0.00008142998,0.0003207112,0.0006071667,0.808757,0.01644,0.04187852,0.0044955155,0.10510445],"study_design_scores_gemma":[0.00008026784,0.00009622087,0.005358957,0.00008604841,0.000056712364,0.0002258009,0.00036534196,0.9121782,0.01496639,0.062282566,0.0042606234,0.000042815842],"about_ca_topic_score_codex":0.0036137823,"about_ca_topic_score_gemma":0.004994892,"teacher_disagreement_score":0.0036225356,"about_ca_system_score_codex":0.0014148826,"about_ca_system_score_gemma":0.0008912312,"threshold_uncertainty_score":0.012118578},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028832488,0.034145694,0.79969245,0.008158802,0.0042135036,0.00012467279,0.00043798363,0.002333777,0.12206074],"genre_scores_gemma":[0.39190337,0.048616197,0.4649043,0.005232795,0.0058288453,0.00029195606,0.0014203681,0.0012326293,0.08056947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845254,0.00040454505,0.00009906917,0.00030874545,0.000565473,0.00016961827],"domain_scores_gemma":[0.99701405,0.0014182221,0.00013972087,0.00088869146,0.00042615816,0.00011309008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018960716,0.0012461666,0.0016213306,0.0024947145,0.0011498011,0.0031388288,0.0024647722,0.0015863813,0.009910595],"category_scores_gemma":[0.005179696,0.00060195354,0.0011968035,0.0045558237,0.0031958504,0.007733061,0.0026942769,0.004402081,0.003542421],"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.000068622685,0.000052451014,0.00015617922,0.00021626649,0.000014577155,0.000019407338,0.0000546283,0.008222477,0.0015325919,0.8285976,0.008648503,0.15241675],"study_design_scores_gemma":[0.0000369527,0.00004909585,0.0001411575,0.000072998795,0.000021540633,0.00010312414,0.00004071629,0.037846982,0.0036623161,0.8398595,0.118133426,0.00003220835],"about_ca_topic_score_codex":0.0012532144,"about_ca_topic_score_gemma":0.0011873771,"teacher_disagreement_score":0.009910595,"about_ca_system_score_codex":0.0020829719,"about_ca_system_score_gemma":0.0018980027,"threshold_uncertainty_score":0.03315419},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09269018,0.0025409898,0.89699036,0.002417133,0.0002993625,0.00003350839,0.0003031158,0.0008598062,0.0038655358],"genre_scores_gemma":[0.8406983,0.0011880401,0.15434802,0.0006693492,0.00042500257,0.00014470296,0.00056857883,0.0005205326,0.0014374491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99524176,0.0022439915,0.00022982896,0.001022996,0.000854627,0.00040687586],"domain_scores_gemma":[0.88650745,0.09920873,0.0041081677,0.0061980383,0.0029456199,0.0010319469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014481698,0.0008448694,0.0010747275,0.0018102359,0.0011454418,0.0025107611,0.0028920113,0.0020727718,0.002500042],"category_scores_gemma":[0.13010156,0.00076427305,0.0011869741,0.0013551202,0.0031576394,0.005684365,0.0027803895,0.0039587393,0.0007094635],"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.001607255,0.00014308022,0.046079118,0.00054582185,0.0002730674,0.00041917554,0.00066869875,0.6742872,0.01000019,0.16285697,0.004446975,0.098672524],"study_design_scores_gemma":[0.000034413682,0.000107019805,0.0025282064,0.000108117354,0.00003025408,0.0002905257,0.000052791533,0.8978157,0.0038541153,0.09397443,0.0011601772,0.000044131106],"about_ca_topic_score_codex":0.002486855,"about_ca_topic_score_gemma":0.0016192355,"teacher_disagreement_score":0.014481698,"about_ca_system_score_codex":0.0017834236,"about_ca_system_score_gemma":0.0015180578,"threshold_uncertainty_score":0.07658744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86989284,0.00028592427,0.1278332,0.00015056164,0.000014248194,0.000054926524,0.00040696288,0.00040323232,0.00095814536],"genre_scores_gemma":[0.8627934,0.00011544061,0.13485974,0.000069298025,0.000009456903,0.000068401,0.0014507958,0.000118024254,0.0005154244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991817,0.00022040759,0.0000421554,0.00036020653,0.00013412109,0.000061391875],"domain_scores_gemma":[0.9964191,0.0025511072,0.00033044018,0.00020740749,0.00036532118,0.00012658608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002142094,0.00037489925,0.00048610778,0.0010823936,0.00059062004,0.0009125063,0.0013186095,0.0009781902,0.0010923576],"category_scores_gemma":[0.0074991514,0.00043479443,0.00068690424,0.00096624787,0.00065360527,0.0008603111,0.0008355022,0.0007648024,0.00026196093],"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.00046400394,0.00017451649,0.11473036,0.00028691726,0.00024833521,0.00036798787,0.0006378929,0.76836824,0.027749429,0.013685702,0.0010105456,0.072276086],"study_design_scores_gemma":[0.00003487675,0.00007304686,0.011868074,0.000024081934,0.000048095088,0.00028493974,0.00008512665,0.969053,0.008071236,0.009296867,0.0011402209,0.000020461493],"about_ca_topic_score_codex":0.0028840553,"about_ca_topic_score_gemma":0.0026493438,"teacher_disagreement_score":0.0028840553,"about_ca_system_score_codex":0.001435701,"about_ca_system_score_gemma":0.00079464185,"threshold_uncertainty_score":0.011328578},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012495964,0.00063186954,0.9779158,0.0004894799,0.00010056111,0.0001588792,0.0005444766,0.005494369,0.0021684442],"genre_scores_gemma":[0.10455511,0.00021517351,0.890883,0.00036658943,0.00008799665,0.00036974627,0.0013157716,0.0007758319,0.0014308126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989127,0.0004318581,0.00006118237,0.000250875,0.0002594671,0.000083857034],"domain_scores_gemma":[0.99537164,0.0037341295,0.00024201059,0.0002643063,0.0002734724,0.00011438947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002240058,0.0013667373,0.0011556443,0.0016439909,0.0007545757,0.0013262831,0.0029492613,0.0016921164,0.007899821],"category_scores_gemma":[0.008525358,0.00060249504,0.0012970467,0.0022226665,0.0008961478,0.0013938268,0.0013634533,0.0020668004,0.0014994594],"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.00049319013,0.00024529037,0.003360318,0.00046224627,0.0002542602,0.00024746874,0.00011704878,0.62690324,0.003015629,0.020604493,0.015256006,0.3290408],"study_design_scores_gemma":[0.00007902255,0.00003092237,0.0001418372,0.000014212431,0.000019799792,0.00005773303,0.000009832466,0.98248994,0.0010667872,0.013729711,0.0023483648,0.000011839695],"about_ca_topic_score_codex":0.0035603973,"about_ca_topic_score_gemma":0.0044311183,"teacher_disagreement_score":0.007899821,"about_ca_system_score_codex":0.0009269212,"about_ca_system_score_gemma":0.0016568579,"threshold_uncertainty_score":0.026427507},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019101942,0.00073915033,0.93906546,0.0018430746,0.00018125607,0.0004847002,0.018199144,0.0150044905,0.005380711],"genre_scores_gemma":[0.06757856,0.00043309398,0.89951885,0.00025065485,0.000093541916,0.00077718525,0.027476823,0.0014869154,0.0023842535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985403,0.00036664886,0.00015398831,0.00040775086,0.00043714273,0.0000942225],"domain_scores_gemma":[0.9946208,0.002751745,0.00037949407,0.001433843,0.00053644297,0.00027763663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024073562,0.001052406,0.000952931,0.001968866,0.0016197074,0.0023054092,0.0025981402,0.0013342573,0.007888397],"category_scores_gemma":[0.011016272,0.00084613543,0.0012807724,0.0038728607,0.0010468549,0.004164982,0.0027892445,0.0034111412,0.0027237907],"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.0014246915,0.00051921787,0.004214623,0.001473963,0.000103806335,0.00038571088,0.0006843174,0.20979539,0.009708568,0.17345354,0.13725677,0.4609794],"study_design_scores_gemma":[0.0004467982,0.00030825692,0.00071293704,0.00011535413,0.00003980621,0.0005129386,0.00018729645,0.5571028,0.0060241213,0.33001864,0.1044684,0.000062700325],"about_ca_topic_score_codex":0.002593694,"about_ca_topic_score_gemma":0.0044001755,"teacher_disagreement_score":0.007888397,"about_ca_system_score_codex":0.0013527876,"about_ca_system_score_gemma":0.003854677,"threshold_uncertainty_score":0.02638936},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022277275,0.0001738729,0.97299296,0.00007577213,0.000017674047,0.000042193333,0.00030536603,0.0033655742,0.0007493222],"genre_scores_gemma":[0.14546375,0.000108496075,0.8514787,0.00007195514,0.000025946942,0.00012156143,0.0015039454,0.00038748016,0.0008381241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785787,0.00081879704,0.0000961943,0.0006552641,0.00043310397,0.00013865843],"domain_scores_gemma":[0.992396,0.005556236,0.000488588,0.0009637421,0.00044308527,0.0001523684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047783935,0.0012752825,0.0011561678,0.0025042908,0.0011923811,0.001301333,0.002747813,0.0015284088,0.0042803176],"category_scores_gemma":[0.01642442,0.00088544417,0.0012824617,0.0031651799,0.0018325355,0.0019698425,0.0015782205,0.0013993878,0.0013477312],"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.0011496639,0.00022807944,0.008385431,0.00063273765,0.00022030906,0.0002785633,0.0005442636,0.49491796,0.018179491,0.043208025,0.0053067855,0.42694867],"study_design_scores_gemma":[0.00007666143,0.000119379794,0.0016121983,0.000029193656,0.00004980554,0.00024462646,0.00005344027,0.93317574,0.011299806,0.049293857,0.0040162145,0.000029104947],"about_ca_topic_score_codex":0.007057748,"about_ca_topic_score_gemma":0.0067671197,"teacher_disagreement_score":0.007057748,"about_ca_system_score_codex":0.0015729174,"about_ca_system_score_gemma":0.0022484856,"threshold_uncertainty_score":0.02527088},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007458787,0.0020078626,0.15078804,0.0005534485,0.00046172595,0.00066249154,0.19862802,0.61984164,0.01959804],"genre_scores_gemma":[0.04018293,0.0017770948,0.26290387,0.00077319395,0.00023255889,0.002218522,0.56127816,0.11621953,0.014414106],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980757,0.0002509877,0.00021985164,0.00050951,0.0007187302,0.00022515113],"domain_scores_gemma":[0.9973871,0.0009330122,0.00030584255,0.00054213824,0.0003894488,0.0004425175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029710666,0.004041218,0.0018164781,0.0070418958,0.0013994251,0.0047130985,0.0055001536,0.0015491025,0.07377655],"category_scores_gemma":[0.006511527,0.0023941954,0.0017196686,0.005637419,0.0007727757,0.006102286,0.008291994,0.0030072553,0.048201833],"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.0060897786,0.00036160092,0.004782268,0.0045405724,0.00042781717,0.0011873496,0.0013786046,0.0032537472,0.036992002,0.016968623,0.74849796,0.17551982],"study_design_scores_gemma":[0.0013199332,0.00023824109,0.007083144,0.0007365835,0.0001956213,0.00094265095,0.0004989233,0.032422937,0.041950066,0.03619616,0.87792593,0.00048977346],"about_ca_topic_score_codex":0.0036043068,"about_ca_topic_score_gemma":0.002749103,"teacher_disagreement_score":0.07377655,"about_ca_system_score_codex":0.0014890947,"about_ca_system_score_gemma":0.002485976,"threshold_uncertainty_score":0.2468071},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19610606,0.0013487274,0.7981347,0.001071987,0.00004647085,0.000111594454,0.00032533743,0.00045686663,0.002398292],"genre_scores_gemma":[0.87994313,0.0017414533,0.112891495,0.00026760853,0.00019292736,0.0005309671,0.0011852778,0.0002842992,0.0029628389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965048,0.00176147,0.00014057336,0.00074231625,0.000636314,0.00021453897],"domain_scores_gemma":[0.9122414,0.07871269,0.0031038036,0.0031860045,0.0020215877,0.00073453225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012845529,0.0007937851,0.0014649391,0.0030604894,0.0007371482,0.002429989,0.0030260044,0.0019756067,0.0017807956],"category_scores_gemma":[0.07058723,0.0008354655,0.001007308,0.0018071515,0.004589389,0.005369888,0.0020625247,0.002357539,0.00042900947],"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.00021642889,0.00013083631,0.019183973,0.00024585726,0.00012425834,0.0005158975,0.0006090146,0.40777323,0.0034664704,0.5311594,0.0018159376,0.03475868],"study_design_scores_gemma":[0.000027008096,0.000047986006,0.0023576345,0.000050307226,0.000018886054,0.00040335095,0.00007464025,0.85386527,0.0013599991,0.14108631,0.00065325724,0.00005532381],"about_ca_topic_score_codex":0.0014343269,"about_ca_topic_score_gemma":0.0010029682,"teacher_disagreement_score":0.012845529,"about_ca_system_score_codex":0.002306019,"about_ca_system_score_gemma":0.00091928744,"threshold_uncertainty_score":0.06793445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36349872,0.0018434632,0.60826373,0.0006924121,0.00019229927,0.00007121964,0.0045713345,0.0033761049,0.017490711],"genre_scores_gemma":[0.7073473,0.0017446541,0.27350715,0.000121084115,0.000060024788,0.00007135847,0.008690534,0.0010139162,0.00744401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998827,0.000026069718,0.000006174975,0.000044515993,0.000024519935,0.000015898375],"domain_scores_gemma":[0.99974185,0.00010659899,0.000018087612,0.00007236812,0.000038985207,0.00002207998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031146305,0.00040627012,0.0005749398,0.0012449393,0.00046750717,0.0012726482,0.0010334374,0.0008448875,0.0063856514],"category_scores_gemma":[0.0013252009,0.00062744395,0.0010996321,0.0012731222,0.00052319415,0.0008809118,0.0005863908,0.0009802366,0.0015257101],"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.0023447226,0.00013483371,0.017946988,0.0013088718,0.00049685757,0.0027634688,0.0014371121,0.40135562,0.13570584,0.18715018,0.008945898,0.24040961],"study_design_scores_gemma":[0.00018751327,0.00028235358,0.01546324,0.00014702766,0.00037449275,0.0031980437,0.000644553,0.6853234,0.035539962,0.22678159,0.03195472,0.00010304574],"about_ca_topic_score_codex":0.0011671309,"about_ca_topic_score_gemma":0.0010520658,"teacher_disagreement_score":0.0063856514,"about_ca_system_score_codex":0.0005205944,"about_ca_system_score_gemma":0.0005240169,"threshold_uncertainty_score":0.021362126},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010151595,0.00014082639,0.9882528,0.000093542505,0.000014719774,0.0000677907,0.00012633255,0.0006259413,0.00052653125],"genre_scores_gemma":[0.09630784,0.000118693875,0.901629,0.000082272614,0.000033424814,0.00029915746,0.0006295584,0.00028322876,0.0006168746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989164,0.00033021957,0.00006483232,0.00020897198,0.00037972102,0.00009993506],"domain_scores_gemma":[0.9959325,0.0028348495,0.0002727875,0.00032368963,0.00048225545,0.00015390094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025563063,0.0009582644,0.0012175159,0.0023283781,0.0010264522,0.0013952067,0.0025361124,0.0018806735,0.004226142],"category_scores_gemma":[0.008709886,0.0007525162,0.0020196473,0.0022652885,0.001243904,0.0015652754,0.0026265113,0.0017952918,0.0007409447],"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.00015273747,0.00008474311,0.0022698827,0.00021618707,0.00012335366,0.0001570961,0.00023995724,0.830242,0.0040027844,0.026262112,0.002425451,0.13382377],"study_design_scores_gemma":[0.000021697808,0.000015165736,0.000197433,0.000009324957,0.000008944988,0.000051577543,0.000012265693,0.98874,0.0004060821,0.009801767,0.0007268895,0.000008838784],"about_ca_topic_score_codex":0.0041493718,"about_ca_topic_score_gemma":0.004646865,"teacher_disagreement_score":0.004226142,"about_ca_system_score_codex":0.0011810783,"about_ca_system_score_gemma":0.0020390819,"threshold_uncertainty_score":0.014137864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9286136,0.0001112272,0.06956968,0.000119250195,0.0000028734323,0.000019349562,0.00013474944,0.00010287855,0.0013263479],"genre_scores_gemma":[0.98932505,0.000042990276,0.010275575,0.000011130361,0.0000047238887,0.000018138833,0.0001413595,0.000009654799,0.00017135932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963653,0.00012064057,0.000019520823,0.00010853267,0.00008027448,0.00003444354],"domain_scores_gemma":[0.9951782,0.0030114676,0.0011203968,0.00023026446,0.00024234691,0.0002173424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005097108,0.00014926828,0.0002007299,0.0021017021,0.000513574,0.0007229256,0.00042536302,0.00034331897,0.0010691814],"category_scores_gemma":[0.005696984,0.00014447019,0.00023440542,0.0013473976,0.0012272758,0.0009862506,0.00066898664,0.0002898639,0.000056871675],"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.00076752243,0.00017526056,0.10823218,0.00046988722,0.00026272607,0.0008716038,0.0019604345,0.39739203,0.055069853,0.36440948,0.0014721589,0.06891696],"study_design_scores_gemma":[0.000056294004,0.00013961123,0.061474517,0.000038583996,0.00010085776,0.00090951705,0.00064838416,0.5377589,0.008813332,0.38772595,0.0022839734,0.000050065293],"about_ca_topic_score_codex":0.0016090508,"about_ca_topic_score_gemma":0.0017626263,"teacher_disagreement_score":0.0021017021,"about_ca_system_score_codex":0.00077693164,"about_ca_system_score_gemma":0.00030043902,"threshold_uncertainty_score":0.0056370497},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058358863,0.00019782824,0.93429375,0.00025610471,0.000016693868,0.00014827604,0.00023704459,0.0008852031,0.0056062373],"genre_scores_gemma":[0.32636648,0.0003270786,0.6655664,0.00011863236,0.000038794748,0.000344105,0.0010674144,0.00031350486,0.005857679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999435,0.00015443099,0.000026190935,0.00017050188,0.00014255983,0.00007121723],"domain_scores_gemma":[0.9986964,0.0008531543,0.00013145228,0.00012305101,0.00014538456,0.00005066458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006151839,0.0007282936,0.000610803,0.0010242157,0.000556738,0.00091002695,0.0009855824,0.00065113977,0.0047961115],"category_scores_gemma":[0.0036497512,0.0004405563,0.0008840317,0.0009469485,0.0007275722,0.0014201123,0.0016466461,0.0009867572,0.0010659127],"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.00022578717,0.00011238103,0.0017021031,0.00024381082,0.000045437577,0.00023077789,0.00045035483,0.71558654,0.014940399,0.05046363,0.0033259282,0.21267278],"study_design_scores_gemma":[0.00007869586,0.0001948282,0.0006525614,0.000036085472,0.00003769745,0.00020620471,0.00022330304,0.90465146,0.009910663,0.07531656,0.0086581735,0.00003363629],"about_ca_topic_score_codex":0.0036392775,"about_ca_topic_score_gemma":0.0031481977,"teacher_disagreement_score":0.0047961115,"about_ca_system_score_codex":0.0011069893,"about_ca_system_score_gemma":0.0010486735,"threshold_uncertainty_score":0.016044617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14019783,0.0037837366,0.56098735,0.0049930653,0.0020028576,0.0012635913,0.019278064,0.047775365,0.21971813],"genre_scores_gemma":[0.26402012,0.0015970857,0.5946678,0.0019685796,0.00035480104,0.0006452672,0.024771713,0.009124235,0.10285045],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815196,0.00023606308,0.00019727909,0.0003651293,0.0006442466,0.0004053471],"domain_scores_gemma":[0.9966536,0.0014931328,0.00018845819,0.0009654085,0.0005385692,0.00016085622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000900511,0.0024366272,0.001886481,0.0018107943,0.0017173642,0.0035773134,0.0026210968,0.0014421076,0.078103654],"category_scores_gemma":[0.0043430254,0.0011003929,0.0016984886,0.0054853037,0.0010039873,0.006005181,0.001864052,0.002523776,0.017527958],"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.00079923746,0.0004211133,0.000899901,0.00083219016,0.000070163536,0.00016126067,0.00016354104,0.008758256,0.012850245,0.04883768,0.11506523,0.8111412],"study_design_scores_gemma":[0.0011786993,0.000652738,0.002136418,0.0003481007,0.00036641766,0.0013359593,0.0006534973,0.07085168,0.057900716,0.6167751,0.24755357,0.0002470926],"about_ca_topic_score_codex":0.0036308789,"about_ca_topic_score_gemma":0.009537654,"teacher_disagreement_score":0.078103654,"about_ca_system_score_codex":0.0021528935,"about_ca_system_score_gemma":0.0039603305,"threshold_uncertainty_score":0.2612828},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40524402,0.004691549,0.48880282,0.0007911954,0.00017277828,0.00013968625,0.009195346,0.0043477085,0.086614996],"genre_scores_gemma":[0.7023989,0.0038134097,0.22899134,0.00023345533,0.00008418791,0.00011545277,0.030187398,0.0015530166,0.032622892],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978584,0.00005413603,0.000009873178,0.000074118005,0.000039687264,0.000036282014],"domain_scores_gemma":[0.9995389,0.00017609229,0.000045111512,0.000117041935,0.000081716236,0.000041056053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022077069,0.0003089828,0.00053144206,0.0016803873,0.0010547613,0.0012724119,0.0007115971,0.00055599265,0.010655844],"category_scores_gemma":[0.0011879948,0.0004109506,0.0004632779,0.0036261983,0.00064054405,0.0011721055,0.00065510074,0.0012218683,0.0027990087],"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.00078877655,0.000109873625,0.016163627,0.0011844169,0.00011137974,0.0012104202,0.0043803793,0.05961953,0.12230897,0.27014452,0.023518175,0.50046],"study_design_scores_gemma":[0.000080810874,0.00040994908,0.05287694,0.000533594,0.00019077516,0.003204515,0.0020997862,0.14119391,0.022682415,0.45141932,0.3251932,0.00011467253],"about_ca_topic_score_codex":0.0020866473,"about_ca_topic_score_gemma":0.0027901835,"teacher_disagreement_score":0.010655844,"about_ca_system_score_codex":0.0004641646,"about_ca_system_score_gemma":0.00042870632,"threshold_uncertainty_score":0.035647392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957236,0.00018354581,0.003287552,0.000004929731,8.6702795e-7,0.0000053616955,0.000323136,0.000051857358,0.00041914047],"genre_scores_gemma":[0.9966815,0.000034553846,0.0022006,0.0000053558606,8.428109e-7,0.000008300684,0.0009717987,0.0000123251,0.00008467901],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995235,0.00007160711,0.000038032787,0.00020488829,0.000105124316,0.000056893852],"domain_scores_gemma":[0.9979724,0.0011148894,0.000382556,0.00028658242,0.00013785907,0.00010561597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006919212,0.00023267596,0.00029557812,0.0015660037,0.00026850487,0.0004565352,0.00030023084,0.0002631909,0.0014569486],"category_scores_gemma":[0.0022577408,0.00013481601,0.00036509839,0.0017373353,0.0003079717,0.00038070715,0.0006445011,0.00028655585,0.00021435079],"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.0011906731,0.00009251396,0.6242306,0.000325606,0.00052655366,0.00040601348,0.000742957,0.0062246732,0.34327966,0.0010198678,0.00027459176,0.021686282],"study_design_scores_gemma":[0.0000122261445,0.00019756345,0.9490416,0.000013725226,0.00015069907,0.00060272095,0.00022821948,0.0106623145,0.03724048,0.000644444,0.0011920908,0.000013910529],"about_ca_topic_score_codex":0.0012758578,"about_ca_topic_score_gemma":0.0019657295,"teacher_disagreement_score":0.0015660037,"about_ca_system_score_codex":0.0002696521,"about_ca_system_score_gemma":0.00013034166,"threshold_uncertainty_score":0.004873991},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12874371,0.011998303,0.8197242,0.005380462,0.00051275623,0.00010821142,0.0002869893,0.00045434138,0.032791056],"genre_scores_gemma":[0.82120794,0.006079483,0.15157215,0.0009241549,0.0010611312,0.00038298525,0.0004038023,0.00045399932,0.017914271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994116,0.00027803314,0.000025884307,0.0001264622,0.00009303056,0.000065073014],"domain_scores_gemma":[0.98758274,0.010108139,0.0010120341,0.00034812273,0.00046438543,0.0004845366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001579615,0.0006712714,0.0006530844,0.0029466473,0.0009414209,0.0020465984,0.001197307,0.0014050022,0.006434595],"category_scores_gemma":[0.016369615,0.0003157471,0.0010311789,0.0021373976,0.0025310668,0.003989321,0.0020634672,0.0025051916,0.00079073507],"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.000047013804,0.00006221679,0.0013077117,0.00009516324,0.000023577835,0.000118845084,0.00032844892,0.026512254,0.0014000536,0.9498645,0.0031453099,0.01709487],"study_design_scores_gemma":[0.00001517998,0.000032470078,0.00046542907,0.000037847,0.000011769398,0.00011495495,0.00011321656,0.2133652,0.00059004145,0.78066003,0.0045716846,0.000022219585],"about_ca_topic_score_codex":0.0013084984,"about_ca_topic_score_gemma":0.0012363578,"teacher_disagreement_score":0.006434595,"about_ca_system_score_codex":0.0014062064,"about_ca_system_score_gemma":0.00043288912,"threshold_uncertainty_score":0.02152586},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20425381,0.0006372764,0.7747877,0.0007793403,0.00024673517,0.00022976895,0.00042884916,0.00062777667,0.018008808],"genre_scores_gemma":[0.5604654,0.0004793921,0.40797213,0.00048414178,0.00011345413,0.0004342974,0.0010863385,0.0006638245,0.02830112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940777,0.00018524464,0.000027431912,0.00015294821,0.00011268363,0.00011398222],"domain_scores_gemma":[0.9971846,0.0016043608,0.00017685488,0.0005511439,0.00020099158,0.00028198064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010681103,0.000947081,0.0015764972,0.00086895126,0.0011162333,0.0012378544,0.0022312966,0.0018543802,0.012490905],"category_scores_gemma":[0.0082864715,0.0008820154,0.0012118194,0.001218585,0.0017930296,0.0024492051,0.003173601,0.0020388549,0.0012258972],"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.0010107101,0.00015183953,0.0015871122,0.00031152376,0.00012664632,0.00045998424,0.00036201082,0.5972049,0.011291106,0.2683901,0.012807797,0.106296174],"study_design_scores_gemma":[0.00008254104,0.00011747904,0.00028981827,0.000034513687,0.000025662828,0.0001039294,0.000082460705,0.78236365,0.0016234603,0.21207768,0.003178648,0.000020162319],"about_ca_topic_score_codex":0.0018498527,"about_ca_topic_score_gemma":0.002543613,"teacher_disagreement_score":0.012490905,"about_ca_system_score_codex":0.00077771983,"about_ca_system_score_gemma":0.0007460322,"threshold_uncertainty_score":0.041786194},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4571687,0.0019110371,0.5114277,0.00065532007,0.000096984084,0.00008579802,0.00041709095,0.00028912188,0.027948298],"genre_scores_gemma":[0.91999227,0.0008339682,0.071474865,0.00014989704,0.0003180252,0.00009272643,0.00039799203,0.00007972087,0.00666056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993697,0.00013294342,0.0000491299,0.00017966483,0.00016739291,0.00010125693],"domain_scores_gemma":[0.99693716,0.0018023907,0.00044542112,0.00022213307,0.00030180032,0.0002911614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011090778,0.00032353823,0.00046985265,0.00232693,0.0012584272,0.002080625,0.0006377639,0.0005537334,0.0038614885],"category_scores_gemma":[0.0062644356,0.00034837535,0.0011035837,0.0016139662,0.0019074569,0.0029024924,0.0011469595,0.0013604693,0.00034438452],"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.00003753914,0.000020112655,0.003906654,0.00007027448,0.000012769103,0.00021040779,0.00035155742,0.0050526313,0.0022749142,0.9709411,0.0008830154,0.01623891],"study_design_scores_gemma":[0.000010871318,0.00006902607,0.0043960228,0.00003765498,0.000016375456,0.0006723176,0.000144606,0.046761345,0.001242676,0.9404384,0.0061793546,0.000031275333],"about_ca_topic_score_codex":0.00092345505,"about_ca_topic_score_gemma":0.0008577152,"teacher_disagreement_score":0.0038614885,"about_ca_system_score_codex":0.0009944807,"about_ca_system_score_gemma":0.00035061254,"threshold_uncertainty_score":0.012917936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08927178,0.0013226544,0.83490294,0.0008825074,0.0014722119,0.0008352911,0.0077956766,0.050161682,0.013355367],"genre_scores_gemma":[0.06354676,0.00020883785,0.9077956,0.000351236,0.000079227444,0.00055697846,0.017048547,0.005160155,0.005252755],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991153,0.00023175907,0.0000695252,0.00035483256,0.00014964133,0.000078990844],"domain_scores_gemma":[0.99794286,0.0006309553,0.00017897885,0.000785201,0.00032114846,0.00014079368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002709348,0.0012770017,0.00096553564,0.0025753863,0.0022647348,0.0016120486,0.0024130223,0.0012964822,0.0155299865],"category_scores_gemma":[0.0077335294,0.00069897634,0.0014053334,0.0017717016,0.0007181708,0.001479268,0.0031134365,0.0019059986,0.0064970665],"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.0021072312,0.00040235854,0.015555689,0.0019311453,0.0008490955,0.0012949384,0.0034516314,0.014407419,0.06520255,0.03803504,0.08373321,0.7730297],"study_design_scores_gemma":[0.00050773,0.0011639592,0.010706934,0.00036830365,0.00095488806,0.0023404118,0.0015501217,0.23904702,0.09444624,0.062520884,0.58620423,0.00018932592],"about_ca_topic_score_codex":0.001168128,"about_ca_topic_score_gemma":0.0033874693,"teacher_disagreement_score":0.0155299865,"about_ca_system_score_codex":0.00046971894,"about_ca_system_score_gemma":0.0010772203,"threshold_uncertainty_score":0.051953018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8197863,0.00013070831,0.17813666,0.00009230896,0.000010487779,0.000068303525,0.00036149778,0.00043199965,0.0009816409],"genre_scores_gemma":[0.8504303,0.000101607424,0.14750305,0.000037503614,0.000006177215,0.000091279086,0.0012694335,0.00016734858,0.00039324316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993856,0.00020558416,0.000032930406,0.00015333697,0.00014988637,0.00007274858],"domain_scores_gemma":[0.99411005,0.0040901485,0.0006104296,0.00047374523,0.0005099081,0.00020571148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445031,0.00040633517,0.0004479235,0.0011782084,0.00060083665,0.00072383735,0.0010104699,0.0008764894,0.0017545092],"category_scores_gemma":[0.010775562,0.0005005622,0.0006784743,0.0010595982,0.000916483,0.0009907915,0.0008300146,0.00082008686,0.00033228035],"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.00032232268,0.0000610363,0.028586578,0.000103645594,0.00008428401,0.00024765503,0.00043869778,0.9356567,0.020107472,0.0036709656,0.00018368002,0.010536813],"study_design_scores_gemma":[0.00001722674,0.00013366168,0.010579265,0.000027877859,0.000041646057,0.00014100506,0.00012263216,0.9766598,0.00676989,0.00496084,0.00052323384,0.000022959952],"about_ca_topic_score_codex":0.0025925399,"about_ca_topic_score_gemma":0.0027872385,"teacher_disagreement_score":0.0025925399,"about_ca_system_score_codex":0.0009359412,"about_ca_system_score_gemma":0.0005938154,"threshold_uncertainty_score":0.0076420903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034595046,0.00076847966,0.99037874,0.00041930188,0.000064274405,0.00003051257,0.00023230023,0.00058689684,0.0040599145],"genre_scores_gemma":[0.12810878,0.0021959932,0.8535288,0.00030534118,0.00022907488,0.0005353197,0.0020386989,0.00068933866,0.0123686185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916136,0.0003305205,0.00004712381,0.00019120832,0.00020165871,0.000068055175],"domain_scores_gemma":[0.99697316,0.002359656,0.00013223753,0.0003075424,0.00016289756,0.0000644516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452672,0.0014437223,0.0016365765,0.0013034497,0.0009991889,0.002683071,0.004525005,0.0030725452,0.009169238],"category_scores_gemma":[0.008589935,0.0015644975,0.0024155946,0.002809906,0.0017334766,0.005450678,0.002457031,0.0034822659,0.0024430673],"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.000078568235,0.0000397596,0.00024299585,0.00016448855,0.00004471938,0.00005335666,0.00010150656,0.58929026,0.00038610102,0.33635297,0.0068937,0.066351585],"study_design_scores_gemma":[0.000019059547,0.000006586979,0.00002428277,0.000016589744,0.000009161456,0.000021110298,0.000014045201,0.62598425,0.00015835156,0.37121156,0.0025271047,0.0000078567045],"about_ca_topic_score_codex":0.004454102,"about_ca_topic_score_gemma":0.004487658,"teacher_disagreement_score":0.009169238,"about_ca_system_score_codex":0.0016534132,"about_ca_system_score_gemma":0.0011265777,"threshold_uncertainty_score":0.03067422},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047887255,0.00054609246,0.91393,0.00058723794,0.00019779988,0.00014382083,0.00023011825,0.0012322871,0.035245452],"genre_scores_gemma":[0.38859004,0.0014095404,0.56765467,0.0007236457,0.0004731788,0.0004169994,0.0015620696,0.0018443946,0.03732544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978052,0.00083683373,0.00014045858,0.00046535034,0.00042213133,0.00033002876],"domain_scores_gemma":[0.99267393,0.00524534,0.00033712317,0.0011330869,0.00035220385,0.00025831177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002491745,0.0015701842,0.0014027408,0.0015699952,0.0011391112,0.0034946667,0.0022033532,0.0015552953,0.019895924],"category_scores_gemma":[0.011765856,0.0008051586,0.0023361093,0.0027637938,0.0035944514,0.0062070987,0.0032863033,0.003358399,0.0034422758],"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.00018369836,0.00008827866,0.00046590553,0.00016469897,0.000032274995,0.000075891505,0.00039021517,0.038220648,0.002118297,0.8613623,0.004608445,0.09228944],"study_design_scores_gemma":[0.000042013733,0.000050602615,0.000104653445,0.00004378623,0.000018343277,0.000075043085,0.00008462843,0.051909592,0.0012886325,0.93901795,0.007344221,0.00002052497],"about_ca_topic_score_codex":0.0018063602,"about_ca_topic_score_gemma":0.0025691886,"teacher_disagreement_score":0.019895924,"about_ca_system_score_codex":0.0016141183,"about_ca_system_score_gemma":0.0009278388,"threshold_uncertainty_score":0.06655848},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00212813,0.012963398,0.027183646,0.045346774,0.23122522,0.0005699197,0.017777191,0.0027199981,0.6600857],"genre_scores_gemma":[0.010548352,0.0051752604,0.0075135287,0.006880633,0.032515433,0.00034261687,0.012400291,0.0016029839,0.92302084],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936134,0.00010849142,0.00003584238,0.00012026694,0.0003229514,0.000051121096],"domain_scores_gemma":[0.9950747,0.0009057479,0.00014398083,0.00050781353,0.002652104,0.00071556424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012021832,0.00083840464,0.0006448077,0.0030077898,0.0019961894,0.002607955,0.0011279925,0.00075985986,0.41634414],"category_scores_gemma":[0.011456732,0.00024284332,0.0005055582,0.0022869022,0.0005100454,0.0020426656,0.0015638266,0.0024145572,0.25944132],"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.000020608915,0.000018699211,0.00008517282,0.000065185865,0.0000019458266,0.000026036512,0.000037216632,0.000103524166,0.00010026742,0.008044001,0.9467129,0.04478444],"study_design_scores_gemma":[0.00000477511,0.000010448138,0.00024187457,0.00008166377,0.0000021432902,0.000039059396,0.000044288765,0.00008235122,0.00012298305,0.008818245,0.99054724,0.0000049307687],"about_ca_topic_score_codex":0.0028325324,"about_ca_topic_score_gemma":0.003659153,"teacher_disagreement_score":0.41634414,"about_ca_system_score_codex":0.0018166275,"about_ca_system_score_gemma":0.0016859977,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023035545,0.0004177046,0.9618227,0.0006728061,0.00022349312,0.00026082783,0.0005507608,0.0025805098,0.010435522],"genre_scores_gemma":[0.09453342,0.0002710053,0.89562094,0.00025677454,0.00016131124,0.0003709704,0.0017485798,0.00051375316,0.0065232194],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836844,0.00030631668,0.00009036829,0.00039049488,0.0005209769,0.00032346297],"domain_scores_gemma":[0.9972186,0.0013888257,0.00013839066,0.0007725597,0.00031889207,0.00016268287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014248176,0.0017240675,0.0024176477,0.001541231,0.0012296154,0.0028306136,0.004791755,0.0024746151,0.016196717],"category_scores_gemma":[0.0054587102,0.0008992057,0.0018742024,0.0035036448,0.0011410285,0.0045661917,0.0039301584,0.0040839445,0.0034698183],"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.0012998728,0.000810252,0.0009005956,0.0005932271,0.00015168665,0.00024605822,0.00031555502,0.22058576,0.011780989,0.08199736,0.048625316,0.6326933],"study_design_scores_gemma":[0.00031180892,0.00012886754,0.00030252052,0.000034395547,0.00006876279,0.00019070198,0.00012137452,0.909258,0.0031306888,0.079309925,0.0071099107,0.00003298878],"about_ca_topic_score_codex":0.004484992,"about_ca_topic_score_gemma":0.0054119052,"teacher_disagreement_score":0.016196717,"about_ca_system_score_codex":0.0016256573,"about_ca_system_score_gemma":0.0028295575,"threshold_uncertainty_score":0.054183424},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21805777,0.00041363595,0.76686066,0.0020912264,0.00014160684,0.00035526225,0.0011117461,0.0019180485,0.009050098],"genre_scores_gemma":[0.69273823,0.00034622074,0.29924354,0.00071384414,0.00018674288,0.00034437666,0.0021982894,0.0003691706,0.0038595698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970361,0.00055508886,0.00020370279,0.0012746387,0.00053121825,0.00039928663],"domain_scores_gemma":[0.981556,0.013679246,0.0013007235,0.0024064754,0.0005331758,0.0005244035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00285636,0.0006993155,0.0008101318,0.00058741897,0.0013144917,0.0022033416,0.003114385,0.0015527029,0.0034100085],"category_scores_gemma":[0.015519406,0.0007835015,0.0021792909,0.0010780083,0.0034969486,0.007254827,0.0028939657,0.004524816,0.0003790173],"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.001093256,0.0003613764,0.0050397418,0.0007306924,0.00013483035,0.0015622788,0.0011149249,0.13207215,0.033946846,0.7464085,0.009003876,0.06853155],"study_design_scores_gemma":[0.00019689163,0.0002152422,0.00081554963,0.000039322258,0.000063035695,0.001064148,0.00022197879,0.27608317,0.02256629,0.6900075,0.008664286,0.000062563166],"about_ca_topic_score_codex":0.001573226,"about_ca_topic_score_gemma":0.0021255093,"teacher_disagreement_score":0.0034100085,"about_ca_system_score_codex":0.0017296012,"about_ca_system_score_gemma":0.0018218594,"threshold_uncertainty_score":0.015106022},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041854285,0.005989289,0.89104474,0.012121233,0.00048527424,0.0006051396,0.0033463857,0.0016078888,0.042945728],"genre_scores_gemma":[0.39974084,0.0061162845,0.5582887,0.0029814632,0.0019283085,0.0020221465,0.008951647,0.0012053911,0.018765206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449617,0.0017616148,0.00032730147,0.0013010385,0.0012314613,0.00088247855],"domain_scores_gemma":[0.9655626,0.03034184,0.0010024449,0.0014311075,0.0011153977,0.00054668623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004005677,0.0028402535,0.0024750496,0.002593122,0.002261823,0.00770075,0.0042505222,0.0036784252,0.012611284],"category_scores_gemma":[0.027785657,0.0010498556,0.002953461,0.004605358,0.00283147,0.010808379,0.0034147843,0.007426429,0.0017027289],"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.00046365111,0.0005150041,0.0024310441,0.0014792868,0.00024379339,0.0002365524,0.0005811455,0.37742165,0.0015346105,0.4694207,0.04107375,0.10459878],"study_design_scores_gemma":[0.00009508857,0.000036693385,0.0003156666,0.00006069,0.000042110554,0.000084621286,0.00010349673,0.40397486,0.00040396498,0.5901168,0.004744482,0.000021465346],"about_ca_topic_score_codex":0.004164666,"about_ca_topic_score_gemma":0.0044735735,"teacher_disagreement_score":0.012611284,"about_ca_system_score_codex":0.005154002,"about_ca_system_score_gemma":0.0034461613,"threshold_uncertainty_score":0.042188883},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39790064,0.0016228703,0.59255666,0.0011342326,0.00020416614,0.00020099836,0.0008265812,0.000954804,0.0045990404],"genre_scores_gemma":[0.81515217,0.00036118293,0.18153039,0.0002486532,0.00007115607,0.00024429095,0.0013804941,0.00039053036,0.00062115246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98157376,0.011176319,0.0013315483,0.0022752022,0.0030417505,0.0006013641],"domain_scores_gemma":[0.87770027,0.09508055,0.005790576,0.013832618,0.0056968937,0.0018990777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.049966425,0.0011780615,0.0021774375,0.0058487435,0.0014259707,0.004223446,0.001890361,0.0034285726,0.0021837084],"category_scores_gemma":[0.18253104,0.00069836684,0.0015697867,0.0026939565,0.005891077,0.005697797,0.0045347535,0.0026433622,0.0003938858],"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.0024599242,0.00016289315,0.04419287,0.00043154796,0.0011854137,0.0002452951,0.0006208148,0.767371,0.0084698675,0.11215943,0.001348219,0.06135283],"study_design_scores_gemma":[0.00027809033,0.0010107411,0.021405095,0.00018435773,0.00022834525,0.0005189781,0.0005838337,0.77341133,0.014577696,0.18474245,0.0028346663,0.00022448566],"about_ca_topic_score_codex":0.00097139244,"about_ca_topic_score_gemma":0.0013922063,"teacher_disagreement_score":0.049966425,"about_ca_system_score_codex":0.0019960126,"about_ca_system_score_gemma":0.0017355997,"threshold_uncertainty_score":0.26425087},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02687388,0.0029979094,0.9632943,0.002924137,0.00023784574,0.00007089919,0.00034667313,0.0010706403,0.0021837594],"genre_scores_gemma":[0.3664156,0.0024158412,0.6271534,0.00058907986,0.00038194915,0.0004462186,0.0008891727,0.00084810716,0.00086070533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957195,0.0030863364,0.00018962711,0.00032113655,0.00057894894,0.00010444726],"domain_scores_gemma":[0.9714968,0.02339842,0.00057071843,0.0033456276,0.0009231867,0.0002653027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011486239,0.000880524,0.0012813109,0.0019852729,0.0008973462,0.0024109592,0.0020776747,0.0019415212,0.0021737225],"category_scores_gemma":[0.05730147,0.0009800727,0.0018242238,0.0016234415,0.002355055,0.0030362844,0.0024163993,0.0039413422,0.0005698981],"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.0004082898,0.00011705684,0.006513263,0.00055625173,0.00059681025,0.00014798387,0.0003291075,0.60725754,0.0017442617,0.26444474,0.0037847797,0.11409995],"study_design_scores_gemma":[0.000031749078,0.000020444293,0.00047101852,0.00007552233,0.000017674967,0.00003037914,0.000032183638,0.8346744,0.000547781,0.16205703,0.0020156447,0.000026145932],"about_ca_topic_score_codex":0.0022464884,"about_ca_topic_score_gemma":0.001195613,"teacher_disagreement_score":0.011486239,"about_ca_system_score_codex":0.00090769277,"about_ca_system_score_gemma":0.0011592855,"threshold_uncertainty_score":0.060745716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17717771,0.0013504381,0.6578825,0.0028886667,0.00047616818,0.00023855535,0.00057090016,0.0007891303,0.15862587],"genre_scores_gemma":[0.7118794,0.0011738467,0.25281987,0.0013903938,0.00070797035,0.0002491016,0.0008421729,0.0005457348,0.03039145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898607,0.00031779634,0.00006405245,0.00023893842,0.00025657704,0.00013647982],"domain_scores_gemma":[0.9970464,0.0014951365,0.00031571745,0.00061938335,0.00029862917,0.00022466898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010944495,0.00049516035,0.00071610307,0.0009638985,0.0019166014,0.002110683,0.0008505803,0.0017174484,0.012484066],"category_scores_gemma":[0.005555394,0.00044068228,0.0007287689,0.0014015664,0.0037710688,0.005208938,0.0019014438,0.0032109958,0.0018119497],"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.000030785417,0.000016172848,0.0002939929,0.000022034983,0.000003640135,0.00010197466,0.00019480377,0.0025966307,0.0016225227,0.9840274,0.0007980345,0.01029211],"study_design_scores_gemma":[0.000015598182,0.00007005042,0.00024669507,0.000021327343,0.000008066134,0.00025676386,0.0000834438,0.010368175,0.001500821,0.96827555,0.019130394,0.000023069817],"about_ca_topic_score_codex":0.00083345425,"about_ca_topic_score_gemma":0.0009109565,"teacher_disagreement_score":0.012484066,"about_ca_system_score_codex":0.00061185414,"about_ca_system_score_gemma":0.00081538386,"threshold_uncertainty_score":0.041763365},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102018006,0.0028372344,0.8764442,0.0026659288,0.00045150812,0.00016401605,0.00051699154,0.0027778777,0.012124291],"genre_scores_gemma":[0.489454,0.0018562413,0.49452093,0.0011020695,0.00025391195,0.00019260168,0.0013814853,0.0006757967,0.010563042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986104,0.00021606585,0.00007250198,0.00052331266,0.0003873478,0.0001903426],"domain_scores_gemma":[0.9964742,0.0019058638,0.0002736466,0.0008621926,0.00029394412,0.00019001932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012399541,0.0007429244,0.0013577318,0.0007420396,0.001209252,0.002244921,0.00326466,0.0015591892,0.008350565],"category_scores_gemma":[0.0063525476,0.00046997334,0.0014306356,0.001812023,0.0013822253,0.0054542106,0.0034189082,0.004050035,0.0011183491],"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.0009862926,0.00025397554,0.0039105923,0.00073914794,0.0001591694,0.0008182613,0.000857358,0.19176649,0.036036015,0.31752026,0.017307788,0.42964455],"study_design_scores_gemma":[0.0001980375,0.00042092218,0.0019688369,0.00016044731,0.00020142314,0.0015882832,0.00046227712,0.54885393,0.0633237,0.31222895,0.07049103,0.00010210116],"about_ca_topic_score_codex":0.0027827928,"about_ca_topic_score_gemma":0.0019373539,"teacher_disagreement_score":0.008350565,"about_ca_system_score_codex":0.0015028236,"about_ca_system_score_gemma":0.0014595761,"threshold_uncertainty_score":0.027935386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5600566,0.0008073232,0.37572974,0.0019664061,0.0001474174,0.000076849385,0.0010540135,0.0015953879,0.05856619],"genre_scores_gemma":[0.9521691,0.00045512055,0.034080807,0.00025882336,0.00008579754,0.00011189757,0.0008956105,0.00043616115,0.011506702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947995,0.0001230641,0.000022101156,0.00011815695,0.00014349267,0.00011331833],"domain_scores_gemma":[0.9954602,0.0025860756,0.0005583377,0.00048935076,0.00038505657,0.0005209767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011446908,0.00040844904,0.00048050078,0.0033250249,0.0010748964,0.0024361531,0.0013077671,0.00093788235,0.01110637],"category_scores_gemma":[0.0109113045,0.00030238647,0.0004080614,0.0013850617,0.0015458696,0.004018289,0.0016072264,0.0012462706,0.001370349],"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.00015415435,0.00006566303,0.003525544,0.00009480289,0.000016463371,0.000112617076,0.00028002856,0.020561099,0.0028108004,0.93197745,0.008157853,0.032243434],"study_design_scores_gemma":[0.00002820976,0.000023465534,0.0017141519,0.000041089297,0.000011420972,0.00019615098,0.00020828695,0.12872437,0.0021043087,0.8620022,0.0049212854,0.000025059051],"about_ca_topic_score_codex":0.00074675307,"about_ca_topic_score_gemma":0.0011147048,"teacher_disagreement_score":0.01110637,"about_ca_system_score_codex":0.0014152445,"about_ca_system_score_gemma":0.00046326462,"threshold_uncertainty_score":0.037154496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069154967,0.00037374126,0.98850995,0.000587783,0.000034890825,0.0000776826,0.00020737578,0.00036134777,0.0029318116],"genre_scores_gemma":[0.12459045,0.00078327395,0.8661587,0.0002624658,0.00015081861,0.0007226091,0.0011721674,0.00033941746,0.005820074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840707,0.0006264406,0.00007915512,0.00039558843,0.0003014666,0.0001903131],"domain_scores_gemma":[0.9936666,0.0049842233,0.0004080465,0.00043047057,0.00036032152,0.00015030682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024166014,0.001495357,0.0014680156,0.0014174167,0.0012416051,0.0024165763,0.0039527537,0.0035021438,0.007754796],"category_scores_gemma":[0.010075551,0.0010793415,0.00219528,0.0033877352,0.0015850102,0.0050266893,0.0024708984,0.0037963723,0.0014405643],"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.000059562684,0.000085048596,0.0005306013,0.0001906484,0.000053994892,0.000051636067,0.00014186715,0.78804123,0.0003881616,0.16354626,0.004311215,0.04259986],"study_design_scores_gemma":[0.000027349428,0.000011816892,0.000057699366,0.000016876593,0.000010840872,0.000027444821,0.000022736245,0.79950434,0.00016448309,0.1982223,0.0019264523,0.000007729696],"about_ca_topic_score_codex":0.0043932856,"about_ca_topic_score_gemma":0.0053392663,"teacher_disagreement_score":0.007754796,"about_ca_system_score_codex":0.0033872295,"about_ca_system_score_gemma":0.0021275927,"threshold_uncertainty_score":0.025942385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002832777,0.9503002,0.042426463,0.0005652669,0.00022485117,0.000018996143,0.00017702527,0.00017670733,0.003277552],"genre_scores_gemma":[0.01708854,0.9310946,0.047322277,0.0003130088,0.00027275167,0.000045718556,0.0005724161,0.000065800195,0.003224856],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970406,0.000049520368,0.000017222334,0.00012128369,0.000093897455,0.000013871117],"domain_scores_gemma":[0.9994074,0.00036970965,0.000053172098,0.000038602444,0.000115966875,0.000015168896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008198126,0.00060275925,0.0011962462,0.0021611864,0.0001923718,0.0011127102,0.0010822739,0.0006461386,0.0014155417],"category_scores_gemma":[0.0015751446,0.00042242714,0.00062830595,0.0024048437,0.000767337,0.0016094192,0.00050654565,0.001008332,0.0015540088],"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.00005758914,0.000026576798,0.00081651827,0.0055845156,0.00011036682,0.00009639363,0.000064173495,0.0050631296,0.017651072,0.018534992,0.0053391187,0.9466555],"study_design_scores_gemma":[0.000031054067,0.00017663887,0.007429831,0.0029170262,0.00030477412,0.0021167535,0.00013577462,0.020080201,0.045076594,0.072690696,0.8488955,0.00014517576],"about_ca_topic_score_codex":0.0010964365,"about_ca_topic_score_gemma":0.0010586719,"teacher_disagreement_score":0.0021611864,"about_ca_system_score_codex":0.0008444589,"about_ca_system_score_gemma":0.0008064359,"threshold_uncertainty_score":0.0061270595},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09138888,0.00022403423,0.9038665,0.00029759383,0.00002537804,0.000049165752,0.0006218107,0.0004965948,0.0030299996],"genre_scores_gemma":[0.38303274,0.00023928269,0.6107511,0.00014680007,0.000034361856,0.00017826652,0.0016561947,0.0003264091,0.0036348568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993242,0.00015790001,0.000027986147,0.00028795534,0.00012156687,0.000080457066],"domain_scores_gemma":[0.99863005,0.00080944964,0.00017151482,0.00018858592,0.00008960081,0.00011077357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010431092,0.0006143604,0.0011962792,0.0011348326,0.0010510619,0.0014412552,0.0020590748,0.001532755,0.0072247186],"category_scores_gemma":[0.003533775,0.0006119253,0.0020078516,0.0014748914,0.0011580008,0.0035170976,0.0017048377,0.0016894853,0.0005884593],"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.00021218327,0.00011338574,0.0021270558,0.0001711099,0.00005857609,0.00015219064,0.0002023335,0.8176565,0.005229057,0.09855509,0.003242638,0.07227978],"study_design_scores_gemma":[0.000023001317,0.0000802394,0.00043819274,0.000019253028,0.000017476534,0.00010595449,0.00008531507,0.86050916,0.0025511328,0.13254127,0.0036042915,0.000024635427],"about_ca_topic_score_codex":0.0029429917,"about_ca_topic_score_gemma":0.003271651,"teacher_disagreement_score":0.0072247186,"about_ca_system_score_codex":0.0018022945,"about_ca_system_score_gemma":0.0011577173,"threshold_uncertainty_score":0.024169087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008000239,0.00045088012,0.885009,0.00026562484,0.0001631224,0.0006462287,0.01381304,0.08948058,0.0021712382],"genre_scores_gemma":[0.01843232,0.0003173448,0.9365509,0.00016432996,0.00002915072,0.0013043693,0.033678375,0.008457336,0.0010659113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843496,0.0002674693,0.00014355812,0.0005339311,0.00047099276,0.00014908277],"domain_scores_gemma":[0.9976649,0.00081041333,0.00027617769,0.0004031724,0.0005764695,0.00026888362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004457687,0.0022159417,0.0014691413,0.0024276518,0.0016231254,0.0020961252,0.0031404314,0.0010197574,0.012105494],"category_scores_gemma":[0.0053825304,0.0015925574,0.0022428841,0.0016640606,0.0006750392,0.0016494275,0.0032198476,0.0035850895,0.008912188],"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.0024714312,0.00068680104,0.008735558,0.0051859226,0.0010337302,0.0013657614,0.0016407558,0.024519082,0.33187336,0.024561808,0.23745136,0.36047444],"study_design_scores_gemma":[0.0008466348,0.00068393664,0.016499538,0.0007070314,0.00041096786,0.0018113058,0.00036418397,0.2779514,0.21204731,0.035078403,0.45302457,0.00057472417],"about_ca_topic_score_codex":0.0018825307,"about_ca_topic_score_gemma":0.002716836,"teacher_disagreement_score":0.012105494,"about_ca_system_score_codex":0.0012394766,"about_ca_system_score_gemma":0.0032410105,"threshold_uncertainty_score":0.040496886},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041525136,0.000054030195,0.98073155,0.0003126266,0.00004084633,0.00017061265,0.00085391954,0.011639423,0.0020445012],"genre_scores_gemma":[0.11013038,0.00014056978,0.8797709,0.00032612964,0.00008508217,0.00075415586,0.0034544733,0.0023619977,0.0029764515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652475,0.0011023902,0.00033371575,0.0009201148,0.0007468882,0.00037214698],"domain_scores_gemma":[0.9820765,0.0139966365,0.0006160955,0.0013023507,0.0016932167,0.00031515973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003846649,0.0018955093,0.0011462425,0.0014820534,0.0011242047,0.002313073,0.0031765155,0.0019633444,0.01954983],"category_scores_gemma":[0.02055389,0.00096345413,0.003050618,0.0012735607,0.0018449594,0.0039258525,0.004157973,0.0030812274,0.0037116355],"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.0016399255,0.0006609123,0.006343098,0.0022031965,0.00030493623,0.0014294928,0.00090041844,0.32970324,0.017827705,0.28388518,0.042799324,0.3123026],"study_design_scores_gemma":[0.00018023583,0.000105524494,0.00027071236,0.00009888512,0.00005236805,0.00021909016,0.00006610882,0.824439,0.0071280575,0.15425703,0.013151786,0.00003128238],"about_ca_topic_score_codex":0.0026646953,"about_ca_topic_score_gemma":0.0025758974,"teacher_disagreement_score":0.01954983,"about_ca_system_score_codex":0.0018150356,"about_ca_system_score_gemma":0.0027013868,"threshold_uncertainty_score":0.06540066},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012089511,0.00019404182,0.9725896,0.00012030429,0.00006991603,0.00012670219,0.00051921373,0.01247579,0.0018149485],"genre_scores_gemma":[0.058157958,0.00012299717,0.9344675,0.000113981936,0.000035824505,0.0001837106,0.0029560917,0.0014253063,0.0025367236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940395,0.00009096533,0.000034788383,0.00021700191,0.00017921475,0.00007416858],"domain_scores_gemma":[0.9987765,0.0004480672,0.00011548986,0.0002589875,0.00029611198,0.00010486349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007116429,0.0016184472,0.0012871474,0.002369839,0.0013243563,0.0013017557,0.0022498746,0.001151252,0.0075406577],"category_scores_gemma":[0.0025262812,0.00073305954,0.0013678689,0.0021825067,0.0008879238,0.0018829824,0.0019712474,0.0010942926,0.0033802781],"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.00070096937,0.00023124104,0.0028703772,0.0006346715,0.00012972584,0.00048985577,0.00042544637,0.17187595,0.05167838,0.021609196,0.030888047,0.7184662],"study_design_scores_gemma":[0.00019285307,0.00018506532,0.0006158966,0.000044912587,0.00006270081,0.00027678037,0.00015186648,0.93876946,0.019820219,0.021323564,0.018506568,0.000050144434],"about_ca_topic_score_codex":0.004847378,"about_ca_topic_score_gemma":0.00661785,"teacher_disagreement_score":0.0075406577,"about_ca_system_score_codex":0.00089495577,"about_ca_system_score_gemma":0.0017585618,"threshold_uncertainty_score":0.025225937},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07063054,0.00024503545,0.92516845,0.00022043234,0.00003283253,0.000077071556,0.00015551236,0.0011437958,0.0023263232],"genre_scores_gemma":[0.3686398,0.00018431051,0.62550765,0.00010861365,0.00005197433,0.00014572697,0.0011717987,0.00030864807,0.0038815022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977149,0.00062892714,0.00010217937,0.001047913,0.00030711526,0.00019903785],"domain_scores_gemma":[0.99683905,0.0011975873,0.00052306236,0.0008453597,0.00043403156,0.00016091853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021788254,0.0010028401,0.0018326141,0.0022420082,0.0013193394,0.0017435157,0.0013924583,0.0016497887,0.0039518434],"category_scores_gemma":[0.008129498,0.0006606527,0.0012373833,0.0025059949,0.0015864492,0.0031259062,0.001860643,0.0010793066,0.001574799],"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.00034744068,0.00016158924,0.0063396352,0.0001543524,0.000079670055,0.000152967,0.0004025458,0.4792563,0.013275903,0.05208095,0.004484318,0.44326442],"study_design_scores_gemma":[0.00003716488,0.00014051143,0.001604808,0.000019259422,0.000021872333,0.00015285308,0.00019875378,0.88999325,0.009765358,0.09464209,0.0033946047,0.000029440358],"about_ca_topic_score_codex":0.0020021687,"about_ca_topic_score_gemma":0.0016790071,"teacher_disagreement_score":0.0039518434,"about_ca_system_score_codex":0.0011449002,"about_ca_system_score_gemma":0.0012677797,"threshold_uncertainty_score":0.013220251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07971445,0.00040054266,0.9129457,0.00082241726,0.00004288555,0.00007353984,0.0001382228,0.00055587466,0.0053063463],"genre_scores_gemma":[0.5052973,0.00029823027,0.4891855,0.0005961512,0.00008817037,0.00022089237,0.00046001142,0.00048801064,0.003365678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981968,0.00071997615,0.000086168504,0.00046201062,0.0003826172,0.00015251803],"domain_scores_gemma":[0.995002,0.0031490168,0.00042767628,0.00086589874,0.00033007597,0.00022523441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038246962,0.0007201593,0.0011437584,0.0008953588,0.00078815286,0.0014271316,0.0018697288,0.0015516542,0.0054496755],"category_scores_gemma":[0.012986916,0.00059045793,0.0009106797,0.0009678703,0.0018041288,0.00408137,0.0036107735,0.0020786952,0.0010192133],"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.0008752971,0.00026770006,0.008729014,0.0003976732,0.00021714559,0.00017619063,0.00082882214,0.45797566,0.013627818,0.26869026,0.0067452043,0.24146925],"study_design_scores_gemma":[0.00008467433,0.00040823693,0.001152232,0.00009372773,0.000060488514,0.00027724536,0.00024617006,0.6943236,0.010159999,0.28354934,0.009609006,0.00003527759],"about_ca_topic_score_codex":0.00045887748,"about_ca_topic_score_gemma":0.0004870159,"teacher_disagreement_score":0.0054496755,"about_ca_system_score_codex":0.00109606,"about_ca_system_score_gemma":0.000666453,"threshold_uncertainty_score":0.020227194},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15407516,0.0011945508,0.69917476,0.0016117081,0.00057834433,0.00031215439,0.0022428718,0.002471863,0.13833861],"genre_scores_gemma":[0.6262183,0.0012229303,0.30004975,0.0010318633,0.00028234304,0.000292313,0.0060965894,0.0006213256,0.06418452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994301,0.00015996545,0.0000309863,0.00018275666,0.00012405044,0.0000720754],"domain_scores_gemma":[0.9979766,0.00092956045,0.00022895052,0.00042447157,0.00026091994,0.00017961091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005030154,0.0005427894,0.00044047923,0.0011294784,0.00096589944,0.0022554486,0.001331417,0.00074002414,0.01985084],"category_scores_gemma":[0.004049889,0.0004317723,0.00076996186,0.0012512369,0.00081379106,0.00332658,0.0011441365,0.001342305,0.0030382844],"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.00012032461,0.00011430869,0.00087635155,0.00018952043,0.00007337514,0.000249085,0.00016329599,0.013066445,0.0063925465,0.8932613,0.018201068,0.06729246],"study_design_scores_gemma":[0.000056016663,0.00006437587,0.00067397265,0.00004247359,0.000058942933,0.00037242283,0.00016421561,0.051771887,0.004870332,0.90773463,0.034160413,0.00003032323],"about_ca_topic_score_codex":0.0017244074,"about_ca_topic_score_gemma":0.0035499022,"teacher_disagreement_score":0.01985084,"about_ca_system_score_codex":0.0008140283,"about_ca_system_score_gemma":0.000986238,"threshold_uncertainty_score":0.06640768},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029466064,0.019180533,0.29115227,0.0030657805,0.0024944262,0.0001308118,0.0012959017,0.0017086166,0.678025],"genre_scores_gemma":[0.106285855,0.031575076,0.29978874,0.002914087,0.0045278645,0.00075524376,0.0058157896,0.0030494693,0.54528785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909675,0.0001891457,0.000036026282,0.00019392074,0.00042299106,0.00006122307],"domain_scores_gemma":[0.99934465,0.0002721022,0.000025382395,0.0001951668,0.00011442973,0.00004819581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068984454,0.0017658276,0.0014980756,0.0017851526,0.0009374021,0.0038551202,0.0018609378,0.0011703868,0.055283777],"category_scores_gemma":[0.0025105462,0.00068644417,0.0011895978,0.0030943467,0.0012426891,0.0024127674,0.0017485954,0.003949224,0.023775324],"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.000037940525,0.00009326245,0.00015738708,0.00037261072,0.000056026653,0.000054167587,0.00005712814,0.010890554,0.0007049148,0.47154036,0.19307613,0.32295948],"study_design_scores_gemma":[0.00002893919,0.000023137047,0.00021822241,0.00013271678,0.000025294876,0.00016973507,0.000028350105,0.018994,0.0005701226,0.6988205,0.28097206,0.000016958451],"about_ca_topic_score_codex":0.00084063184,"about_ca_topic_score_gemma":0.0011948848,"teacher_disagreement_score":0.055283777,"about_ca_system_score_codex":0.0019275161,"about_ca_system_score_gemma":0.0011540239,"threshold_uncertainty_score":0.18494266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28180718,0.0004978069,0.7104416,0.0015832286,0.0000871162,0.00019987512,0.00067620014,0.001567945,0.0031390649],"genre_scores_gemma":[0.5369205,0.00017450655,0.4570745,0.00029460777,0.00006893063,0.00013173842,0.0014297185,0.00037626218,0.0035293142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971455,0.0007656392,0.00015248504,0.0010205656,0.00051899493,0.00039685247],"domain_scores_gemma":[0.9820294,0.012370197,0.0017600805,0.002212563,0.0011635922,0.00046408817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002949107,0.0010952725,0.0013034622,0.0011452242,0.0009055858,0.0017214164,0.004200686,0.0020767406,0.004673067],"category_scores_gemma":[0.022224724,0.00079998333,0.0017293659,0.002098175,0.0016871144,0.005155816,0.0023653316,0.0021888523,0.0005525669],"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.0007346104,0.00026941122,0.006202093,0.00048416023,0.00012785304,0.00029253296,0.00050259806,0.8054592,0.007949971,0.038049787,0.005183961,0.13474382],"study_design_scores_gemma":[0.0000490366,0.000069031055,0.0006183683,0.000019528195,0.000038744485,0.00016912313,0.00012640237,0.9470967,0.0038700453,0.04705356,0.0008756497,0.000013765533],"about_ca_topic_score_codex":0.008793586,"about_ca_topic_score_gemma":0.009922403,"teacher_disagreement_score":0.008793586,"about_ca_system_score_codex":0.0028765365,"about_ca_system_score_gemma":0.0021469092,"threshold_uncertainty_score":0.020870805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031388152,0.0013254443,0.9400983,0.0014035214,0.0005202879,0.00043931082,0.0008723439,0.0026772027,0.021275429],"genre_scores_gemma":[0.09422686,0.00049422326,0.8954305,0.0004106127,0.00024312921,0.00053034106,0.0019297877,0.0005794829,0.0061550364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748886,0.000551878,0.00012504082,0.00058587966,0.00076435885,0.0004839162],"domain_scores_gemma":[0.99687576,0.0016577557,0.00016487946,0.0007136997,0.00039363754,0.00019435868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017504577,0.0022154755,0.002906898,0.0019189452,0.0016314697,0.0040496,0.0055175726,0.002708316,0.013394469],"category_scores_gemma":[0.00775899,0.0010190032,0.0022772818,0.005039586,0.0013200288,0.00611545,0.0036121255,0.0048281588,0.0030548512],"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.0013875014,0.0008694404,0.0009354062,0.0006325201,0.00016900907,0.00020544199,0.00041763636,0.29252595,0.0066593844,0.09292555,0.04956564,0.55370647],"study_design_scores_gemma":[0.00042837713,0.0001679719,0.00035475357,0.000058450834,0.00008426558,0.00021962516,0.00015358282,0.89000684,0.0017422527,0.095591314,0.011153523,0.000039082744],"about_ca_topic_score_codex":0.005925424,"about_ca_topic_score_gemma":0.007929179,"teacher_disagreement_score":0.013394469,"about_ca_system_score_codex":0.0031097415,"about_ca_system_score_gemma":0.0036282039,"threshold_uncertainty_score":0.044808984},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035422754,0.0025588383,0.841784,0.0057540275,0.00091669563,0.00047990598,0.0016649568,0.002580407,0.108838394],"genre_scores_gemma":[0.36061716,0.003790483,0.56401235,0.0017092975,0.0004664542,0.00059422286,0.006327062,0.0010280202,0.061454926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988463,0.00031199047,0.00006378018,0.0003949526,0.0002384736,0.00014442074],"domain_scores_gemma":[0.9978067,0.00088471314,0.00018052958,0.00077203294,0.00015451058,0.00020150327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006643678,0.00085196045,0.0009834742,0.0006958051,0.0023095545,0.0029611378,0.0013280774,0.0012208807,0.034503646],"category_scores_gemma":[0.0046182377,0.00065100106,0.001815485,0.0019886286,0.0015157263,0.006332707,0.0033590505,0.0021928821,0.0064611966],"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.00027587102,0.00011314309,0.0010904232,0.00069799233,0.00011753513,0.00046042854,0.00055968325,0.06465387,0.00421803,0.5497007,0.080592126,0.2975202],"study_design_scores_gemma":[0.000041560445,0.00008403627,0.0007098,0.00013623637,0.00005318628,0.00093009433,0.0003908169,0.08047409,0.0042204885,0.70669883,0.20621958,0.000041277348],"about_ca_topic_score_codex":0.0014284212,"about_ca_topic_score_gemma":0.0015057514,"teacher_disagreement_score":0.034503646,"about_ca_system_score_codex":0.001123076,"about_ca_system_score_gemma":0.00091964746,"threshold_uncertainty_score":0.11542618},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30566117,0.002768106,0.2547807,0.0039885747,0.00089742464,0.00027406475,0.0014197045,0.0007292049,0.429481],"genre_scores_gemma":[0.77492,0.0031467166,0.07548385,0.0012923143,0.0007158288,0.00026939187,0.0024778487,0.0010091781,0.14068492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993481,0.00013211726,0.00003042095,0.00017680894,0.00017279324,0.00013981151],"domain_scores_gemma":[0.99514055,0.0032753372,0.00027269174,0.0005786835,0.000366315,0.00036633108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057867443,0.0008827935,0.0011334108,0.0012867337,0.0021629906,0.0028063154,0.0014758869,0.0012797797,0.013835489],"category_scores_gemma":[0.006402659,0.000844172,0.0010048465,0.0017868988,0.0027338215,0.0070145223,0.0029223212,0.0038566678,0.0028289722],"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.00011283902,0.000030710948,0.00043070136,0.00020744755,0.000016583579,0.00020999016,0.00048260376,0.003377644,0.0019386746,0.96388584,0.00787162,0.021435238],"study_design_scores_gemma":[0.000013702072,0.000010305982,0.00014858763,0.00003180979,0.000008946379,0.00012404227,0.00012317127,0.0038557374,0.00041163765,0.98937595,0.0058895526,0.000006552356],"about_ca_topic_score_codex":0.0012940206,"about_ca_topic_score_gemma":0.0018086496,"teacher_disagreement_score":0.013835489,"about_ca_system_score_codex":0.0012465465,"about_ca_system_score_gemma":0.00047173773,"threshold_uncertainty_score":0.046284318},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07833755,0.0015687582,0.8118027,0.0009572421,0.0004050521,0.0002172461,0.016847726,0.08161362,0.00825009],"genre_scores_gemma":[0.20855579,0.0012525053,0.75435615,0.00029522614,0.000064170876,0.00044789244,0.022061309,0.008396442,0.004570488],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997327,0.00005537309,0.000020491952,0.00007940093,0.00008231037,0.000029667643],"domain_scores_gemma":[0.999146,0.0003123148,0.00012140849,0.00014646363,0.00019337166,0.00008047549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063086156,0.0008442123,0.0005392498,0.002035334,0.00027975984,0.0009100903,0.00083163596,0.00086524157,0.014458585],"category_scores_gemma":[0.0019357124,0.0003402864,0.0005384848,0.0011451441,0.00022828282,0.00089884544,0.0009359684,0.0009486385,0.0036649792],"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.0020892564,0.00022396777,0.005569507,0.0038689012,0.00024172054,0.0015217591,0.0014094173,0.0117164,0.5997658,0.018807076,0.064609244,0.290177],"study_design_scores_gemma":[0.00042180996,0.0006460099,0.020349374,0.0008812209,0.0003096207,0.0036014896,0.0009834584,0.16826057,0.47051308,0.025881683,0.3077646,0.00038709858],"about_ca_topic_score_codex":0.00094536686,"about_ca_topic_score_gemma":0.00057350565,"teacher_disagreement_score":0.014458585,"about_ca_system_score_codex":0.00029191002,"about_ca_system_score_gemma":0.0005986893,"threshold_uncertainty_score":0.04836881},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013124643,0.00014076127,0.97743165,0.00032736527,0.00013989354,0.00018294918,0.00025790965,0.0032235035,0.005171317],"genre_scores_gemma":[0.070513606,0.00022076812,0.9110814,0.00019477573,0.00016835019,0.0005284716,0.0011809302,0.0014907855,0.014620911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942491,0.0017116055,0.00027745773,0.0014348602,0.0017806005,0.0005463579],"domain_scores_gemma":[0.98599863,0.009587708,0.00036284738,0.002406437,0.001309802,0.000334626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055806027,0.0028490506,0.002194215,0.001683353,0.0015923155,0.005186408,0.005058762,0.00399104,0.02118224],"category_scores_gemma":[0.021749029,0.0016831366,0.0035600574,0.0019558019,0.002301197,0.005011064,0.0024863547,0.0062801754,0.009338785],"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.0015595629,0.0006509883,0.0021665182,0.0004169583,0.0003499971,0.00034463828,0.0006283999,0.21611474,0.01229214,0.19395934,0.01959771,0.55191904],"study_design_scores_gemma":[0.0005801299,0.00023419995,0.000807063,0.00006419643,0.00010421521,0.00032966567,0.00020121099,0.8859811,0.015439011,0.08020219,0.015987463,0.00006949218],"about_ca_topic_score_codex":0.006805472,"about_ca_topic_score_gemma":0.010439863,"teacher_disagreement_score":0.02118224,"about_ca_system_score_codex":0.0023740488,"about_ca_system_score_gemma":0.0028496033,"threshold_uncertainty_score":0.07086164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8926086,0.00772282,0.09140955,0.00098754,0.00009938488,0.0000642538,0.0008370675,0.00060142425,0.0056694048],"genre_scores_gemma":[0.98794323,0.001631229,0.0082406085,0.00031045664,0.000032519616,0.000038250982,0.00048206918,0.00006242179,0.0012592323],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9997888,0.00002217361,0.0000141096025,0.0001188112,0.00002675684,0.000029384033],"domain_scores_gemma":[0.999458,0.00013173986,0.0002317349,0.00008790357,0.0000471085,0.000043604738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062621926,0.00035558775,0.0003778257,0.0006881679,0.00049484,0.00062452233,0.0007745919,0.00096789387,0.0022684042],"category_scores_gemma":[0.0012230555,0.0002888944,0.00047691236,0.0006327321,0.00072047027,0.0012096426,0.0010006102,0.00073455006,0.00063566666],"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.00036512746,0.00004785257,0.17716703,0.001004398,0.00030787574,0.0017309432,0.0012725983,0.014138148,0.71433336,0.039247137,0.001133028,0.049252484],"study_design_scores_gemma":[0.000091506656,0.0005836466,0.67228335,0.00027393157,0.0003824643,0.006175416,0.001746945,0.08901103,0.09777208,0.0751661,0.056278102,0.00023545836],"about_ca_topic_score_codex":0.0010409253,"about_ca_topic_score_gemma":0.0011610211,"teacher_disagreement_score":0.0022684042,"about_ca_system_score_codex":0.0007700392,"about_ca_system_score_gemma":0.00037131252,"threshold_uncertainty_score":0.0075885653},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27894238,0.0014261893,0.70674163,0.0017461744,0.00024439036,0.00022173856,0.0010198978,0.0013621805,0.008295451],"genre_scores_gemma":[0.8819597,0.0011479743,0.10264935,0.00067071535,0.0005923735,0.00069104985,0.0026681593,0.000692321,0.008928401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963652,0.0016540246,0.00016486921,0.00080151163,0.0006181054,0.00039627557],"domain_scores_gemma":[0.9419609,0.046294138,0.0029114452,0.0045094294,0.0023838675,0.0019402417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009111476,0.0011876469,0.0027031114,0.0042226,0.0015059335,0.0040620756,0.005045268,0.003536343,0.009801316],"category_scores_gemma":[0.07267148,0.0017941761,0.001536754,0.0028910583,0.0042495537,0.007663343,0.0038993666,0.0039791884,0.0013394833],"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.0011037003,0.00029344743,0.008074659,0.00032560586,0.00019236385,0.0002468435,0.0005150408,0.28611812,0.003184833,0.6507459,0.0077954265,0.041403927],"study_design_scores_gemma":[0.00010752146,0.00009751102,0.0013865742,0.000086491054,0.000034273755,0.00014186595,0.000121006815,0.63226825,0.0011328141,0.36337033,0.0012029877,0.00005039391],"about_ca_topic_score_codex":0.0014695689,"about_ca_topic_score_gemma":0.0019292001,"teacher_disagreement_score":0.009801316,"about_ca_system_score_codex":0.0024404514,"about_ca_system_score_gemma":0.0018004245,"threshold_uncertainty_score":0.04818666},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068605945,0.0005544132,0.92713815,0.00038204328,0.00004513617,0.00008117408,0.00050351385,0.0016005574,0.0010890315],"genre_scores_gemma":[0.6239795,0.0003941075,0.37165585,0.00015202393,0.00009533723,0.00017428634,0.001702671,0.00013293316,0.0017133132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961183,0.00085032196,0.0002981734,0.0008552712,0.0015881675,0.00028985328],"domain_scores_gemma":[0.98616785,0.0076435283,0.0011726214,0.003685774,0.0010722195,0.0002579452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018404576,0.00070022244,0.0014354392,0.0017949458,0.00061942026,0.0017403075,0.0020357207,0.0012475348,0.0017643009],"category_scores_gemma":[0.016077215,0.0003724912,0.00091177283,0.0026707838,0.0010204735,0.003819237,0.0023757876,0.0018040232,0.0005561371],"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.00079375977,0.00018665913,0.0037348492,0.00028649668,0.00012405893,0.00031388752,0.0003433085,0.66917384,0.008785359,0.056867782,0.0030310052,0.25635892],"study_design_scores_gemma":[0.000027193766,0.00007985911,0.00040639105,0.000013469866,0.000014768013,0.00019909686,0.00004989907,0.9484981,0.0045064157,0.044922173,0.0012719149,0.000010741858],"about_ca_topic_score_codex":0.0023021202,"about_ca_topic_score_gemma":0.0017266308,"teacher_disagreement_score":0.0023021202,"about_ca_system_score_codex":0.0018870815,"about_ca_system_score_gemma":0.0015354339,"threshold_uncertainty_score":0.013691783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01463576,0.00056642375,0.95987517,0.0009450691,0.00015820019,0.000079707075,0.0004703603,0.0003370833,0.022932235],"genre_scores_gemma":[0.33007652,0.0013640523,0.6137166,0.0007682244,0.00066547084,0.0004308167,0.0015566616,0.00080000184,0.050621696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983273,0.00039114407,0.00006515118,0.0005894572,0.0004370476,0.00019000412],"domain_scores_gemma":[0.99590826,0.0027860487,0.00021788177,0.0007122938,0.00021868885,0.00015680074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016090744,0.0010154374,0.0016618345,0.00086801074,0.0012315137,0.0030810563,0.005207577,0.0023951957,0.014034434],"category_scores_gemma":[0.009691479,0.00078009686,0.0019437651,0.0027546515,0.0025832877,0.00641145,0.0030289895,0.0045984318,0.0019306182],"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.0000860661,0.000049280476,0.00026813053,0.00016625025,0.000049040013,0.00020555437,0.0001546425,0.053784855,0.0015029797,0.8874058,0.011301863,0.04502556],"study_design_scores_gemma":[0.000030158837,0.000017931921,0.00008646484,0.000015136958,0.000022989389,0.00013327456,0.000034275097,0.11821505,0.0005668294,0.87440956,0.006454966,0.000013332763],"about_ca_topic_score_codex":0.00294147,"about_ca_topic_score_gemma":0.0030611064,"teacher_disagreement_score":0.014034434,"about_ca_system_score_codex":0.0021834134,"about_ca_system_score_gemma":0.0018624044,"threshold_uncertainty_score":0.046949804},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084063765,0.0010332671,0.52363515,0.00073645846,0.0008232018,0.00040931682,0.11502985,0.33015454,0.01977189],"genre_scores_gemma":[0.038650606,0.000713334,0.60221994,0.000980521,0.0003339161,0.0015251136,0.27491,0.065529436,0.015137188],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879825,0.00023292129,0.00009473481,0.00041583183,0.00036702192,0.00009117868],"domain_scores_gemma":[0.9988808,0.00035382403,0.00006834881,0.00029386635,0.00026926602,0.00013392503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015172485,0.0023369596,0.0013543629,0.0013344657,0.00092948234,0.0014560963,0.0022568475,0.00075995695,0.04695857],"category_scores_gemma":[0.0035173246,0.0013637586,0.0020894282,0.0018435013,0.00047470018,0.0011302636,0.0023879418,0.0022391363,0.040228624],"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.0015402896,0.0000736753,0.0022382566,0.001377403,0.00052583084,0.00041750108,0.00030780697,0.011428392,0.033888616,0.01023131,0.8193929,0.11857802],"study_design_scores_gemma":[0.0015343715,0.00030696078,0.0062469356,0.00031501084,0.0003530788,0.0014351895,0.00014292853,0.1712724,0.095467985,0.060034845,0.6625089,0.00038134257],"about_ca_topic_score_codex":0.0021864625,"about_ca_topic_score_gemma":0.0045763548,"teacher_disagreement_score":0.04695857,"about_ca_system_score_codex":0.00037363157,"about_ca_system_score_gemma":0.001383068,"threshold_uncertainty_score":0.15709203},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020034237,0.00033312305,0.9732695,0.00015074218,0.000073565636,0.0002670493,0.0004986632,0.0033532607,0.0020198144],"genre_scores_gemma":[0.0536675,0.00008985285,0.9424838,0.00006717414,0.000034106342,0.0002445232,0.0017776086,0.00034289996,0.0012924782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893945,0.00016431068,0.00007572847,0.0003491825,0.00038764416,0.000083756735],"domain_scores_gemma":[0.99795413,0.0011184722,0.00021839266,0.00029588086,0.00032526974,0.00008784524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012533959,0.001126583,0.00087974075,0.0015091398,0.001087808,0.0015748844,0.0017575083,0.0016080055,0.0053030844],"category_scores_gemma":[0.0035793367,0.00044137452,0.0015322932,0.0012403463,0.00076702697,0.0014587117,0.001298251,0.001708522,0.0020824147],"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.00075524184,0.0005060114,0.0050649666,0.000815881,0.00020034966,0.00024871505,0.00037977216,0.22212353,0.065719046,0.048073675,0.015397519,0.6407153],"study_design_scores_gemma":[0.00013248035,0.00034278602,0.00087049644,0.000037988848,0.000038584363,0.0003693557,0.000088468514,0.9165942,0.031698562,0.03654469,0.01324736,0.000035025518],"about_ca_topic_score_codex":0.0013116272,"about_ca_topic_score_gemma":0.0016866641,"teacher_disagreement_score":0.0053030844,"about_ca_system_score_codex":0.0011178752,"about_ca_system_score_gemma":0.0012535416,"threshold_uncertainty_score":0.017740607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03677912,0.0002959548,0.95885473,0.00035331878,0.000055800134,0.000055261655,0.00022654793,0.00038403703,0.002995228],"genre_scores_gemma":[0.42692372,0.00056738534,0.56608665,0.00034231192,0.0002652988,0.00018203157,0.0009990887,0.0002535222,0.004379913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830866,0.00045585269,0.00009008443,0.00043517063,0.0005075615,0.00020270063],"domain_scores_gemma":[0.99285614,0.0049021016,0.00071467494,0.00058897206,0.00070659263,0.00023149561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00176531,0.0009248679,0.0012594693,0.0014784145,0.00090937305,0.0017477535,0.0011511002,0.0013429059,0.005907304],"category_scores_gemma":[0.012621906,0.00049388054,0.0011127198,0.001958915,0.0018356792,0.002761588,0.0016831926,0.0020232226,0.0013361941],"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.00094502047,0.00020883998,0.0036231503,0.00032577734,0.00010237635,0.00035522642,0.0004277471,0.5609147,0.009315781,0.19973366,0.007472712,0.21657501],"study_design_scores_gemma":[0.00004115007,0.00015417853,0.00054110656,0.000043678836,0.000018371411,0.00023626858,0.000105369894,0.8274982,0.005672355,0.16186842,0.0037783652,0.000042553558],"about_ca_topic_score_codex":0.0022146408,"about_ca_topic_score_gemma":0.0015817371,"teacher_disagreement_score":0.005907304,"about_ca_system_score_codex":0.0012489442,"about_ca_system_score_gemma":0.0018174225,"threshold_uncertainty_score":0.01976186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74477404,0.0013518312,0.25015244,0.000583037,0.000048892307,0.00004274467,0.00022053729,0.0009051294,0.001921334],"genre_scores_gemma":[0.83844155,0.0003041371,0.15999182,0.00016265131,0.000037140097,0.000038054877,0.0003733314,0.00040658814,0.00024469887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995466,0.0027348825,0.00028955413,0.00052888633,0.00080505834,0.00017556199],"domain_scores_gemma":[0.940535,0.052693605,0.0019981305,0.002998997,0.0013015892,0.00047266236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013046566,0.0006549684,0.0005989476,0.0014530357,0.00086017046,0.001515624,0.0011564823,0.0013779378,0.0014009993],"category_scores_gemma":[0.06307229,0.00075729075,0.00087740173,0.0015522535,0.0019801068,0.0017656822,0.0024935554,0.0023048576,0.00026331036],"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.00270364,0.00019393051,0.08015722,0.0009737017,0.000591942,0.0010376532,0.001506929,0.71266633,0.09049646,0.023658825,0.000790489,0.08522296],"study_design_scores_gemma":[0.00019074146,0.0005933102,0.03899883,0.00017319027,0.0003982546,0.0020928194,0.0004238052,0.7872793,0.12364211,0.042404834,0.003653508,0.00014929507],"about_ca_topic_score_codex":0.0009711315,"about_ca_topic_score_gemma":0.0010967394,"teacher_disagreement_score":0.013046566,"about_ca_system_score_codex":0.00095130573,"about_ca_system_score_gemma":0.00042558752,"threshold_uncertainty_score":0.06899762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97991234,0.0001759222,0.01759724,0.000043776177,0.0000071022246,0.000022546858,0.0011274273,0.00031921934,0.0007944491],"genre_scores_gemma":[0.87331843,0.00024366983,0.11690292,0.00003355927,0.00001746563,0.0000350699,0.00871323,0.00024883647,0.00048667178],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9997503,0.000054708376,0.000019716083,0.000081609054,0.000067513836,0.000026211444],"domain_scores_gemma":[0.9991887,0.00040181712,0.00011978261,0.00007267511,0.00014732615,0.00006956036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008546265,0.0004058985,0.00025667856,0.0012715759,0.0006203286,0.00061315886,0.00037117166,0.00032819292,0.0020334744],"category_scores_gemma":[0.0019284355,0.00037054694,0.00054937653,0.00095645926,0.0002988814,0.00047648523,0.00065614015,0.0004922185,0.00029357063],"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.0022785387,0.00033881087,0.19746515,0.0013227722,0.00047860623,0.000870164,0.0021354356,0.1454308,0.44955927,0.007933448,0.002283109,0.18990387],"study_design_scores_gemma":[0.00019182713,0.0009897226,0.30279836,0.00011802763,0.00071865885,0.0012464129,0.00077482336,0.51345867,0.14928633,0.009643912,0.020647857,0.00012548672],"about_ca_topic_score_codex":0.0030433654,"about_ca_topic_score_gemma":0.005141213,"teacher_disagreement_score":0.0030433654,"about_ca_system_score_codex":0.0007082867,"about_ca_system_score_gemma":0.0005149164,"threshold_uncertainty_score":0.0068026185},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22556297,0.0017000336,0.7333973,0.00022564363,0.00012559355,0.00026288646,0.0044405013,0.030882992,0.0034019696],"genre_scores_gemma":[0.3197565,0.00043613857,0.6655418,0.000101574966,0.00004500455,0.0001373831,0.010815787,0.0017299886,0.0014357801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984819,0.00021765585,0.00011093971,0.00042234594,0.00063970353,0.0001275336],"domain_scores_gemma":[0.9959656,0.0013968223,0.0005739781,0.0004895352,0.0013751172,0.00019897976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021361124,0.0011035716,0.0008439557,0.0033219638,0.00069336983,0.0014160534,0.0011120293,0.0007670383,0.0023242636],"category_scores_gemma":[0.007840788,0.00043197355,0.00081107987,0.0018367278,0.00038082473,0.0015810152,0.0010776817,0.00089894823,0.001527762],"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.00088508934,0.00020379605,0.051784266,0.0013472558,0.00042720174,0.0007789863,0.00087668526,0.04545311,0.30840045,0.0074365893,0.016449006,0.5659575],"study_design_scores_gemma":[0.00006132034,0.00038693618,0.04536889,0.00015139242,0.00014981341,0.0014088219,0.000387303,0.6456215,0.27399686,0.007135583,0.025158407,0.00017317117],"about_ca_topic_score_codex":0.0027934466,"about_ca_topic_score_gemma":0.0038700362,"teacher_disagreement_score":0.0033219638,"about_ca_system_score_codex":0.0005919633,"about_ca_system_score_gemma":0.0008254691,"threshold_uncertainty_score":0.0112969875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022167016,0.0014592297,0.94319654,0.0023007996,0.00064272084,0.0004591094,0.0013606874,0.0068770857,0.02153677],"genre_scores_gemma":[0.122973256,0.0005017221,0.85882163,0.000810552,0.0004638669,0.0010185688,0.0025904835,0.0015618643,0.011258118],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722606,0.00056153827,0.00014369204,0.0008102145,0.00074800075,0.0005105049],"domain_scores_gemma":[0.99435544,0.003129258,0.0002197412,0.0013730748,0.0005618415,0.00036058333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022761845,0.0033185508,0.003228029,0.0020037815,0.0017893517,0.0037946485,0.0052359276,0.003511819,0.020792983],"category_scores_gemma":[0.012088865,0.0012595641,0.002965629,0.004769298,0.0017028555,0.005539844,0.0042364625,0.005831487,0.006624612],"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.0019760134,0.0010364031,0.00081839605,0.00094383,0.00018122199,0.00020251586,0.00031224082,0.20895891,0.008350752,0.10542786,0.09470629,0.5770855],"study_design_scores_gemma":[0.0004346725,0.000118957345,0.00019694565,0.000066972054,0.00007372619,0.0001518584,0.00007237491,0.8226651,0.0022135847,0.16590033,0.008070026,0.00003553109],"about_ca_topic_score_codex":0.0051833014,"about_ca_topic_score_gemma":0.0062253475,"teacher_disagreement_score":0.020792983,"about_ca_system_score_codex":0.0033842209,"about_ca_system_score_gemma":0.004615501,"threshold_uncertainty_score":0.069559455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011923922,0.91549534,0.06036401,0.0055204607,0.0017143931,0.000048984843,0.00028629598,0.0004468139,0.014931186],"genre_scores_gemma":[0.019250825,0.9187538,0.04972937,0.002219505,0.0026583255,0.00008288856,0.0006880966,0.00012382769,0.0064932727],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922514,0.0002356177,0.000052021405,0.00019562586,0.00023723772,0.000054297136],"domain_scores_gemma":[0.9983392,0.0011885422,0.00014212498,0.000087851564,0.00018458074,0.000057754416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011708138,0.0010300208,0.0011987488,0.0014047882,0.00029898458,0.0016127203,0.0013912779,0.002177618,0.007927202],"category_scores_gemma":[0.0034219788,0.00029626032,0.0006306039,0.002850514,0.0012948841,0.0028285647,0.000877781,0.0019976317,0.0062546437],"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.000060593626,0.0000573533,0.00050217146,0.0090087075,0.00009763106,0.0001862514,0.00007467458,0.0086695235,0.00211083,0.05520209,0.043307185,0.880723],"study_design_scores_gemma":[0.000020118927,0.00011981347,0.00087561575,0.0030083195,0.000070914124,0.0013902675,0.00007784925,0.012159492,0.0042853183,0.106552854,0.87137496,0.00006449259],"about_ca_topic_score_codex":0.000967762,"about_ca_topic_score_gemma":0.0008629535,"teacher_disagreement_score":0.007927202,"about_ca_system_score_codex":0.00083362736,"about_ca_system_score_gemma":0.0009361049,"threshold_uncertainty_score":0.02651918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06620978,0.00051108253,0.9175353,0.0009991091,0.0002303155,0.00037029778,0.00071590784,0.0035593854,0.009868822],"genre_scores_gemma":[0.19019198,0.0002753331,0.79882663,0.0003765572,0.00009144312,0.00039903252,0.001776912,0.00047068126,0.0075912983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906164,0.00018595278,0.000051572064,0.0002518505,0.00022874503,0.00022021326],"domain_scores_gemma":[0.99769956,0.0011999763,0.00014188988,0.0005760724,0.00022679754,0.00015564039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013170016,0.0016962973,0.0021619154,0.0016250389,0.0012691172,0.0020146,0.003921678,0.0022959865,0.010951026],"category_scores_gemma":[0.005273939,0.0008182505,0.0018240918,0.0028635196,0.0012231271,0.003069542,0.0023855611,0.0030684683,0.00206342],"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.0011741827,0.000740889,0.0016568092,0.00042823603,0.0001358733,0.00015386424,0.00028505537,0.37535527,0.009467131,0.06223328,0.02626468,0.52210474],"study_design_scores_gemma":[0.00032673238,0.00020552662,0.0004299041,0.00003778633,0.00007337593,0.00015600341,0.00013328467,0.91850966,0.0038516365,0.07133289,0.004908884,0.00003431872],"about_ca_topic_score_codex":0.007377039,"about_ca_topic_score_gemma":0.008987012,"teacher_disagreement_score":0.010951026,"about_ca_system_score_codex":0.002216245,"about_ca_system_score_gemma":0.0047548567,"threshold_uncertainty_score":0.036634803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24690825,0.0010098352,0.5389485,0.003708871,0.0010092497,0.00025050534,0.0009699595,0.0013817989,0.20581311],"genre_scores_gemma":[0.8829018,0.0006649334,0.05860464,0.00083971367,0.00045833632,0.00024584454,0.0007447086,0.00047879564,0.055061188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925464,0.00017188385,0.00004364866,0.00015845982,0.00018462281,0.0001867307],"domain_scores_gemma":[0.99576205,0.0019194242,0.0003044951,0.0009291037,0.00041579956,0.0006691681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009573291,0.0006978365,0.0010486277,0.0011112812,0.0017111999,0.0024433963,0.0011559889,0.00093757367,0.01387544],"category_scores_gemma":[0.007490766,0.00031736627,0.0006370731,0.0010433164,0.0018884742,0.004008012,0.003097134,0.0026360494,0.0014696459],"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.00022228842,0.000030772364,0.00025380083,0.000071051785,0.00001445964,0.000064406086,0.00016750049,0.0046662046,0.0015983626,0.9693151,0.0066120704,0.016984077],"study_design_scores_gemma":[0.000025316724,0.000027261203,0.00011355857,0.000011147484,0.000013021696,0.00006529284,0.00005276448,0.026820691,0.00086691225,0.9667704,0.0052210526,0.000012459302],"about_ca_topic_score_codex":0.0004765824,"about_ca_topic_score_gemma":0.00054614816,"teacher_disagreement_score":0.01387544,"about_ca_system_score_codex":0.0008266719,"about_ca_system_score_gemma":0.00085621304,"threshold_uncertainty_score":0.04641801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20664762,0.0011483517,0.7651975,0.0014848805,0.000269132,0.0004330188,0.0017248577,0.0029623497,0.020132279],"genre_scores_gemma":[0.5576407,0.0010977663,0.42129248,0.00048604028,0.00012389506,0.0003440168,0.0032401776,0.0006475271,0.0151274465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987006,0.00030677998,0.00009730363,0.00035694166,0.00020614902,0.00033215331],"domain_scores_gemma":[0.9979417,0.0010297359,0.00018363181,0.00046840895,0.00016270584,0.00021378082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080756244,0.00074824545,0.0011686438,0.0005489494,0.0013070294,0.0016444371,0.0017312568,0.0011215018,0.008097391],"category_scores_gemma":[0.0039610867,0.0005135782,0.0012093564,0.002019524,0.0012073594,0.005619746,0.002183353,0.0016219227,0.0015449204],"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.0012776515,0.000318125,0.0016986433,0.000833784,0.00011655197,0.00059023465,0.000536204,0.4427335,0.019381175,0.29099044,0.024487235,0.21703652],"study_design_scores_gemma":[0.00013425869,0.0001893251,0.00039250214,0.00005170342,0.000056821234,0.00031106826,0.00020968153,0.52183545,0.011254262,0.44197533,0.023552654,0.000036992726],"about_ca_topic_score_codex":0.0024763236,"about_ca_topic_score_gemma":0.0026471575,"teacher_disagreement_score":0.008097391,"about_ca_system_score_codex":0.0014265383,"about_ca_system_score_gemma":0.001499026,"threshold_uncertainty_score":0.027088463},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20000917,0.0054050684,0.71514356,0.018882008,0.0007097754,0.00021516542,0.0013374668,0.0007927252,0.05750514],"genre_scores_gemma":[0.76659334,0.0034424083,0.20824964,0.0014690626,0.0012408777,0.0004127657,0.0018937391,0.00061412057,0.016083922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951036,0.0022899648,0.00022176259,0.00075284205,0.0010976024,0.0005342514],"domain_scores_gemma":[0.9281779,0.06563224,0.0014380183,0.0024131197,0.0012601943,0.0010786767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004624542,0.0013512205,0.0029736864,0.0021793284,0.0022086136,0.0059327087,0.004666795,0.0030826572,0.014509953],"category_scores_gemma":[0.05163339,0.00091366126,0.002003155,0.0039597265,0.0049745245,0.013573133,0.0060869977,0.0072015366,0.0011302566],"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.00059969653,0.00031865336,0.0021810713,0.00047707697,0.000111686975,0.0001524232,0.0004888101,0.26607043,0.0007516126,0.6630565,0.012891619,0.052900534],"study_design_scores_gemma":[0.00006706547,0.00002733079,0.0002588569,0.000028876151,0.000019157931,0.000051858693,0.000099528384,0.31443286,0.000222569,0.68325,0.00152714,0.000014667603],"about_ca_topic_score_codex":0.004248083,"about_ca_topic_score_gemma":0.0036887375,"teacher_disagreement_score":0.014509953,"about_ca_system_score_codex":0.0029644829,"about_ca_system_score_gemma":0.0024795756,"threshold_uncertainty_score":0.048540592},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36506632,0.00060985086,0.62981033,0.00054423383,0.000039312366,0.000051213166,0.0006609655,0.0009378602,0.0022799766],"genre_scores_gemma":[0.8548854,0.00021563216,0.14186025,0.00015330238,0.00006193622,0.00009310806,0.0016056899,0.0002769709,0.00084770436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991873,0.0003859652,0.000030896746,0.00021591868,0.00011534986,0.00006469622],"domain_scores_gemma":[0.99592245,0.0025362894,0.0002325991,0.0007347495,0.00038353057,0.00019049365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002713914,0.00048757516,0.0012451974,0.0018438778,0.0008141428,0.0014606578,0.0022069644,0.0012730429,0.0023966192],"category_scores_gemma":[0.009459602,0.0005333201,0.0011599405,0.0012457281,0.00087321916,0.001824176,0.0015842936,0.0014528664,0.00036223783],"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.00010392236,0.000048161368,0.009118553,0.000042462878,0.00018838666,0.000082062405,0.00012693914,0.9377509,0.0014425371,0.012721285,0.0008759327,0.037498806],"study_design_scores_gemma":[0.000005782193,0.000009371777,0.0005304493,0.0000048220068,0.00001373612,0.000016880322,0.000016043616,0.99010694,0.00022062213,0.008826101,0.00024445017,0.000004695128],"about_ca_topic_score_codex":0.0033964266,"about_ca_topic_score_gemma":0.0057361885,"teacher_disagreement_score":0.0033964266,"about_ca_system_score_codex":0.0009443491,"about_ca_system_score_gemma":0.00070893054,"threshold_uncertainty_score":0.014352739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3111788,0.0025422198,0.6473604,0.0021532,0.00018510914,0.00016309545,0.0014729272,0.0010968384,0.03384741],"genre_scores_gemma":[0.94947857,0.0011708799,0.039878298,0.00040425494,0.0003263896,0.00015757332,0.00083531113,0.00032165958,0.0074270912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487466,0.0012566423,0.00029433644,0.0010669628,0.0013103564,0.0011969274],"domain_scores_gemma":[0.96009046,0.027627815,0.0035090372,0.0041674525,0.002627488,0.0019777603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077491067,0.0012695713,0.0023755673,0.00236683,0.0015106379,0.0046880324,0.0043062847,0.0024135273,0.011439625],"category_scores_gemma":[0.050237343,0.0009289985,0.0016825179,0.0030644697,0.003087861,0.010134697,0.0023938846,0.0029033606,0.001270176],"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.0005845347,0.00019825577,0.0053157574,0.00024903036,0.00013196566,0.0006166186,0.00022324185,0.39083812,0.003869474,0.5727582,0.00550521,0.019709613],"study_design_scores_gemma":[0.000034986864,0.00007549454,0.0005902916,0.000019692106,0.000035031764,0.00026556954,0.00006872834,0.72044283,0.0011911005,0.27594605,0.0012942906,0.000035891673],"about_ca_topic_score_codex":0.0025147398,"about_ca_topic_score_gemma":0.0015891598,"teacher_disagreement_score":0.011439625,"about_ca_system_score_codex":0.0028435437,"about_ca_system_score_gemma":0.0019300871,"threshold_uncertainty_score":0.04098171},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25322255,0.002346215,0.52068955,0.0023586012,0.0002740024,0.00041185427,0.09407706,0.11457165,0.012048492],"genre_scores_gemma":[0.5574647,0.00092213193,0.3337788,0.0007843344,0.00012182616,0.0004612854,0.09431409,0.008686785,0.0034659796],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987337,0.00015691799,0.000070554386,0.0006012339,0.0003293733,0.0001081948],"domain_scores_gemma":[0.9973985,0.0013634391,0.00046287372,0.00033962142,0.00018658856,0.00024906045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017967777,0.000737236,0.0008041085,0.001350933,0.0012332158,0.0017438591,0.0012042829,0.0009824005,0.015210304],"category_scores_gemma":[0.007475166,0.0009414859,0.0009899847,0.00225485,0.0008173485,0.001571196,0.0020551893,0.0016388724,0.007707516],"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.0034257204,0.00031419226,0.16143057,0.0061675757,0.0008996236,0.0012977734,0.0012197158,0.03543381,0.42841178,0.030438276,0.109342545,0.22161838],"study_design_scores_gemma":[0.00057681865,0.00073457,0.28100094,0.00042648026,0.00071676966,0.003856185,0.0006833237,0.20912941,0.27258596,0.09109479,0.13878809,0.00040656762],"about_ca_topic_score_codex":0.0017524977,"about_ca_topic_score_gemma":0.0037543736,"teacher_disagreement_score":0.015210304,"about_ca_system_score_codex":0.0006075531,"about_ca_system_score_gemma":0.0010014361,"threshold_uncertainty_score":0.05088353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05330901,0.0003241592,0.9086413,0.00046218987,0.00063879817,0.00021718878,0.00064096105,0.0039643836,0.031802103],"genre_scores_gemma":[0.32781503,0.000593128,0.6210445,0.0002980439,0.00013161762,0.00036462396,0.0015640497,0.0021471526,0.046041735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990274,0.00022621379,0.000057057856,0.00026933712,0.00023475516,0.00018533102],"domain_scores_gemma":[0.9977011,0.0010300071,0.000106907915,0.00082587695,0.0001860037,0.00015003253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008018367,0.0009126329,0.0010967604,0.0012490406,0.0013402349,0.0017284399,0.0029897618,0.0010901697,0.020754885],"category_scores_gemma":[0.0044700983,0.00081817905,0.0012125802,0.0030504616,0.0017684139,0.0043433346,0.0038965307,0.0018399985,0.0036119337],"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.00049801567,0.00016563809,0.00044678847,0.00038318633,0.000079231715,0.00044367358,0.00041045545,0.09451252,0.01581142,0.5389579,0.020092819,0.32819837],"study_design_scores_gemma":[0.00006235523,0.000067215486,0.00015722605,0.00006094982,0.000051958577,0.00019904676,0.00013836725,0.18125018,0.015454339,0.7723209,0.030193947,0.000043448224],"about_ca_topic_score_codex":0.0014034776,"about_ca_topic_score_gemma":0.0018530401,"teacher_disagreement_score":0.020754885,"about_ca_system_score_codex":0.0010158007,"about_ca_system_score_gemma":0.0008354759,"threshold_uncertainty_score":0.06943196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020710617,0.0006866928,0.96214217,0.00060177903,0.00019527825,0.000040650546,0.0007872304,0.0012817865,0.01355364],"genre_scores_gemma":[0.21947885,0.0011743505,0.7358721,0.0007845731,0.0003557316,0.00037674882,0.0032673278,0.0014322018,0.037258107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998922,0.000225559,0.000051379007,0.0003878552,0.00030349527,0.00010970936],"domain_scores_gemma":[0.99826366,0.00077416335,0.00010883853,0.00044376383,0.00024563356,0.0001638957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013236066,0.0006121096,0.0014838822,0.0015486386,0.001077482,0.0017941993,0.002581906,0.0013254851,0.015743995],"category_scores_gemma":[0.006743035,0.0005297079,0.0013649227,0.0019604212,0.001675901,0.0030274722,0.0028610372,0.0023305947,0.004109984],"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.0003843297,0.00006565538,0.0010298014,0.00026761973,0.00008198349,0.0001003219,0.00032043242,0.084318124,0.0064789588,0.48113093,0.033487145,0.39233473],"study_design_scores_gemma":[0.000040557505,0.00008775464,0.00055741076,0.000066788794,0.000024549568,0.00020038006,0.000132465,0.2497082,0.0031075499,0.7162736,0.029766725,0.00003395147],"about_ca_topic_score_codex":0.0015208957,"about_ca_topic_score_gemma":0.0017201157,"teacher_disagreement_score":0.015743995,"about_ca_system_score_codex":0.0013264416,"about_ca_system_score_gemma":0.0013985324,"threshold_uncertainty_score":0.05266893},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025867978,0.00019226735,0.9728521,0.00017195546,0.000016834327,0.000048926788,0.000112558286,0.00040192727,0.00033541166],"genre_scores_gemma":[0.5095795,0.0003176928,0.48557147,0.00025399055,0.00011726771,0.0003866933,0.0013426172,0.00042177038,0.0020089445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771726,0.0010715293,0.00012501914,0.00064787327,0.00030248272,0.000135841],"domain_scores_gemma":[0.9647015,0.031181222,0.0013343396,0.0012072914,0.00095937954,0.00061632926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012344079,0.0008236764,0.0013987502,0.0025135751,0.001311343,0.0018241787,0.0038245015,0.0020313621,0.0035819972],"category_scores_gemma":[0.04248474,0.0011376581,0.0018580059,0.0020062726,0.002473436,0.0027052755,0.0028640425,0.003132716,0.00059542916],"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.0002884971,0.00010757315,0.013022783,0.00013867203,0.00024921977,0.00028488284,0.00048633563,0.79559636,0.0035133325,0.10559892,0.0013365389,0.07937687],"study_design_scores_gemma":[0.000018646955,0.0000103476705,0.00042698413,0.0000105950985,0.000012954203,0.000035775753,0.000010359538,0.9571552,0.00034426787,0.04169212,0.0002743055,0.000008512167],"about_ca_topic_score_codex":0.00742316,"about_ca_topic_score_gemma":0.005544443,"teacher_disagreement_score":0.012344079,"about_ca_system_score_codex":0.002308335,"about_ca_system_score_gemma":0.0013457187,"threshold_uncertainty_score":0.06528252},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02571553,0.0001589679,0.9614118,0.00034210118,0.00005452918,0.00019499366,0.0005397375,0.005821044,0.0057613994],"genre_scores_gemma":[0.097474255,0.000065455606,0.89687634,0.0000958886,0.000026259826,0.00018254828,0.0012963802,0.00056913064,0.0034137585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895823,0.00015323587,0.00006668293,0.00036645232,0.00026002442,0.00019528045],"domain_scores_gemma":[0.9989483,0.00041267334,0.00009825412,0.0002720015,0.00018112744,0.000087674256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039096,0.0010003896,0.0013698335,0.0016779238,0.0013717964,0.0018202792,0.001769919,0.0012401491,0.016887596],"category_scores_gemma":[0.003617077,0.00056262704,0.0017107431,0.0019531017,0.000961147,0.0019619912,0.0030264808,0.0020819353,0.0031337691],"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.0006379602,0.00031608006,0.0017095943,0.00038106213,0.000118375814,0.00021329137,0.00048962067,0.16555268,0.015816256,0.064909525,0.018093511,0.7317622],"study_design_scores_gemma":[0.00032919017,0.00027079505,0.0007748917,0.000039110775,0.000043115957,0.00023219145,0.0003624547,0.8292009,0.010017942,0.14191519,0.016742384,0.00007181091],"about_ca_topic_score_codex":0.007175635,"about_ca_topic_score_gemma":0.010216019,"teacher_disagreement_score":0.016887596,"about_ca_system_score_codex":0.0017254567,"about_ca_system_score_gemma":0.003200216,"threshold_uncertainty_score":0.056494653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0776674,0.0012268239,0.91506195,0.0010855172,0.00008579519,0.00018929824,0.0008532783,0.0016840685,0.0021459465],"genre_scores_gemma":[0.42222515,0.00054875715,0.5704853,0.00042154154,0.00016536844,0.00031376356,0.0035987343,0.0006186973,0.0016227133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664223,0.0017969427,0.0001403203,0.00073764037,0.0005012681,0.00018158797],"domain_scores_gemma":[0.9896633,0.006438697,0.0007417846,0.002245925,0.0006851363,0.0002250658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006283337,0.0011048107,0.0016946661,0.0035827274,0.0013260626,0.0017540358,0.0038378139,0.0019070657,0.0036411693],"category_scores_gemma":[0.014742473,0.00090176624,0.0022558265,0.0039833747,0.0015137381,0.0037849324,0.0027429785,0.0023200677,0.0009435865],"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.000810136,0.00021451128,0.008355783,0.00060292194,0.00050979696,0.00070067274,0.00086518074,0.677962,0.00830077,0.082446605,0.007942196,0.21128947],"study_design_scores_gemma":[0.0000682425,0.00008140496,0.0012521057,0.000041086532,0.00008674021,0.00032596785,0.00013779856,0.8757792,0.003056676,0.11455374,0.004587194,0.00002991824],"about_ca_topic_score_codex":0.0011561293,"about_ca_topic_score_gemma":0.0013952093,"teacher_disagreement_score":0.006283337,"about_ca_system_score_codex":0.0012118996,"about_ca_system_score_gemma":0.0010465847,"threshold_uncertainty_score":0.033229887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9084008,0.0015561813,0.082329765,0.00011674132,0.000045022643,0.00015224631,0.0025909718,0.0020646215,0.0027436372],"genre_scores_gemma":[0.9131525,0.0005534011,0.0763884,0.00005769041,0.000030439265,0.00014454019,0.008376881,0.00026684886,0.0010292018],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926454,0.00012337927,0.000055973305,0.0002500214,0.00020641735,0.00009963354],"domain_scores_gemma":[0.9990791,0.00040587859,0.00018985348,0.00009084268,0.00016133214,0.00007288048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060088764,0.0004007098,0.00048142482,0.0038539902,0.00054679427,0.00063871156,0.0005718251,0.00039071857,0.0028114456],"category_scores_gemma":[0.0022228898,0.00023313497,0.00091000623,0.0027068688,0.0002544767,0.00067676004,0.00075945054,0.00040403733,0.0006810487],"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.0021554886,0.00031770056,0.11835182,0.0015016065,0.000779777,0.00200541,0.0008571942,0.069135964,0.46814835,0.004892721,0.0029300775,0.32892385],"study_design_scores_gemma":[0.00015513152,0.0016939206,0.24285665,0.00019413736,0.00071021606,0.0058492026,0.0013266964,0.5367209,0.16598955,0.011519889,0.032814257,0.00016948262],"about_ca_topic_score_codex":0.0012801448,"about_ca_topic_score_gemma":0.0010426209,"teacher_disagreement_score":0.0038539902,"about_ca_system_score_codex":0.00048675018,"about_ca_system_score_gemma":0.00034775797,"threshold_uncertainty_score":0.009405196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048144948,0.00053612003,0.9447969,0.00007595413,0.000022154964,0.00007385713,0.001250767,0.0042020893,0.0008972397],"genre_scores_gemma":[0.32004157,0.0002471179,0.6746313,0.00008958916,0.00002480748,0.00020466816,0.0036202886,0.00060999865,0.00053058134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916744,0.000384515,0.000050005765,0.00021448928,0.00013514028,0.000048308044],"domain_scores_gemma":[0.99652547,0.002676231,0.00018544748,0.00023810657,0.00026738024,0.0001073173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001985422,0.0007256693,0.0007923265,0.0024787877,0.00063665037,0.0007509746,0.0013935401,0.0010424977,0.0033268235],"category_scores_gemma":[0.009016656,0.00059100916,0.0010837808,0.0015336506,0.00048575623,0.001166514,0.0012025606,0.001358742,0.0009040241],"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.00081173755,0.00020050109,0.03132555,0.0007530787,0.0005642394,0.0003091905,0.00044271443,0.74493754,0.021432107,0.018427065,0.0027298878,0.17806646],"study_design_scores_gemma":[0.000020554908,0.00003511314,0.0012497723,0.000017489,0.000035546596,0.00006270025,0.00003724367,0.9837673,0.0023116213,0.010777138,0.001671983,0.000013615355],"about_ca_topic_score_codex":0.003895594,"about_ca_topic_score_gemma":0.0038923651,"teacher_disagreement_score":0.003895594,"about_ca_system_score_codex":0.00084640924,"about_ca_system_score_gemma":0.0011213826,"threshold_uncertainty_score":0.011129379},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19309635,0.0023987826,0.78404427,0.0039953487,0.00016261815,0.00036031066,0.003613256,0.0011460907,0.011182888],"genre_scores_gemma":[0.5506639,0.0015395904,0.4299246,0.000686036,0.00033169964,0.0004795963,0.005543141,0.00066630705,0.010165145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730647,0.0008039596,0.00013912222,0.0010146934,0.00038319136,0.0003525789],"domain_scores_gemma":[0.98147774,0.014995734,0.001272121,0.00086354336,0.0006421332,0.0007487035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034218698,0.0015190555,0.0030255443,0.0012926807,0.0018141562,0.003175415,0.004154549,0.0040325336,0.009695612],"category_scores_gemma":[0.015558191,0.0010158302,0.0023821634,0.0029831666,0.002158234,0.00820599,0.0026530558,0.0044398773,0.0009609977],"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.00045044068,0.00025361535,0.0017630211,0.00030269203,0.00009767576,0.00019593936,0.00019007653,0.8935538,0.0008202275,0.06348138,0.006542052,0.032349117],"study_design_scores_gemma":[0.00011414731,0.00008181231,0.00045246864,0.000024364119,0.000028211894,0.00013085194,0.00011091553,0.8267398,0.0006680043,0.16992734,0.0016947507,0.000027274524],"about_ca_topic_score_codex":0.010515474,"about_ca_topic_score_gemma":0.007559365,"teacher_disagreement_score":0.010515474,"about_ca_system_score_codex":0.003798367,"about_ca_system_score_gemma":0.0030421156,"threshold_uncertainty_score":0.03243506},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15498659,0.00023669504,0.82769305,0.00094570353,0.0002871531,0.00019515546,0.00048909785,0.0022486122,0.01291788],"genre_scores_gemma":[0.5486965,0.0003287121,0.4261919,0.00036933503,0.000102894504,0.00030038354,0.0009927232,0.0010231538,0.021994459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984328,0.0005344411,0.00007939138,0.0004136289,0.00025810607,0.00028158337],"domain_scores_gemma":[0.9921496,0.004916604,0.0003896376,0.0017086911,0.00036388007,0.00047158427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015763695,0.0009055992,0.0014798886,0.0017701287,0.0019918953,0.0024405096,0.0040317425,0.0020710651,0.01443223],"category_scores_gemma":[0.011120592,0.0010253296,0.0013682494,0.0037654154,0.0026220633,0.006448298,0.0045469813,0.0023880305,0.0018707196],"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.0007541329,0.00030226467,0.001230537,0.00029661204,0.00009561782,0.0004846403,0.0005472807,0.2192561,0.0077823717,0.6145309,0.009895526,0.14482394],"study_design_scores_gemma":[0.00007110083,0.000049847382,0.00014637358,0.000028002278,0.000042798172,0.00011808224,0.000126987,0.33367223,0.00526701,0.6556823,0.004770108,0.000025083466],"about_ca_topic_score_codex":0.0021246579,"about_ca_topic_score_gemma":0.0027058187,"teacher_disagreement_score":0.01443223,"about_ca_system_score_codex":0.0015476326,"about_ca_system_score_gemma":0.0014037638,"threshold_uncertainty_score":0.048280597},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043547004,0.0007238255,0.30305678,0.0006690219,0.00034303515,0.0003372859,0.13192646,0.55397457,0.0046142447],"genre_scores_gemma":[0.03808302,0.0006223692,0.47134283,0.0009937899,0.00022779313,0.0024966882,0.13642259,0.34294388,0.0068670153],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99681324,0.0009183077,0.00025662378,0.0008722682,0.0009050048,0.00023446933],"domain_scores_gemma":[0.9918733,0.0051331636,0.0008259491,0.0012200912,0.0006301321,0.0003174345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005324838,0.0043086982,0.0028859302,0.0045660273,0.0011162875,0.0040605385,0.0037400476,0.0014668474,0.067098916],"category_scores_gemma":[0.025555896,0.0024733348,0.0028388803,0.002563875,0.0015556937,0.0026092005,0.003915919,0.003776219,0.058694582],"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.0005628991,0.0000773378,0.006871656,0.002504776,0.0012390639,0.00045250883,0.0004180423,0.0068888566,0.01009072,0.009164619,0.8835794,0.0781501],"study_design_scores_gemma":[0.0009405518,0.0002645621,0.0150852,0.00077283755,0.000783442,0.0015541766,0.00018788339,0.09640766,0.036486275,0.049154483,0.7977243,0.00063853146],"about_ca_topic_score_codex":0.003433087,"about_ca_topic_score_gemma":0.004605087,"teacher_disagreement_score":0.067098916,"about_ca_system_score_codex":0.0008754623,"about_ca_system_score_gemma":0.0022937625,"threshold_uncertainty_score":0.22446823},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2002312,0.0014749928,0.7712464,0.0028938414,0.00017433523,0.00007126945,0.00028761596,0.0005823019,0.023038052],"genre_scores_gemma":[0.7739822,0.00087424624,0.21666336,0.00051557313,0.00014269758,0.0001641955,0.0006314031,0.00038984328,0.0066364966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992466,0.00033626036,0.0000264343,0.00013328718,0.00013721973,0.000120222394],"domain_scores_gemma":[0.991102,0.007910261,0.000249662,0.00034327313,0.00024610283,0.0001487539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002165117,0.0007802054,0.0012107262,0.0006610076,0.0006590795,0.0016521284,0.0017205259,0.0017167669,0.005752365],"category_scores_gemma":[0.019730058,0.000391075,0.0008466165,0.00088974467,0.001459,0.002952081,0.0016627405,0.002724568,0.0005178778],"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.00050948106,0.0001172315,0.0014745502,0.000233934,0.000057861384,0.000086460874,0.00024495108,0.75053936,0.001650344,0.1911269,0.004528695,0.049430296],"study_design_scores_gemma":[0.000038662023,0.000029283685,0.00016500398,0.000025144953,0.00001278841,0.000027297687,0.000028834138,0.8937876,0.00027399365,0.104935244,0.0006715868,0.0000045157076],"about_ca_topic_score_codex":0.003879679,"about_ca_topic_score_gemma":0.003486657,"teacher_disagreement_score":0.005752365,"about_ca_system_score_codex":0.0014239841,"about_ca_system_score_gemma":0.0012383962,"threshold_uncertainty_score":0.019243538},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21734223,0.0006852376,0.7683734,0.000908817,0.000090244954,0.00030585864,0.0013983939,0.0024393261,0.0084564565],"genre_scores_gemma":[0.46756598,0.0005335257,0.51987773,0.0003374838,0.00005448115,0.00023785724,0.004107628,0.0003714289,0.0069138957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984112,0.0002909572,0.00013848931,0.0006983133,0.00024101883,0.00022000168],"domain_scores_gemma":[0.99645436,0.0018108357,0.0004952974,0.0008284402,0.0002232289,0.00018790085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010244293,0.0006752895,0.00095886714,0.0009862488,0.00078439753,0.0022303362,0.0019500916,0.0015971609,0.005722669],"category_scores_gemma":[0.0048809755,0.00050669146,0.0012850778,0.0021164515,0.0011093509,0.0046377718,0.0016686996,0.001369435,0.0010048155],"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.0012798866,0.00055165164,0.0053537,0.0010404377,0.0001842389,0.00053608604,0.0006172222,0.3637608,0.04603257,0.2301606,0.010318955,0.34016383],"study_design_scores_gemma":[0.00019610184,0.00031338836,0.0014531922,0.00008748255,0.00009600065,0.00085602724,0.00028231382,0.6677989,0.029830676,0.2831389,0.015885783,0.000061207415],"about_ca_topic_score_codex":0.0012378631,"about_ca_topic_score_gemma":0.0015672335,"teacher_disagreement_score":0.005722669,"about_ca_system_score_codex":0.0016421466,"about_ca_system_score_gemma":0.0011807942,"threshold_uncertainty_score":0.019144237},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31720835,0.001234765,0.6687834,0.00067006995,0.00014833121,0.00016558071,0.0044393544,0.0019139895,0.0054361257],"genre_scores_gemma":[0.8027817,0.00046556548,0.18353297,0.00022219795,0.00019820944,0.00025371037,0.009397698,0.0009731,0.0021748247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99246866,0.0019173243,0.0005671882,0.0023162896,0.0023023803,0.00042821985],"domain_scores_gemma":[0.93635094,0.042769633,0.0036256039,0.010051011,0.0061106323,0.0010922486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047607976,0.00065009523,0.002396652,0.0052331737,0.0014142522,0.0043565147,0.006459905,0.0017808498,0.0039403467],"category_scores_gemma":[0.052201644,0.0014723206,0.0014843273,0.0065805386,0.0031734956,0.0062716794,0.0029470846,0.0023248894,0.0008401777],"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.004375937,0.00038701794,0.07530674,0.0015669527,0.0007978454,0.0008448074,0.0016745911,0.36721537,0.024072636,0.3191551,0.011897357,0.19270574],"study_design_scores_gemma":[0.00019344136,0.0001608145,0.00973384,0.00010008347,0.00016851719,0.0006643034,0.00035810468,0.47818348,0.012160728,0.4944136,0.0037920133,0.000070973256],"about_ca_topic_score_codex":0.0018685581,"about_ca_topic_score_gemma":0.0022010554,"teacher_disagreement_score":0.006459905,"about_ca_system_score_codex":0.001468124,"about_ca_system_score_gemma":0.0015062146,"threshold_uncertainty_score":0.025177836},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005969078,0.26042968,0.7200859,0.0031942618,0.00059284887,0.000115307535,0.00033443247,0.0007670334,0.008511392],"genre_scores_gemma":[0.06622186,0.29900134,0.6248491,0.0010493686,0.0021446405,0.00032913417,0.0017529537,0.00057512725,0.004076447],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793434,0.0005680607,0.00019904063,0.0006659245,0.0005325765,0.000100059675],"domain_scores_gemma":[0.9918475,0.0068499297,0.00027313014,0.00033348287,0.000580412,0.000115517745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036767267,0.001815166,0.0017051914,0.0035732905,0.0007097238,0.0036165905,0.0044103246,0.0027397168,0.0025606297],"category_scores_gemma":[0.012459841,0.00139147,0.0015314769,0.004453992,0.0021014852,0.005756012,0.0019711102,0.0028322414,0.0021096244],"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.00006345191,0.00015601513,0.0039520264,0.0024653112,0.00025565282,0.00018512117,0.0002139271,0.1564361,0.0012407894,0.13069732,0.015094447,0.68923986],"study_design_scores_gemma":[0.00005924497,0.00016734932,0.003023857,0.0017805768,0.00022961647,0.0009622843,0.00023343493,0.42581415,0.002576727,0.39701664,0.1679476,0.00018839758],"about_ca_topic_score_codex":0.0041692704,"about_ca_topic_score_gemma":0.0023447648,"teacher_disagreement_score":0.0044103246,"about_ca_system_score_codex":0.0019959365,"about_ca_system_score_gemma":0.0018987854,"threshold_uncertainty_score":0.019444644},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13589908,0.00041093823,0.8583644,0.0010431284,0.000021547616,0.00006394749,0.0005597171,0.0005438357,0.0030934666],"genre_scores_gemma":[0.54773265,0.00052900106,0.44544172,0.00033403168,0.00006247891,0.00026301772,0.0016495896,0.0004090184,0.0035784922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954396,0.00021870073,0.000015072184,0.00012430012,0.00005826702,0.0000397753],"domain_scores_gemma":[0.99649066,0.0030249874,0.0001552642,0.00014830894,0.00008707922,0.000093701645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015287742,0.00048706212,0.0009414128,0.000977114,0.0007282562,0.0011146665,0.0015411525,0.001365134,0.0023490947],"category_scores_gemma":[0.006348275,0.0004965845,0.0007731425,0.0010986171,0.0010118672,0.0017731576,0.0009385008,0.0016270455,0.00044749904],"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.00012226772,0.000055615656,0.0013183434,0.000083604835,0.000026457206,0.00018556858,0.000096594515,0.9359782,0.001444591,0.040089022,0.0014937841,0.019106017],"study_design_scores_gemma":[0.000013968106,0.000008994609,0.00012399138,0.0000031123782,0.00000358974,0.00003982385,0.000014394977,0.96831393,0.00018329771,0.030859668,0.0004312538,0.00000396209],"about_ca_topic_score_codex":0.003910066,"about_ca_topic_score_gemma":0.004959491,"teacher_disagreement_score":0.003910066,"about_ca_system_score_codex":0.0011201095,"about_ca_system_score_gemma":0.0010870991,"threshold_uncertainty_score":0.008126974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04447858,0.0018112463,0.8871961,0.0013254103,0.0006815416,0.0012227674,0.03073483,0.013851337,0.018698119],"genre_scores_gemma":[0.48463368,0.0013166924,0.4062737,0.00174229,0.0009994686,0.004044603,0.06962121,0.0051593333,0.026209002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911493,0.002913641,0.00067957,0.0028290625,0.0019056287,0.0005227187],"domain_scores_gemma":[0.9639776,0.021871023,0.0018798199,0.008756688,0.0029974247,0.00051747233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010583093,0.001186306,0.0021725707,0.0029453742,0.001223355,0.0025170639,0.0037104702,0.0022761498,0.040893942],"category_scores_gemma":[0.051366333,0.0006098906,0.001965157,0.0033447295,0.0020465935,0.0028003731,0.0018170523,0.0030968795,0.016497448],"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.0022275022,0.0004217742,0.058106754,0.0019970227,0.0008871641,0.000949059,0.00063954835,0.1247562,0.008582648,0.21023236,0.14483196,0.44636804],"study_design_scores_gemma":[0.00045049805,0.00080964237,0.018238254,0.00040229745,0.00034740518,0.0015955291,0.0003727796,0.47911325,0.012452507,0.34371686,0.14227165,0.00022934507],"about_ca_topic_score_codex":0.0023940965,"about_ca_topic_score_gemma":0.0020781653,"teacher_disagreement_score":0.040893942,"about_ca_system_score_codex":0.001822974,"about_ca_system_score_gemma":0.0023651472,"threshold_uncertainty_score":0.13680387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7329738,0.00037337706,0.26104748,0.0011150346,0.000026446962,0.000050027716,0.00020588088,0.00024332119,0.003964582],"genre_scores_gemma":[0.96245414,0.0002786297,0.033517934,0.0001163234,0.000021571128,0.00011288535,0.00031263308,0.00012068642,0.0030652646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993426,0.00030467717,0.000021221822,0.00013257809,0.000081448365,0.00011747393],"domain_scores_gemma":[0.9926323,0.0057025286,0.0006492065,0.0004499915,0.00020423818,0.00036169557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028549496,0.0006480983,0.0012362666,0.0012063932,0.0010281052,0.0016942573,0.0018244383,0.0023459084,0.0023359815],"category_scores_gemma":[0.013579512,0.0006296298,0.0015821966,0.00076313625,0.002112387,0.002853154,0.0016817732,0.0017944137,0.00030636546],"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.00021149052,0.000052899963,0.004011649,0.0000655769,0.000077521785,0.00028138194,0.0002951339,0.8996118,0.0019780286,0.08818285,0.00060341996,0.0046282057],"study_design_scores_gemma":[0.000025285013,0.000030397534,0.00035627346,0.000005858415,0.000014578514,0.000047130085,0.000031006653,0.9649555,0.0003007474,0.034010172,0.00020963361,0.000013415456],"about_ca_topic_score_codex":0.0039424994,"about_ca_topic_score_gemma":0.0028451465,"teacher_disagreement_score":0.0039424994,"about_ca_system_score_codex":0.0017326865,"about_ca_system_score_gemma":0.00073741097,"threshold_uncertainty_score":0.015098572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92276365,0.00040673057,0.07091865,0.00013734902,0.00001062584,0.000020257303,0.0020704216,0.0006844854,0.0029878155],"genre_scores_gemma":[0.9369002,0.00022710604,0.056562096,0.000037949605,0.000012631527,0.000021940099,0.0050649955,0.00020742549,0.00096562185],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979097,0.000044118748,0.000009721956,0.000079274054,0.000052507552,0.000023287],"domain_scores_gemma":[0.998691,0.00073923566,0.00013836863,0.00018577887,0.00016878378,0.00007685599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062122406,0.00024606506,0.000366707,0.002214702,0.00040496857,0.0010237844,0.00044187356,0.00047192277,0.0040053213],"category_scores_gemma":[0.003486574,0.0002153634,0.00032675275,0.0011573662,0.00039835356,0.0008130357,0.00058423635,0.00045817817,0.00056571496],"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.0021070677,0.00014780152,0.21938336,0.0005668722,0.00047426907,0.0014885012,0.0018803924,0.19051166,0.27620524,0.04224688,0.003898652,0.26108935],"study_design_scores_gemma":[0.00012658689,0.00025548512,0.13853417,0.0001633705,0.00023515032,0.0019511426,0.00059500325,0.78164405,0.033725403,0.028272562,0.014407683,0.00008930664],"about_ca_topic_score_codex":0.0018095579,"about_ca_topic_score_gemma":0.0036065215,"teacher_disagreement_score":0.0040053213,"about_ca_system_score_codex":0.00043140262,"about_ca_system_score_gemma":0.00047508362,"threshold_uncertainty_score":0.013399124},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04502639,0.0005199461,0.9508459,0.00023656969,0.00003126103,0.00003481505,0.00053528824,0.00091010286,0.0018597853],"genre_scores_gemma":[0.2470449,0.00095895235,0.74555665,0.00009834076,0.000075000644,0.00010014988,0.003592945,0.000779072,0.0017939901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988896,0.00035685947,0.000088595836,0.0004174235,0.00014336445,0.00010414738],"domain_scores_gemma":[0.994362,0.0034744407,0.00038564604,0.0011051499,0.00041859545,0.00025424268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031980812,0.00070899614,0.001358689,0.0037402448,0.0020029272,0.003233474,0.0032869643,0.0017388096,0.005582217],"category_scores_gemma":[0.013288223,0.00116152,0.0019084994,0.0053054243,0.0024018863,0.004509446,0.0034006387,0.0026081472,0.0012352961],"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.000777983,0.00012594672,0.005391617,0.0007167566,0.00015124191,0.00063944195,0.0016784124,0.23751558,0.014413093,0.5505597,0.002203771,0.18582651],"study_design_scores_gemma":[0.00005134104,0.00010240832,0.0010064775,0.00016167361,0.00011962861,0.00022771863,0.00036035266,0.35598242,0.003712165,0.63035774,0.007869025,0.000049073293],"about_ca_topic_score_codex":0.0028951864,"about_ca_topic_score_gemma":0.004854913,"teacher_disagreement_score":0.005582217,"about_ca_system_score_codex":0.0011224417,"about_ca_system_score_gemma":0.0013613967,"threshold_uncertainty_score":0.018674374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24884188,0.0010236377,0.7008313,0.0014229454,0.00026414634,0.00015189276,0.006521951,0.007941923,0.03300028],"genre_scores_gemma":[0.6251816,0.0008939279,0.33613336,0.00020936115,0.00006702045,0.00014667485,0.007490236,0.0016618876,0.02821596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998467,0.000027084603,0.000004430084,0.000054483095,0.00004551959,0.000021828191],"domain_scores_gemma":[0.99937797,0.00035309602,0.00003337958,0.00011183804,0.00010126935,0.000022457634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031918046,0.00040463018,0.00043350938,0.001804376,0.00052123645,0.0010081375,0.0005447561,0.00067952776,0.017389828],"category_scores_gemma":[0.0015451168,0.00033262806,0.000801162,0.0015325141,0.00043121076,0.0008101858,0.00042045617,0.00081973086,0.0017275978],"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.00043261432,0.00007922335,0.01280012,0.0004257523,0.00015945155,0.000938421,0.0010814709,0.45443416,0.069100276,0.15389383,0.037127174,0.26952764],"study_design_scores_gemma":[0.000062345054,0.00004971737,0.010390099,0.000051582647,0.00005799814,0.00037538508,0.00022158325,0.8687362,0.015180141,0.064474195,0.040362693,0.000038050952],"about_ca_topic_score_codex":0.015509464,"about_ca_topic_score_gemma":0.018002257,"teacher_disagreement_score":0.017389828,"about_ca_system_score_codex":0.00076351746,"about_ca_system_score_gemma":0.00052626285,"threshold_uncertainty_score":0.05817479},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0848865,0.001996086,0.82216746,0.0006283722,0.00026857236,0.00024562006,0.009524686,0.0749602,0.005322477],"genre_scores_gemma":[0.13800484,0.0006543643,0.8373684,0.00029150947,0.00007928527,0.0001861514,0.01655626,0.004581806,0.0022772744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985738,0.00019631686,0.000092255505,0.00044565523,0.0005972664,0.000094722185],"domain_scores_gemma":[0.9955669,0.0017217483,0.00070875057,0.0006243394,0.0011274563,0.00025077403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025321506,0.0014823921,0.0013177464,0.003022879,0.00084740506,0.0016104839,0.0019583493,0.001127319,0.0054508797],"category_scores_gemma":[0.0076595726,0.001164875,0.0014776067,0.002163278,0.0005716215,0.0022419037,0.0018529422,0.0017698725,0.005188741],"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.0015303103,0.0002779001,0.03333368,0.003247744,0.00074375316,0.0013909616,0.0009046897,0.081282586,0.3606984,0.018599423,0.046460215,0.45153034],"study_design_scores_gemma":[0.00015060382,0.00035761073,0.017969437,0.00024772875,0.00028310172,0.0012233896,0.00030714917,0.631837,0.26504084,0.023813842,0.058535118,0.00023420533],"about_ca_topic_score_codex":0.0021079758,"about_ca_topic_score_gemma":0.0034062525,"teacher_disagreement_score":0.0054508797,"about_ca_system_score_codex":0.00089642924,"about_ca_system_score_gemma":0.0012222897,"threshold_uncertainty_score":0.018234968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020169578,0.0054711886,0.60970604,0.0014433879,0.0011889692,0.00029254527,0.0023839339,0.00600509,0.35333923],"genre_scores_gemma":[0.272347,0.0087438915,0.3471465,0.0014011535,0.0005393625,0.00053058536,0.013222775,0.0034106742,0.3526581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995945,0.000052151478,0.000012174218,0.00017649113,0.000121745725,0.00004295677],"domain_scores_gemma":[0.9997192,0.00009037041,0.000020266718,0.00009846338,0.00004697364,0.000024713177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003370731,0.0008060041,0.00069666206,0.0012685208,0.0009774305,0.0020152002,0.0014455823,0.00092851976,0.043009177],"category_scores_gemma":[0.0012760662,0.00054772693,0.00085991353,0.0015929003,0.0009606828,0.0026147445,0.0017038707,0.0016716078,0.015094609],"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.00010903055,0.00006391367,0.00051813637,0.00039514469,0.00003889625,0.00014810459,0.00018843029,0.013466275,0.029146032,0.56179446,0.04869107,0.3454405],"study_design_scores_gemma":[0.000030838273,0.000068804475,0.0008992235,0.0001200697,0.00004893992,0.0008254328,0.0001615263,0.03550986,0.033872776,0.3351254,0.59329695,0.0000401735],"about_ca_topic_score_codex":0.0007256572,"about_ca_topic_score_gemma":0.0007830641,"teacher_disagreement_score":0.043009177,"about_ca_system_score_codex":0.00087593705,"about_ca_system_score_gemma":0.00058294303,"threshold_uncertainty_score":0.14388007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76509607,0.0002379162,0.23277698,0.00013870027,0.00001034586,0.000028931734,0.00013390358,0.00020329507,0.0013739725],"genre_scores_gemma":[0.8488719,0.00018974181,0.14982882,0.000026899539,0.000008410773,0.000039587718,0.0003784166,0.0001199192,0.00053636177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960285,0.0001342658,0.000020736074,0.00011474904,0.000076048804,0.000051350962],"domain_scores_gemma":[0.99843436,0.00096309197,0.00025677087,0.00015520254,0.000095950185,0.00009468178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011583815,0.00029323273,0.0005918152,0.001158468,0.00065326184,0.0013419943,0.0007712818,0.0007874116,0.0015468738],"category_scores_gemma":[0.0068080374,0.00042420856,0.0007487194,0.0011230685,0.00089776394,0.001300244,0.0010711026,0.001094958,0.00020293819],"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.00088079605,0.00013711496,0.0484066,0.00021143198,0.0001708146,0.00036398036,0.0006835693,0.74875313,0.041667435,0.06057125,0.0004603759,0.09769344],"study_design_scores_gemma":[0.00007751927,0.00026925295,0.02892307,0.000054145927,0.00007316406,0.0002623844,0.00034260596,0.8518319,0.0150369,0.10102536,0.0020471578,0.000056492605],"about_ca_topic_score_codex":0.0013540663,"about_ca_topic_score_gemma":0.0023615058,"teacher_disagreement_score":0.0015468738,"about_ca_system_score_codex":0.00086828705,"about_ca_system_score_gemma":0.0005015566,"threshold_uncertainty_score":0.006299913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049898185,0.0014349736,0.9401123,0.0031692209,0.00014145038,0.00009221749,0.00070372113,0.00043503105,0.004012958],"genre_scores_gemma":[0.3536056,0.0019209847,0.6177524,0.00067814597,0.0009459021,0.0005147042,0.002556241,0.0008929138,0.021133075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682105,0.0013122014,0.00014924732,0.0010235324,0.0003976817,0.00029619588],"domain_scores_gemma":[0.9725453,0.023414383,0.0012567954,0.0010776932,0.00074916676,0.00095669186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007986381,0.0014043241,0.0049190247,0.0019251764,0.0023453538,0.004739845,0.006450855,0.0062683816,0.009683025],"category_scores_gemma":[0.027401054,0.0018034745,0.0023913328,0.003806412,0.0032164184,0.011306663,0.0046633603,0.0059126387,0.0013203191],"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.0005952105,0.00023054917,0.0013848433,0.00034811915,0.00014990407,0.000120993565,0.0002680181,0.74227303,0.0006675966,0.19425744,0.008661724,0.05104261],"study_design_scores_gemma":[0.000058923266,0.000039873357,0.00017662546,0.000021209726,0.000018634022,0.000045625435,0.00006713134,0.76581645,0.00034735995,0.23233084,0.0010528754,0.000024314055],"about_ca_topic_score_codex":0.00575098,"about_ca_topic_score_gemma":0.0043863705,"teacher_disagreement_score":0.009683025,"about_ca_system_score_codex":0.0029241992,"about_ca_system_score_gemma":0.0026828146,"threshold_uncertainty_score":0.042236507},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1872789,0.00036311903,0.78248626,0.0005382774,0.000518043,0.00041518285,0.0016883921,0.019528482,0.007183339],"genre_scores_gemma":[0.11641771,0.00008611237,0.87079775,0.00028378857,0.000052534124,0.00029883327,0.00491648,0.0027064593,0.004440314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990802,0.00021851798,0.000050472543,0.00036376255,0.00018312388,0.000103903825],"domain_scores_gemma":[0.99751735,0.0005660087,0.00014708223,0.0011798372,0.00042956087,0.000160163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002551751,0.001042176,0.0010212128,0.0021825575,0.0019651253,0.0017072798,0.0024062376,0.0011286583,0.009942256],"category_scores_gemma":[0.0067272442,0.00058181514,0.001332522,0.0016694489,0.0007470449,0.0012324495,0.0032164385,0.001822509,0.0034941453],"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.001970153,0.00047885525,0.019181767,0.0007304018,0.00059452694,0.0012403998,0.00328354,0.044312973,0.09444547,0.033854377,0.02724892,0.77265865],"study_design_scores_gemma":[0.00033569394,0.00085586647,0.009372919,0.00016955179,0.0005703663,0.00130964,0.001415531,0.6175256,0.12900437,0.06724799,0.17204979,0.00014273035],"about_ca_topic_score_codex":0.0012726348,"about_ca_topic_score_gemma":0.0025240558,"teacher_disagreement_score":0.009942256,"about_ca_system_score_codex":0.0004852118,"about_ca_system_score_gemma":0.0009828396,"threshold_uncertainty_score":0.033260167},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034681406,0.00062955223,0.95067036,0.0009467639,0.00022831287,0.00023711208,0.00048300176,0.0016920164,0.0104313865],"genre_scores_gemma":[0.14266178,0.00026369467,0.8500208,0.00031605584,0.00012110091,0.0003594537,0.001341408,0.0003522018,0.004563493],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848586,0.00035064036,0.00006526713,0.00035428163,0.00044728073,0.00029666454],"domain_scores_gemma":[0.99752814,0.0013320645,0.00013711263,0.000523147,0.00032236916,0.00015715514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001279174,0.0013613967,0.002073269,0.0015466639,0.0012619621,0.002716769,0.0038200135,0.0021501337,0.010051819],"category_scores_gemma":[0.0065941494,0.0006810361,0.0013818692,0.0033163938,0.0010518819,0.0041539846,0.0025192664,0.0031843763,0.0018204725],"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.0012964072,0.00063564896,0.0012233183,0.00042244288,0.00014091161,0.00020667283,0.00038599237,0.42500275,0.00757902,0.09455636,0.027595544,0.4409549],"study_design_scores_gemma":[0.00025240926,0.000097286735,0.0002696126,0.000026845326,0.000044665536,0.00011428685,0.000093034076,0.9373463,0.0013889715,0.05516514,0.005179984,0.000021409493],"about_ca_topic_score_codex":0.006317106,"about_ca_topic_score_gemma":0.0087158205,"teacher_disagreement_score":0.010051819,"about_ca_system_score_codex":0.0024184564,"about_ca_system_score_gemma":0.0032847389,"threshold_uncertainty_score":0.033626676},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13111402,0.0032590786,0.70656407,0.0065613817,0.0005859953,0.00026831712,0.0006575548,0.0011587117,0.14983077],"genre_scores_gemma":[0.6069858,0.0011666457,0.3540953,0.0012164,0.00045688462,0.00031438828,0.00093317684,0.00052699505,0.034304403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982749,0.0006146126,0.00010126771,0.0002993435,0.0005238498,0.00018595473],"domain_scores_gemma":[0.993356,0.0040664515,0.00041664593,0.00087742845,0.0009607641,0.00032283345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029403723,0.00052726903,0.0012860885,0.0020120277,0.0012196307,0.002768982,0.002380966,0.0020505376,0.019652091],"category_scores_gemma":[0.021624925,0.0003969943,0.00075439597,0.0023643,0.0017239208,0.0032495353,0.0025991956,0.0019926631,0.002187529],"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.00011271184,0.00006352854,0.0014342895,0.00013407653,0.000028022474,0.00007313778,0.000096485535,0.07658148,0.000457337,0.78847814,0.011890061,0.12065069],"study_design_scores_gemma":[0.00005469828,0.000046144854,0.0004549769,0.000038400794,0.000019484924,0.00013424238,0.00005279304,0.59663975,0.00047246218,0.38989553,0.012173661,0.000017893675],"about_ca_topic_score_codex":0.006443439,"about_ca_topic_score_gemma":0.0051783985,"teacher_disagreement_score":0.019652091,"about_ca_system_score_codex":0.0023070471,"about_ca_system_score_gemma":0.0018376845,"threshold_uncertainty_score":0.06574279},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018299978,0.088614754,0.8282275,0.04855174,0.0019032088,0.00017205237,0.0017485891,0.004115226,0.008366874],"genre_scores_gemma":[0.07989572,0.065761454,0.83586913,0.0046950555,0.0036372868,0.0003540465,0.005113316,0.0018561027,0.0028179053],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9910335,0.00465706,0.0005652012,0.001868652,0.0016114702,0.0002641148],"domain_scores_gemma":[0.94050527,0.047960225,0.0013783437,0.004266899,0.0050530015,0.00083623175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022460466,0.0015771369,0.0039278967,0.0026595579,0.0014100578,0.010499713,0.0073256036,0.003643509,0.0062997267],"category_scores_gemma":[0.05296068,0.0015957488,0.0011802353,0.0077644982,0.0041920478,0.013917605,0.003777699,0.0064916266,0.0062465705],"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.0007485552,0.00024909552,0.0036153742,0.0034514447,0.0003428335,0.00015891247,0.0006112629,0.023434894,0.006652748,0.14056017,0.039808743,0.78036594],"study_design_scores_gemma":[0.0001598649,0.00020235854,0.002763816,0.0010449608,0.00015803045,0.0007573643,0.0012395149,0.16038768,0.0042038593,0.7405991,0.08831375,0.00016963507],"about_ca_topic_score_codex":0.0027622972,"about_ca_topic_score_gemma":0.0037539813,"teacher_disagreement_score":0.022460466,"about_ca_system_score_codex":0.0018444951,"about_ca_system_score_gemma":0.0035525092,"threshold_uncertainty_score":0.11878371},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27526042,0.001025609,0.71713114,0.00029350596,0.000029865058,0.00007340637,0.002601353,0.002367923,0.00121673],"genre_scores_gemma":[0.5610121,0.0007932892,0.4284571,0.00008052174,0.000037941147,0.00008754818,0.007717422,0.00048975635,0.001324345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991737,0.00019079701,0.000043471606,0.0003165507,0.0001950895,0.00008037823],"domain_scores_gemma":[0.9940929,0.004676277,0.00030743482,0.00045051458,0.00029323972,0.00017971722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011172901,0.0011214756,0.0014353776,0.0047135595,0.0008343375,0.0019173723,0.0019609344,0.0012283553,0.002079748],"category_scores_gemma":[0.008163681,0.0010186427,0.00138228,0.00260732,0.00089815847,0.0022363192,0.0013631223,0.0022460823,0.0009790275],"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.0018157315,0.00032829083,0.04394316,0.00060930767,0.00038472502,0.0007992515,0.0005734679,0.5538929,0.03310099,0.02625282,0.003227059,0.33507237],"study_design_scores_gemma":[0.000107957996,0.00007628083,0.00463414,0.000037437738,0.00012702534,0.00021917494,0.00014200233,0.9348621,0.0075416914,0.050214533,0.001999227,0.00003846117],"about_ca_topic_score_codex":0.009560551,"about_ca_topic_score_gemma":0.01272181,"teacher_disagreement_score":0.009560551,"about_ca_system_score_codex":0.00080352445,"about_ca_system_score_gemma":0.0012405,"threshold_uncertainty_score":0.019009829},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039478216,0.0012023342,0.94844866,0.00044837568,0.0001804944,0.000100632955,0.0020582522,0.0023636653,0.005719473],"genre_scores_gemma":[0.28354815,0.001387035,0.7027293,0.0005032216,0.0003606916,0.000263797,0.0050178943,0.0011640313,0.0050257966],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99731284,0.00065212004,0.00019915622,0.00083451264,0.0008483085,0.00015312243],"domain_scores_gemma":[0.98942494,0.005399158,0.0010714758,0.0020435876,0.001672362,0.000388449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002381563,0.000837906,0.00089406,0.003195466,0.0007779451,0.0022023176,0.0025237796,0.0012505678,0.0055150166],"category_scores_gemma":[0.020339474,0.00045136787,0.0010492941,0.004795299,0.001433625,0.0039933287,0.0020770826,0.0023493695,0.002034663],"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.00047903156,0.00020447238,0.017595839,0.001230722,0.00023392035,0.0006940574,0.00054256653,0.31931975,0.011433061,0.28015622,0.017254692,0.35085565],"study_design_scores_gemma":[0.000070770555,0.00017863583,0.0045947996,0.00012146082,0.000063597574,0.0011580245,0.00017005103,0.5143614,0.009308556,0.44281834,0.02702911,0.0001253384],"about_ca_topic_score_codex":0.002635528,"about_ca_topic_score_gemma":0.0026305916,"teacher_disagreement_score":0.0055150166,"about_ca_system_score_codex":0.0011533019,"about_ca_system_score_gemma":0.001085632,"threshold_uncertainty_score":0.018449545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073462114,0.0019949838,0.90099484,0.0020722256,0.00010586687,0.00019248166,0.001056725,0.00059333094,0.019527439],"genre_scores_gemma":[0.45196018,0.0026084564,0.5285277,0.00097282743,0.0006100433,0.00055835804,0.0037209336,0.00043604773,0.010605509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958087,0.001511027,0.00028207808,0.0008895878,0.0009929138,0.00051575445],"domain_scores_gemma":[0.9856947,0.010076079,0.0011097703,0.0013296696,0.0011703292,0.0006193149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032619939,0.00120635,0.0015923217,0.005093599,0.0021887962,0.0037895255,0.00267462,0.0028673809,0.010322178],"category_scores_gemma":[0.022364113,0.00058772415,0.0020288252,0.004164688,0.0028876928,0.01332624,0.0039132526,0.0036357674,0.0018266046],"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.00014754928,0.00010819372,0.0025331187,0.0002392167,0.000040616356,0.00017799843,0.00023815643,0.06479635,0.0017974204,0.8715253,0.00543051,0.052965574],"study_design_scores_gemma":[0.00002228185,0.00008215211,0.00041342786,0.00006493933,0.000026356214,0.00036996085,0.00012426988,0.14759819,0.0010446188,0.8442963,0.0059088487,0.000048559923],"about_ca_topic_score_codex":0.0012490056,"about_ca_topic_score_gemma":0.0011639228,"teacher_disagreement_score":0.010322178,"about_ca_system_score_codex":0.0018297796,"about_ca_system_score_gemma":0.0016139884,"threshold_uncertainty_score":0.034531116},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24555704,0.00064372626,0.75016785,0.00041671714,0.000035048874,0.000053096726,0.0004222775,0.00087230245,0.001831978],"genre_scores_gemma":[0.7829677,0.00033171306,0.21336389,0.00019219868,0.00007014901,0.0001491163,0.0016140832,0.00033031302,0.0009807716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991586,0.00038705792,0.00003586034,0.00020989639,0.0001352163,0.000073349715],"domain_scores_gemma":[0.99549353,0.0029785458,0.00023945731,0.0007097555,0.00039817663,0.00018055494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002710352,0.00052817096,0.0013781072,0.001953298,0.00087908504,0.0014529257,0.0024034556,0.0014210173,0.0021915087],"category_scores_gemma":[0.010253856,0.0006260611,0.0012415627,0.0012933483,0.000810947,0.0021427588,0.0018131955,0.0014873714,0.00039015544],"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.00012773926,0.000056485474,0.008281053,0.000055044864,0.00020273651,0.000105545274,0.00017938999,0.91496503,0.001824144,0.015990451,0.0007769295,0.057435498],"study_design_scores_gemma":[0.0000069028943,0.000012500433,0.00047403484,0.000006115077,0.000014945672,0.000023154647,0.000019133224,0.9874113,0.00024494543,0.011478359,0.00030264698,0.000006035609],"about_ca_topic_score_codex":0.0026661314,"about_ca_topic_score_gemma":0.0048554493,"teacher_disagreement_score":0.002710352,"about_ca_system_score_codex":0.0008357606,"about_ca_system_score_gemma":0.0007381366,"threshold_uncertainty_score":0.014333904},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016049454,0.00026313108,0.96714157,0.00021461921,0.00018707676,0.00024842142,0.0008286264,0.0041895583,0.010877545],"genre_scores_gemma":[0.08511379,0.00016192105,0.88534236,0.00021564851,0.00008614205,0.0004075014,0.0031565758,0.00082437496,0.024691679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916613,0.00017120641,0.000040926065,0.00021259223,0.0002899806,0.00011913931],"domain_scores_gemma":[0.9991436,0.00018559667,0.00003607817,0.0003279228,0.00026116354,0.00004558034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005748051,0.0006789115,0.0009129068,0.0011245979,0.0009306871,0.0009879523,0.0020545775,0.0012523398,0.02973182],"category_scores_gemma":[0.002109471,0.0004655835,0.00083752,0.0015235621,0.000379331,0.0012798967,0.0017046462,0.0012189315,0.011237454],"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.0005940687,0.00025141766,0.0009187621,0.00021137999,0.00009685687,0.00012483343,0.00012054882,0.10666664,0.029037042,0.042056587,0.036102854,0.7838191],"study_design_scores_gemma":[0.00018346582,0.00019005497,0.0008011669,0.00002822965,0.00007935676,0.00022228682,0.000053583233,0.8971366,0.019339083,0.03518335,0.04674747,0.0000353428],"about_ca_topic_score_codex":0.003810441,"about_ca_topic_score_gemma":0.006387243,"teacher_disagreement_score":0.02973182,"about_ca_system_score_codex":0.0006863379,"about_ca_system_score_gemma":0.0016202296,"threshold_uncertainty_score":0.09946281},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20088714,0.0006116458,0.7811496,0.002070144,0.00008465279,0.0002479497,0.0032633445,0.0017761915,0.009909277],"genre_scores_gemma":[0.7091494,0.00045897273,0.2832461,0.0002788338,0.00008819136,0.00016635197,0.004217862,0.0003195577,0.0020747783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815947,0.00058203045,0.00012688628,0.00063158985,0.00031854003,0.00018148722],"domain_scores_gemma":[0.9879631,0.008660353,0.0008837949,0.0014513662,0.00062596676,0.00041547493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199732,0.00076609966,0.000721015,0.002332053,0.0016442005,0.002411675,0.0017954551,0.0018214786,0.0073671085],"category_scores_gemma":[0.015820507,0.0008292964,0.0013745642,0.0028860166,0.0022386464,0.008618729,0.0019039805,0.0022520828,0.00082876044],"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.0005022267,0.00023143544,0.010793517,0.0007974078,0.00010657808,0.00091720786,0.001371371,0.18497059,0.005766375,0.6813866,0.0062615997,0.10689522],"study_design_scores_gemma":[0.000020444737,0.000034476234,0.0010813925,0.00004651911,0.000031502987,0.00044878927,0.00021211864,0.11739146,0.001797812,0.8749796,0.0039293636,0.000026418173],"about_ca_topic_score_codex":0.0017808363,"about_ca_topic_score_gemma":0.001979034,"teacher_disagreement_score":0.0073671085,"about_ca_system_score_codex":0.0019711272,"about_ca_system_score_gemma":0.0012519367,"threshold_uncertainty_score":0.024645448},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007395703,0.032500204,0.02863202,0.350886,0.017747952,0.000051058825,0.00022824142,0.00088054844,0.5616783],"genre_scores_gemma":[0.21228194,0.023505555,0.037265707,0.16620035,0.012234296,0.00018681491,0.00036523084,0.00245547,0.5455047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981219,0.0005660604,0.0000675917,0.00027648636,0.00072457694,0.00024330728],"domain_scores_gemma":[0.995047,0.0021868723,0.0002608996,0.0009917315,0.00084063277,0.00067299156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029750082,0.0004736782,0.00058677123,0.00051031046,0.0030150397,0.005718593,0.0014416394,0.0036032742,0.05899692],"category_scores_gemma":[0.013126305,0.0003808912,0.0005671746,0.0012960562,0.008411836,0.012982626,0.002764343,0.007561645,0.02222876],"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.000082457744,0.00004827585,0.00033245975,0.0001245708,0.000015888441,0.00015527738,0.0006052888,0.0005880423,0.00043862013,0.52301,0.3916032,0.08299593],"study_design_scores_gemma":[0.000011953963,0.00002620285,0.00015781677,0.00011765048,0.0000048405445,0.00034805204,0.00048279358,0.00029484925,0.00028292762,0.25149927,0.7467503,0.000023367698],"about_ca_topic_score_codex":0.0010981974,"about_ca_topic_score_gemma":0.0020974781,"teacher_disagreement_score":0.05899692,"about_ca_system_score_codex":0.0013562901,"about_ca_system_score_gemma":0.00094161514,"threshold_uncertainty_score":0.19736433},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016059725,0.086483635,0.6194116,0.04739528,0.008201745,0.00014983364,0.0008628779,0.001513256,0.21992208],"genre_scores_gemma":[0.20961551,0.103678934,0.46544835,0.017827267,0.00779274,0.0006669328,0.0018365865,0.0022798877,0.19085383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979267,0.00063560175,0.000092845396,0.0006311043,0.00060253683,0.00011125649],"domain_scores_gemma":[0.99754214,0.0012614924,0.000117345066,0.0006721055,0.00028604662,0.00012096578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021625368,0.00083670643,0.0008821204,0.0018983957,0.002516439,0.0054586097,0.0014384422,0.0024209393,0.014672118],"category_scores_gemma":[0.008339382,0.0006697237,0.0009577278,0.0024348637,0.009426663,0.011346384,0.003971187,0.0052605704,0.0038969042],"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.000028735634,0.000015267728,0.0002659931,0.0001204321,0.000014465428,0.000045933255,0.0004569407,0.003412682,0.0004827761,0.8864345,0.0140513405,0.09467093],"study_design_scores_gemma":[0.0000075498233,0.000012642031,0.00017707315,0.00015149494,0.0000057598604,0.00017574929,0.00023179932,0.003285783,0.0004510605,0.6993686,0.29611233,0.000020123762],"about_ca_topic_score_codex":0.0019368532,"about_ca_topic_score_gemma":0.0017950407,"teacher_disagreement_score":0.014672118,"about_ca_system_score_codex":0.0037318678,"about_ca_system_score_gemma":0.0017940403,"threshold_uncertainty_score":0.049083173},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4740371,0.00072100264,0.5169532,0.00040368093,0.000063844374,0.000104809216,0.0004323335,0.0005898015,0.006694236],"genre_scores_gemma":[0.7876879,0.0004597319,0.20531797,0.00009985978,0.000084969455,0.00014353858,0.0013536087,0.0003075478,0.00454492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924856,0.00034910673,0.00002540325,0.00015748714,0.00015820579,0.00006121216],"domain_scores_gemma":[0.99408096,0.0048353374,0.0002888051,0.00033629205,0.00021061876,0.00024806734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016439367,0.00055254897,0.0009612857,0.0024629296,0.0007202231,0.0011170965,0.0024288564,0.0013094996,0.0030737212],"category_scores_gemma":[0.012535106,0.0010216283,0.00089275255,0.0021387374,0.0017412613,0.001947719,0.0019328422,0.0010955966,0.00032602428],"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.00043404452,0.00007154134,0.005606724,0.00016962354,0.00009759108,0.00020330382,0.0004203399,0.75064844,0.0038118032,0.18869445,0.0022493552,0.047592796],"study_design_scores_gemma":[0.000033284414,0.000037462414,0.00079859135,0.000016271992,0.00001040248,0.00007066209,0.00007019409,0.86331326,0.0007194245,0.13425164,0.00066305633,0.000015625417],"about_ca_topic_score_codex":0.0034863902,"about_ca_topic_score_gemma":0.004024494,"teacher_disagreement_score":0.0034863902,"about_ca_system_score_codex":0.0013984911,"about_ca_system_score_gemma":0.00045603022,"threshold_uncertainty_score":0.010282636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009104906,0.00028381543,0.98484147,0.0003664694,0.0000707826,0.00005811112,0.000193425,0.0012351511,0.0038457306],"genre_scores_gemma":[0.15967491,0.00050012796,0.8266256,0.00032659638,0.00024799604,0.0005029363,0.0014937002,0.0012922671,0.009335925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770325,0.00088318577,0.000110671834,0.000610822,0.00053514546,0.00015696266],"domain_scores_gemma":[0.9898443,0.0070507866,0.00034236704,0.001747267,0.000749868,0.00026540327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028904234,0.0016109808,0.0019307827,0.0025968095,0.0019206152,0.0023504135,0.0036161353,0.002407497,0.014438478],"category_scores_gemma":[0.020711005,0.0011387493,0.001799435,0.005234594,0.0027118307,0.0049571055,0.0054275896,0.0036701683,0.0030941146],"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.00054221135,0.00028871757,0.0011524139,0.000283044,0.00009059589,0.00013877341,0.00039404567,0.24825314,0.0025684275,0.40448585,0.016239902,0.3255629],"study_design_scores_gemma":[0.000058829482,0.0000394132,0.00013266712,0.000027761318,0.000018769726,0.000060121234,0.00004360352,0.48208812,0.0010278745,0.5117038,0.004780471,0.000018593792],"about_ca_topic_score_codex":0.0034981172,"about_ca_topic_score_gemma":0.004513877,"teacher_disagreement_score":0.014438478,"about_ca_system_score_codex":0.0014742202,"about_ca_system_score_gemma":0.0024046528,"threshold_uncertainty_score":0.048301518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63546395,0.0007547281,0.30087313,0.0008333612,0.0002748776,0.00006276,0.00008210857,0.00048040412,0.06117469],"genre_scores_gemma":[0.94841903,0.0003390331,0.036015086,0.00010339275,0.00006016989,0.000047100508,0.000036241523,0.00011376382,0.0148661975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998259,0.00004415215,0.0000118494845,0.000024248358,0.00005583511,0.000038110895],"domain_scores_gemma":[0.9996855,0.00013247342,0.000055950874,0.0000346453,0.000041237254,0.00005026925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003793764,0.00033665067,0.0003624748,0.00082253094,0.0006041667,0.0010051194,0.0006136052,0.0009254465,0.0059848786],"category_scores_gemma":[0.0017417272,0.00020177841,0.00036409075,0.00047815824,0.0012462592,0.0016266134,0.000958752,0.00065246195,0.00065017486],"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.000018858425,0.000018065077,0.00017578951,0.000032890868,0.0000042341976,0.000116752926,0.00011132272,0.012005966,0.0050478866,0.97536784,0.00053745694,0.0065630544],"study_design_scores_gemma":[0.00003829598,0.000032777818,0.00019145344,0.000021456748,0.0000071264894,0.0002894193,0.000109376684,0.1330555,0.0054268655,0.85758865,0.003210954,0.000028043547],"about_ca_topic_score_codex":0.00037487887,"about_ca_topic_score_gemma":0.0004025376,"teacher_disagreement_score":0.0059848786,"about_ca_system_score_codex":0.00070461276,"about_ca_system_score_gemma":0.0003049428,"threshold_uncertainty_score":0.020021379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17943114,0.003698712,0.7671165,0.0026946736,0.00025627672,0.0009781899,0.009096142,0.0016545419,0.035073854],"genre_scores_gemma":[0.57683283,0.0034835422,0.3804689,0.0009923484,0.00037581017,0.0011684366,0.021583993,0.0007198698,0.014374201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977108,0.00055667973,0.00014572614,0.0008210502,0.00051229796,0.000253485],"domain_scores_gemma":[0.9913025,0.0059246086,0.0007194501,0.00085524743,0.00077290554,0.0004253363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011546672,0.0010984249,0.0009219829,0.0028264606,0.0018860087,0.0033661998,0.001575515,0.0016842474,0.011557393],"category_scores_gemma":[0.011079477,0.0010290326,0.0014311594,0.0030116788,0.0022941828,0.008574793,0.002743524,0.002996928,0.0015475706],"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.0005080331,0.0001236033,0.0030371556,0.0009611993,0.00012336952,0.00044786753,0.0018998643,0.10334398,0.0059317136,0.77266335,0.016982205,0.09397775],"study_design_scores_gemma":[0.000041230513,0.000054265573,0.0007735253,0.000103397186,0.000041467385,0.00033996525,0.0002669614,0.10179143,0.001416626,0.8762212,0.018921794,0.000028113356],"about_ca_topic_score_codex":0.0022171647,"about_ca_topic_score_gemma":0.0024276034,"teacher_disagreement_score":0.011557393,"about_ca_system_score_codex":0.002713429,"about_ca_system_score_gemma":0.001147841,"threshold_uncertainty_score":0.038663328},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8183675,0.00050263223,0.15673663,0.0008598282,0.00010264292,0.00009878231,0.0005288233,0.00024338518,0.022559883],"genre_scores_gemma":[0.9677643,0.0002319733,0.026926752,0.00022638665,0.00012876789,0.000119139804,0.0006580818,0.000053556952,0.0038910748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981273,0.00047178345,0.00013340198,0.0006041771,0.00034405597,0.0003193196],"domain_scores_gemma":[0.9946654,0.0029478786,0.0009242837,0.0006017266,0.0004363599,0.00042432512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011557158,0.00051298377,0.00070666044,0.0013452612,0.0013386837,0.0022461175,0.0008724664,0.0008476397,0.004031582],"category_scores_gemma":[0.006264432,0.000542589,0.0011300354,0.001239499,0.0037824165,0.004622687,0.002026901,0.0017563392,0.00033936536],"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.00028118363,0.000112613576,0.007902317,0.00010365597,0.00005664543,0.00075099565,0.0015266492,0.0056827483,0.0062982542,0.9509923,0.0013294906,0.02496316],"study_design_scores_gemma":[0.00004864331,0.00012985338,0.0045480235,0.000026879197,0.000042542877,0.0011922391,0.0006633045,0.014386679,0.004218207,0.9695528,0.0051463097,0.00004458264],"about_ca_topic_score_codex":0.0007135866,"about_ca_topic_score_gemma":0.00088846375,"teacher_disagreement_score":0.004031582,"about_ca_system_score_codex":0.0009760188,"about_ca_system_score_gemma":0.000636604,"threshold_uncertainty_score":0.013486922},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025861062,0.00019657431,0.9718551,0.00012633379,0.000010467654,0.00007642434,0.00020668408,0.00020236871,0.0014649605],"genre_scores_gemma":[0.1276611,0.0003889664,0.86754155,0.00011367024,0.00003648456,0.00032814956,0.0014270162,0.00036473043,0.0021383718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819344,0.0005716504,0.00013292037,0.0003766515,0.0005357135,0.0001896208],"domain_scores_gemma":[0.9938019,0.0045716865,0.0005243321,0.00054841634,0.0004316108,0.00012208149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023084844,0.0010711863,0.0011071359,0.0020179304,0.0005922768,0.0012436712,0.0015332206,0.0009741306,0.0031628022],"category_scores_gemma":[0.01010989,0.0007322036,0.0012577669,0.0023250543,0.0015454574,0.0024266683,0.0025721793,0.001531216,0.0008212501],"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.00017178497,0.00013669519,0.0028297282,0.00046237215,0.00006356578,0.00022134962,0.0003042446,0.69592136,0.024146872,0.12986499,0.001664905,0.14421213],"study_design_scores_gemma":[0.000042443502,0.00024326846,0.0011658914,0.00012297844,0.000048732258,0.00015676722,0.00012155229,0.8356105,0.017961962,0.13562423,0.0088644475,0.000037219856],"about_ca_topic_score_codex":0.0029635571,"about_ca_topic_score_gemma":0.0038887763,"teacher_disagreement_score":0.0031628022,"about_ca_system_score_codex":0.0011917861,"about_ca_system_score_gemma":0.0013353481,"threshold_uncertainty_score":0.012208581},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022428605,0.000024631936,0.0012759676,0.00006405004,0.000047155478,0.00005694349,0.995237,0.0017381937,0.0013318135],"genre_scores_gemma":[0.006430875,0.00013947663,0.008828757,0.0003930026,0.000103632636,0.0007437678,0.96951765,0.0058871093,0.007955701],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871635,0.00019510511,0.00015565226,0.0004279046,0.00034603346,0.00015905271],"domain_scores_gemma":[0.97676146,0.01777352,0.0009172477,0.0018502126,0.002165105,0.00053255586],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023538754,0.0016476882,0.0019363988,0.0035906874,0.0013447745,0.0022466732,0.0028105127,0.0013337802,0.8660301],"category_scores_gemma":[0.025154905,0.0009784969,0.0012496326,0.005338851,0.0004207248,0.0022910282,0.0013279471,0.0014226055,0.29531318],"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.00032716058,0.000081773294,0.0015487212,0.0018533655,0.00005652097,0.00008951693,0.0000619964,0.0007094286,0.0006993571,0.001040209,0.98270136,0.0108306715],"study_design_scores_gemma":[0.0024338411,0.00032032933,0.020946285,0.001439992,0.00025853433,0.0009955929,0.0003042548,0.0043407422,0.004520462,0.019087095,0.94507676,0.00027605135],"about_ca_topic_score_codex":0.0052694534,"about_ca_topic_score_gemma":0.0071060136,"teacher_disagreement_score":0.8660301,"about_ca_system_score_codex":0.0013095315,"about_ca_system_score_gemma":0.0019045525,"threshold_uncertainty_score":0.19109172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021541861,0.000043915792,0.0019203797,0.00028738112,0.000057392965,0.000057878253,0.99448687,0.0007795724,0.0021511603],"genre_scores_gemma":[0.01840864,0.0003327803,0.016733875,0.0007457576,0.00018672143,0.0012593011,0.951105,0.0025518422,0.008676206],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988852,0.00026371132,0.0001296384,0.00029236457,0.00030183428,0.0001272354],"domain_scores_gemma":[0.96741307,0.027399356,0.00073767337,0.0024341096,0.001657461,0.00035845797],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002642614,0.001285775,0.0015877368,0.0018800363,0.0011386522,0.0023193934,0.0029864488,0.0017786057,0.8098035],"category_scores_gemma":[0.041482065,0.000950064,0.0012341065,0.004514466,0.0005848335,0.0032569945,0.001366473,0.0023725552,0.14047661],"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.0003486288,0.000086325635,0.001096629,0.0020859558,0.000057469795,0.00010654366,0.000063370644,0.0022588894,0.0002475058,0.005630462,0.97666717,0.011351111],"study_design_scores_gemma":[0.006930803,0.0002900809,0.006789079,0.0017859227,0.00021958721,0.00076531497,0.00034436365,0.015143789,0.002148145,0.123989165,0.8414096,0.00018417496],"about_ca_topic_score_codex":0.004380635,"about_ca_topic_score_gemma":0.0070211347,"teacher_disagreement_score":0.8098035,"about_ca_system_score_codex":0.0014841359,"about_ca_system_score_gemma":0.0021978135,"threshold_uncertainty_score":0.27129215},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048405884,0.000102271646,0.011991117,0.00077129406,0.00022792668,0.0001624279,0.9751379,0.0029316286,0.008191495],"genre_scores_gemma":[0.03166551,0.00057150365,0.058237072,0.001128691,0.00058394467,0.002148652,0.86156756,0.013269269,0.030827694],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999089,0.00021208196,0.00008421552,0.00023709051,0.00026474267,0.00011289116],"domain_scores_gemma":[0.9675239,0.027118213,0.0006507235,0.0019537276,0.0022747456,0.00047874567],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023284901,0.0012565994,0.0013417649,0.0017915658,0.0010008591,0.0019973533,0.0029257317,0.0016344874,0.8831322],"category_scores_gemma":[0.049646482,0.0010341849,0.0011039396,0.0034386432,0.0005465684,0.003095684,0.0012173714,0.0022509634,0.2569064],"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.00014258506,0.00006270397,0.00045134802,0.0008166398,0.00002165863,0.000057569156,0.000025716776,0.0020108167,0.00013091043,0.0058947466,0.9804919,0.009893383],"study_design_scores_gemma":[0.0035768156,0.00022700576,0.0044583483,0.0011420617,0.000094907,0.00083072175,0.00023153407,0.031797152,0.0020905107,0.14153789,0.81384397,0.00016899442],"about_ca_topic_score_codex":0.0046266536,"about_ca_topic_score_gemma":0.0059268735,"teacher_disagreement_score":0.8831322,"about_ca_system_score_codex":0.0016053604,"about_ca_system_score_gemma":0.0024072188,"threshold_uncertainty_score":0.16669762},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048405884,0.000102271646,0.011991117,0.00077129406,0.00022792668,0.0001624279,0.9751379,0.0029316286,0.008191495],"genre_scores_gemma":[0.03166551,0.00057150365,0.058237072,0.001128691,0.00058394467,0.002148652,0.86156756,0.013269269,0.030827694],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999089,0.00021208196,0.00008421552,0.00023709051,0.00026474267,0.00011289116],"domain_scores_gemma":[0.9675239,0.027118213,0.0006507235,0.0019537276,0.0022747456,0.00047874567],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023284901,0.0012565994,0.0013417649,0.0017915658,0.0010008591,0.0019973533,0.0029257317,0.0016344874,0.8831322],"category_scores_gemma":[0.049646482,0.0010341849,0.0011039396,0.0034386432,0.0005465684,0.003095684,0.0012173714,0.0022509634,0.2569064],"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.00014258506,0.00006270397,0.00045134802,0.0008166398,0.00002165863,0.000057569156,0.000025716776,0.0020108167,0.00013091043,0.0058947466,0.9804919,0.009893383],"study_design_scores_gemma":[0.0035768156,0.00022700576,0.0044583483,0.0011420617,0.000094907,0.00083072175,0.00023153407,0.031797152,0.0020905107,0.14153789,0.81384397,0.00016899442],"about_ca_topic_score_codex":0.0046266536,"about_ca_topic_score_gemma":0.0059268735,"teacher_disagreement_score":0.8831322,"about_ca_system_score_codex":0.0016053604,"about_ca_system_score_gemma":0.0024072188,"threshold_uncertainty_score":0.16669762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9115615,0.000115696515,0.07976448,0.00014564568,0.0000590123,0.0017289257,0.001925605,0.0013460849,0.0033529783],"genre_scores_gemma":[0.8506044,0.00012467435,0.13291048,0.00008798764,0.000019158839,0.0013529886,0.009361672,0.00019205807,0.0053466237],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988951,0.00032853548,0.000041541607,0.00017017365,0.00038392274,0.0001807644],"domain_scores_gemma":[0.99777126,0.00051086774,0.00019813282,0.00030955393,0.00093121064,0.0002789491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036491046,0.00068111037,0.0008357374,0.00046320457,0.0007844304,0.00059941504,0.001395125,0.0008329628,0.0016709341],"category_scores_gemma":[0.0025322756,0.00024253466,0.0005797062,0.0003431755,0.0005332197,0.00066196773,0.000718104,0.0010216068,0.0006590604],"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.0074258996,0.009473808,0.06326832,0.0007628813,0.0003526804,0.0007799182,0.0006730988,0.1975347,0.48454502,0.0024502208,0.011848895,0.22088459],"study_design_scores_gemma":[0.0019290878,0.030947417,0.06368152,0.0000699452,0.00021022848,0.0008532377,0.0009712407,0.27980915,0.6051597,0.0010631973,0.015090077,0.00021518704],"about_ca_topic_score_codex":0.006775265,"about_ca_topic_score_gemma":0.011144959,"teacher_disagreement_score":0.006775265,"about_ca_system_score_codex":0.0008171912,"about_ca_system_score_gemma":0.0020026783,"threshold_uncertainty_score":0.019298494},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043559056,0.011721523,0.018507583,0.0052553113,0.009915458,0.00081284955,0.25185212,0.01234316,0.6460329],"genre_scores_gemma":[0.13625598,0.009427423,0.05559592,0.0012288165,0.00073329563,0.00034705192,0.19618765,0.00429596,0.5959279],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996891,0.000012940025,0.000017192408,0.000061221224,0.00015867695,0.000060947954],"domain_scores_gemma":[0.9991104,0.000041071577,0.000054415457,0.000073588315,0.00062219275,0.000098343844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040346594,0.0006271486,0.00039810094,0.0052196975,0.0020291738,0.0012844702,0.0011147052,0.00043329436,0.091122515],"category_scores_gemma":[0.0012574177,0.00034489858,0.00041218745,0.004461858,0.00096613186,0.0006999646,0.00070875697,0.001147506,0.02594548],"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.00018914678,0.00002536671,0.0070757833,0.0007878231,0.000030965097,0.0003667626,0.0010202284,0.0006358416,0.0047317534,0.0042124456,0.7794171,0.20150685],"study_design_scores_gemma":[0.000009542412,0.000007650744,0.02349009,0.000111295216,0.000022103099,0.00025393983,0.00027146252,0.00017704103,0.0007453912,0.00028681481,0.97461176,0.000012907928],"about_ca_topic_score_codex":0.6978754,"about_ca_topic_score_gemma":0.86289996,"teacher_disagreement_score":0.30212462,"about_ca_system_score_codex":0.005991406,"about_ca_system_score_gemma":0.006732804,"threshold_uncertainty_score":0.60780776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34823754,0.006917162,0.16556364,0.18703067,0.001792797,0.00092343206,0.0023206978,0.0026887865,0.2845252],"genre_scores_gemma":[0.8558685,0.004516605,0.10082983,0.0047840164,0.0006043423,0.00043701078,0.0013665825,0.0015373848,0.030055614],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.982452,0.010172266,0.00045337222,0.0009989877,0.003394926,0.0025285226],"domain_scores_gemma":[0.97677076,0.0095738685,0.0017256422,0.00198425,0.0039258115,0.0060197264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028765071,0.00082204124,0.0003255528,0.0017803633,0.0037232172,0.012947934,0.0017112455,0.0022213736,0.0082565015],"category_scores_gemma":[0.02503828,0.00040021905,0.0003940623,0.001966318,0.0029777086,0.009602529,0.009743642,0.0037048652,0.0025630703],"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.0007989169,0.0009880885,0.02460754,0.001479171,0.00008387702,0.0011802543,0.11979393,0.009775365,0.017827556,0.23552568,0.06621217,0.5217275],"study_design_scores_gemma":[0.0000744456,0.0004349853,0.015221427,0.00084479526,0.00003595346,0.00034825748,0.08486252,0.0040046726,0.008173806,0.10791433,0.7779381,0.00014654813],"about_ca_topic_score_codex":0.004726635,"about_ca_topic_score_gemma":0.007867593,"teacher_disagreement_score":0.028765071,"about_ca_system_score_codex":0.0065171216,"about_ca_system_score_gemma":0.012910035,"threshold_uncertainty_score":0.15212601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28036362,0.01771322,0.0019736248,0.00097435724,0.00055002456,0.0004366491,0.0024201546,0.00029885588,0.6952695],"genre_scores_gemma":[0.9559339,0.0034133191,0.0040317867,0.00053651794,0.00023738282,0.00014443422,0.0015522826,0.000034395143,0.034116037],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99990225,0.000011426207,0.0000064230067,0.000032212512,0.000026171288,0.000021434702],"domain_scores_gemma":[0.9999263,0.000018196466,0.000026500105,0.0000051121006,0.000013894751,0.0000099858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007523838,0.0004451049,0.00021040546,0.0011359374,0.001255866,0.0003679149,0.00032984721,0.00045196328,0.011503832],"category_scores_gemma":[0.0001781486,0.00013361353,0.0001853738,0.0005990041,0.0004736554,0.00045221564,0.0005370785,0.0005342308,0.0028916688],"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.0006902319,0.00020592158,0.028199391,0.0014073306,0.00006522762,0.004966022,0.0039041794,0.0007998973,0.04086584,0.00888882,0.024439672,0.8855675],"study_design_scores_gemma":[0.00006396154,0.00023081595,0.60324544,0.0007894879,0.000109420245,0.00614685,0.0018414602,0.00044725146,0.0023266366,0.0012524746,0.38350254,0.000043640284],"about_ca_topic_score_codex":0.015385475,"about_ca_topic_score_gemma":0.040973537,"teacher_disagreement_score":0.015385475,"about_ca_system_score_codex":0.00047508677,"about_ca_system_score_gemma":0.0002648692,"threshold_uncertainty_score":0.038484216},"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":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67193127,0.016657973,0.010335105,0.0006710899,0.0014195855,0.00061306363,0.09610167,0.0008197339,0.20145057],"genre_scores_gemma":[0.77596444,0.006041502,0.023051077,0.00055874063,0.00032035753,0.00027541193,0.10385873,0.0003428361,0.08958691],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999726,0.000025525325,0.000029299836,0.00012390516,0.000055621156,0.000039579514],"domain_scores_gemma":[0.99978286,0.00006158343,0.000058808164,0.000023322573,0.000042460822,0.000031112737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001357589,0.00056994834,0.00039587644,0.0038512014,0.0015518345,0.00077258423,0.00063535926,0.00056361547,0.022290451],"category_scores_gemma":[0.0003154369,0.0001976298,0.0003424689,0.005777019,0.00046171414,0.00080605136,0.00043819513,0.0006539676,0.005630601],"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.0018832525,0.00023437466,0.078805156,0.0027307721,0.00027170856,0.006790259,0.0074287294,0.0008750102,0.1775181,0.0022978953,0.02673907,0.6944257],"study_design_scores_gemma":[0.00003279367,0.00021395663,0.5162802,0.0003130419,0.00013420678,0.0056263832,0.0019283976,0.00018629852,0.0076230955,0.00035003136,0.46727464,0.00003696185],"about_ca_topic_score_codex":0.0060767676,"about_ca_topic_score_gemma":0.012205413,"teacher_disagreement_score":0.022290451,"about_ca_system_score_codex":0.00051503856,"about_ca_system_score_gemma":0.00032865914,"threshold_uncertainty_score":0.07456893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059520775,0.002095214,0.0014910556,0.0002706536,0.00016331288,0.00007755413,0.9726829,0.010446101,0.006821169],"genre_scores_gemma":[0.0042799115,0.00036196038,0.0020309929,0.000117402786,0.000015410122,0.00015013038,0.991193,0.0006997379,0.0011515282],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983169,0.00014525838,0.00007521237,0.00040569715,0.00074132194,0.00031566602],"domain_scores_gemma":[0.99906415,0.00020081618,0.000085014624,0.00028978434,0.0002801164,0.00008017116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010453515,0.0044885785,0.0030847564,0.002716884,0.0024498224,0.0020873453,0.008877693,0.005144429,0.07150704],"category_scores_gemma":[0.0034506267,0.0013752896,0.0034038415,0.0042356583,0.00074691995,0.0026887513,0.002022469,0.0035647424,0.05817354],"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.0002890167,0.00012593363,0.0015475572,0.0028358086,0.00024825736,0.00018250842,0.000039322258,0.003802598,0.0033127146,0.002101583,0.97583777,0.009676906],"study_design_scores_gemma":[0.0007951725,0.00015321134,0.0045505227,0.00043911295,0.0002751229,0.0003827618,0.000116682495,0.010939214,0.012234298,0.004174534,0.9657908,0.00014858025],"about_ca_topic_score_codex":0.027433984,"about_ca_topic_score_gemma":0.04965961,"teacher_disagreement_score":0.07150704,"about_ca_system_score_codex":0.0028578164,"about_ca_system_score_gemma":0.0036629098,"threshold_uncertainty_score":0.2392149},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010861189,0.0006237222,0.5304968,0.00031737657,0.0005164856,0.00036311985,0.01215522,0.41361028,0.04083087],"genre_scores_gemma":[0.014501058,0.0006553834,0.3545041,0.0006772915,0.00021692451,0.0010673887,0.029473394,0.5533837,0.04552076],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99579525,0.00046647835,0.00058069837,0.0006403,0.0019052738,0.00061200524],"domain_scores_gemma":[0.99327844,0.0016154009,0.00028511373,0.002493207,0.0018540553,0.0004737346],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004524996,0.0042841886,0.0027941747,0.0035694558,0.0012179612,0.0053108577,0.008711887,0.0025527512,0.3256995],"category_scores_gemma":[0.016690549,0.0051199556,0.006182114,0.0031386977,0.0012150927,0.0075579956,0.010144915,0.006181561,0.27593774],"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.001070019,0.00020770621,0.0010643207,0.001992134,0.00026015064,0.00044755675,0.0004968906,0.005250211,0.0075394805,0.07366352,0.6208262,0.28718188],"study_design_scores_gemma":[0.0007699438,0.000094250114,0.0007708505,0.00069017324,0.000100881734,0.0004244824,0.00010255878,0.031986155,0.015411654,0.047422815,0.90198827,0.0002379529],"about_ca_topic_score_codex":0.003571797,"about_ca_topic_score_gemma":0.0053284285,"teacher_disagreement_score":0.3256995,"about_ca_system_score_codex":0.0020448538,"about_ca_system_score_gemma":0.0032755255,"threshold_uncertainty_score":0.9618078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075687885,0.037641753,0.05653951,0.0047769337,0.014371093,0.0011917105,0.08844118,0.012716272,0.7086337],"genre_scores_gemma":[0.26319736,0.025345704,0.112366505,0.0020110002,0.0023649791,0.0009594883,0.09988542,0.0047280574,0.48914146],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99981767,0.000013799171,0.00001515239,0.00007845922,0.00005008161,0.000024901196],"domain_scores_gemma":[0.9997507,0.00003422216,0.00003482642,0.000045285014,0.0001037138,0.000031322095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026339098,0.00062497373,0.0002751831,0.003054323,0.001622601,0.000841606,0.00068223104,0.00052741554,0.05714749],"category_scores_gemma":[0.00057544286,0.00024452124,0.00030203868,0.0019869334,0.0007308993,0.00095155515,0.0006167502,0.001008675,0.01845141],"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.00021611094,0.00005534049,0.011240534,0.0018332459,0.000063352585,0.000678566,0.001982199,0.0004018019,0.011410664,0.008428267,0.4548398,0.5088501],"study_design_scores_gemma":[0.0000041893823,0.000010264942,0.014876261,0.000114604554,0.000016069287,0.0004945537,0.00013503317,0.00006959522,0.00041161216,0.0002711788,0.9835902,0.0000064743635],"about_ca_topic_score_codex":0.01729815,"about_ca_topic_score_gemma":0.06911059,"teacher_disagreement_score":0.05714749,"about_ca_system_score_codex":0.0008664061,"about_ca_system_score_gemma":0.0008903926,"threshold_uncertainty_score":0.19117737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020646099,0.000038025424,0.0019676413,0.00022874864,0.00005276605,0.00005656707,0.9943751,0.0011087809,0.0019659495],"genre_scores_gemma":[0.014693883,0.00025994907,0.016345434,0.00058688293,0.00013893386,0.0011507652,0.9560167,0.0034322788,0.007375099],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892455,0.0002337013,0.00011928317,0.00030325275,0.0002912879,0.00012790176],"domain_scores_gemma":[0.9727303,0.022433866,0.00062433246,0.002373847,0.0014792428,0.00035845776],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025324998,0.0013748837,0.0016728768,0.0019838307,0.0011908726,0.0023640322,0.0032720352,0.0017521415,0.82317275],"category_scores_gemma":[0.038180936,0.0010747331,0.0013576361,0.004715289,0.00060345023,0.0032810129,0.0014645961,0.0024232331,0.17014907],"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.0003331568,0.00007349678,0.00090909953,0.0018931666,0.000056533714,0.00009279688,0.00005324102,0.0022277688,0.00025081314,0.0044736806,0.9792244,0.010411855],"study_design_scores_gemma":[0.007253103,0.00028419207,0.0065354514,0.0016097414,0.00022409005,0.00074200117,0.00028978163,0.015381589,0.0025007722,0.10859812,0.8563876,0.00019343248],"about_ca_topic_score_codex":0.003943507,"about_ca_topic_score_gemma":0.006536552,"teacher_disagreement_score":0.82317275,"about_ca_system_score_codex":0.0014479989,"about_ca_system_score_gemma":0.0021303429,"threshold_uncertainty_score":0.2522226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9064317,0.00038390848,0.004553058,0.0040781545,0.000030130228,0.00003602806,0.00020465865,0.000035253266,0.08424717],"genre_scores_gemma":[0.99594903,0.00007110859,0.00040410392,0.000073821175,0.0000043866908,0.000008933567,0.000038307273,0.0000058890264,0.0034443846],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9979036,0.00083936297,0.00003985255,0.00024745404,0.0004032775,0.0005665112],"domain_scores_gemma":[0.992994,0.002872883,0.0014276118,0.00036350638,0.0015763493,0.00076561386],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002660475,0.00024293689,0.0003619817,0.0014877659,0.0031406481,0.005405105,0.0006414904,0.00091306854,0.011045308],"category_scores_gemma":[0.0117589105,0.00016591804,0.00024053024,0.0019493381,0.004469235,0.0020453269,0.0018642545,0.00092922646,0.0005137177],"study_design_candidate":"qualitative","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.00040442887,0.00015952588,0.39769474,0.0002714192,0.00018752276,0.0015124998,0.21259637,0.0054221735,0.004007737,0.23191278,0.0062740925,0.13955669],"study_design_scores_gemma":[0.00004932795,0.00009733702,0.58665675,0.0003746288,0.00013691903,0.00035842025,0.30552202,0.008767126,0.0016394557,0.03638628,0.05990067,0.00011101754],"about_ca_topic_score_codex":0.49355403,"about_ca_topic_score_gemma":0.49238595,"teacher_disagreement_score":0.9968594,"about_ca_system_score_codex":0.0106735835,"about_ca_system_score_gemma":0.008878506,"threshold_uncertainty_score":0.98136246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5362984,0.008867431,0.013299518,0.038682606,0.0012065545,0.00011339649,0.00027230644,0.00028084536,0.40097895],"genre_scores_gemma":[0.9870989,0.0007431248,0.0010722956,0.00024370657,0.0001023154,0.00003941598,0.000046663226,0.000047625934,0.010605922],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997666,0.001462817,0.000025006546,0.00015764807,0.00030136236,0.00038723825],"domain_scores_gemma":[0.9988304,0.0006123965,0.00011310319,0.00013720286,0.00008715791,0.00021972766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021876872,0.0006686963,0.00025557526,0.0016018533,0.0075760395,0.012001113,0.0007269727,0.0015767178,0.009685992],"category_scores_gemma":[0.002040976,0.00022952794,0.00031499876,0.0012504809,0.02055433,0.005856126,0.0066653946,0.0017423774,0.00041101954],"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.00011866389,0.000045212564,0.0046435003,0.0003097548,0.000020900445,0.0022273355,0.49795052,0.001606233,0.0026254714,0.43249664,0.014197655,0.043758087],"study_design_scores_gemma":[0.000023527658,0.00013556519,0.013597599,0.0007090033,0.000020779766,0.0010545079,0.4951802,0.0011922453,0.0014033595,0.0660891,0.42050663,0.000087505105],"about_ca_topic_score_codex":0.010414244,"about_ca_topic_score_gemma":0.019443648,"teacher_disagreement_score":0.012001113,"about_ca_system_score_codex":0.0054850094,"about_ca_system_score_gemma":0.0024592457,"threshold_uncertainty_score":0.03979677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.993193,0.0002436784,0.00015844604,0.00007601853,0.000004854861,0.000021020507,0.0007066511,0.000022610611,0.0055736504],"genre_scores_gemma":[0.99019194,0.00016954656,0.00038151143,0.000035989684,0.0000018762584,0.000009447201,0.00034271288,0.000007692615,0.008859371],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99982893,0.0000054232646,0.000004810266,0.00003648998,0.000079479425,0.00004485836],"domain_scores_gemma":[0.99973816,0.000012101924,0.000018500754,0.000004740239,0.00018329763,0.000043169035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013946189,0.00025083666,0.00023717308,0.0013135392,0.0019331734,0.00075254776,0.00058487925,0.0003561827,0.0026020773],"category_scores_gemma":[0.00032048003,0.00018728743,0.00014163631,0.0010199711,0.00060992985,0.00018301235,0.00036316953,0.00020983508,0.00033042228],"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.00062448735,0.00006965514,0.8147257,0.0002569249,0.00015956086,0.0017783467,0.0073465332,0.0029660123,0.11585945,0.001162489,0.003052917,0.051997844],"study_design_scores_gemma":[0.000009732191,0.00002882214,0.99257386,0.000020958916,0.000011907629,0.00007426133,0.0015959621,0.00071030576,0.001699182,0.000031559615,0.0032345646,0.000008922367],"about_ca_topic_score_codex":0.9828897,"about_ca_topic_score_gemma":0.99573696,"teacher_disagreement_score":0.017110288,"about_ca_system_score_codex":0.014930231,"about_ca_system_score_gemma":0.0065716077,"threshold_uncertainty_score":0.10832691},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003912306,0.0031503998,0.0036878444,0.20492864,0.022727473,0.0001123846,0.020914622,0.010199531,0.7303667],"genre_scores_gemma":[0.019129813,0.0020828217,0.004142474,0.016125027,0.0018553578,0.00003740338,0.008815589,0.0031490051,0.94466245],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99718386,0.00010782024,0.00003408573,0.00013543885,0.0017286397,0.0008101168],"domain_scores_gemma":[0.9920372,0.00043898288,0.00011700807,0.00036111794,0.0044701733,0.0025755356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026344778,0.00073004194,0.00048516388,0.0014917253,0.006067901,0.00924637,0.0014379546,0.0027732037,0.20855638],"category_scores_gemma":[0.010232175,0.0003320432,0.0006345499,0.0022660969,0.0019447355,0.0024200215,0.0018000989,0.00412306,0.05571286],"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.000016450718,0.000007989793,0.00026391956,0.0000093646695,0.0000019945608,0.000022063305,0.000021507407,0.000046038112,0.00005415993,0.0025152082,0.98166615,0.015375218],"study_design_scores_gemma":[0.000007948121,0.0000037721913,0.00093396386,0.00003746563,0.0000020975815,0.00001836454,0.000108406966,0.00015861954,0.00014012418,0.0011460388,0.9974318,0.000011286928],"about_ca_topic_score_codex":0.772243,"about_ca_topic_score_gemma":0.89544713,"teacher_disagreement_score":0.22775698,"about_ca_system_score_codex":0.016162643,"about_ca_system_score_gemma":0.048957545,"threshold_uncertainty_score":0.6976906},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016343279,0.009790891,0.00021690209,0.92807937,0.01264182,0.00013612627,0.00047762645,0.00006708845,0.032246962],"genre_scores_gemma":[0.08184788,0.0075757797,0.00049562426,0.7953119,0.0039315205,0.0005118503,0.00018871827,0.00010088009,0.11003582],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988668,0.0004754556,0.00004015155,0.00012537128,0.00019130697,0.00030096553],"domain_scores_gemma":[0.9943574,0.0010532461,0.00027341032,0.00005893074,0.0010216747,0.003235274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027465026,0.00047602103,0.0006672213,0.0007053471,0.01134008,0.0027973081,0.00091627525,0.004140528,0.026911648],"category_scores_gemma":[0.009143298,0.0005004539,0.00023827325,0.00078037125,0.0017420821,0.0029690005,0.0027751112,0.011538446,0.00571595],"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.000027414759,0.00003731676,0.001163743,0.00007662848,0.000002711624,0.00074022997,0.012554803,0.00001393168,0.0001451382,0.00077479973,0.9793459,0.0051174522],"study_design_scores_gemma":[0.000013413337,0.00003806084,0.002427406,0.0002607896,0.000004138229,0.0008956879,0.09087889,0.00003414899,0.00007797245,0.00037597315,0.9049598,0.00003383739],"about_ca_topic_score_codex":0.044810858,"about_ca_topic_score_gemma":0.09006576,"teacher_disagreement_score":0.044810858,"about_ca_system_score_codex":0.0048194327,"about_ca_system_score_gemma":0.006278881,"threshold_uncertainty_score":0.090028405},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09463178,0.0025695276,0.8832985,0.0007497389,0.00025777216,0.00025703915,0.0012965006,0.009049301,0.007889875],"genre_scores_gemma":[0.14128017,0.0015885363,0.8486318,0.00048377883,0.000052762534,0.00030773075,0.0015306277,0.00042780896,0.0056967996],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994815,0.00017357826,0.000021156548,0.000101134676,0.00017384595,0.00004876214],"domain_scores_gemma":[0.9994192,0.00034589643,0.000033103912,0.000065421096,0.00010055127,0.0000358504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014977582,0.0005879354,0.00047677552,0.0006710162,0.00044358004,0.00087703904,0.00069143676,0.00074816233,0.0041034897],"category_scores_gemma":[0.0019177045,0.0005106703,0.00067067385,0.00092843926,0.00032938246,0.00065369095,0.00063071394,0.0013269546,0.0014086773],"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.0004570711,0.0002390704,0.0020915018,0.00032978947,0.00012517693,0.00010658213,0.00013506331,0.021470642,0.6381036,0.013140678,0.0076860385,0.3161147],"study_design_scores_gemma":[0.000079298574,0.00028316997,0.0024938441,0.000039940507,0.00008140321,0.00026077873,0.00005236824,0.3072444,0.6469305,0.013964258,0.02851154,0.00005844211],"about_ca_topic_score_codex":0.0023545676,"about_ca_topic_score_gemma":0.0055166283,"teacher_disagreement_score":0.0041034897,"about_ca_system_score_codex":0.00061045325,"about_ca_system_score_gemma":0.0009919986,"threshold_uncertainty_score":0.013727486},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3310819,0.0011509587,0.650302,0.0009832713,0.00011212177,0.00022556401,0.0017595926,0.0060315984,0.008353008],"genre_scores_gemma":[0.51167536,0.00060279993,0.47064766,0.00051171356,0.00011011292,0.00023911797,0.0056447107,0.00075295975,0.009815524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983146,0.00047429476,0.00010655752,0.000609944,0.00037478033,0.0001198599],"domain_scores_gemma":[0.9837314,0.013147073,0.0011550429,0.001025662,0.000706233,0.00023473351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023499976,0.0005694168,0.00072953844,0.0027499278,0.0009260737,0.0017259233,0.0015746286,0.0014416772,0.0048433268],"category_scores_gemma":[0.0156594,0.0004554613,0.000547652,0.0019524132,0.0009365946,0.0022111435,0.0010085712,0.0011923754,0.0031351964],"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.0009691955,0.00034128438,0.030652044,0.00027413084,0.00012550027,0.00036214862,0.00034743364,0.06729578,0.038289644,0.017268628,0.0076744584,0.8363998],"study_design_scores_gemma":[0.000087340326,0.00023148721,0.0169652,0.00007593037,0.00006384643,0.00078568346,0.00027811734,0.9128694,0.022620454,0.037765115,0.008215761,0.00004168656],"about_ca_topic_score_codex":0.0031979673,"about_ca_topic_score_gemma":0.006644889,"teacher_disagreement_score":0.0048433268,"about_ca_system_score_codex":0.00059228047,"about_ca_system_score_gemma":0.0012417596,"threshold_uncertainty_score":0.01620251},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011475724,0.0049333028,0.61819124,0.005033924,0.0016538991,0.0009009982,0.14373402,0.017691368,0.19638556],"genre_scores_gemma":[0.1287408,0.009438721,0.40542108,0.0038277693,0.0006821804,0.0015426757,0.32573918,0.003976862,0.12063073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985474,0.00024958124,0.00009636364,0.0006281841,0.0003208255,0.00015766204],"domain_scores_gemma":[0.9983627,0.00051457534,0.00014369922,0.00042613765,0.00043028052,0.00012267778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056771113,0.0014354597,0.0008736203,0.0032085595,0.0016809987,0.0037793107,0.002146323,0.0017488777,0.07047154],"category_scores_gemma":[0.004202138,0.00064968556,0.0019206564,0.004742849,0.0007641842,0.004446817,0.002635311,0.0018744798,0.028853793],"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.00020268017,0.00010785873,0.0016849721,0.0010872189,0.00015549561,0.00064759474,0.0004520511,0.01617999,0.0049178815,0.55352277,0.25220564,0.16883582],"study_design_scores_gemma":[0.000032585496,0.000026822561,0.0005855319,0.00012345653,0.000045377456,0.0004688847,0.00016815131,0.0120245125,0.0014207849,0.29329047,0.691776,0.00003747718],"about_ca_topic_score_codex":0.005610824,"about_ca_topic_score_gemma":0.004459681,"teacher_disagreement_score":0.07047154,"about_ca_system_score_codex":0.0017199109,"about_ca_system_score_gemma":0.0015921298,"threshold_uncertainty_score":0.2357508},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05096695,0.010151028,0.820169,0.007292823,0.0007110744,0.00026055318,0.00809922,0.004511701,0.09783764],"genre_scores_gemma":[0.60512125,0.00856301,0.31944126,0.0036585678,0.0029704785,0.0015052403,0.019520089,0.003119838,0.03610029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9873032,0.005257703,0.0006908141,0.0032006057,0.002615374,0.0009324088],"domain_scores_gemma":[0.8414924,0.14204979,0.0037489468,0.0083426405,0.0023896638,0.001976564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017702114,0.0017806913,0.0036893091,0.007451969,0.0030835762,0.009831931,0.005285827,0.0069404156,0.07533719],"category_scores_gemma":[0.13391195,0.0018345454,0.003559932,0.004836099,0.0046345573,0.0128108375,0.005836944,0.00774495,0.020093724],"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.0015218167,0.00020193883,0.036027126,0.0022913557,0.0013666197,0.0016609468,0.0013821792,0.21428405,0.004552383,0.39548138,0.04203005,0.2992002],"study_design_scores_gemma":[0.0001812799,0.00019297088,0.009500575,0.0012284783,0.00023145975,0.002860897,0.00030901752,0.25966245,0.0025034705,0.6853746,0.03772644,0.00022825411],"about_ca_topic_score_codex":0.0023277248,"about_ca_topic_score_gemma":0.0024110393,"teacher_disagreement_score":0.07533719,"about_ca_system_score_codex":0.004161256,"about_ca_system_score_gemma":0.0016614975,"threshold_uncertainty_score":0.252028},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012659614,0.00031425463,0.984361,0.00027519808,0.000039275248,0.00003435847,0.00012778398,0.0008597912,0.0013288048],"genre_scores_gemma":[0.53879327,0.00074725837,0.44513974,0.00046124973,0.00012024387,0.00032142142,0.0012596969,0.00039714444,0.012760047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992059,0.00020966362,0.000041717092,0.00029717022,0.00015545553,0.00009021873],"domain_scores_gemma":[0.99743867,0.0019195506,0.00014531119,0.00021884053,0.00021463726,0.00006296528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00140644,0.00065649295,0.0011906594,0.0010086918,0.0008007902,0.0012207585,0.002967481,0.001819207,0.0041374266],"category_scores_gemma":[0.0046874387,0.0008509909,0.00150685,0.0013682962,0.0010727093,0.0022225725,0.001381387,0.0018846258,0.0013206525],"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.00019939338,0.00010499299,0.0016831994,0.00011416919,0.000064690044,0.00032037107,0.00018031549,0.85544604,0.0029953723,0.05851264,0.0023450342,0.07803387],"study_design_scores_gemma":[0.000007952353,0.000007881563,0.000047648275,0.0000026347363,0.000005839033,0.000014452958,0.000004182746,0.98675984,0.0003238217,0.0125125935,0.00030858524,0.0000047150656],"about_ca_topic_score_codex":0.009601269,"about_ca_topic_score_gemma":0.007821412,"teacher_disagreement_score":0.009601269,"about_ca_system_score_codex":0.001498874,"about_ca_system_score_gemma":0.001650722,"threshold_uncertainty_score":0.019090772},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99621457,0.00047232735,0.0008720645,0.00001675489,0.0000147712135,0.000009925268,0.00077051035,0.000022211108,0.0016069324],"genre_scores_gemma":[0.99513453,0.0002809724,0.0012812628,0.000011867618,0.0000018366022,0.000006405367,0.00088509714,0.00001931888,0.0023787015],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99983656,0.000013901258,0.000013575623,0.00003703147,0.00006832443,0.000030556806],"domain_scores_gemma":[0.999811,0.000049493185,0.000021460952,0.000012622621,0.00008279543,0.000022574153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020773211,0.000186604,0.0001981311,0.00022953538,0.00021814907,0.00034845754,0.0004300546,0.0002914434,0.0014651066],"category_scores_gemma":[0.00047570828,0.0001336974,0.00025188611,0.000307898,0.0001431217,0.00011237278,0.00013391748,0.00018092302,0.00021589363],"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.0004927941,0.000012333989,0.0006423564,0.000068591886,0.000011605277,0.000032393564,0.00004131871,0.000779224,0.99581677,0.00004443411,0.00010372268,0.0019544454],"study_design_scores_gemma":[0.000013649057,0.00016252763,0.0035731366,0.0000040683844,0.000026292717,0.000042463907,0.00005915156,0.001889727,0.99333453,0.000014573975,0.00086783513,0.000012092093],"about_ca_topic_score_codex":0.025263488,"about_ca_topic_score_gemma":0.02108622,"teacher_disagreement_score":0.025263488,"about_ca_system_score_codex":0.0003935229,"about_ca_system_score_gemma":0.0005297152,"threshold_uncertainty_score":0.050232887},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1565054,0.0021702142,0.83195436,0.000533925,0.00007695801,0.0001662312,0.0006440174,0.0048702434,0.0030786344],"genre_scores_gemma":[0.32344493,0.0011288807,0.6702097,0.00019609634,0.000043937034,0.00013960351,0.0029628775,0.00069153943,0.0011823254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659866,0.0010105964,0.00023291267,0.0009771851,0.0010478349,0.00013290811],"domain_scores_gemma":[0.9927342,0.004628849,0.000508846,0.0009950633,0.00095797586,0.00017502629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004788709,0.0009980933,0.00081507856,0.0035279419,0.00088599144,0.0029762604,0.0019093562,0.0010663138,0.0013383803],"category_scores_gemma":[0.0136059495,0.0004447834,0.0017520088,0.0029485268,0.0009327328,0.003713408,0.0013751914,0.0013181274,0.0004432567],"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.0006544297,0.00037559026,0.044322807,0.0012507468,0.00063790457,0.0004652145,0.001150823,0.1787932,0.03382211,0.065195136,0.00487463,0.66845745],"study_design_scores_gemma":[0.00003029355,0.00019514504,0.0051132003,0.000078989775,0.00009518086,0.00024757662,0.00030263996,0.9442559,0.011183978,0.03171123,0.006730469,0.000055379853],"about_ca_topic_score_codex":0.0047951555,"about_ca_topic_score_gemma":0.007912953,"teacher_disagreement_score":0.0047951555,"about_ca_system_score_codex":0.0010497415,"about_ca_system_score_gemma":0.0016211423,"threshold_uncertainty_score":0.025325418},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24768966,0.0006702002,0.73754525,0.00033067027,0.0001576656,0.0007297263,0.0018698903,0.0010728005,0.009934072],"genre_scores_gemma":[0.6074384,0.0014850142,0.3778063,0.00020153294,0.000029517205,0.0026881953,0.0032911086,0.0003636703,0.0066962517],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908173,0.00030892793,0.00006121199,0.00016782653,0.00031541928,0.00006493426],"domain_scores_gemma":[0.998159,0.0008640297,0.00017371961,0.0005570166,0.00019415452,0.00005198895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017906475,0.00064351724,0.0005577405,0.0006358838,0.00068723195,0.00053759577,0.0010989844,0.00090179854,0.003386787],"category_scores_gemma":[0.0030086492,0.00032119453,0.00078498945,0.00054984697,0.000507014,0.0008123364,0.0006719384,0.0010801711,0.0007329394],"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.00064567995,0.0009787073,0.006542715,0.0005591556,0.00013361705,0.00014120569,0.00023996485,0.22709692,0.6744065,0.036653943,0.0028989266,0.049702663],"study_design_scores_gemma":[0.00015930684,0.0027739513,0.006636691,0.00006022033,0.00014833093,0.00027949782,0.00018337277,0.52625346,0.42910674,0.017920773,0.016365103,0.00011254406],"about_ca_topic_score_codex":0.0015855129,"about_ca_topic_score_gemma":0.0024211947,"teacher_disagreement_score":0.003386787,"about_ca_system_score_codex":0.0009642959,"about_ca_system_score_gemma":0.0005312686,"threshold_uncertainty_score":0.011329949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013167027,0.0006781871,0.0025019173,0.011450348,0.0019957337,0.00022554027,0.02058987,0.004699146,0.94469213],"genre_scores_gemma":[0.033125155,0.00041634683,0.00097393594,0.0021358489,0.00071589585,0.00009722862,0.013318222,0.00090472045,0.9483127],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99764687,0.00012417902,0.00004555596,0.00019576015,0.0015819997,0.0004056198],"domain_scores_gemma":[0.99509406,0.00080015324,0.00033747518,0.00043858038,0.0020238743,0.0013058955],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020110589,0.0007237342,0.0004280456,0.002225137,0.0014584381,0.0041197464,0.0013672417,0.0014273212,0.29956105],"category_scores_gemma":[0.007548699,0.00032079822,0.00059623644,0.0012860077,0.0005552764,0.0016056371,0.0012474766,0.0020282683,0.10562618],"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.00015462779,0.00021355328,0.0025292225,0.000025421135,0.00001022682,0.000040991476,0.000022470218,0.00041655847,0.00039937437,0.004499023,0.9357398,0.055948712],"study_design_scores_gemma":[0.00014195037,0.00013763565,0.012245858,0.000054892964,0.000024327497,0.00006039009,0.00017812275,0.0037169068,0.0033678184,0.0036498955,0.97638243,0.00003980005],"about_ca_topic_score_codex":0.027030956,"about_ca_topic_score_gemma":0.043234788,"teacher_disagreement_score":0.29956105,"about_ca_system_score_codex":0.0027288483,"about_ca_system_score_gemma":0.0046174815,"threshold_uncertainty_score":0.99909115},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068105496,0.0003929294,0.9841531,0.00021605522,0.000046109384,0.00013294625,0.0012696333,0.0059521184,0.0010265533],"genre_scores_gemma":[0.18704855,0.00040091187,0.7995652,0.00043788346,0.00012328828,0.00059514475,0.0071088616,0.0015665932,0.0031535863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823076,0.00055468915,0.00011496457,0.00044306502,0.0005206218,0.00013597963],"domain_scores_gemma":[0.9980804,0.0008148937,0.00016219424,0.0002935292,0.000431337,0.00021771113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032765532,0.0008839715,0.001997592,0.0026006065,0.0008420592,0.0023516538,0.0034604543,0.0015594325,0.0042968695],"category_scores_gemma":[0.009867469,0.00074254815,0.0025851806,0.0014830063,0.0007772734,0.001670907,0.004274359,0.0019696439,0.0022217424],"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.000974769,0.00033537034,0.023398167,0.0007629017,0.0006252882,0.0006136901,0.00077207194,0.43728933,0.010222699,0.05629383,0.025622316,0.44308957],"study_design_scores_gemma":[0.00006294171,0.00004997624,0.00085257844,0.0000478502,0.000038412323,0.000096087846,0.00005402318,0.9542215,0.0011570852,0.03654101,0.0068483087,0.000030137619],"about_ca_topic_score_codex":0.015576436,"about_ca_topic_score_gemma":0.027197415,"teacher_disagreement_score":0.015576436,"about_ca_system_score_codex":0.0015839399,"about_ca_system_score_gemma":0.0022088375,"threshold_uncertainty_score":0.030971527},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1180258,0.05780144,0.09449881,0.018037498,0.007980034,0.001187776,0.48305258,0.031262334,0.18815376],"genre_scores_gemma":[0.63324755,0.04872019,0.05891709,0.0037532304,0.0007559738,0.001177447,0.14315037,0.0028412393,0.107437],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971765,0.000030390434,0.0000069938137,0.000060629623,0.00012100193,0.00006332921],"domain_scores_gemma":[0.99987936,0.000028669045,0.00003102856,0.000015505133,0.000027551434,0.00001797891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003306028,0.0010926411,0.00079379114,0.00075052277,0.00043989014,0.00081745203,0.0009155178,0.0007025054,0.18390046],"category_scores_gemma":[0.00045949052,0.0004245957,0.0008222069,0.0011040221,0.00030291738,0.0006987609,0.0006438546,0.0016210089,0.020820277],"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.00096552604,0.0001843753,0.0013896747,0.0074795946,0.00025908757,0.0010008921,0.00017102445,0.00939303,0.4704394,0.025235273,0.3324579,0.15102431],"study_design_scores_gemma":[0.0003448068,0.00046359238,0.0068428875,0.0005384475,0.0002798925,0.00080169406,0.00017119729,0.009306149,0.2140997,0.011867981,0.7551653,0.00011823291],"about_ca_topic_score_codex":0.0021951308,"about_ca_topic_score_gemma":0.0033647923,"teacher_disagreement_score":0.18390046,"about_ca_system_score_codex":0.00073833886,"about_ca_system_score_gemma":0.0007807963,"threshold_uncertainty_score":0.6152083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97232133,0.0020976744,0.00014736796,0.0026171815,0.00004304263,0.00004319977,0.01895346,0.000032468015,0.0037441803],"genre_scores_gemma":[0.9923308,0.0013608296,0.00012079097,0.00022257643,0.00001465885,0.000013771831,0.004705535,0.000010487193,0.001220573],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989391,0.000081587015,0.00008301421,0.00011661817,0.00028173934,0.0004979926],"domain_scores_gemma":[0.9977004,0.00020063389,0.00053095503,0.00004696139,0.00065098377,0.00087014155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035354708,0.00031297607,0.00035286963,0.0013949941,0.0011394868,0.001428222,0.0014462342,0.00061245856,0.004170912],"category_scores_gemma":[0.0035184212,0.00034303582,0.0006950615,0.0043330467,0.0006495976,0.0004521626,0.0010434595,0.00095077127,0.00033005988],"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.00025047065,0.00007802376,0.9748834,0.00008651982,0.00016471885,0.00031523622,0.00031192214,0.0025925394,0.0001295873,0.00063729956,0.007941574,0.0126086855],"study_design_scores_gemma":[0.000022228513,0.000036277408,0.99420846,0.0000811292,0.00005365377,0.00015405456,0.0011173111,0.0023361892,0.00008096781,0.00012248252,0.0017626545,0.000024675215],"about_ca_topic_score_codex":0.99534106,"about_ca_topic_score_gemma":0.99521244,"teacher_disagreement_score":0.053301603,"about_ca_system_score_codex":0.053301603,"about_ca_system_score_gemma":0.047012523,"threshold_uncertainty_score":0.38673198},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014960098,0.011820477,0.31871587,0.03909799,0.09285118,0.0010545552,0.069392644,0.02282595,0.42928123],"genre_scores_gemma":[0.036949538,0.0032138508,0.13686185,0.0022049788,0.002803562,0.00024735968,0.03141022,0.007989313,0.7783193],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920005,0.00015669568,0.000052228683,0.00022438,0.0002406227,0.00012609646],"domain_scores_gemma":[0.99660754,0.0009454501,0.00012243804,0.00053926307,0.0013694474,0.00041584473],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020158563,0.0011341074,0.0018838348,0.0012848863,0.0019293755,0.00528043,0.0019733084,0.0012166962,0.49040636],"category_scores_gemma":[0.008859112,0.0009194301,0.0009222285,0.002446996,0.0009685046,0.002399681,0.0016831172,0.0012816247,0.17177361],"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.00032845905,0.000057107685,0.0006683512,0.0004941799,0.00007222703,0.0001910096,0.000100483594,0.003213985,0.0035558562,0.010899417,0.81316787,0.16725095],"study_design_scores_gemma":[0.00012157379,0.000064997665,0.0007889768,0.00013362715,0.000030614625,0.00018781636,0.000081056845,0.0097392285,0.0033413656,0.009164741,0.9763059,0.00004012157],"about_ca_topic_score_codex":0.0130365435,"about_ca_topic_score_gemma":0.03012211,"teacher_disagreement_score":0.49040636,"about_ca_system_score_codex":0.0027814116,"about_ca_system_score_gemma":0.0027855253,"threshold_uncertainty_score":0.72687346},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014085245,0.005385564,0.0020582632,0.0397148,0.017669184,0.000691593,0.006424394,0.0013635461,0.91260743],"genre_scores_gemma":[0.018839534,0.0021724596,0.00086935103,0.0057369266,0.0010503199,0.00024396306,0.0012142918,0.00023925811,0.9696339],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988188,0.000108728054,0.000060390474,0.0002165543,0.00043217675,0.00036325108],"domain_scores_gemma":[0.9958781,0.00012426353,0.000114898896,0.000122016114,0.0011786771,0.0025820087],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011459297,0.00095176365,0.00090950564,0.0016977685,0.004023898,0.00430008,0.0013370578,0.0016734009,0.6090388],"category_scores_gemma":[0.0028290974,0.00043929045,0.0006040452,0.000921478,0.0006156229,0.0021902088,0.0038090637,0.0021232814,0.41696543],"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.00010381837,0.0002601291,0.0018260169,0.0002441935,0.0000058185724,0.00043630533,0.0004512736,0.00009676945,0.0007995137,0.003395468,0.885451,0.10692977],"study_design_scores_gemma":[0.00001135982,0.00012577526,0.0025850008,0.00014452185,0.0000044637363,0.0003159452,0.0007482877,0.00012404738,0.00021861227,0.0007920048,0.9949208,0.000009224666],"about_ca_topic_score_codex":0.003532207,"about_ca_topic_score_gemma":0.009173947,"teacher_disagreement_score":0.39096123,"about_ca_system_score_codex":0.0017181525,"about_ca_system_score_gemma":0.003919618,"threshold_uncertainty_score":0.55765873},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07248627,0.00031053787,0.7992101,0.00027452532,0.0001505733,0.00028593713,0.012577289,0.1091561,0.0055486723],"genre_scores_gemma":[0.23724982,0.00034554637,0.7132373,0.00013175863,0.000044422275,0.00061309844,0.032772027,0.012351594,0.003254404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994191,0.000107306594,0.000039631337,0.0001814795,0.0002095628,0.000042926586],"domain_scores_gemma":[0.99880016,0.0006036606,0.00013559048,0.0002307869,0.00016293778,0.00006692874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000992806,0.0015843795,0.00074610894,0.0021284644,0.000911851,0.0016326763,0.002028465,0.0009165255,0.01252733],"category_scores_gemma":[0.0051139765,0.000700079,0.0013114299,0.0016335407,0.0006001267,0.0019612443,0.0023492945,0.0010586375,0.0030111736],"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.0017153983,0.00040415465,0.022136137,0.0042838724,0.0010089342,0.001744461,0.0018090636,0.13713746,0.19463597,0.051702313,0.14037278,0.4430495],"study_design_scores_gemma":[0.00026684723,0.000333511,0.0063095097,0.00016892797,0.00015363343,0.0009958879,0.00049970293,0.8068267,0.07350343,0.050444383,0.060358427,0.00013905497],"about_ca_topic_score_codex":0.002467955,"about_ca_topic_score_gemma":0.004973816,"teacher_disagreement_score":0.01252733,"about_ca_system_score_codex":0.00077269867,"about_ca_system_score_gemma":0.0010637109,"threshold_uncertainty_score":0.041908026},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024601741,0.000024612806,0.0016295222,0.000047324622,0.000028660068,0.000037882557,0.99393696,0.002874083,0.0011750145],"genre_scores_gemma":[0.0052565243,0.00008126822,0.008731802,0.00013087619,0.00003205387,0.00050561526,0.9760572,0.0057716407,0.0034331512],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991229,0.00014090937,0.00009184042,0.00030975312,0.00022155748,0.00011306071],"domain_scores_gemma":[0.99127465,0.0065229186,0.0003841941,0.00074535806,0.00080654514,0.0002663953],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001521973,0.001959371,0.0016297704,0.0031473269,0.001263838,0.0019766046,0.0030353293,0.001431738,0.7535807],"category_scores_gemma":[0.015626198,0.0009550232,0.001083485,0.00528389,0.0005039282,0.002140575,0.0016418064,0.0015187539,0.24100666],"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.00035816254,0.00008664459,0.0014088674,0.002982865,0.00006302386,0.000100040896,0.00012768096,0.00095238956,0.0012332402,0.001390115,0.98062176,0.010675228],"study_design_scores_gemma":[0.0019307713,0.00018914856,0.011127386,0.0011968818,0.00022932621,0.00063700933,0.00041223425,0.005262668,0.0064250743,0.015269063,0.95710796,0.00021253205],"about_ca_topic_score_codex":0.005096887,"about_ca_topic_score_gemma":0.009302825,"teacher_disagreement_score":0.7535807,"about_ca_system_score_codex":0.0011404201,"about_ca_system_score_gemma":0.0017953431,"threshold_uncertainty_score":0.35148722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002173577,0.00002528052,0.0014575355,0.000047140544,0.000031511154,0.000038380258,0.99402654,0.0029214134,0.0012348238],"genre_scores_gemma":[0.004558135,0.00008153139,0.0078096935,0.00012925144,0.000032801374,0.0004826631,0.97651446,0.0066352896,0.0037562053],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909246,0.00014520025,0.00009177021,0.00032298555,0.00022535019,0.00012214767],"domain_scores_gemma":[0.99116474,0.0064501413,0.0003907307,0.00082190766,0.0008738084,0.000298689],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015573811,0.0020126759,0.001725304,0.0034535138,0.0013906724,0.0021317576,0.0032683392,0.0014788229,0.7851268],"category_scores_gemma":[0.015141761,0.0010944068,0.0011480259,0.005749167,0.0005018251,0.0023666362,0.00173392,0.0015904935,0.2823528],"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.000337868,0.00007412412,0.0011284598,0.0026282105,0.00006045705,0.00009202542,0.00012025728,0.00074978353,0.0012177113,0.0012682382,0.9831397,0.009183099],"study_design_scores_gemma":[0.0016425808,0.00016906467,0.010067264,0.0010599126,0.0002057716,0.0005815765,0.00034101456,0.0035327235,0.00559911,0.012199019,0.96439916,0.00020288843],"about_ca_topic_score_codex":0.00477172,"about_ca_topic_score_gemma":0.008317445,"teacher_disagreement_score":0.7851268,"about_ca_system_score_codex":0.0011380418,"about_ca_system_score_gemma":0.0017496828,"threshold_uncertainty_score":0.30649048},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010600488,0.005032701,0.63328725,0.0049990923,0.0016841032,0.0008811103,0.13571395,0.0186556,0.18914571],"genre_scores_gemma":[0.12864406,0.009947326,0.41858548,0.004166421,0.0007209988,0.0016385921,0.31426126,0.004688558,0.117347255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845326,0.00027159203,0.00010069522,0.0006687809,0.00034233907,0.00016329864],"domain_scores_gemma":[0.99821776,0.00058012735,0.00015289566,0.00046297282,0.0004553971,0.00013079145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006038826,0.0015450338,0.0009215807,0.0032601787,0.00173083,0.0038045067,0.0022124504,0.0018594124,0.073316224],"category_scores_gemma":[0.004667233,0.00069347885,0.001965678,0.0048125815,0.00081440504,0.0046618576,0.002726437,0.0019708925,0.031446554],"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.00019588755,0.00010437885,0.0015702795,0.0010911189,0.0001513224,0.00064180564,0.0004625308,0.014543904,0.0046841875,0.5538838,0.25342453,0.1692463],"study_design_scores_gemma":[0.00003255621,0.000025242056,0.00051597937,0.00012150542,0.000045074252,0.00047560502,0.0001603208,0.01064998,0.001414221,0.29652664,0.6899957,0.000037252794],"about_ca_topic_score_codex":0.0052375873,"about_ca_topic_score_gemma":0.004195174,"teacher_disagreement_score":0.073316224,"about_ca_system_score_codex":0.0017471943,"about_ca_system_score_gemma":0.0015774484,"threshold_uncertainty_score":0.24526715},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04159587,0.0006969527,0.92209285,0.0010670192,0.00017589849,0.00038228827,0.00030628187,0.0015985167,0.032084294],"genre_scores_gemma":[0.43297875,0.0010718411,0.53255165,0.0010662379,0.00046976245,0.0012559303,0.0012970984,0.0013891285,0.027919587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964665,0.0012287871,0.00020421139,0.0005296603,0.0010202753,0.00055055844],"domain_scores_gemma":[0.9827152,0.013720384,0.0008174346,0.0015287418,0.0008520455,0.000366198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003869413,0.0013272952,0.001363019,0.0023530785,0.0018966817,0.0027425324,0.0028697485,0.0024114754,0.011607544],"category_scores_gemma":[0.025515033,0.0007019978,0.0021379315,0.0023838899,0.0037428774,0.004701698,0.002820972,0.0024839493,0.0028578273],"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.00042728966,0.00019453836,0.0015307422,0.00030386302,0.00012477259,0.00016825876,0.0002377309,0.17335391,0.0026853401,0.7401767,0.010768935,0.070027955],"study_design_scores_gemma":[0.00010117264,0.00012807644,0.00033780574,0.00005749632,0.00005434254,0.00017242508,0.000052574942,0.4927008,0.0016163249,0.50018895,0.004553759,0.000036306075],"about_ca_topic_score_codex":0.0023049146,"about_ca_topic_score_gemma":0.0025804855,"teacher_disagreement_score":0.011607544,"about_ca_system_score_codex":0.0024670358,"about_ca_system_score_gemma":0.0031917333,"threshold_uncertainty_score":0.038831174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013887169,0.006592415,0.97018236,0.00047585176,0.0002620926,0.000037953116,0.00032551875,0.0034214633,0.017313613],"genre_scores_gemma":[0.037686713,0.015338666,0.9085594,0.0004069983,0.00042031248,0.00020526271,0.0023471592,0.0030169897,0.032018494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940276,0.00008618232,0.000033962187,0.00025167712,0.00018538367,0.00004002136],"domain_scores_gemma":[0.9991986,0.00034138982,0.000038905986,0.00028391936,0.00009775938,0.000039351387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011053897,0.0014694458,0.0015901172,0.0019407183,0.000814712,0.0037048636,0.0034923707,0.0012911488,0.0131253665],"category_scores_gemma":[0.0028129714,0.0011532431,0.0015341919,0.00444782,0.0030296317,0.005822957,0.002198646,0.0028895799,0.012834915],"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.00007296736,0.000035852878,0.00031851965,0.0008938559,0.00004710471,0.000050640723,0.0001413529,0.020553323,0.010795804,0.3062819,0.02870438,0.6321043],"study_design_scores_gemma":[0.000017703502,0.000024330528,0.00034510164,0.00018532555,0.000036646354,0.00039820405,0.0000854048,0.075131066,0.0152002005,0.6992897,0.20923258,0.00005374027],"about_ca_topic_score_codex":0.0017252399,"about_ca_topic_score_gemma":0.002091575,"teacher_disagreement_score":0.0131253665,"about_ca_system_score_codex":0.0016125728,"about_ca_system_score_gemma":0.0012595718,"threshold_uncertainty_score":0.043908715},"labels":[],"label_agreement":null}]}