{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002934815,0.0002500488,0.0002028549,0.0002942,0.0007601408,0.0002026925,0.000736518,0.00009881325,0.00002200085],"category_scores_gemma":[0.00001350855,0.0002089819,0.00004492034,0.0007761644,0.00007860581,0.0008448109,0.00006394739,0.0002854784,0.00003766082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007350184,"about_ca_system_score_gemma":0.00007264358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002441733,"about_ca_topic_score_gemma":0.0002411228,"domain_scores_codex":[0.9981673,0.0000291885,0.0002834296,0.0006858741,0.000410869,0.0004233779],"domain_scores_gemma":[0.9981143,0.0002724414,0.00006960762,0.001055865,0.000100613,0.0003871014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006698267,0.0003366775,0.0003384356,0.00001479561,0.00005210418,0.00001898752,0.0006571586,0.001830945,0.0008252467,0.001440907,0.0002761323,0.9941416],"study_design_scores_gemma":[0.0102209,0.004235323,0.1271848,0.0007662281,0.0003071533,0.00136146,0.001655443,0.1672382,0.05943922,0.009770387,0.6127023,0.005118605],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001609334,0.0001354578,0.9958677,0.0008610297,0.0001981171,0.0005260885,0.000063876,0.0003250101,0.0004133626],"genre_scores_gemma":[0.3288807,0.0001079788,0.6693892,0.0006814072,0.0001196107,0.0002365651,0.00002372218,0.00003245772,0.0005283624],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.989023,"threshold_uncertainty_score":0.8522035,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000268682,0.0001836164,0.0001490141,0.0001204858,0.0006577545,0.000258477,0.001163748,0.00007491212,0.000044136],"category_scores_gemma":[0.00001915108,0.0001379814,0.0001863773,0.0004946274,0.0000572707,0.0005533231,0.00001044934,0.0002366999,0.00006175894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004406222,"about_ca_system_score_gemma":0.0000435985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009477433,"about_ca_topic_score_gemma":0.000003349043,"domain_scores_codex":[0.9987016,0.00004200711,0.0002491428,0.0003929851,0.0003106185,0.0003036371],"domain_scores_gemma":[0.9983894,0.0004084414,0.00006639312,0.0009729752,0.00009874684,0.00006402734],"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.00001182331,0.0001771736,5.679812e-7,0.000005964715,0.00003461677,0.00000100949,0.0004102856,0.0017345,0.0001191803,0.01291586,0.0008326843,0.9837564],"study_design_scores_gemma":[0.0009597231,0.0004527008,0.0006075534,0.00002800166,0.00003823356,0.00002328988,0.00003206939,0.8072985,0.003479594,0.1705465,0.0162154,0.0003183467],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008011792,0.00005426934,0.9811441,0.01697808,0.0005024229,0.0007054021,0.0000183926,0.0002224741,0.0002947644],"genre_scores_gemma":[0.09922127,0.0000485861,0.8943051,0.005196336,0.0001573444,0.0003308286,0.000009242757,0.00001749187,0.0007137958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.983438,"threshold_uncertainty_score":0.5626717,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008299634,0.0001630176,0.0001700084,0.0003741796,0.0001741444,0.0001030519,0.0006771561,0.00008798343,0.000008763493],"category_scores_gemma":[0.00005131794,0.0001511194,0.00006019714,0.000794397,0.0001435926,0.000499631,0.00003486597,0.0004909243,0.00001483699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007405775,"about_ca_system_score_gemma":0.00002270806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004639013,"about_ca_topic_score_gemma":0.0006077131,"domain_scores_codex":[0.9984444,0.0000940029,0.0002376199,0.0004480414,0.0002964776,0.0004794484],"domain_scores_gemma":[0.9986227,0.00040342,0.00003339317,0.0007223401,0.00005616775,0.0001619557],"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.00002648632,0.0002216873,0.0004807498,0.000006921178,0.00001186787,0.00004143224,0.000672601,0.0003765463,0.0001342709,0.0006120903,0.000001339997,0.997414],"study_design_scores_gemma":[0.0052896,0.001076609,0.03032609,0.0002712829,0.00002260834,0.00022623,0.001409685,0.826274,0.01762548,0.1145313,0.001713072,0.001234068],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01987232,0.00007940295,0.978761,0.0005390912,0.0001531935,0.0003041287,0.000002392088,0.0001426431,0.0001458792],"genre_scores_gemma":[0.6837619,0.000028056,0.3160321,0.00007264566,0.00001491466,0.00003194069,8.691155e-7,0.00001164358,0.00004595334],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9961799,"threshold_uncertainty_score":0.6162469,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002110669,0.0002455548,0.0002261678,0.0002433786,0.0009310372,0.0001041785,0.0009308822,0.0001257916,0.00007264115],"category_scores_gemma":[0.00004065672,0.0002435027,0.0002447859,0.0004559227,0.000130385,0.0009133316,0.0000249062,0.0003360181,0.00007228446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007276419,"about_ca_system_score_gemma":0.00007503731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002522875,"about_ca_topic_score_gemma":0.00001001916,"domain_scores_codex":[0.9982343,0.00005308317,0.0003381735,0.0005632106,0.0004395169,0.0003717493],"domain_scores_gemma":[0.9983252,0.0003520867,0.00009576539,0.0009077545,0.0001900041,0.0001292062],"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.00003499877,0.001222675,0.00003131268,0.00005804034,0.0001280906,0.000006643192,0.001068328,0.01304607,0.0002318504,0.004023817,0.0006103008,0.9795378],"study_design_scores_gemma":[0.001197206,0.0002062799,0.0004206264,0.00002667481,0.00001541013,0.00009806198,0.00002329364,0.952027,0.003679164,0.02198182,0.01994409,0.0003803408],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007411924,0.00003693163,0.9953984,0.001692955,0.0009318265,0.000581712,0.00007408127,0.0003730425,0.0001698774],"genre_scores_gemma":[0.0805874,0.00003813702,0.9180632,0.0003408534,0.0001577446,0.0003856645,0.00002564167,0.00002179541,0.0003795619],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9791575,"threshold_uncertainty_score":0.9929754,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002084751,0.0002112679,0.0001701723,0.0002692086,0.0005819835,0.00006343886,0.0003661056,0.0000732773,0.001643617],"category_scores_gemma":[0.00005201446,0.0002097332,0.0001164189,0.0007795873,0.0000893551,0.0007738766,0.00001415317,0.0001864505,0.004648516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000629629,"about_ca_system_score_gemma":0.00002457282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001599144,"about_ca_topic_score_gemma":0.0002587343,"domain_scores_codex":[0.998555,0.00001321977,0.000345853,0.0004053702,0.0003973857,0.0002831386],"domain_scores_gemma":[0.9989666,0.00001851569,0.00004723758,0.0007158449,0.0002267974,0.00002503397],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001779712,0.002186696,0.0009806432,0.0004199827,0.0002189463,0.00003309369,0.00068242,0.1478563,0.0001707229,0.002047632,0.01069663,0.8345289],"study_design_scores_gemma":[0.003097142,0.0001006854,0.06536642,0.00007332407,0.0002098517,0.00002037683,0.00133747,0.272277,0.0007933254,0.002660283,0.6523433,0.001720766],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1017489,0.00007081437,0.8806128,0.006656297,0.001990203,0.0007592377,0.00003297834,0.0008292,0.007299619],"genre_scores_gemma":[0.9937169,0.00005321802,0.001442239,0.001965244,0.0001873887,0.0000940204,0.00005744617,0.00001548899,0.002468078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.891968,"threshold_uncertainty_score":0.999269,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003074253,0.0002276971,0.0003159742,0.0006550967,0.0002353424,0.00002515784,0.001296845,0.0001171508,0.00006403303],"category_scores_gemma":[0.00001741068,0.0002377803,0.0001787759,0.001503573,0.0002388793,0.0007169305,0.00002129399,0.0004591224,0.0001447128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006056275,"about_ca_system_score_gemma":0.00007456481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004148658,"about_ca_topic_score_gemma":0.00000363188,"domain_scores_codex":[0.9978721,0.0001736254,0.0004108738,0.0005315916,0.0005430895,0.0004687759],"domain_scores_gemma":[0.9982444,0.0003453964,0.00007647786,0.001088836,0.00009759999,0.0001472828],"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.0007529713,0.004273756,0.0004559498,0.0001090006,0.0003055932,0.0005855556,0.007468311,0.4673488,0.02826498,0.01228552,0.0008100294,0.4773395],"study_design_scores_gemma":[0.01071189,0.003678638,0.004876269,0.0004087151,0.00006082281,0.001655062,0.0002991588,0.6008521,0.2401721,0.1319506,0.002755299,0.002579401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08109193,0.00008483,0.9172496,0.0005011362,0.00008656245,0.000310883,0.00004667007,0.0001753458,0.0004530845],"genre_scores_gemma":[0.6677212,0.0002327561,0.3313138,0.0002442293,0.0000261848,0.00007519386,0.00001208446,0.00003633905,0.0003382768],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5866292,"threshold_uncertainty_score":0.96964,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002549318,0.0001164464,0.0001031784,0.0001354508,0.0002417188,0.0001494631,0.0008152099,0.00005264259,0.0001190057],"category_scores_gemma":[0.00002734742,0.0001092833,0.00007166502,0.0003694365,0.00002988458,0.0003334762,0.00001425688,0.0001970868,0.000291385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002473665,"about_ca_system_score_gemma":0.00002358037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000139678,"about_ca_topic_score_gemma":0.000006308415,"domain_scores_codex":[0.9989702,0.00007537731,0.0001544852,0.000302866,0.0002422401,0.0002548318],"domain_scores_gemma":[0.99888,0.000111178,0.00003002796,0.0007868238,0.0000560363,0.0001358887],"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.000002657425,0.0001112135,0.000005001024,0.00000635332,0.00001643874,0.000001890743,0.0004421088,0.02525038,0.0002647153,0.003835891,0.00005001499,0.9700133],"study_design_scores_gemma":[0.0006922196,0.0002638189,0.0003530522,0.00002725029,0.000006367176,0.00001808418,0.00002816649,0.9600946,0.003305144,0.006172979,0.02872701,0.0003112889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002968395,0.00001140847,0.9944302,0.002013207,0.0003122398,0.0001120098,0.000001615255,0.0003238785,0.002498571],"genre_scores_gemma":[0.1646015,0.00004948436,0.8324115,0.00102857,0.00005657956,0.00004133914,0.000001306703,0.00002051014,0.001789205],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9697021,"threshold_uncertainty_score":0.4456443,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002676258,0.0002527517,0.0002058333,0.0005424386,0.0008931226,0.0002745519,0.001427606,0.0001177096,0.0000899077],"category_scores_gemma":[0.0001404934,0.0002533412,0.0001873156,0.001838637,0.0001042545,0.0003721471,0.00003672136,0.0009291332,0.0001752159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005038094,"about_ca_system_score_gemma":0.00005977823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006379855,"about_ca_topic_score_gemma":0.00003453886,"domain_scores_codex":[0.9981273,0.00005700069,0.0003136286,0.0005903529,0.0004627022,0.0004489548],"domain_scores_gemma":[0.9973236,0.00103693,0.00009064242,0.001243805,0.0001128192,0.0001922362],"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.000003494106,0.0004110802,0.0000117466,0.000006049146,0.00003541625,0.00001546556,0.0001607348,0.002152817,0.0001605376,0.07713312,0.00005951312,0.9198501],"study_design_scores_gemma":[0.001743063,0.0007690585,0.007406932,0.0001001893,0.00005536721,0.0001682045,0.0001593521,0.7894169,0.009301541,0.1850619,0.004566499,0.001251027],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0130211,0.0000111632,0.9818127,0.001302686,0.001941838,0.0001835438,0.00006513024,0.0005058553,0.001156013],"genre_scores_gemma":[0.7140565,0.000006974004,0.2854233,0.0002605732,0.00008961293,0.00002844358,0.00001044823,0.00001615759,0.0001079411],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.918599,"threshold_uncertainty_score":0.9999919,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001316249,0.0003098816,0.0002877707,0.0003981741,0.0007552701,0.0002952195,0.0009178074,0.0001658746,0.000005417784],"category_scores_gemma":[0.00008346747,0.0003102758,0.0001635946,0.0007938261,0.0001368287,0.0008086751,0.00004149706,0.0003338484,0.00001339886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007730688,"about_ca_system_score_gemma":0.00004510627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006241995,"about_ca_topic_score_gemma":0.00005176052,"domain_scores_codex":[0.9974738,0.00004977693,0.0005738949,0.0008388397,0.0004409746,0.0006227055],"domain_scores_gemma":[0.9978585,0.0005454886,0.0001631616,0.00102226,0.0001929747,0.0002176626],"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.00004532666,0.0002423927,0.000004352084,0.00004769152,0.00004842033,0.000006179594,0.001203396,0.0006203487,0.000187122,0.003169294,0.00007039793,0.9943551],"study_design_scores_gemma":[0.005206062,0.0009456826,0.001712646,0.0002126173,0.00006878476,0.0001683318,0.000482281,0.8287604,0.01516481,0.127676,0.01835316,0.001249263],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001134635,0.0001120168,0.9942755,0.00153194,0.001220518,0.0007794464,0.00008857498,0.000444863,0.0004125472],"genre_scores_gemma":[0.09082012,0.00008712043,0.9080113,0.000306431,0.000209454,0.0001605436,0.00002515347,0.00003768861,0.0003422432],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9931058,"threshold_uncertainty_score":0.9999349,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001578079,0.0001472927,0.000117432,0.0002176602,0.0002233931,0.0000857399,0.0007362236,0.00006411206,0.0002666665],"category_scores_gemma":[0.000007790118,0.0001224609,0.00005050676,0.0005401477,0.00006262006,0.001135288,0.00001115016,0.0002067058,0.0002222672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003134851,"about_ca_system_score_gemma":0.00007181164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005568924,"about_ca_topic_score_gemma":0.00005985586,"domain_scores_codex":[0.9988433,0.00006744349,0.0001731219,0.000362276,0.0003050165,0.0002488798],"domain_scores_gemma":[0.9988551,0.00004321708,0.00004746684,0.0008075977,0.0001176226,0.0001289622],"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.00003003994,0.0003737947,0.000005201281,0.00000696831,0.00004248137,0.00002220457,0.003219703,0.002989517,0.00006859488,0.00171331,0.00009367929,0.9914345],"study_design_scores_gemma":[0.006268807,0.004485484,0.002132857,0.0001419301,0.00008568359,0.0002220401,0.002026498,0.9080893,0.04564631,0.02540511,0.003562158,0.001933816],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001296158,0.000009739053,0.9905366,0.001028068,0.0002131923,0.0002564579,0.000003004491,0.0003451985,0.007478113],"genre_scores_gemma":[0.1006818,0.00006379067,0.8968768,0.0004445191,0.00002771269,0.0001321607,0.000003892369,0.0000217825,0.001747586],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9895007,"threshold_uncertainty_score":0.4993809,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002855402,0.0001847898,0.0001298551,0.0001225347,0.0005714261,0.0003722793,0.0009192367,0.00007608056,0.0001449676],"category_scores_gemma":[0.00002518126,0.0001218112,0.00008615464,0.0003962053,0.00009448925,0.0006403998,0.00005803524,0.0003611898,0.0002045202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005245432,"about_ca_system_score_gemma":0.00005362351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000164755,"about_ca_topic_score_gemma":0.000009538619,"domain_scores_codex":[0.99841,0.0001170147,0.0002058687,0.0004872182,0.000479023,0.0003008703],"domain_scores_gemma":[0.9982558,0.0003034561,0.00004009408,0.001098517,0.0001514095,0.0001506533],"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.00001223588,0.0002350459,0.000008682644,0.00000963615,0.00004371164,0.000002536109,0.0005778563,0.003424892,0.0001147337,0.001389888,0.0006010889,0.9935797],"study_design_scores_gemma":[0.0008227556,0.0006870441,0.01014138,0.0001406674,0.00002860767,0.00006893627,0.0007288464,0.9780358,0.002392079,0.003575908,0.002900634,0.0004773555],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02385956,0.0001039956,0.9603679,0.01440022,0.0003491744,0.0005404394,0.00001557479,0.0001402064,0.0002228936],"genre_scores_gemma":[0.9230483,0.0001388749,0.07446221,0.001169269,0.00009471937,0.000233491,0.000009564313,0.00002110712,0.0008224724],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9931023,"threshold_uncertainty_score":0.4967318,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002248954,0.00009252522,0.00006902535,0.00005073858,0.0004829007,0.000109984,0.0002967298,0.00003911841,0.000002637173],"category_scores_gemma":[0.00002361963,0.00005425658,0.00004128076,0.0001502115,0.00003393169,0.0002048402,0.00000707151,0.00005106505,0.000009421557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001672891,"about_ca_system_score_gemma":0.00004016088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005518548,"about_ca_topic_score_gemma":0.00002658272,"domain_scores_codex":[0.9992855,0.00002568048,0.0001524843,0.0002421174,0.0001350686,0.0001591975],"domain_scores_gemma":[0.9988939,0.0006699741,0.00003626829,0.0002698796,0.00007537078,0.00005458795],"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.000009430184,0.00002648987,0.000002428621,0.00000465631,0.00001668204,4.588879e-7,0.00007965028,0.000687203,0.000582532,0.007850338,0.00009544714,0.9906447],"study_design_scores_gemma":[0.004935918,0.001308762,0.003841342,0.0001986148,0.00008449487,0.0002279285,0.0001148509,0.3704905,0.03801477,0.3380602,0.2415583,0.001164416],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001041046,0.0001182746,0.9858696,0.0122842,0.0003386812,0.0002241962,0.00001636629,0.00007796157,0.0000297071],"genre_scores_gemma":[0.4419676,0.0004913753,0.5544291,0.0003393694,0.0002633888,0.000192095,0.000006725337,0.00001629913,0.00229411],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9894803,"threshold_uncertainty_score":0.371413,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002509242,0.0003525268,0.0002746716,0.0002551425,0.000367449,0.0001779383,0.0003740579,0.0002556815,0.0002138487],"category_scores_gemma":[0.00001274312,0.0003892434,0.0001457609,0.0003876351,0.0001101103,0.0004856578,0.000003391567,0.0003184747,0.00005099396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001487757,"about_ca_system_score_gemma":0.0000519962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004423072,"about_ca_topic_score_gemma":0.00001408307,"domain_scores_codex":[0.9982023,0.00004087041,0.0004601922,0.0004717841,0.0003052577,0.0005196463],"domain_scores_gemma":[0.9988911,0.0001255268,0.00006266248,0.000587453,0.0001695314,0.0001637143],"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.000005461484,0.0001207978,0.000001858761,0.00001699962,0.00003829632,0.000001074625,0.00004388927,0.7200756,0.0005863109,0.0001839604,0.00002399699,0.2789018],"study_design_scores_gemma":[0.001084522,0.0001127797,0.00007303284,0.00003291586,0.00005226506,0.00002462026,0.000232754,0.9816101,0.01441245,0.00175307,0.0001479943,0.0004635361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003585701,0.00009580013,0.9929965,0.0001348713,0.000955853,0.0005532035,0.0001997658,0.001051902,0.0004264762],"genre_scores_gemma":[0.0780278,0.00004426877,0.9205118,0.00009868876,0.0003769721,0.0002752972,0.0001904168,0.0001043584,0.0003703282],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2784382,"threshold_uncertainty_score":0.9998559,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001314665,0.000149493,0.0001266366,0.0001179407,0.0002510529,0.000215678,0.000307437,0.00007901488,0.00003566044],"category_scores_gemma":[0.000005832305,0.0001229153,0.00003153078,0.0003396366,0.00004718131,0.001113136,0.000007448446,0.0003028224,0.00006946213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001781261,"about_ca_system_score_gemma":0.00004082089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008501959,"about_ca_topic_score_gemma":0.0001327442,"domain_scores_codex":[0.9990579,0.00001572641,0.0002116033,0.0002306889,0.0002603826,0.0002236253],"domain_scores_gemma":[0.999178,0.00002559085,0.00008009972,0.000510926,0.0001130028,0.00009239032],"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.00001687644,0.00009248512,0.0000226605,0.00001329371,0.00002757236,0.000002418141,0.0004203891,0.000315585,0.0009103324,0.0004970579,0.00009529811,0.997586],"study_design_scores_gemma":[0.01144678,0.005571713,0.02774808,0.0003293493,0.000164815,0.002467877,0.001536557,0.6627895,0.05643116,0.001356419,0.227021,0.003136709],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01224782,0.00001338802,0.9849361,0.001338581,0.0005125112,0.0002122732,0.00001919505,0.0001383426,0.0005818452],"genre_scores_gemma":[0.907352,0.00001671919,0.09212033,0.0002104011,0.00006224782,0.0000591699,0.00001172978,0.000007335948,0.0001600301],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9944493,"threshold_uncertainty_score":0.5012342,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001596327,0.0001936582,0.0001784369,0.0002169126,0.0005020887,0.00008232868,0.0006773675,0.0001121162,0.00005977388],"category_scores_gemma":[0.00002698396,0.0001713901,0.00008099994,0.0002960825,0.00005854993,0.0008216684,0.00004201198,0.0001969525,0.00002419813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002948634,"about_ca_system_score_gemma":0.00004209661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001756678,"about_ca_topic_score_gemma":0.00003755317,"domain_scores_codex":[0.9987723,0.00003589503,0.0002456803,0.000490772,0.0001796728,0.0002757359],"domain_scores_gemma":[0.9986624,0.000234224,0.00007334307,0.0008137616,0.00007763869,0.0001386135],"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.00005716298,0.0005284277,0.0002812623,0.0000146998,0.00007530904,0.00001083702,0.001363412,0.0002175761,0.000498174,0.003052455,0.0003894029,0.9935113],"study_design_scores_gemma":[0.007325158,0.002778842,0.1363428,0.0002342321,0.0001944117,0.0001195197,0.000466369,0.7849239,0.0228056,0.0267753,0.0161889,0.001844998],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009994427,0.0001287964,0.9883642,0.0003352389,0.0003707182,0.0003520196,0.00008538531,0.0002522384,0.0001169734],"genre_scores_gemma":[0.379373,0.00008454432,0.6197804,0.00009215436,0.00003921339,0.0001122999,0.00001126823,0.00001905282,0.0004881477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9916663,"threshold_uncertainty_score":0.6989084,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003888001,0.0001300088,0.0001002618,0.0003354128,0.0002700672,0.00005595034,0.0009484442,0.00006360842,0.00008221657],"category_scores_gemma":[0.00003733352,0.0001241173,0.00009563848,0.0008747693,0.00006693308,0.001172811,0.00001747289,0.0002669418,0.00033948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000525696,"about_ca_system_score_gemma":0.00001958445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005873113,"about_ca_topic_score_gemma":0.000001496905,"domain_scores_codex":[0.9986521,0.00009290574,0.000147482,0.0002588075,0.0003911437,0.0004575785],"domain_scores_gemma":[0.9985064,0.0002215517,0.00003398157,0.0009716928,0.00007844778,0.0001879158],"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.000007400622,0.0002558997,0.00003017788,0.000004260983,0.00002050879,0.000002176256,0.0004400108,0.0001915409,0.0004625226,0.07194809,0.00004408848,0.9265933],"study_design_scores_gemma":[0.003106983,0.001266566,0.02783223,0.00008292782,0.00007088793,0.0002846743,0.0006555256,0.05089224,0.1752976,0.7067215,0.03164072,0.002148091],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001627598,0.00009687427,0.9951689,0.001169556,0.0006088084,0.0001521129,0.000004879099,0.0002677636,0.0009035713],"genre_scores_gemma":[0.7536101,0.00005449302,0.2455102,0.0002000472,0.00004355018,0.00006476838,0.000001500174,0.00001467725,0.0005007075],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9244452,"threshold_uncertainty_score":0.5061356,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003988065,0.0001048859,0.0001755181,0.00005272218,0.0004669848,0.0001361996,0.0003473328,0.00006064458,0.00002956266],"category_scores_gemma":[0.0003728335,0.00006603134,0.00008452478,0.0003433177,0.0002418333,0.0003994613,0.000007088428,0.00009792005,0.00001747821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001271679,"about_ca_system_score_gemma":0.00003278848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009165306,"about_ca_topic_score_gemma":0.00001297561,"domain_scores_codex":[0.9986433,0.0003738136,0.0002850168,0.0001935,0.0002706656,0.0002337488],"domain_scores_gemma":[0.9860277,0.0130892,0.0001054862,0.0005380998,0.000165246,0.00007430511],"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.0004672686,0.0002198351,0.0003261654,0.0000229368,0.0000892996,1.020907e-7,0.0004789812,0.007854429,0.001033381,0.1628043,0.0001685083,0.8265348],"study_design_scores_gemma":[0.001015798,0.0003973406,0.07438804,0.00006233516,0.0001100858,0.00001305484,0.004943918,0.001428712,0.01337091,0.8843587,0.01962367,0.0002874198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1488286,0.0005096503,0.8484923,0.0004492191,0.0004905565,0.0006454312,0.00005804821,0.00003437898,0.0004918519],"genre_scores_gemma":[0.9940621,0.00006997499,0.005291282,0.00001875631,0.00007448275,0.000218284,0.000001908082,0.000008602796,0.0002546403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8452335,"threshold_uncertainty_score":0.3591717,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007106406,0.0003972067,0.0004023856,0.0005798371,0.0003410323,0.0001316888,0.001502159,0.0002033525,0.000101999],"category_scores_gemma":[0.00004443816,0.0004047083,0.0003258774,0.001755244,0.0001219446,0.000957133,0.00003894171,0.0004569858,0.0001429826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001084156,"about_ca_system_score_gemma":0.00006680225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007117294,"about_ca_topic_score_gemma":0.00004974103,"domain_scores_codex":[0.9972229,0.000168982,0.0005136284,0.0006630523,0.0004410378,0.000990403],"domain_scores_gemma":[0.9974713,0.000686678,0.0001010771,0.001300728,0.0001124294,0.000327823],"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.00006700149,0.003592111,0.0003422367,0.00004027607,0.0003019641,0.00002733651,0.002219144,0.0005304038,0.001311576,0.01178194,0.002296293,0.9774897],"study_design_scores_gemma":[0.0130897,0.002523761,0.02519381,0.0005064725,0.0004672818,0.0004469738,0.000485547,0.5605665,0.05415698,0.1533876,0.1825618,0.006613622],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003693816,0.0002366403,0.9906369,0.001379979,0.001560549,0.0008104879,0.0001514615,0.0007793518,0.0007508402],"genre_scores_gemma":[0.407741,0.0001894298,0.5881047,0.002141423,0.000249194,0.0006654902,0.0001015162,0.00009872697,0.0007085243],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9708761,"threshold_uncertainty_score":0.9998405,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002147383,0.0002257519,0.0001994215,0.0002223511,0.002300173,0.0005829671,0.001776979,0.0001009405,0.00005786469],"category_scores_gemma":[0.0000327956,0.0002332704,0.0001044256,0.0002092668,0.0002777577,0.0009383205,0.00008883,0.0002966656,0.0001312839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005177954,"about_ca_system_score_gemma":0.00003448296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000128279,"about_ca_topic_score_gemma":0.00004101191,"domain_scores_codex":[0.9984795,0.00003874105,0.0002264231,0.0006466546,0.000292523,0.0003161025],"domain_scores_gemma":[0.9971403,0.00009025718,0.0001282416,0.002387515,0.00009742387,0.000156201],"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.00001522359,0.0002682248,0.0001787227,0.00001453573,0.0001079453,0.00001285113,0.0003176744,0.0001833501,0.0003134295,0.009512467,0.0001711262,0.9889045],"study_design_scores_gemma":[0.004311654,0.0007036452,0.2262887,0.00013112,0.0002458875,0.0002332515,0.0008855778,0.5410001,0.007747826,0.1922072,0.02378459,0.002460502],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007897792,0.0001338852,0.9846287,0.005297347,0.0009753637,0.0002275348,0.00005410901,0.000272673,0.0005126416],"genre_scores_gemma":[0.8805505,0.0003461988,0.1178327,0.0001749538,0.00004668188,0.00005679284,0.000009953804,0.00001811795,0.0009640729],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9864439,"threshold_uncertainty_score":0.9989987,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002058132,0.0001739139,0.0001307189,0.00007034304,0.0002871278,0.00003041679,0.0006298171,0.0001493688,0.00007083928],"category_scores_gemma":[0.00002098081,0.0001482335,0.0001406296,0.0001549245,0.0001156818,0.00002179917,0.000008446247,0.0001823483,0.000007347158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009039606,"about_ca_system_score_gemma":0.0000681164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007998425,"about_ca_topic_score_gemma":0.0002567083,"domain_scores_codex":[0.9989853,0.00003959058,0.0002028277,0.000359477,0.0001669577,0.0002458515],"domain_scores_gemma":[0.9984941,0.00006379013,0.00007288498,0.001103744,0.0001468905,0.000118588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001288363,0.0005728822,0.00003082782,0.00001361459,0.0001753427,0.000001282852,0.0004136819,0.00489992,0.7948488,0.0001787769,0.0001208064,0.1986152],"study_design_scores_gemma":[0.003652107,0.003179076,0.001600194,0.0000105155,0.0003421878,0.00004364421,0.003087934,0.02871901,0.901488,0.001397594,0.05569243,0.0007873089],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4239958,0.00004548696,0.5732768,0.0005453539,0.0005728403,0.0007331449,0.0006075092,0.00004626764,0.0001768485],"genre_scores_gemma":[0.9611092,0.00005953931,0.03783332,0.000189322,0.0002198012,0.0001551648,0.0001993575,0.00004592017,0.0001884226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5371134,"threshold_uncertainty_score":0.6044788,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000164072,0.0001495229,0.0001271471,0.0002139735,0.0001796745,0.0001157233,0.0002162541,0.0000426073,0.0005255943],"category_scores_gemma":[0.00001393459,0.0001330562,0.00007235832,0.0003102008,0.00002124626,0.0006891761,0.000008496033,0.00008322652,0.000634634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003724789,"about_ca_system_score_gemma":0.000009467497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001345638,"about_ca_topic_score_gemma":0.000126979,"domain_scores_codex":[0.9991043,0.000003457542,0.0001843732,0.0002906127,0.000207113,0.0002101399],"domain_scores_gemma":[0.9994109,0.00001760504,0.00004340605,0.000408948,0.0001071763,0.00001195225],"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.0004158095,0.000565155,0.0005393701,0.001215475,0.0002771453,0.000001120648,0.0002489264,0.1120705,0.0002768886,0.00640769,0.0009336888,0.8770483],"study_design_scores_gemma":[0.002565039,0.000115532,0.001277768,0.00008190831,0.0001318044,0.000001040507,0.001440126,0.7418311,0.000422151,0.00111457,0.2504188,0.0006001813],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01918429,0.000007391106,0.9735816,0.002103706,0.0006631588,0.0009396014,0.000006268544,0.0002261738,0.003287857],"genre_scores_gemma":[0.9557857,0.000008963682,0.03776808,0.001698636,0.0002063002,0.0003413677,0.00006085509,0.0000460714,0.00408404],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9366014,"threshold_uncertainty_score":0.8157148,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003359487,0.0002718356,0.0002782694,0.000311233,0.0007672925,0.0002950901,0.001248558,0.0001814055,0.0002487203],"category_scores_gemma":[0.00005032304,0.000280786,0.0002790118,0.0008346831,0.000131661,0.0003937599,0.00001481994,0.0006371729,0.0001611311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005119653,"about_ca_system_score_gemma":0.0001626738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003826341,"about_ca_topic_score_gemma":0.000081834,"domain_scores_codex":[0.9981883,0.00004582762,0.0003120241,0.0006194249,0.000366293,0.0004681171],"domain_scores_gemma":[0.9979532,0.0005145979,0.0000983209,0.001051406,0.0002032968,0.0001791567],"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.000126845,0.002511971,0.00008712661,0.0000426292,0.0001579304,0.000006251524,0.0003984356,0.009338041,0.01029798,0.01134066,0.004323654,0.9613685],"study_design_scores_gemma":[0.000992511,0.0005905968,0.0002853469,0.00001501892,0.00002904302,0.00001684017,0.00001142639,0.9131518,0.02423098,0.008891125,0.05134397,0.0004413141],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001862073,0.00001207322,0.9911718,0.003164673,0.002433785,0.0004048179,0.00003497767,0.0005874535,0.0003282865],"genre_scores_gemma":[0.2198521,0.000002573919,0.7783786,0.0004657806,0.0001988255,0.000171721,0.000009618385,0.00003138978,0.0008894217],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9609272,"threshold_uncertainty_score":0.9999644,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003344278,0.0002047608,0.0001424213,0.0002603305,0.0004023312,0.0001923669,0.0004387254,0.0001021783,0.003906367],"category_scores_gemma":[0.0001005264,0.0002063117,0.0001095571,0.0007156612,0.0000877575,0.0008241976,0.00001596761,0.0003546259,0.004884343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003440703,"about_ca_system_score_gemma":0.00002413171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001332341,"about_ca_topic_score_gemma":0.00190949,"domain_scores_codex":[0.9986508,0.000008575887,0.0003070919,0.000408333,0.0003470921,0.0002781006],"domain_scores_gemma":[0.9987751,0.00002194261,0.00004756014,0.0008934942,0.0002348618,0.00002702444],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000102584,0.001436633,0.0003030528,0.0002221235,0.0001065256,0.000005330935,0.0001088094,0.005495481,0.001115229,0.009298085,0.002759945,0.9790462],"study_design_scores_gemma":[0.00190971,0.00007561238,0.02519093,0.00003139433,0.000193001,0.000003935222,0.0005309398,0.07502042,0.001161153,0.01429725,0.8803299,0.001255773],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2229338,0.00001982763,0.7345542,0.01372623,0.01021292,0.00109756,0.00004510258,0.001212438,0.01619793],"genre_scores_gemma":[0.9936111,0.000008275191,0.002556364,0.001626092,0.0003007759,0.0000874586,0.00004760157,0.00001596791,0.001746395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9777904,"threshold_uncertainty_score":0.9970042,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002500429,0.000176189,0.0001492314,0.0001650111,0.000276357,0.0001318006,0.0007389693,0.00005917541,0.000132224],"category_scores_gemma":[0.00004940868,0.0001422046,0.00004514128,0.001038947,0.00006908988,0.001570773,0.00001453129,0.0002965798,0.0001571114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003080564,"about_ca_system_score_gemma":0.0002070942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001446593,"about_ca_topic_score_gemma":0.000005488236,"domain_scores_codex":[0.9985645,0.00005382113,0.000186445,0.000306451,0.0004356586,0.00045317],"domain_scores_gemma":[0.9987359,0.0001642687,0.00005163692,0.0006285525,0.0001685747,0.0002510365],"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.00011507,0.005757194,0.002023934,0.002197348,0.0005560522,0.00004939233,0.006493008,0.06926531,0.0004382132,0.008478162,0.001053948,0.9035724],"study_design_scores_gemma":[0.01724888,0.007308667,0.01757523,0.01111786,0.000655138,0.002311632,0.00399614,0.7216121,0.1216474,0.01643398,0.06826883,0.01182412],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000547256,0.0006516551,0.9930165,0.003420004,0.0002384088,0.0002596128,0.000006110834,0.0003601691,0.001500247],"genre_scores_gemma":[0.1268529,0.0009926329,0.8694719,0.001695288,0.00008897529,0.000076768,0.000005465492,0.00002749991,0.0007885112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8917482,"threshold_uncertainty_score":0.5798934,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001538712,0.000145201,0.0001396673,0.0003887409,0.000510498,0.00006453748,0.0005154047,0.00005544133,0.00001643288],"category_scores_gemma":[0.00004865892,0.0001437535,0.0001168566,0.001416222,0.00004379865,0.000442306,0.000009065736,0.0001095046,0.0000402926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005590355,"about_ca_system_score_gemma":0.00006938434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008691519,"about_ca_topic_score_gemma":0.000004076101,"domain_scores_codex":[0.9988267,0.0000257672,0.0002100642,0.0003996849,0.0002863346,0.0002514114],"domain_scores_gemma":[0.9989339,0.0002611994,0.00006143514,0.0005088433,0.0001382076,0.00009640503],"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.00002915779,0.0003553371,0.00001335398,0.00002263328,0.00005126468,0.00001090224,0.000316637,0.06628166,0.0001906347,0.007034712,0.0007598425,0.9249339],"study_design_scores_gemma":[0.00220901,0.0006643855,0.00269165,0.00002911312,0.00003614205,0.0001970946,0.00006931475,0.9015295,0.0247986,0.02379437,0.04308888,0.0008919376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002044744,0.0001285205,0.9953543,0.001199336,0.0006345415,0.0002747665,0.00003096347,0.0002107956,0.0001220558],"genre_scores_gemma":[0.4181785,0.00009640836,0.5800534,0.0002693835,0.000096176,0.000130549,0.00001581537,0.00001337641,0.00114638],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9240419,"threshold_uncertainty_score":0.5862097,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001291668,0.0001496025,0.0001404493,0.0001856565,0.0004559018,0.00007598549,0.0007884345,0.00005402869,0.0001640519],"category_scores_gemma":[0.000008443783,0.0001443584,0.0001160714,0.0003465543,0.00006192013,0.0003877686,0.00002159741,0.0001420108,0.0001451241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005705742,"about_ca_system_score_gemma":0.00003778173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001033182,"about_ca_topic_score_gemma":0.000005150878,"domain_scores_codex":[0.9987954,0.00002888553,0.0001909984,0.0004010545,0.0002859655,0.0002976547],"domain_scores_gemma":[0.9989566,0.00012089,0.00003638867,0.0006467311,0.0001199345,0.000119506],"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.00006404904,0.001634336,0.00001149177,0.0001149779,0.0003563587,0.00007645862,0.004435445,0.03037333,0.0001513383,0.04859621,0.00363962,0.9105464],"study_design_scores_gemma":[0.01105495,0.002435775,0.004647695,0.0002641841,0.0001133488,0.0002766157,0.001703967,0.7360203,0.01593788,0.01868574,0.2063569,0.002502691],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007753287,0.00002427013,0.9905444,0.002332831,0.000336561,0.0005750231,0.00002915686,0.0002645061,0.005815665],"genre_scores_gemma":[0.05341591,0.0002802576,0.9352186,0.001085756,0.00005489301,0.0004343012,0.00001562317,0.00002653974,0.009468148],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9080437,"threshold_uncertainty_score":0.5886765,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002918766,0.0002123401,0.0001725532,0.0002623373,0.0003742785,0.0001301579,0.000197593,0.00008301783,0.0001344845],"category_scores_gemma":[0.00003592681,0.0001678623,0.00006383478,0.0002803255,0.0001023308,0.0007738905,0.00002045511,0.00007591717,0.00008162218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003590716,"about_ca_system_score_gemma":0.00001120828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002031981,"about_ca_topic_score_gemma":0.0002003478,"domain_scores_codex":[0.9987526,0.000007965299,0.0003221799,0.0004719313,0.0001696705,0.0002756397],"domain_scores_gemma":[0.9992645,0.00006063786,0.00007377504,0.000414224,0.0001470179,0.00003978294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002235247,0.0001416222,0.00002965161,0.0002735422,0.00005278097,1.268828e-7,0.00005970321,0.00007103558,0.0009320413,0.00256396,0.0001815858,0.9956716],"study_design_scores_gemma":[0.008656351,0.0002886476,0.003795826,0.0002307025,0.0005911303,0.00001072886,0.001273036,0.3369566,0.001849307,0.07418615,0.5701665,0.001995008],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001526384,0.0000707803,0.9860406,0.009738777,0.0002674534,0.001737068,0.00005575605,0.0002176208,0.0003455609],"genre_scores_gemma":[0.8382698,0.001658354,0.1332086,0.004378039,0.002333856,0.01197704,0.0002921188,0.0002422948,0.007639926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9936766,"threshold_uncertainty_score":0.6845226,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002121499,0.0001310222,0.0001560212,0.0003747687,0.000150065,0.00003620583,0.001085356,0.00005771165,0.00004970826],"category_scores_gemma":[0.00001441762,0.0001246414,0.0001352911,0.001169502,0.0001325099,0.0003835977,0.00001722501,0.0002071117,0.0000674754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002416348,"about_ca_system_score_gemma":0.00003358691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007312698,"about_ca_topic_score_gemma":0.00002659694,"domain_scores_codex":[0.9986404,0.00007110465,0.000244255,0.0003355413,0.0003935164,0.0003151596],"domain_scores_gemma":[0.9984515,0.0001945734,0.00005744012,0.00111415,0.0001060012,0.00007634415],"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.00004205387,0.0008554641,0.0001973476,0.00002769727,0.00006876209,0.00003094886,0.0001373156,0.0139645,0.01369156,0.1391606,0.0001929892,0.8316307],"study_design_scores_gemma":[0.001223168,0.0005257432,0.009773755,0.00004736004,0.00001934099,0.00003992575,0.00003915665,0.02397064,0.1870961,0.7727718,0.00398471,0.000508287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008027884,0.00008783397,0.9899929,0.0004808747,0.0002191975,0.0001428446,0.00001425831,0.0001661929,0.0008679722],"genre_scores_gemma":[0.790545,0.00003044786,0.208572,0.0000529692,0.00002161468,0.00003853414,0.000001668897,0.00001563131,0.000722159],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8311225,"threshold_uncertainty_score":0.508273,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003970779,0.0002009276,0.0001641439,0.0003996012,0.0001646392,0.0000601074,0.0003417176,0.00006800999,0.001881679],"category_scores_gemma":[0.00002594614,0.0002070155,0.00007756897,0.0008343757,0.00004462338,0.0007562928,0.00001981599,0.0001714691,0.001129742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000954866,"about_ca_system_score_gemma":0.0000160083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004868009,"about_ca_topic_score_gemma":0.002115269,"domain_scores_codex":[0.998545,0.00001545136,0.00043784,0.0004179573,0.000281122,0.0003026206],"domain_scores_gemma":[0.9992005,0.00001199802,0.00005671449,0.0005853487,0.0001256669,0.00001978302],"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.0001076669,0.002982152,0.002541169,0.0006061205,0.00009922151,0.000007198342,0.002059256,0.0630049,0.0001717243,0.001436084,0.0004731717,0.9265113],"study_design_scores_gemma":[0.01123228,0.0006848822,0.2359041,0.0007281662,0.0005294901,0.000003739197,0.02282931,0.3760364,0.005939506,0.04131128,0.2994018,0.005399001],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2151037,0.0002670485,0.749302,0.002080448,0.003040456,0.004129795,0.0000429123,0.000982694,0.02505095],"genre_scores_gemma":[0.9943987,0.00005936038,0.002857905,0.001237268,0.00006493914,0.0006229401,0.00003330124,0.00001714349,0.0007085062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9211124,"threshold_uncertainty_score":0.999648,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001472877,0.0003326706,0.0003181133,0.0002564699,0.0009002616,0.0001122274,0.001731161,0.0001460989,0.0003409023],"category_scores_gemma":[0.00001538961,0.0003281615,0.0002679155,0.001110322,0.0001997862,0.0007366644,0.00005232705,0.0005424341,0.0006204811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001027206,"about_ca_system_score_gemma":0.00008286488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001297425,"about_ca_topic_score_gemma":0.000006039008,"domain_scores_codex":[0.9977171,0.0000800014,0.0003711237,0.0006818339,0.0005995317,0.0005503765],"domain_scores_gemma":[0.9979452,0.0002254885,0.00008542585,0.001389707,0.0001160756,0.0002380755],"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.00009304035,0.001917619,0.00009450402,0.000031307,0.0003239709,0.0005481427,0.001676093,0.001306188,0.0005420797,0.006694146,0.003678489,0.9830944],"study_design_scores_gemma":[0.004279176,0.001003135,0.01235068,0.0000979109,0.00008803074,0.002208646,0.0000700989,0.7986009,0.01360113,0.1128526,0.05265109,0.002196664],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004994719,0.00005186304,0.9906172,0.001826601,0.001141843,0.0002087154,0.000112749,0.000656626,0.0003897126],"genre_scores_gemma":[0.5516784,0.0001539908,0.4459345,0.00108665,0.0001080617,0.00007235014,0.00004486348,0.00004413622,0.0008771453],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9808978,"threshold_uncertainty_score":0.999917,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002374584,0.0001498804,0.0001504726,0.0003019581,0.0001945251,0.0002000009,0.0008848459,0.0001049358,0.0002013008],"category_scores_gemma":[0.00002311372,0.0001467215,0.00007696409,0.0004356093,0.00003942622,0.001145483,0.00001425436,0.0002242526,0.00008965113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005746984,"about_ca_system_score_gemma":0.00007108298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002963134,"about_ca_topic_score_gemma":0.0001833594,"domain_scores_codex":[0.9985945,0.00009357175,0.0002683497,0.0004309914,0.0002541499,0.0003584877],"domain_scores_gemma":[0.9988048,0.0001227632,0.00004427964,0.0007460403,0.0001152031,0.0001669045],"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.00001517187,0.000658308,0.000006757308,0.00001040752,0.00002385952,0.000005070858,0.001907204,0.03222656,0.001177713,0.000835972,0.0002814042,0.9628516],"study_design_scores_gemma":[0.001936091,0.0006493993,0.001002141,0.00002365271,0.000008373978,0.00001802032,0.0003633125,0.9823703,0.004069761,0.008203689,0.0009377548,0.0004174784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005432632,0.00001694948,0.9909651,0.001967556,0.0004000406,0.000628081,0.000009417323,0.0001846693,0.0003955035],"genre_scores_gemma":[0.4288826,0.00003591471,0.5686405,0.0004970604,0.00007044632,0.0006455782,0.00001236887,0.00002708019,0.001188466],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9624341,"threshold_uncertainty_score":0.5983131,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001268729,0.0003381666,0.000294716,0.000657415,0.0006193945,0.0001524968,0.002179413,0.0001800234,0.00004113089],"category_scores_gemma":[0.00009688683,0.0003294255,0.0003450929,0.001408564,0.0001868839,0.0007472446,0.00003803599,0.0005482471,0.00005552073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001196986,"about_ca_system_score_gemma":0.0000920824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003201042,"about_ca_topic_score_gemma":0.00003005486,"domain_scores_codex":[0.9970211,0.00006703119,0.0004499611,0.0008842708,0.0005303677,0.001047308],"domain_scores_gemma":[0.9967189,0.0008247365,0.00009607802,0.001710452,0.0002799458,0.0003698748],"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.000100859,0.0002892962,0.000004034212,0.00001420726,0.00007694551,0.00001456677,0.0002302823,0.0001678723,0.004775932,0.01114635,0.00005594875,0.9831237],"study_design_scores_gemma":[0.006594119,0.003751558,0.001322299,0.00007829151,0.00008598708,0.0002141811,0.0004960368,0.2211392,0.2809263,0.4547879,0.02827965,0.002324446],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007032085,0.00007264172,0.995382,0.000995967,0.001114952,0.000853183,0.00005305281,0.0005044266,0.0003205892],"genre_scores_gemma":[0.07497326,0.00005917235,0.9228054,0.0004245968,0.0001408995,0.0002620081,0.00000769652,0.0000629968,0.001263959],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9807993,"threshold_uncertainty_score":0.9999158,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008929633,0.0002321978,0.0001646603,0.0002249507,0.0009484427,0.0003052089,0.002593356,0.0001236608,0.00002816153],"category_scores_gemma":[0.00005402965,0.0001788716,0.000131892,0.0007691766,0.0002156226,0.001150288,0.00002680971,0.0007956313,0.00003506192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003713096,"about_ca_system_score_gemma":0.00008584627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002605711,"about_ca_topic_score_gemma":0.00002110233,"domain_scores_codex":[0.9979324,0.00008585121,0.0002717522,0.0006537569,0.0004997123,0.0005565318],"domain_scores_gemma":[0.9968979,0.0006315365,0.00008977633,0.001974941,0.0002320884,0.0001737852],"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.00001115717,0.0001586624,0.000002328169,0.000007584233,0.00002170044,0.000002081463,0.0003669115,0.001572798,0.003187046,0.006326037,0.00001144424,0.9883323],"study_design_scores_gemma":[0.0005518906,0.0003184902,0.0001662896,0.00001578601,0.00001512948,0.00003242511,0.0001425101,0.8670442,0.01836115,0.1111518,0.001912065,0.000288211],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000283046,0.00002709639,0.9958711,0.001710385,0.0006601535,0.0009843943,0.000026828,0.0003529081,0.00008408359],"genre_scores_gemma":[0.04220047,0.00002337812,0.9566659,0.0001789696,0.0001379935,0.0005968196,0.000005578941,0.00003480658,0.0001560442],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.988044,"threshold_uncertainty_score":0.729475,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002797802,0.0002818338,0.0002253406,0.0002616071,0.0004166827,0.0001481427,0.001171123,0.0001076291,0.0002159696],"category_scores_gemma":[0.00002438303,0.0002409999,0.0001578773,0.0004977433,0.00003995947,0.001044033,0.00003404646,0.0003467371,0.0002872224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001023193,"about_ca_system_score_gemma":0.00005412325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009499177,"about_ca_topic_score_gemma":0.0000146841,"domain_scores_codex":[0.9980994,0.00008396158,0.0002538959,0.0004684331,0.0005344643,0.0005597893],"domain_scores_gemma":[0.9977894,0.0002905658,0.00007189954,0.001519249,0.00004685459,0.0002820249],"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.00003894349,0.0006834074,0.0001333657,0.000007505318,0.00002509857,0.00001267652,0.0001396793,0.005466309,0.0002424572,0.0005062113,0.0005848329,0.9921595],"study_design_scores_gemma":[0.002501627,0.001038771,0.02380911,0.0001586656,0.0000538799,0.00006312293,0.00007151723,0.9041783,0.01569655,0.00066792,0.05070281,0.001057717],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001303836,0.00005662837,0.9943241,0.0009601559,0.001284984,0.0001598954,0.00004000821,0.0003409041,0.001529504],"genre_scores_gemma":[0.7082556,0.0000217388,0.2902845,0.0006900793,0.0002593528,0.00005223608,0.00001274163,0.00002984609,0.0003938616],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9911018,"threshold_uncertainty_score":0.9827691,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006362072,0.0002699292,0.0002260349,0.0004055619,0.0004850163,0.0001826978,0.001397374,0.00009689166,0.0001840456],"category_scores_gemma":[0.00002268883,0.0002575591,0.0002261526,0.0009366489,0.0000953016,0.0005269711,0.00004364655,0.000404514,0.0001387648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009069228,"about_ca_system_score_gemma":0.00004153751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007785656,"about_ca_topic_score_gemma":0.0001708616,"domain_scores_codex":[0.9977654,0.00004974038,0.0004255024,0.0005864945,0.0005507487,0.0006221416],"domain_scores_gemma":[0.9979883,0.0002762855,0.00008763656,0.001346068,0.00009315831,0.0002085114],"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.00001009106,0.0002815597,0.00002559457,0.000005755398,0.00005585969,0.00004086325,0.0004306989,0.0003922151,0.0003589168,0.006728322,0.0001135909,0.9915565],"study_design_scores_gemma":[0.009973897,0.003920115,0.03803163,0.0005230135,0.0002637472,0.0007219975,0.002854803,0.3140615,0.2066982,0.2091629,0.2077076,0.006080697],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001924504,0.0000793155,0.9930883,0.001544859,0.001161878,0.0001993243,0.00001343408,0.0004856276,0.001502758],"genre_scores_gemma":[0.45544,0.00005416652,0.542635,0.0008064366,0.0002073571,0.00002829058,0.00000458576,0.00002953528,0.000794624],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9854758,"threshold_uncertainty_score":0.9999877,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004226155,0.0004285182,0.0004668191,0.001144899,0.0003582935,0.0002082052,0.001890767,0.000172936,0.0001083808],"category_scores_gemma":[0.00004826017,0.0004495379,0.000287941,0.003282149,0.00006247234,0.0006144574,0.00004505563,0.0005836147,0.0004389653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001223363,"about_ca_system_score_gemma":0.0001055921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008791836,"about_ca_topic_score_gemma":0.00002402742,"domain_scores_codex":[0.9969416,0.0001185942,0.0005536884,0.0009997635,0.0005791699,0.0008071885],"domain_scores_gemma":[0.9977133,0.0002441877,0.0000826102,0.001472542,0.0001061826,0.0003811257],"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.0000220736,0.0006472302,0.000004351651,0.000004862475,0.00003132698,0.00009517118,0.00102722,0.001490695,0.000724997,0.000346233,0.0002617895,0.995344],"study_design_scores_gemma":[0.004397157,0.003277374,0.008828852,0.0004057168,0.00006234054,0.000363956,0.0002001951,0.8937427,0.01107479,0.06367574,0.01131679,0.002654413],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006138503,0.00008757062,0.9876007,0.004311488,0.0004934293,0.0005583628,0.0000594695,0.000426275,0.0003242318],"genre_scores_gemma":[0.03613881,0.00003450321,0.9599901,0.002535832,0.0001543858,0.0001297511,0.000005054077,0.0000293591,0.0009822493],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9926896,"threshold_uncertainty_score":0.9997956,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001825771,0.0002281778,0.0001938066,0.000176769,0.0003382093,0.0001202366,0.001513664,0.00009243059,0.0002116606],"category_scores_gemma":[0.00002550189,0.0001720075,0.0001585963,0.0005398084,0.0001162157,0.0006240949,0.00002910142,0.0002131477,0.0003033053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006140026,"about_ca_system_score_gemma":0.00003069379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002464575,"about_ca_topic_score_gemma":0.000004222102,"domain_scores_codex":[0.9982489,0.0000696073,0.0002593265,0.0005898609,0.0003844521,0.000447857],"domain_scores_gemma":[0.9980428,0.0003849808,0.00005868698,0.001296212,0.00006006692,0.0001572705],"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.000004629427,0.0001432442,0.00004348034,0.000003593905,0.00003330399,0.00001090723,0.00009262047,0.000008340203,0.002342495,0.001302664,0.001398683,0.994616],"study_design_scores_gemma":[0.008835967,0.001539794,0.00520379,0.0006730478,0.0001029286,0.000248009,0.0000817307,0.0762827,0.2896279,0.3477734,0.2656777,0.003953007],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002158253,0.00004000579,0.9843125,0.01151429,0.0008173372,0.0001291512,0.00005459107,0.0004260488,0.0005478132],"genre_scores_gemma":[0.4734235,0.0001660093,0.5198901,0.003705116,0.0001979689,0.0001108532,0.000004629739,0.00004522051,0.002456579],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9906631,"threshold_uncertainty_score":0.7014263,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002870316,0.000202387,0.0002208451,0.0003949599,0.0008925198,0.0004730572,0.001466547,0.0001333394,0.00003832233],"category_scores_gemma":[0.00006439346,0.0002084906,0.0001639566,0.0002761571,0.0001193044,0.002602858,0.00001970989,0.0002826884,0.0001111416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008746435,"about_ca_system_score_gemma":0.00006306247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001324544,"about_ca_topic_score_gemma":0.0001452754,"domain_scores_codex":[0.9986556,0.00003596916,0.0003356759,0.0003292106,0.0002676364,0.000375945],"domain_scores_gemma":[0.9983211,0.0001498182,0.0001464172,0.001218866,0.00008089768,0.0000828925],"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.00004153917,0.0001994921,0.00001172406,0.00001468603,0.00002645948,0.000002476334,0.0008070814,0.0009842801,0.0001223926,0.001172919,0.0002727541,0.9963442],"study_design_scores_gemma":[0.003921564,0.001097508,0.01489881,0.00009616202,0.00003565012,0.00007241043,0.0001514692,0.90786,0.01143496,0.02711806,0.03240108,0.0009123362],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002251275,0.00001524286,0.9907219,0.00492559,0.0007955822,0.0004584333,0.00003521375,0.0002185372,0.0005782453],"genre_scores_gemma":[0.6192331,0.00009318751,0.3772035,0.001022681,0.0002514652,0.0004649119,0.00003241953,0.00003719303,0.001661614],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9954318,"threshold_uncertainty_score":0.8502001,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018734,0.0001693214,0.0002293831,0.0001828324,0.000310871,0.0002557987,0.0009131465,0.0001110708,0.0007777867],"category_scores_gemma":[0.0005088329,0.0001388849,0.0001409453,0.001291867,0.0001583459,0.0003339057,0.00001223004,0.0002444048,0.003212971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007234596,"about_ca_system_score_gemma":0.0001107967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003371084,"about_ca_topic_score_gemma":0.00003576178,"domain_scores_codex":[0.9975775,0.0002293485,0.0004741535,0.0004825665,0.0009235949,0.0003128408],"domain_scores_gemma":[0.9969852,0.000924386,0.000131977,0.0013496,0.0003221489,0.0002866697],"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.000161137,0.0005473851,0.00009590032,0.000001817202,0.00006662428,0.000007195935,0.002217415,0.04565598,0.0001175004,0.01808446,0.01174738,0.9212972],"study_design_scores_gemma":[0.0008358735,0.0002090003,0.001159893,0.00001105699,0.00004043494,0.00002978123,0.001118246,0.009590411,0.0008195586,0.8228446,0.1630614,0.0002796746],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01888279,0.00004341285,0.9650576,0.004141791,0.0006818338,0.0003043254,0.00003794348,0.0001983713,0.01065196],"genre_scores_gemma":[0.9538248,0.00001396819,0.03433277,0.0007040947,0.0002743563,0.0001386162,0.000009884759,0.00002250879,0.01067899],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.934942,"threshold_uncertainty_score":0.9975631,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001330571,0.0001458039,0.0001128016,0.0002871268,0.0003502158,0.0002211426,0.000543287,0.0000621814,0.0002011231],"category_scores_gemma":[0.00001545386,0.0001422904,0.000102364,0.0006772534,0.00002840638,0.0008603639,0.000009521951,0.0002016641,0.0004451247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003116499,"about_ca_system_score_gemma":0.00005032408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006416868,"about_ca_topic_score_gemma":0.000005926628,"domain_scores_codex":[0.9988049,0.00004096578,0.0002093242,0.0003614076,0.0003459318,0.0002375271],"domain_scores_gemma":[0.9990847,0.0001490223,0.00004879624,0.0004802179,0.0001120672,0.0001252401],"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.000004094606,0.000193577,0.00002374666,0.000007342329,0.00005689866,0.00001016963,0.00040332,0.02291628,0.001950162,0.009271122,0.001028114,0.9641352],"study_design_scores_gemma":[0.001986996,0.0006536533,0.02415568,0.00007614461,0.00005226271,0.0003035756,0.0001678176,0.6233022,0.01916471,0.3176234,0.01105006,0.001463458],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01296637,0.00003700859,0.9815691,0.004076358,0.0006297291,0.0001730685,0.000005724683,0.0002198981,0.0003227905],"genre_scores_gemma":[0.625702,0.00001947466,0.3722811,0.00110841,0.000118377,0.00008256411,0.00001130576,0.00001206977,0.0006647156],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9626717,"threshold_uncertainty_score":0.5802434,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002997878,0.0003119524,0.0002859304,0.0002105575,0.0006613604,0.0002432298,0.0008990089,0.0001403364,0.00004210932],"category_scores_gemma":[0.00005152037,0.0003093722,0.0002009403,0.0005175095,0.0001064762,0.0006086917,0.00003020388,0.0003178873,0.00001384234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006725771,"about_ca_system_score_gemma":0.00007225067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002977188,"about_ca_topic_score_gemma":0.000009121395,"domain_scores_codex":[0.9979445,0.00004329673,0.0003887811,0.0007261795,0.0003751646,0.0005220257],"domain_scores_gemma":[0.9985237,0.0002819458,0.00008569132,0.000749845,0.0001584335,0.0002003832],"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.0000396859,0.0003677368,0.000003913122,0.00001774005,0.00005655806,0.00000646104,0.0002719978,0.001246648,0.0002644132,0.008003179,0.0002685877,0.9894531],"study_design_scores_gemma":[0.004860861,0.001662445,0.001514886,0.0001116542,0.00007723214,0.0001630415,0.00007384455,0.7810411,0.004053051,0.1727241,0.0325302,0.001187536],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003690634,0.00009324116,0.9922996,0.00510885,0.0009486832,0.0005411588,0.0002004571,0.000341657,0.00009734039],"genre_scores_gemma":[0.1172505,0.00009695293,0.8807865,0.0008491005,0.0004195649,0.0001603541,0.00005951595,0.00002460831,0.0003528916],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9882655,"threshold_uncertainty_score":0.9999359,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002384785,0.0001733968,0.0002017543,0.000226213,0.000197078,0.00004066399,0.001272865,0.00009824435,0.0001772595],"category_scores_gemma":[0.00001902719,0.0001711547,0.0001824652,0.0007092383,0.00008909723,0.0004961602,0.00003045911,0.0002665626,0.00004530869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000173325,"about_ca_system_score_gemma":0.00005903713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007237629,"about_ca_topic_score_gemma":0.0000756696,"domain_scores_codex":[0.9985648,0.00004768859,0.0003236965,0.0004467417,0.0003230135,0.0002940423],"domain_scores_gemma":[0.9981263,0.0001077922,0.0001077756,0.001422663,0.0001095189,0.0001259912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004665355,0.0007926194,0.000111346,0.00004207086,0.0001296328,0.00002858411,0.01033206,0.00001518387,0.0006466562,0.01696154,0.0002719329,0.9706217],"study_design_scores_gemma":[0.007202824,0.00399338,0.05095403,0.0005893999,0.0004937107,0.0004816343,0.002039128,0.06434608,0.6758584,0.11953,0.07037918,0.00413231],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00598374,0.00003585271,0.9912901,0.0003808105,0.000396027,0.000135819,0.0001560538,0.0001740469,0.001447569],"genre_scores_gemma":[0.4512367,0.00008061223,0.5480772,0.0005059662,0.00002842373,0.00001979152,0.000003536769,0.00001248062,0.0000352044],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9664894,"threshold_uncertainty_score":0.6979484,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001945094,0.0001125913,0.0002056678,0.0005951377,0.0001528517,0.00006951134,0.000876472,0.00006086992,0.0005706815],"category_scores_gemma":[0.00001778995,0.0001071175,0.0001850322,0.002026253,0.00004638668,0.0004062315,0.00001573734,0.0001453869,0.00013896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000556975,"about_ca_system_score_gemma":0.00003821022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000619455,"about_ca_topic_score_gemma":0.0002811868,"domain_scores_codex":[0.9988378,0.00004144496,0.0002662902,0.0003011771,0.0003377418,0.0002155827],"domain_scores_gemma":[0.9986904,0.000138672,0.00006220887,0.0008800412,0.0001152901,0.0001133776],"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.000006796017,0.0004470233,0.00007939785,0.00000950843,0.0005653607,0.000003829238,0.001113355,0.528767,0.00003940395,0.001409297,0.0001304135,0.4674285],"study_design_scores_gemma":[0.0003653171,0.0001139135,0.002562958,0.00001097862,0.0001417635,0.000003632725,0.00003100746,0.9900001,0.001049466,0.000206146,0.005345894,0.0001688508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006490386,0.00003022041,0.9923614,0.005903878,0.00008674043,0.0001178823,0.00001776181,0.0001214367,0.0007116018],"genre_scores_gemma":[0.5084413,0.0001757296,0.48952,0.0003759761,0.00002920518,0.00003219606,0.000006464636,0.00001117361,0.00140795],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5077923,"threshold_uncertainty_score":0.6248562,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002947668,0.0001315948,0.000102641,0.0001353368,0.001340116,0.0001463426,0.0008758361,0.00006362487,0.00004733812],"category_scores_gemma":[0.00007568448,0.00009988406,0.00004846389,0.00140352,0.00007252896,0.0005012304,0.00002436565,0.0002784212,0.00033124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007666244,"about_ca_system_score_gemma":0.0001099279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002534921,"about_ca_topic_score_gemma":0.00003310384,"domain_scores_codex":[0.998621,0.00008652895,0.0002271256,0.0003444469,0.0004380038,0.0002828835],"domain_scores_gemma":[0.9983793,0.0003321175,0.00004301167,0.000873375,0.0002350617,0.0001371176],"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.0001043919,0.0004583475,0.00003202123,0.000008931174,0.0001509907,0.00001666582,0.01166266,0.2775945,0.0005204697,0.09185538,0.004872617,0.612723],"study_design_scores_gemma":[0.002652868,0.0007871282,0.004483461,0.00004749101,0.00002394812,0.0000557034,0.0004727502,0.8387331,0.006773825,0.02519625,0.1196477,0.001125719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001771471,0.00001180567,0.9779905,0.01830929,0.0002578663,0.0004791648,0.000003327522,0.0001977891,0.002573088],"genre_scores_gemma":[0.09827909,0.0002781778,0.883805,0.00264839,0.00008355641,0.0004272739,0.000008967006,0.00003265943,0.01443691],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6115973,"threshold_uncertainty_score":0.99996,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008627064,0.0002148976,0.000207602,0.0001095383,0.0003387292,0.0001585751,0.0008884301,0.00007598787,0.00006972215],"category_scores_gemma":[0.00003734467,0.0002125469,0.0001104053,0.0005554302,0.0001427749,0.0003048021,0.00004649137,0.0003420814,0.00005447955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001743687,"about_ca_system_score_gemma":0.00004926183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001192844,"about_ca_topic_score_gemma":0.000005337295,"domain_scores_codex":[0.9985559,0.000047106,0.0002266817,0.0005608017,0.0003146267,0.0002948793],"domain_scores_gemma":[0.9988306,0.0001932743,0.00004710741,0.0005917165,0.00004492278,0.0002924122],"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.00001615272,0.0001274049,0.00006006462,0.00002626929,0.00005210999,0.00007735227,0.001290216,0.0002590914,0.0001381139,0.003338311,0.0001000383,0.9945149],"study_design_scores_gemma":[0.002859617,0.001927068,0.01647513,0.0001034417,0.0001237719,0.0004704086,0.0004111596,0.9158303,0.004358043,0.02926259,0.02632663,0.001851851],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005650518,0.00009137609,0.9858786,0.007290508,0.0004047678,0.0001552695,0.0000392466,0.0003382594,0.0001513888],"genre_scores_gemma":[0.7077442,0.00008858836,0.2887542,0.003097074,0.0001686041,0.00003876762,0.000004878732,0.00002450495,0.00007917544],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.992663,"threshold_uncertainty_score":0.8667411,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005747097,0.0003477632,0.0003202496,0.0003181834,0.0007119039,0.0003095178,0.0021642,0.0001612846,0.000107629],"category_scores_gemma":[0.00003088449,0.0002725275,0.0003771134,0.001319823,0.0001308293,0.0006264315,0.00004356688,0.0004310375,0.0001564906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006750351,"about_ca_system_score_gemma":0.00009802377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004959697,"about_ca_topic_score_gemma":0.00001515287,"domain_scores_codex":[0.9975579,0.0001014,0.0004621936,0.0007982849,0.0004995586,0.0005806553],"domain_scores_gemma":[0.9962992,0.001267275,0.0001591542,0.001878034,0.0002660225,0.0001302851],"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.00001619716,0.0002572055,0.000004070602,0.00002666123,0.0001252473,0.000001877374,0.0005488644,0.0004112536,0.0001607982,0.007714827,0.0002776414,0.9904553],"study_design_scores_gemma":[0.001880592,0.0006007573,0.0003354047,0.00006236994,0.00005952419,0.00004683554,0.000218679,0.9365811,0.003479724,0.04308731,0.01310435,0.0005434007],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004677983,0.0001548828,0.9916678,0.003282127,0.001637303,0.001882409,0.00008714333,0.0004961608,0.0003243434],"genre_scores_gemma":[0.02559385,0.0001088588,0.9711887,0.0007640984,0.0001574661,0.0008086271,0.00002355135,0.0000489945,0.001305863],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.989912,"threshold_uncertainty_score":0.9999727,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001280899,0.0002155456,0.0002585173,0.0001021219,0.000245694,0.00004997733,0.0002787328,0.0001129597,0.00006190327],"category_scores_gemma":[0.0001785247,0.0002042913,0.00006194398,0.0001845476,0.00005588022,0.0001288536,0.00001247606,0.0002344677,0.00001485531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000502238,"about_ca_system_score_gemma":0.00001683792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005262735,"about_ca_topic_score_gemma":0.0001286107,"domain_scores_codex":[0.9988434,0.00003890948,0.000340253,0.0002638703,0.0002621823,0.0002513991],"domain_scores_gemma":[0.9983813,0.0006345119,0.00009854937,0.0007677011,0.00005199028,0.00006594651],"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.0002179973,0.005589255,0.0001044948,0.0007748018,0.0006767901,0.0002393693,0.002865339,0.01840664,0.03252175,0.3479381,0.00713766,0.5835277],"study_design_scores_gemma":[0.001383159,0.0001523117,0.00007538255,0.00005923239,0.00008122733,0.00005200296,0.0001249522,0.00958358,0.01136578,0.9762267,0.0005547793,0.0003409234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07734287,0.00008169939,0.9201622,0.0004256392,0.0004831683,0.0003158049,0.00005785676,0.0003879878,0.0007427747],"genre_scores_gemma":[0.2577959,0.00001962514,0.7405197,0.00004989524,0.0002581317,0.00006401954,0.000006743639,0.00007233953,0.001213645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6282886,"threshold_uncertainty_score":0.8330759,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001641039,0.0001039703,0.00008883388,0.0001989591,0.0003086881,0.0001224361,0.0005086132,0.00007032509,0.0002052415],"category_scores_gemma":[0.00002424932,0.0001082338,0.00006707173,0.0005355291,0.00002385914,0.0004066086,0.00001173326,0.0003060193,0.0002726259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001922096,"about_ca_system_score_gemma":0.00005033058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001250563,"about_ca_topic_score_gemma":0.00002067802,"domain_scores_codex":[0.9990739,0.00002358781,0.0001523633,0.0003000364,0.0002669202,0.0001831693],"domain_scores_gemma":[0.9990955,0.0001358938,0.00003688837,0.0005673295,0.00006720417,0.00009715696],"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.00000342826,0.0002303819,0.000004529041,0.000003578719,0.00002368532,0.000004174386,0.0002016104,0.007294681,0.007883548,0.01124805,0.0000972222,0.9730051],"study_design_scores_gemma":[0.001593062,0.000391718,0.00856228,0.00003253973,0.00004119222,0.0001263944,0.00003180509,0.691445,0.1723744,0.09352349,0.0309411,0.0009370425],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0167626,0.00001089871,0.9778851,0.002775628,0.001423907,0.00009626784,0.000005310319,0.0001913379,0.0008489184],"genre_scores_gemma":[0.6254783,0.000007161924,0.3733495,0.0002787894,0.000141221,0.00002017036,0.000004162231,0.000007158713,0.0007135062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9720681,"threshold_uncertainty_score":0.4413647,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006199311,0.0002563765,0.0002495573,0.000254904,0.0004942336,0.0003332219,0.001255665,0.0001295304,0.00008323667],"category_scores_gemma":[0.00004422604,0.0002372358,0.000179521,0.0004839163,0.00005308773,0.0007200129,0.00002986062,0.0003102403,0.0001243317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005936441,"about_ca_system_score_gemma":0.00005509158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004304574,"about_ca_topic_score_gemma":0.00001797327,"domain_scores_codex":[0.9979129,0.0001114695,0.000373691,0.0006380886,0.0004204541,0.0005433428],"domain_scores_gemma":[0.9980474,0.0003808646,0.00008838898,0.001070559,0.0001888367,0.0002240275],"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.000008033939,0.0002604882,0.000002736902,0.00005184314,0.00005470407,0.000001178899,0.001315449,0.09022911,0.0002970005,0.004200479,0.0002500901,0.9033289],"study_design_scores_gemma":[0.001259002,0.0004231374,0.00003240682,0.00005655564,0.00001457909,0.00001861234,0.0000581143,0.9397352,0.001395466,0.02059311,0.03599683,0.0004169994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006897486,0.00001918588,0.9932738,0.003799686,0.000734949,0.000677161,0.00001977749,0.0004618345,0.0009446255],"genre_scores_gemma":[0.03537108,0.00004783649,0.9592478,0.001506159,0.000153935,0.0004217354,0.00001433254,0.00005243271,0.003184638],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9029119,"threshold_uncertainty_score":0.9674196,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003231418,0.0001976723,0.000179193,0.00009733059,0.000357267,0.0001941339,0.0004540602,0.00008299865,0.00007363873],"category_scores_gemma":[0.00001669699,0.0001729825,0.00005970998,0.0005042962,0.00007737677,0.0005441345,0.00001182536,0.0002194733,0.00005735141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006308535,"about_ca_system_score_gemma":0.00006598339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001161567,"about_ca_topic_score_gemma":0.00002124827,"domain_scores_codex":[0.998157,0.0001373947,0.0003258725,0.000525808,0.0004756181,0.0003782909],"domain_scores_gemma":[0.9985746,0.0001133834,0.0001087868,0.0008976529,0.0001017333,0.00020389],"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.000009059708,0.0001669449,0.000002197673,0.0000062495,0.00001744787,0.0000244539,0.0002442129,0.5456926,0.000007305549,0.00005458521,0.0008913937,0.4528836],"study_design_scores_gemma":[0.0004621021,0.0006791621,0.00004308211,0.00003246208,0.00001530213,0.00008675994,0.00003628444,0.9904907,0.000211342,0.0005507141,0.007130246,0.0002618304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005166599,0.00001577718,0.9971406,0.000946715,0.0004440894,0.0003086971,0.000003373963,0.0003053488,0.0003187288],"genre_scores_gemma":[0.8277739,0.00004250022,0.1706442,0.0006196885,0.00006370594,0.0001262354,0.00002043567,0.00002757154,0.0006817188],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8272573,"threshold_uncertainty_score":0.7054022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}