{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":101,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":101,"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":"43b255e45fbe","filters":{"venue":"ACM Transactions on Algorithms"}},"results":[{"id":"W1974033543","doi":"10.1145/1290672.1290680","title":"Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":378,"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":"Prefix; Encoding (memory); Trie; Computer science; Prefix code; Theoretical computer science; Tree (set theory); Combinatorics; Mathematics; Data structure; Algorithm; Decoding methods; Artificial intelligence; Programming language","authors":[{"name":"Rajeev Raman","is_ca":false},{"name":"Venkatesh Raman","is_ca":false},{"name":"Srinivasa Rao Satti","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0167703244268879,"gpt":0.2608292871613097,"spread":0.2440589627344218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006384462,0.0004288735,0.0008815259,0.000743105,0.0006444185,0.001819245,0.001360328,0.0009118584,0.004591396],"category_scores_gemma":[0.004151108,0.0004217413,0.0005690484,0.002719855,0.001234524,0.005531064,0.002223447,0.001960989,0.001260577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001253064,"about_ca_system_score_gemma":0.00075938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001221493,"about_ca_topic_score_gemma":0.002226557,"domain_scores_codex":[0.9992946,0.0001186533,0.0001119366,0.0001353348,0.0002537402,0.00008565549],"domain_scores_gemma":[0.9976215,0.0008260115,0.0002053002,0.0009633505,0.0002830609,0.0001008675],"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.0008690734,0.0003108799,0.001995478,0.0005548705,0.00004369181,0.0005333515,0.001347199,0.1176647,0.02889325,0.4946411,0.01588401,0.3372625],"study_design_scores_gemma":[0.000128855,0.000336973,0.000580102,0.0001845365,0.00004968831,0.0007025794,0.0005576719,0.4574439,0.04723132,0.4476316,0.04504282,0.0001100177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1409972,0.00146971,0.8388299,0.002053522,0.0002689703,0.0002094847,0.001949485,0.003230056,0.01099163],"genre_scores_gemma":[0.386604,0.0009689777,0.6023071,0.0004864769,0.0001478446,0.0002539277,0.00226941,0.0003606101,0.0066016],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004591396,"threshold_uncertainty_score":0.01535976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030970869","doi":"10.1145/1597036.1597045","title":"A better approximation ratio for the vertex cover problem","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Vertex cover; Cover (algebra); Relaxation (psychology); Vertex (graph theory); Maximum cut; Approximation algorithm; Set cover problem; Set (abstract data type); Discrete mathematics; Computer science; Graph","authors":[{"name":"George Karakostas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0276875545897699,"gpt":0.2638624229823917,"spread":0.2361748683926218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005101317,0.003560206,0.002747485,0.002032764,0.001039317,0.004581069,0.003983286,0.004144082,0.02482462],"category_scores_gemma":[0.0254202,0.0008472944,0.003130029,0.00296978,0.001544376,0.010881,0.003580556,0.008313023,0.005788654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003254429,"about_ca_system_score_gemma":0.002572152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002562769,"about_ca_topic_score_gemma":0.002963669,"domain_scores_codex":[0.9930823,0.002094771,0.0002093114,0.001621482,0.001774978,0.001217166],"domain_scores_gemma":[0.9860219,0.008052012,0.0005977625,0.003705475,0.0009581965,0.000664708],"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.003141178,0.002080884,0.003196175,0.001331339,0.0004495121,0.0004887141,0.000588604,0.2611635,0.02516682,0.2588535,0.07528844,0.3682514],"study_design_scores_gemma":[0.0003504677,0.0003977418,0.0007308785,0.0001230443,0.0001551502,0.0007621582,0.0001591472,0.7947406,0.006352617,0.1777636,0.01840167,0.0000629965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0799201,0.006633948,0.8468265,0.01265601,0.001886283,0.0003286779,0.001310526,0.003653926,0.04678413],"genre_scores_gemma":[0.459565,0.003203072,0.5050095,0.004404626,0.002163604,0.0005921061,0.003535984,0.002442033,0.01908408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02482462,"threshold_uncertainty_score":0.08304662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170344325","doi":"10.1145/1273340.1273343","title":"Multicommodity demand flow in a tree and packing integer programs","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"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":"Linear programming relaxation; Mathematics; Cardinality (data modeling); Multi-commodity flow problem; Integer programming; Knapsack problem; Mathematical optimization; Steiner tree problem; Tree (set theory); Combinatorics; Approximation algorithm; Integer (computer science); Flow network; Discrete mathematics; Computer science","authors":[{"name":"Chandra Chekuri","is_ca":false},{"name":"Marcelo Mydlarz","is_ca":false},{"name":"F. Bruce Shepherd","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0341002519929163,"gpt":0.3108631411316437,"spread":0.2767628891387274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00206716,0.001470247,0.001332528,0.00127721,0.0009091361,0.002362593,0.001095304,0.001908835,0.004631894],"category_scores_gemma":[0.005707904,0.001091784,0.001544546,0.003082086,0.001408924,0.004302402,0.00151289,0.002947728,0.0004019325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002344752,"about_ca_system_score_gemma":0.001042649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002931808,"about_ca_topic_score_gemma":0.002253304,"domain_scores_codex":[0.9989148,0.0003904562,0.00004591457,0.0001933433,0.0002270586,0.0002283684],"domain_scores_gemma":[0.9974611,0.001925702,0.0002632138,0.00009679993,0.0001426324,0.000110399],"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.0001565508,0.000206278,0.0006836905,0.0002711365,0.00005684788,0.0002175137,0.0003133622,0.7075287,0.001415463,0.2662064,0.003420002,0.01952408],"study_design_scores_gemma":[0.00002206458,0.00003667954,0.000165619,0.00002134383,0.00001376224,0.00006202758,0.00005200799,0.9121754,0.0004908899,0.08458865,0.00236119,0.00001039599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09932126,0.002407195,0.8663508,0.001858963,0.0001526905,0.0001517666,0.0004780824,0.0003299698,0.02894929],"genre_scores_gemma":[0.5960359,0.002377514,0.388135,0.0006890778,0.0003373245,0.0004462116,0.0006615418,0.0002517398,0.01106563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004631894,"threshold_uncertainty_score":0.01701248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020899710","doi":"10.1145/1328911.1328924","title":"Faster approximation schemes for fractional multicommodity flow problems","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Multi-commodity flow problem; Flow (mathematics); Fleischer; Representation (politics); Combinatorics; Upper and lower bounds; Flow network; Time complexity; Discrete mathematics; Tree (set theory); Maximum flow problem; Theory of computation; Approximation algorithm; Algorithm","authors":[{"name":"George Karakostas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06449367461059989,"gpt":0.2738331663970109,"spread":0.209339491786411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002536275,0.00139387,0.001271517,0.001048823,0.001070658,0.002049831,0.002891871,0.001769711,0.005716364],"category_scores_gemma":[0.01089837,0.0005808616,0.001632078,0.001458638,0.001189278,0.005388995,0.002669308,0.003050424,0.001228765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002601425,"about_ca_system_score_gemma":0.001406641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00475008,"about_ca_topic_score_gemma":0.004492473,"domain_scores_codex":[0.997915,0.0004500316,0.0001205052,0.0003206884,0.000827963,0.0003658358],"domain_scores_gemma":[0.995764,0.002067747,0.0002601767,0.001303818,0.0004523342,0.0001517918],"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.0007155525,0.0002766789,0.00123646,0.0003973109,0.00008926958,0.0001213874,0.000633479,0.5459632,0.009195814,0.16565,0.007036095,0.2686847],"study_design_scores_gemma":[0.00006167623,0.00004319827,0.000105065,0.00002596717,0.00001507954,0.00004140703,0.00003247724,0.9361392,0.001547322,0.05850523,0.003468619,0.00001481831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01823869,0.000581936,0.9753003,0.0003343918,0.00009730527,0.00009308774,0.00009838394,0.00104623,0.00420974],"genre_scores_gemma":[0.278949,0.0004057135,0.7152773,0.0002248925,0.0001136423,0.0002753055,0.0003748027,0.0003509892,0.004028322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005716364,"threshold_uncertainty_score":0.01912314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967391655","doi":"10.1145/1383369.1383382","title":"Fault-tolerant facility location","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":90,"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":"Division of Computing and Communication Foundations; National Science Foundation","keywords":"Facility location problem; Rounding; Approximation algorithm; Metric (unit); Randomized rounding; 1-center problem; Generalization; Mathematical optimization; Metric space; Mathematics; Computer science; Fault tolerance; Dual (grammatical number); Function (biology); Randomized algorithm; Algorithm; Discrete mathematics; Distributed computing","authors":[{"name":"Chaitanya Swamy","is_ca":true},{"name":"David B. Shmoys","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04730761318528802,"gpt":0.2439437647047697,"spread":0.1966361515194817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008299497,0.0007319556,0.001300625,0.0004680299,0.0006801261,0.001231962,0.002389162,0.001549566,0.00409423],"category_scores_gemma":[0.003335864,0.0003700741,0.00082389,0.001302114,0.0007266506,0.002236417,0.001422151,0.001159941,0.0005701124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001583937,"about_ca_system_score_gemma":0.0008961743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002783566,"about_ca_topic_score_gemma":0.002378277,"domain_scores_codex":[0.9982893,0.0004810129,0.00006731098,0.000439024,0.0003771821,0.0003462035],"domain_scores_gemma":[0.9987227,0.0004905696,0.0002027598,0.0002640431,0.000180875,0.0001390416],"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.0002435512,0.0000923394,0.0005221599,0.00009651252,0.00004418893,0.0002356946,0.00004961321,0.9257096,0.001355316,0.02926528,0.004023946,0.03836182],"study_design_scores_gemma":[0.00003079296,0.00007900766,0.0001509048,0.000006804534,0.00001138759,0.0001612364,0.00003842965,0.9707487,0.001168608,0.02511506,0.002476374,0.00001274745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05079519,0.0003570507,0.9419153,0.0006401379,0.0001409532,0.0000995001,0.0003084538,0.000583415,0.005160034],"genre_scores_gemma":[0.826037,0.0002833058,0.1687361,0.0002398284,0.0001005028,0.0001144193,0.0003943531,0.00007460159,0.004019809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00409423,"threshold_uncertainty_score":0.01369661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048794017","doi":"10.1145/1367064.1367070","title":"Optimal branch-decomposition of planar graphs in <i>O</i> ( <i>n</i> <sup>3</sup> ) Time","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":89,"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; Decomposition; Planar graph; Mathematics; Graph; Discrete mathematics; Computer science","authors":[{"name":"Qian‐Ping Gu","is_ca":true},{"name":"Hisao Tamaki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01770934675867425,"gpt":0.2716123867468868,"spread":0.2539030399882126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003042189,0.001136128,0.001126493,0.0007801069,0.0005761846,0.001193292,0.0009247511,0.0008166653,0.008687625],"category_scores_gemma":[0.001361853,0.0005698554,0.0009843821,0.001268467,0.0004666717,0.002157553,0.001625892,0.001191138,0.002858077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006380015,"about_ca_system_score_gemma":0.0007178057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001547959,"about_ca_topic_score_gemma":0.003320026,"domain_scores_codex":[0.9996754,0.00004830675,0.00001833017,0.00007147007,0.00008910106,0.00009732266],"domain_scores_gemma":[0.9994868,0.0002096506,0.00005681672,0.0001112128,0.00006282515,0.0000727031],"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.001258836,0.0003232629,0.002589683,0.001165727,0.0001199964,0.0003667648,0.0006210859,0.1457901,0.08544161,0.04970964,0.03341749,0.6791958],"study_design_scores_gemma":[0.0004637433,0.0004343305,0.002622217,0.0001716712,0.0001393802,0.0005897657,0.0007021396,0.706715,0.04577343,0.2220821,0.02024752,0.00005877715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2117887,0.0009976897,0.757351,0.0008073091,0.00007801437,0.0002837073,0.001416344,0.003803969,0.02347323],"genre_scores_gemma":[0.2555512,0.0006547854,0.7319876,0.0001857003,0.00003686003,0.0002611397,0.003968653,0.0006295289,0.006724501],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008687625,"threshold_uncertainty_score":0.02906299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128634904","doi":"10.1145/2629656","title":"Gathering Despite Mischief","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Israeli Centers for Research Excellence; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Byzantine architecture; Computer science; Node (physics); Upper and lower bounds; Matching (statistics); Combinatorics; Theoretical computer science; Mathematics; Discrete mathematics; Physics; Geography","authors":[{"name":"Yoann Dieudonné","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"David Peleg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02024123927452412,"gpt":0.2543549482875596,"spread":0.2341137090130355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003038284,0.001337432,0.001325645,0.0006414455,0.003311247,0.002142109,0.003119156,0.00217349,0.006486794],"category_scores_gemma":[0.02033135,0.0009184172,0.001035526,0.0009222307,0.002427721,0.005222627,0.005177342,0.002285892,0.001730348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001449037,"about_ca_system_score_gemma":0.001790999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002734772,"about_ca_topic_score_gemma":0.003851533,"domain_scores_codex":[0.996595,0.0008708664,0.0001978672,0.001189252,0.0005262076,0.0006207973],"domain_scores_gemma":[0.9825736,0.006835528,0.001703426,0.00660445,0.001413599,0.0008694233],"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.002006485,0.0003331543,0.0130625,0.001577049,0.0003678363,0.002061824,0.006292228,0.2880429,0.04537805,0.3169556,0.02693666,0.2969857],"study_design_scores_gemma":[0.0001798655,0.0005942662,0.00267772,0.0001870698,0.0001890683,0.001401202,0.001292863,0.6580473,0.02416782,0.2505366,0.06064176,0.00008455909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1466503,0.0005145654,0.8225099,0.003457667,0.0001529378,0.0003009569,0.0004568974,0.00238247,0.02357423],"genre_scores_gemma":[0.7280418,0.0003453796,0.2542703,0.0006365247,0.0001029608,0.000321493,0.0006896717,0.0004508366,0.01514111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006486794,"threshold_uncertainty_score":0.0217005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149565746","doi":"10.1145/1824777.1824786","title":"On distributing symmetric streaming computations","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"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":"Computer science; Computation; Sublinear function; Communication complexity; Theoretical computer science; Computational complexity theory; Class (philosophy); Streaming algorithm; Algorithm; Distributed computing; Mathematics; Upper and lower bounds; Discrete mathematics","authors":[{"name":"Jon Feldman","is_ca":false},{"name":"S. Muthukrishnan","is_ca":false},{"name":"Anastasios Sidiropoulos","is_ca":false},{"name":"Clifford Stein","is_ca":false},{"name":"Zoya Svitkina","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02021759233371228,"gpt":0.2677943535910513,"spread":0.247576761257339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003179575,0.0008078296,0.001185589,0.0007659183,0.00151734,0.002535283,0.002110593,0.001202249,0.006023813],"category_scores_gemma":[0.01844064,0.0005402242,0.001035931,0.001402197,0.003065086,0.007721324,0.003639875,0.002227164,0.001173383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002425964,"about_ca_system_score_gemma":0.002536896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001936073,"about_ca_topic_score_gemma":0.001438818,"domain_scores_codex":[0.9964309,0.00106105,0.0002274271,0.000741948,0.001047718,0.000490984],"domain_scores_gemma":[0.9893876,0.005016707,0.000654683,0.003390065,0.001173026,0.0003778624],"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.0004708289,0.0001072242,0.001432108,0.0001530018,0.00003802632,0.0001241931,0.0002852721,0.1719889,0.004966989,0.7784947,0.003977944,0.0379609],"study_design_scores_gemma":[0.00007156713,0.00007873781,0.0001508387,0.00002299159,0.00001759422,0.00007664783,0.0000560821,0.5520679,0.003064918,0.4398777,0.004495849,0.0000190321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05217927,0.0002343318,0.9333778,0.001110467,0.000137277,0.000186724,0.0001893033,0.0009795272,0.01160531],"genre_scores_gemma":[0.7482094,0.0005464114,0.2385445,0.0006230081,0.0002935737,0.0004793844,0.0004873747,0.0003825309,0.01043405],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006023813,"threshold_uncertainty_score":0.02015167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060363698","doi":"10.1145/1290672.1290685","title":"Approximation algorithms and hardness results for cycle packing problems","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"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 Alberta","funders":"","keywords":"Approximation algorithm; Combinatorics; Disjoint sets; Mathematics; Upper and lower bounds; Packing problems; Undirected graph; Binary logarithm; Log-log plot; Discrete mathematics; Graph; Algorithm","authors":[{"name":"Michael Krivelevich","is_ca":false},{"name":"Zeev Nutov","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true},{"name":"Jacques Verstraëte","is_ca":true},{"name":"Raphael Yuster","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04104861257864342,"gpt":0.285998406091064,"spread":0.2449497935124205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003530907,0.003368443,0.002694593,0.003218844,0.002442701,0.007959092,0.006354414,0.004331031,0.01034623],"category_scores_gemma":[0.02689593,0.00194058,0.003979444,0.007157277,0.003515933,0.01251064,0.004355549,0.008243607,0.001867594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006079181,"about_ca_system_score_gemma":0.002479064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003971525,"about_ca_topic_score_gemma":0.002612035,"domain_scores_codex":[0.9939227,0.001414027,0.0003647955,0.001490507,0.001704206,0.001103797],"domain_scores_gemma":[0.9792781,0.01560287,0.001259256,0.00238859,0.0008428048,0.0006283082],"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.00114272,0.0008846932,0.003336681,0.001462474,0.000347228,0.0002965914,0.0009659021,0.5053006,0.004554944,0.3311287,0.02696725,0.1236123],"study_design_scores_gemma":[0.0001472922,0.00007223445,0.0005489192,0.0001214538,0.00008386674,0.0002391649,0.0001638791,0.6395373,0.00171941,0.3505262,0.006805443,0.00003482712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08015478,0.006611415,0.8653235,0.006285199,0.0002983223,0.0003761626,0.001905477,0.002001995,0.03704321],"genre_scores_gemma":[0.5172083,0.007711952,0.4488488,0.002105589,0.00125591,0.001259088,0.005926514,0.001349952,0.01433388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01034623,"threshold_uncertainty_score":0.04410774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152623377","doi":"10.1145/1921659.1921663","title":"Tree exploration with logarithmic memory","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":57,"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":"Engineering and Physical Sciences Research Council; Royal Society","keywords":"Tree traversal; Node (physics); Traverse; Binary logarithm; Computer science; Tree (set theory); Logarithm; Graph; Upper and lower bounds; Mathematics; Theoretical computer science; Combinatorics; Discrete mathematics; Algorithm","authors":[{"name":"Christoph Ambühl","is_ca":false},{"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.0695535220691234,"gpt":0.2535367779472618,"spread":0.1839832558781384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004768119,0.000664183,0.0008101299,0.0005319755,0.0007569289,0.001424194,0.001759413,0.001157632,0.00890852],"category_scores_gemma":[0.004698718,0.0003416073,0.0006814786,0.001215762,0.0008332919,0.005341371,0.002135182,0.0009566001,0.001580247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008616146,"about_ca_system_score_gemma":0.0008052894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002094957,"about_ca_topic_score_gemma":0.002395911,"domain_scores_codex":[0.9994701,0.0001121409,0.00003061478,0.0001179183,0.0001037607,0.0001655114],"domain_scores_gemma":[0.9979072,0.00124034,0.0001733104,0.0004219531,0.0001325792,0.0001247592],"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.002172488,0.0002452257,0.002285818,0.0006837369,0.0001064648,0.0005083198,0.0005145972,0.690487,0.01392836,0.1185366,0.01355054,0.1569808],"study_design_scores_gemma":[0.0001058329,0.0001382068,0.0001916151,0.00002527294,0.00003288222,0.0001377789,0.00007026217,0.8732919,0.003567233,0.1180793,0.004342837,0.00001689732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1772003,0.002035035,0.7905157,0.001488724,0.0001464855,0.0001396739,0.0007438735,0.003079285,0.02465086],"genre_scores_gemma":[0.7061142,0.0009093629,0.2783747,0.0003566244,0.00006529933,0.0003085715,0.0008090432,0.0004284189,0.01263382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00890852,"threshold_uncertainty_score":0.02980196,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129029222","doi":"10.1145/2483699.2483702","title":"Persistent Predecessor Search and Orthogonal Point Location on the Word RAM","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Point location; Data structure; Combinatorics; Mathematics; Binary search tree; Linear space; Binary logarithm; Sequence (biology); Space (punctuation); Amortized analysis; Recursion (computer science); Set (abstract data type); Subdivision; Computational geometry; Discrete mathematics; Point (geometry); Algorithm; Binary tree; Computer science; Geometry","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02918945584233274,"gpt":0.254282221392127,"spread":0.2250927655497942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002260945,0.0007254041,0.001668619,0.001614785,0.001539745,0.00335827,0.003721596,0.001514594,0.004574958],"category_scores_gemma":[0.0130198,0.0009655986,0.001182821,0.004322469,0.003996412,0.01692063,0.005735596,0.002390901,0.002118762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001402436,"about_ca_system_score_gemma":0.00197754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002606852,"about_ca_topic_score_gemma":0.003055765,"domain_scores_codex":[0.9969553,0.0005427911,0.0003627484,0.0008699985,0.0007865514,0.0004826938],"domain_scores_gemma":[0.9850875,0.004191746,0.001162522,0.008225181,0.0009885879,0.0003444914],"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.001375546,0.0002512183,0.004776175,0.000470502,0.00007276743,0.0002511879,0.00181324,0.0390422,0.02479127,0.5357952,0.01362854,0.3777322],"study_design_scores_gemma":[0.000251992,0.0009009496,0.001207825,0.0001652911,0.0001575213,0.0009034228,0.0007649152,0.24893,0.046668,0.6435924,0.05625356,0.000204066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.133967,0.001745446,0.8486217,0.001606092,0.000199007,0.0001445663,0.0007402758,0.004548035,0.008427984],"genre_scores_gemma":[0.3955331,0.0008377808,0.5927808,0.0006290628,0.0002914772,0.0003599215,0.001104572,0.0008276568,0.007635712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004574958,"threshold_uncertainty_score":0.01530474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1870153077","doi":"10.1145/2850418","title":"The Traveling Salesman Problem for Lines, Balls, and Planes","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Combinatorics; Hyperplane; Mathematics; Constant (computer programming); Plane (geometry); Bottleneck traveling salesman problem; Set (abstract data type); 2-opt; Unit (ring theory); Mathematical optimization; Computer science; Geometry","authors":[{"name":"Adrian Dumitrescu","is_ca":false},{"name":"Csaba D. Tóth","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02093933631693614,"gpt":0.2534848759101476,"spread":0.2325455395932114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553426,0.0006474815,0.000853118,0.0008273603,0.0007643463,0.001336672,0.001711697,0.0009466328,0.005079574],"category_scores_gemma":[0.003313895,0.0006386884,0.0009209799,0.001523479,0.0005793916,0.004679732,0.001115718,0.001188605,0.001069878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001327205,"about_ca_system_score_gemma":0.0009721039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0136144,"about_ca_topic_score_gemma":0.01133841,"domain_scores_codex":[0.9994748,0.000149258,0.00003493701,0.0001316086,0.0001285764,0.00008087341],"domain_scores_gemma":[0.9994385,0.0002756828,0.00007077542,0.00009110566,0.0000810973,0.00004276654],"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.0003003977,0.0001437776,0.00137236,0.0003133929,0.00005388396,0.0002542185,0.0003015479,0.5649841,0.00267089,0.216336,0.02068902,0.1925804],"study_design_scores_gemma":[0.00003088386,0.00005484168,0.0002065141,0.0000274065,0.00001409866,0.0001110904,0.0001182277,0.9191422,0.0009020183,0.06741144,0.01196927,0.00001190606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05798138,0.001598532,0.927711,0.0009923261,0.0001497114,0.0001199452,0.0004273574,0.0006799697,0.01033996],"genre_scores_gemma":[0.2292344,0.002136167,0.7541631,0.000169495,0.0001281248,0.0002523246,0.001118177,0.0002874034,0.01251087],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0136144,"threshold_uncertainty_score":0.02707028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967030015","doi":"10.1145/1159892.1159899","title":"An approximation algorithm for scheduling malleable tasks under general precedence constraints","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Job shop scheduling; Scheduling (production processes); Computer science; Approximation algorithm; Task (project management); Schedule; Mathematical optimization; Asymptotically optimal algorithm; Algorithm; Mathematics","authors":[{"name":"Klaus Jansen","is_ca":false},{"name":"Hu Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01780910403492818,"gpt":0.2558425173541906,"spread":0.2380334133192624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001703214,0.001262551,0.001364833,0.0008640531,0.00102278,0.001237441,0.002323602,0.001462319,0.00352226],"category_scores_gemma":[0.005520944,0.0006342754,0.0008081175,0.00194356,0.0007155018,0.00303188,0.001433341,0.001633227,0.0009377555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001883578,"about_ca_system_score_gemma":0.002409705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005049833,"about_ca_topic_score_gemma":0.006159305,"domain_scores_codex":[0.9988195,0.0002901953,0.00006718026,0.000182338,0.0003670787,0.0002736356],"domain_scores_gemma":[0.998174,0.001112217,0.000170298,0.0002994109,0.0001366116,0.0001075747],"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.0009299348,0.0002656514,0.0008984436,0.00031828,0.00009284128,0.0001635412,0.0002661131,0.7870507,0.005123532,0.02808599,0.006320035,0.1704849],"study_design_scores_gemma":[0.0001050954,0.0000748439,0.00008232451,0.00001285107,0.00001801857,0.00007086686,0.0000302249,0.9804927,0.0006465107,0.01703802,0.001420011,0.000008639156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02618391,0.0008221354,0.9676049,0.0003661939,0.00009070607,0.00009348815,0.00009176548,0.001291861,0.003455003],"genre_scores_gemma":[0.2813222,0.0006384884,0.7140204,0.0002295182,0.000105101,0.0002265629,0.0004161808,0.0002354799,0.002806069],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005049833,"threshold_uncertainty_score":0.01366639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160685416","doi":"10.1145/1824777.1824788","title":"Fast asynchronous Byzantine agreement and leader election with full information","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Distributed systems and fault tolerance","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":"University of Victoria","funders":"National Science Foundation","keywords":"Asynchronous communication; Leader election; Quantum Byzantine agreement; Computer science; Byzantine architecture; Adversary; Protocol (science); Constant (computer programming); Computation; Theoretical computer science; Monte Carlo method; Key (lock); Distributed computing; Computer network; Byzantine fault tolerance; Computer security; Mathematics; Algorithm; Fault tolerance; Statistics","authors":[{"name":"Bruce M. Kapron","is_ca":true},{"name":"David Kempe","is_ca":false},{"name":"Valerie King","is_ca":true},{"name":"Jared Saia","is_ca":false},{"name":"Vishal Sanwalani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006362793586701465,"gpt":0.2146225370539929,"spread":0.2082597434672915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003785528,0.0008125292,0.001207542,0.0009053994,0.00167302,0.002413447,0.003298542,0.001845114,0.002382356],"category_scores_gemma":[0.01267453,0.0005796095,0.001028107,0.001201315,0.00340792,0.009725669,0.003930505,0.003648277,0.0007975868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001487828,"about_ca_system_score_gemma":0.001529855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009719432,"about_ca_topic_score_gemma":0.000808258,"domain_scores_codex":[0.9961171,0.001276654,0.0001770224,0.0006330102,0.001225492,0.0005706939],"domain_scores_gemma":[0.9893296,0.00558199,0.001096574,0.002965948,0.000679276,0.0003465696],"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.0003579267,0.00009957227,0.0003927235,0.0001432587,0.00003246581,0.000196629,0.0005413103,0.1395553,0.006475946,0.8124792,0.00259265,0.03713309],"study_design_scores_gemma":[0.0001004319,0.0001204393,0.00009643323,0.00002131222,0.00002035528,0.0001084513,0.00005009564,0.4795454,0.007846803,0.5057704,0.006281017,0.00003883079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02558795,0.0002083057,0.9689881,0.0006446706,0.0000847557,0.00008824721,0.00005050156,0.0003883585,0.003959175],"genre_scores_gemma":[0.6287782,0.0005859769,0.3595151,0.0003852743,0.0003144827,0.0005265126,0.0001484758,0.0002853482,0.009460616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003785528,"threshold_uncertainty_score":0.02002001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2623433906","doi":"10.1145/2000807.2000820","title":"Succinct indexes for strings, binary relations and multilabeled trees","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":50,"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":"String (physics); Set (abstract data type); Constant (computer programming); Binary number; Encoding (memory); Computer science; Rank (graph theory); Type (biology); Mathematics; Theoretical computer science; Combinatorics; Discrete mathematics; Arithmetic","authors":[{"name":"Jérémy Barbay","is_ca":false},{"name":"Meng He","is_ca":true},{"name":"J. Ian Munro","is_ca":true},{"name":"Srinivasa Rao Satti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04277822346220179,"gpt":0.2595635280352131,"spread":0.2167853045730113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00207549,0.0009250278,0.001043237,0.001931261,0.000999146,0.004020662,0.002158514,0.001110298,0.006111727],"category_scores_gemma":[0.01208609,0.0008041866,0.001304509,0.004053947,0.002804109,0.01450138,0.003562805,0.002828073,0.002585093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001945267,"about_ca_system_score_gemma":0.00196729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001004247,"about_ca_topic_score_gemma":0.001494003,"domain_scores_codex":[0.9960275,0.000620333,0.0006562052,0.0005321706,0.00186877,0.0002949651],"domain_scores_gemma":[0.9910877,0.002921084,0.001191534,0.0033381,0.001182942,0.0002787668],"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.0005308723,0.0001464702,0.001431456,0.0006919084,0.00004736704,0.0002910648,0.0009556079,0.03273256,0.03032741,0.7006647,0.01287871,0.2193018],"study_design_scores_gemma":[0.0001125883,0.0003931254,0.0004954064,0.0003368802,0.0000957104,0.0006211501,0.0003257406,0.195613,0.09882907,0.5833567,0.1196275,0.0001931032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007574237,0.0003006466,0.9864741,0.0002568209,0.00009120521,0.0001339443,0.000720057,0.00187712,0.002571784],"genre_scores_gemma":[0.1005104,0.0008000904,0.8871221,0.0004993795,0.0001503727,0.0005406155,0.002648414,0.001114032,0.006614547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006111727,"threshold_uncertainty_score":0.02044582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2294341534","doi":"10.1145/2151171.2151177","title":"Elimination graphs","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","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":"University of Toronto","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Discrete mathematics; Block graph; Indifference graph; Intersection graph; Pathwidth; Independent set; Line graph; Graph; 1-planar graph","authors":[{"name":"Yuli Ye","is_ca":true},{"name":"Allan Borodin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03386978660748272,"gpt":0.3117522609886645,"spread":0.2778824743811819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007460489,0.0008351257,0.0008049089,0.001500618,0.003141765,0.002416071,0.0026345,0.001026067,0.03671997],"category_scores_gemma":[0.003987723,0.0005199228,0.001340962,0.002471985,0.001482754,0.005757838,0.003096965,0.002403446,0.007834388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001438178,"about_ca_system_score_gemma":0.001251735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002581918,"about_ca_topic_score_gemma":0.003609185,"domain_scores_codex":[0.9986147,0.0002665754,0.00008166715,0.0004159628,0.0003756965,0.0002454309],"domain_scores_gemma":[0.9973624,0.0009524755,0.0002803485,0.0006333843,0.0005734313,0.0001979248],"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.00005388999,0.00006836016,0.000891935,0.0001978006,0.00003206146,0.0002534091,0.0002636969,0.003267336,0.0009616358,0.9155798,0.02495508,0.05347504],"study_design_scores_gemma":[0.00003274769,0.00003576354,0.0004995024,0.00007327517,0.00004404402,0.0008667544,0.0002802743,0.007015212,0.001592998,0.70913,0.2804053,0.00002411887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04620407,0.002664557,0.6198014,0.004001425,0.001092513,0.0005881172,0.004383977,0.001546589,0.3197173],"genre_scores_gemma":[0.4064302,0.004897689,0.3376331,0.004891208,0.001125924,0.001147674,0.01783503,0.001513494,0.2245256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03671997,"threshold_uncertainty_score":0.1228406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2618717009","doi":"10.1145/2344422.2344426","title":"The effectiveness of stackelberg strategies and tolls for network congestion games","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stackelberg competition; Price of anarchy; Nash equilibrium; Latency (audio); Computer science; Routing (electronic design automation); Mathematical optimization; Fraction (chemistry); Flow network; Mathematics; Mathematical economics; Price of stability; Computer network; Economics","authors":[{"name":"Chaitanya Swamy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06770159463362163,"gpt":0.3755214159717994,"spread":0.3078198213381778,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003777462,0.001593171,0.001202904,0.001904995,0.001115298,0.00302146,0.001922003,0.001576988,0.003514436],"category_scores_gemma":[0.02097624,0.0005893644,0.001067386,0.0008507963,0.005021009,0.005795076,0.002360562,0.002137877,0.0002527396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0033734,"about_ca_system_score_gemma":0.001832819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002917639,"about_ca_topic_score_gemma":0.001835961,"domain_scores_codex":[0.9979466,0.000902282,0.00009164817,0.0002265229,0.0004708414,0.000362158],"domain_scores_gemma":[0.9840983,0.01184161,0.001671929,0.0006348669,0.0006777075,0.001075628],"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.0002346794,0.0001098288,0.0008484466,0.0001384128,0.00009060995,0.0001239622,0.000235991,0.2738438,0.002080147,0.7024302,0.001159923,0.01870405],"study_design_scores_gemma":[0.0000593238,0.0001129606,0.0002031202,0.00003190144,0.00003421415,0.00006193297,0.00008902261,0.4568701,0.0009722243,0.5402834,0.001240622,0.00004109506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3089305,0.001653442,0.6178921,0.002606654,0.0002138691,0.0002283644,0.0002140358,0.0003992899,0.06786173],"genre_scores_gemma":[0.9748409,0.0007442529,0.01939647,0.0001915653,0.0001134424,0.00014255,0.00004355614,0.0000558589,0.004471565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003777462,"threshold_uncertainty_score":0.02447581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2623150993","doi":"10.1145/2344422.2344424","title":"All-pairs shortest paths for unweighted undirected graphs in <i>o</i> ( <i>mn</i> ) time","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":45,"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":"Log-log plot; Combinatorics; Binary logarithm; Mathematics; Undirected graph; Running time; Graph; Time complexity; Discrete mathematics; Algorithm","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03057676437967018,"gpt":0.2668495776188133,"spread":0.2362728132391431,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001326872,0.002029974,0.001688467,0.001367461,0.001630345,0.002874159,0.002972205,0.001611815,0.01119626],"category_scores_gemma":[0.006542698,0.0009886614,0.001726112,0.00257935,0.001082552,0.01085237,0.003800526,0.001599304,0.002595754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002043786,"about_ca_system_score_gemma":0.002523328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002833813,"about_ca_topic_score_gemma":0.005155643,"domain_scores_codex":[0.9978492,0.0005181818,0.0001904631,0.0007275499,0.0004005325,0.0003140918],"domain_scores_gemma":[0.995976,0.002183121,0.000449729,0.0007837723,0.0002993813,0.0003079142],"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.001484971,0.0006889256,0.002823205,0.003160582,0.0003460497,0.0005472637,0.001482823,0.2551612,0.02729773,0.1033095,0.04187528,0.5618225],"study_design_scores_gemma":[0.0006170223,0.0004997706,0.001263474,0.000175667,0.0002004411,0.0009190458,0.001175786,0.5218437,0.02081741,0.4162505,0.03611876,0.0001184885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1305842,0.001761309,0.8342351,0.002678525,0.0003110928,0.0009333415,0.002467419,0.005612167,0.02141673],"genre_scores_gemma":[0.2175597,0.001070348,0.7657136,0.0002910273,0.0001603732,0.0005340654,0.004014109,0.00109889,0.009557887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01119626,"threshold_uncertainty_score":0.0374552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2735816714","doi":"10.1145/3086464","title":"Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":44,"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":"Submodular set function; Mathematics; Matroid; Combinatorics; Discrete mathematics; Monotone polygon; Automatic summarization; Cardinality (data modeling); Mathematical optimization; Computer science; Data mining","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Aadhar Jain","is_ca":false},{"name":"Hyun Chul Lee","is_ca":false},{"name":"Yuli Ye","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02398333559549957,"gpt":0.2634854953105933,"spread":0.2395021597150938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003733509,0.001997568,0.002859974,0.001375884,0.001129356,0.002599157,0.003107983,0.001829528,0.004603413],"category_scores_gemma":[0.01180267,0.0007769883,0.00128971,0.003946644,0.001669219,0.007662277,0.002973244,0.002838991,0.0009986669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002186038,"about_ca_system_score_gemma":0.001243423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001404697,"about_ca_topic_score_gemma":0.00150302,"domain_scores_codex":[0.9977794,0.0009281129,0.00008453269,0.0004657264,0.0004937305,0.0002484421],"domain_scores_gemma":[0.9947731,0.003559651,0.000516446,0.0006417144,0.0002524912,0.0002565965],"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.0006828344,0.0005819286,0.002080547,0.0005148232,0.0002319528,0.0002509528,0.0003209043,0.5780213,0.002941203,0.171244,0.01602505,0.2271043],"study_design_scores_gemma":[0.00007080103,0.0001385642,0.0003417456,0.00003307307,0.0000345853,0.0001774976,0.00006739479,0.7910768,0.00111083,0.2036454,0.00328221,0.00002115698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05375798,0.003000386,0.9289062,0.001832673,0.00009640505,0.0002424991,0.0006130461,0.0007715644,0.01077932],"genre_scores_gemma":[0.5844526,0.001868513,0.4039394,0.000809184,0.0003332148,0.0005147959,0.00118383,0.0003073802,0.006591066],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004603413,"threshold_uncertainty_score":0.01974493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012661148","doi":"10.1145/1798596.1798598","title":"An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cycle basis; Combinatorics; Permutation (music); Hamiltonian path; Eulerian path; Set (abstract data type); Recursion (computer science); Discrete mathematics; Directed graph; Graph; Algorithm; Lagrangian; Computer science; Pure mathematics; Line graph","authors":[{"name":"Frank Ruskey","is_ca":true},{"name":"Aaron Williams","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01335900375409101,"gpt":0.279052694683911,"spread":0.26569369092982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002748205,0.0003901802,0.0002952424,0.0005389104,0.0009748803,0.0006059897,0.0006879102,0.0004749994,0.006772544],"category_scores_gemma":[0.001336097,0.0002887881,0.0005059022,0.0005365299,0.001039888,0.001339872,0.001122971,0.0005736767,0.001103687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007417183,"about_ca_system_score_gemma":0.000902986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00157258,"about_ca_topic_score_gemma":0.002797771,"domain_scores_codex":[0.9997193,0.00005235943,0.00001839501,0.00007747395,0.00005867922,0.00007386082],"domain_scores_gemma":[0.9996294,0.0001121168,0.00004907186,0.00009597492,0.00007079676,0.00004267334],"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.0000935865,0.00005682347,0.001172861,0.0001800756,0.00001809025,0.0002776703,0.0006053732,0.017614,0.01700111,0.8598439,0.00295289,0.1001836],"study_design_scores_gemma":[0.00004920402,0.0001525677,0.0007212455,0.0001155105,0.00004446985,0.0006042962,0.0002420727,0.1108944,0.04436292,0.782814,0.05993075,0.00006841309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1340927,0.0002208024,0.8309003,0.000310643,0.00008015569,0.0002084723,0.0003488706,0.0008611741,0.03297698],"genre_scores_gemma":[0.5329524,0.000240145,0.4462284,0.0001803378,0.00002247088,0.0002576497,0.0005142016,0.0002787378,0.0193256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006772544,"threshold_uncertainty_score":0.02265644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963287397","doi":"10.1145/3301446","title":"Approximation Schemes for Clustering with Outliers","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":43,"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":"Cluster analysis; Outlier; Facility location problem; Metric (unit); Metric space; Computer science; Overhead (engineering); Set (abstract data type); Mathematics; Data point; Integer (computer science); Euclidean distance; Combinatorics; Algorithm; Mathematical optimization; Discrete mathematics; Artificial intelligence","authors":[{"name":"Zachary Friggstad","is_ca":true},{"name":"Kamyar Khodamoradi","is_ca":true},{"name":"Mohsen Rezapour","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02495465689786409,"gpt":0.2364930078429651,"spread":0.211538350945101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005410288,0.002106879,0.002724314,0.002546737,0.001414908,0.00327046,0.005381846,0.003282611,0.007049238],"category_scores_gemma":[0.02400738,0.000985902,0.00217948,0.00521793,0.001882728,0.005102674,0.004826842,0.004981456,0.002884753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003890908,"about_ca_system_score_gemma":0.002086611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005108947,"about_ca_topic_score_gemma":0.003796581,"domain_scores_codex":[0.9958972,0.001420483,0.0002610785,0.000775443,0.001301578,0.0003443088],"domain_scores_gemma":[0.9911231,0.004550137,0.0007605289,0.001799088,0.001454673,0.0003124588],"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.0002876094,0.00007701412,0.0008070117,0.000526162,0.0001399486,0.00009895279,0.0003146612,0.633333,0.00115121,0.2251786,0.01566471,0.1224211],"study_design_scores_gemma":[0.00002455114,0.00004436329,0.0001228685,0.00005616737,0.00002080978,0.00005991686,0.00004399753,0.8762715,0.0003316972,0.1167197,0.006286526,0.00001802632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003215638,0.00196884,0.9901161,0.0005492246,0.0001649294,0.0000753742,0.0001980129,0.0004451591,0.003266675],"genre_scores_gemma":[0.2505388,0.005806788,0.7213398,0.0007079735,0.0008748215,0.0006903069,0.001992972,0.0007103375,0.01733814],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007049238,"threshold_uncertainty_score":0.02861267,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980190601","doi":"10.1145/1721837.1721842","title":"Comparison-based time-space lower bounds for selection","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":42,"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":"Upper and lower bounds; Binary logarithm; Mathematics; Combinatorics; Log-log plot; Streaming algorithm; Running time; Space (punctuation); Mathematical proof; Selection (genetic algorithm); Discrete mathematics; Randomized algorithm; Deterministic algorithm; Time complexity; Algorithm; Computer science","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02494796243462718,"gpt":0.2988886896203971,"spread":0.2739407271857699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01063844,0.003665762,0.004645961,0.003003168,0.003948686,0.008690389,0.008493712,0.004247738,0.02652756],"category_scores_gemma":[0.05833688,0.001953393,0.004831475,0.006526199,0.006574535,0.03367518,0.009762943,0.01159238,0.005346808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007550335,"about_ca_system_score_gemma":0.006010574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001968152,"about_ca_topic_score_gemma":0.002315704,"domain_scores_codex":[0.9788291,0.004733439,0.000961372,0.004519468,0.006297282,0.004659244],"domain_scores_gemma":[0.8934503,0.08047304,0.005316256,0.01422699,0.003861266,0.002672148],"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.004937831,0.001581663,0.007687297,0.001990397,0.0004400612,0.0005660555,0.001106306,0.2530101,0.02788321,0.4696181,0.03448113,0.1966978],"study_design_scores_gemma":[0.0003552492,0.0007681978,0.001529279,0.0001904554,0.0002878627,0.0006748633,0.0002601979,0.46524,0.01570187,0.5023503,0.01251858,0.0001230619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07369122,0.006154881,0.8527517,0.01026867,0.0006889009,0.0005151188,0.001403165,0.003828711,0.05069763],"genre_scores_gemma":[0.6776325,0.00388163,0.2808081,0.003990192,0.00282518,0.002007572,0.002093577,0.003462176,0.02329905],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02652756,"threshold_uncertainty_score":0.08874351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154044080","doi":"10.1145/1824777.1824789","title":"Lower-bounded facility location","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":42,"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":"National Science Foundation","keywords":"Facility location problem; Bounded function; Constant (computer programming); Upper and lower bounds; Approximation algorithm; Mathematics; Function (biology); 1-center problem; Mathematical optimization; Computer science; Combinatorics","authors":[{"name":"Zoya Svitkina","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02548574267388314,"gpt":0.2473024114824019,"spread":0.2218166688085187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001391405,0.001156421,0.001516507,0.000904271,0.0008345779,0.002314707,0.003665667,0.002013976,0.009849563],"category_scores_gemma":[0.009312317,0.0005606907,0.000984845,0.002392836,0.001473629,0.004523394,0.002840277,0.00292552,0.002158058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002301248,"about_ca_system_score_gemma":0.001298133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004362181,"about_ca_topic_score_gemma":0.002951314,"domain_scores_codex":[0.9973302,0.0008820586,0.0000767665,0.0005076301,0.0006975276,0.0005058131],"domain_scores_gemma":[0.9961223,0.001891603,0.0003798822,0.0008255233,0.0005587605,0.0002219958],"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.000226922,0.0001226959,0.000509891,0.0003481906,0.00005707983,0.000194223,0.000144633,0.6232917,0.001849079,0.2974602,0.01473199,0.06106356],"study_design_scores_gemma":[0.00003081069,0.00005966454,0.0001053958,0.00003997593,0.00001606678,0.0001835748,0.00004457716,0.8596343,0.00107725,0.1259026,0.01288986,0.00001588099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008154888,0.0008415966,0.9801189,0.0005997311,0.0001084388,0.00005237499,0.0001957989,0.0003220238,0.009606323],"genre_scores_gemma":[0.5353734,0.002001118,0.4436825,0.0007391221,0.0002759874,0.000265611,0.001261801,0.00036596,0.01603444],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009849563,"threshold_uncertainty_score":0.0329501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124402683","doi":"10.1145/2229163.2229172","title":"Scalably scheduling processes with arbitrary speedup curves","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"National Science Foundation","keywords":"Speedup; Scheduling (production processes); Computer science; Parallel computing; Algorithm; Mathematics; Mathematical optimization","authors":[{"name":"Jeff Edmonds","is_ca":true},{"name":"Kirk Pruhs","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03193889738509934,"gpt":0.2722814381290204,"spread":0.2403425407439211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001323602,0.001126903,0.001017752,0.0005508893,0.001101577,0.001707069,0.002426292,0.0009786311,0.007739514],"category_scores_gemma":[0.004970075,0.0005432534,0.0007108051,0.001341023,0.001551,0.003001141,0.002352634,0.00178311,0.002256902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002143259,"about_ca_system_score_gemma":0.002281425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003617541,"about_ca_topic_score_gemma":0.004563635,"domain_scores_codex":[0.9989819,0.0001252251,0.00006181954,0.0002228278,0.0003366291,0.0002715521],"domain_scores_gemma":[0.997471,0.0008101499,0.0002099898,0.0008796854,0.0003973184,0.000231922],"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.00212099,0.0003594137,0.00237945,0.0005364518,0.0001048691,0.0003327027,0.0003752667,0.5211437,0.09921835,0.139449,0.01904405,0.2149357],"study_design_scores_gemma":[0.0001339501,0.0001056463,0.0002200313,0.0000117102,0.00002278789,0.00002876681,0.00002866794,0.9260819,0.0163747,0.05356345,0.00341004,0.00001843694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09480968,0.0004331477,0.8797801,0.001011633,0.0002246697,0.0002167052,0.0002783988,0.006136941,0.0171087],"genre_scores_gemma":[0.5829226,0.0004462337,0.3993055,0.0003206108,0.0002319689,0.0004289645,0.000732744,0.001081663,0.01452959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007739514,"threshold_uncertainty_score":0.02589124,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052373622","doi":"10.1145/1328911.1328921","title":"Approximate distance oracles for geometric spanners","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":41,"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":"Mathematics; Combinatorics; Shortest path problem; Constant (computer programming); Data structure; Euclidean space; Binary logarithm; Distance; Oracle; Path (computing); Discrete mathematics; Dilation (metric space); Computational geometry; Graph; Algorithm; Computer science","authors":[{"name":"Joachim Gudmundsson","is_ca":false},{"name":"Christos Levcopoulos","is_ca":false},{"name":"Giri Narasimhan","is_ca":false},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03916038913989277,"gpt":0.2687088556867836,"spread":0.2295484665468908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002141912,0.0008922347,0.002049929,0.001561542,0.0007743369,0.002912102,0.002922942,0.001980378,0.007088672],"category_scores_gemma":[0.02151931,0.0006107343,0.0009606261,0.003530355,0.001454008,0.01390883,0.0046507,0.002152062,0.002084702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001583391,"about_ca_system_score_gemma":0.001295871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001251357,"about_ca_topic_score_gemma":0.001518496,"domain_scores_codex":[0.995326,0.0007655684,0.0006650485,0.001159594,0.001608161,0.0004755377],"domain_scores_gemma":[0.9879563,0.005127537,0.001179913,0.004374572,0.0008597525,0.0005019464],"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.002425399,0.0005072534,0.00897964,0.00110283,0.000156012,0.0003576921,0.001219939,0.3034567,0.01764895,0.2808617,0.01941783,0.3638661],"study_design_scores_gemma":[0.0001473204,0.0003288218,0.00104355,0.00007496458,0.00004905338,0.0004793103,0.0004544287,0.5819937,0.01111514,0.3937987,0.01045441,0.00006069798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2122838,0.001679763,0.7631916,0.002249763,0.0001586722,0.0002356099,0.005671263,0.006352401,0.008177031],"genre_scores_gemma":[0.6894799,0.0007119971,0.2917631,0.0004530345,0.00025031,0.0004234419,0.01096032,0.0005367652,0.005421144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007088672,"threshold_uncertainty_score":0.02371395,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033661244","doi":"10.1145/1435375.1435378","title":"Competitive buffer management for shared-memory switches","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":40,"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":"Competitive analysis; Computer science; Network packet; Queue; Buffer (optical fiber); Preemption; Constraint (computer-aided design); Partition (number theory); Upper and lower bounds; Online algorithm; Computer network; Operating system; Algorithm; Mathematics; Telecommunications","authors":[{"name":"William Aiello","is_ca":true},{"name":"Alex Kesselman","is_ca":false},{"name":"Yishay Mansour","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03958810005221866,"gpt":0.2723584283068775,"spread":0.2327703282546588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002236376,0.0009498781,0.001166055,0.0005744362,0.001241649,0.002718298,0.002557843,0.001421596,0.002637052],"category_scores_gemma":[0.008652984,0.0003608994,0.0004326166,0.0009325875,0.00105002,0.003019158,0.001482131,0.001064319,0.0002029214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002609428,"about_ca_system_score_gemma":0.002015634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003943108,"about_ca_topic_score_gemma":0.002847214,"domain_scores_codex":[0.9982565,0.0005235859,0.00005281372,0.0002253058,0.0004539269,0.0004878984],"domain_scores_gemma":[0.9953843,0.002881152,0.0004614141,0.0002352391,0.0005267342,0.0005111643],"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.0006853698,0.0003830225,0.001552652,0.0002080985,0.00009141079,0.0002495737,0.0001837994,0.7520374,0.008198553,0.2007369,0.003184053,0.03248922],"study_design_scores_gemma":[0.00004006009,0.00007732138,0.0001300256,0.000004627004,0.00001258508,0.00004195236,0.00002850388,0.971644,0.001107456,0.02632779,0.0005779827,0.000007633879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4262123,0.002061586,0.5533981,0.001324693,0.00020175,0.0001945095,0.0001589188,0.0003981051,0.01605002],"genre_scores_gemma":[0.9765733,0.0002768238,0.02159705,0.0001074837,0.00006705229,0.00005514771,0.00004413908,0.00002269443,0.001256254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003943108,"threshold_uncertainty_score":0.01893282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1524471135","doi":"10.1145/2963170","title":"Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Knapsack problem; Approximation algorithm; Oriented matroid; Facility location problem; Matroid partitioning; Mathematics; Weighted matroid; Combinatorics; Polynomial-time approximation scheme; Greedy algorithm; Randomized rounding; Set (abstract data type); Generalization; Computer science; Discrete mathematics; Mathematical optimization; Graphic matroid","authors":[{"name":"Chaitanya Swamy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03083915340769189,"gpt":0.2429966165842655,"spread":0.2121574631765736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002878568,0.002015269,0.002241964,0.001845977,0.00106594,0.003216061,0.003560989,0.002573359,0.01029528],"category_scores_gemma":[0.01143874,0.0009018905,0.002134115,0.005355208,0.0008741632,0.005804263,0.003398543,0.005152491,0.002406051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003364334,"about_ca_system_score_gemma":0.002588712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006337186,"about_ca_topic_score_gemma":0.00801881,"domain_scores_codex":[0.9961727,0.001090368,0.000213805,0.0006726407,0.001282032,0.0005684487],"domain_scores_gemma":[0.9962908,0.001817374,0.0003244168,0.000810179,0.0005691429,0.0001880299],"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.0005301264,0.0006334723,0.0009620622,0.0004695003,0.0001327748,0.0001311483,0.0003369464,0.5740396,0.0022815,0.1550823,0.01852602,0.2468745],"study_design_scores_gemma":[0.00005192561,0.00005592379,0.000157602,0.00003300095,0.00002040404,0.00009150249,0.00006464422,0.9180337,0.0006358344,0.07403382,0.006807454,0.00001427736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01388827,0.002785347,0.9673542,0.001023576,0.0002315704,0.0001321785,0.0003256589,0.00111773,0.01314144],"genre_scores_gemma":[0.1802647,0.002030196,0.8076468,0.0005149069,0.0003823886,0.0003075745,0.001051215,0.0003702095,0.007432085],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01029528,"threshold_uncertainty_score":0.03444111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058105885","doi":"10.1145/1150334.1150337","title":"Bipartite roots of graphs","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"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; Graph isomorphism; Complete bipartite graph; Discrete mathematics; Cograph; Time complexity; Edge-transitive graph; Line graph; Isomorphism (crystallography); Graph; Pathwidth; Voltage graph","authors":[{"name":"Lap Chi Lau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01969786754119153,"gpt":0.2844186336568095,"spread":0.264720766115618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004444755,0.0004374714,0.0006981249,0.001031695,0.001003301,0.001768545,0.0009484112,0.001259795,0.008933133],"category_scores_gemma":[0.004084856,0.0004698551,0.0005382347,0.001267392,0.001572115,0.004104979,0.00219968,0.001796053,0.001998168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008094882,"about_ca_system_score_gemma":0.0005835646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00146218,"about_ca_topic_score_gemma":0.001749073,"domain_scores_codex":[0.9986707,0.0002477198,0.00007102466,0.0004768593,0.0003216875,0.0002120029],"domain_scores_gemma":[0.9978502,0.0009854913,0.0002442511,0.000404051,0.0003331417,0.0001829162],"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.0003162174,0.0001200522,0.00336832,0.0006592502,0.00006764635,0.0004898788,0.001095657,0.01353006,0.02440658,0.8008711,0.02816237,0.1269129],"study_design_scores_gemma":[0.00004110606,0.00006690862,0.001589487,0.00006387218,0.00002779387,0.0007855562,0.0004499484,0.03722242,0.007162099,0.8991502,0.05341088,0.0000297621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2150124,0.001827542,0.7003769,0.003177018,0.0004172831,0.0006115076,0.004653538,0.002987323,0.07093643],"genre_scores_gemma":[0.6218882,0.001119322,0.3435248,0.0009328423,0.0003295602,0.0003540957,0.005574281,0.0005080441,0.02576887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008933133,"threshold_uncertainty_score":0.02988428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125938788","doi":"10.1145/1978782.1978783","title":"Minimizing movement in mobile facility location problems","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":38,"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":"Facility location problem; Approximation algorithm; Computer science; 1-center problem; Simple (philosophy); Node (physics); Mathematical optimization; Mathematics; Algorithm; Physics","authors":[{"name":"Zachary Friggstad","is_ca":true},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05522297262140018,"gpt":0.2392564541287703,"spread":0.1840334815073701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001460081,0.001441551,0.001633322,0.0007004534,0.0008474882,0.001442927,0.002278094,0.002210959,0.005035626],"category_scores_gemma":[0.005201898,0.000673384,0.001235696,0.00202713,0.001158428,0.003299614,0.002168383,0.002122588,0.0009754495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001826237,"about_ca_system_score_gemma":0.0009958565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00219579,"about_ca_topic_score_gemma":0.002040663,"domain_scores_codex":[0.9983674,0.0006127761,0.00006562693,0.0003769396,0.0002794119,0.0002979264],"domain_scores_gemma":[0.998494,0.0009432648,0.0001987402,0.0001609238,0.0001181714,0.00008474947],"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.00043626,0.0001651622,0.0008216536,0.0005436017,0.0001124303,0.0002064616,0.0002707943,0.8046355,0.002266955,0.1079741,0.0110316,0.07153544],"study_design_scores_gemma":[0.0001220206,0.0001947742,0.0003791704,0.00006571947,0.00004467327,0.0002644156,0.0002141536,0.8071979,0.001921279,0.1777484,0.01181723,0.00003027482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03625627,0.0007979438,0.954762,0.001076223,0.00008511043,0.0001815081,0.0004096521,0.0005508288,0.005880393],"genre_scores_gemma":[0.4615862,0.001179345,0.524702,0.000438607,0.0001793458,0.0006052171,0.001380387,0.0003195395,0.009609391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005035626,"threshold_uncertainty_score":0.01684588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055000959","doi":"10.1145/1435375.1435381","title":"Distributed weighted vertex cover via maximal matchings","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"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":"Vertex cover; Combinatorics; Mathematics; Vertex (graph theory); Feedback vertex set; Edge cover; Binary logarithm; Upper and lower bounds; Undirected graph; Matching (statistics); Minimum weight; Cover (algebra); Graph; Discrete mathematics","authors":[{"name":"Fabrizio Grandoni","is_ca":false},{"name":"Jochen Könemann","is_ca":true},{"name":"Alessandro Panconesi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02367927571191205,"gpt":0.2385259495041349,"spread":0.2148466737922228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001185707,0.0006925328,0.00135806,0.0009243283,0.001065081,0.001293141,0.002200465,0.0009552799,0.003338499],"category_scores_gemma":[0.005424391,0.0004634,0.0007463294,0.001861806,0.0009795121,0.004392488,0.003114998,0.0007794916,0.000583633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001354122,"about_ca_system_score_gemma":0.001042607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001417735,"about_ca_topic_score_gemma":0.001913789,"domain_scores_codex":[0.998401,0.0003747191,0.00007237514,0.0004518359,0.0004224011,0.000277721],"domain_scores_gemma":[0.9981945,0.0009296642,0.0001721511,0.0004429348,0.0001414419,0.0001191933],"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.00124651,0.0002455767,0.001634706,0.0003610749,0.0001622788,0.0002696535,0.0002919,0.6310591,0.01902822,0.1053953,0.004622537,0.2356832],"study_design_scores_gemma":[0.00007080343,0.00008458221,0.0001989031,0.00001367346,0.00002466137,0.0001059872,0.00004462371,0.8776768,0.005938052,0.1136289,0.002199656,0.00001334353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.103734,0.0003846555,0.8891002,0.0003580137,0.00005455487,0.0001726887,0.0002119575,0.001047668,0.004936191],"genre_scores_gemma":[0.7290297,0.0002273578,0.2661659,0.0001254781,0.00006230323,0.0002672425,0.0005093416,0.0001412401,0.003471421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003338499,"threshold_uncertainty_score":0.01116836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950424720","doi":"10.1145/2438645.2438649","title":"Delays Induce an Exponential Memory Gap for Rendezvous in Trees","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Rendezvous; Exponential function; Computer science; Psychology; Mathematics; Physics; Astronomy; Mathematical analysis","authors":[{"name":"Pierre Fraigniaud","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05484617889239228,"gpt":0.2967687214655866,"spread":0.2419225425731943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001197718,0.0007744701,0.001196247,0.0007538099,0.001286944,0.002427951,0.001911191,0.001297459,0.005008502],"category_scores_gemma":[0.01516047,0.0006159774,0.0009340771,0.0007703676,0.002258408,0.007395219,0.003381002,0.002337904,0.0005910635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0016185,"about_ca_system_score_gemma":0.00117344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001078527,"about_ca_topic_score_gemma":0.001129683,"domain_scores_codex":[0.9983025,0.0002556833,0.0001108156,0.0003943648,0.000319154,0.0006174466],"domain_scores_gemma":[0.9735051,0.02064152,0.001832689,0.002530367,0.0006056208,0.0008846691],"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.005797451,0.0005080585,0.007752127,0.001281612,0.0002441112,0.00143057,0.002283473,0.4229518,0.08943751,0.3818576,0.006072299,0.08038341],"study_design_scores_gemma":[0.0002462089,0.0004993551,0.001748023,0.00009935698,0.0001545725,0.0007071593,0.0005153238,0.5800928,0.0367219,0.3748338,0.004305626,0.00007594765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8174412,0.001264662,0.1658468,0.00181702,0.00007116166,0.00007331436,0.0004807454,0.00135997,0.01164515],"genre_scores_gemma":[0.9795569,0.0004056222,0.01711802,0.0002111257,0.0000451525,0.0001312507,0.0002080286,0.0002019194,0.00212183],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005008502,"threshold_uncertainty_score":0.01675504,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099914933","doi":"10.1145/1240233.1240237","title":"Improved algorithms for weakly chordal graphs","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"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":"Chordal graph; Combinatorics; Interval graph; Mathematics; Treewidth; Clique problem; Split graph; Discrete mathematics; Computational complexity theory; Clique; Time complexity; Algorithm; Graph; Pathwidth; Line graph; 1-planar graph","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.03253514641846965,"gpt":0.3255083337152803,"spread":0.2929731872968106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001491531,0.001607617,0.001681812,0.001777982,0.001297774,0.002283741,0.005601231,0.001603018,0.009624567],"category_scores_gemma":[0.009295243,0.001030724,0.001740169,0.00238579,0.001306918,0.007796089,0.00582508,0.00313906,0.002811411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00238906,"about_ca_system_score_gemma":0.002209264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004010259,"about_ca_topic_score_gemma":0.005700727,"domain_scores_codex":[0.9961124,0.0006364387,0.0002861823,0.0009800724,0.001334724,0.0006502772],"domain_scores_gemma":[0.9937314,0.002217069,0.0003902121,0.002548504,0.0008712628,0.0002414142],"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.0007724832,0.0006310503,0.001759358,0.0007029701,0.0001233563,0.0002717799,0.0004748056,0.1575901,0.0245265,0.1782455,0.02228723,0.6126149],"study_design_scores_gemma":[0.0002189132,0.0001265358,0.0005537231,0.00004495298,0.00006781543,0.0002335852,0.0001267566,0.6967981,0.01354079,0.2744612,0.01376789,0.0000597845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01402654,0.0002250801,0.9776293,0.0003275255,0.00007475596,0.0001771008,0.000234827,0.003335618,0.003969203],"genre_scores_gemma":[0.1380846,0.0002500961,0.8551428,0.0002058204,0.000117773,0.0003364212,0.001320413,0.000666366,0.003875757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009624567,"threshold_uncertainty_score":0.03219742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083082533","doi":"10.1145/1798596.1798599","title":"An approximation algorithm for the maximum leaf spanning arborescence problem","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Subroutine; Spanning tree; Combinatorics; Mathematics; Approximation algorithm; Class (philosophy); Discrete mathematics; Algorithm; Computer science; Artificial intelligence","authors":[{"name":"Matthew Drescher","is_ca":true},{"name":"Adrian Vetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02426617907818306,"gpt":0.3062330322091877,"spread":0.2819668531310046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005646228,0.001098539,0.0009090218,0.0007866027,0.0008000664,0.001063277,0.002237769,0.001232174,0.005508783],"category_scores_gemma":[0.002337281,0.0004769146,0.0009164027,0.001744472,0.0003650866,0.002604421,0.001599569,0.001931877,0.001777718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001293448,"about_ca_system_score_gemma":0.001284352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002819702,"about_ca_topic_score_gemma":0.004749451,"domain_scores_codex":[0.9992819,0.0001010797,0.00004227168,0.0001911723,0.0002054027,0.0001781365],"domain_scores_gemma":[0.9992059,0.0002695513,0.0000948648,0.0002188504,0.0001161326,0.00009477284],"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.0006041865,0.0006900721,0.002128352,0.0005639009,0.0001313107,0.0003422888,0.0004536133,0.2268691,0.02962571,0.04169445,0.03526683,0.6616302],"study_design_scores_gemma":[0.0002270851,0.0002522837,0.0008354297,0.00003624491,0.00006372584,0.0005129142,0.0001272754,0.9330317,0.007923884,0.04409077,0.01286517,0.00003352951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03561417,0.0004465207,0.9537424,0.0005664697,0.0000650227,0.00017825,0.0003325705,0.003255744,0.005798901],"genre_scores_gemma":[0.1778045,0.0003912174,0.8147226,0.0002009345,0.00006372639,0.0003054567,0.001787956,0.0003149903,0.004408672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005508783,"threshold_uncertainty_score":0.01842868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153294698","doi":"10.1145/2344422.2344432","title":"Succinct ordinal trees based on tree covering","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Tree traversal; Unary operation; Tree (set theory); Mathematics; Combinatorics; Sequence (biology); Set (abstract data type); Parenthesis; Representation (politics); Discrete mathematics; Computer science; Theoretical computer science; Algorithm","authors":[{"name":"Meng He","is_ca":true},{"name":"J. Ian Munro","is_ca":true},{"name":"Srinivasa Rao Satti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0244141420401886,"gpt":0.2632715715759525,"spread":0.2388574295357639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006720838,0.0004471428,0.0006805939,0.001639619,0.0005426854,0.001828771,0.0009289016,0.000690767,0.005378894],"category_scores_gemma":[0.005915537,0.0003331098,0.0006181994,0.002873681,0.0008284438,0.004483806,0.001858237,0.001292169,0.001540786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007390163,"about_ca_system_score_gemma":0.0006847558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009066323,"about_ca_topic_score_gemma":0.001236931,"domain_scores_codex":[0.9989135,0.0002714005,0.0001160624,0.0001405932,0.0004466397,0.0001116824],"domain_scores_gemma":[0.9979033,0.0007623777,0.000233216,0.0006459876,0.0003670029,0.00008815269],"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.0005772926,0.0001032528,0.001361683,0.0003940515,0.00003335969,0.0003852985,0.0008800855,0.07463483,0.01876434,0.5133047,0.01179558,0.3777656],"study_design_scores_gemma":[0.00008659563,0.0002465656,0.0008187705,0.0002505005,0.00005738942,0.000786528,0.0003766938,0.4260217,0.02440578,0.486762,0.06007905,0.0001083387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03620886,0.0005501157,0.9540681,0.000328994,0.0001195133,0.00009840548,0.001363606,0.001402305,0.005860284],"genre_scores_gemma":[0.388459,0.001030379,0.5974242,0.0003354409,0.0001221719,0.0003386604,0.003917128,0.0004638223,0.007909136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005378894,"threshold_uncertainty_score":0.01799423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992520347","doi":"10.1145/1290672.1290684","title":"Packing element-disjoint steiner trees","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on 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":"University of Alberta; University of Waterloo","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Linear programming relaxation; Disjoint sets; Upper and lower bounds; Packing problems; Matching (statistics); Terminal and nonterminal symbols; Approximation algorithm; Discrete mathematics; Linear programming; Binary logarithm; Algorithm; Computer science","authors":[{"name":"Joseph Cheriyan","is_ca":true},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03228228936273474,"gpt":0.2810975838117912,"spread":0.2488152944490565,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063624,0.0009501966,0.002035804,0.0008327945,0.000871489,0.001499927,0.001742393,0.001785923,0.006784866],"category_scores_gemma":[0.005303022,0.000880738,0.0009217621,0.002453231,0.0007084119,0.004312153,0.002874009,0.001413607,0.00153947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005967763,"about_ca_system_score_gemma":0.0006197282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006721372,"about_ca_topic_score_gemma":0.0009874951,"domain_scores_codex":[0.9984373,0.0003561733,0.0001515892,0.0004436017,0.0003254238,0.0002858499],"domain_scores_gemma":[0.9975669,0.001019516,0.000315136,0.0007288801,0.0001439093,0.0002257003],"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.002179964,0.0007516471,0.004485344,0.0008832688,0.0002728903,0.001582411,0.000825709,0.5638075,0.04269769,0.09296226,0.021435,0.2681164],"study_design_scores_gemma":[0.0001472693,0.0004226331,0.00111205,0.00006696256,0.0000849096,0.0009130156,0.0003322941,0.8516328,0.01731118,0.1163732,0.01156551,0.00003815542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2951383,0.001019838,0.6829026,0.001092716,0.0002055907,0.0002530811,0.001624166,0.001945457,0.01581817],"genre_scores_gemma":[0.5402731,0.0008406709,0.4477778,0.0002724896,0.00009376676,0.0001841606,0.003737019,0.0002681167,0.006552846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006784866,"threshold_uncertainty_score":0.02269763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030012922","doi":"10.1145/1597036.1597043","title":"A linear-time algorithm to find a separator in a graph excluding a minor","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Time complexity; Graph; Algorithm; Separator (oil production); Minor (academic); Discrete mathematics; Physics","authors":[{"name":"Bruce Reed","is_ca":true},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02838027666210273,"gpt":0.2910431303259928,"spread":0.26266285366389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006423175,0.001801193,0.001346008,0.001195943,0.001354604,0.001563578,0.002501067,0.00134218,0.009559499],"category_scores_gemma":[0.002582338,0.0009843563,0.001465771,0.002145454,0.000777252,0.003958456,0.002367627,0.0013134,0.004066859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00148978,"about_ca_system_score_gemma":0.002660609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002924104,"about_ca_topic_score_gemma":0.00539548,"domain_scores_codex":[0.9989881,0.0001220471,0.0000950688,0.0003621847,0.0002070853,0.0002255915],"domain_scores_gemma":[0.9982044,0.0008065584,0.0002337035,0.0003917396,0.0001693928,0.0001942137],"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.003636874,0.001235208,0.00517889,0.001686392,0.0003748035,0.0005528064,0.001001525,0.102546,0.06600056,0.0244087,0.03282663,0.7605517],"study_design_scores_gemma":[0.001247477,0.001069931,0.002307584,0.00009443112,0.0002174993,0.001034171,0.0005439824,0.8648168,0.02921746,0.07412276,0.02521732,0.0001106241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1114832,0.0006518199,0.8617183,0.001141555,0.0001247638,0.0007689424,0.00156163,0.01193419,0.01061557],"genre_scores_gemma":[0.168029,0.0001797039,0.8214245,0.000182845,0.00005547353,0.0003467589,0.003594168,0.0004325181,0.005754995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009559499,"threshold_uncertainty_score":0.03197974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127816126","doi":"10.1145/2907052","title":"Better Balance by Being Biased","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on 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":"University of Waterloo; University of Toronto","funders":"","keywords":"Approximation algorithm; Conjecture; Combinatorics; Mathematics; Constraint (computer-aided design); Discrete mathematics","authors":[{"name":"Per Austrin","is_ca":true},{"name":"Siavosh Benabbas","is_ca":true},{"name":"Konstantinos Georgiou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01799228803662961,"gpt":0.2423846366341022,"spread":0.2243923485974726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002751507,0.002418593,0.002850158,0.001507203,0.002530731,0.004222263,0.00315057,0.003147394,0.04983644],"category_scores_gemma":[0.01891506,0.001209035,0.001802187,0.002262589,0.00196609,0.01200298,0.006537118,0.003392517,0.01450584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002085229,"about_ca_system_score_gemma":0.002383695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003711396,"about_ca_topic_score_gemma":0.004991143,"domain_scores_codex":[0.9964699,0.0009058163,0.0001657679,0.001008251,0.0007282153,0.00072221],"domain_scores_gemma":[0.9936711,0.002446278,0.0004758761,0.002219199,0.0006659676,0.0005216138],"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.002927317,0.000808524,0.01189074,0.0007257706,0.0003373126,0.0007917697,0.001654447,0.1218182,0.01965073,0.3595925,0.1182017,0.3616009],"study_design_scores_gemma":[0.0003992252,0.0002742519,0.001042425,0.0002028785,0.0001758612,0.0005134818,0.000790304,0.4154622,0.00799947,0.5176492,0.05540903,0.00008185529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2658714,0.00261094,0.5925273,0.009429837,0.001264424,0.0007280057,0.002514847,0.007990498,0.1170627],"genre_scores_gemma":[0.7064112,0.001036089,0.2313049,0.004169579,0.0004708304,0.0006273,0.002762461,0.002525984,0.05069172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04983644,"threshold_uncertainty_score":0.1667195,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2619218210","doi":"10.1145/3039870","title":"Time vs. Information Tradeoffs for Leader Election in Anonymous Trees","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on 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":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Leader election; Node (physics); Logarithm; Upper and lower bounds; Computer science; String (physics); Tree (set theory); Binary logarithm; Computer network; Advice (programming); Time complexity; Simple (philosophy); Multiplicative function; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science; Algorithm","authors":[{"name":"Christian Glacet","is_ca":false},{"name":"Avery Miller","is_ca":true},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02881095360955493,"gpt":0.2745985513117078,"spread":0.2457875977021529,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008596812,0.001135437,0.001338033,0.001253041,0.001916514,0.003504558,0.002168692,0.001819588,0.003932479],"category_scores_gemma":[0.07282222,0.0007112934,0.0008842596,0.001467035,0.002775068,0.008129937,0.002963166,0.002802959,0.0006548286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002958975,"about_ca_system_score_gemma":0.002441286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007793252,"about_ca_topic_score_gemma":0.001096942,"domain_scores_codex":[0.9928584,0.002461202,0.000321187,0.001044366,0.001678684,0.001636095],"domain_scores_gemma":[0.8700913,0.1109001,0.006283675,0.00774022,0.002392171,0.002592679],"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.004474426,0.0004941949,0.003440441,0.0008323914,0.0001547069,0.0003420894,0.001250055,0.5918868,0.03378066,0.2784647,0.005832421,0.0790471],"study_design_scores_gemma":[0.0001439477,0.0005092213,0.0008608231,0.000080665,0.0001027773,0.0002427042,0.0002493782,0.85953,0.01016931,0.1255435,0.002507373,0.0000603161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3163125,0.004623321,0.6450948,0.0051379,0.0003460711,0.0002885866,0.0006485864,0.001497919,0.0260504],"genre_scores_gemma":[0.9115172,0.001540461,0.08245182,0.0004070663,0.0002659663,0.0002635141,0.0002797804,0.000405148,0.002868946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008596812,"threshold_uncertainty_score":0.04546481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3099896668","doi":"10.1145/2701615","title":"A Bounded Budget Network Creation Game","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":25,"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":"Vertex (graph theory); Combinatorics; Mathematics; Nash equilibrium; Bounded function; Neighbourhood (mathematics); Undirected graph; Graph; Best response; Discrete mathematics; Mathematical optimization","authors":[{"name":"Shayan Ehsani","is_ca":false},{"name":"Saber Shokat Fadaee","is_ca":false},{"name":"MohammadAmin Fazli","is_ca":false},{"name":"Abbas Mehrabian","is_ca":true},{"name":"Sina Sadeghian Sadeghabad","is_ca":false},{"name":"MohammadAli Safari","is_ca":false},{"name":"Morteza Saghafian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1464310147264936,"gpt":0.3982721749475645,"spread":0.2518411602210709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001168067,0.0009757734,0.0007713502,0.0004713502,0.001043105,0.002258837,0.001817091,0.001832498,0.008258317],"category_scores_gemma":[0.004990541,0.0004823867,0.0005613541,0.0005541336,0.001601208,0.004360802,0.002189547,0.001790153,0.0007228164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001968828,"about_ca_system_score_gemma":0.001073106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00187697,"about_ca_topic_score_gemma":0.001925419,"domain_scores_codex":[0.9984795,0.000745908,0.0000450268,0.0002621654,0.000248492,0.0002189263],"domain_scores_gemma":[0.9980129,0.001098656,0.0001792815,0.0001789616,0.0001490903,0.0003810967],"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.0003605693,0.0001964458,0.0007669819,0.0001963471,0.00004513012,0.0005511707,0.0003616697,0.1633653,0.005596766,0.8013108,0.006467129,0.02078163],"study_design_scores_gemma":[0.0002008873,0.0002207535,0.0003452553,0.00005405301,0.00003092262,0.0004948874,0.0002297503,0.5883403,0.001813369,0.3822562,0.02596523,0.00004850588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1337062,0.0005812151,0.7588435,0.00311948,0.0001837502,0.0005781231,0.000895998,0.0004764504,0.1016153],"genre_scores_gemma":[0.8232727,0.0006435118,0.1486404,0.0005969246,0.00007674564,0.0007803845,0.000631533,0.0001063834,0.02525135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008258317,"threshold_uncertainty_score":0.02762681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2624146531","doi":"10.1145/2500118","title":"Morphing orthogonal planar graph drawings","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planarity testing; Morphing; Orthogonality; Planar graph; Graph drawing; Mathematics; Graph; Planar; Book embedding; Combinatorics; Computer science; Geometry; Computer graphics (images); Line graph; 1-planar graph","authors":[{"name":"Thérèse Biedl","is_ca":true},{"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.01683175646251359,"gpt":0.2365934897930276,"spread":0.219761733330514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003510437,0.0006230504,0.000540302,0.001097804,0.0005019361,0.0008361206,0.0008701215,0.0005934106,0.006773981],"category_scores_gemma":[0.002306192,0.000564481,0.0008189799,0.0008400349,0.0008849014,0.001467522,0.002410088,0.001299932,0.001203698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000402336,"about_ca_system_score_gemma":0.0003665916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001021847,"about_ca_topic_score_gemma":0.001455195,"domain_scores_codex":[0.999473,0.00005653299,0.00003262157,0.0001235752,0.0002520832,0.00006212772],"domain_scores_gemma":[0.9993713,0.0001484017,0.00006784744,0.000242819,0.0001306297,0.00003898533],"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.000199185,0.00008114146,0.001256595,0.000260164,0.00004766704,0.0003144471,0.0003881763,0.1047648,0.05073018,0.1692445,0.010251,0.6624621],"study_design_scores_gemma":[0.00007907671,0.0002162545,0.0009921548,0.00006607496,0.00007124234,0.001002836,0.0003208984,0.6218297,0.05572915,0.22755,0.09205962,0.00008302467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01898175,0.00007549228,0.9746472,0.00009199689,0.00006261629,0.00007613039,0.0001343545,0.001270372,0.004660046],"genre_scores_gemma":[0.1547354,0.0002140026,0.8375064,0.00009056431,0.00003140591,0.000114066,0.0006051182,0.0006642856,0.0060387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006773981,"threshold_uncertainty_score":0.02266121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160921566","doi":"10.1145/1497290.1497300","title":"Algorithms for distributional and adversarial pipelined filter ordering problems","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"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":"Division of Information and Intelligent Systems; National Science Foundation","keywords":"Computer science; Tuple; Filter (signal processing); Algorithm; Context (archaeology); Data stream mining; Set (abstract data type); Mathematics; Data mining; Discrete mathematics","authors":[{"name":"Anne Condon","is_ca":true},{"name":"Amol Deshpande","is_ca":false},{"name":"Lisa Hellerstein","is_ca":false},{"name":"Ning Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03906695759045289,"gpt":0.2767725220134825,"spread":0.2377055644230296,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004618323,0.001873271,0.002291897,0.001424272,0.001425925,0.002953059,0.004540487,0.003271965,0.009047532],"category_scores_gemma":[0.0151597,0.0009261708,0.001893951,0.002821798,0.001835069,0.007819002,0.004104731,0.004458608,0.001554266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003347481,"about_ca_system_score_gemma":0.003449237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002997652,"about_ca_topic_score_gemma":0.00532668,"domain_scores_codex":[0.9966748,0.0009138053,0.0002622364,0.00084919,0.0007493232,0.0005506551],"domain_scores_gemma":[0.9884998,0.007983839,0.0006926748,0.001605558,0.0007904434,0.0004276411],"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.0004638224,0.0003836569,0.001106286,0.000266926,0.00009633982,0.0001168552,0.0002654564,0.6506966,0.00163077,0.1823531,0.01391898,0.1487012],"study_design_scores_gemma":[0.00006688214,0.00004833502,0.00008720107,0.00001146884,0.00001569409,0.00003977713,0.00003554517,0.8645411,0.0006722808,0.1329346,0.001534109,0.00001308349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008297978,0.0002324738,0.9868187,0.0006923751,0.00006256039,0.0001309637,0.0002406192,0.0009437482,0.002580653],"genre_scores_gemma":[0.2255378,0.0004533301,0.7639828,0.0005000823,0.000255751,0.0005910476,0.00137383,0.0005188774,0.006786366],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009047532,"threshold_uncertainty_score":0.03026706,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066369985","doi":"10.1145/2000807.2000819","title":"Cake cutting really is not a piece of cake","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Cryptography and Data Security","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":"Division of Information and Intelligent Systems; Division of Computer and Network Systems; Division of Computing and Communication Foundations","keywords":"Bounding overwatch; Protocol (science); Upper and lower bounds; Mathematics; Divide and conquer algorithms; Value (mathematics); Computer science; Combinatorics; Discrete mathematics; Algorithm; Statistics; Artificial intelligence","authors":[{"name":"Jeff Edmonds","is_ca":true},{"name":"Kirk Pruhs","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04865011138230788,"gpt":0.2574393791545293,"spread":0.2087892677722214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003181178,0.000721118,0.001694515,0.0005058612,0.002882764,0.004591019,0.003050054,0.003329967,0.009913797],"category_scores_gemma":[0.0179913,0.0008883063,0.001873913,0.001164594,0.005581243,0.01575937,0.004926957,0.006858713,0.001367344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001825913,"about_ca_system_score_gemma":0.002433749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002306682,"about_ca_topic_score_gemma":0.002417321,"domain_scores_codex":[0.9946988,0.001035286,0.0002976704,0.001700272,0.001385572,0.0008825274],"domain_scores_gemma":[0.9839844,0.0076136,0.0009579352,0.006258385,0.0006910512,0.0004946087],"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.0005908497,0.0001618543,0.001019272,0.000298468,0.0001096934,0.0002881551,0.0006676269,0.0653949,0.009930502,0.8663175,0.00533618,0.04988508],"study_design_scores_gemma":[0.0001052089,0.0001617393,0.0003378835,0.00006616824,0.00007044997,0.0004080001,0.0003295701,0.1739197,0.01187164,0.794122,0.0185346,0.00007300014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07504077,0.0003653165,0.8993561,0.003559453,0.0001517826,0.0002236323,0.0002338423,0.0007947017,0.02027445],"genre_scores_gemma":[0.6074242,0.0003375999,0.3699438,0.0007660622,0.0001020217,0.0004020685,0.0003535986,0.0004369801,0.02023369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009913797,"threshold_uncertainty_score":0.03316498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981710280","doi":"10.1145/1077464.1077467","title":"A maiden analysis of longest wait first","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"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; Scheduling (production processes); Computer science; Competitive analysis; Combinatorics; Mathematics; Distributed computing; Mathematical optimization","authors":[{"name":"Jeff Edmonds","is_ca":true},{"name":"Kirk Pruhs","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0250297595755466,"gpt":0.2748734465406962,"spread":0.2498436869651496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004632343,0.002372229,0.001991147,0.002922783,0.002357136,0.003304322,0.00445086,0.002082391,0.02469704],"category_scores_gemma":[0.02471513,0.001074397,0.001681212,0.002532941,0.002343543,0.008018826,0.002349437,0.004851244,0.003502061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005015279,"about_ca_system_score_gemma":0.002818502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004638243,"about_ca_topic_score_gemma":0.002854036,"domain_scores_codex":[0.9977653,0.0005136454,0.00007324868,0.0003560862,0.0007067581,0.0005849602],"domain_scores_gemma":[0.9884834,0.008051382,0.0008555677,0.0006945694,0.001208909,0.0007061202],"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.0005041678,0.0001611471,0.001047221,0.000480175,0.0001318145,0.0001490401,0.0003401601,0.1944074,0.004331013,0.736843,0.0181206,0.04348416],"study_design_scores_gemma":[0.00006118338,0.0001285942,0.0002541509,0.00007838477,0.00007430747,0.00008648786,0.00004722793,0.6971189,0.001869958,0.2895996,0.01064505,0.00003618895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04501646,0.006702941,0.8569536,0.005505747,0.0005147225,0.0001944699,0.0005640266,0.001070456,0.08347771],"genre_scores_gemma":[0.6832012,0.007188313,0.2278458,0.00337372,0.002082756,0.001026608,0.001052214,0.001823687,0.07240562],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02469704,"threshold_uncertainty_score":0.08261979,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072577896","doi":"10.1145/1383369.1383379","title":"The relative worst order ratio applied to seat reservation","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on 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":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Reservation; Order (exchange); Competitive analysis; Computer science; Online algorithm; Measure (data warehouse); Quality (philosophy); Mathematical optimization; Algorithm; Mathematics; Upper and lower bounds; Data mining; Computer network","authors":[{"name":"Joan Boyar","is_ca":false},{"name":"Paul Medvedev","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04390905179000232,"gpt":0.2749594815816275,"spread":0.2310504297916252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009631382,0.003150025,0.003564067,0.003057978,0.001484109,0.004660991,0.003817021,0.002337729,0.005673482],"category_scores_gemma":[0.05335056,0.001119745,0.002234503,0.006406904,0.004222762,0.008361399,0.00304738,0.006072049,0.002636063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002803235,"about_ca_system_score_gemma":0.002772719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004845267,"about_ca_topic_score_gemma":0.001774457,"domain_scores_codex":[0.9864751,0.006672446,0.0006709545,0.001874556,0.003476754,0.0008301506],"domain_scores_gemma":[0.9692165,0.02297752,0.001733518,0.003575286,0.001917119,0.0005800907],"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.0007577537,0.0002284116,0.001622605,0.0004994842,0.0001996649,0.0002155311,0.0003108792,0.5357772,0.002945225,0.2933456,0.008039616,0.156058],"study_design_scores_gemma":[0.00007987586,0.0003718193,0.0005386582,0.00008026737,0.00008627016,0.0003427909,0.00008823888,0.7226604,0.003317813,0.2619748,0.01038606,0.00007311676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008627886,0.005036048,0.9744303,0.0005756885,0.0005494916,0.0001105167,0.0001377296,0.0007574953,0.009774933],"genre_scores_gemma":[0.4564494,0.00761064,0.5238345,0.0008489979,0.001829891,0.0003771575,0.0004741536,0.001178345,0.007396904],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009631382,"threshold_uncertainty_score":0.05093622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3115470548","doi":"10.1145/3402926","title":"Deterministic APSP, Orthogonal Vectors, and More","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo; National Science Foundation","keywords":"Satisfiability; Deterministic algorithm; Combinatorics; Mathematics; Binary logarithm; Randomized algorithm; Discrete mathematics; Matching (statistics); Algorithm; Statistics","authors":[{"name":"Timothy M. Chan","is_ca":false},{"name":"Ryan Williams","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0392331204555236,"gpt":0.2640326974534066,"spread":0.224799576997883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00160303,0.001159252,0.001078331,0.001038537,0.001450401,0.002324079,0.002418609,0.001224707,0.01345674],"category_scores_gemma":[0.007267531,0.0005997713,0.001166205,0.001984484,0.001915558,0.005830616,0.004141356,0.002360599,0.001731037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002116203,"about_ca_system_score_gemma":0.002903114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00485494,"about_ca_topic_score_gemma":0.008082647,"domain_scores_codex":[0.9974374,0.0005748976,0.0001537758,0.0007314741,0.0007324266,0.0003700719],"domain_scores_gemma":[0.9954576,0.00137137,0.0004498365,0.002041229,0.0004561126,0.0002237222],"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.000776473,0.0003616087,0.00442479,0.0003980593,0.00007441614,0.0001996136,0.0003198249,0.158119,0.01025652,0.628383,0.01255719,0.1841295],"study_design_scores_gemma":[0.00009516955,0.0002464515,0.0006057423,0.00003608338,0.0000443405,0.0001974674,0.0001175413,0.4908505,0.009715609,0.4858201,0.01220086,0.00007007932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06583545,0.0003597568,0.915037,0.001779551,0.0001807112,0.0001385597,0.0007208051,0.002181229,0.01376687],"genre_scores_gemma":[0.530324,0.0003024558,0.4548632,0.0007479355,0.0001482801,0.0003823348,0.001306468,0.0003915161,0.01153382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01345674,"threshold_uncertainty_score":0.04501724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2979731478","doi":"10.1145/3341599","title":"A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"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; Multigraph; Mathematics; Approximation algorithm; Enhanced Data Rates for GSM Evolution; Vertex connectivity; Induced subgraph isomorphism problem; Subgraph isomorphism problem; Reduction (mathematics); Vertex cover; Discrete mathematics; Algorithm; Computer science; Graph; Line graph; Vertex (graph theory); Artificial intelligence","authors":[{"name":"Christoph Hunkenschröder","is_ca":false},{"name":"Santosh Vempala","is_ca":false},{"name":"Adrian Vetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02408591830526699,"gpt":0.2552901439520244,"spread":0.2312042256467574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009181083,0.001928521,0.001520031,0.001389465,0.0009309235,0.001658337,0.002718502,0.002199435,0.009850191],"category_scores_gemma":[0.004515752,0.000739165,0.001717895,0.002482859,0.0007926958,0.003775101,0.002258896,0.00313257,0.003583488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002347135,"about_ca_system_score_gemma":0.002738597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004735387,"about_ca_topic_score_gemma":0.006432056,"domain_scores_codex":[0.9985889,0.0002290434,0.00008878329,0.0003562016,0.0004232771,0.0003137224],"domain_scores_gemma":[0.9985737,0.0005916072,0.0001243393,0.000425981,0.0001722094,0.0001120798],"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.001602165,0.0009180702,0.001664912,0.0006625517,0.0002209219,0.0004265341,0.0004520268,0.2857719,0.02003506,0.06566691,0.06088966,0.5616892],"study_design_scores_gemma":[0.0003916728,0.0002720875,0.0006653413,0.00006280636,0.00008376214,0.0006052711,0.0001657768,0.8789139,0.007832309,0.09474818,0.01620807,0.00005088067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03363875,0.0008139488,0.9476537,0.001311454,0.0002642064,0.0003783236,0.0007356115,0.004400485,0.01080343],"genre_scores_gemma":[0.1265889,0.000370231,0.8650979,0.0004548333,0.0001097525,0.0004551156,0.002080084,0.0005007941,0.004342412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009850191,"threshold_uncertainty_score":0.03295219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082869103","doi":"10.1145/1125994.1125995","title":"Generating rooted and free plane trees","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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 Guelph","funders":"","keywords":"Lexicographical order; Bounding overwatch; Mathematics; Plane (geometry); Sequence (biology); Tree (set theory); Amortized analysis; Combinatorics; Centroid; Representation (politics); Weight-balanced tree; Simple (philosophy); Algorithm; Binary search tree; Computer science; Data structure; Binary tree; Artificial intelligence; Geometry","authors":[{"name":"Joe Sawada","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02742443493467967,"gpt":0.2827155707507121,"spread":0.2552911358160325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003776354,0.0004420865,0.0006320221,0.001441268,0.0007886483,0.001529416,0.001407147,0.0005747366,0.01183281],"category_scores_gemma":[0.003881157,0.0004047015,0.0006122758,0.002057351,0.0005896453,0.003875794,0.002569471,0.000957865,0.003142767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009447212,"about_ca_system_score_gemma":0.0008561572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001880024,"about_ca_topic_score_gemma":0.003060478,"domain_scores_codex":[0.9990864,0.00009625011,0.0000644005,0.0001652385,0.000430707,0.0001570081],"domain_scores_gemma":[0.998376,0.0005655132,0.0001445036,0.0003504544,0.0004698372,0.00009364322],"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.0004292921,0.0001652033,0.002821044,0.0005252566,0.00005498036,0.0005592535,0.0009126033,0.02908427,0.02672054,0.4007864,0.0208047,0.5171365],"study_design_scores_gemma":[0.0001335837,0.0002386654,0.001835385,0.0001011235,0.00009184181,0.0008586218,0.0006599348,0.1556865,0.04602424,0.6863492,0.1079176,0.0001033339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09745545,0.0004223323,0.8776568,0.0002831924,0.0001033272,0.0002283528,0.002271464,0.002703663,0.01887544],"genre_scores_gemma":[0.3014303,0.0004281966,0.6703414,0.0001917118,0.00008294361,0.0002424016,0.006147799,0.0007973074,0.02033794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01183281,"threshold_uncertainty_score":0.0395847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147508044","doi":"10.1145/1824777.1824781","title":"Finding one tight cycle","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","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":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Contractible space; Homotopy; Genus; Surface (topology); Class (philosophy); Binary logarithm; Boundary (topology); Simple (philosophy); Set (abstract data type); Discrete mathematics; Pure mathematics; Computer science; Geometry; Botany; Mathematical analysis","authors":[{"name":"Sergio Cabello","is_ca":false},{"name":"Matt DeVos","is_ca":true},{"name":"Jeff Erickson","is_ca":false},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02292947487158239,"gpt":0.2668963827719354,"spread":0.243966907900353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003127273,0.000727193,0.0011325,0.001588214,0.001600726,0.001591042,0.0009881548,0.0008489474,0.009936512],"category_scores_gemma":[0.002597494,0.0007416328,0.0007632854,0.001139098,0.001047389,0.002887639,0.003189756,0.001035227,0.001439243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000629433,"about_ca_system_score_gemma":0.001248154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003218706,"about_ca_topic_score_gemma":0.004346416,"domain_scores_codex":[0.9994543,0.00004512887,0.000035967,0.0001702087,0.0001398233,0.0001545353],"domain_scores_gemma":[0.9991822,0.0001612628,0.00008415986,0.0002118805,0.0001765695,0.0001839453],"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.0006792479,0.0002780805,0.01160896,0.001090786,0.0001713835,0.00137266,0.001592646,0.06756977,0.09867298,0.2471273,0.01207425,0.557762],"study_design_scores_gemma":[0.0001276739,0.0008505225,0.008000629,0.0004689601,0.0002802434,0.001683119,0.003522313,0.2919368,0.08062371,0.5355492,0.07670558,0.0002511796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4649715,0.0006730628,0.5070623,0.0003324366,0.0001271367,0.0003371999,0.0008444929,0.001585457,0.02406643],"genre_scores_gemma":[0.6957608,0.0004803849,0.2877955,0.0001424425,0.00003666286,0.0001628111,0.001947408,0.0007930064,0.01288095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009936512,"threshold_uncertainty_score":0.03324091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033561606","doi":"10.1145/2601071","title":"Faster Algorithms for Semi-Matching Problems","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","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":"McGill University","funders":"","keywords":"Algorithm; Combinatorics; Bipartite graph; Binary logarithm; Matching (statistics); Mathematics; Simple (philosophy); Running time; Time complexity; Scheduling (production processes); Upper and lower bounds; Computer science; Discrete mathematics; Graph; Mathematical optimization","authors":[{"name":"Jittat Fakcharoenphol","is_ca":false},{"name":"Bundit Laekhanukit","is_ca":true},{"name":"Danupon Nanongkai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03638762829888929,"gpt":0.2850188882668745,"spread":0.2486312599679852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002759548,0.002568154,0.00258401,0.002636589,0.001393226,0.002828437,0.004597022,0.002825234,0.02128747],"category_scores_gemma":[0.0119005,0.00126612,0.002891454,0.00457029,0.001114877,0.0110858,0.004650252,0.00336108,0.006209476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00183691,"about_ca_system_score_gemma":0.001996926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001758084,"about_ca_topic_score_gemma":0.002809112,"domain_scores_codex":[0.9961194,0.0008734002,0.0002643878,0.0009184372,0.001245702,0.0005788424],"domain_scores_gemma":[0.993202,0.003309041,0.000447641,0.00196926,0.0007963779,0.0002757076],"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.001162111,0.0008988485,0.001329976,0.001635092,0.0002732373,0.0002175417,0.0005075381,0.1640734,0.01409106,0.128946,0.03125887,0.6556064],"study_design_scores_gemma":[0.0004003518,0.0002006124,0.0004085843,0.00008215508,0.00007934552,0.0003233069,0.0001491753,0.6477161,0.005648249,0.3248878,0.02005768,0.00004659872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01365443,0.001255588,0.9710916,0.0008560336,0.0002067988,0.0002581979,0.0003567584,0.004624142,0.007696423],"genre_scores_gemma":[0.1110331,0.0009783983,0.8779424,0.0005368931,0.0003036155,0.0005661649,0.001783226,0.001143751,0.005712593],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02128747,"threshold_uncertainty_score":0.07121366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089187143","doi":"10.1145/2594581","title":"Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Node (physics); Normalization property; Computer network; Theoretical computer science","authors":[{"name":"Yoann Dieudonné","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02026235510793927,"gpt":0.2489851780791878,"spread":0.2287228229712485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003298553,0.0007518371,0.0011663,0.000738151,0.000992764,0.001452526,0.002275633,0.001334456,0.001318178],"category_scores_gemma":[0.01750724,0.000701168,0.001280426,0.0007734056,0.002083638,0.003404481,0.00392938,0.001389523,0.00031597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00117463,"about_ca_system_score_gemma":0.001456768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001519607,"about_ca_topic_score_gemma":0.001540012,"domain_scores_codex":[0.9969893,0.001344818,0.000164769,0.0005699248,0.0004727738,0.0004584477],"domain_scores_gemma":[0.9837531,0.01152424,0.001447097,0.002043815,0.0006445757,0.0005871672],"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.001642652,0.000170291,0.004657065,0.000211893,0.0001278876,0.000559774,0.001272458,0.8251135,0.00703233,0.1137515,0.00132777,0.04413286],"study_design_scores_gemma":[0.00007176758,0.00007518058,0.000210104,0.00001783848,0.00002959049,0.00007104126,0.00009689283,0.9460953,0.00286659,0.04948662,0.0009554448,0.000023687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1809317,0.0001513283,0.8140061,0.0003594145,0.00001739149,0.0001102445,0.0001314881,0.0005873057,0.003705016],"genre_scores_gemma":[0.8466406,0.0001144072,0.1487786,0.00008927342,0.0000235823,0.0002960205,0.0002938989,0.00007711345,0.00368644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003298553,"threshold_uncertainty_score":0.01744461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}