{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":79,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":79,"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":"5af15334142c","filters":{"venue":"Journal of the ACM"}},"results":[{"id":"W2122780600","doi":"10.1145/502090.502097","title":"Quantum lower bounds by polynomials","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":659,"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 Calgary","funders":"","keywords":"Boolean function; Quantum algorithm; Mathematics; Bounded function; Discrete mathematics; Quantum; Polynomial; Quantum complexity theory; Extension (predicate logic); Function (biology); Combinatorics; Computer science; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01042503458019538,"gpt":0.2404386584872687,"spread":0.2300136239070733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005223367,0.00009823159,0.0001677629,0.00005542587,0.0001633744,0.0001737505,0.004381924,0.00003878149,0.000011956],"category_scores_gemma":[0.0003487948,0.00005508768,0.0001917386,0.0002676714,0.00003963271,0.000175552,0.0008520046,0.000306343,0.00001155756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003136141,"about_ca_system_score_gemma":0.00008179367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009425167,"about_ca_topic_score_gemma":6.957032e-7,"domain_scores_codex":[0.9989526,0.00008395904,0.0003010666,0.0001115187,0.0003358761,0.0002150256],"domain_scores_gemma":[0.9983372,0.0001254771,0.0003339378,0.00104501,0.00007352098,0.00008484174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007834798,0.000415811,0.002934466,0.00001126508,0.0001656322,0.0002626215,0.001358873,0.003941916,0.02206772,0.00302043,0.8244876,0.1412553],"study_design_scores_gemma":[0.001638353,0.0009090273,0.0108988,0.0002461375,0.00004333776,0.005443011,0.00003791764,0.1309549,0.005583571,0.1344619,0.7091994,0.0005837017],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9143634,0.0009576707,0.04108993,0.03970694,0.003533971,0.00004597041,0.00000111891,0.00002901166,0.0002719854],"genre_scores_gemma":[0.9795787,0.00005255003,0.01736242,0.001683502,0.0007040213,2.515849e-7,6.127608e-8,0.000009956258,0.0006085008],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1406716,"threshold_uncertainty_score":0.8142779,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109693504","doi":"10.1145/1667053.1667060","title":"A constructive proof of the general lovász local lemma","year":2010,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":468,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Stavros Niarchos Foundation; Hungarian Scientific Research Fund","keywords":"Lemma (botany); Constructive; Constructive proof; Computer science; Mathematics; Discrete mathematics; Calculus (dental); Programming language; Process (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.01698177873404861,"gpt":0.296070846226851,"spread":0.2790890674928024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007379696,0.0000756113,0.0001496655,0.00006312849,0.0001064291,0.00003306119,0.006384731,0.00004308674,0.00001436049],"category_scores_gemma":[0.001024504,0.00003542579,0.0001967964,0.0003771666,0.0005789885,0.0002847195,0.001796117,0.0007293674,0.000001928644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000257609,"about_ca_system_score_gemma":0.0002248354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000032506,"about_ca_topic_score_gemma":0.00000944618,"domain_scores_codex":[0.9987387,0.0001793309,0.0002680693,0.00009749457,0.0005348636,0.0001815413],"domain_scores_gemma":[0.9975111,0.0001774731,0.0003982262,0.001525698,0.0003240962,0.00006334382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000293342,0.0003192146,0.02063441,0.00004137553,0.000298094,0.00005324373,0.002593189,0.003528089,0.2991849,0.5160586,0.007069159,0.1499263],"study_design_scores_gemma":[0.0005859098,0.0001388748,0.01040466,0.00004429315,0.00001231288,0.001029598,0.00007138727,0.0025627,0.2600961,0.7228092,0.002152825,0.00009216287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.914277,0.00006850725,0.07502752,0.007964049,0.001921086,0.0001697325,0.000002281038,0.000005571444,0.0005642129],"genre_scores_gemma":[0.9675344,0.000001588011,0.03194263,0.0001332374,0.000168122,8.784744e-7,9.789734e-9,0.000005308511,0.0002138723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2067505,"threshold_uncertainty_score":0.9989912,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997649256","doi":"10.1145/1120582.1120584","title":"A dichotomy theorem for constraint satisfaction problems on a 3-element set","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":372,"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":"Constraint satisfaction problem; Constraint satisfaction; Constraint (computer-aided design); Element (criminal law); Set (abstract data type); Mathematics; Domain (mathematical analysis); Class (philosophy); Local consistency; Time complexity; Constraint satisfaction dual problem; Maximal element; Mathematical optimization; Algebraic number; Computer science; Discrete mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01866132233556832,"gpt":0.2543906495361,"spread":0.2357293272005317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003966211,0.00008033848,0.0001071797,0.00008159974,0.0001215855,0.0001009391,0.0006418477,0.00003178303,0.00002825206],"category_scores_gemma":[0.0001891767,0.00005011807,0.0001366726,0.0001351254,0.00003812191,0.000205437,0.00009313627,0.000125063,0.000003244114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009307962,"about_ca_system_score_gemma":0.00008531069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001152943,"about_ca_topic_score_gemma":0.00002906097,"domain_scores_codex":[0.9991379,0.0000577072,0.0003254209,0.00009776814,0.0002606063,0.0001206381],"domain_scores_gemma":[0.9988315,0.0001352741,0.0004109472,0.0004457699,0.0001418692,0.00003467266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001771517,0.0002859746,0.03334785,0.00006902106,0.0002137973,0.00001217452,0.001441065,0.1053694,0.009592135,0.4312829,0.0646893,0.3535193],"study_design_scores_gemma":[0.006776102,0.001294439,0.2475231,0.0004883902,0.0001192238,0.001021694,0.0002990945,0.07274754,0.0137379,0.606491,0.04884579,0.0006556755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06502546,0.00002557919,0.9127021,0.01926705,0.001273212,0.0005689269,0.000009192897,0.00003617836,0.001092315],"genre_scores_gemma":[0.9575295,0.000007039313,0.04183053,0.0004010056,0.0001352887,0.00000765295,5.613283e-7,0.000004915047,0.00008344628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8925041,"threshold_uncertainty_score":0.2043756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041091076","doi":"10.1145/502102.502106","title":"Interval arithmetic","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":339,"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":"Interval arithmetic; Interval (graph theory); Arithmetic; Multiplication (music); Affine arithmetic; Division (mathematics); Subtraction; Arbitrary-precision arithmetic; Saturation arithmetic; Mathematics; Real number; Second-order arithmetic; Set (abstract data type); Floating point; Algorithm; Computer science; Discrete mathematics; Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01825708143144391,"gpt":0.2500798188606352,"spread":0.2318227374291913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001782736,0.00002833792,0.0000501896,0.00004292838,0.0000380855,0.0000543578,0.001200798,0.00001274351,0.0000457095],"category_scores_gemma":[0.0003320935,0.00001686089,0.00006969013,0.0001497998,0.00001447114,0.0002195442,0.0002358983,0.00009670974,0.000009786433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002141729,"about_ca_system_score_gemma":0.00003189189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001144802,"about_ca_topic_score_gemma":0.000002297674,"domain_scores_codex":[0.9996086,0.00003300158,0.0001388422,0.00003394118,0.0001346497,0.00005098732],"domain_scores_gemma":[0.9993505,0.00003394886,0.0001367453,0.0003837539,0.0000675328,0.00002747912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00003575323,0.0001397183,0.06005742,0.000007143003,0.00009831308,0.00009920492,0.001557257,0.007578402,0.002084366,0.0152634,0.03719135,0.8758877],"study_design_scores_gemma":[0.00232735,0.0003936696,0.6223949,0.0002301417,0.00006312824,0.01206054,0.0002193959,0.1039185,0.003392344,0.1281931,0.1263983,0.0004086067],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09331795,0.00006873457,0.8532039,0.04893294,0.002094164,0.00003966565,1.322286e-7,0.00001782739,0.002324671],"genre_scores_gemma":[0.9348432,0.00003104404,0.06388153,0.0007341535,0.00009774676,1.268162e-7,1.408955e-8,0.000001825106,0.0004103368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8754791,"threshold_uncertainty_score":0.2231401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976584101","doi":"10.1145/2432622.2432628","title":"Steiner Tree Approximation via Iterative Randomized Rounding","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":280,"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":"Office of Naval Research; European Research Council; Division of Computing and Communication Foundations; Alexander von Humboldt-Stiftung; Ministerstwo Edukacji i Nauki; Fundacja na rzecz Nauki Polskiej; École Polytechnique Fédérale de Lausanne","keywords":"Steiner tree problem; Rounding; Mathematics; Combinatorics; Linear programming relaxation; Approximation algorithm; Randomized rounding; Tree (set theory); Sequence (biology); k-minimum spanning tree; Relaxation (psychology); Discrete mathematics; Minimum spanning tree; Iterative method; Mathematical optimization; Tree structure; K-ary tree; Computer science; Linear programming; Binary tree","retraction":null,"screen_n_in":null,"score":{"opus":0.01898129140375479,"gpt":0.2430249264847187,"spread":0.2240436350809639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552676,0.00007714068,0.0002413067,0.00009078709,0.0001264342,0.0002647497,0.002272824,0.00002433229,0.00002674883],"category_scores_gemma":[0.0007493601,0.0000405387,0.0002449658,0.0002337111,0.00005706665,0.000978619,0.0005068376,0.0001904717,0.00001424801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000369657,"about_ca_system_score_gemma":0.00002541047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001121029,"about_ca_topic_score_gemma":0.000001442388,"domain_scores_codex":[0.9989119,0.0002526517,0.0003451133,0.00007721304,0.0003002092,0.0001128691],"domain_scores_gemma":[0.998292,0.0004261185,0.0004243063,0.0006329257,0.0001818218,0.00004278783],"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.003056344,0.0007519087,0.0009667171,0.00008483158,0.001140727,0.00003747071,0.02403723,0.001981576,0.03161206,0.2380371,0.04390084,0.6543933],"study_design_scores_gemma":[0.02075386,0.00006653215,0.001394195,0.00009009647,0.00002788249,0.0001840824,0.00005825272,0.1912337,0.002881408,0.7826443,0.0005344231,0.0001313323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0793126,0.0001603008,0.905296,0.01250324,0.001381807,0.0002699126,1.8943e-7,0.00001749785,0.001058417],"genre_scores_gemma":[0.7514967,0.00001062635,0.2472713,0.0004447531,0.0003059731,0.000007410525,1.002266e-7,0.000004994547,0.0004580977],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6721841,"threshold_uncertainty_score":0.422351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168550848","doi":"10.1145/363647.363659","title":"Adversarial queuing theory","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":274,"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":"Queueing theory; Probabilistic logic; Computer science; Adversarial system; Fair queuing; Network packet; Routing (electronic design automation); Mathematical optimization; Distributed computing; Computer network; Artificial intelligence; Quality of service; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0146418859724814,"gpt":0.2381502043533885,"spread":0.2235083183809072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309818,0.00009391169,0.0001726178,0.000149094,0.0001726703,0.0000899178,0.001512733,0.00003420404,0.0003289755],"category_scores_gemma":[0.003965608,0.00005736752,0.0002608275,0.0004139896,0.00005098402,0.0009463358,0.0005365693,0.0002298047,0.00007608703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003789384,"about_ca_system_score_gemma":0.00001525766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001041283,"about_ca_topic_score_gemma":0.000007036781,"domain_scores_codex":[0.999176,0.00004135603,0.0002963274,0.00007668137,0.0002563393,0.0001533181],"domain_scores_gemma":[0.9983898,0.0001504944,0.0006569306,0.0006326406,0.0001612216,0.000008925922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005000002,0.0006414268,0.07323597,0.0001631088,0.002550493,0.000646126,0.0008750372,0.08804347,0.02160425,0.6265472,0.07729512,0.1033978],"study_design_scores_gemma":[0.0006818887,0.000008431133,0.001695844,0.00009168023,0.0003582473,0.0000707505,0.0003912318,0.0005969699,0.0001692154,0.8531592,0.1426285,0.0001480135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9622473,0.0002841682,0.004608558,0.01146436,0.002601086,0.00009544369,3.30569e-7,0.00004642184,0.01865229],"genre_scores_gemma":[0.9927213,0.00001265965,0.0005650842,0.002196123,0.003661222,4.11713e-7,2.103773e-7,0.00001623685,0.0008267566],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2266121,"threshold_uncertainty_score":0.4747489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047386086","doi":"10.1145/506147.506150","title":"On the closest string and substring problems","year":2002,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":237,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Substring; Hamming distance; Combinatorics; String (physics); Approximate string matching; Mathematics; String searching algorithm; String metric; Edit distance; Discrete mathematics; Set (abstract data type); Computer science; Algorithm; Pattern matching; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03950130813966558,"gpt":0.2181354447543569,"spread":0.1786341366146914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003362756,0.00004801954,0.00006303655,0.00002447455,0.0001568055,0.0001315655,0.002029828,0.00001498877,0.00001013617],"category_scores_gemma":[0.0002874046,0.00002025819,0.00003801023,0.0001008479,0.00001782529,0.0002583225,0.0008172501,0.0002026585,0.000004395015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001385439,"about_ca_system_score_gemma":0.000006827659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003278549,"about_ca_topic_score_gemma":5.497822e-7,"domain_scores_codex":[0.9994441,0.00003951869,0.0001356554,0.00006282618,0.0002165239,0.0001013997],"domain_scores_gemma":[0.9988925,0.0001835498,0.0001652877,0.0006920411,0.00002903083,0.00003758422],"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.00003772558,0.0005459099,0.01367378,0.00006278468,0.000201363,0.0001420923,0.006269922,0.006943602,0.01118348,0.1155013,0.2071373,0.6383007],"study_design_scores_gemma":[0.003642634,0.0012968,0.1415029,0.002753377,0.00008861007,0.002851995,0.0003020833,0.3028559,0.02184817,0.4132554,0.1086545,0.0009475606],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9546607,0.00121018,0.01802999,0.02440606,0.0008676545,0.0001137391,9.613982e-7,0.00001600886,0.0006947476],"genre_scores_gemma":[0.9947934,0.00009733003,0.004653426,0.0002485104,0.0001123749,3.400501e-7,1.244884e-8,0.000002685344,0.00009197501],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6373531,"threshold_uncertainty_score":0.3771958,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031722321","doi":"10.1145/1346330.1346335","title":"Optimal probabilistic fingerprint codes","year":2008,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":217,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Traitor tracing; Alphabet; Upper and lower bounds; Binary number; Code (set theory); Computer science; Fingerprint (computing); Probabilistic logic; Combinatorics; Discrete mathematics; Constant (computer programming); Binary code; Mathematics; Algorithm; Arithmetic; Statistics; Encryption; Public-key cryptography; Set (abstract data type); Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02532286824823652,"gpt":0.2555608767257372,"spread":0.2302380084775007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002549299,0.00006360778,0.0001125588,0.00005531173,0.0001433468,0.00002796896,0.003171228,0.00002456343,0.000001383398],"category_scores_gemma":[0.0003505884,0.0000358047,0.000141931,0.0001705722,0.00007771234,0.0002599813,0.0007244734,0.000189148,0.000001170615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002158606,"about_ca_system_score_gemma":0.00004837617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.379046e-7,"about_ca_topic_score_gemma":1.997127e-7,"domain_scores_codex":[0.9993461,0.00005105613,0.0002083818,0.00007333243,0.0002052879,0.0001158154],"domain_scores_gemma":[0.9987279,0.00007753237,0.000224427,0.0008404697,0.00009294006,0.00003669307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001078838,0.003064215,0.1814867,0.0003887612,0.001135494,0.003602019,0.04010209,0.1045475,0.08494537,0.2073472,0.1978664,0.1744354],"study_design_scores_gemma":[0.0009719165,0.001035224,0.08104868,0.0005029615,0.00004747592,0.009602202,0.00003600309,0.006263356,0.1123739,0.7565939,0.03087692,0.0006475067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6200101,0.0001756244,0.3750083,0.003844125,0.0004907324,0.00008412937,4.547067e-7,0.00006728411,0.0003192944],"genre_scores_gemma":[0.6983874,0.00003174442,0.3013689,0.0001176038,0.00005233731,7.83334e-7,1.276835e-8,0.000002424936,0.00003871889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5492467,"threshold_uncertainty_score":0.5892984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951747536","doi":"10.1145/3321386","title":"Hierarchical Clustering","year":2019,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":207,"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":"Engineering and Physical Sciences Research Council; Alan Turing Institute; National Science Foundation","keywords":"Cluster analysis; Hierarchical clustering; Granularity; Constrained clustering; Computer science; Correlation clustering; Data mining; Similarity (geometry); Hierarchy; Fuzzy clustering; Set (abstract data type); Function (biology); Canopy clustering algorithm; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02099676116478523,"gpt":0.2989714861892535,"spread":0.2779747250244682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004515873,0.0000569661,0.0001164736,0.00006657489,0.0000518067,0.00007850627,0.005555212,0.00002559039,0.00001483971],"category_scores_gemma":[0.0005712245,0.00003355165,0.0001024155,0.0002163844,0.00002536377,0.0003552454,0.003345351,0.000412583,0.00005258473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006266297,"about_ca_system_score_gemma":0.00006907001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001144069,"about_ca_topic_score_gemma":4.525223e-7,"domain_scores_codex":[0.9989683,0.00007333234,0.0002020441,0.00009282117,0.0004773493,0.0001861742],"domain_scores_gemma":[0.9981945,0.0001612248,0.0001421991,0.00134037,0.00009110627,0.00007063348],"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.0002605464,0.0003397878,0.01395366,0.0001956662,0.0002985558,0.0003990525,0.004266337,0.1048614,0.114969,0.008268516,0.01228789,0.7398996],"study_design_scores_gemma":[0.004037344,0.001283341,0.06833528,0.000659005,0.000019512,0.006002082,0.0001490699,0.6501594,0.02214833,0.1732931,0.07318375,0.0007297871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3427949,0.0001725143,0.625608,0.02657444,0.003073317,0.0001580271,4.281071e-7,0.00003359558,0.001584792],"genre_scores_gemma":[0.6952841,0.00001602953,0.3021037,0.0004175355,0.0002760451,6.433836e-7,1.722687e-8,0.00001071909,0.001891257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7391698,"threshold_uncertainty_score":0.9998252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007542733","doi":"10.1145/1219092.1219096","title":"The measurement calculus","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":192,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Mitacs","keywords":"Quantum computer; Computer science; Theoretical computer science; Computation; Semantics (computer science); Operational semantics; Quantum information; Model of computation; Algebra over a field; Quantum; Algorithm; Programming language; Mathematics; Pure mathematics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01968446733025174,"gpt":0.249581231570689,"spread":0.2298967642404373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00302167,0.00005717308,0.00007251406,0.00002667676,0.0003023807,0.0001038945,0.004238372,0.00001743243,5.945083e-7],"category_scores_gemma":[0.0006985483,0.0000230601,0.0001321448,0.0001844629,0.00003299336,0.0000543597,0.000766014,0.0002703617,0.000003311796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005276697,"about_ca_system_score_gemma":0.00007793046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003246114,"about_ca_topic_score_gemma":0.000007063391,"domain_scores_codex":[0.9988351,0.0000480816,0.0002399195,0.00006066403,0.0006331906,0.0001829981],"domain_scores_gemma":[0.9984528,0.000165341,0.0002424148,0.0009069949,0.0001767129,0.00005573079],"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.00003957563,0.00008287586,0.0003670432,0.000006181005,0.0001178154,0.00008019151,0.001971436,0.005982604,0.003541233,0.01019066,0.03559256,0.9420278],"study_design_scores_gemma":[0.001482068,0.0005820536,0.07918245,0.000325368,0.00005291409,0.002354856,0.0001970265,0.154091,0.02922119,0.2255019,0.5065433,0.0004657781],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3006108,0.002735866,0.5939498,0.09259576,0.008531728,0.0001497825,2.417113e-7,0.00004473302,0.00138133],"genre_scores_gemma":[0.9702111,0.00001437288,0.02838315,0.000725312,0.0005904661,1.243542e-7,3.437465e-9,0.000004621025,0.00007086137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9415621,"threshold_uncertainty_score":0.7876019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029698681","doi":"10.1145/2395116.2395117","title":"The effectiveness of lloyd-type methods for the k-means problem","year":2012,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":185,"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; Office of Naval Research; Israel Science Foundation; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Computer science; Cluster analysis; Heuristic; Probabilistic logic; Popularity; Process (computing); Algorithm; Type (biology); Quality (philosophy); Data mining; Artificial intelligence; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05066538846456285,"gpt":0.4219683914484055,"spread":0.3713030029838426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01005281,0.00007751206,0.0001559341,0.00003287038,0.0002896452,0.0000621501,0.005372208,0.00002942334,9.354039e-7],"category_scores_gemma":[0.004780509,0.00002969299,0.0001665504,0.0003454996,0.0001063325,0.0003077902,0.001410516,0.0002876012,0.00000135541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006615232,"about_ca_system_score_gemma":0.00009080346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000380759,"about_ca_topic_score_gemma":5.937566e-7,"domain_scores_codex":[0.9981109,0.0009366471,0.0002548131,0.0000731047,0.0003402152,0.0002843055],"domain_scores_gemma":[0.9890963,0.008793597,0.000314201,0.001341194,0.0003982954,0.00005644837],"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.0007003573,0.0002141064,0.001818817,0.0002252989,0.000619537,0.000001850024,0.002217463,0.01607211,0.06833603,0.01749843,0.001632194,0.8906638],"study_design_scores_gemma":[0.002739088,0.001598482,0.06103181,0.0006116288,0.0001923686,0.000806862,0.0004184754,0.1139773,0.2942013,0.3731492,0.1508024,0.0004710596],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002811858,0.001630431,0.9904679,0.003328712,0.00133549,0.0003329964,4.655925e-7,0.00000654514,0.0000856203],"genre_scores_gemma":[0.1206992,0.0001136707,0.8784853,0.00005848765,0.0003220989,0.00001652715,2.715249e-8,0.00001548812,0.0002891894],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8901927,"threshold_uncertainty_score":0.9982988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020154454","doi":"10.1145/2556646","title":"Constraint Satisfaction Problems Solvable by Local Consistency Methods","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":175,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Narodowe Centrum Nauki; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Constraint satisfaction problem; Local consistency; Consistency (knowledge bases); Constraint (computer-aided design); Constraint satisfaction; Mathematics; Computer science; Weak consistency; Mathematical optimization; Discrete mathematics; Strong consistency; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02909574141401513,"gpt":0.3354879927491539,"spread":0.3063922513351388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002899557,0.00008871441,0.0001871807,0.00007554572,0.0001618432,0.00008275684,0.002383632,0.00004590506,0.00001836458],"category_scores_gemma":[0.001804277,0.00005428022,0.0001360377,0.0002693177,0.0002588175,0.000405776,0.0006297352,0.0004115921,0.000009061589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006822354,"about_ca_system_score_gemma":0.0001020365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009181124,"about_ca_topic_score_gemma":0.000003742154,"domain_scores_codex":[0.9982439,0.0006671699,0.0003404641,0.0001303466,0.0003884054,0.000229661],"domain_scores_gemma":[0.9976086,0.0006325775,0.0003522061,0.001083072,0.0002170891,0.0001064484],"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.00003249483,0.00007454421,0.002178103,0.0000321543,0.00009928394,0.00000553669,0.0004242265,0.002415258,0.09695037,0.1081002,0.01249709,0.7771908],"study_design_scores_gemma":[0.0006102888,0.0002984196,0.001592347,0.00007697538,0.00001494113,0.0005760389,0.00008436924,0.01050576,0.03203215,0.9358866,0.01817492,0.0001471472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005438399,0.0002531302,0.9880055,0.004762745,0.000528846,0.0000883239,6.560674e-7,0.00001545575,0.0009069603],"genre_scores_gemma":[0.591504,0.00002501192,0.4078784,0.0003214006,0.00005709752,0.00000199586,5.287373e-8,0.000007551525,0.0002045078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8277865,"threshold_uncertainty_score":0.4429421,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988662949","doi":"10.1145/567112.567117","title":"On XML integrity constraints in the presence of DTDs","year":2002,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":175,"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":"Unary operation; Undecidable problem; Computer science; Data integrity; Consistency (knowledge bases); Theoretical computer science; XML validation; XML; Negation; Programming language; Decidability; Discrete mathematics; Mathematics; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.08962250952427965,"gpt":0.3285199342965478,"spread":0.2388974247722682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001944597,0.00004475884,0.00009103249,0.00005368803,0.00003208024,0.00002818542,0.004596884,0.00002985252,0.00001759851],"category_scores_gemma":[0.005101413,0.0000215072,0.00006532824,0.0002737001,0.0001209845,0.0002321239,0.0002467249,0.0004226002,0.000005186038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002596719,"about_ca_system_score_gemma":0.00002130063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003563799,"about_ca_topic_score_gemma":9.309171e-7,"domain_scores_codex":[0.9988618,0.0003751857,0.000272679,0.00005667276,0.0003511818,0.0000824231],"domain_scores_gemma":[0.9980668,0.0004692958,0.0003394675,0.001028378,0.00007883684,0.00001726326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008281986,0.0009917468,0.008569544,0.00005538754,0.0000576274,0.0000432181,0.0224118,0.001562212,0.009045254,0.5677987,0.03303506,0.3563466],"study_design_scores_gemma":[0.001678417,0.001351753,0.2693858,0.0008942097,0.00003184122,0.001359199,0.0009726658,0.1067434,0.05432896,0.5590951,0.003805481,0.000353253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8698221,0.0001964267,0.09969229,0.02065505,0.001766223,0.0002236525,0.000001575851,0.000009255079,0.00763342],"genre_scores_gemma":[0.8750719,0.00001566047,0.1245793,0.0002756118,0.00002990922,5.255905e-7,5.192045e-9,0.000001229455,0.0000257694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3559933,"threshold_uncertainty_score":0.8542232,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2889833303","doi":"10.1145/3375890","title":"Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space","year":2020,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Log-log plot; Binary logarithm; Bounded function; Search engine indexing; Space (punctuation); Suffix; Generalized suffix tree; Suffix tree; Suffix array","retraction":null,"screen_n_in":null,"score":{"opus":0.03092524817749018,"gpt":0.2482270717439886,"spread":0.2173018235664985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003352743,0.00006840314,0.0001206129,0.00005145335,0.000112869,0.0001869384,0.001448972,0.00002463515,0.00001551422],"category_scores_gemma":[0.0003793036,0.00004151743,0.00005540095,0.0001902182,0.0000330958,0.0005749016,0.001503634,0.0003283125,0.000004300919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002403236,"about_ca_system_score_gemma":0.0001005734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001382551,"about_ca_topic_score_gemma":0.000007608332,"domain_scores_codex":[0.9991494,0.00007854384,0.0001878418,0.0001192853,0.0003348818,0.0001299995],"domain_scores_gemma":[0.9992245,0.0001200368,0.0001422663,0.0003651491,0.00004654033,0.0001015244],"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.001772325,0.001049986,0.07432687,0.0001674819,0.0004279666,0.001083841,0.03031226,0.07202894,0.09296934,0.04230991,0.3025075,0.3810436],"study_design_scores_gemma":[0.003600553,0.0009568328,0.4265045,0.0003727038,0.00003144878,0.001123849,0.0006977285,0.4658649,0.002579557,0.02350995,0.07426888,0.0004890301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7479863,0.0005918774,0.1798989,0.07066189,0.0005517759,0.00007911785,0.000003507935,0.00001656529,0.0002100796],"genre_scores_gemma":[0.8901476,0.00005024052,0.1084575,0.0008205351,0.0004229158,4.676845e-7,3.855305e-7,0.00000627086,0.00009403843],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.393836,"threshold_uncertainty_score":0.2692575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050570613","doi":"10.1145/337244.337257","title":"Learning functions represented as multiplicity automata","year":2000,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Learnability; Mathematics; Discrete mathematics; Multiplicity (mathematics); Disjoint sets; Combinatorics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.008940393291089208,"gpt":0.2585674569749757,"spread":0.2496270636838865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004654249,0.00006569723,0.0001065669,0.00004867202,0.0002383133,0.00007788704,0.002446723,0.00002784036,0.0001909408],"category_scores_gemma":[0.001256596,0.00004001059,0.0001401174,0.0002656621,0.00002189161,0.0002365719,0.0004523717,0.0005487103,0.0001136924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001951309,"about_ca_system_score_gemma":0.00004153665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007064925,"about_ca_topic_score_gemma":9.83056e-7,"domain_scores_codex":[0.9990674,0.0001822338,0.0002166753,0.0001047562,0.0003005928,0.0001282889],"domain_scores_gemma":[0.998597,0.0001061797,0.0002047172,0.0009616336,0.00006710487,0.00006332965],"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.00008236767,0.0003835558,0.03521807,0.00001168812,0.0001891226,0.0001428375,0.004339571,0.06140152,0.00155353,0.0003535369,0.03706713,0.859257],"study_design_scores_gemma":[0.001721352,0.0006832404,0.2088873,0.0001586704,0.00005264183,0.002650516,0.0002164571,0.6010357,0.001366757,0.009028387,0.1738675,0.0003315138],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9512632,0.00008056659,0.01844213,0.01749693,0.00104837,0.00006746977,4.336417e-7,0.0001446274,0.01145624],"genre_scores_gemma":[0.9471633,0.00002231478,0.03342057,0.0003487337,0.0003169806,7.025063e-7,1.490163e-7,0.00000814426,0.01871913],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8589256,"threshold_uncertainty_score":0.454666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621304102","doi":"10.1145/2049697.2049699","title":"Truthful and Near-Optimal Mechanism Design via Linear Programming","year":2011,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":122,"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":"Knapsack problem; Combinatorial auction; Approximation algorithm; Mathematical optimization; Relaxation (psychology); Mathematics; Maximization; Common value auction; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1952216190230927,"gpt":0.3618107105756824,"spread":0.1665890915525898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002813811,0.0000604043,0.0001261503,0.00005146918,0.000264403,0.00008217016,0.001404099,0.00003885234,0.000201875],"category_scores_gemma":[0.002326732,0.00003122502,0.00009997094,0.0002484757,0.0001113291,0.0002196111,0.0002648044,0.0001687364,0.00005398213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008567989,"about_ca_system_score_gemma":0.00003934191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001643811,"about_ca_topic_score_gemma":3.026604e-7,"domain_scores_codex":[0.9988415,0.0001838683,0.0003822647,0.00009878792,0.0003939369,0.0000996275],"domain_scores_gemma":[0.9982791,0.0003717665,0.0004766809,0.0006098733,0.000183148,0.00007943108],"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.001274402,0.0008491106,0.003558846,0.00001085808,0.0003102595,0.00005323194,0.02570526,0.001880984,0.02843556,0.1032428,0.01748443,0.8171942],"study_design_scores_gemma":[0.0002784527,0.000198505,0.001714404,0.00001190099,0.00004010226,0.0004802919,0.0009571498,0.001683728,0.02036363,0.9608679,0.01331797,0.00008595129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3678156,0.0000713177,0.6288337,0.002449851,0.0004137127,0.0001536981,8.824645e-7,0.0000110109,0.0002502749],"genre_scores_gemma":[0.7836381,0.000004453667,0.2156325,0.0001202779,0.0001147153,0.000002061302,1.672618e-8,0.000005033699,0.0004828157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8576251,"threshold_uncertainty_score":0.2785484,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028769163","doi":"10.1145/1044731.1044733","title":"Determining approximate shortest paths on weighted polyhedral surfaces","year":2005,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":115,"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":"Discretization; Combinatorics; Face (sociological concept); Mathematics; Shortest path problem; Surface (topology); Euclidean geometry; Polyhedron; Computational geometry; Discrete mathematics; Algorithm; Geometry; Graph; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02130323145929961,"gpt":0.2520038338114481,"spread":0.2307006023521485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004439159,0.00009198208,0.0001270387,0.00007778984,0.0001047051,0.0002321623,0.004236207,0.00002063312,0.00001079294],"category_scores_gemma":[0.0001162318,0.00005285782,0.00009481102,0.0001844286,0.0000217672,0.0008828015,0.001047022,0.0001703974,0.00002409198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002704311,"about_ca_system_score_gemma":0.00002218592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001059641,"about_ca_topic_score_gemma":0.000001464663,"domain_scores_codex":[0.9990523,0.00004560131,0.0002573789,0.0001120772,0.0003534268,0.0001792294],"domain_scores_gemma":[0.9986002,0.00006623324,0.0002741267,0.0009678056,0.00003860577,0.00005306943],"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.00003468089,0.000399767,0.01094942,0.00001715825,0.0001671662,0.0001760756,0.001164781,0.001487994,0.002850664,0.006540814,0.04739069,0.9288208],"study_design_scores_gemma":[0.002884259,0.001106672,0.09487472,0.0005770454,0.0001377226,0.0006029592,0.0002157908,0.7346602,0.02731827,0.02594073,0.1106665,0.001015081],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9505292,0.000191753,0.01864709,0.02603155,0.001947276,0.0001368691,0.000004280348,0.00006228362,0.002449702],"genre_scores_gemma":[0.8871483,0.00002930897,0.1110038,0.0008633644,0.0004185106,5.500274e-7,3.295994e-7,0.000007507972,0.0005282615],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9278057,"threshold_uncertainty_score":0.7871997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057974767","doi":"10.1145/1217856.1217860","title":"An approximation scheme for stochastic linear programming and its application to stochastic integer programs","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":112,"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":"Rounding; Vertex cover; Stochastic programming; Mathematical optimization; Mathematics; Linear programming; Generalization; Stochastic optimization; Integer (computer science); Integer programming; Approximation algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05453927735925886,"gpt":0.3689163897992989,"spread":0.3143771124400401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00178838,0.00009399635,0.0001746074,0.0001710397,0.0001522394,0.0001939151,0.0009258733,0.00005452027,0.00000235486],"category_scores_gemma":[0.002498802,0.00005476676,0.00008148338,0.0004937775,0.00002570611,0.0004120948,0.0001026485,0.0001061431,0.000006590511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002947957,"about_ca_system_score_gemma":0.0000476184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005147539,"about_ca_topic_score_gemma":0.000008154629,"domain_scores_codex":[0.998414,0.00005649333,0.0006019808,0.0001721293,0.0006073469,0.0001480835],"domain_scores_gemma":[0.9977586,0.0002018182,0.0006536659,0.0005053916,0.0007906631,0.00008987386],"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.0003649423,0.0004203784,0.00222155,0.00001505164,0.00002856053,6.400736e-7,0.001249176,0.5182161,0.006937371,0.002909624,0.001534485,0.4661022],"study_design_scores_gemma":[0.0008356272,0.0006587118,0.003471184,0.00007747301,0.00007091823,0.00008013507,0.0005200703,0.9340138,0.0007965639,0.05490441,0.004353638,0.0002174441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2588269,0.00007144934,0.7389039,0.001317996,0.0001476433,0.0007132705,0.000001739541,0.000009542479,0.000007566213],"genre_scores_gemma":[0.9134849,0.00000153261,0.08594635,0.00005097684,0.0003567291,0.00004159463,0.000003446658,0.00001090184,0.0001035879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.654658,"threshold_uncertainty_score":0.2991481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086886584","doi":"10.1145/1538902.1538906","title":"Empirical hardness models","year":2009,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":110,"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; Defense Advanced Research Projects Agency","keywords":"Computer science; Benchmark (surveying); Suite; Machine learning; Artificial intelligence; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.3077122164162031,"gpt":0.4750898193824556,"spread":0.1673776029662526,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001732031,0.00004049045,0.000113931,0.00005815766,0.0001434459,0.00007237842,0.00262845,0.00002781703,0.0001461683],"category_scores_gemma":[0.003185012,0.00001872595,0.0001700391,0.0003628061,0.00004284795,0.0002809915,0.00013151,0.0001573383,0.0000823895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001491158,"about_ca_system_score_gemma":0.0000450197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.410004e-7,"about_ca_topic_score_gemma":1.493378e-7,"domain_scores_codex":[0.9987323,0.000124515,0.0003887288,0.00006996024,0.0006145517,0.00006988814],"domain_scores_gemma":[0.9981325,0.0002793295,0.0003708779,0.0009244867,0.0002333636,0.00005938628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001103585,0.0002361439,0.001820894,4.605019e-7,0.00002150501,0.000005407746,0.00120723,0.01199587,0.00227633,0.04650131,0.8667916,0.06903291],"study_design_scores_gemma":[0.00009082379,0.00002431859,0.009039691,0.000003784684,0.00000646538,0.00009063736,0.0001538604,0.0003371691,0.0006749321,0.9453319,0.04422068,0.00002576515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7212672,0.0001421085,0.05701592,0.2112637,0.00115569,0.00008151428,0.000002715269,0.00001143254,0.009059698],"genre_scores_gemma":[0.9928832,0.000004318189,0.001620461,0.001953656,0.0002203798,2.599125e-7,1.833965e-8,0.00000161119,0.003316069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8988306,"threshold_uncertainty_score":0.4884358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765269579","doi":"10.1145/3125644","title":"Communication Steps for Parallel Query Processing","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Alberta Innovates - Technology Futures; Wisconsin Alumni Research Foundation; National Science Foundation","keywords":"Computer science; Skew; Joins; Upper and lower bounds; Parallel computing; Matching (statistics); Binary logarithm; Communication complexity; Simple (philosophy); Graph; Algorithm; Theoretical computer science; Combinatorics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03760960977898024,"gpt":0.3058304111590551,"spread":0.2682208013800749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007938588,0.0000396688,0.00007815321,0.00002201037,0.0006218582,0.000265976,0.006975184,0.00001969772,6.353931e-7],"category_scores_gemma":[0.0006177463,0.0000231854,0.00009813718,0.00002832853,0.00005196342,0.0006864865,0.0007119059,0.0001164908,9.931789e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009407018,"about_ca_system_score_gemma":0.00004243071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001079619,"about_ca_topic_score_gemma":0.000001072978,"domain_scores_codex":[0.9995686,0.00005143645,0.0001486013,0.00004451535,0.0001102981,0.00007658151],"domain_scores_gemma":[0.9975039,0.00008132352,0.0005688457,0.001699593,0.0001209433,0.0000254302],"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.000192721,0.0004294167,0.007045619,0.0001263917,0.0001827221,0.00001351335,0.006832731,0.001071745,0.005712233,0.2213235,0.02037051,0.7366989],"study_design_scores_gemma":[0.0006117736,0.00006597264,0.01820145,0.0001762754,0.00001649484,0.00009024875,0.00006617589,0.008426005,0.00182635,0.9653071,0.005127762,0.00008443273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1180173,0.001353339,0.8148931,0.06307626,0.001345788,0.0002376535,0.000001310479,0.00001927539,0.00105597],"genre_scores_gemma":[0.8377529,0.00001994161,0.161764,0.0002040291,0.00008343023,0.000001486471,3.533226e-8,0.000002751656,0.0001714866],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7439836,"threshold_uncertainty_score":0.9983975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001271834","doi":"10.1145/1989727.1989732","title":"Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier","year":2011,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":101,"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":"Air Force Office of Scientific Research; National Science Foundation","keywords":"Adversary; Computer science; Scalability; Latency (audio); Adversary model; Cryptography; Theoretical computer science; Parallel computing; Algorithm; Discrete mathematics; Mathematics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02488932264454965,"gpt":0.2243628494667722,"spread":0.1994735268222225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009443681,0.0001130056,0.0001822317,0.00003286855,0.0002271856,0.0001506143,0.006892935,0.0000470771,0.00002231342],"category_scores_gemma":[0.0003099967,0.00005182539,0.0002405823,0.000326077,0.00006080337,0.0004627911,0.0008889864,0.0003330056,0.00003072026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002725296,"about_ca_system_score_gemma":0.00008638518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002853973,"about_ca_topic_score_gemma":0.000002279056,"domain_scores_codex":[0.9986627,0.0001399517,0.0004122699,0.0001209035,0.0004351872,0.0002290031],"domain_scores_gemma":[0.9974392,0.00009439413,0.0004518981,0.001759785,0.0001712812,0.00008341295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001580409,0.0005399784,0.02582495,0.00008392108,0.0007138806,0.0004086215,0.04034558,0.00485592,0.004766014,0.06362005,0.758585,0.1000981],"study_design_scores_gemma":[0.001704709,0.0002864051,0.01870391,0.0005951216,0.0001089141,0.004242992,0.0008509836,0.01761642,0.008481612,0.0471057,0.8996963,0.000606937],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5970131,0.006028553,0.2653813,0.05884486,0.01068825,0.001007634,0.0000534536,0.0002148326,0.06076802],"genre_scores_gemma":[0.9928918,0.00001569528,0.00436479,0.001946892,0.0003381511,0.000001696038,5.57579e-8,0.000008108875,0.0004327438],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3958787,"threshold_uncertainty_score":0.9984803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076172709","doi":"10.1145/765568.765571","title":"The height of a random binary search tree","year":2003,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":100,"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":"Binary search tree; Combinatorics; Binary number; Random binary tree; Mathematics; Binary tree; Tree (set theory); Self-balancing binary search tree; Optimal binary search tree; Discrete mathematics; K-ary tree; Arithmetic; Tree structure","retraction":null,"screen_n_in":null,"score":{"opus":0.02206708586160027,"gpt":0.2553730957915877,"spread":0.2333060099299874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001478314,0.00004746895,0.0001008195,0.00004450654,0.0001241491,0.00009874679,0.004501902,0.00001164279,0.00000712571],"category_scores_gemma":[0.0004264396,0.0000203547,0.0001194968,0.0002579943,0.00004724506,0.0003242248,0.0008085978,0.000135176,0.000006126872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001104224,"about_ca_system_score_gemma":0.00004523672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001720146,"about_ca_topic_score_gemma":0.000001116862,"domain_scores_codex":[0.9990746,0.0001683022,0.0002154212,0.00005652305,0.0003646413,0.000120477],"domain_scores_gemma":[0.9984182,0.0002177744,0.0001828403,0.001079906,0.00007186519,0.00002940086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003445711,0.000575363,0.004336374,0.00005822267,0.0007046391,0.0001873757,0.002089868,0.0006688822,0.005586187,0.13886,0.4725634,0.3740251],"study_design_scores_gemma":[0.01123443,0.001006423,0.03005316,0.0002885969,0.0001470185,0.0004886622,0.0006552438,0.01818152,0.03175936,0.1864914,0.7192405,0.0004536259],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5000078,0.0114885,0.2049857,0.2108533,0.01335265,0.001242321,0.00001023626,0.00006983639,0.05798969],"genre_scores_gemma":[0.9264168,0.000895759,0.06336858,0.0006312403,0.0003536248,0.000002075007,2.137212e-7,0.0000141077,0.00831763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.426409,"threshold_uncertainty_score":0.836573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158763191","doi":"10.1145/1059513.1059519","title":"An information-theoretic approach to normal forms for relational and XML data","year":2005,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":100,"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":"Computer science; Relational database; Normalization (sociology); XML; Relational model; Database normalization; Information retrieval; Data mining; Measure (data warehouse); Theoretical computer science; Set (abstract data type); Programming language; Artificial intelligence; Cluster analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0304874038357801,"gpt":0.2772800273680918,"spread":0.2467926235323117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005795221,0.00004860729,0.00007745829,0.00004560251,0.0001191036,0.00005777362,0.001626816,0.0000169955,0.000001216785],"category_scores_gemma":[0.0004242747,0.00002743142,0.00002284262,0.00008039321,0.00002159361,0.005095755,0.000725029,0.00007107257,0.000002422553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001546833,"about_ca_system_score_gemma":0.0000520093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.744011e-7,"about_ca_topic_score_gemma":0.000001687261,"domain_scores_codex":[0.9994003,0.00001605081,0.0002517604,0.0000632058,0.0001810676,0.00008764749],"domain_scores_gemma":[0.9985266,0.00005979834,0.0001997902,0.001058831,0.00009106402,0.00006394755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004652206,0.00004186936,0.0004332519,0.00002850688,0.00002066758,2.287398e-7,0.001755253,0.00666752,0.00009495239,0.9414344,0.0110544,0.03842248],"study_design_scores_gemma":[0.00102357,0.000241655,0.006798297,0.00006467461,0.0000198451,0.0006249865,0.00035596,0.1768706,0.0003766293,0.02875652,0.7846454,0.0002218271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01029592,0.00003979861,0.9856798,0.003370895,0.0001295734,0.0001122745,0.00004010795,0.000005670766,0.0003259453],"genre_scores_gemma":[0.1334751,0.000004381615,0.8657036,0.0005710383,0.0001986022,0.000002350695,0.00001043678,0.000002450359,0.00003198127],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9126778,"threshold_uncertainty_score":0.3694299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022427910","doi":"10.1145/1183907.1183913","title":"Online algorithms for market clearing","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":82,"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":"Competitive analysis; Online algorithm; Market clearing; Clearing; Profit (economics); Incentive compatibility; Computer science; Matching (statistics); Economics; Algorithm; Microeconomics; Subsidy; Incentive; Mathematics; Finance; Upper and lower bounds","retraction":null,"screen_n_in":null,"score":{"opus":0.127354509570399,"gpt":0.4123971984519681,"spread":0.2850426888815692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001931574,0.00003806167,0.00009781421,0.00005651857,0.000163221,0.00006245948,0.001668014,0.00002271853,0.0001904581],"category_scores_gemma":[0.003400732,0.00001947642,0.0001728376,0.0002218734,0.00004033696,0.0001275866,0.0001713086,0.00009934793,0.00001507955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001516175,"about_ca_system_score_gemma":0.00002500929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000020195,"about_ca_topic_score_gemma":0.000003364225,"domain_scores_codex":[0.9990368,0.00006192074,0.0004041058,0.00006684647,0.000357523,0.00007281128],"domain_scores_gemma":[0.9978839,0.0008066581,0.0004541665,0.0005993735,0.0002294926,0.00002642229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009110543,0.0002607872,0.0026864,0.00000199564,0.00002514379,0.00000136998,0.00008623562,0.001941692,0.002116358,0.01211617,0.8834758,0.09719695],"study_design_scores_gemma":[0.0001860348,0.0000206168,0.02230535,0.000006064442,0.00001041111,0.00005175503,0.000190081,0.0007063443,0.0009131263,0.6821185,0.2934617,0.00003000671],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7860488,0.0002694074,0.1232902,0.07971504,0.002402271,0.0003306762,0.0000591989,0.00002090876,0.007863501],"genre_scores_gemma":[0.9138771,0.000006859027,0.05070898,0.0005612837,0.001778846,0.00000271673,4.173978e-7,0.000009799005,0.03305399],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6700023,"threshold_uncertainty_score":0.4071239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037537665","doi":"10.1145/363647.363652","title":"Dynamic planar convex hull operations in near-logarithmic amortized time","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":81,"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":"Convex hull; Amortized analysis; Combinatorics; Binary logarithm; Logarithm; Mathematics; Regular polygon; Tangent; Constant (computer programming); Planar; Set (abstract data type); Time complexity; Computational geometry; Hull; Data structure; Discrete mathematics; Computer science; Algorithm; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01096369959703388,"gpt":0.2529968227406693,"spread":0.2420331231436354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004319128,0.00006231634,0.0001213881,0.0001131593,0.0001201848,0.0001319226,0.001412334,0.00003082841,0.00003606012],"category_scores_gemma":[0.0003426506,0.00004358725,0.00007278801,0.0004771765,0.00002398732,0.0003705171,0.0001922864,0.0001702003,0.00004133901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006333552,"about_ca_system_score_gemma":0.0001740244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009641689,"about_ca_topic_score_gemma":0.00003499245,"domain_scores_codex":[0.9991579,0.00009486722,0.0003035704,0.00008937676,0.0002447159,0.0001095457],"domain_scores_gemma":[0.9992017,0.00008527985,0.000124973,0.000430386,0.0001143654,0.00004331243],"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.0001503266,0.0005719457,0.007414882,0.00001328667,0.0001436182,0.0002984294,0.002437162,0.8645586,0.06216513,0.008178102,0.01823115,0.03583735],"study_design_scores_gemma":[0.001304615,0.000131213,0.06978435,0.00004634535,0.00001402939,0.0009298539,0.00001730937,0.8982294,0.0005903175,0.02166256,0.007139625,0.0001504395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9145103,0.0001331577,0.06740082,0.01703977,0.0005993637,0.00009792042,0.000001024257,0.00001152814,0.0002061051],"genre_scores_gemma":[0.9319379,0.00002827385,0.06587866,0.0008527808,0.00008705327,0.00000159,0.000001473381,0.000004309121,0.001207913],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06236947,"threshold_uncertainty_score":0.2624492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2238904460","doi":"10.1145/2824233","title":"Attribute-Based Encryption for Circuits","year":2015,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":77,"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; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Ciphertext; Attribute-based encryption; Encryption; Learning with errors; Theoretical computer science; Computer science; Ciphertext indistinguishability; Semantic security; Mathematics; Key (lock); Boolean circuit; Public-key cryptography; Malleability; Boolean function; Algorithm; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.07897727703077558,"gpt":0.2889504031054084,"spread":0.2099731260746329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008512335,0.00004906587,0.00009044555,0.00005937687,0.00006247117,0.0000748842,0.002620029,0.00002956667,0.00000165579],"category_scores_gemma":[0.001116894,0.00003029993,0.0001586084,0.0002257055,0.00001958333,0.0003773392,0.0002469925,0.000103332,0.000003074412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000290477,"about_ca_system_score_gemma":0.0001391917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002062241,"about_ca_topic_score_gemma":0.000001845352,"domain_scores_codex":[0.999342,0.00004894195,0.0001784788,0.00006816899,0.0002561491,0.0001063047],"domain_scores_gemma":[0.998499,0.0001200654,0.0002306719,0.000817195,0.0002483822,0.00008472279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002020864,0.0007811569,0.02957916,0.00008239847,0.0001691754,0.00003107044,0.002727402,0.00136088,0.009369564,0.1589746,0.7295909,0.06713165],"study_design_scores_gemma":[0.004203957,0.0008518373,0.03223532,0.0001221408,0.00006599839,0.000202465,0.0000990854,0.00702972,0.01742309,0.7685047,0.1689598,0.0003018131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07802316,0.0002182183,0.9106597,0.009533767,0.001395168,0.00009462491,0.00001115172,0.00001396596,0.0000502787],"genre_scores_gemma":[0.9433931,0.00000405281,0.05568161,0.00065194,0.0002598549,0.00000155001,9.369517e-7,0.000003022001,0.000003935116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8653699,"threshold_uncertainty_score":0.4868709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2279788372","doi":"10.1145/2996450","title":"A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Polynomial and algebraic computation","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Universitaire de France; Canada Research Chairs; Agence Nationale de la Recherche","keywords":"Bounded function; Intersection (aeronautics); Dimension (graph theory); Time complexity; Algorithm; Algebraic number; Set (abstract data type); Real algebraic geometry; Polynomial; Mathematics; Running time; Computer science; Discrete mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02475850701117695,"gpt":0.2885164726401233,"spread":0.2637579656289463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006486907,0.00007720906,0.0001694516,0.00005610304,0.0003606009,0.0004772676,0.001616455,0.00003289864,5.593382e-7],"category_scores_gemma":[0.00086153,0.00005293725,0.00007885219,0.00005120873,0.00007231632,0.0008774882,0.0007472737,0.0001321308,3.50222e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004627977,"about_ca_system_score_gemma":0.0001209955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001073348,"about_ca_topic_score_gemma":0.0000656771,"domain_scores_codex":[0.9993204,0.00005272519,0.0002091991,0.0001178992,0.0001477494,0.0001520638],"domain_scores_gemma":[0.9986756,0.0002636309,0.0004071039,0.000533851,0.00006558171,0.00005417565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00008061954,0.00007694381,0.00648704,0.00001490273,0.00005203704,0.00003270654,0.002504783,0.0001012175,0.001567084,0.01031705,0.0007819749,0.9779837],"study_design_scores_gemma":[0.002228876,0.0003602656,0.5359316,0.0001375685,0.00001937463,0.0002500036,0.00006955702,0.1363377,0.003327599,0.3204225,0.0007005036,0.0002144535],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9059348,0.00006453147,0.08800521,0.005304867,0.0005600155,0.00008761662,0.000001474474,0.000006834914,0.0000346183],"genre_scores_gemma":[0.8792531,0.00001390898,0.1204891,0.00008302084,0.0001331986,0.000001742807,6.147899e-8,0.000004028878,0.00002179759],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9777692,"threshold_uncertainty_score":0.4602303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975880448","doi":"10.1145/502090.502100","title":"Logics with aggregate operators","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Bell (Canada)","funders":"","keywords":"Aggregate (composite); Rotation formalisms in three dimensions; Computer science; Class (philosophy); Query language; Set (abstract data type); Theoretical computer science; Relation (database); Deductive database; Mathematics; Programming language; Database; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01872268061635748,"gpt":0.2368956651088596,"spread":0.2181729844925021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003340837,0.00007655352,0.0001250253,0.00003775364,0.0001104625,0.0001152061,0.003336279,0.00002918484,0.00001347231],"category_scores_gemma":[0.0003472379,0.00003323522,0.0000831481,0.0002843112,0.00003813587,0.0002927101,0.0005295991,0.0001908914,0.00002290293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003204584,"about_ca_system_score_gemma":0.00009512847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002586303,"about_ca_topic_score_gemma":0.000006518245,"domain_scores_codex":[0.9993215,0.00005793063,0.0001578393,0.00008112018,0.0002307628,0.0001509038],"domain_scores_gemma":[0.998696,0.00004956494,0.0002342796,0.0007897169,0.0001568852,0.00007351813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004284223,0.001281269,0.4489037,0.00005325067,0.0007590792,0.003518818,0.01504936,0.004805371,0.006202351,0.1316733,0.1949005,0.1924246],"study_design_scores_gemma":[0.006277125,0.003477004,0.164861,0.0008367259,0.0001986323,0.02514372,0.0004877452,0.008522926,0.02523298,0.1995478,0.5640287,0.001385628],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9406466,0.001201245,0.03127129,0.01180858,0.001559829,0.00008578564,2.358295e-7,0.00003447508,0.01339191],"genre_scores_gemma":[0.9821184,0.0001272515,0.01549832,0.0006541972,0.000261691,3.517734e-7,1.869048e-8,0.000004947477,0.001334803],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3691282,"threshold_uncertainty_score":0.6199692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2938191358","doi":"10.1145/3385731","title":"Planar Graphs Have Bounded Queue-Number","year":2020,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Treewidth; Planar graph; 1-planar graph; Bounded function; Pathwidth; Book embedding; Tree-depth; Indifference graph; Clique-sum; Graph product","retraction":null,"screen_n_in":null,"score":{"opus":0.04225608643793,"gpt":0.310918355023021,"spread":0.268662268585091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004839705,0.00008848297,0.0001640974,0.00005183033,0.0001310172,0.0001139038,0.006112409,0.00003440814,0.00002931754],"category_scores_gemma":[0.001238556,0.00005401195,0.0002038244,0.0004204912,0.00009030557,0.0004576966,0.0009186245,0.0004703138,0.00005112256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003005028,"about_ca_system_score_gemma":0.00009341114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002516266,"about_ca_topic_score_gemma":0.00000227455,"domain_scores_codex":[0.9986491,0.0001761061,0.0002616214,0.0001301646,0.0005607199,0.0002223553],"domain_scores_gemma":[0.9982153,0.0001899978,0.0002458693,0.001023249,0.0001471833,0.000178456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005920231,0.000246669,0.04598682,0.00006840062,0.000506855,0.0007750353,0.008129219,0.0006934658,0.02621462,0.6948159,0.2031489,0.01882211],"study_design_scores_gemma":[0.0004579173,0.0001192902,0.002587512,0.00002576253,0.000008323411,0.0002881769,0.000076758,0.0006305318,0.004249568,0.9772812,0.01417367,0.0001012643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4770671,0.0008543763,0.2065552,0.3049604,0.002180261,0.0004538094,0.000007884128,0.000130786,0.007790138],"genre_scores_gemma":[0.943248,0.00003688238,0.05237113,0.003780809,0.0002234715,0.000001104883,8.46091e-8,0.00001364031,0.0003248226],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4661809,"threshold_uncertainty_score":0.999265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2624483937","doi":"10.1145/1706591.1706596","title":"A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries","year":2010,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","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 Waterloo","funders":"","keywords":"Combinatorics; Convex hull; Amortized analysis; Mathematics; Regular polygon; Euclidean geometry; Set (abstract data type); Data structure; Point (geometry); k-nearest neighbors algorithm; Computational geometry; Plane (geometry); Extreme point; Discrete mathematics; Algorithm; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01828957927246067,"gpt":0.2856817733615128,"spread":0.2673921940890522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002551927,0.00005115158,0.00008396037,0.00004000547,0.0001148595,0.0001468141,0.002035632,0.00003051489,0.000007868714],"category_scores_gemma":[0.0008625677,0.0000315701,0.00002953064,0.0001069448,0.00003350797,0.0004696629,0.0007423902,0.0001546121,5.529747e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005706662,"about_ca_system_score_gemma":0.0001039798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000143511,"about_ca_topic_score_gemma":0.00003391606,"domain_scores_codex":[0.9995185,0.00002068532,0.0001502979,0.00009642963,0.0001439098,0.00007015379],"domain_scores_gemma":[0.9986727,0.0001657456,0.0001802517,0.0008098229,0.0001321448,0.00003935381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002143439,0.0001652382,0.005571071,0.0001340341,0.0003087397,0.00002041904,0.002460431,0.004964085,0.4413306,0.1251946,0.04962249,0.370014],"study_design_scores_gemma":[0.001730828,0.0003259829,0.1117994,0.00005455023,0.00007368864,0.001337937,0.00006734934,0.3666494,0.009373588,0.3944958,0.1137689,0.0003224633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8325286,0.0001714429,0.147606,0.01726277,0.002263975,0.0001172977,0.00002715604,0.000007497341,0.00001521896],"genre_scores_gemma":[0.8374127,0.000007431706,0.1619522,0.0003507477,0.0001858542,3.725272e-7,0.000003104757,0.000002857416,0.00008474027],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.431957,"threshold_uncertainty_score":0.3782745,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295995314","doi":"10.1145/2049697.2049704","title":"QIP = PSPACE","year":2011,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"National Natural Science Foundation of China","keywords":"PSPACE; Quantum complexity theory; Turing machine; Complexity class; Quantum computer; Computer science; Computational complexity theory; Context (archaeology); Model of computation; Mathematics; Theoretical computer science; Quantum; Discrete mathematics; Computation; Algorithm; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.02620749874645588,"gpt":0.2290441315709759,"spread":0.2028366328245201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003107191,0.00005315947,0.00008557914,0.00003873231,0.00007444368,0.00003571612,0.004072882,0.00001912382,0.000007026169],"category_scores_gemma":[0.0002485467,0.00002744817,0.000115989,0.0001588751,0.00002192182,0.0001046469,0.000916094,0.000220127,0.000008917281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001032825,"about_ca_system_score_gemma":0.00004644754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005193569,"about_ca_topic_score_gemma":5.95071e-7,"domain_scores_codex":[0.9994408,0.00004992838,0.0001456056,0.00006186147,0.0001898182,0.0001119222],"domain_scores_gemma":[0.9987563,0.00004717891,0.0002120175,0.0008762663,0.00005971333,0.00004849713],"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.00009208352,0.0007376834,0.01555676,0.00005112641,0.0004042003,0.0005663557,0.0490285,0.005815134,0.008674812,0.05672942,0.2019826,0.6603613],"study_design_scores_gemma":[0.00122497,0.0008131933,0.1356616,0.0003083223,0.00004720515,0.004493224,0.0001112562,0.08555689,0.02372349,0.7019159,0.04564432,0.0004995424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.801998,0.000499122,0.1696448,0.02132514,0.003978092,0.00006355729,3.459447e-7,0.00004653909,0.002444329],"genre_scores_gemma":[0.7415545,0.000006566635,0.257436,0.000555228,0.0002628398,9.949533e-8,4.452771e-9,0.000004270833,0.0001804672],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6598618,"threshold_uncertainty_score":0.7568496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020437202","doi":"10.1145/876638.876642","title":"Definable relations and first-order query languages over strings","year":2003,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"semigroups and automata theory","field":"Computer Science","cited_by":53,"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":"Computer science; String (physics); First-order logic; Mathematics; Query language; Predicate (mathematical logic); Regular language; Theoretical computer science; Discrete mathematics; Programming language; Database; Automaton","retraction":null,"screen_n_in":null,"score":{"opus":0.007487091163718904,"gpt":0.2248419636290246,"spread":0.2173548724653057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003675387,0.00004636405,0.00007324709,0.00003890636,0.0001112072,0.0000745787,0.0007765152,0.00002428547,0.0000280791],"category_scores_gemma":[0.0007961386,0.00002803915,0.00004409561,0.0001555717,0.00002050084,0.0003306373,0.0002451471,0.0001234562,0.000004885514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001752757,"about_ca_system_score_gemma":0.00003679089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009127526,"about_ca_topic_score_gemma":0.000003206426,"domain_scores_codex":[0.9995526,0.00004387222,0.0001291241,0.00005803253,0.0001262969,0.00009003923],"domain_scores_gemma":[0.9991506,0.0001580687,0.0001387732,0.0004799175,0.00004073568,0.00003194252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001699648,0.0002137725,0.1005613,0.00004440994,0.0001652937,0.0001106788,0.004604148,0.001452283,0.004189582,0.7407504,0.1389541,0.008937067],"study_design_scores_gemma":[0.001710286,0.0001827742,0.2340394,0.0002984579,0.00007421678,0.001757808,0.0007239991,0.00309695,0.006325576,0.5952015,0.1561613,0.0004278215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9742234,0.002228286,0.01332641,0.006672132,0.0003716874,0.00004564207,6.587838e-7,0.00001927566,0.003112514],"genre_scores_gemma":[0.9663825,0.00005847741,0.03179639,0.0005038165,0.00004437579,4.096021e-7,2.864457e-8,0.000004572994,0.001209404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1455489,"threshold_uncertainty_score":0.1442971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062135503","doi":"10.1145/2528405","title":"Lower bounds for local approximation","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","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":"Helsingin Yliopiston Tiedesäätiö; Suomen Kulttuurirahasto; Academy of Finland","keywords":"Mathematics; Combinatorics; Approximation algorithm; Dominating set; Upper and lower bounds; Discrete mathematics; Numbering; Bounded function; Independent set; Vertex (graph theory); Graph; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02291329635721146,"gpt":0.2504942880361266,"spread":0.2275809916789152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002850479,0.00004553326,0.00007930801,0.00004078185,0.0001041593,0.0001408825,0.002416717,0.00002222186,0.00001529786],"category_scores_gemma":[0.0002310825,0.00002670994,0.000143985,0.0001340913,0.00004369194,0.0004632437,0.0003901916,0.0001051922,0.000009693603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002324587,"about_ca_system_score_gemma":0.00003496651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003684891,"about_ca_topic_score_gemma":7.6553e-7,"domain_scores_codex":[0.9994519,0.00002403491,0.0001800106,0.00005601812,0.0001874216,0.0001006491],"domain_scores_gemma":[0.9989246,0.00009993529,0.0001760208,0.0006011853,0.0001628373,0.00003549481],"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.00003311623,0.0003915295,0.0003923899,0.00004758805,0.0001190761,0.000004773889,0.001222748,0.001323964,0.001954206,0.123182,0.3059138,0.5654148],"study_design_scores_gemma":[0.0003541678,0.0001559969,0.002641995,0.00003197163,0.000007673641,0.00009968295,0.00003024348,0.1125162,0.001253611,0.8653391,0.01749446,0.00007492598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01967457,0.00007551608,0.9667267,0.01181682,0.001390851,0.0001027689,3.646991e-7,0.000008946987,0.0002034502],"genre_scores_gemma":[0.6416588,0.00000649621,0.3568637,0.0008604471,0.0003402389,0.000005502561,8.997006e-8,0.000004791195,0.0002599148],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.742157,"threshold_uncertainty_score":0.4490901,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2568356985","doi":"10.1145/2518131","title":"From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Fonds Québécois de la Recherche sur la Nature et les Technologies; Mitacs; Canada Research Chairs","keywords":"Mathematical proof; Uncertainty principle; Mathematics; Norm (philosophy); Discrete mathematics; Cryptography; Relation (database); Key (lock); Entropic uncertainty; Euclidean geometry; Quantum cryptography; Theoretical computer science; Quantum; Quantum information; Computer science; Algorithm; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.004767707057498165,"gpt":0.2082507028167856,"spread":0.2034829957592874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002144163,0.00006596449,0.00008983468,0.0001123621,0.0001722196,0.0002001967,0.0009381938,0.00002646218,0.000005969546],"category_scores_gemma":[0.0003727634,0.0000409466,0.0000551477,0.0002533051,0.00001069096,0.0003866532,0.0005550277,0.0001782973,0.00002111154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006515986,"about_ca_system_score_gemma":0.00003254919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009044018,"about_ca_topic_score_gemma":0.000001462374,"domain_scores_codex":[0.9992759,0.00002825876,0.0002774656,0.00006894533,0.0002419592,0.0001074449],"domain_scores_gemma":[0.9989773,0.0001032979,0.0002879139,0.0004179633,0.0001391605,0.00007435845],"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.000009147276,0.00003976051,0.001266074,0.00000921737,0.00003022391,0.000001617431,0.01990028,0.8239239,0.002148097,0.0007977709,0.01015769,0.1417162],"study_design_scores_gemma":[0.000230078,0.00006228262,0.04890963,0.000155821,0.000008178742,0.00004280272,0.0001526023,0.9364645,0.0004837307,0.01181364,0.001574114,0.0001026174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8119521,0.00002353768,0.1793697,0.008104609,0.0004317985,0.0000729438,7.498128e-7,0.00001252236,0.0000321233],"genre_scores_gemma":[0.9641955,0.000001083919,0.03518878,0.0004517145,0.0001443229,0.000001113678,2.750959e-7,0.000002312926,0.00001486378],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1522435,"threshold_uncertainty_score":0.1930501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2311002194","doi":"10.1145/2837019","title":"Byzantine Agreement in Expected Polynomial Time","year":2016,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Computer science; Asynchronous communication; Adversary; Scheduling (production processes); Time complexity; Computation; Fraction (chemistry); Constant (computer programming); Adversary model; Quantum Byzantine agreement; State (computer science); Polynomial; Theoretical computer science; Byzantine fault tolerance; Algorithm; Distributed computing; Mathematics; Mathematical optimization; Computer network; Fault tolerance; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.008841307731756204,"gpt":0.2204181357576064,"spread":0.2115768280258502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003764681,0.00005943387,0.0001415046,0.00004972004,0.00002810522,0.00003796775,0.002502213,0.00002478559,0.00002798985],"category_scores_gemma":[0.0002933529,0.00002675225,0.00008394693,0.0001888054,0.00001625961,0.0002431882,0.0004312232,0.00007641063,0.00005421693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003627363,"about_ca_system_score_gemma":0.00005189419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006998934,"about_ca_topic_score_gemma":0.000002988755,"domain_scores_codex":[0.9991369,0.00006617895,0.0003304136,0.00007864789,0.0002494919,0.0001384202],"domain_scores_gemma":[0.9988059,0.00005476582,0.0002844056,0.0007428239,0.0000699958,0.00004209327],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"observational","study_design_scores_codex":[0.0001602847,0.0004738555,0.02528597,0.00001557184,0.0001287716,0.0002172361,0.001426068,0.0001022519,0.3314344,0.002166978,0.5371075,0.1014811],"study_design_scores_gemma":[0.01256079,0.0006817709,0.4818314,0.002184197,0.0000313668,0.001220505,0.00009842794,0.003052542,0.05279157,0.004963133,0.4397582,0.0008261701],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.92224,0.0003719517,0.02241874,0.05116952,0.002075951,0.0001389014,0.000006918746,0.00001804821,0.001559969],"genre_scores_gemma":[0.9964904,0.000006614415,0.001982367,0.0001336455,0.0001993528,6.419326e-7,3.644056e-8,0.000002547273,0.001184363],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4565454,"threshold_uncertainty_score":0.4649777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972412225","doi":"10.1145/1120582.1120587","title":"Limits on the ability of quantum states to convey classical messages","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Computer science; Quantum entanglement; Bounded function; Quantum; Simple (philosophy); Quantum key distribution; Quantum information science; Task (project management); Upper and lower bounds; Theoretical computer science; Function (biology); Product (mathematics); Mathematics; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01893243991904392,"gpt":0.2500341970047023,"spread":0.2311017570856583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008422924,0.00006850475,0.000132384,0.00007013167,0.00008091749,0.00007023007,0.002540561,0.00002493624,0.00001397288],"category_scores_gemma":[0.0004937461,0.00003061569,0.000170069,0.000328437,0.00007506894,0.0002104156,0.0002429586,0.0001815163,0.00001286684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001629217,"about_ca_system_score_gemma":0.00004454344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006625576,"about_ca_topic_score_gemma":0.000002063732,"domain_scores_codex":[0.9988748,0.0001285317,0.0004005541,0.00005827373,0.0004234401,0.0001144095],"domain_scores_gemma":[0.9981198,0.0004317788,0.0003567357,0.0008635762,0.000182172,0.00004590734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001082515,0.0003360723,0.00675282,0.00002398741,0.00006098295,0.000003330532,0.001789181,0.002249391,0.006409008,0.7134833,0.2643769,0.004406745],"study_design_scores_gemma":[0.0006289619,0.0006886924,0.4789747,0.0001315433,0.0000212582,0.00004485396,0.000381689,0.01572655,0.04266737,0.4252503,0.03529026,0.000193884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9066734,0.00003710898,0.01357728,0.0782783,0.000425108,0.0000889416,0.000002376397,0.00001054491,0.0009069687],"genre_scores_gemma":[0.9969676,0.000007788966,0.001379061,0.001574182,0.00004715987,8.367806e-7,7.18233e-8,0.000002149306,0.00002112591],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4722218,"threshold_uncertainty_score":0.4721037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062374336","doi":"10.1145/1147954.1147962","title":"Computing with highly mixed states","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","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 Waterloo","funders":"","keywords":"Initialization; Qubit; Ideal (ethics); Quantum computer; Computer science; State (computer science); Quantum circuit; Quantum gate; Quantum; Topology (electrical circuits); Quantum mechanics; Physics; Algorithm; Mathematics; Quantum error correction; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.005547299973036692,"gpt":0.2045473617007716,"spread":0.1990000617277349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003409562,0.00009000101,0.0001418701,0.00005638297,0.0001576095,0.0001346203,0.002724856,0.00001914542,7.591107e-7],"category_scores_gemma":[0.00006354008,0.00004407239,0.00008877856,0.000266468,0.0000373795,0.0001081652,0.000652776,0.0002504716,0.000002208576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002149353,"about_ca_system_score_gemma":0.00006486521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002451417,"about_ca_topic_score_gemma":0.000004712501,"domain_scores_codex":[0.9990869,0.00006941583,0.0002456306,0.00009852635,0.0003210361,0.0001784615],"domain_scores_gemma":[0.9986507,0.0001616219,0.0003651755,0.0006742883,0.0001098103,0.0000384477],"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.00004896257,0.0002804637,0.01181234,0.00003602558,0.0001469247,0.0002865374,0.001647768,0.8067271,0.003020325,0.008346925,0.05698063,0.110666],"study_design_scores_gemma":[0.00169245,0.0006799019,0.1339943,0.0004452936,0.0000404443,0.002880272,0.00006100351,0.7045606,0.01042183,0.1286893,0.01608832,0.0004462934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.850269,0.0001660657,0.1391779,0.009619415,0.0006207433,0.00003180942,3.754223e-7,0.00002717304,0.00008750463],"genre_scores_gemma":[0.8207186,0.000001580523,0.178665,0.0002139949,0.0003412379,5.663063e-8,8.019811e-8,0.00000560474,0.00005389523],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.122182,"threshold_uncertainty_score":0.5063506,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029839940","doi":"10.1145/2537948","title":"Approximating Markov Processes by Averaging","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Bisimulation; Mathematics; Probabilistic logic; Markov process; Probability measure; Bounded function; Equivalence (formal languages); Markov kernel; Probability distribution; Markov chain; Discrete mathematics; Applied mathematics; Markov model; Variable-order Markov model; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01467064351757754,"gpt":0.259922977932267,"spread":0.2452523344146894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166524,0.00005127704,0.00009062824,0.00003342482,0.00009775411,0.0001029512,0.003293272,0.00001970486,0.000002159532],"category_scores_gemma":[0.006562289,0.00003101582,0.00004201691,0.0002326191,0.00001900483,0.000522577,0.0004731218,0.0001629665,0.000003309361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002622314,"about_ca_system_score_gemma":0.00004029194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.043358e-7,"about_ca_topic_score_gemma":8.03036e-8,"domain_scores_codex":[0.9991679,0.0001379569,0.0002611616,0.0000677961,0.0002632428,0.000101917],"domain_scores_gemma":[0.9984075,0.0001637377,0.0005093456,0.0007476672,0.0001401455,0.00003153484],"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.00003693902,0.0002086925,0.008065536,0.0004854519,0.00009068408,0.000003472431,0.006401401,0.001259539,0.05067177,0.02518413,0.06302764,0.8445647],"study_design_scores_gemma":[0.001237161,0.000359859,0.008436452,0.0007856135,0.00005226356,0.001026485,0.0002196276,0.3287622,0.3380114,0.2366395,0.0838578,0.0006117278],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03210431,0.0001144352,0.9627748,0.003171921,0.0005715523,0.00003907672,1.306196e-7,0.00001584985,0.00120792],"genre_scores_gemma":[0.1975398,0.000006294475,0.8019437,0.000320668,0.0001046194,7.080641e-7,2.469299e-8,0.000003633004,0.00008056246],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.843953,"threshold_uncertainty_score":0.7856147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139032973","doi":"10.1145/3321699","title":"On the Computability of Conditional Probability","year":2019,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computability, Logic, AI Algorithms","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 Toronto","funders":"Office of Naval Research Global; Army Research Office; Office of Naval Research; Defense Advanced Research Projects Agency; John Templeton Foundation; National Science Foundation","keywords":"Conditional probability distribution; Inference; Computability; Joint probability distribution; Regular conditional probability; Conditional probability; Probabilistic logic; Computer science; Conditional variance; Probability distribution; Mathematics; Fiducial inference; Bayesian network; Frequentist inference; Theoretical computer science; Artificial intelligence; Bayesian inference; Posterior probability; Bayesian probability; Econometrics; Statistics; Autoregressive conditional heteroskedasticity","retraction":null,"screen_n_in":null,"score":{"opus":0.02452586075170043,"gpt":0.2397436997901926,"spread":0.2152178390384922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002580513,0.0001252254,0.0002945288,0.00004491006,0.00009048981,0.00005518012,0.005999052,0.00004893986,0.0001171581],"category_scores_gemma":[0.002481371,0.00006002069,0.0003438161,0.0003374401,0.0002084127,0.000217503,0.001749228,0.0004323097,0.00002591609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001301059,"about_ca_system_score_gemma":0.0002163133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005971735,"about_ca_topic_score_gemma":0.000001718934,"domain_scores_codex":[0.9977316,0.0004914398,0.0005888405,0.0002129276,0.0007993425,0.0001759042],"domain_scores_gemma":[0.9938651,0.002233077,0.000641035,0.002733657,0.0004679102,0.00005923906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003207915,0.00422486,0.203135,0.0002915794,0.0004347122,0.00001428062,0.002963485,0.0869167,0.004472645,0.6521288,0.02503377,0.02006346],"study_design_scores_gemma":[0.0003016799,0.0002810073,0.2015773,0.00003083551,0.000007543074,0.00006335497,0.00001354811,0.01137016,0.001279894,0.7846275,0.0003729443,0.00007425504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9592385,0.0000314934,0.01884145,0.01985209,0.001205476,0.0003565767,0.000005184768,0.00001450048,0.000454772],"genre_scores_gemma":[0.9833047,7.65899e-7,0.01607222,0.0004994948,0.00008965466,0.000001354906,1.419396e-7,0.000003923995,0.00002777887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1324988,"threshold_uncertainty_score":0.999379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2603442307","doi":"10.1145/3046673","title":"Instance-Optimal Geometric Algorithms","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"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":"Center for Massive Data Algorithmics; Danmarks Grundforskningsfond","keywords":"Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03309770124052353,"gpt":0.2890792918137696,"spread":0.255981590573246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004862118,0.00005291534,0.00009209201,0.0001351845,0.0003707811,0.0002955842,0.004554467,0.00002320867,0.000006836852],"category_scores_gemma":[0.00143461,0.00003320646,0.0001057262,0.0002504836,0.00002663111,0.0007301539,0.000891745,0.0001407079,0.0000107426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003288925,"about_ca_system_score_gemma":0.00009650316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001911597,"about_ca_topic_score_gemma":6.72211e-7,"domain_scores_codex":[0.9992464,0.00003004122,0.0001952172,0.00007586263,0.0003564383,0.0000959966],"domain_scores_gemma":[0.9980302,0.0000697301,0.0005029819,0.001146051,0.000203043,0.00004797919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00003312547,0.000196856,0.005196697,0.00001278204,0.0001299032,0.00006874149,0.0005318543,0.03156241,0.002523957,0.01638031,0.03976288,0.9036005],"study_design_scores_gemma":[0.002602162,0.000545933,0.6320558,0.000133725,0.00005838579,0.001388708,0.00003923371,0.06383318,0.02862791,0.1210748,0.1491497,0.0004904429],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3601703,0.0004261573,0.618719,0.01567113,0.003884559,0.00005842112,9.078938e-7,0.00001034873,0.001059177],"genre_scores_gemma":[0.8636553,0.00003004467,0.1349315,0.0002350941,0.0004978344,3.851321e-7,6.890536e-8,0.000002553622,0.0006472414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.90311,"threshold_uncertainty_score":0.8463408,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146748072","doi":"10.1145/2590775","title":"Avoiding Three Consecutive Blocks of the Same Size and Same Sum","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"semigroups and automata theory","field":"Computer Science","cited_by":30,"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 Winnipeg","funders":"","keywords":"Alphabet; Combinatorics; Block size; Mathematics; Word (group theory); Discrete mathematics; Computer science; Linguistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01285349044668734,"gpt":0.2252443628507376,"spread":0.2123908724040502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427678,0.00007925224,0.0001800889,0.00002567476,0.0001694058,0.0000599139,0.002843084,0.00003499771,0.000007557281],"category_scores_gemma":[0.002938354,0.00003795587,0.0001291352,0.0001371526,0.0001361386,0.0001576216,0.001259042,0.000320397,0.000001121652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001676528,"about_ca_system_score_gemma":0.00004670043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001349735,"about_ca_topic_score_gemma":0.000006672348,"domain_scores_codex":[0.9990443,0.0002325121,0.0002507183,0.00008741864,0.0002565362,0.0001284953],"domain_scores_gemma":[0.9971511,0.001383857,0.0004632577,0.0008757458,0.00008288219,0.00004313109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002381446,0.000420999,0.0897375,0.0001401813,0.0007802796,0.00004441841,0.02634686,0.0005204708,0.3755448,0.3904763,0.0347641,0.08098593],"study_design_scores_gemma":[0.0008360317,0.0001579476,0.1022115,0.0003974205,0.00005513336,0.0007276332,0.0004068485,0.004241477,0.043246,0.8457233,0.001831341,0.0001654167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9822149,0.0003331716,0.005750253,0.01072955,0.0006476604,0.00005264134,0.000001286413,0.000008008999,0.0002625655],"genre_scores_gemma":[0.9943144,0.00001378685,0.004469624,0.0009884224,0.00010876,2.507628e-7,6.802421e-9,0.000004249696,0.0001004606],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.455247,"threshold_uncertainty_score":0.5283205,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3204812806","doi":"10.1145/3477542","title":"Adjacency Labelling for Planar Graphs (and Beyond)","year":2021,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Adjacency list; Planar graph; Vertex (graph theory); 1-planar graph; Discrete mathematics; Pathwidth; Bounded function; Chordal graph; Graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02032145312571858,"gpt":0.2416427083824907,"spread":0.2213212552567721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000442851,0.00005614756,0.0001142443,0.00005021474,0.0001355219,0.00007327971,0.00104476,0.00002858778,0.000001867176],"category_scores_gemma":[0.0004797918,0.00003456344,0.000113069,0.0002067477,0.00002162741,0.0001435322,0.000252805,0.0001248019,0.000001046018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005389327,"about_ca_system_score_gemma":0.0000647468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001127302,"about_ca_topic_score_gemma":0.000001306874,"domain_scores_codex":[0.9993542,0.00003907019,0.0002172661,0.00009720707,0.0001744809,0.0001177144],"domain_scores_gemma":[0.9988095,0.0001596894,0.0001829653,0.0005807488,0.0002078871,0.00005927393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004181439,0.000221848,0.004984572,0.00008767762,0.0002344799,0.00009197432,0.002270524,0.0006005298,0.1039519,0.7865722,0.07722705,0.02371545],"study_design_scores_gemma":[0.0004551399,0.00006762652,0.0003770554,0.00006148644,0.00002120935,0.0002740352,0.00003863789,0.0007378879,0.01475211,0.9798019,0.003349387,0.00006351408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8731633,0.01517284,0.03089944,0.07596566,0.00403836,0.0001634935,0.000004684497,0.00004705456,0.0005452152],"genre_scores_gemma":[0.5361359,0.0005886453,0.4590572,0.003594862,0.00004325194,0.000001741265,3.290231e-7,0.00001260677,0.0005654777],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4281578,"threshold_uncertainty_score":0.1941442,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995031698","doi":"10.1145/1255443.1255444","title":"(Almost) Tight bounds and existence theorems for single-commodity confluent flows","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Flow (mathematics); Maximum flow problem; Flow network; Sink (geography); Computer science; Combinatorics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0438101471097265,"gpt":0.276298589715113,"spread":0.2324884426053865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001543086,0.0000979492,0.0001718976,0.00006725118,0.0002573414,0.0001700108,0.002777531,0.00004032373,0.000003971049],"category_scores_gemma":[0.0005574126,0.00006037315,0.0001630651,0.0001807434,0.000138334,0.0003033685,0.0007551278,0.0002053704,9.491878e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004199811,"about_ca_system_score_gemma":0.0000430761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003697337,"about_ca_topic_score_gemma":0.000009936301,"domain_scores_codex":[0.9989851,0.00004856294,0.0003292669,0.0001261881,0.0002958614,0.000214995],"domain_scores_gemma":[0.9980867,0.0004890297,0.0002945096,0.0008581,0.0001773291,0.00009432847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004728714,0.001122638,0.006046903,0.0001416912,0.0003476115,0.0001508363,0.007613789,0.0001640697,0.05501791,0.6165915,0.01299852,0.2993317],"study_design_scores_gemma":[0.001078628,0.0005081972,0.01074925,0.0001387633,0.00003331596,0.001211979,0.00009335503,0.006688903,0.01444475,0.8769405,0.0878667,0.0002456035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4975898,0.0009443056,0.4871409,0.009364105,0.003113888,0.0002391314,0.000006705695,0.00002922655,0.001571953],"genre_scores_gemma":[0.8105734,0.00002095191,0.1879542,0.0009015481,0.0004214185,0.000001101082,2.451575e-7,0.000007770699,0.0001193854],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3129836,"threshold_uncertainty_score":0.516139,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102573817","doi":"10.1145/2528401","title":"The expressibility of functions on the boolean domain, with applications to counting CSPs","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences","keywords":"Unary operation; Counting problem; Boolean function; clone (Java method); Set (abstract data type); Complexity of constraint satisfaction; Bipartite graph; Function (biology); Binary number; Arity","retraction":null,"screen_n_in":null,"score":{"opus":0.01345587245328604,"gpt":0.23035774983965,"spread":0.216901877386364,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005211174,0.0000501947,0.00006296732,0.00002768977,0.0003843162,0.0001247054,0.001360306,0.00001437548,0.00002787921],"category_scores_gemma":[0.0003162163,0.00001955837,0.00005706817,0.0002547902,0.00007005919,0.0001791041,0.0001960473,0.000150661,0.00001389403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000303578,"about_ca_system_score_gemma":0.00006218745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009228548,"about_ca_topic_score_gemma":0.0000183528,"domain_scores_codex":[0.9992781,0.00007833797,0.0002310618,0.00007161564,0.0002596819,0.00008125041],"domain_scores_gemma":[0.997921,0.0003909979,0.0003230197,0.001041134,0.0002873833,0.00003646356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0002058516,0.0005933904,0.05528592,0.00003895256,0.0004627714,0.000001849718,0.008595886,0.08006842,0.02565958,0.2419529,0.2091076,0.3780269],"study_design_scores_gemma":[0.001501119,0.0007135222,0.6918157,0.0003778792,0.0001006821,0.0002720831,0.00652776,0.01585762,0.009354864,0.1458454,0.1271137,0.0005197391],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1553695,0.00002552413,0.7556182,0.08604601,0.0002873476,0.0005282789,0.000001589147,0.00001588931,0.002107641],"genre_scores_gemma":[0.9808163,0.000004982014,0.01811675,0.0007633312,0.00006725054,0.00001992941,5.309023e-8,0.000003342875,0.0002080616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8254467,"threshold_uncertainty_score":0.2955889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997068591","doi":"10.1145/1162349.1162352","title":"Distribution sort with randomized cycling","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Data Storage Technologies","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":"Carleton University","funders":"","keywords":"Computer science; Randomized algorithm; sort; Probabilistic logic; Out-of-core algorithm; Merge sort; Algorithm; Merge (version control); Computation; Task (project management); Parallel computing; Sorting algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.008534024332847286,"gpt":0.2320190184497336,"spread":0.2234849941168863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004852489,0.00005968131,0.0001876208,0.00003078084,0.00007474666,0.00005126161,0.002701877,0.00002502794,9.788057e-7],"category_scores_gemma":[0.001304589,0.0000283715,0.00008692349,0.000200464,0.00009502206,0.0004702571,0.0006254545,0.0001768205,0.000002015237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005088301,"about_ca_system_score_gemma":0.00003159499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005037859,"about_ca_topic_score_gemma":0.000002027688,"domain_scores_codex":[0.9993114,0.00004661211,0.0002350491,0.00006966488,0.0002339227,0.0001033302],"domain_scores_gemma":[0.9983364,0.0001838775,0.0004281438,0.0009559442,0.00008272479,0.00001292796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.02220543,0.0007332927,0.01132399,0.00006358552,0.0006057521,0.0007990823,0.0005588788,0.0680126,0.02759847,0.6211489,0.137304,0.109646],"study_design_scores_gemma":[0.05373779,0.0001328402,0.00450615,0.0001687891,0.00008258067,0.001145148,0.0000465521,0.004340949,0.04104802,0.8850272,0.00948866,0.0002753539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08967423,0.0001828038,0.9036688,0.00606511,0.0002131071,0.00006888396,0.000002291486,0.00004790721,0.00007685729],"genre_scores_gemma":[0.8211565,0.00001526181,0.17865,0.00005204229,0.00007260143,0.000001219226,6.985801e-7,0.000002993557,0.00004864263],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7314823,"threshold_uncertainty_score":0.5020805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105465869","doi":"10.1145/355483.355488","title":"A lower bound on the average-case complexity of shellsort","year":2000,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":18,"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":"Upper and lower bounds; Combinatorics; Mathematics; Distribution (mathematics); Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04482802075209594,"gpt":0.2642642397316009,"spread":0.219436218979505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003469418,0.00005353638,0.0000946041,0.00002077731,0.0001485544,0.00006031568,0.002439984,0.00001685686,0.0002846571],"category_scores_gemma":[0.00007331957,0.00002598063,0.0001473321,0.0001771608,0.00009402216,0.00009835514,0.0002398998,0.0001612825,0.00004749857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001645384,"about_ca_system_score_gemma":0.00004080795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001007175,"about_ca_topic_score_gemma":0.000003290299,"domain_scores_codex":[0.9993438,0.0000593815,0.0002199987,0.00006555022,0.0002274505,0.00008389324],"domain_scores_gemma":[0.998269,0.0001301715,0.0001798194,0.001338374,0.00004918145,0.00003349712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002873307,0.004161117,0.001385528,0.00007048207,0.0006412735,0.00180397,0.008577428,0.006805819,0.04180648,0.3823644,0.3731116,0.1789846],"study_design_scores_gemma":[0.001882887,0.000737596,0.03429978,0.0002731161,0.0001325879,0.01695202,0.0001314444,0.05493379,0.04912062,0.5264487,0.3145382,0.0005493732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9740859,0.00004737271,0.002901339,0.01997905,0.0001590372,0.0000832068,0.000002617455,0.000007585918,0.002733952],"genre_scores_gemma":[0.995993,0.00001016032,0.002611403,0.0006550203,0.00006137852,7.778907e-7,5.644103e-8,0.000002923331,0.0006652319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1784352,"threshold_uncertainty_score":0.4534138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1558278838","doi":"10.1145/3095799","title":"An Average-Case Depth Hierarchy Theorem for Boolean Circuits","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hierarchy; Conjecture; Boolean function; Discrete mathematics; Combinatorics; Converse; Bounded function; Boolean circuit; Random variable; Polynomial; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05825755211603171,"gpt":0.3181386363919909,"spread":0.2598810842759591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.000960427,0.00009619107,0.0001605072,0.00006896025,0.0009341972,0.000545538,0.008680812,0.0000363723,0.000007224439],"category_scores_gemma":[0.0009464288,0.00006017123,0.0002527037,0.00006261044,0.0001168205,0.0008706469,0.000898214,0.0002428257,0.000002255925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002337431,"about_ca_system_score_gemma":0.00007257118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006254405,"about_ca_topic_score_gemma":0.00001644106,"domain_scores_codex":[0.9990788,0.00008533624,0.0002461571,0.0001378202,0.0002505925,0.0002013215],"domain_scores_gemma":[0.9961566,0.0001786204,0.0005085377,0.002882485,0.0001567846,0.0001170218],"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.00005063911,0.0003597965,0.00244571,0.00003288254,0.0001604563,0.001014658,0.002564157,0.0003635594,0.001490062,0.1608506,0.007876555,0.8227909],"study_design_scores_gemma":[0.001075584,0.000416118,0.01316528,0.00007889936,0.00002841984,0.006333132,0.00005018515,0.02309602,0.003240236,0.9443263,0.007983472,0.000206363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3413288,0.0001810272,0.6371099,0.01526584,0.00404292,0.0003058925,0.00001085375,0.00004096629,0.001713796],"genre_scores_gemma":[0.9497581,0.000008617408,0.04921359,0.0003960354,0.0004901596,0.000001416356,8.122858e-8,0.000007368534,0.0001246529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8225845,"threshold_uncertainty_score":0.9966827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409280356","doi":"10.1145/3728631","title":"Maximum Flow and Minimum-Cost Flow in Almost-Linear Time","year":2025,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Minimum-cost flow problem; Flow (mathematics); Maximum flow problem; Mathematics; Computer science; Mathematical optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01596048731152192,"gpt":0.2604227304612225,"spread":0.2444622431497006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005305946,0.00008475202,0.0001756956,0.000158327,0.00008973436,0.00008171546,0.00251899,0.00004019053,0.00001528287],"category_scores_gemma":[0.0004320732,0.00005691745,0.0001008032,0.0004820671,0.00005612855,0.0002338779,0.001189589,0.0002887605,0.00000906357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002898966,"about_ca_system_score_gemma":0.00008041239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004471284,"about_ca_topic_score_gemma":0.000005975858,"domain_scores_codex":[0.9991648,0.00007888943,0.0002841079,0.0001174882,0.0002009047,0.0001537664],"domain_scores_gemma":[0.9988182,0.0001858644,0.0001195639,0.0007611674,0.00006888203,0.00004632705],"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.0001702702,0.0006187377,0.008494408,0.00008813999,0.0002419978,0.0003052851,0.003003196,0.005879948,0.003508266,0.004275502,0.1041043,0.8693099],"study_design_scores_gemma":[0.001554855,0.0001295781,0.02216392,0.0003716686,0.0000250092,0.0003248423,0.00004553505,0.6471874,0.001681172,0.293845,0.03246053,0.000210559],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6409793,0.00411093,0.1644889,0.1754677,0.008691997,0.0007921134,0.0000234928,0.00009285166,0.005352586],"genre_scores_gemma":[0.1339171,0.0002434893,0.8575792,0.004700272,0.0005651357,0.000004644975,6.828243e-7,0.00001787455,0.002971598],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8690993,"threshold_uncertainty_score":0.4680952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950407838","doi":"10.1145/3312741","title":"Nonhomogeneous Place-dependent Markov Chains, Unsynchronised AIMD, and Optimisation","year":2019,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"FP7 Ideas: European Research Council; Science Foundation Ireland","keywords":"Markov chain; Constraint (computer-aided design); Mathematical optimization; Convergence (economics); Computer science; Markov process; Resource (disambiguation); Key (lock); Class (philosophy); Mathematics; Artificial intelligence; Machine learning; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.007230562928702009,"gpt":0.2096683075004045,"spread":0.2024377445717025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006994247,0.0001086443,0.0001916928,0.0001334466,0.0001144057,0.0001167361,0.0007400074,0.00004106223,0.0002081825],"category_scores_gemma":[0.0005931729,0.00007222503,0.0001191425,0.0001722548,0.00003102376,0.0005604865,0.0004544716,0.000170096,0.00005839749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000603857,"about_ca_system_score_gemma":0.00001991988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001121831,"about_ca_topic_score_gemma":0.0000100085,"domain_scores_codex":[0.9991747,0.00002734009,0.000271727,0.0001098106,0.0002791544,0.000137342],"domain_scores_gemma":[0.9986027,0.00008599541,0.0006282491,0.0005471705,0.0001239918,0.00001183491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003718863,0.0006890948,0.1349281,0.00106292,0.002134788,0.0002826704,0.001046215,0.6039093,0.1106705,0.01799066,0.02470724,0.0988597],"study_design_scores_gemma":[0.02689188,0.0005668661,0.06102198,0.002582192,0.005498962,0.001707474,0.006035498,0.2868803,0.01770221,0.351225,0.2356364,0.004251168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9937086,0.0002336699,0.000368288,0.003668122,0.0005155738,0.0001152241,5.64689e-7,0.00001479037,0.001375233],"genre_scores_gemma":[0.9958869,0.00003696282,0.0008931,0.0009255912,0.0006546302,7.345092e-7,6.946469e-7,0.00001782753,0.001583606],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3332344,"threshold_uncertainty_score":0.2945251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3091802565","doi":"10.1145/3417994","title":"Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes","year":2020,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of British Columbia; University of Waterloo; McMaster University; Vector Institute","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mixture model; Upper and lower bounds; Compression (physics); Gaussian; Sample complexity; Matching (statistics); Mathematics; Scheme (mathematics); Data compression; Algorithm; Class (philosophy); Computer science; Distribution (mathematics); Artificial intelligence; Statistics; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04636202812958371,"gpt":0.2856437907121075,"spread":0.2392817625825238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003982081,0.0001050181,0.0002566153,0.00003174081,0.0002876024,0.0001040159,0.002435141,0.00004094409,0.0000224218],"category_scores_gemma":[0.001464734,0.0000652084,0.0002186795,0.000187647,0.00009093715,0.0001896142,0.0007811951,0.0004794477,0.000001116277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001380263,"about_ca_system_score_gemma":0.00006605247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003023809,"about_ca_topic_score_gemma":6.210116e-7,"domain_scores_codex":[0.9988822,0.0001475929,0.0003416935,0.0001297352,0.0003306041,0.0001681729],"domain_scores_gemma":[0.9984907,0.0002498562,0.0006028445,0.000420891,0.0001316914,0.0001040353],"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.001188957,0.0008156718,0.09101736,0.000747303,0.0007767118,0.00005179872,0.027628,0.5478532,0.04929101,0.009384706,0.04238997,0.2288553],"study_design_scores_gemma":[0.0006706013,0.0005040911,0.007741818,0.00009389814,0.00002349414,0.00004594838,0.00006091713,0.9677072,0.005059214,0.003039816,0.01493329,0.0001197735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07360693,0.0001581728,0.9145641,0.01124015,0.0002911483,0.00006783254,0.000002745277,0.00002361934,0.00004529602],"genre_scores_gemma":[0.4628064,0.000002647744,0.5367565,0.0002210446,0.0001815138,4.440623e-7,5.580909e-7,0.000006517113,0.00002435902],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4198539,"threshold_uncertainty_score":0.4525138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}