{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":97,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":97,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"a06ad09ae753","filters":{"venue":"Journal of Discrete Algorithms"}},"results":[{"id":"W1999757901","doi":"10.1016/s1570-8667(03)00022-4","title":"On time versus size for monotone dynamic monopolies in regular topologies","year":2003,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Vertex (graph theory); Monotone polygon; Mathematics; Combinatorics; Hypercube; Simple (philosophy); Network topology; Computation; Dynamo; Discrete mathematics; Graph; Computer science; Topology (electrical circuits); Algorithm; Physics","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Rastislav Kráľovič","is_ca":false},{"name":"Peter Růžička","is_ca":false},{"name":"Alessandro Roncato","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05583863552092819,"gpt":0.4016639778191219,"spread":0.3458253422981937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01057183,0.001799498,0.004578928,0.003789265,0.001773102,0.005750912,0.004547195,0.004147736,0.01784866],"category_scores_gemma":[0.09436822,0.001623704,0.001590796,0.003185238,0.006527532,0.02039712,0.004540093,0.004343066,0.0007702381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003728919,"about_ca_system_score_gemma":0.001877506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002023752,"about_ca_topic_score_gemma":0.001945384,"domain_scores_codex":[0.9964038,0.001626482,0.0001580626,0.0005167275,0.0005407053,0.0007542104],"domain_scores_gemma":[0.7872818,0.1897234,0.00772592,0.004332662,0.003717363,0.007218869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002314545,0.0003597556,0.003778251,0.0008254622,0.0002029224,0.0002598218,0.001345644,0.2339554,0.005134264,0.7078782,0.008077594,0.03586821],"study_design_scores_gemma":[0.0002838483,0.0004272175,0.001406769,0.0001315567,0.0001303463,0.0002853819,0.0005342007,0.3792815,0.001083031,0.6144619,0.001879444,0.00009476695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6245763,0.004405543,0.3167851,0.01113447,0.0003230132,0.0003502791,0.001450113,0.0007364287,0.0402388],"genre_scores_gemma":[0.9592269,0.001908267,0.02964869,0.0005684756,0.000443532,0.0002058523,0.0003728815,0.0004461089,0.007179236],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01784866,"threshold_uncertainty_score":0.05970973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087601184","doi":"10.1016/j.jda.2006.11.004","title":"A simple fast hybrid pattern-matching algorithm","year":2007,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; McMaster University","funders":"","keywords":"Simple (philosophy); Algorithm; Alphabet; Pattern matching; Matching (statistics); Computer science; String searching algorithm; SIMPLE algorithm; Independence (probability theory); Mathematics; Artificial intelligence; Statistics","authors":[{"name":"František Franěk","is_ca":true},{"name":"Christopher G. Jennings","is_ca":true},{"name":"W.F. Smyth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01051105152435427,"gpt":0.2686839309371918,"spread":0.2581728794128376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006342615,0.0008296955,0.001308621,0.001516976,0.0007486737,0.001228173,0.002448566,0.00136897,0.01462062],"category_scores_gemma":[0.001999878,0.0005203615,0.0006896851,0.002567883,0.0003964858,0.002090883,0.002031415,0.0008849023,0.007042623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003677266,"about_ca_system_score_gemma":0.0009874997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001109598,"about_ca_topic_score_gemma":0.001667607,"domain_scores_codex":[0.9990963,0.0001023676,0.00006800306,0.0001982764,0.0004616342,0.00007348677],"domain_scores_gemma":[0.9991785,0.000171315,0.00004042404,0.0002963651,0.0002662458,0.00004727767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004444283,0.0001392127,0.0005068188,0.0001398098,0.00008112357,0.0001035158,0.00002726483,0.01147698,0.03518635,0.008921738,0.007638179,0.9353346],"study_design_scores_gemma":[0.000345295,0.0004321476,0.001418305,0.0000330454,0.0001465459,0.001388134,0.00005973048,0.8594705,0.06810983,0.03567264,0.03284111,0.00008276472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007480626,0.0002167914,0.9875714,0.00008986768,0.0001598785,0.0001160145,0.0001254141,0.002311286,0.001928719],"genre_scores_gemma":[0.0564942,0.0001403986,0.9347717,0.0001399935,0.00007232735,0.0001913397,0.000470101,0.0002335907,0.007486274],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01462062,"threshold_uncertainty_score":0.04891092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061572891","doi":"10.1016/j.jda.2006.07.001","title":"Broadcasting in geometric radio networks","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Node (physics); Computer science; Transmitter; RADIUS; Computer network; Range (aeronautics); Topology (electrical circuits); Telecommunications; Mathematics; Physics; Combinatorics; Engineering","authors":[{"name":"Anders Dessmark","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008412946655087569,"gpt":0.2287349899278767,"spread":0.2203220432727892,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114673,0.0005818506,0.001428431,0.001805694,0.001448248,0.002375486,0.001887975,0.001612678,0.005369254],"category_scores_gemma":[0.01041677,0.000798787,0.000554805,0.00251474,0.002577358,0.003263363,0.00207565,0.00191427,0.0007385018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001781487,"about_ca_system_score_gemma":0.0009119827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002182584,"about_ca_topic_score_gemma":0.00217339,"domain_scores_codex":[0.9989362,0.0004419276,0.00003700222,0.0001490207,0.0002741203,0.0001616701],"domain_scores_gemma":[0.9935138,0.004746647,0.0005900177,0.0003576088,0.000456113,0.0003357906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002404986,0.00006779862,0.0008267633,0.0002116559,0.00004668035,0.0001315132,0.000370782,0.2337213,0.002585978,0.7131113,0.008951301,0.03973435],"study_design_scores_gemma":[0.00008368217,0.00007816008,0.0003391605,0.00003111271,0.00004009524,0.0001835663,0.0001632666,0.4851869,0.0008079222,0.5054834,0.007576507,0.00002625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1637227,0.005384529,0.7746912,0.004771627,0.0006369691,0.0001489599,0.0002681974,0.0006499864,0.04972587],"genre_scores_gemma":[0.8860168,0.005074022,0.08111967,0.0005247205,0.0008289749,0.0001824042,0.0004666583,0.0002018359,0.02558475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005369254,"threshold_uncertainty_score":0.01796192,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079307253","doi":"10.1016/s1570-8667(03)00080-7","title":"The longest common subsequence problem for arc-annotated sequences","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; University of Alberta","funders":"","keywords":"Longest common subsequence problem; Sequence (biology); Subsequence; Arc (geometry); Longest increasing subsequence; Computer science; Matching (statistics); Combinatorics; Algorithm; Similarity (geometry); Artificial intelligence; Mathematics; Biology; Genetics; Statistics","authors":[{"name":"Tao Jiang","is_ca":false},{"name":"Guohui Lin","is_ca":true},{"name":"Bin Ma","is_ca":true},{"name":"Kaizhong Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01808276619542487,"gpt":0.2840613365543329,"spread":0.265978570358908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003806481,0.001222931,0.003166203,0.004079172,0.001672672,0.002847702,0.003209288,0.003636674,0.003753056],"category_scores_gemma":[0.02371774,0.001110935,0.001458503,0.008082368,0.001664225,0.007633507,0.002069648,0.002883465,0.001485683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001255571,"about_ca_system_score_gemma":0.002932861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003049461,"about_ca_topic_score_gemma":0.00249285,"domain_scores_codex":[0.9956802,0.0009231013,0.0006586634,0.001254015,0.001187597,0.0002963222],"domain_scores_gemma":[0.9801831,0.01362304,0.001600959,0.002212939,0.00190901,0.0004708918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002019015,0.0006524173,0.004543444,0.001682068,0.0003505901,0.00137316,0.000734791,0.4003227,0.0110841,0.06610705,0.01834631,0.4927844],"study_design_scores_gemma":[0.0001020975,0.0001703286,0.0006263744,0.00008139972,0.0000595795,0.0004174502,0.0003404545,0.849076,0.004620054,0.1408074,0.003661097,0.00003782267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06659449,0.002253444,0.9235187,0.001458536,0.0002781671,0.0002224278,0.002503175,0.001263458,0.00190763],"genre_scores_gemma":[0.3375968,0.002581039,0.6363041,0.0003377738,0.0007277364,0.0005533927,0.01509445,0.0007314596,0.006073277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004079172,"threshold_uncertainty_score":0.02013087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977410585","doi":"10.1016/j.jda.2006.10.003","title":"Fast pattern-matching on indeterminate strings","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Indeterminate; String (physics); Alphabet; Pattern matching; String searching algorithm; Matching (statistics); Combinatorics; Mathematics; Integer (computer science); Position (finance); Algorithm; Computer science; Discrete mathematics; Artificial intelligence; Pure mathematics; Linguistics","authors":[{"name":"Jan Holub","is_ca":false},{"name":"W.F. Smyth","is_ca":true},{"name":"Shu Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00796072570902388,"gpt":0.2421792449441994,"spread":0.2342185192351755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049315,0.0005697957,0.001261996,0.001696518,0.0006436463,0.001267542,0.001322734,0.001274269,0.003674809],"category_scores_gemma":[0.009190893,0.00040721,0.0004716882,0.003994023,0.0007166137,0.003652381,0.00216459,0.001055324,0.001256565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000408907,"about_ca_system_score_gemma":0.0006175275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005258284,"about_ca_topic_score_gemma":0.0006320143,"domain_scores_codex":[0.9980718,0.0004398934,0.0001952361,0.0003399526,0.0007791488,0.0001738941],"domain_scores_gemma":[0.9954626,0.002341243,0.0002842426,0.001322259,0.0004872645,0.0001024625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001265356,0.000151883,0.00159084,0.0003077963,0.00005980389,0.0004670441,0.0001636862,0.03658244,0.02878079,0.06171308,0.006607987,0.8623093],"study_design_scores_gemma":[0.0001444668,0.0003085317,0.0008082388,0.00005788196,0.00004367735,0.0008444692,0.0001101666,0.7271944,0.04697344,0.2169512,0.006526851,0.00003659256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1155289,0.0008871911,0.8767895,0.0004546167,0.0002507492,0.0001301765,0.0003235214,0.001876987,0.003758427],"genre_scores_gemma":[0.527582,0.0005392635,0.4631462,0.0002489302,0.0001486687,0.0001611981,0.0007173386,0.0002770362,0.007179369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003674809,"threshold_uncertainty_score":0.01229346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002246332","doi":"10.1016/j.jda.2010.08.004","title":"The longest common extension problem revisited and applications to approximate string searching","year":2010,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Substring; String (physics); Extension (predicate logic); Computation; Constant (computer programming); Algorithm; String searching algorithm; Approximate string matching; Preprocessor; Mathematics; Computer science; Range (aeronautics); Pattern matching; Data structure; Artificial intelligence","authors":[{"name":"Lucian Ilie","is_ca":true},{"name":"Gonzalo Navarro","is_ca":false},{"name":"Liviu Tinta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01415779622695565,"gpt":0.29080555133089,"spread":0.2766477551039344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009429348,0.0009828265,0.004001791,0.004516286,0.002503142,0.007049595,0.005287636,0.005562756,0.005595292],"category_scores_gemma":[0.06852252,0.001096863,0.001805304,0.01728913,0.005661457,0.0176616,0.004966496,0.006122372,0.00078921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002249988,"about_ca_system_score_gemma":0.003057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0023311,"about_ca_topic_score_gemma":0.002127227,"domain_scores_codex":[0.9941183,0.002389894,0.0005303835,0.001067913,0.001516132,0.0003773959],"domain_scores_gemma":[0.9505093,0.04005166,0.001985503,0.004362497,0.002311524,0.0007794104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003236599,0.0002490049,0.00183279,0.0005225487,0.0001187651,0.0004776079,0.0005176383,0.1081161,0.001070433,0.7114119,0.008549554,0.16681],"study_design_scores_gemma":[0.00003625396,0.00006059757,0.0002814999,0.00008633062,0.00004305675,0.0004492705,0.0002494001,0.2356748,0.0006100561,0.7559882,0.00647651,0.00004398761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05669967,0.02084058,0.8994584,0.007355302,0.0009002392,0.0001466107,0.0003944445,0.0002652175,0.01393948],"genre_scores_gemma":[0.5148559,0.02415946,0.441655,0.001095702,0.004233433,0.0003211402,0.0009625641,0.0003654719,0.01235128],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009429348,"threshold_uncertainty_score":0.04986775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985142908","doi":"10.1016/j.jda.2008.04.003","title":"Yet another optimal algorithm for 3-edge-connectivity","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Algorithm; Enhanced Data Rates for GSM Evolution; Graph; Connectivity; Edge contraction; Mathematics; Computer science; Combinatorics; Line graph; Voltage graph; Artificial intelligence","authors":[{"name":"Yung H. Tsin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02465649113162753,"gpt":0.2608431391470576,"spread":0.23618664801543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008918062,0.001474511,0.001589124,0.001103661,0.001750462,0.002523782,0.00321874,0.00335488,0.01864746],"category_scores_gemma":[0.00405593,0.000703257,0.001566142,0.001965261,0.001150109,0.006007541,0.003001375,0.002906608,0.002391866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001691531,"about_ca_system_score_gemma":0.002269802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002134671,"about_ca_topic_score_gemma":0.004028137,"domain_scores_codex":[0.9990205,0.0001906177,0.00007390125,0.0003298011,0.0001824292,0.0002026692],"domain_scores_gemma":[0.9986562,0.0004529823,0.00007205985,0.0005114101,0.0001830999,0.0001242544],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001457462,0.0007700659,0.001168893,0.001044426,0.0002538611,0.0002501199,0.0004623104,0.07261342,0.02113905,0.1785105,0.04971224,0.6726177],"study_design_scores_gemma":[0.0009401681,0.0005444611,0.001325062,0.0001786792,0.0003471457,0.0008586496,0.0004631184,0.4842041,0.01869139,0.4497803,0.04251968,0.0001472459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03756061,0.0007068221,0.9319245,0.002602156,0.0006258404,0.0003102252,0.00049205,0.002839177,0.02293877],"genre_scores_gemma":[0.1554656,0.0003725127,0.832815,0.0008450143,0.0001434955,0.0002963378,0.0007730968,0.0005163355,0.008772741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01864746,"threshold_uncertainty_score":0.06238198,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"W. Sean Kennedy","is_ca":true},{"name":"Guohui Lin","is_ca":true},{"name":"Guiying Yan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00895923626441606,"gpt":0.2502875828235165,"spread":0.2413283465591004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001125518,0.0005307553,0.001140584,0.001006796,0.001359839,0.003417596,0.001729916,0.00119052,0.01643393],"category_scores_gemma":[0.01390949,0.0007332052,0.0006963043,0.001437438,0.002623588,0.007154655,0.003131339,0.003218991,0.002869075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009347675,"about_ca_system_score_gemma":0.0006903944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004781576,"about_ca_topic_score_gemma":0.0009722455,"domain_scores_codex":[0.9990852,0.0002508188,0.00004463585,0.0002387173,0.0002438582,0.0001366736],"domain_scores_gemma":[0.9910597,0.006114217,0.0004185557,0.001171515,0.0005815943,0.0006543901],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002728968,0.00007292064,0.001044764,0.000158571,0.00002556011,0.0001233783,0.0005727082,0.006344839,0.002837285,0.9319465,0.007837155,0.04876337],"study_design_scores_gemma":[0.00005376244,0.00002812587,0.0001899703,0.00002111923,0.00001440783,0.0001065378,0.0001538088,0.02055756,0.001115379,0.9710245,0.006726224,0.000008564468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2094701,0.0009170347,0.6696779,0.004014631,0.0004166704,0.0002474836,0.0005945945,0.001059914,0.1136017],"genre_scores_gemma":[0.8041713,0.001236339,0.1408891,0.00124854,0.0003093452,0.00024678,0.000734738,0.0006134869,0.05055054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01643393,"threshold_uncertainty_score":0.05497694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966697435","doi":"10.1016/j.jda.2006.12.008","title":"Fixed parameter algorithms for one-sided crossing minimization revisited","year":2007,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Minification; Vertex (graph theory); Algorithm; Graph; Computer science; Crossing number (knot theory); Combinatorics; Mathematics; Mathematical optimization","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"Henning Fernau","is_ca":false},{"name":"Michael Kaufmann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04929590758097308,"gpt":0.3497608363701669,"spread":0.3004649287891938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006960535,0.002003006,0.002996882,0.001816169,0.001194265,0.003055575,0.005077548,0.00415684,0.008459986],"category_scores_gemma":[0.03071658,0.001506427,0.001878898,0.003146366,0.003425843,0.006812999,0.004508922,0.007509565,0.00139025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001936557,"about_ca_system_score_gemma":0.002035511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003053092,"about_ca_topic_score_gemma":0.002396737,"domain_scores_codex":[0.9970129,0.001599327,0.0001411365,0.0005770998,0.0004775266,0.0001921312],"domain_scores_gemma":[0.9834386,0.01273198,0.0005479642,0.001855741,0.0009900836,0.0004357234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002993238,0.0001802696,0.0006625327,0.0002644986,0.000163529,0.0001073994,0.0002769709,0.407811,0.001543398,0.454417,0.005234779,0.1290391],"study_design_scores_gemma":[0.00003433455,0.00004653618,0.00009491832,0.0000353069,0.00002335035,0.00004112286,0.00002956894,0.7858253,0.0004358971,0.2119522,0.001460466,0.00002104583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004642907,0.0004482579,0.9924086,0.0003440484,0.00007143804,0.00001944558,0.00002108813,0.0001535083,0.001890707],"genre_scores_gemma":[0.1929505,0.0009606928,0.7947341,0.0004016161,0.000248013,0.0002611868,0.0002519366,0.0007461713,0.009445822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008459986,"threshold_uncertainty_score":0.03681129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1575954839","doi":"10.1016/j.jda.2005.12.004","title":"The strength of weak proximity","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Graph drawing","authors":[{"name":"Giuseppe Di Battista","is_ca":false},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Sue Whitesides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008308327042227587,"gpt":0.2407506924496122,"spread":0.2324423654073846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004869614,0.0006207736,0.002056523,0.003279599,0.002671081,0.004894309,0.002053822,0.003086112,0.007450432],"category_scores_gemma":[0.05525423,0.001060173,0.0007848664,0.002181722,0.007483159,0.01248638,0.007755636,0.00387575,0.001005652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000761267,"about_ca_system_score_gemma":0.0008271128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004436813,"about_ca_topic_score_gemma":0.0002971344,"domain_scores_codex":[0.9947186,0.001878615,0.0003384273,0.001102314,0.00162913,0.0003328784],"domain_scores_gemma":[0.952525,0.03198605,0.003268065,0.006102714,0.003787502,0.002330748],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002713374,0.00005423794,0.002264705,0.0002333798,0.00007755576,0.0002259195,0.0004276618,0.009473574,0.002928505,0.954502,0.001998402,0.02754273],"study_design_scores_gemma":[0.0000549229,0.0001810468,0.001178116,0.00004857405,0.00006191741,0.0004810496,0.0003113933,0.03821487,0.001931617,0.9516872,0.005799325,0.00005001975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3475488,0.006004022,0.5424311,0.00912511,0.001239098,0.0001472947,0.0004906537,0.0003900478,0.09262388],"genre_scores_gemma":[0.969909,0.001478685,0.02033644,0.0005630679,0.000699184,0.00009172715,0.0001506731,0.00009055498,0.00668074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007450432,"threshold_uncertainty_score":0.02575326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123306533","doi":"10.1016/j.jda.2005.06.008","title":"Area-preserving approximations of polygonal paths","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Path (computing); Integer (computer science); Monotone polygon; Measure (data warehouse); Approximation algorithm; Discrete mathematics; Geometry; Computer science","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Sergio Cabello","is_ca":false},{"name":"Otfried Cheong","is_ca":false},{"name":"Joachim Gudmundsson","is_ca":false},{"name":"Marc van Kreveld","is_ca":false},{"name":"Bettina Speckmann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01748541103825887,"gpt":0.2625111394373805,"spread":0.2450257283991217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004009886,0.0004638322,0.0005568248,0.001029628,0.0003131405,0.001073989,0.0008777928,0.0005539092,0.002383277],"category_scores_gemma":[0.004069751,0.0004527761,0.0003798619,0.0008970453,0.0007054557,0.0009169137,0.001336003,0.001058721,0.0004084284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004465265,"about_ca_system_score_gemma":0.0003334323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001468029,"about_ca_topic_score_gemma":0.001932717,"domain_scores_codex":[0.9997376,0.00005852454,0.00001113462,0.00003376941,0.0001347982,0.00002431336],"domain_scores_gemma":[0.998917,0.0006027627,0.00009641071,0.0001754533,0.0001457746,0.00006256995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002712764,0.00009006257,0.001175872,0.0001541569,0.00002881737,0.0001608339,0.0003386583,0.7251454,0.00970925,0.1343545,0.001854286,0.1267169],"study_design_scores_gemma":[0.00001305928,0.00003892668,0.0001151377,0.00001346081,0.000006161768,0.00006396612,0.00003969849,0.9663314,0.001690352,0.02910712,0.002575489,0.000005246799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1053846,0.0002948671,0.8842648,0.0001177684,0.00006300021,0.00006230848,0.0001470403,0.0003326565,0.009332987],"genre_scores_gemma":[0.6487054,0.0006509688,0.3434625,0.00005122596,0.00004677852,0.00008160421,0.0002974048,0.0002269872,0.006477112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002383277,"threshold_uncertainty_score":0.007972777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156148354","doi":"10.1016/j.jda.2008.12.002","title":"Algorithms for optimal outlier removal","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Perimeter; Convex hull; Mathematics; Combinatorics; Set (abstract data type); Regular polygon; Bounding overwatch; Point (geometry); Constant (computer programming); Outlier; Minimum bounding box; Algorithm; Mathematical optimization; Computer science; Geometry; Statistics; Artificial intelligence","authors":[{"name":"Rossen Atanassov","is_ca":true},{"name":"Prosenjit Bose","is_ca":true},{"name":"Mathieu Couture","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Pat Morin","is_ca":true},{"name":"Michel Paquette","is_ca":true},{"name":"Michiel Smid","is_ca":true},{"name":"Stefanie Wuhrer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02320484431757027,"gpt":0.3001634790818837,"spread":0.2769586347643135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003051678,0.002351262,0.002920607,0.003301726,0.001634315,0.003026124,0.004014853,0.002848781,0.009571615],"category_scores_gemma":[0.01922415,0.00151307,0.002165011,0.003995508,0.002029046,0.004451043,0.006287855,0.004167989,0.0040782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302677,"about_ca_system_score_gemma":0.002601617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003230063,"about_ca_topic_score_gemma":0.003855424,"domain_scores_codex":[0.9965476,0.000608443,0.0002811032,0.0007745289,0.001413544,0.0003748068],"domain_scores_gemma":[0.9928572,0.003068266,0.0004426877,0.001850605,0.001532563,0.0002486155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006183888,0.0002578912,0.0009837536,0.0002004026,0.0001203182,0.0001244362,0.0001746924,0.1864084,0.005933243,0.05690999,0.01417231,0.7340962],"study_design_scores_gemma":[0.0000876064,0.00006310148,0.0002503619,0.000022505,0.00004344121,0.0001213662,0.00006086152,0.913807,0.004379138,0.07646231,0.004673433,0.00002881655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002459424,0.000185753,0.9954501,0.0001313905,0.00008739474,0.00004414705,0.00005477447,0.0007238499,0.0008631739],"genre_scores_gemma":[0.0573843,0.0002904923,0.9368362,0.0001297889,0.0001544788,0.0002432495,0.0005141716,0.0004250902,0.004022192],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009571615,"threshold_uncertainty_score":0.03202021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035543139","doi":"10.1016/j.jda.2011.03.004","title":"Parameterized complexity of even/odd subgraph problems","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Parameterized complexity; Combinatorics; Induced subgraph isomorphism problem; Mathematics; Cograph; Vertex (graph theory); Pathwidth; Eulerian path; Discrete mathematics; Induced subgraph; Graph; Line graph; Voltage graph; Lagrangian","authors":[{"name":"Leizhen Cai","is_ca":false},{"name":"Boting Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1012913606734593,"gpt":0.3090173922446653,"spread":0.2077260315712059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00233471,0.001268651,0.002051027,0.001009863,0.0019163,0.007190098,0.004351818,0.002337474,0.02027176],"category_scores_gemma":[0.01807057,0.0009386507,0.001967556,0.002741106,0.002241719,0.01287236,0.003325801,0.004634199,0.001358889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004877095,"about_ca_system_score_gemma":0.003535439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004514843,"about_ca_topic_score_gemma":0.0065098,"domain_scores_codex":[0.9967408,0.0009015426,0.000160648,0.0007621826,0.0006731686,0.0007617332],"domain_scores_gemma":[0.9829411,0.01228016,0.001014641,0.002099224,0.000623445,0.001041364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00304435,0.001072252,0.01085104,0.001029432,0.0003207767,0.0005897239,0.001186388,0.2475374,0.01034433,0.5598372,0.04395376,0.1202334],"study_design_scores_gemma":[0.000297459,0.00006957945,0.001320397,0.00004165757,0.0001223728,0.0002346241,0.000347018,0.2740589,0.002672305,0.7163429,0.004458941,0.00003379851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6755803,0.002034819,0.2360554,0.01451526,0.0003957155,0.0004105685,0.006006001,0.001905368,0.06309648],"genre_scores_gemma":[0.925298,0.0009059237,0.0564477,0.0007514333,0.0003582516,0.0002597481,0.004598765,0.0007876042,0.01059261],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02027176,"threshold_uncertainty_score":0.06781578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055575272","doi":"10.1016/j.jda.2008.09.011","title":"Counting distance permutations","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Aeronautics and Space Administration","keywords":"Permutation (music); Metric space; Vector space; Mathematics; String (physics); Point (geometry); Combinatorics; Tree (set theory); Metric (unit); Space (punctuation); Computer science; Discrete mathematics; Pure mathematics","authors":[{"name":"Matthew Skala","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02030679177088083,"gpt":0.2551660287123915,"spread":0.2348592369415107,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002093108,0.001169131,0.001922306,0.004453565,0.003774469,0.006705991,0.003322955,0.002867446,0.02171992],"category_scores_gemma":[0.02061156,0.001043788,0.001575526,0.00648315,0.003587558,0.01367559,0.005703378,0.006257078,0.004124339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002376929,"about_ca_system_score_gemma":0.001545044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008246039,"about_ca_topic_score_gemma":0.0009062673,"domain_scores_codex":[0.9956145,0.001100646,0.0002916672,0.001057987,0.001531396,0.000403771],"domain_scores_gemma":[0.9873545,0.00602151,0.0007507202,0.003460033,0.001524993,0.0008883845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005565649,0.0000354845,0.0005347132,0.00005029397,0.00001495939,0.00003442166,0.00009413389,0.001469613,0.0004555307,0.9628034,0.00590595,0.02854578],"study_design_scores_gemma":[0.000008612962,0.00001111662,0.000125576,0.00001362732,0.00001342352,0.0001189388,0.00003275751,0.007274285,0.0005445588,0.9853247,0.006522714,0.000009675414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1006495,0.001691767,0.7073933,0.006510911,0.001454451,0.0001998738,0.00115682,0.001159308,0.179784],"genre_scores_gemma":[0.6497021,0.001762791,0.2339672,0.002016453,0.001615954,0.0004684998,0.002504091,0.001069865,0.106893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02171992,"threshold_uncertainty_score":0.07266039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001331197","doi":"10.1016/j.jda.2013.10.003","title":"Finding dominators via disjoint set union","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Benbria (Canada); Université du Québec en Outaouais","funders":"","keywords":"Computer science; Disjoint sets; Correctness; Disjoint union (topology); Set (abstract data type); Theoretical computer science; Data structure; Graph; Time complexity; Simple (philosophy); Algorithm; Code (set theory); Linear programming; Mathematics; Programming language","authors":[{"name":"Wojciech Frączak","is_ca":true},{"name":"Loukas Georgiadis","is_ca":false},{"name":"Andrew Miller","is_ca":true},{"name":"Robert E. Tarjan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01849874032045662,"gpt":0.2591521809598428,"spread":0.2406534406393862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003835499,0.0008873935,0.002826164,0.004566733,0.002589851,0.005634356,0.004070267,0.001986121,0.008401792],"category_scores_gemma":[0.02781858,0.001475324,0.002542607,0.004757301,0.00357278,0.01520115,0.006662973,0.00352054,0.001410124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001566037,"about_ca_system_score_gemma":0.00165701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001443209,"about_ca_topic_score_gemma":0.002066951,"domain_scores_codex":[0.9954614,0.001518985,0.0003364546,0.001019156,0.001157845,0.0005061539],"domain_scores_gemma":[0.9663517,0.0269325,0.001318508,0.002999346,0.001608656,0.000789256],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001612118,0.0006640373,0.01215158,0.0009488624,0.0005217009,0.0003833753,0.002008491,0.04759312,0.008794868,0.5605924,0.01893242,0.345797],"study_design_scores_gemma":[0.0001299038,0.00006921623,0.0006038814,0.0001051001,0.0001407352,0.0002589068,0.0004865917,0.1157586,0.003878775,0.8733997,0.005119191,0.00004941385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1561166,0.001284507,0.8233219,0.001986238,0.0001446315,0.0002544297,0.001071759,0.001182494,0.0146374],"genre_scores_gemma":[0.6003333,0.0008879024,0.3842634,0.0004985253,0.0002144858,0.0003162534,0.001739483,0.0005473172,0.01119923],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008401792,"threshold_uncertainty_score":0.02810675,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037387767","doi":"10.1016/j.jda.2006.05.002","title":"Cut problems in graphs with a budget constraint","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Maximum cut; Approximation algorithm; Constraint (computer-aided design); Mathematics; Mathematical optimization; Constant (computer programming); Combinatorics; Computer science; Graph","authors":[{"name":"Roee Engelberg","is_ca":false},{"name":"Jochen Könemann","is_ca":true},{"name":"Stefano Leonardi","is_ca":false},{"name":"Joseph Naor","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01064658217234741,"gpt":0.2290906437144165,"spread":0.2184440615420691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003079261,0.001459036,0.002614579,0.001867814,0.001652505,0.005077172,0.003880456,0.004059106,0.01080805],"category_scores_gemma":[0.02173494,0.001923631,0.001528144,0.003674546,0.002346906,0.01115028,0.003575157,0.005440635,0.0008059161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002379676,"about_ca_system_score_gemma":0.001822356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003106628,"about_ca_topic_score_gemma":0.003390409,"domain_scores_codex":[0.9977679,0.0009545818,0.0001235137,0.000391736,0.0004034036,0.00035883],"domain_scores_gemma":[0.9750752,0.0212566,0.0009954883,0.0008805722,0.00066059,0.00113154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005544988,0.000396313,0.001814006,0.0008366854,0.0001779925,0.0002914315,0.000397351,0.2174922,0.00196208,0.6987667,0.01830943,0.05900123],"study_design_scores_gemma":[0.0001419651,0.00005165729,0.0003182819,0.00009284012,0.0000584341,0.0001548104,0.0001555428,0.2890893,0.0008363927,0.7050731,0.004001895,0.0000257599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1226038,0.003228196,0.8357934,0.008081479,0.0004425881,0.0004580737,0.001494604,0.0004915482,0.02740639],"genre_scores_gemma":[0.6160634,0.003562401,0.3492098,0.001210967,0.0007852582,0.000862247,0.002222696,0.0006089346,0.02547421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01080805,"threshold_uncertainty_score":0.03615654,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016908520","doi":"10.1016/j.jda.2005.07.003","title":"A loop-free two-close Gray-code algorithm for listing k-ary Dyck words","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Gray code; Combinatorics; Mathematics; Suffix; Algorithm; Gray (unit); String (physics); Computer science; Discrete mathematics","authors":[{"name":"Vincent Vajnovszki","is_ca":false},{"name":"Timothy R. Walsh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01751871827606128,"gpt":0.2913363529879703,"spread":0.273817634711909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003561917,0.0007696746,0.0008183428,0.001477981,0.0009171425,0.001439026,0.001309538,0.001121579,0.01193297],"category_scores_gemma":[0.002279522,0.0003543637,0.0004370373,0.001437943,0.0007085679,0.001442969,0.002095029,0.001196535,0.003656603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009019081,"about_ca_system_score_gemma":0.001511574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003874868,"about_ca_topic_score_gemma":0.006718839,"domain_scores_codex":[0.9994071,0.00006323073,0.00004457952,0.00009821734,0.0003058106,0.00008109374],"domain_scores_gemma":[0.9991392,0.0002416203,0.00005922266,0.0002322022,0.0002417436,0.00008597023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006103929,0.000259661,0.0006424834,0.0001903762,0.00003658141,0.0001838826,0.000232289,0.02589227,0.03542344,0.04157244,0.01220783,0.8827483],"study_design_scores_gemma":[0.0007242411,0.0005698985,0.001208337,0.000111034,0.00007648506,0.0008276695,0.0002936693,0.7867868,0.08265976,0.09255932,0.03401443,0.0001683978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02689707,0.0001980135,0.9601197,0.0002132517,0.0001119102,0.0002089312,0.000175183,0.004762619,0.007313314],"genre_scores_gemma":[0.1399024,0.0001000305,0.8506575,0.0001759053,0.00003363152,0.0002497568,0.0005082082,0.0004873581,0.00788515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01193297,"threshold_uncertainty_score":0.03991973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972171563","doi":"10.1016/j.jda.2012.03.004","title":"On bounded degree plane strong geometric spanners","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Spanner; Combinatorics; Degree (music); Pitteway triangulation; Point set triangulation; Mathematics; Plane (geometry); Minimum-weight triangulation; Constrained Delaunay triangulation; Bounded function; Bowyer–Watson algorithm; Geometry; Computer science; Mathematical analysis; Physics","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Paz Carmi","is_ca":false},{"name":"Lilach Chaitman-Yerushalmi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03682748905994071,"gpt":0.2826020049066673,"spread":0.2457745158467265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005958973,0.00109638,0.001084052,0.001387891,0.0008515461,0.001409158,0.00137437,0.001133579,0.01059956],"category_scores_gemma":[0.00335071,0.000598931,0.0005604401,0.00114643,0.001704653,0.002816296,0.005610228,0.001747375,0.00136866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004689088,"about_ca_system_score_gemma":0.0002635286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005757813,"about_ca_topic_score_gemma":0.0008725625,"domain_scores_codex":[0.9994486,0.0001369819,0.00002411325,0.0001005429,0.0001887288,0.0001010566],"domain_scores_gemma":[0.9985876,0.0006339761,0.0001921169,0.000190612,0.0001675012,0.0002282504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002385831,0.00007578149,0.0009334977,0.0001053494,0.00002761642,0.0002284172,0.0002387691,0.09049388,0.004813084,0.8697013,0.002728547,0.03041517],"study_design_scores_gemma":[0.00003292771,0.0001066546,0.0004280678,0.00004496158,0.00001592637,0.000168801,0.0002199178,0.2229708,0.001948636,0.7696157,0.004430403,0.00001724863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3647443,0.0005367319,0.577274,0.000576272,0.0002021243,0.0001000945,0.0002831445,0.0003166005,0.05596671],"genre_scores_gemma":[0.8846346,0.0007597167,0.07541422,0.0003034831,0.0001445141,0.0001153365,0.00054959,0.0002934275,0.03778526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01059956,"threshold_uncertainty_score":0.03545904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109262879","doi":"10.1016/j.jda.2010.09.004","title":"String matching with alphabet sampling","year":2010,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Suffix; Subsequence; Longest common subsequence problem; String (physics); Alphabet; String searching algorithm; Computer science; Matching (statistics); Sampling (signal processing); Space (punctuation); Generalized suffix tree; Spamming; Suffix array; Suffix tree; Range (aeronautics); Substring; Longest increasing subsequence; Mathematics; Combinatorics; Algorithm; Artificial intelligence; Pattern matching; Data structure; Statistics; The Internet","authors":[{"name":"Francisco Claude","is_ca":true},{"name":"Gonzalo Navarro","is_ca":false},{"name":"Hannu Peltola","is_ca":false},{"name":"Leena Salmela","is_ca":false},{"name":"Jorma Tarhio","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01335041713297873,"gpt":0.2691607421952065,"spread":0.2558103250622278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001909955,0.0005611511,0.001708209,0.002381757,0.000871203,0.001578558,0.001603527,0.001484351,0.005719317],"category_scores_gemma":[0.01069108,0.0005919916,0.0009741627,0.003991082,0.001040883,0.003085004,0.002644052,0.001356872,0.002131681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006200986,"about_ca_system_score_gemma":0.001365396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009299802,"about_ca_topic_score_gemma":0.001147325,"domain_scores_codex":[0.9971016,0.0009920578,0.0002171132,0.0005652305,0.0009148081,0.0002091046],"domain_scores_gemma":[0.9947531,0.002425533,0.0001978593,0.0020195,0.0004534641,0.0001504473],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001276599,0.0003508416,0.002550717,0.0002755389,0.0001655598,0.0002792368,0.0001490532,0.116845,0.01684096,0.1013779,0.01079417,0.7490944],"study_design_scores_gemma":[0.00009570082,0.0001773262,0.0005460177,0.00003144698,0.00005726438,0.0003749651,0.00004432609,0.8325185,0.01584654,0.144555,0.005726949,0.00002596893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03289978,0.0006725189,0.9591061,0.0003643073,0.0002654862,0.0001215202,0.0003307772,0.001933194,0.004306301],"genre_scores_gemma":[0.4404212,0.0006723174,0.54514,0.0004403916,0.0003612196,0.0003359366,0.001418418,0.000445731,0.01076475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005719317,"threshold_uncertainty_score":0.01913297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068640667","doi":"10.1016/j.jda.2013.06.001","title":"Gene tree correction for reconciliation and species tree inference: Complexity and algorithms","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Tree (set theory); Inference; Tree rearrangement; Mathematics; Combinatorics; Phylogenetic tree; Set (abstract data type); Algorithm; Biology; Computer science; Gene; Artificial intelligence; Genetics","authors":[{"name":"Riccardo Dondi","is_ca":false},{"name":"Nadia El-Mabrouk","is_ca":true},{"name":"Krister M. Swenson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03059460569472111,"gpt":0.2696137614868005,"spread":0.2390191557920794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01973547,0.001544647,0.003483522,0.004521234,0.00270071,0.003075339,0.006867995,0.004086214,0.006635821],"category_scores_gemma":[0.1109476,0.001449451,0.002538822,0.004362316,0.003281382,0.007007132,0.005094738,0.006414105,0.002244248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001938998,"about_ca_system_score_gemma":0.004312171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00392517,"about_ca_topic_score_gemma":0.005483083,"domain_scores_codex":[0.9902683,0.005655485,0.0005540274,0.001591333,0.001581108,0.0003497728],"domain_scores_gemma":[0.9015753,0.0778859,0.002416061,0.01206097,0.005054741,0.001007067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001356735,0.0003153422,0.006300986,0.0005660742,0.0005130155,0.0004772199,0.0006762276,0.228717,0.004977746,0.1155907,0.01476585,0.6257431],"study_design_scores_gemma":[0.000115908,0.00007036859,0.0006614922,0.00005241278,0.00008450338,0.000309898,0.00007364873,0.8384218,0.002837759,0.1542801,0.003045535,0.00004667422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00973888,0.000351011,0.9874141,0.0004891308,0.0001478661,0.00008852961,0.0001141186,0.001205424,0.0004510209],"genre_scores_gemma":[0.09091638,0.0002024413,0.9059185,0.0002172118,0.0001916674,0.0001878,0.0004773879,0.0006498069,0.00123871],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01973547,"threshold_uncertainty_score":0.1043724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048425099","doi":"10.1016/j.jda.2011.03.009","title":"The three squares lemma revisited","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Substring; Lemma (botany); String (physics); Combinatorics; Correctness; Mathematics; Preprocessor; Computation; Computer science; Discrete mathematics; Algorithm; Artificial intelligence; Data structure","authors":[{"name":"Evguenia Kopylova","is_ca":true},{"name":"W.F. Smyth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03224341166779137,"gpt":0.2565605238204628,"spread":0.2243171121526714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002410738,0.0007234122,0.001040351,0.001477911,0.001307695,0.002961771,0.001546461,0.001870407,0.01596942],"category_scores_gemma":[0.01453793,0.0005072888,0.0009601671,0.002341119,0.004659737,0.006366016,0.003280505,0.007032134,0.002778825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009626757,"about_ca_system_score_gemma":0.0009011311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00149203,"about_ca_topic_score_gemma":0.001094488,"domain_scores_codex":[0.9983102,0.0006169764,0.00008346094,0.0003620793,0.0004842029,0.0001431044],"domain_scores_gemma":[0.9939075,0.004199855,0.0002166079,0.0007978364,0.000736616,0.0001416329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003452436,0.000008922217,0.0001441923,0.00004827442,0.00001578175,0.00009066115,0.00006904823,0.0007530886,0.0003840892,0.9740382,0.008949099,0.01546404],"study_design_scores_gemma":[0.00001883842,0.00001373849,0.0001685525,0.00002375627,0.00001228072,0.0002089656,0.00006598321,0.006520553,0.0006492056,0.9693071,0.02299444,0.00001650435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02438544,0.015481,0.644615,0.04545803,0.005803571,0.00006153194,0.0004763386,0.0005058586,0.2632132],"genre_scores_gemma":[0.6864712,0.01398843,0.1480867,0.01669524,0.006841823,0.0002937409,0.0005752204,0.000979424,0.1260684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01596942,"threshold_uncertainty_score":0.05342305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912383825","doi":"10.1016/j.jda.2012.10.001","title":"Indexing hypertext","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Search engine indexing; Hypertext; Graph; Generalization; Theoretical computer science; Information retrieval; World Wide Web; Mathematics","authors":[{"name":"Chris Thachuk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.018523307870755,"gpt":0.2685964479283002,"spread":0.2500731400575452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001125274,0.0006549303,0.001329323,0.008281692,0.001534842,0.006791913,0.001328902,0.001152838,0.04018693],"category_scores_gemma":[0.009472242,0.0005506195,0.0007045184,0.01056374,0.001110038,0.008713184,0.003515505,0.001592348,0.0208741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001321232,"about_ca_system_score_gemma":0.001988334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001405519,"about_ca_topic_score_gemma":0.001702448,"domain_scores_codex":[0.9975539,0.0004061572,0.0003031834,0.0002803595,0.001245847,0.0002104435],"domain_scores_gemma":[0.9934078,0.001163918,0.0002710176,0.003253385,0.001549372,0.000354509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007287676,0.0004694385,0.002526009,0.000587012,0.00009639774,0.0002871369,0.0003536307,0.005600013,0.01616469,0.1144584,0.1327795,0.725949],"study_design_scores_gemma":[0.0002377136,0.0003467263,0.003370972,0.0003814487,0.0002284757,0.001474929,0.0006910914,0.123284,0.06421448,0.4271879,0.3784599,0.0001221878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1195112,0.01045492,0.601054,0.00719096,0.004836845,0.001769029,0.04178139,0.02396305,0.1894386],"genre_scores_gemma":[0.466241,0.00777189,0.2740075,0.001296748,0.002040832,0.001269945,0.07272007,0.003052456,0.1715995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04018693,"threshold_uncertainty_score":0.1344387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091484735","doi":"10.1016/j.jda.2005.06.009","title":"Utilitarian resource assignment","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Social cost; Price of anarchy; Mathematical optimization; Resource allocation; Resource (disambiguation); Mathematical economics; Computer science; Best response; Game theory; Total cost; Mathematics; Economics; Microeconomics; Price of stability","authors":[{"name":"Petra Berenbrink","is_ca":true},{"name":"Leslie Ann Goldberg","is_ca":false},{"name":"Paul W. Goldberg","is_ca":false},{"name":"Russell Martin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07711950346725295,"gpt":0.3923227084512995,"spread":0.3152032049840465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002500539,0.0008636461,0.001118612,0.001030558,0.001119622,0.002816147,0.0016249,0.001414353,0.02093646],"category_scores_gemma":[0.008583935,0.0004800091,0.0005602177,0.001199047,0.001567142,0.002814074,0.002816616,0.001931428,0.002413958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009493392,"about_ca_system_score_gemma":0.001212362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003264825,"about_ca_topic_score_gemma":0.0005019586,"domain_scores_codex":[0.9979302,0.001169607,0.00007648871,0.000300354,0.0003156449,0.0002078108],"domain_scores_gemma":[0.9968724,0.001540878,0.0001720994,0.000679016,0.0004216892,0.0003141053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002377733,0.0001967782,0.0004269671,0.0001507868,0.0000649155,0.00007851025,0.0001448685,0.06457633,0.001592637,0.8398634,0.01315206,0.07951501],"study_design_scores_gemma":[0.00005555911,0.0001046294,0.0001967096,0.00003409234,0.00002973491,0.000123357,0.00009329723,0.2214041,0.0007812904,0.7679811,0.009174407,0.00002170363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0389066,0.0004215056,0.851588,0.002861256,0.0003872183,0.000271307,0.00027738,0.0003174233,0.1049694],"genre_scores_gemma":[0.7966223,0.000536431,0.1262596,0.0005319365,0.0002829247,0.0004719459,0.0002379243,0.0001309104,0.07492606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02093646,"threshold_uncertainty_score":0.07003945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995833618","doi":"10.1016/j.jda.2004.04.011","title":"Efficient algorithms for Koblitz curves over fields of characteristic three","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Algorithm; Finite field; Computation; Arithmetic; Mathematics; Point (geometry); Field (mathematics); Computer science; Multiplication (music); Window (computing); Discrete mathematics; Combinatorics; Pure mathematics; Geometry","authors":[{"name":"Ian F. Blake","is_ca":true},{"name":"V. Kumar Murty","is_ca":true},{"name":"Guangwu Xu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0169061173818016,"gpt":0.2731545774228335,"spread":0.2562484600410319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001889643,0.001687377,0.001688978,0.002747173,0.002018391,0.006038394,0.002797397,0.002109871,0.01387693],"category_scores_gemma":[0.008547167,0.0008187457,0.00147097,0.003300278,0.001789569,0.01286027,0.005363612,0.002823117,0.004054559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003142424,"about_ca_system_score_gemma":0.00285353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001511272,"about_ca_topic_score_gemma":0.002765223,"domain_scores_codex":[0.9969597,0.0005259741,0.0002608202,0.0005721662,0.0009678582,0.0007134369],"domain_scores_gemma":[0.9955556,0.001880498,0.0003679937,0.001521379,0.0004396829,0.0002347956],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001762311,0.0004214777,0.00258373,0.000541169,0.0001575345,0.0001614654,0.001268349,0.04761216,0.01007297,0.4272436,0.01499327,0.493182],"study_design_scores_gemma":[0.0004396733,0.0001986037,0.0004658793,0.0001468185,0.00008972752,0.0002563477,0.0004378408,0.1283109,0.01128538,0.8440465,0.01425272,0.00006962277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2452018,0.002620292,0.7029923,0.002808553,0.0003482651,0.0003645291,0.0006933801,0.005162567,0.03980828],"genre_scores_gemma":[0.6546388,0.001368624,0.325444,0.000348432,0.0002036052,0.0002507745,0.00135703,0.0007134345,0.01567525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01387693,"threshold_uncertainty_score":0.0464229,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2568188511","doi":"10.1016/j.jda.2011.10.002","title":"Indexability, concentration, and VC theory","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Search engine indexing; Histogram; Measure (data warehouse); Dimension (graph theory); Similarity (geometry); Similarity measure; Statistical analysis","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02544690606395558,"gpt":0.2651457390474658,"spread":0.2396988329835102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007010133,0.001326116,0.002869253,0.004145369,0.002200799,0.006621569,0.0035137,0.002760191,0.009402183],"category_scores_gemma":[0.05994115,0.0009326347,0.001502464,0.004754498,0.007033778,0.01191952,0.006064988,0.004688805,0.0008460871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003781259,"about_ca_system_score_gemma":0.001540854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002823981,"about_ca_topic_score_gemma":0.001479403,"domain_scores_codex":[0.9952461,0.002307777,0.0002042914,0.0006525681,0.001218467,0.0003708414],"domain_scores_gemma":[0.9575852,0.03435864,0.001951458,0.002608459,0.002360646,0.001135557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002716246,0.00001598578,0.0002993609,0.00004682675,0.00001744495,0.00001517289,0.00006124187,0.007516779,0.0001413935,0.9824737,0.001485644,0.007899277],"study_design_scores_gemma":[0.000009473041,0.00000878961,0.00009310077,0.00001888744,0.000007430662,0.00002261758,0.0000144617,0.04018482,0.0001275669,0.9580464,0.001456748,0.000009759096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02954345,0.004054298,0.9309245,0.003680068,0.0002164842,0.00006107568,0.0002762892,0.0002225055,0.03102137],"genre_scores_gemma":[0.8104572,0.007285663,0.1477693,0.002036696,0.002133962,0.0005146967,0.001127559,0.0006593684,0.02801551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009402183,"threshold_uncertainty_score":0.03707355,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2172617180","doi":"10.1016/j.jda.2012.04.017","title":"Efficient codon optimization with motif engineering","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Codon usage bias; Gene; Computational biology; Genome; Motif (music); Computer science; Coding region; Genetic code; Stop codon; Genetics; Translational efficiency; Biology; Translation (biology); Messenger RNA; Physics","authors":[{"name":"Anne Condon","is_ca":true},{"name":"Chris Thachuk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006408145509374658,"gpt":0.2150394112379953,"spread":0.2086312657286207,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003761334,0.0004939592,0.0008343633,0.0003983186,0.0003240606,0.0005011776,0.0006934498,0.0007404005,0.002605603],"category_scores_gemma":[0.001358584,0.0003403239,0.0004440637,0.0005933653,0.0003558741,0.0006192762,0.0007855918,0.0008198066,0.0005856435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002868267,"about_ca_system_score_gemma":0.000441218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003364543,"about_ca_topic_score_gemma":0.000788424,"domain_scores_codex":[0.9997304,0.0001033317,0.00001340673,0.00004710768,0.00006729831,0.00003851507],"domain_scores_gemma":[0.9996604,0.0001890762,0.00002707775,0.00006823484,0.00003477581,0.00002051468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008632134,0.0004316987,0.001174882,0.0002327855,0.00009114125,0.0001923559,0.00009822602,0.4626119,0.0793341,0.07527116,0.003969822,0.3757287],"study_design_scores_gemma":[0.00008764977,0.0001040073,0.00009185837,0.000005867137,0.00001556213,0.00004853608,0.0000113454,0.9637313,0.01090899,0.02352755,0.00145797,0.00000927665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1333584,0.0004363085,0.8574862,0.0002685668,0.0001030413,0.00006673008,0.00006813356,0.001196802,0.007015768],"genre_scores_gemma":[0.5245548,0.0001935457,0.4708715,0.0001016752,0.00003787454,0.0001302129,0.0001214033,0.0002350355,0.003753902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002605603,"threshold_uncertainty_score":0.008716643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983271670","doi":"10.1016/j.jda.2006.09.004","title":"Computing the maximum clique in the visibility graph of a simple polygon","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Visibility graph; Simple polygon; Clique graph; Visibility polygon; Mathematics; Vertex (graph theory); Polygon covering; Graph; Block graph; Regular polygon; Discrete mathematics; Graph power; Line graph; 1-planar graph; Geometry","authors":[{"name":"Subir Kumar Ghosh","is_ca":false},{"name":"Thomas C. Shermer","is_ca":true},{"name":"Binay Bhattacharya","is_ca":true},{"name":"Partha P. Goswami","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01063226809525173,"gpt":0.2687595671857121,"spread":0.2581272990904604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004617229,0.0006208562,0.001326306,0.001301671,0.0009494174,0.001688606,0.001270244,0.001332092,0.004272192],"category_scores_gemma":[0.005093167,0.0008481442,0.0009469638,0.0013103,0.001130793,0.002268892,0.00132077,0.001002039,0.0004023966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006423551,"about_ca_system_score_gemma":0.0008423874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006884831,"about_ca_topic_score_gemma":0.01103667,"domain_scores_codex":[0.9995869,0.00009687208,0.00001660775,0.0001281876,0.00009030211,0.00008117326],"domain_scores_gemma":[0.997272,0.001884667,0.0002220166,0.0002281191,0.0001592852,0.0002338339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002087203,0.0004909625,0.01588642,0.0007365217,0.0003307255,0.0009923042,0.0009194177,0.7265751,0.02656665,0.06394501,0.01134266,0.150127],"study_design_scores_gemma":[0.00007787602,0.00008314221,0.00170887,0.00001971182,0.00003609975,0.0001042457,0.0002102514,0.9450856,0.003386919,0.04794081,0.001331142,0.00001540231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6732736,0.0003777743,0.3168333,0.0008719206,0.00006991861,0.0001370215,0.001142781,0.0007855619,0.006508138],"genre_scores_gemma":[0.8448274,0.0001858754,0.1505483,0.00006299851,0.00004976155,0.000049047,0.001406692,0.0002683893,0.002601596],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006884831,"threshold_uncertainty_score":0.01429188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2586556622","doi":"10.1016/j.jda.2017.01.003","title":"Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences","year":2017,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Lexicographical order; Substring; Combinatorics; Ranking (information retrieval); Rank (graph theory); Sequence (biology); Mathematics; Order (exchange); Algorithm; Simple (philosophy); Computer science; Artificial intelligence; Data structure","authors":[{"name":"Joe Sawada","is_ca":true},{"name":"Aaron Williams","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03259474542133807,"gpt":0.3431906005152647,"spread":0.3105958550939267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002784891,0.001364554,0.001405495,0.002998328,0.00129124,0.002781898,0.001786924,0.00154754,0.01076221],"category_scores_gemma":[0.02208996,0.0007809395,0.0007249888,0.002771889,0.002258549,0.00569813,0.003588208,0.002759391,0.003175886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001274328,"about_ca_system_score_gemma":0.002050048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001389818,"about_ca_topic_score_gemma":0.003184593,"domain_scores_codex":[0.9973303,0.0007851428,0.0002120849,0.0004198702,0.0009772788,0.0002753128],"domain_scores_gemma":[0.9927329,0.003913295,0.0004861279,0.001623404,0.0009529375,0.0002913233],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007755924,0.0002290279,0.0008326599,0.0003620521,0.00005059432,0.0001354279,0.0004614001,0.06739461,0.006193179,0.5543922,0.01411494,0.3550583],"study_design_scores_gemma":[0.0001403922,0.0002474949,0.0001583481,0.00008766407,0.00002618228,0.0002024121,0.0002098688,0.2919144,0.006445215,0.6912337,0.009274818,0.00005946623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04724273,0.0009449106,0.9394754,0.0007299039,0.0002507184,0.0001762701,0.0003408304,0.001246542,0.009592687],"genre_scores_gemma":[0.2984344,0.0008124114,0.6788597,0.0003618118,0.0003856038,0.0003934534,0.001076973,0.0004819791,0.01919372],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01076221,"threshold_uncertainty_score":0.03600317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127945324","doi":"10.1016/j.jda.2009.05.001","title":"Approximation algorithms for shortest descending paths in terrains","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Shortest path problem; K shortest path routing; Yen's algorithm; Terrain; Algorithm; Path (computing); Computer science; Constrained Shortest Path First; Shortest Path Faster Algorithm; Generalization; Euclidean shortest path; Approximation algorithm; Point (geometry); Mathematical optimization; Mathematics; Dijkstra's algorithm; Geometry; Theoretical computer science","authors":[{"name":"Mustaq Ahmed","is_ca":true},{"name":"Sandip Das","is_ca":false},{"name":"Sachin Lodha","is_ca":false},{"name":"Anna Lubiw","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Sasanka Roy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03003635432018853,"gpt":0.3028809910076843,"spread":0.2728446366874958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001574772,0.001316402,0.001842571,0.00227885,0.001045986,0.002324783,0.00304571,0.001528885,0.005602495],"category_scores_gemma":[0.01109617,0.0009414868,0.001139519,0.003910522,0.001160196,0.003266982,0.002807585,0.002897313,0.000929157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00206283,"about_ca_system_score_gemma":0.001431026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009816318,"about_ca_topic_score_gemma":0.01074835,"domain_scores_codex":[0.9991548,0.0001954806,0.00006165354,0.0001579028,0.0002965543,0.0001335612],"domain_scores_gemma":[0.9959721,0.002885462,0.0001953681,0.0003860289,0.0003665026,0.0001945534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003048631,0.0001450113,0.001376239,0.0002621707,0.00006121712,0.00005808587,0.0003296082,0.7854208,0.001163739,0.06389819,0.005862846,0.1411171],"study_design_scores_gemma":[0.00003256099,0.00002438978,0.00008918229,0.00001722761,0.00001224012,0.00002508789,0.00005965865,0.9656509,0.0002864331,0.03256192,0.001234254,0.000006270508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02317221,0.0007077422,0.9724337,0.0002673186,0.00007059622,0.0000818252,0.0002702338,0.0004957673,0.002500599],"genre_scores_gemma":[0.2640486,0.001053183,0.7272694,0.0001098759,0.00009207109,0.0002398377,0.001505188,0.0003438085,0.005338233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009816318,"threshold_uncertainty_score":0.01951838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026304802","doi":"10.1016/j.jda.2014.11.008","title":"The shortest path problem in the Knödel graph","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Path graph; Shortest path problem; Distance; Graph; Upper and lower bounds; Discrete mathematics; Graph power; Line graph","authors":[{"name":"Hayk Grigoryan","is_ca":true},{"name":"Hovhannes A. Harutyunyan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009150218732017937,"gpt":0.2336056213119924,"spread":0.2244554025799745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008497714,0.0007225227,0.001404157,0.001059452,0.001153409,0.002317349,0.00184532,0.002429082,0.009590401],"category_scores_gemma":[0.006730882,0.0006311411,0.0008014236,0.001654624,0.001067602,0.006260948,0.001715125,0.001821995,0.0008668082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001783405,"about_ca_system_score_gemma":0.001865268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007337636,"about_ca_topic_score_gemma":0.008314552,"domain_scores_codex":[0.9992705,0.0002797831,0.00003115842,0.0002146278,0.00009950063,0.000104425],"domain_scores_gemma":[0.9970133,0.002075822,0.0002898848,0.0001986397,0.0001826914,0.0002396228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002918711,0.0001669908,0.001092346,0.0004439916,0.00008407875,0.0003357252,0.000262041,0.5638083,0.002238631,0.3763236,0.01211608,0.04283641],"study_design_scores_gemma":[0.00005237346,0.00004813825,0.0002530054,0.00003633835,0.00002362776,0.00009964123,0.0001634112,0.5576121,0.0006839623,0.4360774,0.004926666,0.00002337406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1605113,0.00112618,0.8040934,0.004375333,0.000226821,0.000164547,0.001900934,0.0004772978,0.02712417],"genre_scores_gemma":[0.7403504,0.002204319,0.2112922,0.0006087826,0.000234791,0.0002750285,0.002787435,0.0004150989,0.04183204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009590401,"threshold_uncertainty_score":0.03208303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992800733","doi":"10.1016/j.jda.2012.03.003","title":"More results on overlapping squares","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"String (physics); Computer science; Least-squares function approximation; Combinatorics; Algorithm; Mathematics; Statistics; Mathematical physics","authors":[{"name":"František Franěk","is_ca":true},{"name":"Robert C.G. Fuller","is_ca":true},{"name":"Jamie Simpson","is_ca":false},{"name":"W.F. Smyth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02257373619451643,"gpt":0.2906407406978807,"spread":0.2680670045033642,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002109768,0.002002574,0.002287543,0.001875589,0.001232487,0.001531117,0.00226905,0.001649246,0.0322426],"category_scores_gemma":[0.01180742,0.001022078,0.001769894,0.004818847,0.002091748,0.006365859,0.004755394,0.005767488,0.005837786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008616692,"about_ca_system_score_gemma":0.0006536149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002095406,"about_ca_topic_score_gemma":0.002425236,"domain_scores_codex":[0.9975978,0.0006314337,0.0001220819,0.0005474167,0.0009376814,0.0001635501],"domain_scores_gemma":[0.9934732,0.002954195,0.0002225033,0.002134911,0.0009542213,0.0002609129],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000394324,0.0002124118,0.0010269,0.0008928542,0.0002277109,0.0002772016,0.0003604541,0.03567548,0.01002423,0.4258628,0.0497606,0.475285],"study_design_scores_gemma":[0.00007482262,0.0001282428,0.00139057,0.0001455811,0.0001633094,0.0006247775,0.0001664248,0.1290253,0.007273796,0.7480766,0.1128449,0.00008571276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01138041,0.006288641,0.9217164,0.002966048,0.001937001,0.00004941186,0.0003603204,0.0008094971,0.05449229],"genre_scores_gemma":[0.1971853,0.007359324,0.6716205,0.004123867,0.005129189,0.000258708,0.001794633,0.002835557,0.1096928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0322426,"threshold_uncertainty_score":0.1078622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066342920","doi":"10.1016/j.jda.2014.06.003","title":"The lexicographically smallest universal cycle for binary strings with minimum specified weight","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Aperiodic graph; Mathematics; Binary number; Combinatorics; Discrete mathematics; Prefix; Simple (philosophy); Amortized analysis; Set (abstract data type); Order (exchange); Arithmetic; Computer science; Data structure","authors":[{"name":"Joe Sawada","is_ca":true},{"name":"Aaron Williams","is_ca":true},{"name":"Dennis Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008251096188583884,"gpt":0.2237018775093222,"spread":0.2154507813207383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003914222,0.000433442,0.0008475073,0.001762552,0.001482871,0.001882613,0.0009440311,0.001160521,0.006997172],"category_scores_gemma":[0.006155585,0.0004172708,0.0005349108,0.001940006,0.001145806,0.002674209,0.001647642,0.0008858707,0.001032616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001020994,"about_ca_system_score_gemma":0.001715085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001324467,"about_ca_topic_score_gemma":0.002363421,"domain_scores_codex":[0.9994379,0.0001071937,0.00005309674,0.0001269054,0.0001516944,0.0001232594],"domain_scores_gemma":[0.9982855,0.0007618638,0.0001352659,0.0003571579,0.0002827298,0.0001773849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001936343,0.0002243714,0.004073953,0.000909831,0.00007000708,0.0004333285,0.001254786,0.03093473,0.04268998,0.4992771,0.01711736,0.4010782],"study_design_scores_gemma":[0.0001182615,0.0003327123,0.00128492,0.0003395958,0.00006576985,0.0005183556,0.0006985086,0.1009529,0.0314953,0.8434088,0.02070748,0.00007737228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6272511,0.001625321,0.3309616,0.001961613,0.0004041909,0.0003809812,0.002635847,0.001285053,0.03349435],"genre_scores_gemma":[0.8101431,0.0008494693,0.1725734,0.0004747403,0.00009162733,0.0003814916,0.002146635,0.0006649877,0.01267451],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006997172,"threshold_uncertainty_score":0.02340788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991315286","doi":"10.1016/j.jda.2008.07.007","title":"Light orthogonal networks with constant geometric dilation","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Spatial network; Dilation (metric space); Spanner; Euclidean geometry; Constant (computer programming); Plane (geometry); Euclidean distance; Graph; Geometry; Computer science","authors":[{"name":"Adrian Dumitrescu","is_ca":false},{"name":"Csaba D. Tóth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01306487721437632,"gpt":0.2265026085115652,"spread":0.2134377312971888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005826509,0.0005090718,0.0006878298,0.001175787,0.0008491033,0.001696097,0.001055393,0.001027938,0.008426369],"category_scores_gemma":[0.003626003,0.0005196604,0.0003804789,0.0008915429,0.001229582,0.002920748,0.003020099,0.001478945,0.001124011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009937808,"about_ca_system_score_gemma":0.0005203984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001033906,"about_ca_topic_score_gemma":0.001359777,"domain_scores_codex":[0.9995546,0.0001103935,0.00001740942,0.00009931045,0.0001376193,0.00008066772],"domain_scores_gemma":[0.9986625,0.000512794,0.0001639155,0.0002510551,0.0002233858,0.000186349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002860755,0.00007788584,0.0005509455,0.0001120995,0.00002600121,0.000120628,0.0001461878,0.07102289,0.008394357,0.8224016,0.007032588,0.08982883],"study_design_scores_gemma":[0.0000546626,0.00007077132,0.0003246107,0.00002658197,0.00002075595,0.0001732816,0.0001084324,0.5100877,0.004247262,0.4730287,0.01183213,0.00002518363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1323743,0.0004909172,0.8179014,0.001276716,0.0003553582,0.0001211441,0.0002713081,0.0006229155,0.04658581],"genre_scores_gemma":[0.7175028,0.001098546,0.2355207,0.0005249649,0.0002781402,0.0002619762,0.0003327947,0.0003547903,0.0441253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008426369,"threshold_uncertainty_score":0.028189,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999899863","doi":"10.1016/j.jda.2012.04.013","title":"Generating simple convex Venn diagrams","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Venn diagram; Isometry (Riemannian geometry); Monotone polygon; Simple (philosophy); Mathematics; Isometry group; Symmetry (geometry); Combinatorics; Regular polygon; Geometry; Pure mathematics","authors":[{"name":"Khalegh Mamakani","is_ca":true},{"name":"Wendy Myrvold","is_ca":true},{"name":"Frank Ruskey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01887006957620724,"gpt":0.277558107223658,"spread":0.2586880376474508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005109059,0.0004702509,0.0006179455,0.001482829,0.0006344084,0.001037932,0.000959117,0.0008494153,0.009199416],"category_scores_gemma":[0.003512488,0.0005268091,0.0006875552,0.0007631377,0.000669613,0.001286624,0.001919202,0.0009286653,0.001451557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004488187,"about_ca_system_score_gemma":0.0002891126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004136604,"about_ca_topic_score_gemma":0.001061673,"domain_scores_codex":[0.9995658,0.0001158017,0.00002016967,0.00006974846,0.0001816741,0.00004685321],"domain_scores_gemma":[0.9988909,0.0005663328,0.00006328733,0.0001673609,0.0002177257,0.00009448041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001537202,0.0001102336,0.0009722181,0.0003383014,0.00004691108,0.0005857176,0.0006825936,0.1100892,0.01752023,0.6984574,0.009084181,0.1619593],"study_design_scores_gemma":[0.00006779344,0.00007721452,0.0002751002,0.00007733604,0.00002820973,0.0003000987,0.0002488387,0.4413182,0.01124642,0.5230844,0.02324161,0.00003480759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1109135,0.0001539221,0.8553457,0.0001800249,0.000190763,0.0002049335,0.0002944785,0.0007118563,0.03200489],"genre_scores_gemma":[0.5898848,0.0002231693,0.3895334,0.00008848752,0.0000489039,0.0001737276,0.0008278728,0.0006012642,0.01861834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009199416,"threshold_uncertainty_score":0.03077507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001146041","doi":"10.1016/j.jda.2013.08.002","title":"Acyclic coloring with few division vertices","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Wheel graph; Subdivision; Path graph; Complete coloring; Discrete mathematics; Graph; Graph power; Line graph","authors":[{"name":"Debajyoti Mondal","is_ca":true},{"name":"Rahnuma Islam Nishat","is_ca":true},{"name":"Md. Saidur Rahman","is_ca":false},{"name":"Sue Whitesides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01441011631649932,"gpt":0.2787117402035929,"spread":0.2643016238870936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006680192,0.0006165542,0.0007246393,0.0008296596,0.002468467,0.002206147,0.001921526,0.0009757162,0.01927344],"category_scores_gemma":[0.004019178,0.0006746391,0.0005489439,0.001559982,0.00105438,0.002841706,0.00190168,0.001950856,0.002872135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001277712,"about_ca_system_score_gemma":0.001436925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001991882,"about_ca_topic_score_gemma":0.004873128,"domain_scores_codex":[0.9990349,0.0003175567,0.00004328918,0.000234145,0.0001476313,0.0002225067],"domain_scores_gemma":[0.9949607,0.002071745,0.0002927521,0.00138225,0.0004866667,0.0008059415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001385681,0.0006151773,0.003152653,0.0005395737,0.00008631252,0.0005544487,0.0005421995,0.02928256,0.01940014,0.776055,0.03744888,0.1309374],"study_design_scores_gemma":[0.0002408632,0.0001248363,0.0010669,0.000060022,0.00007186633,0.0005139345,0.0003266038,0.08267267,0.00953932,0.8757714,0.02957342,0.00003813786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3762346,0.0006020745,0.4715651,0.003268993,0.0006722955,0.0004846385,0.002579148,0.002241008,0.1423521],"genre_scores_gemma":[0.6899803,0.0004734394,0.2554788,0.0009568338,0.0002126558,0.0004142903,0.002112549,0.0006203009,0.04975079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01927344,"threshold_uncertainty_score":0.06447607,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1553958932","doi":"10.1016/j.jda.2014.11.002","title":"The complexity of string partitioning","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; String (physics); Partition (number theory); Combinatorics; Integer (computer science); Collision; Mathematics; Computer science; Discrete mathematics","authors":[{"name":"Anne Condon","is_ca":true},{"name":"Ján Maňuch","is_ca":true},{"name":"Chris Thachuk","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03160110801655073,"gpt":0.2713666600122118,"spread":0.2397655519956611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004147049,0.0008753117,0.001968498,0.002013814,0.002500084,0.007504459,0.004041397,0.003524624,0.02178504],"category_scores_gemma":[0.05254139,0.001346696,0.001799657,0.005152078,0.003573511,0.01990876,0.005081049,0.004785623,0.00238726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004306825,"about_ca_system_score_gemma":0.004124241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003120045,"about_ca_topic_score_gemma":0.003923688,"domain_scores_codex":[0.9917561,0.002695546,0.0005679881,0.001006412,0.00320551,0.0007685386],"domain_scores_gemma":[0.930328,0.05713623,0.001849748,0.007471922,0.002147873,0.001066255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001793432,0.0003666319,0.006494765,0.0006212663,0.0002073701,0.0004789807,0.0007896131,0.2800484,0.006856428,0.4799939,0.03989146,0.1824577],"study_design_scores_gemma":[0.0001327191,0.00006628749,0.001091706,0.00004799649,0.00008312561,0.0002714672,0.0002044203,0.5213436,0.002571307,0.4702709,0.003873803,0.00004274156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3918485,0.004446868,0.4763197,0.03314852,0.001047211,0.0004296593,0.004676363,0.002087002,0.08599612],"genre_scores_gemma":[0.8498493,0.001778934,0.1246286,0.001391755,0.0009344397,0.0004281491,0.003226958,0.001036428,0.01672545],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02178504,"threshold_uncertainty_score":0.07287824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057158872","doi":"10.1016/j.jda.2012.04.015","title":"Cool-lex order and k-ary Catalan structures","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Victoria; University of Manitoba","funders":"","keywords":"Catalan number; Combinatorics; Lexicographical order; Mathematics; Complement (music); Order (exchange); Precomputation; Binary tree; Sequence (biology); Discrete mathematics; Algorithm; Computer science","authors":[{"name":"Stéphane Durocher","is_ca":true},{"name":"Pak Ching Li","is_ca":true},{"name":"Debajyoti Mondal","is_ca":true},{"name":"Frank Ruskey","is_ca":true},{"name":"Aaron Williams","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009989566069584637,"gpt":0.2494760250303142,"spread":0.2394864589607295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008500803,0.0004016686,0.0009957834,0.001186073,0.003200094,0.005619112,0.0009714395,0.001219027,0.01252403],"category_scores_gemma":[0.003699677,0.0005012183,0.0009377429,0.00137359,0.003565579,0.006488051,0.002250826,0.003033604,0.001711449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001839137,"about_ca_system_score_gemma":0.00123913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002126458,"about_ca_topic_score_gemma":0.003037492,"domain_scores_codex":[0.9990268,0.0002086145,0.00007807408,0.0002095747,0.0001987539,0.0002781671],"domain_scores_gemma":[0.9965259,0.00171069,0.0002791251,0.0005156428,0.0005406319,0.0004279545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008889865,0.00001836371,0.0003027786,0.00002217106,0.000004426282,0.00007195931,0.0003854256,0.0005906879,0.0005627416,0.9944934,0.0007769685,0.002682202],"study_design_scores_gemma":[0.00001905273,0.00001780865,0.0002023873,0.000008917442,0.000006755445,0.00007103875,0.0002517481,0.002293303,0.0005304643,0.994212,0.002370757,0.0000158855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6810641,0.0008486384,0.162288,0.004057026,0.0004595763,0.0001104373,0.001279773,0.000793086,0.1490994],"genre_scores_gemma":[0.9397618,0.0001839753,0.02073795,0.000449712,0.0001282422,0.00007289711,0.0006737742,0.0001871822,0.03780441],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01252403,"threshold_uncertainty_score":0.04189706,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087236754","doi":"10.1016/j.jda.2014.11.006","title":"Computing upward topological book embeddings of upward planar digraphs","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Planarity testing; Digraph; Planar; Planar graph; Point (geometry); Combinatorics; Mathematics; Planar straight-line graph; Book embedding; Set (abstract data type); Graph; Topology (electrical circuits); Computer science; Discrete mathematics; Geometry; 1-planar graph; Computer graphics (images)","authors":[{"name":"Francesco Giordano","is_ca":false},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Tamara Mchedlidze","is_ca":false},{"name":"Antonios Symvonis","is_ca":false},{"name":"Sue Whitesides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01023348686044059,"gpt":0.2610799165336955,"spread":0.2508464296732549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002378082,0.0009164608,0.0007651366,0.001677747,0.0005682969,0.001972147,0.001133635,0.0007585258,0.01446142],"category_scores_gemma":[0.003298009,0.0007191388,0.000703949,0.001792104,0.0005919645,0.004168469,0.001868142,0.001246721,0.002719061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006164946,"about_ca_system_score_gemma":0.0004780413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002059243,"about_ca_topic_score_gemma":0.005519797,"domain_scores_codex":[0.9996839,0.00004232479,0.00002200609,0.00009810607,0.00008460588,0.00006908762],"domain_scores_gemma":[0.9981997,0.0008719492,0.0001568644,0.0003502996,0.0002703043,0.0001508086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008463792,0.0004181284,0.01490466,0.001216094,0.0001599141,0.001049503,0.001371536,0.2498615,0.0160043,0.2463692,0.03457414,0.4332247],"study_design_scores_gemma":[0.00008315072,0.0002389326,0.002618384,0.0001736009,0.0001356439,0.000347669,0.001628538,0.6420314,0.0140745,0.3119299,0.02668591,0.00005234762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5359805,0.0006793768,0.4239295,0.0005342619,0.0001748283,0.0001569522,0.006817568,0.004633947,0.02709311],"genre_scores_gemma":[0.7888488,0.0005901359,0.1846054,0.0001052849,0.00005988912,0.00006116796,0.01105832,0.0007789497,0.01389201],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01446142,"threshold_uncertainty_score":0.04837829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W974563791","doi":"10.1016/j.jda.2015.05.013","title":"On the hardness of full Steiner tree problems","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; Gomory–Hu tree; Vertex (graph theory); K-ary tree; Tree (set theory); Time complexity; Approximation algorithm; Discrete mathematics; Bottleneck; Graph; Tree structure; Binary tree; Computer science","authors":[{"name":"Ahmad Biniaz","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05273686323686087,"gpt":0.2655842799530101,"spread":0.2128474167161492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004651864,0.001786296,0.003950882,0.003049442,0.003211335,0.00656317,0.006129212,0.004195352,0.02242859],"category_scores_gemma":[0.04259088,0.002067224,0.002770265,0.005081838,0.007113402,0.02303233,0.007519404,0.01129152,0.001926948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0036588,"about_ca_system_score_gemma":0.002565617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003494598,"about_ca_topic_score_gemma":0.002984171,"domain_scores_codex":[0.9946004,0.001840796,0.0002447343,0.0009006991,0.001400015,0.001013402],"domain_scores_gemma":[0.9281379,0.06317484,0.001878032,0.003227679,0.001559705,0.002021757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002226375,0.000607095,0.003590796,0.001441101,0.0002849317,0.0003969289,0.001290839,0.1317289,0.002090627,0.7227032,0.06725062,0.06638872],"study_design_scores_gemma":[0.0001809836,0.0000604351,0.0007554166,0.00009239956,0.00005169791,0.0001531531,0.0002694789,0.07906499,0.0003397755,0.9142644,0.004736882,0.00003041405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3754695,0.01593267,0.3073421,0.0659053,0.001738056,0.0003868017,0.006167439,0.001595076,0.2254631],"genre_scores_gemma":[0.90221,0.008652661,0.05222139,0.004328086,0.003389779,0.0004134484,0.004109873,0.000858689,0.02381608],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02242859,"threshold_uncertainty_score":0.07503116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045758343","doi":"10.1016/j.jda.2005.03.003","title":"On the mean number of encryptions for tree-based broadcast encryption schemes","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Broadcast encryption; Computer science; Encryption; Stateless protocol; Scheme (mathematics); Cryptanalysis; Mathematics; Computer network; Tree (set theory); Theoretical computer science; Computer security; Discrete mathematics; Public-key cryptography; Combinatorics","authors":[{"name":"Eui-Kyung Park","is_ca":true},{"name":"Ian F. Blake","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01908618021055641,"gpt":0.288083670207468,"spread":0.2689974899969116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01127962,0.001300291,0.00306929,0.002125357,0.003114973,0.004937376,0.003878849,0.002772212,0.005290189],"category_scores_gemma":[0.05370128,0.00118364,0.001783017,0.002093427,0.004927296,0.01416112,0.004725565,0.006728299,0.001005196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005126977,"about_ca_system_score_gemma":0.004523696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006860966,"about_ca_topic_score_gemma":0.001525403,"domain_scores_codex":[0.9907796,0.003375422,0.0004778933,0.001230077,0.00272894,0.00140809],"domain_scores_gemma":[0.920565,0.05602696,0.003961406,0.01142547,0.005543297,0.002477863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002663589,0.0002166218,0.002146391,0.0003813557,0.0001743521,0.000133087,0.0004410794,0.09792612,0.01015119,0.8123839,0.01223028,0.06115197],"study_design_scores_gemma":[0.0001553562,0.0003373603,0.0007393385,0.0001068815,0.0001132398,0.0003620917,0.0001274528,0.3475827,0.004135585,0.642849,0.003405179,0.00008589709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1567675,0.004842901,0.811009,0.006015238,0.0008485835,0.0002367947,0.0005759498,0.0009197865,0.01878429],"genre_scores_gemma":[0.8252248,0.00244313,0.1601461,0.001021491,0.0008258682,0.0005330274,0.000515819,0.0005558737,0.008734016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01127962,"threshold_uncertainty_score":0.0596531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090891537","doi":"10.1016/j.jda.2014.12.005","title":"Universal point sets for planar three-trees","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Planar graph; Cardinality (data modeling); Planar; Mathematics; Plane (geometry); Embedding; Class (philosophy); Point (geometry); Upper and lower bounds; Set (abstract data type); Tree (set theory); Discrete mathematics; Computer science; Graph; Geometry; Artificial intelligence","authors":[{"name":"Radoslav Fulek","is_ca":false},{"name":"Csaba D. Tóth","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03579581875465403,"gpt":0.2878591626578711,"spread":0.2520633439032171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008054264,0.0005102081,0.00158026,0.002967337,0.00186232,0.002829288,0.002235932,0.001264567,0.006434449],"category_scores_gemma":[0.006707116,0.0008024402,0.001253769,0.002306664,0.002731206,0.003228106,0.006434873,0.002584329,0.0007815001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001297566,"about_ca_system_score_gemma":0.0005834589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002098172,"about_ca_topic_score_gemma":0.002138046,"domain_scores_codex":[0.9988416,0.0001438216,0.00009295498,0.0002020372,0.0005487397,0.0001707331],"domain_scores_gemma":[0.9976783,0.001114107,0.0002063388,0.0003917649,0.0003757679,0.0002336226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000613513,0.00003510174,0.0005875747,0.0001015032,0.00001891744,0.00007745966,0.0004470258,0.0236641,0.001080977,0.9359411,0.001511083,0.03647382],"study_design_scores_gemma":[0.00002060513,0.00002388029,0.0002589466,0.00005154395,0.00001626618,0.0001229053,0.0002378341,0.08479358,0.001156857,0.9084165,0.004883855,0.00001712727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1818816,0.0006014575,0.7935611,0.0003727955,0.00007970438,0.000113745,0.0005488405,0.0005254467,0.02231529],"genre_scores_gemma":[0.7969049,0.00069235,0.1893471,0.0001855272,0.0000592533,0.0002536626,0.001244821,0.0003305894,0.01098183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006434449,"threshold_uncertainty_score":0.02152532,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Bryant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01073836497027397,"gpt":0.2569843468178186,"spread":0.2462459818475446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006127327,0.003000092,0.00459135,0.003503314,0.003493538,0.008299644,0.01001855,0.007656091,0.03346027],"category_scores_gemma":[0.04944874,0.001588647,0.002690582,0.005495687,0.0040731,0.01603016,0.00910792,0.01642618,0.005418567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004526721,"about_ca_system_score_gemma":0.003644879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002245845,"about_ca_topic_score_gemma":0.002952251,"domain_scores_codex":[0.9942772,0.001588616,0.000191077,0.001018167,0.001752907,0.00117206],"domain_scores_gemma":[0.9475352,0.04221101,0.001402555,0.004030255,0.002258793,0.002562182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002315406,0.001017995,0.002970777,0.001407462,0.0003554652,0.000303884,0.0007748288,0.2611414,0.006591354,0.4486678,0.08727141,0.1871823],"study_design_scores_gemma":[0.00036764,0.0002454777,0.0007565024,0.0001699619,0.0001697183,0.0002813302,0.0002028609,0.4823212,0.001668451,0.5016749,0.01208816,0.00005380942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04460663,0.006032674,0.8729165,0.01867837,0.001208073,0.0003280895,0.001858763,0.001974725,0.05239624],"genre_scores_gemma":[0.4532848,0.006171632,0.4842969,0.006249296,0.002850197,0.001605237,0.00627805,0.002971706,0.03629202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03346027,"threshold_uncertainty_score":0.1119357,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2175772512","doi":"10.1016/j.jda.2012.04.009","title":"Kinetic Euclidean minimum spanning tree in the plane","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Euclidean minimum spanning tree; Delaunay triangulation; Mathematics; Combinatorics; Spanning tree; Constrained Delaunay triangulation; Minimum spanning tree; Bowyer–Watson algorithm; Plane (geometry); Euclidean geometry; Euclidean space; Pitteway triangulation; Triangulation; Geometry; Kruskal's algorithm","authors":[{"name":"Zahed Rahmati","is_ca":true},{"name":"Alireza Zarei","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02183772406415762,"gpt":0.2748747911010951,"spread":0.2530370670369375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002375109,0.0002590288,0.0006579019,0.0006550596,0.0003989612,0.001009124,0.000807462,0.000869116,0.003694373],"category_scores_gemma":[0.001447607,0.0002201363,0.0002472124,0.0008005175,0.0004818851,0.001660802,0.0006883151,0.0007119207,0.000554818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004905,"about_ca_system_score_gemma":0.0003214185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001092732,"about_ca_topic_score_gemma":0.001048218,"domain_scores_codex":[0.9998895,0.00003056851,0.000007887686,0.0000207208,0.00003590324,0.00001542694],"domain_scores_gemma":[0.9997225,0.0001172235,0.00004680673,0.00002504956,0.00005272157,0.00003568096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002208712,0.00004408716,0.0006421344,0.0002100665,0.00003070243,0.0001819261,0.0001051224,0.3545114,0.003929298,0.6002984,0.004700799,0.03512533],"study_design_scores_gemma":[0.00004250844,0.00003621305,0.0003650388,0.00002163659,0.00001224556,0.0001791979,0.00007262623,0.6569524,0.0006528461,0.3377703,0.003881708,0.00001326928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.284447,0.001792319,0.6711146,0.001345296,0.0001760908,0.00008225576,0.0008425897,0.0003394689,0.03986046],"genre_scores_gemma":[0.8797243,0.001480917,0.1027927,0.0001401247,0.00005593157,0.00006795311,0.0007507724,0.0001150725,0.01487218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003694373,"threshold_uncertainty_score":0.01235896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063861912","doi":"10.1016/j.jda.2012.06.001","title":"Acyclic colorings of graph subdivisions revisited","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Subdivision; Directed acyclic graph; Graph coloring; Complete coloring; Edge coloring; List coloring; Greedy coloring; Discrete mathematics; Graph; Graph power; Line graph","authors":[{"name":"Debajyoti Mondal","is_ca":true},{"name":"Rahnuma Islam Nishat","is_ca":true},{"name":"Sue Whitesides","is_ca":true},{"name":"Md. Saidur Rahman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02620916966809514,"gpt":0.3211889521274647,"spread":0.2949797824593696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00138662,0.0004850076,0.0008558725,0.001962054,0.002147044,0.00303806,0.002107579,0.001487527,0.01096308],"category_scores_gemma":[0.01041173,0.001046818,0.001188368,0.002953753,0.003025678,0.003805668,0.001895302,0.003285958,0.0006858854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001662672,"about_ca_system_score_gemma":0.0009662327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005875485,"about_ca_topic_score_gemma":0.006799306,"domain_scores_codex":[0.9990379,0.0003754765,0.00004983176,0.0001923368,0.0001852531,0.0001593139],"domain_scores_gemma":[0.9912407,0.005086152,0.0007899328,0.001354102,0.0008521943,0.0006769182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003999106,0.00001995487,0.0005326404,0.00004260385,0.000007419816,0.00005639794,0.0003553054,0.003822683,0.0004758515,0.9826311,0.001898099,0.01011809],"study_design_scores_gemma":[0.00002014775,0.00001287559,0.0004388012,0.00002780042,0.00001701642,0.00009041934,0.0002494445,0.01785052,0.0002718593,0.9754964,0.00551484,0.000009801545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3991575,0.00285474,0.4686494,0.004544433,0.0007066693,0.0001693719,0.0005544643,0.000639847,0.1227235],"genre_scores_gemma":[0.8585276,0.001981871,0.1081644,0.0008647004,0.0005151742,0.0001440901,0.0005794883,0.0003638666,0.02885874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01096308,"threshold_uncertainty_score":0.03667516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004251193","doi":"10.1016/j.jda.2012.04.006","title":"Quasi-cyclic codes over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:math> and enumeration of defining polynomials","year":2012,"lang":"lv","type":"article","venue":"Journal of Discrete Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Hamming distance; Mathematics; Circulant matrix; Hamming code; Combinatorics; Minimum distance; Discrete mathematics; Code (set theory); Algorithm; Computer science; Block code","authors":[{"name":"V. Ch. Venkaiah","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01873549912518667,"gpt":0.2489108541747267,"spread":0.23017535504954,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009110195,0.0004079294,0.0003010575,0.001007463,0.0008718445,0.001793347,0.0005057407,0.0004851695,0.01425495],"category_scores_gemma":[0.004422649,0.0003045732,0.000314378,0.00145002,0.0008932086,0.002067002,0.001173069,0.001056082,0.004598069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001021454,"about_ca_system_score_gemma":0.001456931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001979247,"about_ca_topic_score_gemma":0.002449914,"domain_scores_codex":[0.999086,0.0002642256,0.0000712522,0.000134327,0.0002383144,0.0002059084],"domain_scores_gemma":[0.9968003,0.001542341,0.0003667157,0.00053406,0.0005596986,0.0001968842],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001832138,0.00005329699,0.0006900457,0.000107635,0.000006841202,0.0001640003,0.0003433431,0.003067693,0.004250405,0.9225018,0.01733289,0.05129882],"study_design_scores_gemma":[0.00009495691,0.0001369426,0.001664982,0.0001457489,0.0000205667,0.0008133726,0.000186953,0.02387108,0.01437598,0.8690401,0.0895603,0.0000889747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2849333,0.001164083,0.4505074,0.003853684,0.0006641746,0.0003314629,0.006559671,0.002482437,0.2495038],"genre_scores_gemma":[0.8173981,0.001270275,0.08204087,0.0007855844,0.0005475734,0.0002796149,0.004787903,0.0008501763,0.09203982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01425495,"threshold_uncertainty_score":0.04768759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2762796277","doi":"10.1016/j.jda.2017.10.002","title":"Necklaces and Lyndon words in colexicographic and binary reflected Gray code order","year":2017,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science, ICT and Future Planning","keywords":"De Bruijn sequence; Gray code; Binary number; Combinatorics; Order (exchange); Code (set theory); Sequence (biology); Gray (unit); Mathematics; Computer science; Algorithm; Arithmetic; Chemistry; Set (abstract data type)","authors":[{"name":"Joe Sawada","is_ca":false},{"name":"Aaron Williams","is_ca":false},{"name":"Dennis Wong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01710391269247407,"gpt":0.2983183978350761,"spread":0.281214485142602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004909736,0.0004354033,0.0005238129,0.001852305,0.0009302748,0.001961098,0.0006312277,0.00108309,0.007836089],"category_scores_gemma":[0.005267479,0.0003069671,0.0003892925,0.001317149,0.002024156,0.002287152,0.001445676,0.001328934,0.001072429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00126349,"about_ca_system_score_gemma":0.0009373294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002529747,"about_ca_topic_score_gemma":0.002817922,"domain_scores_codex":[0.999446,0.0001125439,0.00004698733,0.0000810706,0.0001886986,0.0001247078],"domain_scores_gemma":[0.9983233,0.0006628737,0.0002478307,0.0002658037,0.0003146911,0.0001856418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001928088,0.00003038322,0.0005964128,0.00003543578,0.000004709065,0.0002164265,0.0003400792,0.004329617,0.002552823,0.9704549,0.001747314,0.01949905],"study_design_scores_gemma":[0.00003703951,0.00009098984,0.0005913986,0.00005835096,0.0000132722,0.0003761277,0.0002949249,0.04887199,0.004678952,0.9354814,0.009452533,0.00005296418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7059487,0.001027455,0.2233887,0.001121185,0.0003766524,0.000101095,0.0003736119,0.0005718854,0.06709068],"genre_scores_gemma":[0.9229555,0.0004491608,0.03469777,0.000460519,0.0001412922,0.00009073534,0.0002931376,0.0002610349,0.04065085],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.007836089,"threshold_uncertainty_score":0.02621436,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982134706","doi":"10.1016/j.jda.2011.04.002","title":"Finding common RNA pseudoknot structures in polynomial time","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pseudoknot; Time complexity; RNA; Computation; Computer science; Polynomial; Algorithm; Mathematics; Theoretical computer science; Combinatorics; Biology; Genetics","authors":[{"name":"Patricia Evans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01926749540988061,"gpt":0.2570830243968982,"spread":0.2378155289870176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001731473,0.001584323,0.002872731,0.00187272,0.002321799,0.003356672,0.003266783,0.003035103,0.01229786],"category_scores_gemma":[0.01313434,0.00135788,0.002566327,0.002653949,0.00193811,0.007494944,0.004422177,0.00219947,0.001857346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002102599,"about_ca_system_score_gemma":0.002899548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001790752,"about_ca_topic_score_gemma":0.004654264,"domain_scores_codex":[0.9968417,0.0006590124,0.0002257671,0.0009278961,0.0008385826,0.0005070017],"domain_scores_gemma":[0.9849625,0.01093359,0.001057195,0.001785954,0.000746987,0.0005137836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005530908,0.00148069,0.01102909,0.001611289,0.0006372706,0.001003759,0.001450622,0.3661743,0.03497802,0.1200268,0.01703268,0.4390446],"study_design_scores_gemma":[0.000837263,0.0004260838,0.0009149162,0.00005176728,0.0001796003,0.0005492286,0.0005610787,0.7055427,0.01336015,0.2743585,0.003160336,0.00005835035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3547211,0.0006125129,0.6271235,0.002120753,0.0001763805,0.0005531893,0.0009917769,0.002980588,0.01072028],"genre_scores_gemma":[0.6143479,0.0002384891,0.3771191,0.0003197126,0.00009555635,0.0002799767,0.001792881,0.00056316,0.005243262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01229786,"threshold_uncertainty_score":0.0411405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067300659","doi":"10.1016/j.jda.2014.12.006","title":"Inferring an indeterminate string from a prefix graph","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Prefix; Lexicographical order; String (physics); Graph; Alphabet; Indeterminate; Simple graph","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01381848821749672,"gpt":0.2617633147738582,"spread":0.2479448265563615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008617087,0.0006380301,0.0009986483,0.002511232,0.0008022047,0.001593113,0.001640169,0.002260519,0.003732151],"category_scores_gemma":[0.0133774,0.0004879206,0.0008662534,0.002833531,0.001055081,0.00481615,0.001580906,0.001911083,0.001095919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006798468,"about_ca_system_score_gemma":0.001106253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001928467,"about_ca_topic_score_gemma":0.002395403,"domain_scores_codex":[0.9987159,0.0002553043,0.0001202129,0.0003849836,0.0004244058,0.00009916809],"domain_scores_gemma":[0.9904233,0.006628705,0.0003508242,0.001592865,0.0008259908,0.0001783476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002033966,0.0004870341,0.01471916,0.0008565193,0.0001941645,0.003035695,0.0006185145,0.1887519,0.04179466,0.1678286,0.01331728,0.5663624],"study_design_scores_gemma":[0.00003591316,0.0001130596,0.0008412789,0.00005482509,0.00006710191,0.0004713465,0.0001519946,0.7897496,0.01254876,0.1917309,0.004204729,0.00003044961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1972413,0.0005618461,0.7899968,0.001743366,0.0002718564,0.00015203,0.003522639,0.003358522,0.003151633],"genre_scores_gemma":[0.6066784,0.0004750238,0.3851739,0.0002826615,0.0001842844,0.0001151257,0.004092711,0.0004137208,0.00258418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003732151,"threshold_uncertainty_score":0.01248527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130384369","doi":"10.1016/j.jda.2012.12.004","title":"A computational framework for determining run-maximal strings","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"String (physics); Computation; Combinatorics; Mathematics; Function (biology); Binary number; Key (lock); Element (criminal law); Cover (algebra); Discrete mathematics; Algorithm; Computer science; Arithmetic; Mathematical physics","authors":[{"name":"Andrew Baker","is_ca":true},{"name":"Antoine Deza","is_ca":true},{"name":"František Franěk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02583056304200663,"gpt":0.3077244475159101,"spread":0.2818938844739035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005436039,0.001337241,0.002434779,0.005197567,0.003501347,0.007447523,0.006379274,0.003285089,0.0095809],"category_scores_gemma":[0.0359218,0.001365279,0.003102744,0.005313917,0.005401006,0.01262981,0.006984723,0.005213894,0.002491378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002319759,"about_ca_system_score_gemma":0.004715466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003059611,"about_ca_topic_score_gemma":0.004216058,"domain_scores_codex":[0.9937736,0.001383117,0.0006291308,0.001720864,0.001734404,0.0007589005],"domain_scores_gemma":[0.9738963,0.01808399,0.001194747,0.003917524,0.002286831,0.0006205699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005101724,0.000275654,0.001546843,0.0003494283,0.00008659092,0.0001982092,0.0004651157,0.1265482,0.004987544,0.6788206,0.007208046,0.1790037],"study_design_scores_gemma":[0.00003447813,0.00006496422,0.0001616832,0.00007126268,0.00003899183,0.00008451087,0.0001147126,0.3141103,0.003692651,0.678021,0.003558412,0.00004707777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008335424,0.0001340543,0.9872589,0.0002982528,0.00004293835,0.00008430486,0.0002770087,0.0009682309,0.002600848],"genre_scores_gemma":[0.1521354,0.0002443649,0.8426418,0.0002119642,0.0001591496,0.0003071747,0.001282218,0.0005712312,0.002446728],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0095809,"threshold_uncertainty_score":0.03205132,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1902053630","doi":"10.1016/j.jda.2011.03.001","title":"Spanners of additively weighted point sets","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Delaunay triangulation; Voronoi diagram; Spanner; Bounded function; Geometric graph theory; Embedding; Dual graph; Graph; Discrete mathematics; Planar graph; Line graph; Geometry; Graph power; Computer science; Mathematical analysis; Artificial intelligence","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Paz Carmi","is_ca":true},{"name":"Mathieu Couture","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02612243094313123,"gpt":0.2524998821593568,"spread":0.2263774512162255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007006424,0.0007221234,0.0009660251,0.002390615,0.0007118387,0.001833899,0.001550256,0.0007801414,0.00687703],"category_scores_gemma":[0.003829635,0.0006769274,0.0006662221,0.001580566,0.001130432,0.002677375,0.003861799,0.001610501,0.0008830825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003677864,"about_ca_system_score_gemma":0.0002339421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003215018,"about_ca_topic_score_gemma":0.0005882868,"domain_scores_codex":[0.9990834,0.0001676114,0.00007771701,0.0001756346,0.0004015105,0.00009412893],"domain_scores_gemma":[0.9981029,0.0007166899,0.0002683718,0.0002607975,0.0003717846,0.0002793709],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001434809,0.00009545861,0.001271439,0.0001019938,0.0000585394,0.0002533847,0.0003205042,0.0338937,0.00788182,0.8977743,0.001355981,0.05684941],"study_design_scores_gemma":[0.00001613049,0.0001199624,0.0007557758,0.00003955294,0.00003571583,0.00034504,0.0001723897,0.1544758,0.004396954,0.8345767,0.005044792,0.00002105637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.31558,0.0002958816,0.6622009,0.0001530274,0.0001469608,0.00006415852,0.0001889344,0.0002495922,0.02112074],"genre_scores_gemma":[0.794386,0.0005128542,0.1655621,0.0001377577,0.0001383512,0.0002059926,0.0006245007,0.0002962364,0.03813622],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00687703,"threshold_uncertainty_score":0.02300596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}