{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":232,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":232,"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":"29abced35583","filters":{"venue":"Algorithmica"}},"results":[{"id":"W2118877434","doi":"10.1007/s00453-001-0003-0","title":"Optimal Search and One-Way Trading Online Algorithms","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":210,"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":"Competitive analysis; Portfolio; Stochastic game; Computer science; Online algorithm; Adversary; Mathematical economics; Economics; Algorithm; Mathematics; Upper and lower bounds; Financial economics","retraction":null,"screen_n_in":null,"score":{"opus":0.04645055543326879,"gpt":0.2911219949819577,"spread":0.2446714395486889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003500203,0.0001513922,0.0001809716,0.0001743977,0.0002088471,0.0002659691,0.0005877695,0.00007598136,0.00008996327],"category_scores_gemma":[0.00002437209,0.0001491455,0.00004445227,0.0005478697,0.00008969039,0.0005555513,0.0002861823,0.0002639029,0.00004352499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000367681,"about_ca_system_score_gemma":0.00007451346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005342602,"about_ca_topic_score_gemma":0.000005581212,"domain_scores_codex":[0.9983335,0.0000851215,0.0002297956,0.0004737741,0.000398934,0.0004788456],"domain_scores_gemma":[0.9991356,0.00008460279,0.00002961684,0.0003746926,0.0001088806,0.0002666794],"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.000007227974,0.0003524673,0.0002138123,0.00001706166,0.00005109585,0.0001019976,0.001388629,0.002372984,0.0003997603,0.01928258,0.0005824047,0.97523],"study_design_scores_gemma":[0.0005018801,0.0001347336,0.0005494249,0.00001702453,0.000003794453,0.0001024155,0.00006260281,0.991249,0.000400704,0.0007511341,0.006017497,0.0002097378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01267927,0.0002509615,0.9798263,0.004266843,0.0001512213,0.0002256027,0.000008274761,0.0002585572,0.002333018],"genre_scores_gemma":[0.07194244,0.0004101708,0.9255467,0.0005331247,0.0002128014,0.00001149897,0.00001859241,0.00002155348,0.001303108],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.988876,"threshold_uncertainty_score":0.6081978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988889787","doi":"10.1007/s00453-006-0074-2","title":"Deterministic Rendezvous in Graphs","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":179,"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":"Rendezvous; Computer science; Theory of computation; Time complexity; Binary logarithm; Graph; Identifier; Upper and lower bounds; Node (physics); Combinatorics; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.00716953051749322,"gpt":0.2238464719368621,"spread":0.2166769414193689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000134392,0.00007182709,0.00008487681,0.000151036,0.00004614204,0.00008710234,0.0004081403,0.00003635084,0.00001850493],"category_scores_gemma":[0.00001428557,0.00006976389,0.00002800708,0.0004634054,0.00002965178,0.0001761277,0.00008781982,0.0000888118,0.0000709498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000213945,"about_ca_system_score_gemma":0.00003649059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001114815,"about_ca_topic_score_gemma":0.00003771414,"domain_scores_codex":[0.9991646,0.0000422043,0.0001700152,0.0002267345,0.0001616809,0.0002347376],"domain_scores_gemma":[0.9995816,0.00004516499,0.00002931887,0.00026862,0.0000310801,0.00004417815],"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.000006067278,0.000438616,0.001961668,0.00002365192,0.00001023215,0.0004016608,0.0004658215,0.005350041,0.0005218454,0.6046357,0.007916503,0.3782682],"study_design_scores_gemma":[0.0007011457,0.00008906973,0.006951891,0.00001643918,0.000001743957,0.00003853677,0.00000802106,0.875914,0.0005620472,0.1059462,0.009487852,0.0002830731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003561816,0.0001022876,0.9665577,0.001356371,0.000299405,0.0002207468,0.000002674059,0.0002723639,0.02762657],"genre_scores_gemma":[0.8306001,0.000009849199,0.1677829,0.0002881532,0.00004448798,0.00002257029,0.000006263714,0.000009199559,0.001236453],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.870564,"threshold_uncertainty_score":0.2844889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023419712","doi":"10.1007/s00453-001-0006-x","title":"Right-Triangulated Irregular Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":149,"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":"Terrain; Triangulated irregular network; Computer science; Observer (physics); Field (mathematics); Data structure; Point (geometry); Surface (topology); Visualization; Theory of computation; Space (punctuation); Algorithm; Mathematics; Artificial intelligence; Geometry; Cartography; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.009402726006114312,"gpt":0.250872743596216,"spread":0.2414700175901017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001889101,0.0001390007,0.0001449805,0.0001651032,0.0001379329,0.0001927873,0.0008209142,0.00009196621,0.00004399099],"category_scores_gemma":[0.000006304547,0.0001296522,0.0000826592,0.0009741895,0.00003221883,0.0002781728,0.00023476,0.0001127808,0.00002292514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001869252,"about_ca_system_score_gemma":0.00002166219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002172425,"about_ca_topic_score_gemma":0.000002050939,"domain_scores_codex":[0.9988892,0.00005323047,0.0002214892,0.000357017,0.0001978243,0.0002812202],"domain_scores_gemma":[0.9990848,0.00003846062,0.00006953358,0.0005957016,0.0001063228,0.0001052405],"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.000002907403,0.00009989141,0.0002769696,0.000002521794,0.00003416363,0.0001077438,0.00008252682,0.0000766422,0.00004542257,0.8027382,0.008375235,0.1881577],"study_design_scores_gemma":[0.0001874878,0.0000528257,0.0007927804,0.00001098429,0.000003742392,0.00004762715,0.000001006464,0.8945758,0.000987216,0.02098042,0.08215854,0.0002015179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001116297,0.0002043614,0.9958878,0.0004152076,0.0003722445,0.0001298468,4.986651e-7,0.0008498195,0.001023959],"genre_scores_gemma":[0.8803967,0.0002221032,0.1163997,0.001505009,0.0005469792,0.00003163264,0.00002356663,0.00003458382,0.0008396967],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8944992,"threshold_uncertainty_score":0.5287063,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109924867","doi":"10.1007/s00453-002-0976-3","title":"Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":101,"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; Upper and lower bounds; Mathematics; Binary tree; Binary search tree; Element (criminal law); Binary number; Oracle; Discrete mathematics; Quantum; Sorting; Quantum algorithm; Algorithm; Computer science; Arithmetic; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.02030524396563501,"gpt":0.23947494096838,"spread":0.219169697002745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000281266,0.0002044279,0.0002996941,0.0001277847,0.0002427943,0.0001160254,0.0006749841,0.00004557541,0.00004616318],"category_scores_gemma":[0.00005278935,0.0001785423,0.00006992476,0.0002870761,0.0001966314,0.0001296832,0.0005160327,0.000219075,0.000009172274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000142493,"about_ca_system_score_gemma":0.00001910861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001061219,"about_ca_topic_score_gemma":0.000006276696,"domain_scores_codex":[0.998257,0.00009789943,0.0003987668,0.0004414142,0.0003734072,0.0004314639],"domain_scores_gemma":[0.9989496,0.0001786602,0.0001873891,0.0004730669,0.00008194607,0.0001293795],"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.000006121905,0.000302502,0.0007510797,0.0001561838,0.00009105747,0.00004685494,0.005154868,0.0006112653,0.0005419407,0.2680667,0.001579278,0.7226921],"study_design_scores_gemma":[0.0003740164,0.0001725746,0.001566814,0.00004250085,0.000006501644,0.00005327968,0.00006639417,0.9732636,0.0006947446,0.02116602,0.002359231,0.0002343467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2491688,0.0008443368,0.7431738,0.003511012,0.000445219,0.0003142711,0.00001983101,0.0003633267,0.002159442],"genre_scores_gemma":[0.92298,0.00001546494,0.07660506,0.0001110199,0.0001127322,0.000006590081,0.000003331688,0.00001560659,0.0001502022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9726523,"threshold_uncertainty_score":0.7280741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074982499","doi":"10.1007/s004530010067","title":"Static Frequency Assignment in Cellular Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":90,"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":"Frequency assignment; Theory of computation; Mathematics; Combinatorics; Graph; Vertex (graph theory); Vertex connectivity; Discrete mathematics; Integer (computer science); Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.004934258321494517,"gpt":0.1739740494944223,"spread":0.1690397911729278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001656229,0.0001203779,0.0001418219,0.00007195814,0.0000250796,0.00001793866,0.0001200665,0.0000682613,0.0001362045],"category_scores_gemma":[0.000003520403,0.0001217804,0.00003777547,0.0002326783,0.00001768983,0.00007075986,0.000009642783,0.0001510087,0.00008017796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005640128,"about_ca_system_score_gemma":0.000004574591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002782838,"about_ca_topic_score_gemma":0.000009614278,"domain_scores_codex":[0.9992325,0.00004354401,0.0002124293,0.0001253994,0.00009803713,0.0002880614],"domain_scores_gemma":[0.9996888,0.00003599998,0.00001582223,0.0001889621,0.000007482756,0.00006292728],"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.00003361873,0.000406309,0.01480589,0.0002610974,0.0003719167,0.002128646,0.002784652,0.7258879,0.02335358,0.03369351,0.008119614,0.1881533],"study_design_scores_gemma":[0.001205997,0.0001094009,0.002430158,0.0001710812,0.00003059577,0.00005739021,0.0004811016,0.9473156,0.003648649,0.02673816,0.01693081,0.0008810206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4755813,0.002298828,0.4903247,0.0001215587,0.001828216,0.0005097649,0.000007846699,0.0005683048,0.02875942],"genre_scores_gemma":[0.9991104,0.00005852367,0.0004838658,0.00003721525,0.0001125088,0.00003429942,0.00000818056,0.00002455515,0.0001304548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5235291,"threshold_uncertainty_score":0.4966061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786889022","doi":"10.1007/s00453-005-1168-8","title":"Constructing Plane Spanners of Bounded Degree and Low Weight","year":2005,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":86,"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":"Bounded function; Degree (music); Combinatorics; Mathematics; Plane (geometry); Theory of computation; Spanner; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Binary logarithm; Spanning tree; Point (geometry); Tree (set theory); Discrete mathematics; Geometry; Algorithm; Computer science; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01287707065722272,"gpt":0.2251614993913839,"spread":0.2122844287341611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001119111,0.000067667,0.00009652803,0.00008345611,0.00006107245,0.00004170998,0.000156809,0.00003106908,0.00001175889],"category_scores_gemma":[0.00002023129,0.00006637978,0.00002039816,0.0001908742,0.00004944436,0.0002350592,0.000071063,0.0000535377,0.000008949119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001856205,"about_ca_system_score_gemma":0.00004626284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000826963,"about_ca_topic_score_gemma":0.000008133055,"domain_scores_codex":[0.9993854,0.00002050265,0.0001567109,0.0001787951,0.000142861,0.0001157101],"domain_scores_gemma":[0.9996082,0.0000858317,0.00006886258,0.0001296262,0.00005660929,0.00005090715],"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.000002991749,0.00002312756,0.000204413,0.000009372109,0.00001635296,0.000003046627,0.0001707311,0.0001887821,0.00100393,0.05952656,0.0003387563,0.9385119],"study_design_scores_gemma":[0.001218603,0.0001358205,0.003376977,0.00004520955,0.00001660648,0.0003078603,0.00008976031,0.8647024,0.1078585,0.01036354,0.01149055,0.0003941852],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2539089,0.000300061,0.7404502,0.001715212,0.000345356,0.0001027849,0.00000715969,0.00007187593,0.003098435],"genre_scores_gemma":[0.6990108,0.000007544495,0.3005969,0.0001038542,0.0001606255,0.000001645427,0.000007669005,0.000002770735,0.0001082162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9381177,"threshold_uncertainty_score":0.2706889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020796742","doi":"10.1007/s00453-011-9611-5","title":"Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; École de Technologie Supérieure; Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Asynchronous communication; Robot; Ring (chemistry); Theory of computation; Computer science; Prime (order theory); Combinatorics; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Topology (electrical circuits); Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03405175304668747,"gpt":0.2886569309033074,"spread":0.25460517785662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059992,0.000151727,0.0001673873,0.00008273955,0.0003644186,0.0002398447,0.0008917155,0.00006617344,0.00001446341],"category_scores_gemma":[0.0000490021,0.0001531046,0.00004190999,0.0003528328,0.00005114435,0.001413827,0.0005065817,0.0002414075,0.0001421429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007262125,"about_ca_system_score_gemma":0.00003919824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004799557,"about_ca_topic_score_gemma":0.000002203424,"domain_scores_codex":[0.9984682,0.000187823,0.0002847956,0.0002495317,0.0002949962,0.0005146741],"domain_scores_gemma":[0.9987724,0.0001194614,0.0001351032,0.0006704113,0.00009720922,0.000205454],"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.000006606177,0.0009710619,0.005912788,0.00005634408,0.000106942,0.000004498025,0.01925843,0.02052229,0.003529559,0.04641407,0.008331243,0.8948862],"study_design_scores_gemma":[0.0003845353,0.00005567818,0.0002538968,0.00003024848,0.000004482351,0.00001774426,0.0000999264,0.992591,0.001846907,0.0003514478,0.00408585,0.0002782717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001573603,0.0004285835,0.9922288,0.0009726204,0.0002499804,0.0002157588,0.000001314583,0.0003796895,0.003949653],"genre_scores_gemma":[0.6475386,0.00003217605,0.3518794,0.0003086026,0.00009214487,0.0000119044,0.00001749644,0.00001525111,0.000104417],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9720687,"threshold_uncertainty_score":0.6243426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017440808","doi":"10.1007/s00453-001-0014-x","title":"A One-Step Crust and Skeleton Extraction Algorithm","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":80,"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; Université Laval","funders":"","keywords":"Voronoi diagram; Skeleton (computer programming); Algorithm; Vertex (graph theory); Computer science; Crust; Topology (electrical circuits); Combinatorics; Mathematics; Geology; Geometry; Theoretical computer science; Graph; Geophysics","retraction":null,"screen_n_in":null,"score":{"opus":0.01591968665295741,"gpt":0.2586402464377212,"spread":0.2427205597847638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000177543,0.0001127574,0.0001149804,0.0001474265,0.0001742541,0.0001595949,0.0002086434,0.0000648767,0.00002883],"category_scores_gemma":[0.00002134471,0.0001259993,0.00003694196,0.0004607251,0.00002676203,0.0006046005,0.00009864508,0.000117177,0.00007038559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003538219,"about_ca_system_score_gemma":0.00004268644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003941803,"about_ca_topic_score_gemma":0.000005004019,"domain_scores_codex":[0.9989396,0.00004396546,0.0001816102,0.0003669022,0.0002586147,0.0002092542],"domain_scores_gemma":[0.9994122,0.00008332985,0.0000653859,0.0002347506,0.00009537812,0.0001089783],"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.000002168624,0.00005620467,0.00001918078,0.000002602777,0.000010954,0.00001205316,0.00005674234,0.00007349928,0.0006078306,0.005148272,0.0004581813,0.9935523],"study_design_scores_gemma":[0.0005306557,0.0001421458,0.007109091,0.00001457463,0.00001279158,0.000278943,0.000020128,0.882218,0.002514835,0.006888985,0.09996653,0.000303326],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008277969,0.0002589516,0.9877921,0.001342098,0.0004110251,0.0001237698,0.000001999015,0.0001474717,0.001644649],"genre_scores_gemma":[0.1524191,0.0001994368,0.8444971,0.0006781601,0.0007164988,0.00002805005,0.00002461732,0.00001403107,0.001422983],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.993249,"threshold_uncertainty_score":0.5138102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062310236","doi":"10.1007/s00453-014-9911-7","title":"Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Approximation algorithm; Rounding; Mathematics; Facility location problem; Theory of computation; Linear programming; Randomized rounding; Function (biology); Mathematical optimization; Combinatorics; Discrete mathematics; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02614157390848688,"gpt":0.2256202621160007,"spread":0.1994786882075138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009398893,0.0002217112,0.0001809285,0.0001055778,0.0004443111,0.0001941164,0.0003263177,0.00005928328,0.00008288821],"category_scores_gemma":[0.0001663966,0.0001496722,0.00007325769,0.0004389874,0.00009713492,0.000689121,0.00008241274,0.0001091154,0.0001748412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003681906,"about_ca_system_score_gemma":0.00002231738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009037711,"about_ca_topic_score_gemma":0.0002851436,"domain_scores_codex":[0.9986106,0.00001731521,0.0003472838,0.0004095775,0.000298811,0.0003163801],"domain_scores_gemma":[0.9987828,0.00004751638,0.0001300698,0.0004942211,0.0005292417,0.00001617047],"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.0002558744,0.0005888898,0.0005926845,0.00281699,0.0003771486,3.942225e-7,0.0006610183,0.06456147,0.0005405213,0.03716104,0.0088871,0.8835569],"study_design_scores_gemma":[0.0005886971,0.00003437627,0.0009916361,0.00001530558,0.0000742269,3.630661e-7,0.0002430968,0.8646002,0.0001145282,0.001030361,0.1320914,0.0002157825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0038469,0.00006794251,0.9876026,0.00521404,0.00041685,0.001813313,0.00001005011,0.0002283629,0.000799969],"genre_scores_gemma":[0.983399,0.00001059628,0.01048861,0.001725572,0.001256074,0.00113741,0.0004676053,0.00003774892,0.001477408],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9795521,"threshold_uncertainty_score":0.6103453,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051064851","doi":"10.1007/s00453-007-9146-y","title":"Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":68,"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 Waterloo","funders":"","keywords":"Algorithm; Theory of computation; Packing problems; Time complexity; Matching (statistics); Mathematics; Exponent; Dynamic programming; Set (abstract data type); Approximation algorithm; Combinatorics; Computer science; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01963313073124341,"gpt":0.2472852207945475,"spread":0.2276520900633041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004062642,0.0002094087,0.0002101753,0.0001251518,0.0001185198,0.0001328652,0.0001033624,0.0001320234,0.0000404808],"category_scores_gemma":[0.00001928844,0.0002084095,0.00005939571,0.0001522225,0.00003134899,0.0002566187,0.00002565092,0.0001784813,0.00001589727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003557833,"about_ca_system_score_gemma":0.000007652138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001283757,"about_ca_topic_score_gemma":0.00001113977,"domain_scores_codex":[0.9988176,0.000009621864,0.0003160361,0.0002455869,0.0001309158,0.0004801936],"domain_scores_gemma":[0.999393,0.0002208109,0.00004394986,0.0001676521,0.00005079317,0.0001237769],"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.00003820853,0.0001264715,0.0007380048,0.0009126547,0.0003319458,0.00001925114,0.006285457,0.09888449,0.01092352,0.001761,0.003085419,0.8768936],"study_design_scores_gemma":[0.00249756,0.0001959045,0.0008603611,0.0002746675,0.00009647023,0.0001213965,0.0004587883,0.8573437,0.01962355,0.008130377,0.1089759,0.001421313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01799005,0.0003670433,0.9768158,0.0001025837,0.0005994524,0.0005214321,0.00002498152,0.0004441936,0.003134466],"genre_scores_gemma":[0.6277224,0.00008687621,0.3700938,0.0002956998,0.0004214149,0.00007221799,0.00006532247,0.0001612904,0.001081014],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8754722,"threshold_uncertainty_score":0.8498693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025130628","doi":"10.1007/s00453-001-0027-5","title":"Approximating Shortest Paths on Weighted Polyhedral Surfaces","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Polyhedron; Shortest path problem; Combinatorics; Dijkstra's algorithm; Mathematics; Regular polygon; Bounded function; Theory of computation; Context (archaeology); Domain (mathematical analysis); Euclidean shortest path; Computational geometry; Face (sociological concept); Discrete mathematics; K shortest path routing; Graph; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01470809025050108,"gpt":0.2418008765560288,"spread":0.2270927863055277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002020088,0.0001285959,0.0001194218,0.0001190009,0.0001840768,0.0001471703,0.0003805835,0.00004686312,0.00003047524],"category_scores_gemma":[0.00003032604,0.0001187975,0.00004851003,0.0005901164,0.00001928392,0.0003272128,0.00008878561,0.0001094877,0.0001399937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003046344,"about_ca_system_score_gemma":0.00004486302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001375942,"about_ca_topic_score_gemma":0.000002177118,"domain_scores_codex":[0.9988396,0.00004978744,0.0002184217,0.0003431015,0.0003070074,0.0002421248],"domain_scores_gemma":[0.9993606,0.0001318134,0.00007051326,0.0002784132,0.00007424351,0.00008447018],"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.0000105021,0.0002448843,0.0005697681,0.000005673657,0.00003126905,0.00006696973,0.0004147253,0.004946692,0.002364915,0.06359894,0.001473904,0.9262717],"study_design_scores_gemma":[0.0002325364,0.0001289572,0.003095668,0.00001344324,0.00000371982,0.00005196036,0.00001468964,0.9795106,0.004414323,0.006335245,0.005985868,0.0002129916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2137263,0.00009866416,0.7788544,0.001411851,0.0005336082,0.0001459949,0.000003041048,0.0002581388,0.004967917],"genre_scores_gemma":[0.8422137,0.000009084931,0.1564809,0.0004811617,0.0002686781,0.00001109028,0.00002147794,0.000008156997,0.0005057123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9745639,"threshold_uncertainty_score":0.4844421,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991075883","doi":"10.1007/s00453-007-0057-8","title":"Quantum Complexity of Testing Group Commutativity","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","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":"University of Waterloo","funders":"","keywords":"Theory of computation; Mathematics; Group testing; Commutative property; Randomized algorithm; Group (periodic table); Reduction (mathematics); Combinatorics; Discrete mathematics; Upper and lower bounds; Computational complexity theory; Quantization (signal processing); Quantum; Omega; Algorithm; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.04042840860709629,"gpt":0.2731064296135665,"spread":0.2326780210064702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215903,0.0002031609,0.0003163239,0.0001509045,0.000224606,0.00005605907,0.001090307,0.00007095538,0.000005249989],"category_scores_gemma":[0.0001546626,0.0001859835,0.0001003318,0.0008487445,0.0003022498,0.0001725368,0.0005139828,0.0003349658,0.00001262374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002915924,"about_ca_system_score_gemma":0.00004326318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000248177,"about_ca_topic_score_gemma":0.00002043502,"domain_scores_codex":[0.9981493,0.0001027348,0.0004481308,0.000404339,0.0003836893,0.000511839],"domain_scores_gemma":[0.9979823,0.0008287453,0.0002390385,0.0006571711,0.0001467166,0.0001460257],"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.00001125943,0.0003643942,0.001354175,0.0000556602,0.00004514823,0.00008875684,0.0009882002,0.0003711713,0.006473656,0.2070635,0.0001948649,0.7829892],"study_design_scores_gemma":[0.0003819725,0.0003238248,0.0301528,0.00004533648,0.000006490274,0.0001027338,0.00003326366,0.9038734,0.005440575,0.05872289,0.0006105453,0.000306208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1689864,0.00005863878,0.8287346,0.0004458098,0.0003311971,0.0001141839,0.000006234052,0.0002328615,0.001090111],"genre_scores_gemma":[0.6205729,3.525328e-7,0.3792292,0.00009665916,0.00008148287,0.000001001207,0.000002443253,0.000008826706,0.000007131434],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9035022,"threshold_uncertainty_score":0.7584188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964276725","doi":"10.1007/s00453-011-9526-1","title":"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Approximation algorithm; Theory of computation; Facility location problem; Mathematics; Linear programming relaxation; Relaxation (psychology); Dual (grammatical number); Exponential function; Integer (computer science); Algorithm; Mathematical optimization; Function (biology); Combinatorics; Linear programming; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03518398958303515,"gpt":0.2237815915891898,"spread":0.1885976020061547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000690638,0.0002670158,0.0002302138,0.0001067724,0.0005528424,0.000190219,0.0009933156,0.00008496291,0.00002133302],"category_scores_gemma":[0.00002822983,0.0001807702,0.0001057223,0.000651082,0.0002640274,0.0007632399,0.0002055229,0.0002111821,0.00002560478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005733658,"about_ca_system_score_gemma":0.0001441685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001496305,"about_ca_topic_score_gemma":0.00002084171,"domain_scores_codex":[0.9980443,0.00008293424,0.0003476155,0.000616629,0.0004469774,0.0004616073],"domain_scores_gemma":[0.9982314,0.0001707017,0.0001835248,0.0008713101,0.0004482163,0.00009489096],"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.00002475733,0.0002131201,0.00003705046,0.0000509795,0.00009751095,0.000004164252,0.003409035,0.00004961311,0.00002505147,0.0433861,0.0002602071,0.9524424],"study_design_scores_gemma":[0.001002374,0.0005497313,0.00198796,0.00003675807,0.00005845368,0.0000929055,0.000399273,0.9365055,0.004818774,0.04891004,0.005110931,0.0005273167],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004401905,0.0001862132,0.9965393,0.0006001898,0.0002172929,0.001249254,0.00003988004,0.000275993,0.0004516738],"genre_scores_gemma":[0.05691547,0.00001065716,0.9419915,0.0001684386,0.0001342151,0.0005571464,0.00003617326,0.00001614118,0.0001702634],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9519151,"threshold_uncertainty_score":0.7371595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2922321031","doi":"10.1007/s00453-007-9151-1","title":"On the Parameterized Complexity of Layered Graph Drawing","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","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":"University of Waterloo; McGill University","funders":"","keywords":"Combinatorics; Parameterized complexity; Pathwidth; Mathematics; Graph drawing; Theory of computation; Bounded function; Crossing number (knot theory); Graph; Time complexity; Span (engineering); Discrete mathematics; Line graph; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04315325250689598,"gpt":0.271161155714278,"spread":0.228007903207382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005868179,0.00007482795,0.00009911849,0.00009763554,0.0001232051,0.00003896849,0.000392602,0.00002744754,0.0000181354],"category_scores_gemma":[0.00007340616,0.0000544924,0.00006494367,0.0005055318,0.00007658071,0.00009663656,0.00007471882,0.00008143512,0.00001651288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001227288,"about_ca_system_score_gemma":0.00002391841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001349949,"about_ca_topic_score_gemma":0.000002669577,"domain_scores_codex":[0.9991708,0.0000562878,0.0001982943,0.0001740565,0.0002494008,0.0001511447],"domain_scores_gemma":[0.9989838,0.0005233147,0.00008389589,0.0002926007,0.0000768118,0.00003958117],"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.00002317693,0.0001061656,0.00001950034,0.000005122355,0.00003228444,0.000005994876,0.0003451988,0.0009023477,0.01186909,0.8940792,0.000640408,0.09197149],"study_design_scores_gemma":[0.0008445407,0.000330979,0.01403881,0.00003181519,0.0000102067,0.00002337161,0.00005206952,0.2272481,0.2097444,0.5452475,0.002097171,0.0003310184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1661845,0.00001733053,0.8315791,0.0008639134,0.0002110769,0.00009831414,0.000002046857,0.00003966796,0.001003992],"genre_scores_gemma":[0.9102584,0.000001014724,0.0891921,0.0004537008,0.00005037215,0.000002828112,0.000003783628,0.000002974066,0.00003488683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7440738,"threshold_uncertainty_score":0.2222136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1601856531","doi":"10.1007/s00453-002-0986-1","title":"TSP Heuristics: Domination Analysis and Complexity","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Combinatorics; Travelling salesman problem; Mathematics; Heuristics; Digraph; Heuristic; Theory of computation; Time complexity; Constant (computer programming); Discrete mathematics; Graph; Mathematical optimization; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02925142421986513,"gpt":0.2506017387149126,"spread":0.2213503144950475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001430032,0.00008915181,0.0001529007,0.0001548956,0.00005877803,0.00003614025,0.00006227556,0.00004898058,0.0002817097],"category_scores_gemma":[0.0000549736,0.00009863104,0.00003869247,0.0004965999,0.00004323509,0.00006277916,0.00001901073,0.00008434087,0.00002913216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002884352,"about_ca_system_score_gemma":9.901552e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001029708,"about_ca_topic_score_gemma":0.000003382565,"domain_scores_codex":[0.9994417,0.00004159076,0.0001537943,0.0001304111,0.00009896262,0.0001335592],"domain_scores_gemma":[0.9996451,0.00008671176,0.00002284816,0.0001500893,0.00003729217,0.0000579277],"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.000004924736,0.0001173006,0.007129812,0.0001180103,0.001424312,0.00002220003,0.001785493,0.2249147,0.001407534,0.003217864,0.003762787,0.756095],"study_design_scores_gemma":[0.00014298,0.000006642583,0.006356933,0.00000219065,0.0001237312,0.000003116782,0.00001187714,0.9916446,0.0005443019,0.0002747785,0.0007762235,0.0001126403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02352645,0.0001920779,0.9712534,0.0001159643,0.0001048414,0.00006913297,0.0000149702,0.0003157232,0.004407418],"genre_scores_gemma":[0.6111605,0.0000617982,0.3884926,0.00002810519,0.00006057275,0.000004185521,0.00001340786,0.00001647534,0.0001622819],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7667298,"threshold_uncertainty_score":0.4022057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012042319","doi":"10.1007/s00453-001-0109-4","title":"Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":57,"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":"Computer science; Algorithm; Binary logarithm; Parallel computing; Parallel algorithm; Theory of computation; Overhead (engineering); Spanning tree; Computation; Tree (set theory); Combinatorics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0279442320030997,"gpt":0.2374121101943307,"spread":0.209467878191231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000277893,0.0002183964,0.000274741,0.0001456076,0.0002613118,0.0002133297,0.000471718,0.00009980884,0.00001214192],"category_scores_gemma":[0.00002060409,0.0001941089,0.0001423476,0.0002653476,0.00007072223,0.0001082902,0.0001335527,0.0001182564,0.00003238243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003264739,"about_ca_system_score_gemma":0.000008054433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003188637,"about_ca_topic_score_gemma":0.000003354564,"domain_scores_codex":[0.9983458,0.00006329615,0.0003459908,0.0005753368,0.000214539,0.0004550435],"domain_scores_gemma":[0.9989583,0.0002209504,0.0001077604,0.0004272026,0.0001163265,0.0001694155],"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.00002841852,0.0005792443,0.00006312162,0.00009434238,0.0002829102,0.00006646606,0.005007192,0.02334917,0.0002246625,0.06858613,0.04745033,0.854268],"study_design_scores_gemma":[0.001049234,0.0001606565,0.00005843106,0.00002415695,0.000008155002,0.00006884555,0.00004189129,0.9880084,0.0000397314,0.0006838629,0.009599156,0.000257467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002723296,0.0003451262,0.9930269,0.001227919,0.001560814,0.0005016419,0.000007742383,0.0002317823,0.0003747634],"genre_scores_gemma":[0.5148204,0.00002859881,0.4826022,0.000857433,0.0005905905,0.00015775,0.000005460214,0.00003208567,0.0009055148],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9646592,"threshold_uncertainty_score":0.791553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145866065","doi":"10.1007/s00453-012-9740-5","title":"Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":56,"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":"Mathematics; Combinatorics; Cover (algebra); Bounded function; Tree (set theory); Approximation algorithm; Theory of computation; Upper and lower bounds; Discrete mathematics; Graph; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02354457203300562,"gpt":0.239021698037697,"spread":0.2154771260046914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005021424,0.0003907013,0.0003710169,0.0001432198,0.0006601274,0.0009549259,0.001283341,0.0001652953,0.00008031005],"category_scores_gemma":[0.00009075242,0.000261767,0.000202853,0.0005123771,0.0003150094,0.001194612,0.0004459006,0.0002816292,0.0001313369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006761979,"about_ca_system_score_gemma":0.0001011256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002621451,"about_ca_topic_score_gemma":0.00002214433,"domain_scores_codex":[0.9974835,0.00007951632,0.0004995798,0.0008207642,0.0004243887,0.0006922612],"domain_scores_gemma":[0.9975781,0.0007496623,0.0002310237,0.0009879546,0.0002676265,0.000185669],"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.00001139218,0.0001408887,0.00002029575,0.00005772498,0.0001329267,0.000001733166,0.0007339786,0.00002709396,0.0009500377,0.01432289,0.007635618,0.9759654],"study_design_scores_gemma":[0.001366268,0.000253162,0.00100775,0.00002342238,0.00003871504,0.00003456274,0.00005105123,0.8953127,0.001365671,0.06091336,0.03919886,0.000434469],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00122635,0.0005090857,0.9886507,0.005037098,0.0008219147,0.002366208,0.00003631702,0.0002658553,0.00108643],"genre_scores_gemma":[0.0646098,0.0001975699,0.9203507,0.002433082,0.001098115,0.002548042,0.0000726058,0.0001110577,0.008578989],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9755309,"threshold_uncertainty_score":0.9999834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973228454","doi":"10.1007/s00453-012-9726-3","title":"Efficient Fully-Compressed Sequence Representations","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":56,"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":"Combinatorics; Disjoint sets; Substring; Mathematics; Amortized analysis; Redundancy (engineering); Data structure; Binary logarithm; Compressed suffix array; Subsequence; Algorithm; Sequence (biology); Discrete mathematics; Suffix tree; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03079680232543067,"gpt":0.2926913199302248,"spread":0.2618945176047941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002740744,0.0001765267,0.0001669856,0.0001028534,0.0002765175,0.0001448167,0.001061176,0.0000679394,0.00008029395],"category_scores_gemma":[0.00005186108,0.0001541232,0.00007746761,0.0004570392,0.00006765857,0.0005519423,0.0006095032,0.0001765823,0.0004504621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004581799,"about_ca_system_score_gemma":0.00004738678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000735282,"about_ca_topic_score_gemma":4.40812e-7,"domain_scores_codex":[0.998221,0.00008619486,0.0002681795,0.0004225496,0.0004304347,0.000571613],"domain_scores_gemma":[0.9982771,0.0001499023,0.0001011431,0.001093574,0.00009196372,0.000286275],"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.00002380693,0.001918913,0.001935476,0.00005530307,0.0001395582,0.00009803516,0.004524322,0.007493769,0.02747012,0.2807833,0.04523374,0.6303236],"study_design_scores_gemma":[0.0004802762,0.00004455754,0.005934398,0.00002942679,0.00001416964,0.00009452357,0.00005839847,0.9443334,0.009760491,0.001653682,0.0371241,0.0004725951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008075523,0.000368615,0.9850438,0.0006820436,0.001158187,0.0002044051,0.00002454724,0.0003667996,0.004076037],"genre_scores_gemma":[0.6952435,0.000008352711,0.3035261,0.0003579762,0.0004409746,0.0000453886,0.00002676687,0.00001606004,0.0003349261],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9368396,"threshold_uncertainty_score":0.6284963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1513274608","doi":"10.1007/s00453-016-0159-2","title":"On the Parameterized Complexity of Reconfiguration Problems","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Google (Canada); University of Waterloo","funders":"","keywords":"Control reconfiguration; Parameterized complexity; Vertex cover; Vertex (graph theory); Combinatorics; Kernelization; Mathematics; Theory of computation; Bounded function; Maximization; Sequence (biology); Discrete mathematics; Graph; Computer science; Algorithm; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.06819916082681735,"gpt":0.2874308113952869,"spread":0.2192316505684695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004624395,0.00007890535,0.0001121244,0.00005877062,0.00008034973,0.00002609658,0.0007823737,0.00002804183,0.00007664775],"category_scores_gemma":[0.0002018354,0.0000386749,0.00005046581,0.0002506835,0.0002997344,0.0002009485,0.0001000644,0.00007607529,0.00008882348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002074294,"about_ca_system_score_gemma":0.00002533866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005249225,"about_ca_topic_score_gemma":0.000001415817,"domain_scores_codex":[0.9989606,0.0001935939,0.0001744054,0.0002283654,0.0002488965,0.0001942138],"domain_scores_gemma":[0.9983143,0.0008047309,0.00009091672,0.00065685,0.0000922219,0.00004095803],"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.00001403199,0.00003192487,0.000004796178,0.0000030549,0.00001070279,8.192916e-7,0.00007770686,0.000003142459,0.03889068,0.8402436,0.0001731125,0.1205464],"study_design_scores_gemma":[0.000297244,0.000186061,0.0002542431,0.00003393231,0.00000108462,0.000003746472,0.000004800368,0.005206156,0.09948424,0.8937508,0.0006960735,0.0000816204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03124519,0.00001157436,0.9582481,0.007808317,0.0001044938,0.0003471272,0.000009284251,0.00007471213,0.002151189],"genre_scores_gemma":[0.9706555,0.000007897918,0.02884775,0.0001469979,0.00001975308,0.00004313042,7.660735e-7,0.000006829226,0.0002713965],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9394103,"threshold_uncertainty_score":0.1577117,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039786295","doi":"10.1007/s00453-007-9018-5","title":"Stackelberg Strategies for Selfish Routing in General Multicommodity Networks","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":53,"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":"Price of anarchy; Stackelberg competition; Routing (electronic design automation); Computer science; Latency (audio); Nash equilibrium; Theory of computation; Mathematical optimization; Upper and lower bounds; Price of stability; Mathematical economics; Mathematics; Topology (electrical circuits); Computer network; Combinatorics; Economics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.08005567828149378,"gpt":0.4028447996557781,"spread":0.3227891213742843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004271779,0.0001274061,0.0002199945,0.0001262686,0.0001916659,0.0002074799,0.0005714403,0.00010102,0.00006645022],"category_scores_gemma":[0.000396476,0.0001076508,0.00009216426,0.000564194,0.00009386661,0.0002767693,0.00008747644,0.0001783925,0.00004480532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003944079,"about_ca_system_score_gemma":0.00004982338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006494393,"about_ca_topic_score_gemma":0.0003362823,"domain_scores_codex":[0.9981402,0.00009078534,0.0005989326,0.0003968038,0.0003314767,0.0004417776],"domain_scores_gemma":[0.9969862,0.002167205,0.0001498351,0.0004394648,0.0001558054,0.0001014937],"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.0001283478,0.0003466116,0.005021382,0.000004550186,0.000026982,0.00001285446,0.001774982,0.01569638,0.0009132191,0.461652,0.005826085,0.5085967],"study_design_scores_gemma":[0.001096169,0.00006837284,0.03228515,0.00001195841,0.00001299175,0.000008369254,0.004058849,0.5316511,0.001172341,0.4099798,0.01925885,0.000396057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.38578,0.00001859174,0.6106628,0.000273269,0.0001842757,0.000286,0.00001746407,0.00004463698,0.00273296],"genre_scores_gemma":[0.9745542,0.000001569192,0.02432923,0.0002158749,0.0003535953,0.00003387131,0.00001180768,0.00001160055,0.0004883026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5887741,"threshold_uncertainty_score":0.4389872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130428886","doi":"10.1007/s00453-014-9955-8","title":"Online Bin Packing with Advice","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":51,"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":"Bin packing problem; Advice (programming); Bin; Computer science; Theory of computation; Combinatorics; Mathematics; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.005320935873254548,"gpt":0.1880935076917519,"spread":0.1827725718184973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006026307,0.000102855,0.00009915698,0.00005204569,0.00003693264,0.00002889722,0.000085474,0.00004325614,0.00008048592],"category_scores_gemma":[0.000008876626,0.00008867042,0.00001781765,0.0001734172,0.0000164564,0.00006906506,0.00001053295,0.0001071705,0.00007541384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001431045,"about_ca_system_score_gemma":0.000005637155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009371729,"about_ca_topic_score_gemma":0.0000157267,"domain_scores_codex":[0.999512,0.00001257822,0.0001038359,0.0001086467,0.00009418192,0.000168792],"domain_scores_gemma":[0.999701,0.00003190213,0.00001655768,0.0001611361,0.00003122523,0.00005821874],"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.00001256649,0.0001345743,0.001035824,0.0001636049,0.0001415845,0.00001071897,0.0008034272,0.7050321,0.0008184609,0.002658922,0.009473987,0.2797143],"study_design_scores_gemma":[0.000414451,0.00005060025,0.0004550545,0.00004866202,0.00001250164,0.00001249549,0.00002403482,0.8925601,0.0008245139,0.0001117489,0.1052563,0.000229579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03080973,0.0002336746,0.881315,0.0008095019,0.0009016106,0.0003141669,0.00003601439,0.00382871,0.08175158],"genre_scores_gemma":[0.8672453,0.00003362047,0.1311037,0.0003724187,0.0003173375,0.000008727729,0.00007700394,0.00007988106,0.0007620708],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8364356,"threshold_uncertainty_score":0.3615875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982770663","doi":"10.1007/s00453-001-0045-3","title":"Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":49,"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; Simple polygon; Polygon (computer graphics); Mathematics; Binary logarithm; Upper and lower bounds; Theory of computation; Discrete mathematics; Regular polygon; Computer science; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02022339629068802,"gpt":0.2853277463373065,"spread":0.2651043500466184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000718634,0.0001920828,0.0003168448,0.00028336,0.00008809837,0.00006519094,0.0009823057,0.0001121729,0.000004803378],"category_scores_gemma":[0.00007669485,0.0001972038,0.0001026893,0.0007702627,0.0001217228,0.0003933263,0.0002169163,0.0002900225,0.000009001803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001284278,"about_ca_system_score_gemma":0.0001124452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003691828,"about_ca_topic_score_gemma":0.000004652326,"domain_scores_codex":[0.9978375,0.000138672,0.0004033874,0.000556401,0.0004188657,0.0006451375],"domain_scores_gemma":[0.9986869,0.0004426727,0.0001296557,0.0005038744,0.00007829924,0.0001586647],"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.00009957451,0.0007036321,0.001847113,0.0001006607,0.00008818536,0.0002022342,0.006104704,0.009492262,0.006169867,0.002536953,0.006524472,0.9661303],"study_design_scores_gemma":[0.001921383,0.001031319,0.0007059121,0.0001345471,0.000008863787,0.0001629587,0.0005819759,0.9802374,0.002227719,0.002912685,0.009609706,0.0004654889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05513712,0.0004527472,0.9424844,0.0003821474,0.0002150365,0.0009036631,0.00001266438,0.0001259407,0.0002863175],"genre_scores_gemma":[0.4626744,0.00007018954,0.5356506,0.0002777248,0.0001463515,0.0006856985,0.00004243018,0.00004766371,0.0004050359],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9707452,"threshold_uncertainty_score":0.8041737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982250524","doi":"10.1007/s00453-006-0112-x","title":"Large Deviations for the Weighted Height of an Extended Class of Trees","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":49,"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; Binary search tree; Class (philosophy); Weight-balanced tree; Intersection (aeronautics); Constant (computer programming); Theory of computation; Binary tree; Tree (set theory); Random binary tree; Limit (mathematics); Plane (geometry); Discrete mathematics; Large deviations theory; Statistics; Algorithm; Geometry; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0104976520595896,"gpt":0.2452400137144779,"spread":0.2347423616548883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002904891,0.0001064343,0.0001645637,0.00009355418,0.0001255597,0.00005339602,0.00107413,0.00003587794,0.00001407313],"category_scores_gemma":[0.00001309493,0.00007493974,0.00008886661,0.0003821836,0.00005672032,0.0005159919,0.0001784648,0.00004746489,0.000004456762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009743054,"about_ca_system_score_gemma":0.00002730039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005265767,"about_ca_topic_score_gemma":0.00009163644,"domain_scores_codex":[0.9989656,0.00003541986,0.0003005225,0.0002453868,0.000228153,0.0002249809],"domain_scores_gemma":[0.9988302,0.0001687638,0.0001673879,0.000685205,0.0001197384,0.00002870095],"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.000008221441,0.000545151,0.00006362196,0.00002383546,0.00008245938,0.00000243107,0.0001561097,0.00002110066,0.0005722381,0.8861465,0.01016162,0.1022167],"study_design_scores_gemma":[0.001222659,0.0002178093,0.0116348,0.00001624579,0.00006833112,0.000002454703,0.00009858706,0.8080047,0.01367474,0.05582064,0.1090042,0.0002348844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002319303,0.0002286748,0.9947201,0.000921334,0.0002208362,0.0003407447,0.0001563635,0.00006416097,0.001028467],"genre_scores_gemma":[0.8095779,0.00004214937,0.1881666,0.0001618467,0.0003258614,0.00008669631,0.0002277359,0.00002068282,0.001390461],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8303258,"threshold_uncertainty_score":0.3055954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051671786","doi":"10.1007/s00453-012-9664-0","title":"A Uniform Paradigm to Succinctly Encode Various Families of Trees","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":49,"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":"ENCODE; Computer science; Theory of computation; Combinatorics; Weight-balanced tree; Theoretical computer science; Mathematics; Set (abstract data type); Encoding (memory); Tree (set theory); Node (physics); Discrete mathematics; Algorithm; Binary tree; Artificial intelligence; Binary search tree","retraction":null,"screen_n_in":null,"score":{"opus":0.01263315840486076,"gpt":0.2454722923001212,"spread":0.2328391338952605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002493348,0.000188073,0.0002694496,0.0001711252,0.0001099186,0.00005638911,0.00106545,0.00007427423,0.00002371229],"category_scores_gemma":[0.00002927865,0.0001545851,0.00007561668,0.0004856727,0.00004279045,0.0008377074,0.0006086222,0.0001155885,0.0001298163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003818246,"about_ca_system_score_gemma":0.00005776579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004276433,"about_ca_topic_score_gemma":0.00003330113,"domain_scores_codex":[0.9984761,0.00004183144,0.0003149056,0.0003076961,0.0003558483,0.0005035679],"domain_scores_gemma":[0.9985918,0.0001131462,0.0001025825,0.0008594177,0.00005409744,0.0002789855],"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.0000288238,0.000676073,0.003854777,0.00003676081,0.00008722745,0.00002267239,0.005819486,0.0001515427,0.002886508,0.1270986,0.01227252,0.847065],"study_design_scores_gemma":[0.002122913,0.001259617,0.09634861,0.0002329163,0.00008138841,0.0002038856,0.0004868812,0.1902912,0.05948371,0.01811548,0.629258,0.002115464],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02058113,0.0003144569,0.9745464,0.0006644122,0.0006986069,0.0002267151,0.00003804389,0.0001727292,0.002757558],"genre_scores_gemma":[0.6653494,0.00003329524,0.3337331,0.0004025417,0.0002389996,0.00002169835,0.00001144561,0.00001529796,0.0001942899],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8449496,"threshold_uncertainty_score":0.6303796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043985142","doi":"10.1007/s00453-009-9349-5","title":"Approximability of Packing Disjoint Cycles","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":47,"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":"Disjoint sets; Theory of computation; Combinatorics; Packing problems; Set packing; Computer science; Mathematics; Algorithm; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.007440738904930359,"gpt":0.2074974811256264,"spread":0.2000567422206961,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008621725,0.00008239915,0.0001262439,0.00004034413,0.00002107522,0.00001234672,0.00007968315,0.00004459679,0.00005140606],"category_scores_gemma":[0.00001517638,0.00007985308,0.00004504205,0.0001300285,0.00002344396,0.00006456019,0.000007890922,0.0000752228,0.00001097089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001773414,"about_ca_system_score_gemma":0.00000544405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000320876,"about_ca_topic_score_gemma":4.966146e-7,"domain_scores_codex":[0.9994958,0.00001083633,0.0001790948,0.00009519693,0.00008782677,0.000131246],"domain_scores_gemma":[0.9997155,0.0000204287,0.00002296923,0.0001746993,0.00002737154,0.00003902852],"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.00001258554,0.0002366699,0.001373654,0.0002126425,0.00007626222,0.000004716247,0.001700722,0.1973869,0.009022572,0.01035995,0.001901809,0.7777115],"study_design_scores_gemma":[0.0008545967,0.0001497969,0.0199612,0.0001220205,0.00003373164,0.00001279907,0.0001142403,0.8807839,0.07436653,0.01644798,0.006501027,0.0006521507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2035417,0.0009368396,0.6719252,0.0009977447,0.0009933563,0.0007182821,0.00005195962,0.0020197,0.1188152],"genre_scores_gemma":[0.9759235,0.00002124676,0.02392649,0.00003369981,0.00004051816,0.000002081567,0.000008101168,0.00001062509,0.00003368971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7770594,"threshold_uncertainty_score":0.3256314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142094448","doi":"10.1007/s00453-009-9311-6","title":"Stochastic Models for Budget Optimization in Search-Based Advertising","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":46,"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":"Computer science; Theory of computation; Probabilistic logic; Stochastic optimization; Mathematical optimization; Simple (philosophy); Budget constraint; Online advertising; Prefix; The Internet; Operations research; Mathematics; Algorithm; Economics; World Wide Web; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02191355678618553,"gpt":0.2746936839958445,"spread":0.252780127209659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003010346,0.0001051877,0.0001280591,0.0002259025,0.00009641713,0.0001287939,0.0004196344,0.0000572625,0.000007893232],"category_scores_gemma":[0.00004255808,0.0001083949,0.00004346274,0.000475035,0.00002283647,0.0005668239,0.00003751948,0.0001022733,0.000005152373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006841127,"about_ca_system_score_gemma":0.0001281695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001095716,"about_ca_topic_score_gemma":0.000001722001,"domain_scores_codex":[0.9988331,0.00005374139,0.0002143796,0.0003209476,0.0002353053,0.0003424808],"domain_scores_gemma":[0.9993657,0.0000928822,0.00003504658,0.0002715855,0.0001376149,0.00009714883],"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.000006841459,0.00005733246,6.377983e-7,0.000004025987,0.000001520991,0.000001536839,0.0001404083,0.9523855,0.00002511516,0.009538709,0.00007495189,0.03776344],"study_design_scores_gemma":[0.0007891485,0.0001289541,0.00001631957,0.00002634354,0.000001396196,0.000001451689,0.000006477411,0.9904012,0.0001880294,0.008282904,0.00002776141,0.0001299958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005062384,0.00003518183,0.99593,0.002942676,0.00006713151,0.0004610482,0.000003472338,0.0001275577,0.0003823239],"genre_scores_gemma":[0.2400729,0.000003412503,0.7588964,0.0008741093,0.00002794162,0.00002447797,0.00001962568,0.00000883725,0.00007223886],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2400223,"threshold_uncertainty_score":0.4420215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023293538","doi":"10.1007/s00453-005-1185-7","title":"Book Embeddability of Series–Parallel Digraphs","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Embedding; Series (stratigraphy); Transitive relation; Discrete mathematics; Monotonic function; Set (abstract data type); Point (geometry); Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.00755424390658528,"gpt":0.2535625659565984,"spread":0.2460083220500131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030475,0.0001380184,0.0002104337,0.0001320697,0.00009067848,0.00003679654,0.001024175,0.00005914696,0.00007181246],"category_scores_gemma":[0.00003580218,0.0001281436,0.0001173454,0.0006030662,0.000302216,0.0007118609,0.0002942199,0.0001559081,0.00004146626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000268341,"about_ca_system_score_gemma":0.00005948621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000507322,"about_ca_topic_score_gemma":0.000006499934,"domain_scores_codex":[0.9984357,0.0001038454,0.0002962125,0.0004084134,0.0003752517,0.0003805813],"domain_scores_gemma":[0.9986114,0.0001340374,0.0000870198,0.0009418038,0.000146764,0.00007897409],"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.00007336194,0.0004724071,0.001513918,0.00006277455,0.00004243797,0.00003676833,0.0002501971,0.0005875562,0.004936353,0.9182676,0.01927732,0.0544793],"study_design_scores_gemma":[0.0007600249,0.0003092519,0.006754642,0.00001942789,0.000007207838,0.00004874541,0.00002416004,0.01243912,0.03859063,0.8329144,0.1076602,0.0004721929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005861901,0.002283656,0.9779661,0.00118827,0.0002032735,0.0003727807,0.00001534835,0.0002824594,0.01182627],"genre_scores_gemma":[0.3730502,0.0001054181,0.6139848,0.0006385781,0.0002276404,0.0001059933,0.00001722677,0.00004777679,0.01182242],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3671883,"threshold_uncertainty_score":0.5225543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070346129","doi":"10.1007/s00453-010-9452-7","title":"Succinct Representation of Labeled Graphs","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":45,"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":"Combinatorics; Computer science; Planar graph; Adjacency list; Representation (politics); Graph; Pathwidth; Mathematics; Discrete mathematics; Theoretical computer science; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.009785539630708481,"gpt":0.2580985784941446,"spread":0.2483130388634361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001587714,0.0001014408,0.0001613569,0.000108101,0.00007973893,0.00005088803,0.0007897586,0.00006981719,0.00005517701],"category_scores_gemma":[0.0000538198,0.00008685615,0.00006636764,0.0004763201,0.00005227582,0.0005032613,0.0002887571,0.0001833787,0.00003482771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004526794,"about_ca_system_score_gemma":0.00003714217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001462782,"about_ca_topic_score_gemma":0.000010606,"domain_scores_codex":[0.998953,0.00003477405,0.000234778,0.0003210466,0.0002727535,0.000183585],"domain_scores_gemma":[0.9987292,0.00009749378,0.000121779,0.0008502303,0.0001205354,0.00008080726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001219872,0.0002386267,0.001805783,0.00001653616,0.00004062035,0.00002577169,0.0003587635,0.00001044762,0.1554438,0.1637377,0.006027374,0.6722825],"study_design_scores_gemma":[0.002140037,0.0002997062,0.03642646,0.00004598414,0.00003174493,0.0001161127,0.00005250689,0.3060128,0.5374071,0.09327552,0.02341063,0.0007814402],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2619006,0.00007788188,0.7310497,0.0008443266,0.002082047,0.0002971302,0.00002633448,0.0003079614,0.003413972],"genre_scores_gemma":[0.6989439,0.00001127593,0.3006841,0.00008064046,0.0001009651,0.00001012088,0.00002036915,0.000009239801,0.0001393447],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.671501,"threshold_uncertainty_score":0.3541891,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1592802262","doi":"10.1007/s00453-005-1181-y","title":"A Fixed-Parameter Approach to 2-Layer Planarization","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Carleton University; McGill University","funders":"","keywords":"Chemical-mechanical planarization; Bipartite graph; Mathematics; Time complexity; Combinatorics; Permutation (music); Theory of computation; Graph; Layer (electronics); Line graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Computer science; Physics; Materials science","retraction":null,"screen_n_in":null,"score":{"opus":0.01268942985563965,"gpt":0.2240374547533742,"spread":0.2113480248977345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001104832,0.0000953279,0.00008633881,0.0001558435,0.00009639817,0.0001407646,0.0003008412,0.00004302974,0.000006762911],"category_scores_gemma":[0.00002034011,0.00009315499,0.00003550278,0.0006355807,0.000008525273,0.0002543489,0.0000836073,0.00005484541,0.0001320097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002853121,"about_ca_system_score_gemma":0.00003371368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003619521,"about_ca_topic_score_gemma":0.000001890159,"domain_scores_codex":[0.9990762,0.00003194591,0.0001618154,0.0003217638,0.0002314089,0.0001768006],"domain_scores_gemma":[0.999531,0.00005481059,0.00003634118,0.0002411333,0.000076281,0.0000604175],"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.0000146317,0.0006164364,0.0002694378,0.0000189913,0.00003857594,0.00001146477,0.0005034092,0.1499106,0.006840276,0.4923712,0.08374305,0.265662],"study_design_scores_gemma":[0.0002686532,0.00006688707,0.004320568,0.000004322025,0.00000574853,0.0000296029,0.000004827236,0.9359963,0.009739318,0.01445526,0.03483745,0.0002710801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00563677,0.00002426229,0.9848653,0.0006411117,0.0002434663,0.0001584071,0.0000031169,0.0001220298,0.00830554],"genre_scores_gemma":[0.4473301,3.918489e-7,0.5502632,0.0008578526,0.0003047081,0.0000311619,0.0000670381,0.000006621092,0.001138936],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7860857,"threshold_uncertainty_score":0.379875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2754604279","doi":"10.1007/s00453-017-0373-6","title":"Algorithms for Communication Scheduling in Data Gathering Network with Data Compression","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Ningbo; China Scholarship Council","keywords":"Job shop scheduling; Polynomial-time approximation scheme; Approximation algorithm; Computer science; Data compression; Scheduling (production processes); Mathematical optimization; Time complexity; Dynamic programming; Theory of computation; Wireless sensor network; Base station; Optimization problem; Data transmission; Algorithm; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1896481992940429,"gpt":0.3807958753073195,"spread":0.1911476760132766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001138627,0.000122525,0.0001712001,0.00004701158,0.0006990238,0.0006412219,0.008617163,0.00005699439,0.000004608526],"category_scores_gemma":[0.0001181338,0.0001059366,0.00001210917,0.0001268786,0.00008638827,0.002249295,0.004660972,0.0001989393,0.000006790468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002059114,"about_ca_system_score_gemma":0.00008293003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001443347,"about_ca_topic_score_gemma":0.0001635576,"domain_scores_codex":[0.9985441,0.00007717551,0.0002290494,0.000595057,0.0002193919,0.0003352373],"domain_scores_gemma":[0.9925817,0.0001618997,0.0001902801,0.006898442,0.00008738841,0.00008024549],"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.00005635807,0.0002816964,0.001990017,0.00007467445,0.00008361285,0.00001712987,0.0007247021,0.09289831,0.0001007857,0.01448493,0.004993455,0.8842943],"study_design_scores_gemma":[0.0007393942,0.00002660326,0.0005820217,0.0001588486,0.000003958141,0.000004244301,0.00001794895,0.9866493,0.00003099352,0.001150281,0.01048397,0.0001524115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001869957,0.0002110906,0.9958382,0.002631285,0.0001277558,0.0004333449,0.00003598646,0.00008469363,0.0004506844],"genre_scores_gemma":[0.0331138,0.0001265187,0.9660069,0.0001171616,0.0000953451,0.00002757047,0.0004130551,0.00001742698,0.00008223399],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.893751,"threshold_uncertainty_score":0.9967467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116643655","doi":"10.1007/s00453-010-9461-6","title":"Shortest Paths in Time-Dependent FIFO Networks","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":42,"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":"Shortest path problem; Combinatorics; Disjoint sets; Mathematics; Interval (graph theory); Function (biology); Node (physics); Binary logarithm; Time complexity; Path (computing); Discrete mathematics; Computer science; Graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.004630311136895341,"gpt":0.2092553920371225,"spread":0.2046250809002272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054398,0.0002098332,0.0002338552,0.00009786144,0.00007668226,0.0002035997,0.00176591,0.0002122305,0.0001787546],"category_scores_gemma":[0.00003232052,0.0002074956,0.00006882711,0.0004859621,0.00005657851,0.0003546355,0.0005629687,0.0008051642,0.0004546086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003784938,"about_ca_system_score_gemma":0.00005789101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000603362,"about_ca_topic_score_gemma":0.0001285071,"domain_scores_codex":[0.9980375,0.00006517877,0.0003336731,0.0005993051,0.0003730441,0.0005912596],"domain_scores_gemma":[0.9984188,0.0001922668,0.00007844147,0.00107604,0.00005101622,0.0001834334],"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.000009357139,0.0004361638,0.005340961,0.000004937543,0.00003231319,0.0005208196,0.0002907488,0.009265219,0.001531589,0.01084346,0.01079656,0.9609279],"study_design_scores_gemma":[0.0003487187,0.00005404359,0.003900615,0.0000144364,0.000003947756,0.0000625843,0.000002509234,0.9858742,0.0003840266,0.001588869,0.00744726,0.000318778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03297029,0.00021512,0.9534054,0.001036554,0.003168536,0.0007065245,0.000004934523,0.0006608821,0.007831722],"genre_scores_gemma":[0.9601842,0.00001865452,0.03754937,0.0005651331,0.0007369817,0.00007952256,0.000009219594,0.00003260083,0.0008243844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.976609,"threshold_uncertainty_score":0.8461425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999760725","doi":"10.1007/s00453-004-1121-2","title":"Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"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 Science Foundation","keywords":"Minimum spanning tree; Combinatorics; Spanning tree; Mathematics; Degree (music); k-minimum spanning tree; Bounded function; Gomory–Hu tree; Theory of computation; Steiner tree problem; Approximation algorithm; Shortest-path tree; Discrete mathematics; Graph; Node (physics); Kruskal's algorithm; Undirected graph; Connected dominating set; Algorithm; K-ary tree; Tree structure; Binary tree","retraction":null,"screen_n_in":null,"score":{"opus":0.04624586313923365,"gpt":0.256247606757736,"spread":0.2100017436185024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005376485,0.0001618678,0.0001541765,0.00008703167,0.0003679751,0.0004483937,0.001061448,0.00006063608,0.00001615326],"category_scores_gemma":[0.00006592167,0.0001124409,0.00008102244,0.000545387,0.00009941348,0.0004859102,0.0003195694,0.0002446387,0.0001103462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006341445,"about_ca_system_score_gemma":0.0001195621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000466144,"about_ca_topic_score_gemma":0.00001220501,"domain_scores_codex":[0.9983756,0.00008767086,0.0003124561,0.0003889736,0.0003811875,0.0004540901],"domain_scores_gemma":[0.9989854,0.0001251206,0.0001134432,0.0005675566,0.00009853835,0.0001099372],"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.000007587432,0.0002716551,0.0001242468,0.00005389705,0.0001031323,0.00004333698,0.01048267,0.007435221,0.001304501,0.178711,0.001337834,0.8001249],"study_design_scores_gemma":[0.002161188,0.0002774021,0.0004613686,0.0001334163,0.00001846505,0.00009988651,0.0003126824,0.8737757,0.005205926,0.1080647,0.008770165,0.0007190278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008489597,0.00006788761,0.9805403,0.006563332,0.0001548909,0.0003956101,0.000001101784,0.000254563,0.0111733],"genre_scores_gemma":[0.07884693,0.000007089021,0.9193835,0.001020126,0.0001120146,0.0000724894,0.000004064192,0.00001987575,0.0005338662],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8663405,"threshold_uncertainty_score":0.4585207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023800056","doi":"10.1007/s00453-011-9544-z","title":"Shorthand Universal Cycles for Permutations","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":41,"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 Victoria","funders":"","keywords":"Combinatorics; Substring; Mathematics; Lexicographical order; Permutation (music); Parity of a permutation; Discrete mathematics; Symmetric group; Set (abstract data type); Cyclic permutation; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04240240890345279,"gpt":0.2506469803726523,"spread":0.2082445714691995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007858857,0.00009908142,0.00009848002,0.00007074731,0.0001887953,0.00005522967,0.0006092897,0.00004572646,0.00003692563],"category_scores_gemma":[0.00001313279,0.00008871965,0.00005932459,0.0001420834,0.00003982614,0.0005577648,0.0001839324,0.00005732662,0.00003543979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001667017,"about_ca_system_score_gemma":0.00004841726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005498476,"about_ca_topic_score_gemma":0.000004627355,"domain_scores_codex":[0.9992329,0.00001682802,0.0001234666,0.0002937502,0.000118481,0.0002145961],"domain_scores_gemma":[0.9993453,0.00005759951,0.00004306178,0.0003850962,0.00007766714,0.00009126571],"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.00002364644,0.0002666427,0.0002572573,0.00001564504,0.00006683003,0.00004228802,0.00342602,0.00001799669,0.0005447181,0.395333,0.009546082,0.5904599],"study_design_scores_gemma":[0.001987345,0.000596815,0.01191792,0.00005229567,0.00006075513,0.00008659436,0.000487371,0.7543445,0.01595194,0.1194236,0.09404319,0.001047615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001865341,0.00005357702,0.994503,0.0001364179,0.0003058167,0.0001634299,0.00003839869,0.0001495729,0.002784511],"genre_scores_gemma":[0.2688384,0.00001189159,0.7303163,0.0001465926,0.0001471233,0.00003636631,0.00003923215,0.00001430023,0.0004497323],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7543265,"threshold_uncertainty_score":0.3617882,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008126942","doi":"10.1007/s00453-001-0039-1","title":"On-Line Competitive Algorithms for Call Admission in Optical Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","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 Toronto","funders":"","keywords":"Theory of computation; Computer science; Logarithm; Network topology; Competitive analysis; Telecommunications network; Line (geometry); Algorithm; Computer network; Mathematics; Upper and lower bounds","retraction":null,"screen_n_in":null,"score":{"opus":0.03568695878688269,"gpt":0.311284834257148,"spread":0.2755978754702653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003539039,0.0001563093,0.0002018064,0.0001451843,0.0001026236,0.0001003542,0.0005376295,0.0001107388,0.00004174661],"category_scores_gemma":[0.0001143656,0.0001398666,0.00006720279,0.0004759754,0.0000476908,0.0002097879,0.0001459863,0.0002446227,0.00003897584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006794401,"about_ca_system_score_gemma":0.00007151971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001215185,"about_ca_topic_score_gemma":0.000007211533,"domain_scores_codex":[0.9984811,0.0000636394,0.0002795306,0.0004502888,0.0002533139,0.000472135],"domain_scores_gemma":[0.9988772,0.0003870048,0.00004673821,0.0003257844,0.0001318752,0.0002314026],"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.00009655642,0.0007015927,0.00006439104,0.00001199341,0.00002476749,0.0001332901,0.0003203342,0.1754716,0.00003034174,0.3594545,0.003733158,0.4599575],"study_design_scores_gemma":[0.001079345,0.0003905645,0.0001137025,0.00004012105,0.000001817556,0.00001478206,0.00001164065,0.9833426,0.0001048952,0.003440867,0.01128081,0.0001788194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001379453,0.0000357242,0.9914486,0.003466199,0.0002737164,0.0004482094,0.000003851159,0.0001163348,0.004069372],"genre_scores_gemma":[0.1773255,0.0001982121,0.8151641,0.003543202,0.0004653259,0.0001988801,0.00007560979,0.00004654169,0.002982586],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8078711,"threshold_uncertainty_score":0.5703593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060429191","doi":"10.1007/s00453-008-9192-0","title":"Random Matrices and Codes for the Erasure Channel","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Error Correcting Code Techniques","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 Toronto","funders":"","keywords":"Decoding methods; List decoding; Mathematics; Erasure; Overhead (engineering); Discrete mathematics; Algorithm; Computer science; Block code; Concatenated error correction code","retraction":null,"screen_n_in":null,"score":{"opus":0.0217023613800945,"gpt":0.2532438025626427,"spread":0.2315414411825482,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003536174,0.0001071605,0.0001373851,0.00005151977,0.0003822809,0.00006449113,0.0005926642,0.00004736162,0.00000118901],"category_scores_gemma":[0.00009693545,0.00007248582,0.00005285845,0.0001861487,0.00007566795,0.0001794386,0.0001455431,0.00009936292,0.000004095322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001133088,"about_ca_system_score_gemma":0.00002860739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005799245,"about_ca_topic_score_gemma":0.000007249826,"domain_scores_codex":[0.9992404,0.00003498479,0.0001258835,0.0002541821,0.0001437601,0.0002008013],"domain_scores_gemma":[0.9986866,0.000786515,0.00006225721,0.0003442754,0.00008045018,0.00003995293],"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.0001552331,0.0002156955,0.001083422,0.0001141247,0.0002644483,0.00008321503,0.01383351,0.0001049273,0.001952195,0.01251701,0.1005876,0.8690886],"study_design_scores_gemma":[0.002812081,0.0004632634,0.003269911,0.00006883797,0.0000604371,0.0009259043,0.0001732154,0.9071824,0.0267435,0.01916932,0.03832727,0.0008038564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003778162,0.001612867,0.9910177,0.00219318,0.0003076176,0.0003948963,0.000003740122,0.0004577097,0.0002341551],"genre_scores_gemma":[0.7098042,0.0004499683,0.2884648,0.0004903827,0.0002339636,0.000163894,0.000001157205,0.00001737302,0.0003742785],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9070775,"threshold_uncertainty_score":0.2955886,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978321932","doi":"10.1007/s00453-004-1093-2","title":"An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","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":"McGill University","funders":"","keywords":"Theory of computation; Minification; Constant (computer programming); Algorithm; Mathematics; Running time; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Mathematical optimization; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01570207297804851,"gpt":0.272842290635547,"spread":0.2571402176574985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000250166,0.0001569729,0.0001542454,0.0001525055,0.0004547705,0.0005824783,0.0003691264,0.00008093847,0.000007696576],"category_scores_gemma":[0.00007853617,0.000159393,0.00008198352,0.0004792642,0.0000431499,0.0005547781,0.0000424309,0.00007626771,0.00001753342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000885485,"about_ca_system_score_gemma":0.0002135808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002065033,"about_ca_topic_score_gemma":0.000002185379,"domain_scores_codex":[0.9986004,0.00003950743,0.0002853427,0.0004877845,0.0002695754,0.000317406],"domain_scores_gemma":[0.9990287,0.0001847311,0.0001057586,0.0003438197,0.0002111543,0.000125785],"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.000006316502,0.0002819901,0.000002075195,0.000005881539,0.00001585292,0.000004347377,0.0006153013,0.3112785,0.002125266,0.005504111,0.0001336701,0.6800267],"study_design_scores_gemma":[0.0009499291,0.0001725185,0.0002401494,0.000013387,0.000009677368,0.00002023031,0.00001638774,0.9571794,0.03167848,0.008208467,0.001294879,0.0002165441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02430565,0.00006022948,0.9740539,0.0003802018,0.0006082568,0.0003544787,0.00001441446,0.0001756746,0.00004725581],"genre_scores_gemma":[0.2136779,0.000001024247,0.7855846,0.0002889029,0.0002243731,0.00004932866,0.00009404208,0.0000121363,0.0000677445],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6798102,"threshold_uncertainty_score":0.6499859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065769146","doi":"10.1007/s00453-001-0015-9","title":"Structural Lines, TINs, and DEMs","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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 British Columbia","funders":"","keywords":"Triangulated irregular network; Triangulation; Digital elevation model; Initialization; Terrain; Curvature; Surface (topology); Elevation (ballistics); Geometry; Computer science; Algorithm; Mathematics; Geodesy; Geology; Remote sensing; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.01326208031414038,"gpt":0.2392971103008179,"spread":0.2260350299866775,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006890105,0.0000637124,0.00005927893,0.00005459064,0.00009750829,0.00008383198,0.0001605387,0.00002654798,0.00001200681],"category_scores_gemma":[0.00001539896,0.00005799692,0.00001606269,0.0002386118,0.00001571054,0.000239006,0.00008229188,0.00004926712,0.00002138792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008536256,"about_ca_system_score_gemma":0.00002178795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000117382,"about_ca_topic_score_gemma":0.000002928427,"domain_scores_codex":[0.9994693,0.00001714375,0.00009464724,0.000187835,0.0001160771,0.0001150034],"domain_scores_gemma":[0.9997028,0.00003937749,0.00002599858,0.0001282398,0.00004614549,0.00005750051],"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.000002569804,0.00001070649,0.0006878598,0.000002873785,0.000009852115,0.00001717629,0.0001296576,0.000436562,0.0006799839,0.02696721,0.001107816,0.9699478],"study_design_scores_gemma":[0.0003497567,0.00006321674,0.02435783,0.000004983745,0.00000438348,0.0002942225,0.000007188145,0.9061903,0.001311255,0.01639873,0.05081424,0.0002038938],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3273375,0.0005225231,0.6688105,0.001807894,0.000483202,0.00008015313,0.000001539767,0.0001197763,0.0008369063],"genre_scores_gemma":[0.8884363,0.00003734533,0.1100283,0.0004632457,0.0003578188,0.000003748478,0.00001141161,0.000004022044,0.000657815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9697438,"threshold_uncertainty_score":0.2365046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3021716813","doi":"10.1007/s00453-009-9293-4","title":"Computing the Greedy Spanner in Near-Quadratic Time","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Society for the Study of School Psychology","keywords":"Spanner; Greedy algorithm; Combinatorics; Dimension (graph theory); Logarithm; Mathematics; Time complexity; Running time; Upper and lower bounds; Bounded function; Quadratic equation; Binary logarithm; Metric space; Metric (unit); Euclidean space; Discrete mathematics; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.006244191694777135,"gpt":0.2270014671969099,"spread":0.2207572755021327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003330032,0.00009367846,0.0001010017,0.00006893509,0.0001755456,0.0001936482,0.0004718193,0.00003306638,0.00001503128],"category_scores_gemma":[0.00003255295,0.00007121839,0.00003826012,0.0006706485,0.00002492363,0.0002315648,0.00007447566,0.0001274671,0.0002069465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000270848,"about_ca_system_score_gemma":0.00006201203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001300006,"about_ca_topic_score_gemma":0.000002442654,"domain_scores_codex":[0.9990751,0.00007658165,0.0001954208,0.0002350879,0.0002124333,0.0002053468],"domain_scores_gemma":[0.9994645,0.0001300766,0.00005110231,0.0002655897,0.00004762104,0.00004118239],"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.000003791679,0.0001248682,0.00006387047,0.000002753462,0.000009938166,0.00002976679,0.001245265,0.0343934,0.001048699,0.02426555,0.002832926,0.9359792],"study_design_scores_gemma":[0.0001762105,0.00005935538,0.01147731,0.000008634046,0.00000194057,0.00002431515,0.000005683263,0.9762887,0.0004057683,0.00917013,0.00227601,0.000105985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09516205,0.0001807879,0.8886181,0.0126002,0.0003641856,0.0002525567,8.783066e-7,0.0001474691,0.002673785],"genre_scores_gemma":[0.9286699,0.000001339829,0.06908312,0.001644224,0.0001974028,0.000002098122,0.000006046334,0.000003702557,0.0003921305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9418952,"threshold_uncertainty_score":0.2904202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1589676939","doi":"10.1007/s00453-002-0972-7","title":"Linking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement?","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Quantum entanglement; Classical capacity; Quantum; Quantum information; Quantum channel; Quantum capacity; Quantum teleportation; No-teleportation theorem; Computer science; Alice and Bob; Key (lock); Amplitude damping channel; Theoretical computer science; Quantum mechanics; Mathematics; Quantum network; Physics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01998562375341762,"gpt":0.2402538119730662,"spread":0.2202681882196486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000184499,0.0002087387,0.0002063317,0.00021904,0.0002610473,0.0004561529,0.0006162574,0.00009376097,0.0003414759],"category_scores_gemma":[0.00001245375,0.0001856453,0.0001066441,0.0006267928,0.00009149197,0.0005272568,0.000309206,0.000215349,0.0005548559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000039329,"about_ca_system_score_gemma":0.0000165851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007446458,"about_ca_topic_score_gemma":0.000006951293,"domain_scores_codex":[0.998222,0.00005245893,0.0003695198,0.0004127441,0.0004892299,0.0004540569],"domain_scores_gemma":[0.9990047,0.00006263753,0.00009099893,0.0004701582,0.00006712895,0.0003044266],"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.00001134826,0.0003319834,0.00140801,0.00003858083,0.0001189694,0.00005193832,0.008958439,0.000003410928,0.0002568127,0.442665,0.08085497,0.4653006],"study_design_scores_gemma":[0.0009030655,0.0004468153,0.003171059,0.00006312405,0.00002013875,0.00004109156,0.0002211282,0.4605979,0.0005978768,0.01341216,0.5199952,0.000530504],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1233136,0.001084315,0.7905698,0.05394295,0.001075747,0.0008246342,0.00004142171,0.0005732576,0.02857423],"genre_scores_gemma":[0.9622564,0.0001237182,0.02731279,0.009505207,0.0002349818,0.00003924636,0.000008099332,0.00001749958,0.0005020846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8389428,"threshold_uncertainty_score":0.7570397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023624817","doi":"10.1007/s00453-010-9469-y","title":"Approximability of the Firefighter Problem","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":37,"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":"Kempe Foundation","keywords":"Theory of computation; Computer science; Combinatorics; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.008076166490145996,"gpt":0.1912632363978393,"spread":0.1831870699076933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002823898,0.00009170781,0.00009609436,0.00004383589,0.0001014039,0.00003704388,0.0003572429,0.00004136513,0.001133424],"category_scores_gemma":[0.00005943373,0.00006096376,0.00008483621,0.0003079381,0.00009838123,0.0002619492,0.0002037449,0.000140537,0.0002746689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006059145,"about_ca_system_score_gemma":0.00001059868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006386493,"about_ca_topic_score_gemma":0.0002711341,"domain_scores_codex":[0.9992327,0.000005713447,0.0002266884,0.0001839976,0.0002043617,0.0001465124],"domain_scores_gemma":[0.9993439,0.000007670633,0.00006107093,0.000465191,0.0001159216,0.000006271562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005319646,0.001486014,0.0443839,0.001516903,0.0001506662,0.00000148905,0.0003643082,0.0002262509,0.01040787,0.5508108,0.08787049,0.3027282],"study_design_scores_gemma":[0.0004349246,0.000005666807,0.08328273,0.00001549829,0.00005077669,5.583129e-7,0.00007579062,0.02224439,0.00171632,0.02014871,0.871751,0.0002736266],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.825973,0.00001523844,0.001043469,0.01101026,0.00231191,0.0009115615,0.00000674062,0.0001686161,0.1585592],"genre_scores_gemma":[0.9964449,4.915368e-7,0.001164528,0.0007676254,0.0002892595,0.00002760148,0.000006327739,0.000008212311,0.001291069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7838805,"threshold_uncertainty_score":0.9997797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089845008","doi":"10.1007/s00453-015-9982-0","title":"Anonymous Meeting in Networks","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"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":"Node (physics); Computer science; Theory of computation; Deterministic algorithm; Upper and lower bounds; Time complexity; Algorithm; Construct (python library); Existential quantification; Theoretical computer science; Mathematics; Discrete mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0283711810022501,"gpt":0.2560131383583552,"spread":0.2276419573561051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004522248,0.00006190976,0.00008138754,0.0000792361,0.00003039298,0.00009300731,0.0004246492,0.00004099846,0.000006098369],"category_scores_gemma":[0.00005255019,0.00005911989,0.00001673051,0.0004425563,0.00001740654,0.0002553967,0.0001717346,0.0001168673,0.00005191279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003659708,"about_ca_system_score_gemma":0.00006222107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005862235,"about_ca_topic_score_gemma":0.00001283828,"domain_scores_codex":[0.9991813,0.00006877742,0.0001399777,0.0001938729,0.0001727643,0.0002433553],"domain_scores_gemma":[0.9995134,0.00003853846,0.00002819077,0.0002273045,0.0000670942,0.0001254272],"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.000009685884,0.0002256744,0.00246202,0.000008543024,0.00001651696,0.000168241,0.003286301,0.4023358,0.00004311292,0.04625153,0.01788076,0.5273118],"study_design_scores_gemma":[0.0002992301,0.00003036375,0.0001003359,0.000007867326,3.507006e-7,0.000006630535,0.00002256558,0.9931725,0.00004614261,0.001495655,0.004736642,0.00008172021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000450756,0.0001513903,0.9789221,0.001161049,0.0002523651,0.0001051404,2.079909e-7,0.0001321176,0.01882489],"genre_scores_gemma":[0.5088516,0.00002801866,0.4887587,0.001165529,0.0001836426,0.00002330812,0.000005009703,0.00001528313,0.0009688363],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5908366,"threshold_uncertainty_score":0.2410839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987966922","doi":"10.1007/s00453-001-0043-5","title":"All-to-All Optical Routing in Chordal Rings of Degree 4","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optical Network Technologies","field":"Engineering","cited_by":37,"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":"Chordal graph; Degree (music); Theory of computation; Routing (electronic design automation); Computer science; Mathematics; Combinatorics; Computer network; Algorithm; Physics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02399159042280458,"gpt":0.2442627159242618,"spread":0.2202711255014572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001351042,0.0001565703,0.0002471631,0.0001426541,0.00001118121,0.0000151775,0.0003091387,0.0001579502,0.00002627989],"category_scores_gemma":[0.0001235234,0.0001621787,0.00004636115,0.000401725,0.00005319603,0.00007543419,0.0001379103,0.0003088117,0.00007984728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007658618,"about_ca_system_score_gemma":0.000005949564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002914613,"about_ca_topic_score_gemma":0.00002226069,"domain_scores_codex":[0.9988313,0.000007386285,0.0003114632,0.0001982662,0.0001588682,0.0004926773],"domain_scores_gemma":[0.9994963,0.0001053616,0.00001705276,0.0002725408,0.0000217431,0.00008704996],"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.00007012011,0.000288307,0.01821426,0.0001168086,0.000273102,0.000467042,0.0006569203,0.04065578,0.01698525,0.03651266,0.003267225,0.8824925],"study_design_scores_gemma":[0.00161098,0.0003628112,0.05620955,0.0002878786,0.00006740065,0.000106869,0.0003457106,0.888338,0.02799773,0.003949327,0.01939679,0.001326929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9762641,0.00008547357,0.0106866,0.000658481,0.0001798965,0.0001902451,0.000002630741,0.0006881792,0.01124438],"genre_scores_gemma":[0.9083318,0.0000417376,0.09139745,0.00007787924,0.00007565109,0.00001411658,0.000002098755,0.00003289992,0.0000264339],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8811656,"threshold_uncertainty_score":0.6613455,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967767406","doi":"10.1007/s00453-011-9496-3","title":"Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; École de Technologie Supérieure; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Asynchronous communication; Topology (electrical circuits); Node (physics); Network topology; Theoretical computer science; Combinatorics; Discrete mathematics; Mathematics; Computer network; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03662411861360209,"gpt":0.2460601860938201,"spread":0.209436067480218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003551142,0.0001346793,0.0001484051,0.0002646458,0.00009007357,0.0001235414,0.0007242934,0.00005598141,0.00004896311],"category_scores_gemma":[0.00001093764,0.0001155686,0.00003335443,0.0007825419,0.0001314556,0.0005504839,0.0002273403,0.0002324009,0.0000837958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003177748,"about_ca_system_score_gemma":0.00009296255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002553586,"about_ca_topic_score_gemma":0.00003679149,"domain_scores_codex":[0.9985373,0.0000945416,0.0001852106,0.0004004611,0.0003216195,0.0004608385],"domain_scores_gemma":[0.9992704,0.00004092491,0.00003745799,0.0004115786,0.0001047788,0.0001348047],"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.0002576734,0.002426171,0.0203572,0.0002587347,0.0003070821,0.001949916,0.1214331,0.1106039,0.001610225,0.2488809,0.002544451,0.4893707],"study_design_scores_gemma":[0.001282273,0.0005099066,0.005829547,0.0001016725,0.000005230951,0.00003275378,0.0006168342,0.985168,0.004193532,0.001166081,0.0005824822,0.0005116942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05194985,0.00006768494,0.9360021,0.0004589652,0.00007923158,0.0003438392,0.000002369306,0.0002078066,0.01088811],"genre_scores_gemma":[0.4396808,0.00003711093,0.5595959,0.000213215,0.00002667484,0.00002231629,0.000004358974,0.00001987815,0.0003997433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8745641,"threshold_uncertainty_score":0.471275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139322641","doi":"10.1007/s00453-002-0978-1","title":"Sharp Quantum versus Classical Query Complexity Separations","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"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":"Simple (philosophy); Noncommutative geometry; Quantum complexity theory; Mathematics; Quantum algorithm; Quantum; Theory of computation; Bounded function; Polynomial; Fourier transform; Quantum Fourier transform; Discrete mathematics; Algorithm; Quantum error correction; Pure mathematics; Quantum mechanics; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05649716913227652,"gpt":0.2721984185858378,"spread":0.2157012494535613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001655137,0.000265736,0.0002761877,0.0001311327,0.0004534956,0.0002708313,0.001168236,0.0001122228,0.0001484374],"category_scores_gemma":[0.00006166148,0.0002454842,0.0001684505,0.0005913538,0.0001835009,0.0003016618,0.0004076267,0.0004454217,0.0005749934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005565028,"about_ca_system_score_gemma":0.00003835446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000319437,"about_ca_topic_score_gemma":0.00001246873,"domain_scores_codex":[0.9978848,0.000119612,0.000333689,0.0006572817,0.0004246703,0.0005799702],"domain_scores_gemma":[0.9984415,0.0002940971,0.0001009649,0.0008364773,0.00008422491,0.0002427619],"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.00002188635,0.0006507663,0.00003351756,0.00001988285,0.0001308934,0.0001650949,0.001493568,0.001570857,0.0002270776,0.5991063,0.06604583,0.3305343],"study_design_scores_gemma":[0.0006287274,0.0001798864,0.0004802723,0.00001030227,0.00000840562,0.00004882452,0.00001010903,0.9448655,0.000103575,0.00758643,0.04576071,0.0003172273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02514231,0.0003804601,0.9344962,0.02595292,0.003393438,0.0003241688,0.00003464587,0.001401686,0.008874169],"genre_scores_gemma":[0.809644,0.00001419504,0.1878433,0.0007408838,0.0008698537,0.00002426302,0.00001379122,0.0000338448,0.0008158162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9432946,"threshold_uncertainty_score":0.9999998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W98190632","doi":"10.1007/s00453-003-1018-5","title":"Multicast Pull Scheduling: When Fairness Is Fine","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","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":"York University","funders":"","keywords":"Computer science; Multicast; Unicast; Scheduling (production processes); Computer network; Distributed computing; Competitive analysis; Approximation algorithm; Parallel computing; Algorithm; Mathematical optimization; Upper and lower bounds; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02439670081495226,"gpt":0.2598636974486351,"spread":0.2354669966336828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002627719,0.0001298309,0.0001355554,0.00008921467,0.0001348916,0.0001914906,0.0005906733,0.00006603821,0.0003930113],"category_scores_gemma":[0.0001051015,0.0001207101,0.00005475723,0.0003240176,0.00004660517,0.0003619666,0.0001259711,0.0001571643,0.0006197652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000256121,"about_ca_system_score_gemma":0.00008376113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001317853,"about_ca_topic_score_gemma":0.000001589168,"domain_scores_codex":[0.9986951,0.0000813308,0.0002007937,0.0003834466,0.000285194,0.0003541522],"domain_scores_gemma":[0.999054,0.00005942712,0.00004715906,0.0005140632,0.0001554942,0.0001698635],"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.00000929311,0.0008088188,0.0006254005,0.00005871537,0.0001282489,0.0001294965,0.006939395,0.004198412,0.001101968,0.5542776,0.01913022,0.4125924],"study_design_scores_gemma":[0.0008318786,0.00007603442,0.00006870527,0.00001737321,0.00000500604,0.00004658143,0.00004120799,0.8748618,0.006249796,0.01127043,0.1061873,0.0003438458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000386855,0.00009360493,0.9861565,0.003274118,0.0002561272,0.0001674588,0.000003850191,0.0001731553,0.009488311],"genre_scores_gemma":[0.1070411,0.00001663478,0.8881649,0.001183097,0.00005453116,0.00002154303,0.000005654853,0.00001686606,0.003495657],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8706634,"threshold_uncertainty_score":0.7966034,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010561968","doi":"10.1007/s00453-009-9357-5","title":"Crossing Number and Weighted Crossing Number of Near-Planar Graphs","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":32,"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":"Crossing number (knot theory); Combinatorics; Planar graph; Mathematics; Planar; Book embedding; Theory of computation; Graph; Discrete mathematics; 1-planar graph; Line graph; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01015910372001161,"gpt":0.271349627299671,"spread":0.2611905235796594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001713007,0.0001202106,0.0001546903,0.00005031627,0.0004969345,0.0007129096,0.0002067107,0.00006155238,0.00002562682],"category_scores_gemma":[0.0000158003,0.0001180787,0.00004947224,0.0005238831,0.0001545779,0.0004618865,0.00004186116,0.00009390765,0.00002734294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001460081,"about_ca_system_score_gemma":0.0001106435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002847314,"about_ca_topic_score_gemma":0.000001055317,"domain_scores_codex":[0.9989771,0.00003947302,0.000246772,0.0002968851,0.0002360879,0.0002036718],"domain_scores_gemma":[0.9994102,0.00007179363,0.0001011476,0.0002130618,0.000121322,0.00008244818],"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.00002216195,0.0001963695,0.004911303,0.00002436686,0.00004586497,0.0000369245,0.002304585,0.0002080658,0.00844357,0.09196893,0.001614599,0.8902233],"study_design_scores_gemma":[0.001920209,0.0001825005,0.1317202,0.0001241489,0.00003854586,0.0007019907,0.00003695425,0.5523027,0.02950655,0.2547165,0.0278389,0.0009108656],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6453938,0.0001012581,0.352239,0.000399722,0.000216823,0.00007566701,0.000003984995,0.00007782198,0.001491842],"genre_scores_gemma":[0.7292034,0.000002323789,0.2701665,0.0004520826,0.00006741486,0.000001199044,0.000006180165,0.000004392556,0.00009644769],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8893124,"threshold_uncertainty_score":0.6874604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037328176","doi":"10.1007/s00453-001-0017-7","title":"On Rooted Node-Connectivity Problems","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"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":"Theory of computation; Computer science; Node (physics); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02023012807082956,"gpt":0.2773567718637909,"spread":0.2571266437929613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003801896,0.0001544051,0.0001563225,0.0001728478,0.0001748361,0.00009030497,0.001005496,0.000064562,0.00005091058],"category_scores_gemma":[0.0001435916,0.0001398778,0.00006886663,0.0008661941,0.00007679983,0.0004169322,0.0002513802,0.0002924262,0.0004653322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006134771,"about_ca_system_score_gemma":0.00004037758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002140337,"about_ca_topic_score_gemma":0.00000708293,"domain_scores_codex":[0.9983023,0.0001273977,0.0001487197,0.000532879,0.0003920583,0.0004966497],"domain_scores_gemma":[0.9985057,0.0003437613,0.00004873354,0.0008671304,0.00009174286,0.0001429013],"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.00004526258,0.0004172666,0.0004406927,0.00001166546,0.00004311909,0.0001895574,0.0003010919,0.001500645,0.002685381,0.4758793,0.001165684,0.5173203],"study_design_scores_gemma":[0.001078404,0.0004681326,0.00314084,0.00004401359,0.000003952008,0.0001214669,0.00001126488,0.1818571,0.008096508,0.7877423,0.0168798,0.0005561797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04360359,0.00005479241,0.9434397,0.001665178,0.000230228,0.0002840093,0.000002673786,0.0004089956,0.01031085],"genre_scores_gemma":[0.9611113,0.00001657095,0.03700405,0.0004945376,0.00009309709,0.00005617919,0.000002680479,0.00002360259,0.001197956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9175077,"threshold_uncertainty_score":0.5981058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999576733","doi":"10.1007/s00453-007-9045-2","title":"Maximum Induced Matchings for Chordal Graphs in Linear Time","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","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":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Indifference graph; Split graph; Maximal independent set; Treewidth; Discrete mathematics; Pathwidth; Bipartite graph; Time complexity; Cograph; Line graph; Graph; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01783560561319089,"gpt":0.3055982628954908,"spread":0.2877626572822999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001384163,0.0001637388,0.000203583,0.0004349059,0.0001072833,0.00005226429,0.001085411,0.0001047718,0.00001368268],"category_scores_gemma":[0.000109441,0.0001623041,0.00009482504,0.0009591724,0.00006078025,0.0004319873,0.0002556198,0.0003087651,0.0001247326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005818768,"about_ca_system_score_gemma":0.00005169296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002436645,"about_ca_topic_score_gemma":0.000009117981,"domain_scores_codex":[0.9981343,0.00004884093,0.0002960596,0.0004886855,0.0003181635,0.0007139097],"domain_scores_gemma":[0.9987393,0.0004153989,0.00006246373,0.0005304934,0.00009811141,0.0001542214],"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.000184815,0.0003272443,0.0003485221,0.0000363652,0.00004627964,0.00015915,0.00131693,0.00004165045,0.05047625,0.1489381,0.0006395783,0.7974851],"study_design_scores_gemma":[0.001897512,0.0004255852,0.002211385,0.00003606268,0.000004172838,0.00004462155,0.00005162132,0.06121323,0.04902981,0.8779799,0.006509786,0.0005962882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1225253,0.00004126309,0.8748266,0.0006450799,0.0003002139,0.0005473312,0.000006328886,0.0001915467,0.0009163785],"genre_scores_gemma":[0.3129738,0.000006112411,0.6853805,0.0005472939,0.000195574,0.0000749817,0.00001157894,0.00005217653,0.0007580553],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7968888,"threshold_uncertainty_score":0.6618568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963550906","doi":"10.1007/s00453-017-0275-7","title":"Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear programming relaxation; Combinatorics; Relaxation (psychology); Theory of computation; Tree (set theory); Approximation algorithm; Integer programming; Integer (computer science); Discrete mathematics; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.08491445882408623,"gpt":0.3916150911468806,"spread":0.3067006323227944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004967726,0.000245354,0.0003242779,0.0001513968,0.001554135,0.0002301304,0.0004616872,0.0001244548,0.0001445896],"category_scores_gemma":[0.0009248133,0.0002329867,0.00006928364,0.0001416104,0.0002167146,0.0006459405,0.0004644614,0.0002862413,0.00004090753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008200858,"about_ca_system_score_gemma":0.00006087979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004543575,"about_ca_topic_score_gemma":0.00001775526,"domain_scores_codex":[0.9980243,0.00008093198,0.0004637402,0.0004725711,0.0005028829,0.0004556136],"domain_scores_gemma":[0.9981675,0.0002398808,0.0004200791,0.0008417377,0.0001934836,0.0001373146],"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.00005309503,0.0003602957,0.0001848085,0.0001937801,0.0001808443,0.00004114388,0.002182124,0.00003137174,0.000728535,0.02493116,0.006211155,0.9649017],"study_design_scores_gemma":[0.003941186,0.0003624261,0.0004050306,0.0001941211,0.0001231419,0.00009934319,0.0007844249,0.7659456,0.009667406,0.2030632,0.01431103,0.001103122],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01584217,0.0001375906,0.9587885,0.002088949,0.0005452518,0.001595202,0.00004942852,0.0004763498,0.02047657],"genre_scores_gemma":[0.01528873,0.00009143356,0.9769698,0.00009653403,0.0004876823,0.0001973234,0.00004694934,0.00009563359,0.006725874],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9637986,"threshold_uncertainty_score":0.9997457,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139596748","doi":"10.1007/s00453-006-1217-y","title":"FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":30,"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":"Parallel computing; Computer science; Algorithm; Linear space; Parallel algorithm; Sequence (biology); Smith–Waterman algorithm; Space (punctuation); Theory of computation; Dynamic programming; Mathematics; Sequence alignment; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01417743984069811,"gpt":0.2535281535787954,"spread":0.2393507137380973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001100325,0.0002164381,0.0001904735,0.00002789581,0.0001529344,0.00002840353,0.0001314594,0.0001203888,0.000004103237],"category_scores_gemma":[0.000008830112,0.0002100948,0.00009567433,0.00004653751,0.000128743,0.000001234695,0.0001480802,0.00005053091,0.000004069214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001509377,"about_ca_system_score_gemma":0.00004623571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001055909,"about_ca_topic_score_gemma":0.00002550075,"domain_scores_codex":[0.9988399,0.00002327504,0.000213688,0.0004640505,0.0001056406,0.0003534839],"domain_scores_gemma":[0.9995193,0.000016127,0.00007375227,0.0002314633,0.0000848407,0.00007450031],"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.00007086909,0.0001679743,0.0006602378,0.00003577431,0.0003050747,0.00001219201,0.00008348962,0.0004590222,0.8420986,0.001164779,0.008090957,0.146851],"study_design_scores_gemma":[0.005281846,0.001673973,0.003864632,0.00003081701,0.000230995,0.0001744185,0.0002728013,0.03594224,0.3690242,0.00637406,0.5754793,0.001650775],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.412436,0.005249903,0.5769714,0.001084725,0.0006378041,0.001293608,0.000819414,0.00002833358,0.00147888],"genre_scores_gemma":[0.6772271,0.0004987566,0.3164337,0.0003440343,0.001799777,0.0002537261,0.0003143337,0.00006375911,0.003064833],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5673883,"threshold_uncertainty_score":0.8567416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}