{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002356677,0.0001341894,0.0003627165,0.0002214051,0.0001049929,0.00009522741,0.0005577781,0.00007646239,0.0001834124],"category_scores_gemma":[0.005291634,0.00009179546,0.0002063405,0.0003915891,0.000150916,0.0002535757,0.00002972036,0.0001833032,0.00007157002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007062265,"about_ca_system_score_gemma":0.00006971592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002544624,"about_ca_topic_score_gemma":0.000004224554,"domain_scores_codex":[0.9981188,0.0001920343,0.0007201698,0.0002087415,0.0005222899,0.0002379721],"domain_scores_gemma":[0.9948965,0.004003438,0.0004537924,0.0003581213,0.0001980129,0.00009009261],"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.007400536,0.001446481,0.0005557287,0.00002632123,0.0005334998,0.0001435332,0.004150954,0.01972634,0.02370935,0.728757,0.02618321,0.1873671],"study_design_scores_gemma":[0.00253537,0.0009931977,0.001133388,0.0000294052,0.00003052699,0.00002762156,0.002778434,0.003949594,0.004888709,0.9744677,0.008959576,0.000206502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9599904,0.0005591296,0.02813999,0.003538997,0.0007764674,0.00044336,0.00005941489,0.00002189739,0.006470374],"genre_scores_gemma":[0.9815509,0.00004860133,0.01529621,0.00008138698,0.00005975075,0.00001671596,0.000001008771,0.00001295484,0.002932518],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2457107,"threshold_uncertainty_score":0.6334962,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001724361,0.0003169287,0.0004982648,0.000357647,0.0002498431,0.0003627792,0.001831607,0.0000847529,0.00004553381],"category_scores_gemma":[0.00004680539,0.0002437602,0.0003127223,0.0004048271,0.00006175404,0.002041668,0.000610411,0.0006056072,0.0000352059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001138921,"about_ca_system_score_gemma":0.0001192748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009824413,"about_ca_topic_score_gemma":0.000005432929,"domain_scores_codex":[0.9966784,0.00008810817,0.001076292,0.0003892917,0.001091919,0.0006760012],"domain_scores_gemma":[0.9974927,0.0002176633,0.0008198958,0.0006765337,0.0003319279,0.0004612364],"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.0000101757,0.00009359208,0.0001322172,0.00001021766,0.00006251476,0.0009017245,0.0003890823,0.00009513248,0.0004915562,0.0001801815,0.002532619,0.995101],"study_design_scores_gemma":[0.007446138,0.002860437,0.02155873,0.0008616904,0.0001949926,0.01040596,0.00175908,0.7493245,0.02862445,0.04881693,0.1251587,0.002988388],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005734629,0.0005736332,0.9913851,0.0003013362,0.001353673,0.0001094227,0.00004201377,0.00007178519,0.0004283883],"genre_scores_gemma":[0.2784671,0.0001658692,0.7182406,0.0007390261,0.002166257,0.000002514213,0.00002509321,0.00005500812,0.0001386027],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9921126,"threshold_uncertainty_score":0.9940253,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001084983,0.0001868531,0.0003917595,0.0005926575,0.00006783191,0.0002115431,0.001106736,0.0001072812,0.00001704094],"category_scores_gemma":[0.00006335106,0.0001591114,0.0001801358,0.00218675,0.00003919657,0.0008985016,0.0001875063,0.0006035831,0.000006362241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001423186,"about_ca_system_score_gemma":0.0000762003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008214338,"about_ca_topic_score_gemma":0.00001496982,"domain_scores_codex":[0.9976907,0.0001162098,0.000896878,0.0002459718,0.0005404158,0.000509824],"domain_scores_gemma":[0.9985089,0.0002540277,0.0006108132,0.0003479657,0.0001432941,0.0001350063],"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.00002406386,0.0001978624,0.01312135,0.00001525994,0.00005614548,0.001295087,0.0001424999,0.5395294,0.00008158384,0.003244806,0.01120396,0.431088],"study_design_scores_gemma":[0.001220443,0.000254546,0.03748964,0.0001292646,0.0000147563,0.0007039457,0.00001892644,0.9540963,0.0001027638,0.001924695,0.003742256,0.0003024689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01012948,0.00437534,0.98248,0.0002574778,0.001012435,0.0001018508,6.548786e-7,0.00003152141,0.001611278],"genre_scores_gemma":[0.8781161,0.0001715276,0.1196628,0.00009515988,0.001734941,0.000003537985,0.000001413277,0.00002221224,0.0001922795],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8679867,"threshold_uncertainty_score":0.6488376,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001067008,0.0002138786,0.0003180309,0.00009543237,0.0005486677,0.0005264895,0.002160956,0.00007308061,0.00000215145],"category_scores_gemma":[0.00007744222,0.0001222458,0.0002035941,0.0003807413,0.0001869253,0.001435632,0.0002303406,0.0003410928,0.000006712038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001094737,"about_ca_system_score_gemma":0.0003121123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008764632,"about_ca_topic_score_gemma":0.00002757126,"domain_scores_codex":[0.9978348,0.00008332203,0.0007248719,0.0002719372,0.0006337118,0.0004513774],"domain_scores_gemma":[0.9978342,0.0002919612,0.0007233035,0.0005232181,0.000426203,0.0002010838],"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.0003378112,0.0005157024,0.0006665091,0.0001340462,0.0005124764,0.0008145456,0.003147566,0.01578971,0.009202225,0.135707,0.00788026,0.8252922],"study_design_scores_gemma":[0.008935285,0.006591733,0.006063569,0.001553112,0.0001983326,0.004178165,0.0009723229,0.1396494,0.03522214,0.6885039,0.1061371,0.001994894],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00751294,0.002193489,0.9804004,0.008155109,0.001028742,0.0003918134,0.00003756629,0.00005730396,0.0002225669],"genre_scores_gemma":[0.289021,0.001021564,0.7084844,0.0003924815,0.0008160925,0.00003820504,0.00001598917,0.00003561731,0.0001746987],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8232973,"threshold_uncertainty_score":0.5076951,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000425768,0.0002145164,0.000311194,0.0002353647,0.0001525706,0.0003305576,0.001187225,0.00007620685,0.00001625347],"category_scores_gemma":[0.00001398784,0.0001565897,0.0001800255,0.0002259273,0.00003329165,0.001256365,0.0003035369,0.0004342528,0.00002384641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006337064,"about_ca_system_score_gemma":0.00005525243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001052474,"about_ca_topic_score_gemma":0.000003117792,"domain_scores_codex":[0.997981,0.0000715776,0.0006130886,0.0002661925,0.0007333579,0.0003347931],"domain_scores_gemma":[0.9985998,0.00009788775,0.0005924514,0.0004313198,0.0001369691,0.0001415979],"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.0000263994,0.0002473514,0.0006938689,0.00002526388,0.0000510724,0.0008484946,0.0004702489,0.002460009,0.001711692,0.002331194,0.00473163,0.9864028],"study_design_scores_gemma":[0.01163781,0.006871285,0.1404241,0.0034166,0.0001920445,0.004347998,0.0007101905,0.6259419,0.04375725,0.09808785,0.06057969,0.004033253],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0513492,0.0001734811,0.9458547,0.0005699067,0.0008953479,0.00007265118,0.00001838411,0.00004436772,0.00102193],"genre_scores_gemma":[0.9149173,0.00004239256,0.08332622,0.0003134874,0.001115832,0.000002278279,0.00000712798,0.00002614894,0.0002491724],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9823695,"threshold_uncertainty_score":0.6385543,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235884,0.0001356286,0.0002062801,0.000117679,0.0005681522,0.0005801985,0.001001133,0.00004957709,0.000001671142],"category_scores_gemma":[0.00005079885,0.0000814407,0.00006082,0.0003240105,0.00005909465,0.0006969646,0.0006579051,0.0006002205,0.000004398568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001646167,"about_ca_system_score_gemma":0.00004426302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001387948,"about_ca_topic_score_gemma":0.00000629291,"domain_scores_codex":[0.9985329,0.0000737056,0.0004366564,0.0002442965,0.000442566,0.0002698962],"domain_scores_gemma":[0.9984129,0.0002121124,0.000303407,0.0005872693,0.000218008,0.0002662703],"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.00001717551,0.0000419343,0.0002230159,0.00002230034,0.00002420875,0.00002275414,0.0002918561,0.00008871555,0.007897594,0.01748713,0.0007635112,0.9731198],"study_design_scores_gemma":[0.002614925,0.001408292,0.02780679,0.001087045,0.0001163472,0.002961294,0.0006132737,0.5906115,0.00755692,0.08079933,0.2829827,0.001441573],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01164425,0.0006502615,0.9844359,0.0023754,0.0002313874,0.0003823789,0.00001014992,0.00003774394,0.0002325699],"genre_scores_gemma":[0.1771743,0.0006488367,0.8206807,0.0002642245,0.001031842,0.00003173162,0.000007337961,0.00003222323,0.0001288015],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9716783,"threshold_uncertainty_score":0.5594867,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008136071,0.00020216,0.0004468909,0.0001809402,0.0002483625,0.0001202664,0.0007512937,0.0001116965,0.0000231158],"category_scores_gemma":[0.00006353108,0.0001563862,0.000415391,0.0002706128,0.00006576761,0.0009305771,0.00008556167,0.0002576689,0.00001252214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008169075,"about_ca_system_score_gemma":0.0001249733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001766739,"about_ca_topic_score_gemma":0.000002271923,"domain_scores_codex":[0.9982056,0.000111971,0.0006374826,0.0002671564,0.0004099772,0.0003677924],"domain_scores_gemma":[0.9982991,0.0002383183,0.0005259089,0.0003312015,0.0004612382,0.000144213],"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.0001996837,0.0007982615,0.0006492293,0.00007333753,0.001181039,0.0009250247,0.009027844,0.006323574,0.001749394,0.008590041,0.1771318,0.7933508],"study_design_scores_gemma":[0.002424169,0.001564841,0.0007667833,0.0001085813,0.0000325663,0.004156633,0.0001906524,0.9288459,0.003204112,0.001126118,0.05707844,0.0005011819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008007931,0.0003974847,0.987191,0.0005130446,0.0031077,0.0001889818,0.00001265703,0.00004256324,0.0005386463],"genre_scores_gemma":[0.3263485,0.0001200072,0.6679211,0.0005493379,0.002936373,0.00002415844,0.000002521203,0.00005012826,0.002047854],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9225224,"threshold_uncertainty_score":0.6377243,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003830241,0.0002403209,0.0003022703,0.0001820708,0.00008076623,0.00005647807,0.0004394797,0.0001532505,0.00008779672],"category_scores_gemma":[0.00006928981,0.0002040038,0.0003551213,0.0002019475,0.00008149978,0.00002293551,0.00009715795,0.0002582685,0.00002600105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004392808,"about_ca_system_score_gemma":0.00008769181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005355664,"about_ca_topic_score_gemma":0.00001004653,"domain_scores_codex":[0.9983104,0.00006645351,0.0005362526,0.0002520157,0.000453359,0.0003815416],"domain_scores_gemma":[0.9986573,0.00001109302,0.0005239501,0.0003136289,0.0002586175,0.0002354519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008872907,0.001176943,0.02719348,0.0001174731,0.002964722,0.0003857553,0.0008566653,0.003258029,0.6013764,0.000250811,0.1125914,0.2489411],"study_design_scores_gemma":[0.00762733,0.003749162,0.03023441,0.0001456483,0.0003920446,0.001050951,0.001844431,0.0008734778,0.1370557,0.0005699955,0.8149166,0.00154035],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9631898,0.0115444,0.01548905,0.003100295,0.001330878,0.0003897776,0.00009934067,0.00002765925,0.004828736],"genre_scores_gemma":[0.9652036,0.001850397,0.02863082,0.0005164928,0.00235103,0.000005571851,0.00004077568,0.0000684592,0.001332811],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7023251,"threshold_uncertainty_score":0.8319035,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452451,0.0001907318,0.0003882739,0.000355305,0.000248208,0.0008081526,0.0007673919,0.0001059001,0.0000189386],"category_scores_gemma":[0.0007648326,0.0001639324,0.0002497399,0.0006986681,0.00007920531,0.001299413,0.0001087663,0.0001790822,0.0000062175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007604769,"about_ca_system_score_gemma":0.0001392323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000382304,"about_ca_topic_score_gemma":0.000001677372,"domain_scores_codex":[0.997657,0.00006422887,0.001032157,0.0002709767,0.0005902509,0.0003854023],"domain_scores_gemma":[0.997394,0.0004274724,0.0008631355,0.0003696442,0.0007083327,0.0002374716],"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.0003429881,0.001003477,0.001610817,0.0002901565,0.0009408469,0.0002727714,0.004505172,0.001776038,0.006494496,0.02875016,0.0325927,0.9214204],"study_design_scores_gemma":[0.003488674,0.0007717778,0.002674206,0.0004684378,0.0001746381,0.0001844812,0.0002442941,0.9346052,0.01348537,0.005833684,0.03738211,0.0006871358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001249239,0.0002102615,0.9970137,0.000622087,0.000526368,0.000168802,0.00002749976,0.00004336652,0.0001386941],"genre_scores_gemma":[0.03149872,0.00008351472,0.9661757,0.0009785419,0.0007466533,0.000002077912,0.00006649065,0.00003187974,0.0004164028],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9328291,"threshold_uncertainty_score":0.7793034,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005263453,0.00006674106,0.0001186266,0.00007528273,0.0001126913,0.00008381851,0.0004169419,0.00002408592,0.000003258134],"category_scores_gemma":[0.00004571566,0.00004084572,0.0001065106,0.0002991676,0.0000387587,0.0004400852,0.00006042229,0.0001106524,0.000001639596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001950352,"about_ca_system_score_gemma":0.0001049123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001219519,"about_ca_topic_score_gemma":0.000006345414,"domain_scores_codex":[0.998913,0.00006067963,0.0004156832,0.00007993491,0.0004165216,0.0001141055],"domain_scores_gemma":[0.9989467,0.0001506754,0.0004172791,0.0001569631,0.000288711,0.00003967306],"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.00006142903,0.000384603,0.001062562,0.00003032416,0.000163969,0.00002961873,0.0003185509,0.01719816,0.005842947,0.3627841,0.01732528,0.5947984],"study_design_scores_gemma":[0.002691804,0.001525445,0.07218464,0.0001282964,0.00008264705,0.0005061854,0.0002232009,0.5082746,0.06432176,0.2567059,0.09279282,0.0005628305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03902546,0.001385788,0.9538409,0.00267153,0.0008503102,0.00008922444,0.000004285308,0.0000129234,0.002119546],"genre_scores_gemma":[0.9029533,0.00006547529,0.09581674,0.00002684646,0.0005622425,0.000001233188,0.000001891133,0.000004385237,0.0005679207],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8639278,"threshold_uncertainty_score":0.166564,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000440003,0.00008791926,0.0001755919,0.0002366547,0.00007211205,0.00006575753,0.0004971831,0.00003591558,0.00004106899],"category_scores_gemma":[0.00008388569,0.00007326716,0.0001364875,0.0004042233,0.00002344919,0.0009967756,0.0001134255,0.0001333429,0.000004718062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003317108,"about_ca_system_score_gemma":0.0001310233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003412659,"about_ca_topic_score_gemma":0.00000194891,"domain_scores_codex":[0.9986985,0.00005011484,0.0005165281,0.0001110677,0.0004903998,0.0001334063],"domain_scores_gemma":[0.9988335,0.0001033205,0.0004303068,0.0001865747,0.0003517757,0.00009455056],"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.00004908799,0.0006072563,0.0006366888,0.0000668342,0.000295009,0.00003786093,0.003161539,0.1935551,0.01949734,0.07010032,0.01014334,0.7018497],"study_design_scores_gemma":[0.0007725703,0.0002716444,0.004768104,0.00007648856,0.00002679837,0.000248821,0.00008932695,0.9622796,0.01130557,0.01368879,0.006279261,0.0001930374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02506083,0.000657947,0.9702742,0.002642368,0.000293791,0.00005400196,0.000006890961,0.00001252977,0.0009974156],"genre_scores_gemma":[0.5978697,0.00003125035,0.4014345,0.0000949586,0.0004029104,0.000001239068,0.00000349433,0.000004353172,0.0001575579],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7687245,"threshold_uncertainty_score":0.2987748,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006932112,0.0001555951,0.0002640797,0.0002414026,0.0001388526,0.000199059,0.0005618733,0.00006759004,0.000008794291],"category_scores_gemma":[0.0000938951,0.0001288227,0.0002628428,0.000377384,0.00002090285,0.0009152669,0.00004555115,0.000170899,0.000006908689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005370925,"about_ca_system_score_gemma":0.0001539158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.535105e-7,"about_ca_topic_score_gemma":1.984122e-7,"domain_scores_codex":[0.9984136,0.00004600563,0.0005480638,0.0002199546,0.0005050634,0.000267372],"domain_scores_gemma":[0.9986687,0.000104904,0.0003707317,0.0002145731,0.0004699692,0.0001711448],"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.00007725319,0.0001847547,0.00000820746,0.000009313805,0.0000936604,0.0001322526,0.0005184381,0.02134893,0.002234088,0.02045245,0.009421118,0.9455196],"study_design_scores_gemma":[0.002791006,0.002776859,0.00200333,0.00005849975,0.00006445438,0.001848905,0.0000772829,0.870294,0.006254332,0.03884863,0.07447219,0.0005105389],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004291908,0.0006496765,0.9892046,0.004249863,0.001057817,0.0001430751,0.000007387398,0.00002974849,0.0003658797],"genre_scores_gemma":[0.06328785,0.00004328421,0.9339125,0.0006146132,0.001447494,0.000002589484,0.00000781083,0.000009138033,0.0006747034],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.945009,"threshold_uncertainty_score":0.5253237,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001262575,0.0001884005,0.0005148601,0.0003883433,0.00008116554,0.00004497569,0.001822466,0.00006910866,0.0000590898],"category_scores_gemma":[0.00009554711,0.0001437441,0.0003463496,0.000763026,0.0005029849,0.000966377,0.000289092,0.00038939,0.000007473637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003273862,"about_ca_system_score_gemma":0.0001094127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000454382,"about_ca_topic_score_gemma":0.000004811236,"domain_scores_codex":[0.9974762,0.0002796182,0.0008260327,0.0002401009,0.000767754,0.0004103132],"domain_scores_gemma":[0.9977054,0.000137995,0.0008110821,0.0006033433,0.0004959276,0.0002462403],"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.00172515,0.002764543,0.01763954,0.0005873746,0.002070184,0.0009336574,0.02114416,0.0004063221,0.1386286,0.6155158,0.000906548,0.1976781],"study_design_scores_gemma":[0.002928874,0.003034797,0.02802241,0.0002519472,0.00005456704,0.0004269033,0.0002681407,0.01264425,0.04899886,0.9023189,0.0004817739,0.0005685809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1250439,0.0004938772,0.8714747,0.0002084724,0.0004312477,0.0002823021,0.00001663395,0.00004388005,0.002004964],"genre_scores_gemma":[0.6119822,0.0002045727,0.3876644,0.00002348141,0.00005319478,0.000004274934,7.975634e-7,0.00001583512,0.00005127983],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4869383,"threshold_uncertainty_score":0.5861715,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003710798,0.0001283686,0.000211805,0.0001628329,0.0002433203,0.0001704158,0.001085836,0.00002820046,0.00001881917],"category_scores_gemma":[0.00006039703,0.0001041736,0.0001381273,0.0004368228,0.00007417505,0.002297944,0.0001710678,0.0001969888,0.00003099947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004007661,"about_ca_system_score_gemma":0.00007770747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006852622,"about_ca_topic_score_gemma":0.000001254112,"domain_scores_codex":[0.9984996,0.00003767827,0.0004614656,0.0001769069,0.0005754626,0.0002488594],"domain_scores_gemma":[0.998889,0.0000611068,0.0004030695,0.0003204409,0.0002113462,0.0001149961],"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.00007692727,0.001139557,0.01352484,0.0001891116,0.001181011,0.008682841,0.01197475,0.004423986,0.001684392,0.1860416,0.1734653,0.5976157],"study_design_scores_gemma":[0.003766408,0.0008699367,0.03109436,0.0002787116,0.0001362121,0.00339827,0.0008539467,0.630165,0.0009063722,0.01299233,0.3141213,0.001417129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004367899,0.0004678618,0.9912391,0.001034122,0.0007147948,0.0000590536,0.00001023692,0.00004063414,0.002066289],"genre_scores_gemma":[0.4834624,0.000637511,0.5122263,0.0004903647,0.000931172,0.000004182458,0.00001162488,0.00002495213,0.002211482],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6257411,"threshold_uncertainty_score":0.4248078,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016909,0.0001675516,0.0003060868,0.0001812006,0.0001215331,0.00034447,0.0008142877,0.00008221446,0.00004389891],"category_scores_gemma":[0.000048342,0.0001136372,0.0002035954,0.0003101285,0.00004850849,0.001161926,0.0001692253,0.0002635949,0.0001136913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008289188,"about_ca_system_score_gemma":0.00006127713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001135032,"about_ca_topic_score_gemma":0.000002104495,"domain_scores_codex":[0.9982368,0.0001618084,0.0005595571,0.0001934512,0.0004912714,0.0003570905],"domain_scores_gemma":[0.9985967,0.00006952358,0.0005538643,0.0003126145,0.0002196757,0.0002476141],"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.0000104313,0.0002160501,0.00480407,0.00009509389,0.0003339467,0.0003549398,0.00834929,0.0001314733,0.00290041,0.04788952,0.009710924,0.9252039],"study_design_scores_gemma":[0.009519498,0.006825471,0.07031409,0.0003364234,0.0002585366,0.007391502,0.005552559,0.2811416,0.01929272,0.4000963,0.195267,0.004004267],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01400139,0.0003292594,0.9817429,0.0009700738,0.001723648,0.0001694469,6.219406e-7,0.00004138285,0.001021316],"genre_scores_gemma":[0.9779514,0.00002681337,0.02118555,0.00007417822,0.0004108275,0.00000533534,0.000001336251,0.00001231772,0.0003322162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.96395,"threshold_uncertainty_score":0.463399,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006507629,0.0002341836,0.0004162264,0.0005105049,0.00009198867,0.0002153652,0.001000497,0.00007204251,0.00001540934],"category_scores_gemma":[0.00001643905,0.0001703503,0.0001900672,0.001001702,0.0002289838,0.0008210114,0.0001219702,0.0004894506,0.000004342616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005832934,"about_ca_system_score_gemma":0.0001729122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001402769,"about_ca_topic_score_gemma":0.0001692558,"domain_scores_codex":[0.9977873,0.0000946786,0.0007421205,0.000285067,0.0006562651,0.0004345689],"domain_scores_gemma":[0.9987205,0.0001002837,0.0004716283,0.000354629,0.000215157,0.0001378341],"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.0002152239,0.002953044,0.0571897,0.0002885883,0.0005925623,0.005492561,0.004454071,0.02370062,0.002256349,0.5629753,0.007596244,0.3322857],"study_design_scores_gemma":[0.01129918,0.004463645,0.08445729,0.001509035,0.000105597,0.008471521,0.0007219636,0.1257442,0.002958209,0.7396493,0.01845505,0.002165079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0446457,0.001232481,0.9454012,0.002507847,0.0007115917,0.0003567157,0.00002523417,0.00008651655,0.005032735],"genre_scores_gemma":[0.738214,0.00008312271,0.2611392,0.0001687762,0.0002508791,0.000009045893,0.000003942929,0.00002178131,0.0001092485],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6935683,"threshold_uncertainty_score":0.6946684,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001529313,0.0004495977,0.0007029092,0.0003763791,0.0004672238,0.0005037686,0.003270368,0.0001529218,0.00004782117],"category_scores_gemma":[0.0003447177,0.0003535338,0.0005087175,0.000557401,0.0001146918,0.002822591,0.0009752303,0.0006295614,0.00002120804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001811292,"about_ca_system_score_gemma":0.0003332343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003299988,"about_ca_topic_score_gemma":0.00001564058,"domain_scores_codex":[0.9960587,0.0001272298,0.001278236,0.0005992906,0.001062137,0.0008743795],"domain_scores_gemma":[0.9961445,0.0003615006,0.00105596,0.001232861,0.0005445653,0.0006606479],"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.00003272903,0.0001745269,0.00002719195,0.00001964138,0.0001032205,0.0001124202,0.0003721357,0.0003180068,0.0002842608,0.001234826,0.01590019,0.9814209],"study_design_scores_gemma":[0.004619346,0.0007549371,0.0001993441,0.0003556579,0.00009636963,0.0008272882,0.0001355888,0.909557,0.001806571,0.0119943,0.06894996,0.0007035672],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001306102,0.002400312,0.9913648,0.002403541,0.001508461,0.0003127824,0.0001952637,0.0001117923,0.0003968928],"genre_scores_gemma":[0.00381443,0.0002210793,0.9910243,0.0006596695,0.003648366,0.00001868509,0.00002472903,0.00005590096,0.0005328074],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9807173,"threshold_uncertainty_score":0.9998916,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007078011,0.0001360367,0.0001986118,0.000604871,0.0001142382,0.0001418327,0.0004345214,0.00005274223,0.0000321372],"category_scores_gemma":[0.0001313578,0.0001078675,0.0001297164,0.000858894,0.00002220642,0.001073825,0.0000714104,0.0002363641,0.00004265042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008827564,"about_ca_system_score_gemma":0.00008839618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004563022,"about_ca_topic_score_gemma":7.159062e-7,"domain_scores_codex":[0.9984143,0.0000722256,0.0003866242,0.0001313405,0.0006772455,0.0003182461],"domain_scores_gemma":[0.9988422,0.0002092729,0.0003436652,0.0001961118,0.0001606857,0.0002480442],"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.0001627418,0.0008667367,0.002235415,0.00004109009,0.0004845385,0.0001408335,0.001246506,0.02944712,0.001065994,0.1756121,0.02662048,0.7620764],"study_design_scores_gemma":[0.01629204,0.01252567,0.3386947,0.0006078226,0.000501638,0.006131927,0.0009551854,0.3743638,0.03880829,0.08693483,0.1197636,0.004420531],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06123149,0.001041391,0.9332241,0.0007699654,0.002033729,0.00007168036,0.000005063052,0.00002381201,0.001598807],"genre_scores_gemma":[0.9162445,0.00003399355,0.08232044,0.000192097,0.0009467897,0.000001270831,0.00000604949,0.000008338894,0.0002465383],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.855013,"threshold_uncertainty_score":0.439871,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005937333,0.0001789097,0.0002805139,0.0001672446,0.0001879111,0.0003667031,0.001199775,0.00006838963,0.00002085802],"category_scores_gemma":[0.00003096367,0.0001171841,0.0001029098,0.0002638229,0.00004367741,0.00179453,0.0002902104,0.0007456287,0.000007053751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002037274,"about_ca_system_score_gemma":0.0001160445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002674853,"about_ca_topic_score_gemma":0.000006928246,"domain_scores_codex":[0.9983671,0.00003263325,0.0004441971,0.0002316628,0.0006118079,0.0003125389],"domain_scores_gemma":[0.9985212,0.0001103536,0.0004681704,0.0004727353,0.0001995635,0.0002279859],"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.0001254693,0.0003292649,0.002643749,0.00007193616,0.000365284,0.0008571276,0.002698148,0.003248363,0.06131335,0.04235822,0.001679268,0.8843098],"study_design_scores_gemma":[0.018498,0.006734442,0.07514045,0.003385138,0.0004904059,0.0209378,0.002552737,0.5005807,0.06991534,0.1264461,0.1691722,0.006146657],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0988916,0.000139653,0.8993094,0.0003998996,0.0009484863,0.0000568346,0.000006339876,0.0000401613,0.000207652],"genre_scores_gemma":[0.281741,0.00002618759,0.7175151,0.00008112905,0.0005847266,0.00000108905,0.000002051517,0.00001575391,0.00003299519],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8781632,"threshold_uncertainty_score":0.477863,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002082499,0.0001375188,0.0002294623,0.00004775936,0.0001118092,0.00005943118,0.00007809279,0.00008396931,0.000008010515],"category_scores_gemma":[0.000112499,0.000111989,0.00007919309,0.00003745479,0.0001218865,0.000006702062,0.0000602661,0.00007245599,5.946046e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001425717,"about_ca_system_score_gemma":0.00003585596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003153122,"about_ca_topic_score_gemma":0.00005203615,"domain_scores_codex":[0.9992248,0.00003250797,0.0003135124,0.0001735978,0.0001013546,0.0001542379],"domain_scores_gemma":[0.9992314,0.00004485478,0.0002495542,0.00009939055,0.0002839409,0.00009084283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001615722,0.00007300777,0.02103397,0.00004581128,0.0004410687,0.000001833984,0.0005057041,0.0000534753,0.5945076,0.00006784104,0.006488107,0.3766201],"study_design_scores_gemma":[0.003841763,0.003976982,0.8202822,0.00005278475,0.0002070148,0.0002490485,0.001492157,0.01242576,0.1318051,0.005652562,0.01935781,0.0006568454],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9786723,0.002860339,0.01672729,0.000506547,0.0006280799,0.0002627622,0.00003767146,0.000001930068,0.0003031399],"genre_scores_gemma":[0.9716006,0.003232618,0.02369796,0.00009130449,0.0007698243,0.00001692499,0.00002560488,0.00001550737,0.0005496569],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7992482,"threshold_uncertainty_score":0.4566779,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008652004,0.0001631761,0.0002420764,0.00009714058,0.0003358502,0.0002602402,0.002127166,0.00005838181,0.00002923419],"category_scores_gemma":[0.0000856403,0.00008698254,0.0001941131,0.000309487,0.00008635016,0.00114919,0.0004221268,0.0003255209,0.00002615189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002742872,"about_ca_system_score_gemma":0.00007948762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003450602,"about_ca_topic_score_gemma":0.000005713297,"domain_scores_codex":[0.998231,0.00009419708,0.0005855868,0.0001945348,0.0005830481,0.000311656],"domain_scores_gemma":[0.9981412,0.0001420824,0.0005486322,0.0007019186,0.0002904903,0.0001756249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009737072,0.0001392561,0.001181812,0.00001728624,0.0002017251,0.000375906,0.001269233,0.00001480696,0.000328625,0.03774372,0.0301254,0.9285049],"study_design_scores_gemma":[0.004526878,0.004105665,0.09617017,0.0009254267,0.0002191834,0.002737698,0.0007476814,0.2362898,0.007631612,0.2129505,0.43188,0.001815357],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001767998,0.004140664,0.9899489,0.0007172442,0.00110363,0.0001126109,0.000008846927,0.00004382965,0.002156308],"genre_scores_gemma":[0.2180987,0.002548003,0.7761949,0.0005788903,0.002037788,0.00001049029,0.000006339054,0.0000595032,0.0004652964],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9266895,"threshold_uncertainty_score":0.3952838,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007642314,0.0001410104,0.0002481172,0.0001538239,0.0001162811,0.0001371815,0.000979159,0.00006464489,0.00004281416],"category_scores_gemma":[0.0000578226,0.00009837921,0.0001448056,0.0002640481,0.00003101792,0.002850922,0.0003232523,0.0002922202,0.00004135022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004604598,"about_ca_system_score_gemma":0.00006697736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008276437,"about_ca_topic_score_gemma":2.218501e-7,"domain_scores_codex":[0.9984004,0.0000677532,0.000438781,0.0001263117,0.0005367069,0.000429976],"domain_scores_gemma":[0.9987,0.00007816092,0.0003715965,0.000370362,0.0001375473,0.0003423185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002878056,0.0003915553,0.004326594,0.00002576497,0.00017042,0.0001365358,0.002243331,0.0001197704,0.002787847,0.01645482,0.02589975,0.9474148],"study_design_scores_gemma":[0.004895277,0.001484298,0.05383761,0.0006469576,0.0001644366,0.006296522,0.0008590096,0.1884532,0.01399049,0.01273364,0.7146239,0.002014646],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005524688,0.003019742,0.9870331,0.0005319021,0.002071898,0.00005127507,0.000004371988,0.00003403355,0.001728995],"genre_scores_gemma":[0.5220187,0.0001971372,0.4750299,0.0004276308,0.002053418,0.000001808209,0.000002855664,0.00002045682,0.000248089],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9454002,"threshold_uncertainty_score":0.4011787,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003871377,0.0001084321,0.0002634647,0.000184455,0.0001421551,0.0001405315,0.0008905581,0.00005270566,0.0009790992],"category_scores_gemma":[0.0005879438,0.00006911154,0.0002267075,0.0003814706,0.000104862,0.0003989671,0.00007964522,0.0002484182,0.000363205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005293764,"about_ca_system_score_gemma":0.00006165825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001913239,"about_ca_topic_score_gemma":0.000002357485,"domain_scores_codex":[0.9972399,0.0002062315,0.0009275855,0.000182705,0.001241556,0.0002019477],"domain_scores_gemma":[0.9979689,0.0005789661,0.0005660478,0.0004366483,0.0002285133,0.0002209959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001120626,0.0002458326,0.0006176457,0.000001727622,0.00008132419,0.000028577,0.001740834,0.001988017,0.0015879,0.01704131,0.07518918,0.9013656],"study_design_scores_gemma":[0.0005232893,0.0001890658,0.003696919,0.00001765297,0.00002935153,0.0001401854,0.001999313,0.002318281,0.001487379,0.05958063,0.9298817,0.0001362662],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3170391,0.002511052,0.4633009,0.08035433,0.00101213,0.0005269457,0.00009568566,0.00007086992,0.135089],"genre_scores_gemma":[0.9772407,0.00001343945,0.01701386,0.0004358249,0.0007775988,0.000002378594,8.530143e-7,0.000009321798,0.004505956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9012293,"threshold_uncertainty_score":0.9999341,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704608,0.0002166982,0.0005034218,0.0003167979,0.0001091032,0.00007732525,0.0009803426,0.0001080001,0.00001462856],"category_scores_gemma":[0.0001144924,0.0001617818,0.0005380221,0.0005424477,0.000124186,0.0002614106,0.0001334213,0.0002794853,0.000002166184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004059516,"about_ca_system_score_gemma":0.000178942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003937966,"about_ca_topic_score_gemma":0.000007412205,"domain_scores_codex":[0.9978786,0.00003910977,0.0008308787,0.0002576876,0.0006307521,0.0003629464],"domain_scores_gemma":[0.9981031,0.0001950749,0.0007081662,0.0004287697,0.0003811656,0.0001837307],"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.001073007,0.007466215,0.006178693,0.005692096,0.004553254,0.001382093,0.0121058,0.05524527,0.01850211,0.150207,0.008080558,0.7295139],"study_design_scores_gemma":[0.02827587,0.01549524,0.2725957,0.01003455,0.001384479,0.002489737,0.0005359518,0.4001037,0.03823236,0.2199709,0.006987042,0.003894434],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05230123,0.003246676,0.9411852,0.001798369,0.001058283,0.0002754209,0.00003528906,0.00002380406,0.00007574162],"genre_scores_gemma":[0.760555,0.0005704805,0.2378503,0.0004104018,0.0005397796,0.0000145778,0.000004975044,0.00002760949,0.00002682307],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7256194,"threshold_uncertainty_score":0.659727,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001336821,0.00009544843,0.0001865277,0.00003544967,0.00005648362,0.00006983573,0.0004179185,0.00005439171,0.00002363994],"category_scores_gemma":[0.00006590241,0.00006697478,0.00007296098,0.0001161769,0.0000876007,0.0006573407,0.00009513786,0.0001906588,0.000001477988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001438035,"about_ca_system_score_gemma":0.00007049488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005161085,"about_ca_topic_score_gemma":6.001929e-7,"domain_scores_codex":[0.9989542,0.0002137758,0.0003322,0.0001418961,0.0002051929,0.000152752],"domain_scores_gemma":[0.9991623,0.00008451677,0.0002337179,0.0002175578,0.0001530442,0.0001488203],"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.00003404365,0.00007375014,0.002141413,0.00001407771,0.00007580574,0.0000622523,0.004958413,7.095967e-7,0.0003977638,0.4958844,0.0003641212,0.4959933],"study_design_scores_gemma":[0.0006634151,0.0004167293,0.02245072,0.00003961962,0.00003218763,0.0003988221,0.00007156155,0.004794446,0.004034993,0.966285,0.000614646,0.0001978369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005721329,0.0007840325,0.9896167,0.0002730578,0.0003369655,0.00005450453,0.000001200305,0.00001137375,0.003200835],"genre_scores_gemma":[0.3334849,0.00009324859,0.666035,0.00020589,0.00011841,6.74694e-7,1.108387e-7,0.000004778416,0.00005699204],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4957955,"threshold_uncertainty_score":0.2731152,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002915062,0.0001022347,0.0001221209,0.00004550691,0.0000319642,0.00001712174,0.0001034721,0.00006607903,0.00002094458],"category_scores_gemma":[0.00004153785,0.00007266916,0.00006936879,0.0000587062,0.00001378662,0.000006071021,0.00002322026,0.00006629589,0.000001942373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000118675,"about_ca_system_score_gemma":0.000023728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001202348,"about_ca_topic_score_gemma":1.051809e-7,"domain_scores_codex":[0.9993445,0.00002739856,0.000188609,0.00007467486,0.000179624,0.0001851391],"domain_scores_gemma":[0.9995092,0.00000809121,0.0001652161,0.000115204,0.00008555468,0.0001167191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001491616,0.0001008982,0.0005177534,0.00002150143,0.0001604794,0.000008424007,0.0001149645,0.5266709,0.4672771,0.00007052028,0.000145083,0.00476324],"study_design_scores_gemma":[0.001199455,0.001324216,0.001049872,0.0001297926,0.0001209348,0.0005212516,0.0001686051,0.04296907,0.9455686,0.000007046727,0.006524134,0.0004170812],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2725827,0.001356744,0.7254356,0.0000704014,0.0002885545,0.00008158822,0.000004249292,0.00000461487,0.000175495],"genre_scores_gemma":[0.8919652,0.00007093244,0.1072104,0.00002962037,0.0006225172,0.000002625406,0.000005912065,0.00002239598,0.00007036339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6193825,"threshold_uncertainty_score":0.2963362,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002016744,0.00009217698,0.0001715409,0.0001469063,0.0001068255,0.000094635,0.0007032935,0.00003402119,0.000002790743],"category_scores_gemma":[0.00005804719,0.0000501892,0.0001527006,0.0007774348,0.00005329942,0.0002991159,0.00008461937,0.0002350566,7.386686e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002446298,"about_ca_system_score_gemma":0.00008939828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001519966,"about_ca_topic_score_gemma":0.00004067541,"domain_scores_codex":[0.9983537,0.0002815475,0.000610318,0.0001273606,0.0004700164,0.0001570223],"domain_scores_gemma":[0.9987181,0.0003787979,0.0004426748,0.0002553807,0.0001787386,0.0000262482],"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.0001707036,0.001415698,0.02071932,0.0001179786,0.0001909493,0.0001879204,0.009331082,0.3563707,0.008683556,0.1513432,0.006756946,0.444712],"study_design_scores_gemma":[0.001249964,0.0005928382,0.277503,0.00006760098,0.0000297559,0.0003666459,0.0005674788,0.3599653,0.004115954,0.3536685,0.001623225,0.0002497515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3250095,0.0003997449,0.6715477,0.002483695,0.000209155,0.0001113153,0.000002770983,0.000005728045,0.0002303939],"genre_scores_gemma":[0.9803519,0.00001010839,0.01914726,0.0002084593,0.0002691719,8.107384e-7,0.00000232383,0.000003142617,0.00000684142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6553424,"threshold_uncertainty_score":0.2046656,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001569397,0.0002990346,0.0005215186,0.0002072885,0.0007021487,0.001599431,0.002025577,0.0001431481,0.0000250336],"category_scores_gemma":[0.0005697858,0.0002235097,0.0001554191,0.0001712164,0.0001863267,0.003465693,0.001044842,0.0005562714,0.0000178019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008932915,"about_ca_system_score_gemma":0.000358887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002156208,"about_ca_topic_score_gemma":0.00001337167,"domain_scores_codex":[0.9972821,0.0001627098,0.0006558573,0.0004679642,0.0008506373,0.0005806785],"domain_scores_gemma":[0.9969097,0.0002235322,0.0008801568,0.001004456,0.0002520574,0.0007301115],"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.0002682064,0.0003628517,0.002773093,0.00007656132,0.0003388594,0.002887154,0.003024006,0.0001987118,0.003229006,0.007062002,0.04410786,0.9356717],"study_design_scores_gemma":[0.008365977,0.00475555,0.0553032,0.001683972,0.0003299242,0.01356167,0.001386249,0.7104862,0.01083965,0.02329032,0.1672375,0.002759739],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01183126,0.0008779765,0.9710934,0.01391018,0.001290191,0.0002040689,0.00002391045,0.00004557865,0.0007234545],"genre_scores_gemma":[0.1052202,0.0008227425,0.8920607,0.0004893059,0.001099834,0.000007173846,0.000002427994,0.0000262608,0.0002713299],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9329119,"threshold_uncertainty_score":0.999437,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008623328,0.0001394525,0.0002462534,0.0004276933,0.00009460871,0.0001710144,0.0004084049,0.00006294846,0.000002980802],"category_scores_gemma":[0.0001171448,0.0001225634,0.000145582,0.0005537171,0.00001523584,0.001150036,0.00003230631,0.0001706545,0.000001688045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001057473,"about_ca_system_score_gemma":0.0001142964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002121627,"about_ca_topic_score_gemma":0.00000218434,"domain_scores_codex":[0.998493,0.00005464198,0.0006128204,0.000206016,0.0003868703,0.0002466715],"domain_scores_gemma":[0.9990505,0.0001126924,0.000346949,0.0001559387,0.0002261931,0.000107709],"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.00003387981,0.0002574108,0.0002009984,0.00001584202,0.00003157972,0.00004656876,0.001338506,0.01683497,0.004543186,0.01396432,0.0008069496,0.9619258],"study_design_scores_gemma":[0.001312226,0.000829789,0.0105521,0.00009486664,0.00001558977,0.0001873154,0.0001000792,0.948279,0.00297667,0.03430701,0.001094347,0.0002510413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009773082,0.000278126,0.9870496,0.001947403,0.0005469098,0.0002072233,0.000005112663,0.00002171397,0.0001708788],"genre_scores_gemma":[0.5746015,0.0000306696,0.4246355,0.000206834,0.0004604847,0.000004963273,0.0000111213,0.000006087585,0.00004285378],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9616747,"threshold_uncertainty_score":0.4997992,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003124892,0.0001066985,0.0001742521,0.00007480649,0.0002142069,0.0003979493,0.001327226,0.00004294551,0.000001927551],"category_scores_gemma":[0.00004727939,0.00004707267,0.0001612087,0.0003454015,0.00004512094,0.0003537317,0.00006444033,0.0003581073,0.000005362179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002227523,"about_ca_system_score_gemma":0.00003564241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000281578,"about_ca_topic_score_gemma":0.00003723539,"domain_scores_codex":[0.998286,0.0003496852,0.0005523345,0.0001230921,0.0004447958,0.0002440666],"domain_scores_gemma":[0.9987648,0.0003472911,0.0003385393,0.0003506533,0.0001429054,0.00005588666],"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.0000681963,0.0003492369,0.003719319,0.00003229287,0.0002753263,0.0002432487,0.01784479,0.01565692,0.0002263847,0.4092397,0.08341188,0.4689327],"study_design_scores_gemma":[0.001170457,0.001329298,0.008129116,0.0002996296,0.00002570196,0.001585975,0.002159174,0.8031752,0.00005047621,0.05263222,0.1290495,0.0003932943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004414072,0.0006817434,0.9810322,0.006804112,0.001767134,0.0001884912,8.901479e-7,0.00001675555,0.005094605],"genre_scores_gemma":[0.9923608,0.0001031922,0.006232187,0.0004114338,0.0007442476,0.00000600338,2.339285e-7,0.000007145076,0.0001347709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9879467,"threshold_uncertainty_score":0.3837434,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008228334,0.0001873462,0.0002854022,0.0001994718,0.0001455392,0.0001599941,0.000999161,0.00007571873,0.000011174],"category_scores_gemma":[0.000138542,0.0001292768,0.000175717,0.0002807213,0.00003960772,0.002009227,0.0002747498,0.0003610614,0.00003351983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000688947,"about_ca_system_score_gemma":0.00006074857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001399332,"about_ca_topic_score_gemma":2.206282e-7,"domain_scores_codex":[0.997919,0.00008339576,0.0005975688,0.0001965343,0.0007775828,0.0004259683],"domain_scores_gemma":[0.99827,0.0001660928,0.0005501012,0.0005447209,0.0001502238,0.0003188269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005402198,0.001188595,0.00144683,0.000068851,0.0003760743,0.0006776981,0.01035928,0.001809082,0.003450575,0.02096699,0.1238718,0.835244],"study_design_scores_gemma":[0.01220967,0.005272066,0.1048437,0.002309351,0.00017841,0.003703531,0.002252732,0.2566292,0.01456032,0.006816317,0.588365,0.002859666],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02584117,0.002705744,0.9569179,0.004142503,0.004969464,0.0001968253,0.00007732669,0.0001114254,0.005037618],"genre_scores_gemma":[0.7248549,0.0002443364,0.2703121,0.0008902716,0.003301485,0.00000324594,0.00001308827,0.0000323325,0.0003482164],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8323843,"threshold_uncertainty_score":0.5271757,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007478328,0.0002064152,0.0002871028,0.000146379,0.0004461165,0.0003087034,0.001640495,0.00007591378,0.00000549805],"category_scores_gemma":[0.00004735962,0.0001124824,0.0001998673,0.0003466961,0.0001549259,0.000691239,0.0002652247,0.0003066513,0.000002793416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003257986,"about_ca_system_score_gemma":0.0001130663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001004505,"about_ca_topic_score_gemma":0.000005532242,"domain_scores_codex":[0.9982228,0.00008724495,0.0004555813,0.0002774958,0.0005724353,0.000384493],"domain_scores_gemma":[0.9979424,0.0004437153,0.0005194944,0.0005353508,0.0003262197,0.0002328452],"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.00318639,0.0008214459,0.001789783,0.0001297378,0.001165714,0.0005181902,0.001731683,0.002947123,0.0034061,0.1969397,0.04171513,0.745649],"study_design_scores_gemma":[0.007407724,0.007000153,0.009629517,0.0003842622,0.0001437082,0.0005316672,0.0004531881,0.5637683,0.001514133,0.02232191,0.3858919,0.0009534886],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01198353,0.0004121298,0.9823497,0.003510324,0.0007097916,0.0001931643,0.00001386992,0.00003521894,0.0007922966],"genre_scores_gemma":[0.4482381,0.0007403524,0.5482251,0.0003270725,0.001915229,0.00001165673,0.0000125874,0.00005558278,0.0004743003],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7446955,"threshold_uncertainty_score":0.4586898,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003709233,0.0001315588,0.0002143818,0.0004451328,0.000191309,0.00008304257,0.0003088881,0.00005074178,0.00001604297],"category_scores_gemma":[0.00003824966,0.00009370355,0.000101397,0.001443331,0.00003399995,0.0008617226,0.00005425498,0.0002166828,0.000005323465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004770035,"about_ca_system_score_gemma":0.0002153284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000158471,"about_ca_topic_score_gemma":0.000001243436,"domain_scores_codex":[0.9984754,0.00006139195,0.0004403872,0.0001715887,0.0006530933,0.0001981671],"domain_scores_gemma":[0.9986768,0.0001139483,0.0004363709,0.0001630899,0.0004581494,0.0001516247],"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.0003006563,0.0005045652,0.01269867,0.00002871795,0.0005397906,0.001730059,0.001110461,0.7098727,0.001081351,0.02986966,0.009875281,0.2323881],"study_design_scores_gemma":[0.003227482,0.002277224,0.07508089,0.000131216,0.0000770898,0.009454312,0.00005443232,0.8920151,0.002295952,0.002895648,0.01177,0.0007206682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03230384,0.001019751,0.9646767,0.0008322446,0.0004748486,0.00007120743,0.000001429147,0.00002163565,0.0005982802],"genre_scores_gemma":[0.8797886,0.0001907469,0.1192287,0.000135394,0.0005223758,0.000001553907,0.000004760668,0.000007703171,0.0001202288],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8474847,"threshold_uncertainty_score":0.382112,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007241864,0.0001081439,0.0001823552,0.0001264943,0.0001249814,0.0001363017,0.0003328132,0.00004267953,0.00002079695],"category_scores_gemma":[0.00008564784,0.00008797437,0.0001243327,0.0003253825,0.00001919535,0.001239601,0.00009083226,0.0001646995,0.00001774718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004006153,"about_ca_system_score_gemma":0.00007272863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003415601,"about_ca_topic_score_gemma":6.671187e-7,"domain_scores_codex":[0.9987239,0.00008371288,0.0004082368,0.0001044989,0.0004162166,0.000263452],"domain_scores_gemma":[0.999001,0.0001050272,0.0003260137,0.0001619563,0.0002004488,0.0002055173],"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.0000272879,0.0004818171,0.007408374,0.00004528451,0.0003168432,0.00008632905,0.004006429,0.03844609,0.02067535,0.04176465,0.02423437,0.8625072],"study_design_scores_gemma":[0.00191218,0.0008071746,0.01697777,0.00006421154,0.00007979416,0.001177783,0.0002416495,0.8559885,0.02012996,0.01344117,0.08838681,0.0007929825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06422093,0.001684885,0.9317791,0.0006025831,0.001390542,0.0000529607,0.000002339596,0.00002046449,0.0002462296],"genre_scores_gemma":[0.8179683,0.00003884786,0.1794946,0.0003327194,0.002040616,0.0000018406,0.00000575777,0.000007612136,0.0001097397],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8617142,"threshold_uncertainty_score":0.3587491,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004764712,0.0001428996,0.0002447923,0.0002223886,0.0001401867,0.0002941105,0.001211072,0.00003900142,0.00003818516],"category_scores_gemma":[0.0000770127,0.00009031001,0.00009583266,0.0005238179,0.0000979051,0.002658383,0.0002544632,0.0003549969,0.00005390793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004991415,"about_ca_system_score_gemma":0.00005915792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001511962,"about_ca_topic_score_gemma":0.000001502383,"domain_scores_codex":[0.9982145,0.0001049829,0.0003511468,0.0002000038,0.0007547794,0.0003745595],"domain_scores_gemma":[0.9985406,0.0002074098,0.0002938652,0.0003689838,0.0003355562,0.0002536192],"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.0002189732,0.0004257947,0.01457366,0.0001060925,0.0005649693,0.0007244503,0.003507639,0.00410825,0.0259004,0.02218567,0.001550569,0.9261335],"study_design_scores_gemma":[0.01213215,0.01582551,0.2535386,0.001932314,0.0001645102,0.002423941,0.002477516,0.3483217,0.07536791,0.2676482,0.017218,0.002949619],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2863914,0.0005336758,0.7105642,0.001353848,0.0002683536,0.0001817718,7.951908e-7,0.00003772324,0.0006682464],"genre_scores_gemma":[0.8705376,0.00008642358,0.1289823,0.00008024536,0.0001168838,0.00000732314,2.564506e-7,0.00001510905,0.0001738799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9231839,"threshold_uncertainty_score":0.3682735,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001024405,0.00009225773,0.0002084782,0.00005716336,0.0002539854,0.0001491271,0.001021557,0.00003016421,0.000005689036],"category_scores_gemma":[0.0001160776,0.00005446748,0.0001224916,0.0001808171,0.0001739252,0.0006286687,0.0002644985,0.0002024072,0.000003031739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001844774,"about_ca_system_score_gemma":0.00004525777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001894451,"about_ca_topic_score_gemma":0.000002923019,"domain_scores_codex":[0.9985894,0.0001207271,0.000516252,0.0001130124,0.0004673912,0.000193212],"domain_scores_gemma":[0.9984915,0.0002049661,0.0006021792,0.0003834713,0.0002197771,0.00009807738],"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.00004295091,0.0001212599,0.0009660709,0.0000339602,0.000138218,0.00002059058,0.0006577898,0.001363093,0.001912085,0.3791692,0.004111864,0.6114629],"study_design_scores_gemma":[0.001596937,0.0009463616,0.02079756,0.0003837578,0.00004388668,0.0002418635,0.0002469141,0.7555674,0.01151866,0.1615234,0.04675028,0.0003829125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004824268,0.0003790047,0.992623,0.001037129,0.000586806,0.00003994213,0.0000044366,0.00001347195,0.0004918864],"genre_scores_gemma":[0.7969211,0.0001151347,0.2024664,0.000056506,0.0003925252,0.000001047055,0.000001546387,0.000007455174,0.00003835042],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7920968,"threshold_uncertainty_score":0.222112,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004608349,0.0001298205,0.0002110382,0.0001025084,0.00008272307,0.0001283107,0.0004986039,0.00005305821,0.00003709546],"category_scores_gemma":[0.00005529296,0.00008920331,0.00006559188,0.0001800621,0.00006182904,0.001176281,0.0001802679,0.0002023009,0.000005042396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001783541,"about_ca_system_score_gemma":0.00004749183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001267298,"about_ca_topic_score_gemma":5.669959e-7,"domain_scores_codex":[0.9989598,0.00005937862,0.0002902506,0.000113105,0.0002953983,0.0002820921],"domain_scores_gemma":[0.9990754,0.00007698145,0.000239524,0.0002353194,0.00008621712,0.0002865493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001307175,0.0003327079,0.01500828,0.0001326583,0.0006469358,0.0003616027,0.01402614,0.0001094548,0.007398203,0.1504415,0.02624662,0.7851652],"study_design_scores_gemma":[0.0100456,0.00228288,0.5909029,0.0004978566,0.0003969978,0.01917175,0.003482374,0.07578347,0.02496564,0.1475618,0.1216397,0.003269046],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4995738,0.01678923,0.475959,0.002033303,0.003541441,0.0001841981,0.00002640768,0.0001158806,0.001776732],"genre_scores_gemma":[0.9158961,0.0001421201,0.08264777,0.0004639335,0.0007258674,7.539564e-7,0.000002003048,0.00001299439,0.0001084416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7818962,"threshold_uncertainty_score":0.3637606,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009018903,0.0001454989,0.0003567009,0.0002576545,0.0001066518,0.00008719729,0.0005891116,0.00007269155,0.00001715875],"category_scores_gemma":[0.000143991,0.0001135712,0.0002297321,0.0003851994,0.00007063583,0.0005277884,0.0001069118,0.0002268792,0.00000551666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002704214,"about_ca_system_score_gemma":0.00007554218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005062351,"about_ca_topic_score_gemma":5.298821e-7,"domain_scores_codex":[0.9982101,0.0001371432,0.0006700352,0.0001980675,0.0005606373,0.0002239989],"domain_scores_gemma":[0.9984517,0.0002759769,0.0006228954,0.0001974783,0.0003032695,0.0001486689],"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.0002135721,0.0006420994,0.004161666,0.0001777322,0.0006380939,0.0001714425,0.004368988,0.06858187,0.01199842,0.2436484,0.02583487,0.6395628],"study_design_scores_gemma":[0.002642586,0.003111756,0.018481,0.000281365,0.000097311,0.0008953534,0.0002208442,0.8525538,0.01478147,0.06230526,0.04387863,0.0007505933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04900512,0.0005629567,0.9477185,0.001329854,0.0006831663,0.00006035696,0.00000263692,0.00002503548,0.0006123647],"genre_scores_gemma":[0.729897,0.00005190825,0.2690875,0.0003589623,0.0004937852,5.126125e-7,0.000003116497,0.000006926566,0.0001003014],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.783972,"threshold_uncertainty_score":0.4631299,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392724,0.0001812732,0.0003577073,0.000194014,0.00008656254,0.0001248033,0.001761891,0.00005825765,0.00001841153],"category_scores_gemma":[0.0001762924,0.0001033702,0.0002643501,0.0005599621,0.0001541462,0.0005086352,0.0002358331,0.0003836507,0.00001236535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004155469,"about_ca_system_score_gemma":0.0001677612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001641097,"about_ca_topic_score_gemma":0.000006491017,"domain_scores_codex":[0.9977619,0.0001703008,0.0006336177,0.0001870927,0.000982573,0.0002645297],"domain_scores_gemma":[0.997887,0.0002185448,0.0006255467,0.0005722647,0.0004947284,0.0002018991],"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.000378258,0.001460094,0.000436388,0.000133951,0.0009195708,0.0003450185,0.01127263,0.005827904,0.003164018,0.5105132,0.08468693,0.380862],"study_design_scores_gemma":[0.006695556,0.01026235,0.002655723,0.001057622,0.0001672233,0.001596624,0.001757588,0.2993971,0.008473244,0.6184933,0.04815311,0.001290584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03318045,0.001250754,0.9444712,0.01037123,0.003594713,0.0003504189,0.00002120845,0.00005521369,0.006704769],"genre_scores_gemma":[0.8159813,0.000125185,0.1807225,0.000854295,0.001139374,0.00001470656,0.000002760859,0.00004869772,0.001111188],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7828009,"threshold_uncertainty_score":0.4215316,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007321351,0.0001419767,0.0002238183,0.0001458942,0.0001518924,0.00009276187,0.0008208423,0.00006029901,0.00005694218],"category_scores_gemma":[0.0001022665,0.00009081064,0.000379511,0.0003665698,0.00009740494,0.0006357999,0.00005294495,0.0002217486,0.00000929164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003170098,"about_ca_system_score_gemma":0.00009052817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005566016,"about_ca_topic_score_gemma":0.000008686075,"domain_scores_codex":[0.9985709,0.0000827984,0.0005032175,0.0001681623,0.0004650742,0.0002099133],"domain_scores_gemma":[0.9983077,0.0004179197,0.000484509,0.0004225325,0.0002674622,0.00009987788],"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.0001698415,0.0005988022,0.0003941676,0.00003646198,0.0001711764,0.000006117071,0.001109024,0.0004412286,0.002991079,0.7627799,0.005712715,0.2255895],"study_design_scores_gemma":[0.0106103,0.003819338,0.008211544,0.0008908488,0.0003924381,0.0002734319,0.0009409121,0.4349745,0.08750635,0.2673552,0.1835053,0.001519787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04922596,0.0001664512,0.9465784,0.003013915,0.0002436527,0.0001706316,0.00006043454,0.00001892925,0.0005216448],"genre_scores_gemma":[0.6894718,0.0000512746,0.309775,0.0003242794,0.0003434455,0.000008904692,0.000007583394,0.000009216006,0.000008474375],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6402459,"threshold_uncertainty_score":0.3703151,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005439188,0.00009058498,0.0001551822,0.0001644282,0.00006274851,0.00009835425,0.0003851848,0.00003740278,0.00000307923],"category_scores_gemma":[0.00007370979,0.00007323915,0.0001124687,0.0002222397,0.00001863921,0.0007784843,0.00004738144,0.00009280223,0.000005779681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006254288,"about_ca_system_score_gemma":0.0002268065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007240997,"about_ca_topic_score_gemma":0.00001150914,"domain_scores_codex":[0.9990504,0.0000329208,0.0002748475,0.0001246939,0.0003702725,0.0001467984],"domain_scores_gemma":[0.9989436,0.00009342667,0.0002382569,0.0001325255,0.0004087745,0.0001834035],"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.0005481049,0.0004734846,0.001170527,0.00005273854,0.0006680196,0.0004162371,0.004867114,0.09708811,0.002287758,0.1789442,0.1668379,0.5466458],"study_design_scores_gemma":[0.003760137,0.002152194,0.003212864,0.00005990648,0.00005810522,0.0005647021,0.0003641617,0.7760848,0.001899351,0.1785043,0.03294464,0.0003948714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006637776,0.0003522932,0.9886947,0.003008825,0.0009035089,0.00008676933,0.000009793687,0.00001701478,0.0002893776],"genre_scores_gemma":[0.321449,0.00001879044,0.6770896,0.0002867059,0.0008819538,0.000002563496,0.00001398811,0.00001152372,0.000245854],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6789967,"threshold_uncertainty_score":0.2986606,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005298686,0.0001889611,0.0002130433,0.00005479904,0.0001442673,0.0000734199,0.0004288302,0.0001028464,0.00001692289],"category_scores_gemma":[0.00005633074,0.000120158,0.000372352,0.0001016154,0.0001074715,0.00001065664,0.00008525675,0.0001529785,0.000006475509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004484107,"about_ca_system_score_gemma":0.0001776494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001383053,"about_ca_topic_score_gemma":0.00001291948,"domain_scores_codex":[0.99874,0.00002668914,0.000429743,0.0001992098,0.0002826342,0.0003216872],"domain_scores_gemma":[0.9989434,0.00002378716,0.0003312593,0.0003010726,0.0002871538,0.000113329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001087891,0.0007448168,0.0003426223,0.0001424776,0.002768636,0.0000938728,0.0007733999,0.007109355,0.8863031,0.0006795576,0.01269551,0.08725877],"study_design_scores_gemma":[0.0176164,0.01159391,0.006066201,0.0002462436,0.0009750088,0.001938666,0.001361853,0.0007605017,0.2092155,0.01867312,0.7300154,0.001537232],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.311398,0.01763571,0.6558877,0.008717527,0.002695619,0.0021664,0.0001783494,0.00002446243,0.001296182],"genre_scores_gemma":[0.8803204,0.001521096,0.1117557,0.000743028,0.004116965,0.00008081549,0.00004504334,0.0001152607,0.001301739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7173198,"threshold_uncertainty_score":0.4899902,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001088251,0.00008848252,0.0001348888,0.000188439,0.00005864526,0.0001005325,0.0004938393,0.00003064065,0.00000872343],"category_scores_gemma":[0.00006558034,0.00005698792,0.00007609415,0.0004282326,0.00001730302,0.0006692137,0.00005258753,0.00019821,0.00001014322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002406145,"about_ca_system_score_gemma":0.0000399745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006055895,"about_ca_topic_score_gemma":0.000003009846,"domain_scores_codex":[0.9987789,0.000131692,0.000360575,0.00008353927,0.0004269517,0.0002183558],"domain_scores_gemma":[0.9992827,0.0001983611,0.0002185227,0.0001537545,0.00006494893,0.00008173066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001131338,0.001033743,0.01683768,0.00006373827,0.0002128136,0.0004898148,0.03575942,0.02466741,0.007264788,0.05912881,0.02291801,0.8315107],"study_design_scores_gemma":[0.004498749,0.001829691,0.6040669,0.0002923951,0.0001152272,0.004618115,0.00230684,0.2880776,0.004305057,0.0201165,0.068731,0.00104197],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2465991,0.002841013,0.7402255,0.005647824,0.001863722,0.0001490114,0.000002511214,0.00001749036,0.002653848],"genre_scores_gemma":[0.9538146,0.00002446044,0.04487934,0.0003309521,0.0008668284,0.000001375406,0.000002301712,0.000004094628,0.00007606379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8304687,"threshold_uncertainty_score":0.23239,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001547676,0.00014925,0.000387919,0.0004914575,0.00009937141,0.0000492498,0.001306785,0.00006159324,0.00002868035],"category_scores_gemma":[0.0002676074,0.0001134464,0.0002853093,0.001146547,0.0001438801,0.001736368,0.0003173272,0.0004027739,0.00001267637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003904931,"about_ca_system_score_gemma":0.000056235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003547122,"about_ca_topic_score_gemma":1.831643e-7,"domain_scores_codex":[0.9977504,0.0001861986,0.0006448328,0.0001505143,0.0007852712,0.0004827944],"domain_scores_gemma":[0.9978638,0.0003141065,0.0005965376,0.0004934131,0.000368068,0.0003640507],"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.0003703973,0.001436584,0.05239205,0.0002602314,0.001006245,0.0002330651,0.005287776,0.0003759416,0.06877171,0.6750771,0.00461365,0.1901753],"study_design_scores_gemma":[0.0101034,0.007070993,0.2762265,0.001954212,0.000421134,0.003008717,0.00188172,0.0136338,0.1712543,0.4388456,0.07265858,0.002941111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1409662,0.004480679,0.8505506,0.0008806826,0.000617844,0.0002412618,0.00001579951,0.00004687144,0.002200071],"genre_scores_gemma":[0.9000463,0.0003652693,0.09924036,0.00005865681,0.0001588368,0.000002425385,8.82109e-7,0.00001544213,0.000111765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7590802,"threshold_uncertainty_score":0.4626209,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003588916,0.0007187771,0.000444773,0.0006712505,0.001279066,0.001671548,0.00194736,0.001378639,0.1254686],"category_scores_gemma":[0.0007921825,0.001216485,0.001657496,0.001110555,0.001167699,0.003082277,0.001453715,0.001452242,0.0003899079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001582717,"about_ca_system_score_gemma":0.001069647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000823155,"about_ca_topic_score_gemma":0.0003147282,"domain_scores_codex":[0.9920916,0.0005763043,0.002125989,0.001091516,0.002245927,0.001868687],"domain_scores_gemma":[0.9925372,0.001430631,0.003175974,0.001583582,0.0002005616,0.001072032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00223379,0.0004816898,0.0001148728,0.0008387512,0.002246765,0.000756134,0.005841002,0.0008689479,0.006385208,0.8777435,0.09299895,0.009490365],"study_design_scores_gemma":[0.002990435,0.002685714,0.0005992823,0.001574495,0.001493579,0.002558395,0.001693198,0.08677646,0.8959108,0.0003906809,0.001956357,0.001370621],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.787428,0.004059608,0.01056052,0.0006771387,0.004113636,0.00004369491,0.0002877717,0.0001143137,0.1927153],"genre_scores_gemma":[0.9843287,0.001473463,0.01026217,0.0008677859,0.002280815,0.0001479656,0.0001981792,0.0003351452,0.0001057736],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8895256,"threshold_uncertainty_score":0.9999178,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006017981,0.0001863891,0.0003549422,0.0003054366,0.0003543066,0.0006311904,0.0009097132,0.00009397744,0.000005299953],"category_scores_gemma":[0.00011155,0.0001364321,0.00005245534,0.000264566,0.0001876882,0.001870263,0.0006019782,0.0003543794,7.939562e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001875765,"about_ca_system_score_gemma":0.00007284461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000105944,"about_ca_topic_score_gemma":0.000064838,"domain_scores_codex":[0.9985347,0.0000939637,0.0004335998,0.0002967291,0.0003666765,0.0002743064],"domain_scores_gemma":[0.998478,0.00008163437,0.0005618497,0.0005257378,0.0001534319,0.0001993661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0005994138,0.0006781496,0.1279002,0.0002032697,0.0003586981,0.0026782,0.004525774,0.0002092166,0.01101855,0.004346031,0.006186055,0.8412965],"study_design_scores_gemma":[0.005425942,0.001568141,0.6041203,0.0008835257,0.00005539647,0.0009178726,0.0002871374,0.3674706,0.0006853658,0.01043059,0.007418581,0.0007366259],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8351896,0.006627651,0.1517338,0.004313392,0.001134833,0.0002826229,0.0000309952,0.00004990936,0.0006372003],"genre_scores_gemma":[0.8585479,0.00250689,0.1385198,0.0001193769,0.0002020989,0.000003774055,0.000002856714,0.00001690115,0.00008043555],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8405598,"threshold_uncertainty_score":0.6086584,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003587069,0.0001464209,0.0002469476,0.0001056185,0.00004338328,0.00002089191,0.0003094803,0.0001498003,0.0001566087],"category_scores_gemma":[0.00004678601,0.0001177445,0.0001526215,0.00006191024,0.00004077463,0.00001209316,0.00006696303,0.0001578757,0.000008603292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001692307,"about_ca_system_score_gemma":0.00005472654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000393055,"about_ca_topic_score_gemma":0.000006623849,"domain_scores_codex":[0.9989606,0.00009832161,0.0004038292,0.000145175,0.0001710716,0.0002210728],"domain_scores_gemma":[0.9993771,0.00001267313,0.0002899418,0.0001798694,0.00004279255,0.00009765456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003087817,0.00004304961,0.0007804629,0.000008519269,0.00007878917,0.0000637554,0.0002156758,0.00001224861,0.9773333,0.00003852631,0.0009764842,0.02014042],"study_design_scores_gemma":[0.0008091975,0.000736483,0.005001347,0.00004526386,0.00002936042,0.0001751102,0.0001057748,0.00006171846,0.9893616,0.001264823,0.00218508,0.0002241867],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9943452,0.0008626438,0.001624095,0.00007856989,0.0003696284,0.0001060261,0.00001190764,0.000003910455,0.002597947],"genre_scores_gemma":[0.9868852,0.000107368,0.01214967,0.00008099978,0.0004938183,0.000002109825,0.000005863332,0.00002258695,0.0002523123],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01991623,"threshold_uncertainty_score":0.4801483,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006636123,0.0002083774,0.0003555304,0.0002415416,0.0001543527,0.0003862928,0.001559733,0.00009207362,0.00001080484],"category_scores_gemma":[0.00006829447,0.000158886,0.0001547261,0.0002565606,0.00004010073,0.002826981,0.0004304974,0.0004110188,0.000007732462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003470401,"about_ca_system_score_gemma":0.00005948652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009845124,"about_ca_topic_score_gemma":0.000006057985,"domain_scores_codex":[0.9979982,0.0001607431,0.0005984233,0.0003154027,0.0006049935,0.0003221862],"domain_scores_gemma":[0.9982219,0.0001227288,0.0005564206,0.0006583022,0.0001259076,0.0003147914],"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.00003139823,0.0001420553,0.002089847,0.00001280467,0.0000933896,0.0001252288,0.001098865,0.0006465303,0.00338731,0.0021993,0.0003101431,0.9898632],"study_design_scores_gemma":[0.003025714,0.001807634,0.04454986,0.0005778429,0.00008270115,0.0003188811,0.0001867399,0.865216,0.01048487,0.05961667,0.01316315,0.0009699589],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1388087,0.0002195974,0.8597702,0.000122872,0.0007703547,0.00005383942,0.00001117552,0.0000495805,0.0001937056],"genre_scores_gemma":[0.7077231,0.00005650348,0.2912641,0.0001284776,0.0007766048,0.000001987107,0.000007325807,0.0000192568,0.00002253446],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9888932,"threshold_uncertainty_score":0.6479185,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007169608,0.000175892,0.0003024044,0.0001607811,0.0001928163,0.0002003702,0.0008603407,0.00009585232,0.00001515766],"category_scores_gemma":[0.0001630928,0.0001376841,0.0002110037,0.000215124,0.00003953458,0.002039218,0.0002562929,0.0003055337,0.000007914488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005129328,"about_ca_system_score_gemma":0.0001020275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000254645,"about_ca_topic_score_gemma":7.54528e-8,"domain_scores_codex":[0.9982243,0.00004681047,0.0005646748,0.0001793757,0.0005445332,0.0004403694],"domain_scores_gemma":[0.9981599,0.0004655558,0.0005679344,0.0002587192,0.0002511769,0.0002967237],"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.0001447627,0.000525179,0.004717399,0.00009090997,0.000316117,0.00007555553,0.004105244,0.004321357,0.0003284157,0.1302678,0.006484213,0.848623],"study_design_scores_gemma":[0.00264956,0.001331887,0.01722072,0.0005599849,0.0001001603,0.001127883,0.0003310275,0.8256595,0.00125624,0.1201757,0.02870944,0.0008779303],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00623041,0.0006178223,0.9912537,0.0003862252,0.00128004,0.0001107997,0.00002387931,0.00003041227,0.0000666526],"genre_scores_gemma":[0.2030036,0.00001473922,0.7957119,0.0001692542,0.001060621,0.000004629484,0.000005428158,0.00001352713,0.00001636689],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8477451,"threshold_uncertainty_score":0.5614592,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003925459,0.00009815051,0.0002002217,0.0002421668,0.00004297455,0.00002607751,0.0004004135,0.00003960344,0.00007786779],"category_scores_gemma":[0.00004425363,0.00007770034,0.0001798436,0.0003865297,0.00003809987,0.0007001752,0.00007567522,0.000125969,0.00000796193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002448963,"about_ca_system_score_gemma":0.0001227561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009701832,"about_ca_topic_score_gemma":9.983593e-7,"domain_scores_codex":[0.9988177,0.00006771449,0.0004632377,0.0001236198,0.0003903381,0.000137395],"domain_scores_gemma":[0.9987469,0.00006281694,0.0005079884,0.0001480878,0.0004229214,0.0001113075],"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.0003694865,0.001193473,0.0009024793,0.0001042281,0.001341035,0.0006221485,0.01624584,0.001975263,0.01051624,0.1255783,0.03042416,0.8107273],"study_design_scores_gemma":[0.006902484,0.006907589,0.1157036,0.0006117789,0.000315801,0.002921641,0.001291513,0.3777013,0.2435567,0.2308034,0.01164118,0.00164302],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03251408,0.000383065,0.9631753,0.0004972436,0.0007919101,0.00007313236,0.0000165146,0.00001638262,0.002532352],"genre_scores_gemma":[0.6562905,0.00004109813,0.3433233,0.00008942444,0.0001524573,9.47428e-7,0.000003899584,0.000005844155,0.00009254603],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8090843,"threshold_uncertainty_score":0.3168528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}