{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":59,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":59,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"99cd3cdc1891","filters":{"venue":"Symposium on Discrete Algorithms"}},"results":[{"id":"W2044014345","doi":"10.5555/1109557.1109599","title":"Rank/select operations on large alphabets: a tool for text indexing","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":190,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Search engine indexing; Rank (graph theory); Generalization; String (physics); Variety (cybernetics); Computer science; Representation (politics); Alphabet; Combinatorics; Binary number; Binary search algorithm; Theoretical computer science; Mathematics; Algorithm; Information retrieval; Search algorithm; Artificial intelligence; Arithmetic","authors":[{"name":"Alexander Golynski","is_ca":true},{"name":"J. Ian Munro","is_ca":true},{"name":"Srinivasa Rao Satti","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008969900852929844,"gpt":0.2570800764681503,"spread":0.2481101756152204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002363927,0.001021335,0.002107982,0.003032393,0.00180413,0.003434257,0.002587882,0.001668756,0.01217717],"category_scores_gemma":[0.01411651,0.0007839616,0.001193491,0.006319441,0.00231729,0.01096172,0.003957884,0.002788253,0.006487657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008916512,"about_ca_system_score_gemma":0.001141498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001078952,"about_ca_topic_score_gemma":0.001317115,"domain_scores_codex":[0.9970132,0.0007469373,0.0002934503,0.0004142309,0.001256807,0.0002754564],"domain_scores_gemma":[0.9888911,0.005473206,0.0008113441,0.003783085,0.0006370175,0.0004041524],"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.00143034,0.0003781518,0.0009315339,0.0005660021,0.00006503077,0.0004189219,0.0007347135,0.0274776,0.02722242,0.2494606,0.04653882,0.6447759],"study_design_scores_gemma":[0.0003437469,0.0005862836,0.0003558938,0.0001338802,0.00008465488,0.001066283,0.0003907521,0.3593096,0.04160917,0.5429303,0.05304059,0.000148868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01379317,0.0005632254,0.971505,0.0008138574,0.0001359699,0.0001851048,0.0006931847,0.007931639,0.004378889],"genre_scores_gemma":[0.138229,0.0008171932,0.8487861,0.0005436876,0.0004914076,0.0005092109,0.001770376,0.0009471759,0.007905838],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01217717,"threshold_uncertainty_score":0.04073668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081869611","doi":"10.5555/1070432.1070548","title":"An optimal Bloom filter replacement","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bloom filter; Hash function; Data structure; Set (abstract data type); Computer science; Element (criminal law); Representation (politics); Amortized analysis; Filter (signal processing); Algorithm; Theoretical computer science; Function (biology); Perfect hash function; Constant (computer programming); Bloom; Hash table","authors":[{"name":"Anna Pagh","is_ca":false},{"name":"Rasmus Pagh","is_ca":false},{"name":"Srinivasa Rao Satti","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01162427078857109,"gpt":0.2517560130831717,"spread":0.2401317422946007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001768647,0.0005317471,0.001867851,0.001332848,0.001308259,0.001904687,0.00266751,0.001707671,0.006359504],"category_scores_gemma":[0.009030839,0.0005678842,0.0008486381,0.002339755,0.0009159445,0.00551276,0.002124021,0.000928383,0.001949231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002121991,"about_ca_system_score_gemma":0.003265819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00230383,"about_ca_topic_score_gemma":0.002465424,"domain_scores_codex":[0.9975826,0.0005144984,0.0001942672,0.0004757983,0.0008811231,0.0003516971],"domain_scores_gemma":[0.9964348,0.0009133545,0.0001973874,0.001763207,0.0005334082,0.0001577904],"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.001701208,0.0005419982,0.004577326,0.0004187148,0.0001250543,0.0003478701,0.000587506,0.05827909,0.02765386,0.209156,0.03307498,0.6635363],"study_design_scores_gemma":[0.0004346255,0.0005836484,0.001035868,0.0001598012,0.0001477173,0.00150692,0.0003430552,0.7292411,0.02983285,0.1588823,0.0777438,0.00008838976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07107142,0.00180072,0.9075099,0.00172339,0.0003736129,0.0003150904,0.0008269556,0.002690357,0.01368864],"genre_scores_gemma":[0.304873,0.0008154564,0.6775182,0.0007263798,0.000213965,0.0003324379,0.000981561,0.0002841405,0.01425486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006359504,"threshold_uncertainty_score":0.02127469,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395489635","doi":"10.5555/2627817.2627898","title":"Dynamic graph connectivity in polylogarithmic worst case time","year":2013,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Time complexity; Binary logarithm; Amortized analysis; Computer science; Graph; Enhanced Data Rates for GSM Evolution; Preprocessor; Upper and lower bounds; Data structure; Matching (statistics); Discrete mathematics; Path (computing); Sequence (biology); Mathematics; Algorithm","authors":[{"name":"Bruce M. Kapron","is_ca":true},{"name":"Valerie King","is_ca":true},{"name":"Ben Mountjoy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006188313789722419,"gpt":0.2324596412625818,"spread":0.2262713274728593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004080792,0.002595172,0.002303372,0.002347942,0.002249417,0.007816906,0.005159807,0.003523184,0.01337869],"category_scores_gemma":[0.03013197,0.001692713,0.002158162,0.006499964,0.003049057,0.01665812,0.00383205,0.004548382,0.00316349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006602376,"about_ca_system_score_gemma":0.006585269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006565151,"about_ca_topic_score_gemma":0.01251666,"domain_scores_codex":[0.9867727,0.002207658,0.0008988484,0.003066849,0.004694249,0.002359725],"domain_scores_gemma":[0.9613441,0.02590123,0.002592353,0.00735708,0.001795588,0.00100964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004730037,0.00111542,0.008050062,0.001990333,0.0005228723,0.0009491391,0.00114897,0.4652947,0.03721242,0.0889868,0.0668744,0.3231249],"study_design_scores_gemma":[0.0007033346,0.0002883788,0.001412825,0.0001267993,0.0002802556,0.001072372,0.0004795809,0.7546094,0.01428249,0.2114932,0.01516393,0.00008742775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2107775,0.00545556,0.6868343,0.02028388,0.0008978042,0.001075591,0.008608968,0.02410525,0.04196108],"genre_scores_gemma":[0.6214911,0.001486889,0.3544714,0.002025123,0.000608467,0.001013113,0.006820535,0.002304437,0.00977897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01337869,"threshold_uncertainty_score":0.04790384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051690202","doi":"10.5555/982792.982853","title":"An optimal randomized algorithm for maximum Tukey depth","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Randomized algorithm; Dimension (graph theory); Algorithm; Point (geometry); Linear programming; Set (abstract data type); Combinatorics; Computer science; Geometry","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01177073521394966,"gpt":0.2737123337367909,"spread":0.2619415985228413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001098375,0.0009024892,0.001295595,0.001134575,0.0009891631,0.001372909,0.002183771,0.001208058,0.01050391],"category_scores_gemma":[0.005861625,0.0006640418,0.001091342,0.001411494,0.001124074,0.003676987,0.00308703,0.00169062,0.002704907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001387749,"about_ca_system_score_gemma":0.00244402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002530303,"about_ca_topic_score_gemma":0.004918119,"domain_scores_codex":[0.9980977,0.0003930273,0.0001403875,0.0004971093,0.0005779173,0.0002938393],"domain_scores_gemma":[0.9982442,0.0005949091,0.0001963987,0.0005207813,0.0003149905,0.000128803],"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.001701006,0.0003020338,0.001885584,0.0003939364,0.0001085732,0.000117171,0.0002878233,0.1292579,0.04301792,0.1082081,0.01522908,0.6994908],"study_design_scores_gemma":[0.0004964494,0.0005137196,0.0008105342,0.00004280892,0.00004943807,0.0002501805,0.0001527888,0.8244243,0.03122215,0.1293303,0.01259836,0.0001089178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01015646,0.0001339465,0.9858969,0.0001761782,0.00006013162,0.0000922865,0.0001508473,0.00167913,0.001654131],"genre_scores_gemma":[0.0896927,0.0000870134,0.9074702,0.0001156722,0.00004996426,0.0001745833,0.0003781576,0.0002727879,0.001758925],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01050391,"threshold_uncertainty_score":0.03513908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1512019713","doi":"10.5555/1496770.1496862","title":"Appointment scheduling with discrete random durations","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":108,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Schedule; Scheduling (production processes); Computer science; Discrete time and continuous time; Mathematical optimization; Job shop scheduling; Overtime; Probability distribution; Integer programming; Random variable; Mathematics; Statistics","authors":[{"name":"Mehmet A. Begen","is_ca":true},{"name":"Maurice Queyranne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02785109995475595,"gpt":0.3676772088583154,"spread":0.3398261089035595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002541626,0.0008401882,0.001830485,0.0006617532,0.0005820239,0.001601083,0.002337599,0.001657235,0.007256413],"category_scores_gemma":[0.009142711,0.000898464,0.0008964946,0.001381307,0.0009841204,0.001754629,0.001073943,0.001624829,0.00113482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001984765,"about_ca_system_score_gemma":0.001386651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005148728,"about_ca_topic_score_gemma":0.003363608,"domain_scores_codex":[0.9974704,0.0009826766,0.0001217778,0.0005035943,0.0004324177,0.0004890906],"domain_scores_gemma":[0.9959332,0.002467924,0.0006929221,0.0002758811,0.0002002503,0.0004298782],"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.0006290143,0.0001295061,0.001311751,0.0002081319,0.00005712395,0.0003120133,0.0001206012,0.899498,0.001473004,0.07525222,0.003087525,0.01792113],"study_design_scores_gemma":[0.0001058523,0.0001088553,0.0004705396,0.00001341789,0.00002101369,0.00006849669,0.00003603825,0.9731677,0.0003289804,0.02381306,0.00184376,0.00002226788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1506449,0.001850087,0.830799,0.001975855,0.0004397718,0.000234268,0.001622509,0.0007991959,0.01163433],"genre_scores_gemma":[0.9319454,0.0008518722,0.05463291,0.0002207814,0.0002682141,0.0002277595,0.0006490796,0.0001041047,0.01109985],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007256413,"threshold_uncertainty_score":0.02427512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010996873","doi":"10.5555/1109557.1109577","title":"Combination can be hard: approximability of the unique coverage problem","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Hardness of approximation; Combinatorics; Approximation algorithm; Mathematics; Bipartite graph; Matching (statistics); Binary logarithm; Set (abstract data type); Discrete mathematics; Logarithm; Maximization; Time complexity; Computer science; Mathematical optimization","authors":[{"name":"Erik D. Demaine","is_ca":false},{"name":"Mohammad Taghi Hajiaghayi","is_ca":false},{"name":"Uriel Feige","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01183958534583239,"gpt":0.2252779971216926,"spread":0.2134384117758601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002675143,0.001718356,0.002121473,0.001208412,0.001530304,0.005106105,0.003701368,0.002340999,0.01211212],"category_scores_gemma":[0.02008492,0.001163726,0.00284735,0.00267209,0.00163945,0.00919365,0.003611875,0.004646122,0.001329567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002606704,"about_ca_system_score_gemma":0.001716147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002211783,"about_ca_topic_score_gemma":0.002643168,"domain_scores_codex":[0.9953262,0.001100218,0.0002314597,0.001463197,0.001020456,0.0008585611],"domain_scores_gemma":[0.989467,0.007098258,0.0007913885,0.001719963,0.0004235731,0.000499922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001670336,0.0008987318,0.009351426,0.001047379,0.0005691767,0.0008478492,0.000883688,0.555603,0.007842246,0.221577,0.0241442,0.175565],"study_design_scores_gemma":[0.0001268827,0.00008855906,0.0007786719,0.00007232985,0.0001589204,0.0007152603,0.0001694379,0.699049,0.004505774,0.2881131,0.00619374,0.00002849471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2606708,0.00148163,0.6773912,0.005320068,0.000199284,0.0003613495,0.002073104,0.003320703,0.04918182],"genre_scores_gemma":[0.7823982,0.0006964897,0.2025414,0.0007163506,0.000291872,0.0004592724,0.002139853,0.0006487839,0.0101079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01211212,"threshold_uncertainty_score":0.04051906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051837689","doi":"10.5555/1109557.1109667","title":"Scalable leader election","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Leader election; Scalability; Computer science; Protocol (science); Set (abstract data type); Parallel computing; Limit (mathematics); Distributed computing; Computer network; Mathematics; Operating system; Programming language","authors":[{"name":"Valerie King","is_ca":true},{"name":"Jared Saia","is_ca":false},{"name":"Vishal Sanwalani","is_ca":false},{"name":"Erik Vee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0078637736390246,"gpt":0.230137101409632,"spread":0.2222733277706073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119726,0.0006239114,0.001038116,0.0005498779,0.00105257,0.0009292898,0.001816251,0.0008010853,0.01052889],"category_scores_gemma":[0.003144269,0.0003603577,0.0004640617,0.0009683158,0.0006136979,0.002290768,0.002408603,0.001039735,0.00293847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005312379,"about_ca_system_score_gemma":0.0009538793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007092411,"about_ca_topic_score_gemma":0.001486653,"domain_scores_codex":[0.9987332,0.000249477,0.00005207351,0.0002289424,0.0005610005,0.0001753732],"domain_scores_gemma":[0.9986602,0.0004729329,0.0001192417,0.0003298284,0.0002960377,0.0001216278],"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.0005482885,0.0002665207,0.001118372,0.001183463,0.0002435437,0.0007490239,0.0003564585,0.1764959,0.03597578,0.2524824,0.1159946,0.4145856],"study_design_scores_gemma":[0.0003823274,0.0003514561,0.0004583625,0.00009907048,0.0001103645,0.0005903997,0.0002033397,0.6507372,0.01554205,0.2109035,0.1205574,0.00006455812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01395661,0.002488963,0.9280849,0.001253244,0.0007889036,0.0004507815,0.0004846004,0.004444904,0.04804708],"genre_scores_gemma":[0.5429175,0.002927614,0.4120151,0.0009090462,0.0006479044,0.001002721,0.001873376,0.0005256215,0.03718103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01052889,"threshold_uncertainty_score":0.03522265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980569719","doi":"10.5555/338219.338586","title":"Estimating DNA sequence entropy","year":2000,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":81,"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":"Entropy (arrow of time); Sequence (biology); Computer science; Statistical physics; Computational biology; Genetics; Biology; Physics; Thermodynamics","authors":[{"name":"J. Kevin Lanctot","is_ca":true},{"name":"Ming Li","is_ca":true},{"name":"En‐hui Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009552694781969635,"gpt":0.2604830810511529,"spread":0.2509303862691833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002811943,0.0007338494,0.001387657,0.003008702,0.0007349699,0.001910402,0.0008369552,0.001192521,0.002064312],"category_scores_gemma":[0.01395749,0.0009760258,0.0009412845,0.001635763,0.001571039,0.003229439,0.00186861,0.002074065,0.0005158837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001281793,"about_ca_system_score_gemma":0.0005691382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001164818,"about_ca_topic_score_gemma":0.0007707991,"domain_scores_codex":[0.9990627,0.0003642793,0.00005702865,0.0002248214,0.0002390538,0.00005212478],"domain_scores_gemma":[0.9942788,0.004000898,0.0001713143,0.0006653924,0.0006262478,0.0002573523],"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.0002103074,0.00008028725,0.004142738,0.000223903,0.0001929346,0.000146644,0.0002411446,0.3123032,0.01914084,0.3037863,0.008027535,0.3515042],"study_design_scores_gemma":[0.000008697026,0.00004225232,0.001454619,0.00002922345,0.00002548438,0.0000863047,0.00002418734,0.7969909,0.009409112,0.18501,0.006883525,0.00003575121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02983246,0.002324565,0.963561,0.0008614155,0.0004937975,0.00002633435,0.0001553836,0.0003544321,0.002390486],"genre_scores_gemma":[0.5268311,0.003162012,0.4572133,0.0003417503,0.001840228,0.0001319181,0.0008056575,0.0004587927,0.009215185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003008702,"threshold_uncertainty_score":0.01487112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621248669","doi":"10.5555/1109557.1109588","title":"Cake cutting really is not a piece of cake","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Protocol (science); Bounding overwatch; Upper and lower bounds; Divide and conquer algorithms; Mathematics; Computer science; Value (mathematics); Combinatorics; Algorithm; Artificial intelligence; Statistics","authors":[{"name":"Jeff Edmonds","is_ca":true},{"name":"Kirk Pruhs","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008784925928344135,"gpt":0.2371651895573972,"spread":0.2283802636290531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003043714,0.0006970107,0.001643994,0.0004941647,0.002840028,0.004587442,0.00280599,0.003286019,0.009609706],"category_scores_gemma":[0.01726949,0.0008653323,0.001810677,0.001191149,0.005502733,0.01558608,0.004410712,0.006589812,0.001296539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001793047,"about_ca_system_score_gemma":0.002253306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002286259,"about_ca_topic_score_gemma":0.002275036,"domain_scores_codex":[0.9950244,0.000961487,0.0002767208,0.001598751,0.001303024,0.0008356731],"domain_scores_gemma":[0.9848794,0.007420971,0.0009596367,0.005597468,0.0006560516,0.0004863622],"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.0005513646,0.0001506606,0.000967324,0.0002823054,0.0001049062,0.0002451601,0.0006027804,0.06165846,0.00971879,0.8724631,0.00484226,0.04841278],"study_design_scores_gemma":[0.0001016845,0.0001629352,0.0003457846,0.00006247461,0.00006736215,0.0003786861,0.0003169755,0.1630714,0.01220097,0.8043595,0.01886256,0.00006976315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07885603,0.0003901286,0.8950524,0.003635575,0.0001549944,0.000213376,0.0002194706,0.0007496653,0.02072835],"genre_scores_gemma":[0.6118445,0.0003846261,0.3658705,0.0007371986,0.0001071236,0.0003768909,0.0003383329,0.0004207385,0.01992011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009609706,"threshold_uncertainty_score":0.03214765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169088379","doi":"10.5555/1109557.1109597","title":"Distributed selfish load balancing","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Computer science; Convergence (economics); Resource allocation; Distributed computing; Distributed algorithm; Martingale (probability theory); Mathematical optimization; Load balancing (electrical power); Mathematics; Computer network","authors":[{"name":"Petra Berenbrink","is_ca":true},{"name":"Tom Friedetzky","is_ca":false},{"name":"Leslie Ann Goldberg","is_ca":false},{"name":"Paul W. Goldberg","is_ca":false},{"name":"Zengjian Hu","is_ca":true},{"name":"Russell Martin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02486666529941805,"gpt":0.3175646698991393,"spread":0.2926980045997213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001391722,0.000477409,0.000701519,0.000396509,0.0008482097,0.001407094,0.001825257,0.0008625577,0.003342465],"category_scores_gemma":[0.004473045,0.0003247205,0.0003108555,0.0004289015,0.0009993955,0.002030589,0.002027539,0.0006252588,0.0005762019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009329817,"about_ca_system_score_gemma":0.0007602318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008647829,"about_ca_topic_score_gemma":0.0008317663,"domain_scores_codex":[0.9989232,0.0003046562,0.00005158804,0.0002478297,0.0002900954,0.0001825891],"domain_scores_gemma":[0.9980888,0.0007164593,0.0003035355,0.000444448,0.000246266,0.0002005379],"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.0009469089,0.0002081402,0.001903145,0.0001945808,0.0001261812,0.0005038338,0.0005532133,0.6886549,0.02498668,0.2016593,0.005407984,0.07485518],"study_design_scores_gemma":[0.00006068778,0.00006775217,0.0001915008,0.000007149278,0.00001100549,0.0001029595,0.00004867405,0.9500699,0.002150236,0.04414229,0.003134744,0.00001309697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0816753,0.0002719164,0.9041646,0.0006755156,0.0001131924,0.0001452039,0.00008197132,0.0007488602,0.01212334],"genre_scores_gemma":[0.9529711,0.0001315045,0.04074125,0.0001347257,0.00006560081,0.0001380527,0.00006322417,0.00004261308,0.005711972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003342465,"threshold_uncertainty_score":0.01118171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065457428","doi":"10.5555/365411.365526","title":"Representing dynamic binary trees succinctly","year":2001,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; Representation (politics); Amortized analysis; Binary tree; Computer science; Constant (computer programming); Binary search tree; Weight-balanced tree; Contrast (vision); Binary decision diagram; Theoretical computer science; Data structure; Binary expression tree; Discrete mathematics; Combinatorics; Mathematics; Algorithm; Arithmetic; Programming language; Artificial intelligence","authors":[{"name":"J. Ian Munro","is_ca":true},{"name":"Venkatesh Raman","is_ca":false},{"name":"Adam Storm","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01167444419750935,"gpt":0.2667827410708196,"spread":0.2551082968733102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599627,0.0005121236,0.0006743884,0.001185165,0.0004378463,0.002052658,0.001149252,0.0007765234,0.005304078],"category_scores_gemma":[0.004316065,0.0004483353,0.0003707822,0.002389089,0.0006269873,0.005570316,0.00155849,0.00116913,0.001402972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005027233,"about_ca_system_score_gemma":0.0006249934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008382985,"about_ca_topic_score_gemma":0.001507641,"domain_scores_codex":[0.9993864,0.0001099433,0.00006872541,0.00009960464,0.0002511733,0.00008410533],"domain_scores_gemma":[0.9983245,0.0005222128,0.0002045011,0.0006304207,0.000266469,0.00005195643],"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.0005159394,0.0001816525,0.0008664461,0.000458428,0.00003723698,0.0004805847,0.0005526115,0.1099977,0.02698209,0.3071435,0.01678331,0.5360004],"study_design_scores_gemma":[0.0001070725,0.0002249418,0.0004094563,0.0002359103,0.0000767809,0.0006428988,0.0002183641,0.5073244,0.03796189,0.3745672,0.07813842,0.00009271141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03394069,0.0008186998,0.9535469,0.0005252912,0.0002116448,0.0001142403,0.002101295,0.001963726,0.006777428],"genre_scores_gemma":[0.4157247,0.002168889,0.5619731,0.0004637701,0.000205945,0.0004286465,0.005809353,0.0006279455,0.01259766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005304078,"threshold_uncertainty_score":0.01774389,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621324178","doi":"10.5555/1283383.1283446","title":"Tree exploration with logarithmic memory","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Computer science; Node (physics); Tree (set theory); Network topology; Logarithm; Binary logarithm; Graph; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Task (project management); Topology (electrical circuits); Mathematics; Combinatorics; Computer network; Artificial intelligence","authors":[{"name":"Leszek Gąsieniec","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"Tomasz Radzik","is_ca":false},{"name":"Xiaohui Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01810498012002898,"gpt":0.2619032041318963,"spread":0.2437982240118673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003988937,0.0005783822,0.0007582689,0.0004298304,0.0006170056,0.001091644,0.00141324,0.0009965398,0.00716597],"category_scores_gemma":[0.003846026,0.000274197,0.0005297601,0.0009908231,0.0007208548,0.003831779,0.001721893,0.0007996842,0.001139357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006579951,"about_ca_system_score_gemma":0.0006754559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001879476,"about_ca_topic_score_gemma":0.001933043,"domain_scores_codex":[0.9996133,0.0000886066,0.00002138419,0.00008327147,0.00007233626,0.0001211983],"domain_scores_gemma":[0.9983608,0.001064085,0.0001221582,0.0002602533,0.00009726459,0.00009546176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001632776,0.0001852652,0.001571462,0.0005449223,0.00008369789,0.0004077181,0.0003759915,0.7722874,0.009961211,0.07838773,0.009081185,0.1254806],"study_design_scores_gemma":[0.00009792434,0.000114507,0.0001659209,0.00001953003,0.00002255103,0.0001063137,0.00005434522,0.9084169,0.002803464,0.08522197,0.002964132,0.00001244377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1938203,0.002284434,0.7768444,0.001349244,0.000127634,0.0001224347,0.0006126657,0.002367051,0.02247174],"genre_scores_gemma":[0.7500607,0.0009946837,0.237097,0.0002758465,0.00006100246,0.0003002389,0.0005950084,0.0002924401,0.01032314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00716597,"threshold_uncertainty_score":0.02397257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077203993","doi":"10.5555/338219.338231","title":"Weakly chordal graph algorithms via handles","year":2000,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","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 Alberta","funders":"","keywords":"Computer science; Chordal graph; Algorithm; Graph; Theoretical computer science","authors":[{"name":"Ryan Hayward","is_ca":true},{"name":"Jeremy Spinrad","is_ca":false},{"name":"R. Sritharan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01185173105347955,"gpt":0.2716441030408071,"spread":0.2597923719873275,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002892986,0.001583195,0.003005539,0.002659206,0.003621683,0.008698296,0.006329174,0.002366806,0.0151642],"category_scores_gemma":[0.01480205,0.001310205,0.002385153,0.004262283,0.003289061,0.01371423,0.01783514,0.006533889,0.004226431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002947684,"about_ca_system_score_gemma":0.00203057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001014423,"about_ca_topic_score_gemma":0.001632008,"domain_scores_codex":[0.9955088,0.001067553,0.000319851,0.001069635,0.001368966,0.0006651754],"domain_scores_gemma":[0.9879736,0.006176192,0.000451162,0.003610488,0.0007437787,0.001044806],"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.001106334,0.0004310793,0.001170277,0.0004249545,0.0001132936,0.0001238391,0.0009607495,0.01608203,0.005972194,0.824084,0.01353192,0.1359993],"study_design_scores_gemma":[0.0001366868,0.0001028873,0.0001548001,0.00004305154,0.00006408094,0.00008001499,0.000207249,0.04950787,0.003850693,0.9357324,0.01009317,0.00002713844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08970794,0.0008590531,0.8344876,0.002575716,0.0005825108,0.0005414442,0.0007822179,0.004591428,0.06587218],"genre_scores_gemma":[0.54827,0.001075618,0.4015692,0.001103898,0.000832236,0.001195809,0.002158887,0.002539778,0.04125455],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0151642,"threshold_uncertainty_score":0.05072927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974542877","doi":"10.5555/1283383.1283520","title":"Approximation algorithms for prize collecting forest problems with submodular penalty functions","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Rounding; Penalty method; Steiner tree problem; Approximation algorithm; Mathematical optimization; Function (biology); Computer science; Mathematics; Algorithm; Minification; Dual (grammatical number); Tree (set theory); Combinatorics","authors":[{"name":"Yogeshwer Sharma","is_ca":false},{"name":"Chaitanya Swamy","is_ca":true},{"name":"David P. Williamson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03007951308552398,"gpt":0.2687336219725512,"spread":0.2386541088870272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002688178,0.001482549,0.002007182,0.000811654,0.0008326835,0.001838719,0.002557353,0.001723316,0.005032488],"category_scores_gemma":[0.006358935,0.0005984383,0.001047519,0.002350039,0.0007701196,0.003603783,0.00163146,0.002595434,0.0007773415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550118,"about_ca_system_score_gemma":0.001456295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002584316,"about_ca_topic_score_gemma":0.00418009,"domain_scores_codex":[0.9988458,0.0004978725,0.00004299002,0.000164021,0.0002092823,0.0002399017],"domain_scores_gemma":[0.9976171,0.001682878,0.0002104496,0.0002148544,0.0001516033,0.000123015],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004116482,0.0003811402,0.001089875,0.0003730544,0.00009824281,0.0001046891,0.0001630447,0.7495535,0.001125292,0.09028198,0.01159161,0.1448259],"study_design_scores_gemma":[0.00004274414,0.00004548112,0.00009613809,0.00001720526,0.00001341021,0.00004804258,0.00003809763,0.9460657,0.0002558499,0.052251,0.001118372,0.000008048814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03614679,0.001119713,0.9547768,0.0006709049,0.00009652696,0.0001427052,0.0002399686,0.0005733344,0.006233307],"genre_scores_gemma":[0.4168906,0.001129792,0.5726752,0.0004079121,0.0002181132,0.0004126112,0.000826919,0.0003157993,0.007123169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005032488,"threshold_uncertainty_score":0.01683533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037688351","doi":"10.5555/545381.545430","title":"I/O-optimal algorithms for planar graphs using separators","year":2002,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Planar graph; Planar straight-line graph; Breadth-first search; Planar; Algorithm; Book embedding; Computer science; Embedding; Outerplanar graph; Vertex (graph theory); Depth-first search; Graph; Search algorithm; Pathwidth; Theoretical computer science; Line graph; Artificial intelligence","authors":[{"name":"Anil Maheshwari","is_ca":true},{"name":"Norbert Zeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04744852501361935,"gpt":0.2870264706846065,"spread":0.2395779456709872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006547206,0.002103462,0.00100329,0.00147029,0.0009577519,0.001800917,0.002403235,0.001443282,0.01149397],"category_scores_gemma":[0.004960315,0.0007108533,0.001460709,0.002864146,0.001202828,0.0059966,0.0037441,0.002169881,0.003191057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001610747,"about_ca_system_score_gemma":0.001603442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001338788,"about_ca_topic_score_gemma":0.002253848,"domain_scores_codex":[0.9989261,0.0001622481,0.00008807305,0.0002548338,0.000336288,0.0002324052],"domain_scores_gemma":[0.9974126,0.001263501,0.0003878158,0.0005781585,0.0002498331,0.0001081309],"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.0007364142,0.0005016213,0.001338937,0.0008609644,0.0001492888,0.0001624967,0.0003673602,0.2112364,0.02367353,0.1183523,0.01719005,0.6254306],"study_design_scores_gemma":[0.000266335,0.000273127,0.0004723851,0.0001063936,0.0001020083,0.0002778394,0.0002427655,0.6551561,0.03850292,0.2867004,0.01784001,0.00005972583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02404862,0.0005290475,0.9610986,0.0003606766,0.00005534968,0.0001597471,0.0002621711,0.003872972,0.009612781],"genre_scores_gemma":[0.1428535,0.0006114024,0.847945,0.0001528414,0.00006668486,0.0003464286,0.00132818,0.0007824156,0.005913518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01149397,"threshold_uncertainty_score":0.03845119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151534739","doi":"10.5555/1283383.1283519","title":"Approximation algorithms for node-weighted buy-at-bulk network design","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Approximation algorithm; Logarithm; Node (physics); Network planning and design; Computer science; Approximation theory; Constant (computer programming); Algorithm; Mathematics; Mathematical optimization; Physics; Computer network; Mathematical analysis","authors":[{"name":"Chandra Chekuri","is_ca":false},{"name":"Mohammad Taghi Hajiaghayi","is_ca":false},{"name":"Guy Kortsarz","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03280088017898276,"gpt":0.2760675828761797,"spread":0.243266702697197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002476118,0.002147017,0.001855643,0.001168663,0.0009367306,0.002518439,0.003816016,0.002122305,0.01134392],"category_scores_gemma":[0.009902523,0.00104927,0.00149078,0.003090112,0.001034266,0.006544357,0.002542355,0.00285314,0.002536574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002389286,"about_ca_system_score_gemma":0.0017574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002467097,"about_ca_topic_score_gemma":0.003756498,"domain_scores_codex":[0.9974837,0.0007621233,0.0001514597,0.0005844499,0.0005658954,0.0004522641],"domain_scores_gemma":[0.9945879,0.002846535,0.0005053115,0.001477299,0.0003555485,0.0002273089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001274632,0.0006383481,0.001487751,0.0006862289,0.0001943364,0.0001631714,0.0002886533,0.6306691,0.005807039,0.05873105,0.01965615,0.2804036],"study_design_scores_gemma":[0.0001502026,0.0001121603,0.0001688801,0.0000231243,0.00004485632,0.0001167123,0.00005164093,0.9183702,0.001696976,0.07673083,0.002514826,0.00001954193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01921404,0.0007190388,0.9720091,0.0006151235,0.00008245809,0.0001583477,0.0003342847,0.001911949,0.004955617],"genre_scores_gemma":[0.3007548,0.0007846809,0.6894267,0.0003890696,0.0001567075,0.0004409679,0.001678409,0.0005305565,0.005838037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01134392,"threshold_uncertainty_score":0.0379492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078615143","doi":"10.5555/1109557.1109689","title":"A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Convex hull; Amortized analysis; Regular polygon; Set (abstract data type); Mathematics; Computational geometry; Euclidean geometry; Point (geometry); Data structure; k-nearest neighbors algorithm; Computer science; Algorithm; Discrete mathematics; Artificial intelligence","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01186897854049258,"gpt":0.2646139178492995,"spread":0.2527449393088069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001633439,0.0009465344,0.002441521,0.002002658,0.002128331,0.00280538,0.005902851,0.00200187,0.007106629],"category_scores_gemma":[0.01080231,0.001262108,0.001547531,0.004734364,0.001856715,0.008107661,0.007709015,0.002864835,0.0031817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001984677,"about_ca_system_score_gemma":0.002530422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002928687,"about_ca_topic_score_gemma":0.003653615,"domain_scores_codex":[0.9965841,0.0004373655,0.000404932,0.0006995663,0.001529979,0.0003441411],"domain_scores_gemma":[0.992374,0.001730205,0.0006624712,0.004009815,0.0008192474,0.0004042596],"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.001782916,0.0008646397,0.003631746,0.0006385177,0.0001742586,0.0004197653,0.0006064862,0.1898854,0.02783338,0.20856,0.06062726,0.5049755],"study_design_scores_gemma":[0.0003944906,0.0004745284,0.0005108601,0.00006345198,0.00006277318,0.0004374872,0.0001484025,0.8247257,0.01546964,0.1182754,0.03929243,0.0001447652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01331255,0.0004490124,0.9759261,0.0008279452,0.0001579658,0.0002307431,0.001582467,0.005393567,0.002119625],"genre_scores_gemma":[0.1863679,0.0003997278,0.8009951,0.0005174698,0.0002396297,0.001153949,0.005586656,0.0007232495,0.004016329],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007106629,"threshold_uncertainty_score":0.02377403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068462176","doi":"","title":"On distance to monotonicity and longest increasing subsequence of a data stream","year":2008,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monotonic function; Longest common subsequence problem; Subsequence; Longest increasing subsequence; Combinatorics; Upper and lower bounds; Mathematics; Conjecture; Sequence (biology); Approximation algorithm; Space (punctuation); Streaming algorithm; Set (abstract data type); Edit distance; Log-log plot; Data stream; Discrete mathematics; Binary logarithm; Algorithm; Computer science; Statistics; Bounded function","authors":[{"name":"Funda Ergün","is_ca":true},{"name":"Hossein Jowhari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04200296111938706,"gpt":0.285111851134366,"spread":0.243108890014979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004609203,0.0009356786,0.00156311,0.001681078,0.001287657,0.001939202,0.002804497,0.001601256,0.002437172],"category_scores_gemma":[0.05181065,0.0005520559,0.0008029917,0.002580028,0.002415244,0.01157163,0.002073949,0.002948922,0.0006605825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001899022,"about_ca_system_score_gemma":0.001648117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002084803,"about_ca_topic_score_gemma":0.001052593,"domain_scores_codex":[0.9956143,0.001342236,0.00032935,0.0009226226,0.0013335,0.0004580104],"domain_scores_gemma":[0.9471791,0.04027389,0.003243581,0.005070662,0.003203475,0.001029307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002353898,0.0004719456,0.02249943,0.0006707933,0.0001527085,0.0004982396,0.001201444,0.475912,0.021094,0.228135,0.004521064,0.2424895],"study_design_scores_gemma":[0.00003237431,0.0002394151,0.001402603,0.00004484542,0.00002283683,0.0002753727,0.0001259925,0.8806691,0.006644687,0.1090055,0.001513936,0.00002343827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2459904,0.001407927,0.7453572,0.001841779,0.00008275449,0.000113604,0.000414826,0.001149126,0.003642325],"genre_scores_gemma":[0.7023569,0.001072816,0.2923508,0.0003937744,0.0002819292,0.0002724524,0.001055147,0.000321734,0.001894459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004609203,"threshold_uncertainty_score":0.02437603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153068117","doi":"10.5555/982792.982848","title":"The list partition problem for graphs","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Partition (number theory); Mathematics; Clique problem; Time complexity; Skew; Discrete mathematics; Clique; Chordal graph; Graph; Computer science; 1-planar graph","authors":[{"name":"Kathie Cameron","is_ca":true},{"name":"Elaine M. Eschen","is_ca":false},{"name":"Chı́nh T. Hoàng","is_ca":true},{"name":"R. Sritharan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01577628640029533,"gpt":0.2901337696210354,"spread":0.2743574832207401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117267,0.00136578,0.001150844,0.001288584,0.002213105,0.004003813,0.002120111,0.002593096,0.01140723],"category_scores_gemma":[0.005069124,0.0008206982,0.001382822,0.00337659,0.001539002,0.009277414,0.002346797,0.001916787,0.002213048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002236474,"about_ca_system_score_gemma":0.001531791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003493821,"about_ca_topic_score_gemma":0.003619576,"domain_scores_codex":[0.9984456,0.0004382656,0.00009645669,0.0003855311,0.0003030568,0.0003311526],"domain_scores_gemma":[0.9978384,0.001346554,0.0002358913,0.0002655978,0.0001600837,0.000153488],"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.001017177,0.0004226065,0.00202781,0.001804055,0.0001843484,0.0007324087,0.001451734,0.2314336,0.00815865,0.4754367,0.07488298,0.2024478],"study_design_scores_gemma":[0.0002302384,0.0002107922,0.0009055639,0.000132943,0.0001031034,0.0008900459,0.0007916805,0.260617,0.005825143,0.6764539,0.05376376,0.00007589663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1484032,0.002947337,0.8052334,0.004281789,0.0003398799,0.0007719126,0.003576027,0.002158055,0.03228825],"genre_scores_gemma":[0.5231116,0.003788009,0.4277956,0.001090438,0.0005915525,0.0007882745,0.01211244,0.0008061172,0.02991603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01140723,"threshold_uncertainty_score":0.03816098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963693432","doi":"10.5555/2634074.2634192","title":"Parameters of two-prover-one-round game and the hardness of connectivity problems","year":2014,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Soundness; Connection (principal bundle); Hardness of approximation; Gas meter prover; Constant (computer programming); Class (philosophy); Task (project management); Mathematics; Computer science; Discrete mathematics; Approximation algorithm; Combinatorics; Artificial intelligence; Mathematical proof","authors":[{"name":"Bundit Laekhanukit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01954055939591269,"gpt":0.2463180992991209,"spread":0.2267775399032083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006362549,0.001965066,0.002657784,0.0009564748,0.001804606,0.005543052,0.005467542,0.003573849,0.01047215],"category_scores_gemma":[0.05597841,0.001481621,0.003010106,0.001426589,0.004780661,0.0179934,0.005287793,0.01062288,0.001294081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00408075,"about_ca_system_score_gemma":0.003202739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00173391,"about_ca_topic_score_gemma":0.00153585,"domain_scores_codex":[0.9880908,0.004982807,0.0006645332,0.002879295,0.001939182,0.001443382],"domain_scores_gemma":[0.931049,0.05362459,0.003381777,0.008072866,0.001509395,0.002362494],"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.001173857,0.000334647,0.003540757,0.0008231222,0.0002244564,0.0002751951,0.001013896,0.2348686,0.005276635,0.7058195,0.01051124,0.03613812],"study_design_scores_gemma":[0.0001406563,0.0001353592,0.0005349693,0.00008933713,0.00008210696,0.0002469514,0.0002075598,0.2539744,0.002077155,0.7374439,0.005004606,0.00006302322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1084528,0.001110776,0.846444,0.007620542,0.0002508239,0.0005158837,0.001517322,0.001087843,0.03299994],"genre_scores_gemma":[0.7922494,0.001397467,0.1923098,0.001420811,0.0004014841,0.001122373,0.001406295,0.0007168493,0.008975576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01047215,"threshold_uncertainty_score":0.03503281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013696768","doi":"10.5555/1109557.1109575","title":"An asymptotic approximation algorithm for 3D-strip packing","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Bin packing problem; Approximation algorithm; Mathematics; Algorithm; Combinatorics; Packing problems; Bin; Set (abstract data type); Computer science","authors":[{"name":"Klaus Jansen","is_ca":false},{"name":"Roberto Solis-Oba","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00843081260272268,"gpt":0.231809257577146,"spread":0.2233784449744234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007201984,0.001296699,0.00139019,0.001221169,0.0008157651,0.001612428,0.002713424,0.00161503,0.008476607],"category_scores_gemma":[0.003846642,0.0006442665,0.001020672,0.003150729,0.0006001865,0.002897681,0.002848805,0.001764885,0.004876445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001410494,"about_ca_system_score_gemma":0.001484572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003172841,"about_ca_topic_score_gemma":0.002771961,"domain_scores_codex":[0.998448,0.0002267079,0.0001023749,0.0002413601,0.0006861541,0.0002953787],"domain_scores_gemma":[0.998684,0.0004053679,0.00009928473,0.0004772549,0.000255491,0.00007863047],"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.0006928329,0.0004326769,0.001537479,0.0003194934,0.00008157243,0.0002313664,0.0002457216,0.2747789,0.01342481,0.03137374,0.02486122,0.6520203],"study_design_scores_gemma":[0.00007955053,0.00007708339,0.0002963236,0.00001832724,0.00001546461,0.0001859424,0.00003980522,0.9679911,0.002814027,0.02277964,0.005682938,0.00001980177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01873168,0.0006096512,0.9680191,0.0002832917,0.0001114668,0.0001278341,0.0003746829,0.0042419,0.007500308],"genre_scores_gemma":[0.1436446,0.0004167235,0.8487215,0.000249357,0.00007982158,0.0003663193,0.002030736,0.0003792433,0.004111729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008476607,"threshold_uncertainty_score":0.02835709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018043895","doi":"10.5555/2133036.2133045","title":"Online scalable scheduling for the lk-norms of flow time without conservation of work","year":2011,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Scalability; Scheduling (production processes); Cloud computing; Competitive analysis; Distributed computing; Flow shop scheduling; Job shop scheduling; Parallel computing; Mathematical optimization; Computer network; Mathematics; Upper and lower bounds; Operating system","authors":[{"name":"Jeff Edmonds","is_ca":true},{"name":"Sungjin Im","is_ca":false},{"name":"Benjamin Moseley","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03494794727384103,"gpt":0.2655295085494122,"spread":0.2305815612755711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00358156,0.001681243,0.002035674,0.0009036186,0.001075338,0.002748204,0.003643843,0.00152704,0.004329125],"category_scores_gemma":[0.01677482,0.0006651226,0.000942828,0.001690344,0.001696585,0.005408152,0.002403859,0.002746468,0.0009447379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00381378,"about_ca_system_score_gemma":0.003814941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003027013,"about_ca_topic_score_gemma":0.003231843,"domain_scores_codex":[0.9973309,0.0007179179,0.0001206055,0.0005661499,0.000727727,0.0005368036],"domain_scores_gemma":[0.9883,0.007438705,0.001169454,0.00132591,0.001005155,0.0007608398],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001017108,0.0003763062,0.001088339,0.0005414791,0.00008299662,0.0001666554,0.0003722697,0.6952349,0.01020868,0.193689,0.01084142,0.0863809],"study_design_scores_gemma":[0.00004651107,0.00006184822,0.0001037376,0.00001079677,0.000006515741,0.00003247234,0.00002046125,0.9513484,0.001079049,0.04642636,0.0008522132,0.0000114968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.047572,0.0005538333,0.9407053,0.0008735338,0.0001152183,0.0002363949,0.0002967574,0.001151529,0.008495455],"genre_scores_gemma":[0.5349597,0.0004838685,0.4555273,0.0003904913,0.0003109004,0.0006553993,0.0006044948,0.0007301226,0.006337759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004329125,"threshold_uncertainty_score":0.02767098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059884147","doi":"10.5555/1070432.1070437","title":"A categorization theorem on suffix arrays with applications to space efficient text indexes","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Suffix; Suffix array; Combinatorics; String (physics); Binary number; Permutation (music); Cardinality (data modeling); Compressed suffix array; Discrete mathematics; Generalized suffix tree; Suffix tree; Mathematics; Computer science; Arithmetic; Data mining","authors":[{"name":"Meng He","is_ca":true},{"name":"J. Ian Munro","is_ca":true},{"name":"Srinivasa Rao Satti","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008185812719306998,"gpt":0.2437248519696897,"spread":0.2355390392503827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002584549,0.0007716601,0.001041421,0.002467296,0.001350975,0.003100787,0.002211482,0.001319716,0.006849556],"category_scores_gemma":[0.01611389,0.0007231127,0.0009291711,0.003930673,0.002375002,0.0120982,0.002977554,0.001818692,0.003194084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001749056,"about_ca_system_score_gemma":0.001365607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006187464,"about_ca_topic_score_gemma":0.0005875695,"domain_scores_codex":[0.9968634,0.0006257597,0.000436669,0.0005604987,0.001287492,0.0002261972],"domain_scores_gemma":[0.9904365,0.00403178,0.0009305961,0.002865462,0.001504899,0.0002307371],"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.0003157105,0.0001526759,0.001197877,0.0004204592,0.0000340753,0.0001547805,0.0004710175,0.02304076,0.02022792,0.6349384,0.01189013,0.3071561],"study_design_scores_gemma":[0.0001596616,0.0006428069,0.0008872331,0.0002796336,0.00007483045,0.001290771,0.0002490398,0.2562323,0.0487618,0.5911583,0.1001459,0.0001175683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01037012,0.0006053845,0.9825065,0.0007510273,0.0001467012,0.0001059527,0.0002062249,0.001150271,0.004157778],"genre_scores_gemma":[0.1476538,0.001158439,0.8410548,0.001102985,0.0005433546,0.0005238543,0.0008670994,0.0004791335,0.006616568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006849556,"threshold_uncertainty_score":0.02291405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067326981","doi":"10.5555/545381.545481","title":"Incremental) priority algorithms","year":2002,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy algorithm; Computer science; Simplicity; Greedy randomized adaptive search procedure; Mathematical optimization; Algorithm; Scheduling (production processes); Limit (mathematics); Approximation algorithm; Theoretical computer science; Mathematics","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Morten Nielsen","is_ca":false},{"name":"Charles Rackoff","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02435609350982374,"gpt":0.2632225026411814,"spread":0.2388664091313576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003341125,0.001132165,0.001098929,0.001013137,0.001028525,0.002841404,0.004435976,0.001654396,0.0111122],"category_scores_gemma":[0.01597309,0.0005416385,0.0009949531,0.001633093,0.0009509447,0.005333751,0.002587713,0.00251824,0.003582384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001512796,"about_ca_system_score_gemma":0.002139747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001752982,"about_ca_topic_score_gemma":0.002609613,"domain_scores_codex":[0.9974027,0.000656658,0.0001347944,0.0005411681,0.0007397875,0.0005247726],"domain_scores_gemma":[0.9945878,0.002722074,0.0004090184,0.001229257,0.0006507271,0.0004011109],"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.0006270834,0.0004860408,0.00203159,0.0005485067,0.0001199957,0.0001545201,0.0003082831,0.1188697,0.003737807,0.4751806,0.03220524,0.3657307],"study_design_scores_gemma":[0.0001762778,0.0002925122,0.0003690152,0.00005856031,0.00008468612,0.000299553,0.000117021,0.4936308,0.002955993,0.4769064,0.02507633,0.00003301354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01280822,0.0009446715,0.9618294,0.0009800198,0.0003811589,0.0001989054,0.0002210574,0.001340758,0.02129584],"genre_scores_gemma":[0.352075,0.001484315,0.6262023,0.001135044,0.0006373653,0.0004487362,0.0007456592,0.0004795778,0.01679189],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0111122,"threshold_uncertainty_score":0.03717405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029415290","doi":"10.5555/1496770.1496780","title":"On the hitting times of quantum versus random walks","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum walk; Hitting time; Random walk; Mathematics; Quantum; Quantum algorithm; Statistical physics; Markov chain; Discrete mathematics; Quantum mechanics; Physics; Statistics","authors":[{"name":"Frédéric Magniez","is_ca":false},{"name":"Ashwin Nayak","is_ca":true},{"name":"Peter C. Richter","is_ca":false},{"name":"Miklós Sántha","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01063437195247198,"gpt":0.2439889803909162,"spread":0.2333546084384442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006622541,0.0008958477,0.001096749,0.002280202,0.001134879,0.00336877,0.001833804,0.001904596,0.004674651],"category_scores_gemma":[0.04666814,0.0007577148,0.001018153,0.001503553,0.004846753,0.009744985,0.002002398,0.00326113,0.0005154138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002590307,"about_ca_system_score_gemma":0.001051053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00111401,"about_ca_topic_score_gemma":0.0006285902,"domain_scores_codex":[0.995359,0.00190496,0.000267787,0.0008169102,0.00111737,0.0005338872],"domain_scores_gemma":[0.9175879,0.07173254,0.003279548,0.003602435,0.002149582,0.001647897],"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.0002442381,0.00007869736,0.001262257,0.0001476024,0.00003677568,0.00011354,0.0003156921,0.0831828,0.00281966,0.8991646,0.0004874761,0.01214669],"study_design_scores_gemma":[0.00003978433,0.0001007335,0.0005772896,0.00004093006,0.00002439567,0.00008805057,0.00008170464,0.544558,0.002076244,0.4513786,0.0009910958,0.0000431753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3170136,0.002293173,0.6585167,0.001792664,0.0001776186,0.0002097101,0.0002742524,0.0004252747,0.01929699],"genre_scores_gemma":[0.9147803,0.001082113,0.07858179,0.000282605,0.0002547804,0.0002439474,0.0002105133,0.0002239309,0.004339985],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006622541,"threshold_uncertainty_score":0.03502375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963575846","doi":"10.5555/2627817.2627912","title":"Frozen variables in random boolean constraint satisfaction problems","year":2013,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Constraint (computer-aided design); Heuristics; Cluster analysis; Constraint satisfaction; Local consistency; Mathematics; Random variable; Algorithm; Computer science; Hypergraph; Discrete mathematics; Mathematical optimization; Statistics","authors":[{"name":"Michael Molloy","is_ca":true},{"name":"Ricardo Restrepo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01019987232403821,"gpt":0.2224017870505514,"spread":0.2122019147265132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00340302,0.00102878,0.001417553,0.001512014,0.001154436,0.002350305,0.00267651,0.001465469,0.004738858],"category_scores_gemma":[0.02017533,0.001049462,0.001615166,0.001415512,0.003076304,0.004628844,0.002359019,0.002695919,0.0003297818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00308543,"about_ca_system_score_gemma":0.001162566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005491907,"about_ca_topic_score_gemma":0.004809096,"domain_scores_codex":[0.997273,0.001158625,0.00008628702,0.0004886623,0.0004670793,0.0005263085],"domain_scores_gemma":[0.9852207,0.01200229,0.0009933023,0.0006408932,0.0005062746,0.0006365601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002576863,0.0001221757,0.002170872,0.000202768,0.00009144966,0.0002445032,0.0003503628,0.5253381,0.002019455,0.4549869,0.003332742,0.01088304],"study_design_scores_gemma":[0.0000421832,0.00003981834,0.000361328,0.00002762653,0.00001641114,0.00009289145,0.00006391457,0.7327913,0.0007071777,0.2650121,0.0008215411,0.00002373026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3164773,0.001494221,0.6678056,0.002200797,0.00006073958,0.0001699075,0.0005908356,0.0007042441,0.01049643],"genre_scores_gemma":[0.9473913,0.000632974,0.04756248,0.0002701696,0.00006543077,0.0002356578,0.0005542738,0.000154043,0.003133831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005491907,"threshold_uncertainty_score":0.02238649,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963204788","doi":"10.5555/3310435.3310519","title":"Proportional volume sampling and approximation algorithms for A-optimal design","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Approximation algorithm; Mathematics; Matrix (chemical analysis); Mathematical optimization; Algorithm; Measure (data warehouse); Applied mathematics; Computer science","authors":[{"name":"Aleksandar Nikolov","is_ca":true},{"name":"Mohit Singh","is_ca":false},{"name":"Uthaipon Tantipongpipat","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02753062799451619,"gpt":0.2601438406716673,"spread":0.2326132126771512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006599403,0.002827501,0.002791395,0.001934686,0.0008011616,0.002028229,0.00213399,0.002413229,0.003570881],"category_scores_gemma":[0.03362402,0.001557834,0.001690984,0.002041635,0.002514323,0.002739428,0.002917155,0.003584812,0.0008687634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002186963,"about_ca_system_score_gemma":0.001975533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004975016,"about_ca_topic_score_gemma":0.003372738,"domain_scores_codex":[0.9957159,0.002232044,0.0002264665,0.0005504371,0.001010548,0.000264455],"domain_scores_gemma":[0.9770859,0.01926722,0.0008723878,0.001328503,0.001093298,0.000352708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002095493,0.0001112034,0.0008450045,0.0002072852,0.00008981139,0.00006886302,0.0001241872,0.8618993,0.001000975,0.08159126,0.001602966,0.05224963],"study_design_scores_gemma":[0.00002376842,0.00004046543,0.00004068646,0.0000171622,0.000008168284,0.000019057,0.000009136117,0.96422,0.0002549854,0.03470606,0.0006539715,0.000006509914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001794439,0.0003497404,0.9966666,0.0001283501,0.00003505979,0.00004250132,0.00002189248,0.000131164,0.0008302777],"genre_scores_gemma":[0.1951407,0.00096594,0.7988006,0.000499476,0.0002196841,0.0007529093,0.0003514492,0.0002420531,0.003027038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006599403,"threshold_uncertainty_score":0.03490138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034389879","doi":"10.5555/1109557.1109605","title":"Asymmetric balanced allocation with simple hash functions","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Hash function; Computer science; Simple (philosophy); Extension (predicate logic); Hash table; Double hashing; Hash chain; Function (biology); Theoretical computer science; Programming language","authors":[{"name":"Philipp Woelfel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007456395841719261,"gpt":0.2256655254684238,"spread":0.2182091296267046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002348172,0.0007894867,0.00113573,0.0009018634,0.001421426,0.00218595,0.002299275,0.001363815,0.009160792],"category_scores_gemma":[0.007679514,0.0004919419,0.0004714159,0.001613074,0.001998219,0.007496526,0.005500399,0.00147516,0.004190854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001188388,"about_ca_system_score_gemma":0.001227808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004158673,"about_ca_topic_score_gemma":0.0003040977,"domain_scores_codex":[0.9965351,0.0007851327,0.0002231993,0.000439934,0.001399105,0.0006176044],"domain_scores_gemma":[0.9948139,0.001118733,0.0004076057,0.002902488,0.0005175184,0.0002397331],"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.001639901,0.0002597188,0.001048534,0.0002133028,0.00004886185,0.0002520858,0.0003353958,0.05132722,0.03083774,0.737259,0.007662209,0.169116],"study_design_scores_gemma":[0.0003102951,0.0003299467,0.0004409982,0.00005852748,0.00005923082,0.0007170335,0.00007906128,0.3951065,0.04011581,0.5280116,0.03466984,0.0001012389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06664529,0.0005035803,0.9144444,0.0003779063,0.0002315262,0.0002182559,0.0001845754,0.001084102,0.01631045],"genre_scores_gemma":[0.7694152,0.0005131195,0.2101891,0.0003171273,0.0002870194,0.000406602,0.000331193,0.0002974221,0.01824315],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009160792,"threshold_uncertainty_score":0.03064591,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118893502","doi":"10.5555/1109557.1109583","title":"Morphing orthogonal planar graph drawings","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Planarity testing; Morphing; Planar graph; Vertex (graph theory); Computer science; Orthogonality; Combinatorics; Graph drawing; Planar; Graph; Book embedding; Mathematics; Pathwidth; Line graph; Computer graphics (images); Geometry","authors":[{"name":"Anna Lubiw","is_ca":true},{"name":"Mark Petrick","is_ca":true},{"name":"Michael J. Spriggs","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007873912044065968,"gpt":0.2265386083005266,"spread":0.2186646962564606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003400879,0.0005639725,0.0005489471,0.000883428,0.0005026183,0.0009039777,0.0008374793,0.0005536178,0.006645222],"category_scores_gemma":[0.002152859,0.0005248762,0.0007285491,0.0008040139,0.0007511299,0.001455207,0.002371619,0.001051467,0.001054659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003954197,"about_ca_system_score_gemma":0.0003429452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001004411,"about_ca_topic_score_gemma":0.001311201,"domain_scores_codex":[0.9994295,0.0000636067,0.00003637931,0.0001165474,0.0002732857,0.00008059826],"domain_scores_gemma":[0.9993578,0.0001493074,0.0000782022,0.0002402607,0.0001318463,0.00004262803],"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.0002113202,0.00008105442,0.001194205,0.0002223526,0.0000403439,0.0002547356,0.0003166948,0.08859631,0.04029445,0.1774223,0.0095526,0.6818136],"study_design_scores_gemma":[0.0001029378,0.0002086599,0.000928968,0.00005704226,0.00006757522,0.0008282285,0.0003396057,0.6299047,0.05849967,0.2255616,0.08341918,0.00008190384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03088446,0.0000888522,0.9604009,0.0001105155,0.0000685398,0.0001052032,0.0001571434,0.001674057,0.006510297],"genre_scores_gemma":[0.2174765,0.0002259858,0.774057,0.00008081637,0.00002715143,0.0001324135,0.0006416034,0.0005430504,0.00681556],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006645222,"threshold_uncertainty_score":0.02223051,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165352378","doi":"10.5555/1070432.1070490","title":"An O(VE) algorithm for ear decompositions of matching-covered graphs","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Partition (number theory); Matching (statistics); Algorithm; Running time; Computer science; Mathematics; Blossom algorithm; Combinatorics; Discrete mathematics","authors":[{"name":"Marcelo H. de Carvalho","is_ca":true},{"name":"Joseph Cheriyan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01323844639757141,"gpt":0.3080781382825517,"spread":0.2948396918849802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007518604,0.001083021,0.0009228126,0.001250595,0.0008764563,0.001446863,0.001856819,0.001174601,0.01139202],"category_scores_gemma":[0.003432053,0.0006018738,0.001464559,0.001465334,0.0008087854,0.003666106,0.003554527,0.001770427,0.003546948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001001424,"about_ca_system_score_gemma":0.001392236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001534796,"about_ca_topic_score_gemma":0.002610005,"domain_scores_codex":[0.9987036,0.0002099789,0.00009293771,0.0003334629,0.000325641,0.0003342933],"domain_scores_gemma":[0.9982009,0.0007132238,0.0001523429,0.0006248937,0.0001767898,0.0001317788],"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.001038756,0.000565454,0.001972594,0.0006387559,0.0001226076,0.0002197507,0.0005937877,0.06714518,0.04359525,0.1004522,0.02199718,0.7616585],"study_design_scores_gemma":[0.0003841669,0.0004746368,0.001692255,0.00007264752,0.0001294712,0.0006741977,0.0003941091,0.6802628,0.03063534,0.2555168,0.02967066,0.00009284584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02523872,0.0001442004,0.9656743,0.0001985426,0.00003832339,0.0001968163,0.0002483577,0.003833368,0.004427358],"genre_scores_gemma":[0.1487677,0.0001659108,0.8439843,0.0001987897,0.00004819988,0.0003889813,0.001601888,0.0005318879,0.004312278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01139202,"threshold_uncertainty_score":0.03811014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987809901","doi":"10.5555/1873601.1873628","title":"Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements","year":2010,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Combinatorics; Parity (physics); Mathematics; Ackermann function; Time complexity; Subdivision; Discrete mathematics; Vertex (graph theory); Graph; Inverse; Geometry","authors":[{"name":"Ken‐ichi Kawarabayashi","is_ca":false},{"name":"Zhentao Li","is_ca":true},{"name":"Bruce Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01978642089397287,"gpt":0.2940209903722933,"spread":0.2742345694783205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002833626,0.0005705446,0.0005157514,0.0003375009,0.000559186,0.0009081915,0.0008715724,0.0007850156,0.005218952],"category_scores_gemma":[0.002113587,0.0003849194,0.0008344456,0.0006580442,0.0006793533,0.002224003,0.001644632,0.001011702,0.001134753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006233922,"about_ca_system_score_gemma":0.0008317825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001899117,"about_ca_topic_score_gemma":0.002996733,"domain_scores_codex":[0.9995211,0.00005381793,0.00004219,0.0001551723,0.0001024665,0.0001252846],"domain_scores_gemma":[0.9988309,0.0004042318,0.000149156,0.0003870181,0.0001361194,0.00009259794],"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.001500369,0.0003597928,0.0133008,0.0007735338,0.0001078281,0.001489107,0.001990898,0.09879778,0.1592703,0.152764,0.01344053,0.556205],"study_design_scores_gemma":[0.0001959086,0.0005686334,0.005644418,0.0001039625,0.00009605179,0.001734829,0.001299612,0.4110878,0.131496,0.4162358,0.03139723,0.0001397244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4435694,0.0001605257,0.5404619,0.0004545398,0.00006487589,0.0002441087,0.0009667664,0.001948793,0.01212911],"genre_scores_gemma":[0.6243815,0.00009324164,0.3653491,0.0001261904,0.0000107925,0.0001243933,0.002328459,0.0002599149,0.007326358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005218952,"threshold_uncertainty_score":0.01745915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570771845","doi":"10.5555/1496770.1496840","title":"Succinct geometric indexes supporting point location queries","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Point location; Point (geometry); Bounded function; Entropy (arrow of time); Combinatorics; Computational geometry; Mathematics; Set (abstract data type); Planar; Computer science; Line segment; Geometric primitive; Discrete mathematics; Algorithm; Geometry; Computer graphics (images)","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Eric Chen","is_ca":true},{"name":"Meng He","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009640366075033085,"gpt":0.2627214722801992,"spread":0.2530811062051661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00192815,0.0009996992,0.001983667,0.001921855,0.0009931594,0.00331553,0.003059569,0.001209546,0.005534516],"category_scores_gemma":[0.0175439,0.0009024187,0.0006867216,0.004065381,0.001471925,0.01108917,0.004743342,0.001554212,0.002955797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001093605,"about_ca_system_score_gemma":0.001902902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00100714,"about_ca_topic_score_gemma":0.001307909,"domain_scores_codex":[0.9963641,0.0005171886,0.0006720208,0.0004382726,0.001652244,0.0003561589],"domain_scores_gemma":[0.9837502,0.003997903,0.001780318,0.007740561,0.002409158,0.0003218927],"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.0028479,0.00056998,0.008760642,0.001056762,0.000121369,0.0003880022,0.001135947,0.1220682,0.0706425,0.2019866,0.02263527,0.5677869],"study_design_scores_gemma":[0.0005659998,0.001325314,0.001812251,0.0002413379,0.0001551805,0.0008289301,0.0006660476,0.5931104,0.1474271,0.1869083,0.06669138,0.0002676834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05541512,0.0005536354,0.9327145,0.0005044081,0.0001301249,0.0002494719,0.001799258,0.004817733,0.003815864],"genre_scores_gemma":[0.4386968,0.000729595,0.5483346,0.0005247403,0.0002268416,0.0006610765,0.0055834,0.0006674195,0.00457545],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005534516,"threshold_uncertainty_score":0.01851487,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1561175729","doi":"10.5555/1496770.1496824","title":"Biased range trees","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Range query (database); Data structure; Range (aeronautics); Computer science; Range tree; Set (abstract data type); Preprocessor; Tree (set theory); Tree structure; Query optimization; Segment tree; Interval tree; Data mining; Mathematics; Algorithm; Combinatorics; Sargable; Artificial intelligence; Web search query; Information retrieval; Search engine","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"John Howat","is_ca":true},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01441717215288716,"gpt":0.2591209271457658,"spread":0.2447037549928787,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225966,0.0004717192,0.001181421,0.001918543,0.0007727701,0.001687342,0.001625749,0.0008665419,0.008014124],"category_scores_gemma":[0.01111539,0.0005509972,0.0008356399,0.003479955,0.0005523686,0.00502906,0.002598617,0.0009924391,0.003741942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004732334,"about_ca_system_score_gemma":0.001149525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001026101,"about_ca_topic_score_gemma":0.001789384,"domain_scores_codex":[0.9978878,0.0003403721,0.0002133766,0.0003396787,0.0009929251,0.0002258498],"domain_scores_gemma":[0.9937578,0.002089402,0.0005939918,0.002038882,0.001246841,0.0002730511],"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.001626932,0.0002860293,0.006539477,0.000691895,0.0001430518,0.0004407639,0.0003972128,0.03943915,0.04118219,0.1347022,0.04532124,0.7292299],"study_design_scores_gemma":[0.0004568034,0.0009905302,0.003966232,0.0003187543,0.0001688796,0.002327905,0.0003872042,0.3935072,0.05748354,0.3970901,0.1430635,0.00023937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02701795,0.001156952,0.9560255,0.0003449417,0.0001136386,0.0002596948,0.003953173,0.005687433,0.005440662],"genre_scores_gemma":[0.2681114,0.001074161,0.7073989,0.0006661357,0.0002398218,0.0009324645,0.01353125,0.001329313,0.006716463],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008014124,"threshold_uncertainty_score":0.02680987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1509794588","doi":"10.5555/1496770.1496898","title":"A nearly linear time algorithm for the half integral parity disjoint paths packing problem","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Disjoint sets; Ackermann function; Mathematics; Time complexity; Parity (physics); Binary logarithm; Vertex (graph theory); Discrete mathematics; Approximation algorithm; Inverse; Algorithm; Graph; Physics","authors":[{"name":"Ken‐ichi Kawarabayashi","is_ca":false},{"name":"Bruce Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01650779417379294,"gpt":0.2897351951554409,"spread":0.2732274009816479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008685606,0.002093493,0.001988225,0.0009984632,0.001352956,0.002501277,0.003468142,0.002187269,0.01608444],"category_scores_gemma":[0.003470892,0.0008656482,0.001278168,0.002906934,0.0007223065,0.006638194,0.002739717,0.001834081,0.004536254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001937021,"about_ca_system_score_gemma":0.002909146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003467578,"about_ca_topic_score_gemma":0.003887062,"domain_scores_codex":[0.9979396,0.0003087255,0.0001364628,0.0007448622,0.0003705075,0.0004998294],"domain_scores_gemma":[0.9980859,0.0008646972,0.0001566117,0.000559263,0.0001862182,0.0001473662],"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.00232715,0.001077192,0.002250046,0.001384988,0.0002125075,0.0004338014,0.0006511575,0.174924,0.02047181,0.04157585,0.06266925,0.6920223],"study_design_scores_gemma":[0.0008801698,0.0004783254,0.0009072162,0.00006879738,0.0001120831,0.0005944403,0.0004001993,0.8623055,0.008416319,0.1040089,0.02175222,0.00007588092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08574332,0.001284848,0.8681496,0.001825426,0.0003092391,0.000903468,0.002470681,0.01428978,0.02502373],"genre_scores_gemma":[0.2186883,0.0004823803,0.765619,0.0005789499,0.0001515331,0.0007114295,0.004948138,0.001112758,0.00770739],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01608444,"threshold_uncertainty_score":0.0538078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2177638926","doi":"10.5555/2095116.2095235","title":"Approximating rooted Steiner networks","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Generalization; Linear programming relaxation; Undirected graph; Mathematics; Approximation algorithm; Discrete mathematics; Linear programming; Focus (optics); Relaxation (psychology); Computer science; Mathematical optimization; Graph","authors":[{"name":"Joseph Cheriyan","is_ca":true},{"name":"Bundit Laekhanukit","is_ca":true},{"name":"Guyslain Naves","is_ca":true},{"name":"Adrian Vetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01763125246592238,"gpt":0.252691496209125,"spread":0.2350602437432026,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357257,0.0008987084,0.001079742,0.0009871023,0.0006413446,0.002038158,0.002321159,0.001338067,0.006019447],"category_scores_gemma":[0.01468005,0.000721538,0.0008573646,0.001941294,0.001074107,0.005135025,0.002441752,0.002291915,0.000759244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002035999,"about_ca_system_score_gemma":0.0007950001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001929805,"about_ca_topic_score_gemma":0.003021328,"domain_scores_codex":[0.9983358,0.0005401224,0.00008002566,0.0003790566,0.0004416384,0.0002234627],"domain_scores_gemma":[0.9922047,0.005579858,0.0005649867,0.0008959681,0.0004440057,0.0003104197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003865676,0.0001206926,0.001989622,0.0004078058,0.00007592399,0.00015167,0.0003324525,0.7355159,0.003678229,0.1787516,0.008933757,0.06965581],"study_design_scores_gemma":[0.00003082017,0.00003985323,0.0003886892,0.00003676862,0.00002098966,0.0001069568,0.0000937109,0.8345957,0.001054323,0.1600073,0.003615214,0.000009683245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1462526,0.001752251,0.8196985,0.001898435,0.0001161646,0.0001234691,0.001081718,0.0009602782,0.02811668],"genre_scores_gemma":[0.7372486,0.001588125,0.2510248,0.0003823181,0.0001486575,0.0001825505,0.001894274,0.0003544145,0.007176259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006019447,"threshold_uncertainty_score":0.02013707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990177682","doi":"10.5555/1873601.1873636","title":"Asymmetric traveling salesman path and directed latency problems","year":2010,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Linear programming relaxation; Combinatorics; Approximation algorithm; Binary logarithm; Mathematics; Log-log plot; Path (computing); Upper and lower bounds; Relaxation (psychology); Latency (audio); Linear programming; Discrete mathematics; Computer science; Mathematical optimization","authors":[{"name":"Zachary Friggstad","is_ca":true},{"name":"Mohammad R. Salavatipour","is_ca":true},{"name":"Zoya Svitkina","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01167170768584514,"gpt":0.2338271851916558,"spread":0.2221554775058107,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001828305,0.001623991,0.001169609,0.001225012,0.0007896933,0.001991368,0.0042983,0.001777976,0.005401441],"category_scores_gemma":[0.01207031,0.0005782119,0.00105664,0.002425845,0.001410993,0.008027821,0.002266183,0.004258407,0.0004922741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002487257,"about_ca_system_score_gemma":0.001450337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002918449,"about_ca_topic_score_gemma":0.001840353,"domain_scores_codex":[0.9980877,0.0004590261,0.00008690575,0.0004233347,0.0005308358,0.0004121638],"domain_scores_gemma":[0.9932626,0.00465553,0.0007430456,0.0005285213,0.0004148631,0.0003954742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004148464,0.0003488234,0.001607251,0.0005718802,0.00007828547,0.0002425875,0.0003694218,0.4879091,0.003295302,0.4268686,0.006662276,0.07163171],"study_design_scores_gemma":[0.00004617099,0.0001035692,0.0003002283,0.00004667525,0.00003229217,0.0002026744,0.0001572035,0.7118566,0.001925231,0.2791431,0.006167364,0.00001889397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1145479,0.002063389,0.8603325,0.00221243,0.0002119056,0.0001401364,0.0005639951,0.0006113754,0.01931638],"genre_scores_gemma":[0.6805435,0.002686653,0.3042235,0.0005898895,0.0005109281,0.0002852803,0.0009581749,0.0002946837,0.00990743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005401441,"threshold_uncertainty_score":0.01806957,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154903757","doi":"10.5555/2095116.2095161","title":"Gathering despite mischief","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Byzantine architecture; Computer science; Node (physics); Upper and lower bounds; Matching (statistics); Byzantine fault tolerance; Theoretical computer science; Combinatorics; Mathematics; Distributed computing; Fault tolerance; Physics","authors":[{"name":"Yoann Dieudonné","is_ca":true},{"name":"Andrzej Pelc","is_ca":true},{"name":"David Peleg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01828212569785315,"gpt":0.2676465739180216,"spread":0.2493644482201685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003117352,0.001353504,0.001363854,0.0006527484,0.003329417,0.002178737,0.003138431,0.002179665,0.006499572],"category_scores_gemma":[0.02085341,0.0009223937,0.00105967,0.0009416963,0.002465697,0.00525531,0.005333432,0.002320329,0.001743675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001440121,"about_ca_system_score_gemma":0.001793642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002640005,"about_ca_topic_score_gemma":0.003617061,"domain_scores_codex":[0.9964842,0.0009078447,0.0002062926,0.001221765,0.0005384692,0.000641406],"domain_scores_gemma":[0.9819641,0.007132697,0.001753196,0.006802524,0.001443886,0.0009035899],"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.002038427,0.0003391536,0.01309516,0.001624149,0.0003810379,0.001997157,0.006405028,0.2808651,0.04526488,0.3238992,0.02668265,0.297408],"study_design_scores_gemma":[0.0001840011,0.0006146212,0.002752403,0.0001912497,0.0001948693,0.001411675,0.001303713,0.6478388,0.02427148,0.2608461,0.06030554,0.00008545243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1474614,0.0005210744,0.8219665,0.003511198,0.0001528255,0.0003044873,0.0004563186,0.002331206,0.02329505],"genre_scores_gemma":[0.7301435,0.0003503804,0.2522759,0.0006318966,0.000106549,0.0003286571,0.0006889958,0.0004468897,0.01502735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006499572,"threshold_uncertainty_score":0.02174318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143618826","doi":"10.5555/2634074.2634097","title":"Arboricity and spanning-tree packing in random graphs with an application to load balancing","year":2014,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Arboricity; Combinatorics; Mathematics; Random graph; Graph; Disjoint sets; Spanning tree; Degree (music); Minimum spanning tree; Discrete mathematics; Planar graph; Physics","authors":[{"name":"Pu Gao","is_ca":true},{"name":"Xavier Pérez‐Giménez","is_ca":true},{"name":"Cristiane M. Sato","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007603731631552604,"gpt":0.2650003601434302,"spread":0.2573966285118776,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00299034,0.001073557,0.001121332,0.002939524,0.001300154,0.002019622,0.001791253,0.001803353,0.002326474],"category_scores_gemma":[0.02125192,0.0007412791,0.0009710857,0.002332206,0.003782659,0.003939538,0.002523467,0.001954346,0.0002944387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001719854,"about_ca_system_score_gemma":0.0005115911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008746114,"about_ca_topic_score_gemma":0.000796692,"domain_scores_codex":[0.9983991,0.0007778598,0.00006349963,0.0002697204,0.0002747919,0.0002150015],"domain_scores_gemma":[0.9754335,0.01818352,0.003215104,0.001167353,0.0007624942,0.001238069],"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.0003331056,0.0001668903,0.00468758,0.0002562091,0.00009372773,0.0006993275,0.000571352,0.2923698,0.009658431,0.669312,0.003083783,0.01876777],"study_design_scores_gemma":[0.00003535263,0.00009760446,0.0008399888,0.00003432289,0.00002842603,0.0003264195,0.00009255204,0.7465931,0.001883568,0.2488431,0.001196481,0.00002912344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4075578,0.002628694,0.5737762,0.003059646,0.000119334,0.0001461956,0.0002023878,0.0004472002,0.01206252],"genre_scores_gemma":[0.9600911,0.001244816,0.03484376,0.000288902,0.0002871845,0.000166554,0.000136016,0.0001123692,0.002829246],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00299034,"threshold_uncertainty_score":0.0158146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006093991","doi":"10.5555/982792.982915","title":"A maiden analysis of Longest Wait First","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Multicast; Computer science; Scheduling (production processes); Competitive analysis; Computer network; Mathematical optimization; Mathematics","authors":[{"name":"Jeff Edmonds","is_ca":true},{"name":"Kirk Pruhs","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01377934051919067,"gpt":0.2597916619559201,"spread":0.2460123214367295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004620641,0.002227935,0.001893614,0.002893706,0.002165378,0.003294894,0.00423863,0.00203736,0.02346835],"category_scores_gemma":[0.02385545,0.001067612,0.00165435,0.002434418,0.002364498,0.007910718,0.002244645,0.004856122,0.003304364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004854235,"about_ca_system_score_gemma":0.002564531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004024385,"about_ca_topic_score_gemma":0.002467989,"domain_scores_codex":[0.9978702,0.0005031662,0.00007075958,0.000337768,0.000661632,0.0005564552],"domain_scores_gemma":[0.9880623,0.008476972,0.0008882438,0.0007422068,0.001143603,0.0006867218],"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.0004185315,0.0001431092,0.0009004573,0.0004164919,0.0001144908,0.0001279492,0.0002852107,0.1682065,0.003869039,0.768135,0.01595339,0.04142996],"study_design_scores_gemma":[0.00005271048,0.0001074516,0.0002403007,0.00007519995,0.0000679511,0.00007760251,0.00003891464,0.6661388,0.001864391,0.3217867,0.009516742,0.00003316814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03588038,0.00624232,0.882159,0.004838656,0.0004531769,0.000157463,0.0004566729,0.001040564,0.06877173],"genre_scores_gemma":[0.7036538,0.007639189,0.2146249,0.003232166,0.002080323,0.000882398,0.0008669498,0.00179284,0.06522737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02346835,"threshold_uncertainty_score":0.07850945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W88251305","doi":"10.5555/2095116.2095168","title":"A little advice can be very helpful","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Logarithm; Advice (programming); Communication complexity; Multiplicative function; Conjecture; Computer science; Set (abstract data type); Protocol (science); Mathematics; Time complexity; Theoretical computer science; Upper and lower bounds; Discrete mathematics","authors":[{"name":"Arkadev Chattopadhyay","is_ca":true},{"name":"Jeff Edmonds","is_ca":true},{"name":"Faith Ellen","is_ca":true},{"name":"Toniann Pitassi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02044801421950783,"gpt":0.2604827027832461,"spread":0.2400346885637383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002798549,0.001573763,0.001415421,0.0009406839,0.003300213,0.004590553,0.002498483,0.004861211,0.07356017],"category_scores_gemma":[0.02677878,0.001144977,0.001358552,0.001328811,0.003581407,0.01735008,0.005349311,0.006803619,0.04001835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001926165,"about_ca_system_score_gemma":0.001705416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001142951,"about_ca_topic_score_gemma":0.001741144,"domain_scores_codex":[0.9950971,0.001157713,0.0002254474,0.001364516,0.001478878,0.0006763055],"domain_scores_gemma":[0.9752157,0.01431304,0.001014172,0.006201393,0.001968798,0.001286895],"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.0009471826,0.0004872153,0.001873474,0.0008681668,0.0001129815,0.000445378,0.001045404,0.00534113,0.01342906,0.5842596,0.1606454,0.230545],"study_design_scores_gemma":[0.00009917645,0.0001856601,0.0006528471,0.0002451959,0.00007265813,0.0006846873,0.0004684773,0.02030628,0.009333703,0.7004426,0.2674126,0.0000961982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0453901,0.00483404,0.5089405,0.09405337,0.003900375,0.0004058372,0.002509484,0.009562772,0.3304035],"genre_scores_gemma":[0.483005,0.003789251,0.2328762,0.0168159,0.001615978,0.000737883,0.002943398,0.003610766,0.2546057],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07356017,"threshold_uncertainty_score":0.2460833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118345845","doi":"10.5555/982792.982935","title":"Bipartite roots of graphs","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Complete bipartite graph; Graph isomorphism; Discrete mathematics; Time complexity; Graph; Line graph","authors":[{"name":"Lap Chi Lau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0109872731967097,"gpt":0.2419567528321393,"spread":0.2309694796354296,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004461544,0.0005482213,0.0006351568,0.001099932,0.0008525521,0.001656051,0.0009256362,0.001197432,0.008853654],"category_scores_gemma":[0.004454507,0.0004579611,0.0006219113,0.001422022,0.001497427,0.003464775,0.002095833,0.001780813,0.002129119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009971746,"about_ca_system_score_gemma":0.0006399765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001085194,"about_ca_topic_score_gemma":0.001373273,"domain_scores_codex":[0.9985862,0.000302075,0.0000816515,0.0004887856,0.0003319984,0.0002093477],"domain_scores_gemma":[0.9976588,0.001118825,0.0002526527,0.000469206,0.0003495653,0.0001509959],"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.0002919277,0.0001321275,0.002409036,0.0006649781,0.0000674459,0.0004680116,0.0008334397,0.01914594,0.02661281,0.7779341,0.02751678,0.1439233],"study_design_scores_gemma":[0.00005081596,0.00008692762,0.001264446,0.00007243001,0.00002790208,0.0008108041,0.0003137072,0.05472012,0.00800672,0.8743914,0.06021976,0.00003482881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1337395,0.001453911,0.7986434,0.002104545,0.0003843393,0.0006063419,0.003543275,0.003359159,0.05616556],"genre_scores_gemma":[0.5805346,0.001079247,0.3905882,0.0008957904,0.0003605729,0.000425065,0.005355821,0.0006137075,0.02014707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008853654,"threshold_uncertainty_score":0.02961838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2243190840","doi":"10.5555/2722129.2722244","title":"Four terminal planar Delta-Wye reducibility via rooted K2,4 minors","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Graph; Discrete mathematics; Terminal (telecommunication); Mathematical proof; Computer science; Geometry; Telecommunications","authors":[{"name":"Lino Demasi","is_ca":true},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03958629530490731,"gpt":0.3045966474345863,"spread":0.2650103521296789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001973995,0.0005326066,0.000396866,0.0005786752,0.0006816738,0.001145729,0.0006582327,0.0004016066,0.0055847],"category_scores_gemma":[0.001427021,0.0004289925,0.0009811621,0.0004976193,0.00108193,0.001456234,0.001626938,0.0014959,0.0009110702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006751058,"about_ca_system_score_gemma":0.0004535476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0013762,"about_ca_topic_score_gemma":0.001895327,"domain_scores_codex":[0.999634,0.00004155752,0.00002105213,0.0001095366,0.0001120297,0.00008170071],"domain_scores_gemma":[0.9993325,0.0002367468,0.0000962472,0.0001948542,0.00007621597,0.0000634357],"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.0005674115,0.0002607978,0.003484813,0.0005623131,0.00007965923,0.001582577,0.001560897,0.05743147,0.07997295,0.6836815,0.008257411,0.1625582],"study_design_scores_gemma":[0.0000844015,0.0002174568,0.002280092,0.00005297743,0.00006373135,0.001274374,0.0006031179,0.08283524,0.06793615,0.8197407,0.02485301,0.00005880565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6363701,0.0001661371,0.3206537,0.0005044937,0.00005426471,0.0001723306,0.000666376,0.001358665,0.040054],"genre_scores_gemma":[0.8544525,0.0002585223,0.1266196,0.0001169134,0.00003014666,0.00009287897,0.001871624,0.0003252162,0.0162325],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0055847,"threshold_uncertainty_score":0.01868266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970126214","doi":"10.5555/1109557.1109603","title":"Implicit dictionaries with O(1) modifications per update and fast search","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Constant (computer programming); Set (abstract data type); Computer science; Order (exchange); Search cost; Combinatorics; Binary logarithm; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Programming language","authors":[{"name":"Gianni Franceschini","is_ca":true},{"name":"J. Ian Munro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008316166533379635,"gpt":0.2350977895385778,"spread":0.2267816230051982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215672,0.0007140532,0.001269229,0.0006809589,0.000733648,0.001890256,0.00236404,0.001592517,0.004070517],"category_scores_gemma":[0.01474535,0.0007769153,0.0004692439,0.002094426,0.001509868,0.01109279,0.002877543,0.001747844,0.002393064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007728777,"about_ca_system_score_gemma":0.001352565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007961873,"about_ca_topic_score_gemma":0.001833378,"domain_scores_codex":[0.9979232,0.0003900921,0.0002453188,0.0003388729,0.0008122784,0.0002902944],"domain_scores_gemma":[0.9835374,0.007585921,0.001569171,0.006310614,0.0007414955,0.0002555209],"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.00307857,0.0005157469,0.004784886,0.0007888424,0.00009666975,0.0003612131,0.000828049,0.1393543,0.03798397,0.158977,0.01906266,0.6341681],"study_design_scores_gemma":[0.000607206,0.001199289,0.002227466,0.0001623912,0.000119011,0.001984622,0.000411408,0.7342826,0.05333906,0.1788568,0.02667764,0.0001325021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1569838,0.001688325,0.8242071,0.0016617,0.0002170252,0.0002543207,0.000516434,0.002573302,0.01189806],"genre_scores_gemma":[0.484574,0.0007451338,0.4996945,0.0004675332,0.0003254544,0.0003935772,0.0008710949,0.000421472,0.01250726],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004070517,"threshold_uncertainty_score":0.01361722,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081622490","doi":"10.5555/338219.338260","title":"A fast algorithm to generate unlabeled necklaces","year":2000,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Artificial intelligence; Algorithm","authors":[{"name":"Frank Ruskey","is_ca":true},{"name":"Joe Sawada","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009245848424656271,"gpt":0.2503925321792809,"spread":0.2411466837546246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009319276,0.00190824,0.001426935,0.002666237,0.001691207,0.001479586,0.002575396,0.002137661,0.0148178],"category_scores_gemma":[0.003765664,0.001238115,0.0012455,0.002443174,0.000927739,0.001942229,0.002900104,0.002437026,0.008283988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008338204,"about_ca_system_score_gemma":0.00219914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005694348,"about_ca_topic_score_gemma":0.01322117,"domain_scores_codex":[0.9989773,0.0001068782,0.00007735813,0.0002991062,0.0004485834,0.00009077029],"domain_scores_gemma":[0.9975358,0.0006500948,0.0001289512,0.0007480248,0.0008055223,0.0001316119],"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.0003226489,0.0001198111,0.0003764184,0.0001871845,0.00004466447,0.0001170128,0.0001151695,0.03164574,0.03644066,0.009622308,0.01477276,0.9062356],"study_design_scores_gemma":[0.0001034714,0.0001521419,0.0003800871,0.00004521391,0.00004719733,0.0003383459,0.00006741983,0.9046171,0.05850019,0.01628269,0.01940678,0.00005944924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003245352,0.0000927935,0.9916801,0.00005282446,0.00006303796,0.0001516932,0.0002471988,0.00362578,0.0008412848],"genre_scores_gemma":[0.01368279,0.0000666069,0.9819036,0.00004358554,0.0000282322,0.0001726064,0.0009122618,0.0003950297,0.002795153],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0148178,"threshold_uncertainty_score":0.0495705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015639925","doi":"10.5555/1283383.1283392","title":"Improved bounds for the symmetric rendezvous value on the line","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rendezvous; Conjecture; Mathematics; Semidefinite programming; Value (mathematics); Markov decision process; Line (geometry); Mathematical optimization; Quadratic equation; Markov chain; Applied mathematics; Combinatorics; Markov process; Discrete mathematics; Physics; Statistics; Geometry","authors":[{"name":"Qiaoming Han","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Juan C. Vera","is_ca":false},{"name":"Luis F. Zuluaga","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02388050190607395,"gpt":0.2873125432453776,"spread":0.2634320413393036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005171525,0.00166111,0.002066398,0.002443867,0.001603694,0.00340758,0.003762998,0.001873471,0.01150023],"category_scores_gemma":[0.03078275,0.0006532054,0.001461401,0.001922122,0.003957401,0.007083123,0.003832895,0.004430615,0.001628885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003250712,"about_ca_system_score_gemma":0.001816136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002241071,"about_ca_topic_score_gemma":0.002144959,"domain_scores_codex":[0.9955004,0.001399526,0.0001381035,0.0008484931,0.001028376,0.001085081],"domain_scores_gemma":[0.9686717,0.02285407,0.002038066,0.002498292,0.002740191,0.001197723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001269079,0.0002511841,0.002918401,0.0004571969,0.0001498914,0.0002408267,0.0004583569,0.5189872,0.01494754,0.4059801,0.006263506,0.04807671],"study_design_scores_gemma":[0.00005390223,0.0001635931,0.0005012535,0.00008974102,0.00003387306,0.0001069049,0.0002096179,0.8050183,0.007188387,0.1844786,0.002094208,0.00006155358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1828914,0.002911312,0.7625824,0.001735202,0.0001868335,0.0001865909,0.0005336397,0.0008906664,0.04808197],"genre_scores_gemma":[0.8829045,0.001079605,0.1093632,0.0003252795,0.0001396428,0.0002170572,0.0004967197,0.0003983216,0.005075601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01150023,"threshold_uncertainty_score":0.03847212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071492694","doi":"10.5555/365411.365780","title":"On validating planar worlds","year":2001,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Correctness; Planar straight-line graph; Planar; Planar graph; Embedding; Computer science; Graph; Robot; Book embedding; Graph embedding; Theoretical computer science; Algorithm; Artificial intelligence; Computer graphics (images); Line graph","authors":[{"name":"Vida Dujmoviác","is_ca":false},{"name":"Sue Whitesides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01043334910638345,"gpt":0.2273625299195004,"spread":0.216929180813117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004737547,0.001706208,0.001358468,0.001390251,0.001800899,0.003186156,0.003360029,0.002912258,0.008676257],"category_scores_gemma":[0.04002359,0.001103727,0.002028806,0.00174946,0.00547709,0.0114151,0.008397879,0.003337876,0.001879924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001520571,"about_ca_system_score_gemma":0.002084896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004763053,"about_ca_topic_score_gemma":0.003971,"domain_scores_codex":[0.9920849,0.003034523,0.0003683025,0.001668924,0.002107851,0.0007355065],"domain_scores_gemma":[0.9642593,0.02544113,0.001639929,0.005376067,0.002832965,0.0004505661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007890865,0.0001559162,0.002316043,0.0005123844,0.0001194195,0.0005405385,0.0007691365,0.4379095,0.005768419,0.3232351,0.007795583,0.2200888],"study_design_scores_gemma":[0.00009029048,0.0001067501,0.0003369108,0.0001018757,0.00004809465,0.0001807233,0.0002913984,0.6149712,0.007830495,0.367572,0.008423727,0.00004651817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01080839,0.0001717866,0.98467,0.0005307121,0.00004059053,0.00007347556,0.0001244611,0.0009145127,0.002666027],"genre_scores_gemma":[0.2595168,0.0005847565,0.7326362,0.0004231832,0.00009977266,0.0002645871,0.001282907,0.0007151071,0.004476751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008676257,"threshold_uncertainty_score":0.02902496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994128719","doi":"10.5555/365411.365789","title":"Linear reductions of maximum matching","year":2001,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":5,"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":"Matching (statistics); Computer science; Mathematics; Statistics","authors":[{"name":"Thérèse Biedl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02791080801521452,"gpt":0.2495155277405985,"spread":0.221604719725384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002907491,0.001497852,0.00267605,0.002082812,0.002924219,0.005278592,0.00445697,0.002448446,0.0338654],"category_scores_gemma":[0.01052354,0.001367869,0.003505597,0.003782316,0.003356229,0.008489537,0.005796684,0.008505418,0.004968097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004926497,"about_ca_system_score_gemma":0.002578557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00222131,"about_ca_topic_score_gemma":0.00259768,"domain_scores_codex":[0.9963021,0.001586147,0.000126574,0.0007663516,0.0007061992,0.0005126076],"domain_scores_gemma":[0.9948952,0.003272848,0.0002267122,0.000997034,0.0003264036,0.0002818346],"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.0001086967,0.00009837771,0.00006663231,0.0001017156,0.00002572091,0.00001324291,0.0001357531,0.007842678,0.0003412171,0.9553246,0.01374782,0.02219353],"study_design_scores_gemma":[0.00003439226,0.00001225744,0.00003774964,0.00001484365,0.00001256228,0.00001227608,0.00001729873,0.01530956,0.0003124699,0.9803914,0.003837867,0.000007257338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05398203,0.002636663,0.6903615,0.009401983,0.001202092,0.000355114,0.001616507,0.002235876,0.2382082],"genre_scores_gemma":[0.6097854,0.00206783,0.2420868,0.004123039,0.00198187,0.001105299,0.00258737,0.002115773,0.1341465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0338654,"threshold_uncertainty_score":0.113291,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962748838","doi":"10.5555/3310435.3310479","title":"Testing halfspaces over rotation-invariant distributions","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Logarithm; Invariant (physics); Mathematics; Rotation (mathematics); Function (biology); Distribution (mathematics); Probability distribution; Sign (mathematics); Discrete mathematics; Combinatorics; Sign function; Algorithm; Mathematical analysis; Geometry; Statistics","authors":[{"name":"Nathaniel Harms","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01017916966396251,"gpt":0.2524591371140157,"spread":0.2422799674500532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004087693,0.0009133109,0.00132232,0.001567098,0.0007339102,0.001954931,0.002812503,0.001959497,0.004290334],"category_scores_gemma":[0.03691076,0.0006223854,0.001276623,0.001142701,0.002841018,0.005240706,0.005190045,0.002019123,0.0008657199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009435181,"about_ca_system_score_gemma":0.001245081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001150418,"about_ca_topic_score_gemma":0.0006622325,"domain_scores_codex":[0.9957426,0.001270771,0.0003380267,0.001042302,0.001197443,0.0004087887],"domain_scores_gemma":[0.9739391,0.01921556,0.0015801,0.003242182,0.001208963,0.0008140339],"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.003221033,0.0003810772,0.02968181,0.0003753105,0.0003803112,0.0004743162,0.0005501587,0.2473231,0.02030444,0.1434978,0.005679803,0.5481308],"study_design_scores_gemma":[0.0001092998,0.0002832633,0.001918274,0.0000424682,0.00002123336,0.0002429124,0.0001359973,0.8213049,0.00993912,0.1647456,0.001209981,0.00004693804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1192883,0.0002186811,0.8769317,0.000444826,0.0000465313,0.00008943229,0.0003309107,0.001028359,0.00162132],"genre_scores_gemma":[0.7529256,0.0001236302,0.2435914,0.0003818256,0.00007784649,0.0002171121,0.001245404,0.0001923598,0.00124476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004290334,"threshold_uncertainty_score":0.02161801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2569985645","doi":"10.5555/2627817.2627876","title":"The traveling salesman problem for lines, balls and planes","year":2013,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Travelling salesman problem; Combinatorics; Plane (geometry); Approximation algorithm; Mathematics; Space (punctuation); Unit sphere; Set (abstract data type); Unit (ring theory); Mathematical optimization; Computer science; Geometry","authors":[{"name":"Adrian Dumitrescu","is_ca":false},{"name":"Csaba D. Tóth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01009252159896281,"gpt":0.2369226588160777,"spread":0.2268301372171149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000482997,0.0006135564,0.0007925229,0.0006242864,0.0006596275,0.001285861,0.001373436,0.0009507842,0.004903793],"category_scores_gemma":[0.003530965,0.0005097332,0.000828689,0.001360408,0.0005006228,0.003438236,0.0009104225,0.001116919,0.001051598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001373746,"about_ca_system_score_gemma":0.0009168141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01344731,"about_ca_topic_score_gemma":0.01084004,"domain_scores_codex":[0.9994985,0.0001525971,0.00003004119,0.0001166655,0.0001211873,0.00008106304],"domain_scores_gemma":[0.9992945,0.0003988716,0.00008502248,0.00009424207,0.00008138249,0.00004597023],"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.0002892534,0.0001381949,0.001129848,0.0002543661,0.00004764742,0.0002143007,0.0002657563,0.6657012,0.002790479,0.1689396,0.01600162,0.1442278],"study_design_scores_gemma":[0.00002491369,0.00005717313,0.00022305,0.00002216664,0.00001377859,0.00009747167,0.00009873376,0.9332641,0.001018547,0.05543554,0.009733648,0.0000108605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09902538,0.001644337,0.8807581,0.001025299,0.00015722,0.000138107,0.0005666444,0.0009447716,0.01574014],"genre_scores_gemma":[0.3432201,0.001883666,0.6366518,0.0001735032,0.000114158,0.0002129948,0.001243434,0.0004141717,0.0160861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01344731,"threshold_uncertainty_score":0.02673811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984099766","doi":"10.5555/1283383.1283472","title":"Lower bounds on average-case delay for video-on-demand broadcast protocols","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Communication source; Upper and lower bounds; Bandwidth (computing); Atomic broadcast; Video on demand; Matching (statistics); Computer network; Set (abstract data type); Constant (computer programming); Broadcasting (networking); Mathematics; Statistics","authors":[{"name":"Wei-Lung Dustin Tseng","is_ca":true},{"name":"David Kirkpatrick","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02433597484567163,"gpt":0.3356211953914677,"spread":0.311285220545796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01293964,0.005524495,0.004633185,0.007246006,0.004481189,0.01030107,0.007233613,0.003525174,0.009317373],"category_scores_gemma":[0.07491066,0.002086106,0.00222589,0.007167918,0.004750718,0.01896732,0.006413352,0.01066129,0.003002861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01264804,"about_ca_system_score_gemma":0.004759952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003645867,"about_ca_topic_score_gemma":0.004298239,"domain_scores_codex":[0.984926,0.002284974,0.0008990677,0.002982591,0.004970735,0.003936603],"domain_scores_gemma":[0.8782163,0.09491102,0.005879966,0.007883503,0.009911004,0.00319815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002211158,0.0008150555,0.003402324,0.001940251,0.0003797714,0.0004517977,0.00129972,0.4697049,0.02009317,0.3752699,0.0175938,0.1068382],"study_design_scores_gemma":[0.00007299885,0.0002436791,0.0008264571,0.0003667512,0.0002121732,0.0005005264,0.0003998281,0.7205612,0.009797219,0.2568831,0.009989156,0.0001469244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0399482,0.01942779,0.8949001,0.003905705,0.0007364564,0.0002567405,0.001274276,0.001643033,0.03790763],"genre_scores_gemma":[0.7099675,0.02418977,0.2370271,0.00257103,0.002822853,0.001425567,0.00245868,0.002687373,0.01685021],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01293964,"threshold_uncertainty_score":0.09176832,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}