{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Robert Beals","is_ca":false},{"name":"Harry Buhrman","is_ca":false},{"name":"Richard Cleve","is_ca":true},{"name":"Michele Mosca","is_ca":true},{"name":"Ronald de Wolf","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006232584,0.001857317,0.002334885,0.002694826,0.003415331,0.006590974,0.003120182,0.002903652,0.01692995],"category_scores_gemma":[0.03705572,0.001059604,0.003168443,0.003168053,0.007065006,0.01766459,0.006174786,0.009852874,0.003048357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006327237,"about_ca_system_score_gemma":0.003209651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003401101,"about_ca_topic_score_gemma":0.002789272,"domain_scores_codex":[0.991247,0.001865049,0.0002585332,0.001642501,0.002780796,0.002206173],"domain_scores_gemma":[0.9585397,0.03158835,0.001293303,0.005479728,0.002153786,0.0009451932],"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.0001517232,0.00006909026,0.0003136073,0.0001519656,0.00003017979,0.00005497189,0.0001434189,0.01957009,0.0009871871,0.9623296,0.005445418,0.01075282],"study_design_scores_gemma":[0.00003546177,0.00003459019,0.0001520937,0.0000429433,0.00002472625,0.00004432916,0.00002946362,0.08612014,0.0008685666,0.9080648,0.004560357,0.00002245944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08125713,0.009339121,0.7545679,0.01972074,0.001162331,0.00022287,0.001113186,0.001544762,0.131072],"genre_scores_gemma":[0.853158,0.006330944,0.1085043,0.003426362,0.002479444,0.0006780546,0.0008033321,0.001205624,0.02341389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01692995,"threshold_uncertainty_score":0.05663633,"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)","authors":[{"name":"Robin A. Moser","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002886405,0.00133565,0.001179972,0.002048715,0.002484264,0.003575466,0.002593233,0.001286494,0.01697149],"category_scores_gemma":[0.008677586,0.0009939995,0.002068537,0.001914218,0.005496642,0.004611745,0.006580953,0.004730647,0.004715377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001901713,"about_ca_system_score_gemma":0.002116103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00115354,"about_ca_topic_score_gemma":0.002124625,"domain_scores_codex":[0.9974287,0.0007497127,0.0001043543,0.0004640697,0.0009269655,0.0003260971],"domain_scores_gemma":[0.9951394,0.002702493,0.000234187,0.0006999753,0.0009432478,0.0002807346],"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.00004108459,0.00006081685,0.0001928993,0.0002048728,0.0000266331,0.0002130295,0.0003889145,0.003175395,0.003205662,0.9642188,0.007269904,0.0210021],"study_design_scores_gemma":[0.00008719756,0.00006480028,0.0002686583,0.0001096793,0.00006998073,0.0004260482,0.0001847725,0.01309757,0.005567458,0.9245849,0.05547221,0.00006673629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01296455,0.001662472,0.8981369,0.003431359,0.0006600666,0.0001738871,0.000436933,0.001183773,0.0813501],"genre_scores_gemma":[0.4710459,0.002993689,0.4815532,0.003698279,0.001340128,0.0006280179,0.0009277047,0.0009562234,0.03685676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01697149,"threshold_uncertainty_score":0.05677533,"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","authors":[{"name":"Andreǐ A. Bulatov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039638,0.001062075,0.001726628,0.002060372,0.002463088,0.006370883,0.002356482,0.002341533,0.01302575],"category_scores_gemma":[0.01506346,0.0007615853,0.003427427,0.002884744,0.006054336,0.01275586,0.004924457,0.01078844,0.001793865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0035235,"about_ca_system_score_gemma":0.001881288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001739468,"about_ca_topic_score_gemma":0.001254004,"domain_scores_codex":[0.9946779,0.001097672,0.0002824451,0.001122368,0.002154012,0.0006655491],"domain_scores_gemma":[0.9804007,0.01699543,0.0006746221,0.0008134098,0.0007067856,0.0004091511],"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.000139453,0.0001150158,0.0005150461,0.0003075032,0.00005596739,0.0001197092,0.0003747119,0.01475275,0.001345264,0.9472016,0.007054168,0.02801875],"study_design_scores_gemma":[0.00004267443,0.00004022825,0.0002859077,0.00005424004,0.00001803614,0.0001011036,0.00006563434,0.04952151,0.0008195988,0.9435154,0.005518297,0.00001727925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05274674,0.001830075,0.8615219,0.01060711,0.0002129511,0.0003497005,0.001170287,0.0005590213,0.07100215],"genre_scores_gemma":[0.6085934,0.004021517,0.3576058,0.004983801,0.001430844,0.002032176,0.003176625,0.0004230706,0.01773291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01302575,"threshold_uncertainty_score":0.04357553,"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","authors":[{"name":"Timothy J. Hickey","is_ca":false},{"name":"Qun Ju","is_ca":false},{"name":"M. H. van Emden","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001523986,0.001153851,0.0007694645,0.001486945,0.00106142,0.004573745,0.002494497,0.0009059979,0.01870722],"category_scores_gemma":[0.006281598,0.0004677167,0.00102218,0.00326001,0.002681909,0.005901007,0.002768384,0.002976558,0.00669607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001445281,"about_ca_system_score_gemma":0.001153958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001253559,"about_ca_topic_score_gemma":0.001133258,"domain_scores_codex":[0.9976802,0.0004395322,0.0002567012,0.0004496815,0.00102568,0.000148285],"domain_scores_gemma":[0.9983206,0.0005811781,0.0001891216,0.000413005,0.0004236225,0.00007242787],"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.00001417754,0.000007990341,0.00005135633,0.0001154665,0.000006979403,0.00002654602,0.00009342916,0.002370878,0.0003830274,0.962768,0.005853692,0.02830851],"study_design_scores_gemma":[0.0000155526,0.0000317546,0.0001131787,0.0001400813,0.000014178,0.0001943747,0.00008513196,0.01139311,0.001274355,0.760539,0.2261776,0.00002171148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002414939,0.003229158,0.8855579,0.0009014135,0.0005652936,0.0001473375,0.0007513836,0.0006125877,0.1058199],"genre_scores_gemma":[0.1172252,0.008198501,0.8364382,0.001128454,0.00110168,0.00062055,0.001900735,0.0005002244,0.03288654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01870722,"threshold_uncertainty_score":0.0625819,"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","authors":[{"name":"Jarosław Byrka","is_ca":false},{"name":"Fabrizio Grandoni","is_ca":false},{"name":"Thomas Rothvoß","is_ca":false},{"name":"Laura Sanità","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002837859,0.001507418,0.002104799,0.001095274,0.0009169897,0.001826876,0.002518049,0.001503093,0.003809268],"category_scores_gemma":[0.01170962,0.0008173664,0.00176645,0.001860553,0.001203391,0.002637625,0.002316183,0.003284559,0.001119094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0017985,"about_ca_system_score_gemma":0.00233835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002809953,"about_ca_topic_score_gemma":0.00281278,"domain_scores_codex":[0.9959338,0.001610978,0.0002005935,0.000608566,0.001005488,0.0006405159],"domain_scores_gemma":[0.9933723,0.004305067,0.0005126798,0.001167235,0.0004854154,0.000157303],"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.0007310292,0.0003268339,0.001066172,0.0002780743,0.0001363334,0.0002244791,0.0001977635,0.8105972,0.006636602,0.06754618,0.009339406,0.1029198],"study_design_scores_gemma":[0.00007794381,0.00005162478,0.00008015446,0.00001520301,0.00002063945,0.00004844226,0.00002324035,0.972343,0.001082324,0.02526216,0.0009857269,0.00000955365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0282081,0.0004675903,0.9619129,0.0005607992,0.00009299698,0.0001616794,0.0001796779,0.001669955,0.006746237],"genre_scores_gemma":[0.3496252,0.0004038781,0.6454604,0.0004008299,0.0001232488,0.0005189707,0.0005467247,0.0003293334,0.002591488],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003809268,"threshold_uncertainty_score":0.01500815,"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","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Jon Kleinberg","is_ca":false},{"name":"Prabhakar Raghavan","is_ca":false},{"name":"Madhu Sudan","is_ca":false},{"name":"David P. Williamson","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002067583,0.001133239,0.0009769757,0.0009800751,0.001026356,0.002164227,0.002223433,0.002068064,0.004368764],"category_scores_gemma":[0.008233792,0.0004429543,0.0009128402,0.001046623,0.00313169,0.003792701,0.00222125,0.002838732,0.0007820104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001907866,"about_ca_system_score_gemma":0.001181984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002797868,"about_ca_topic_score_gemma":0.001147456,"domain_scores_codex":[0.9980838,0.0006629736,0.00006923823,0.0003258961,0.0005748646,0.0002831402],"domain_scores_gemma":[0.9954118,0.002929593,0.0005896238,0.0004010744,0.0004185431,0.0002493954],"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.00001700411,0.0000185301,0.0003115771,0.00004104634,0.00003259057,0.00008619502,0.00007914696,0.2039317,0.0005058268,0.7880323,0.00183201,0.005112081],"study_design_scores_gemma":[0.000007059356,0.00003321754,0.0001082981,0.00001203198,0.00001212174,0.00004825796,0.00002317295,0.5855978,0.0001919365,0.4098574,0.004092102,0.00001662182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008077824,0.0006804004,0.9752727,0.001358457,0.0002922082,0.00004800205,0.0001366707,0.0001039138,0.01402982],"genre_scores_gemma":[0.8774977,0.003921445,0.09194903,0.001228355,0.00150818,0.0003243261,0.000255154,0.0000873979,0.02322835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004368764,"threshold_uncertainty_score":0.01461494,"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","authors":[{"name":"Ming Li","is_ca":true},{"name":"Bin Ma","is_ca":true},{"name":"Lusheng Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004705356,0.002735355,0.003858953,0.003485045,0.003116192,0.004420795,0.005137142,0.005322376,0.01227862],"category_scores_gemma":[0.03338671,0.001095331,0.002508814,0.01004381,0.005448339,0.01993572,0.006539696,0.008332925,0.004292056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002790643,"about_ca_system_score_gemma":0.002128113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003003068,"about_ca_topic_score_gemma":0.001770585,"domain_scores_codex":[0.9931073,0.002262999,0.0004722649,0.001631538,0.001937905,0.0005881224],"domain_scores_gemma":[0.9790701,0.01627814,0.0008306561,0.002288523,0.001003204,0.0005293948],"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.000790893,0.0003868366,0.001309627,0.000806519,0.0001553201,0.0003299323,0.000598982,0.1660438,0.001250052,0.544903,0.04592346,0.2375017],"study_design_scores_gemma":[0.000105861,0.00009279431,0.0001786048,0.0001049028,0.00003601711,0.0002532779,0.0001429365,0.1531081,0.0009227722,0.8295049,0.01551029,0.00003963572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02192403,0.01149669,0.9340395,0.008127998,0.0009029029,0.0002402139,0.0008362872,0.001216461,0.0212158],"genre_scores_gemma":[0.2131836,0.01410462,0.7360367,0.003697814,0.003475992,0.0007446285,0.00411024,0.001135226,0.02351131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01227862,"threshold_uncertainty_score":0.04107606,"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","authors":[{"name":"Gábor Tardos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001776797,0.0005850178,0.0008228034,0.001343494,0.0009038688,0.001398137,0.0016025,0.0018934,0.004036122],"category_scores_gemma":[0.01773137,0.0006076185,0.0006772132,0.001356855,0.001955607,0.003428605,0.00275741,0.001936731,0.001167054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001716066,"about_ca_system_score_gemma":0.001708385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00107367,"about_ca_topic_score_gemma":0.0008274667,"domain_scores_codex":[0.996524,0.0007813794,0.000169699,0.0006128481,0.001428528,0.0004834403],"domain_scores_gemma":[0.9887427,0.005109531,0.001395744,0.00337606,0.001011299,0.0003645463],"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.0003862248,0.0001173978,0.001746353,0.0002142189,0.00004796903,0.0000895976,0.00019346,0.1884106,0.009549839,0.6794097,0.004129354,0.1157054],"study_design_scores_gemma":[0.0001378092,0.0001982505,0.0006645739,0.00008231572,0.00003887893,0.0003280909,0.00004852483,0.6335838,0.009367535,0.3463561,0.009115036,0.00007904923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06035361,0.0009793486,0.9222658,0.0009906254,0.000131419,0.0001141033,0.0004443811,0.0006528841,0.01406784],"genre_scores_gemma":[0.7868714,0.001058092,0.2031933,0.0004544941,0.0001886501,0.0003628355,0.0005335773,0.0001436152,0.007194113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004036122,"threshold_uncertainty_score":0.01350218,"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","authors":[{"name":"Vincent Cohen-Addad","is_ca":false},{"name":"Varun Kanade","is_ca":false},{"name":"Frederik Mallmann-Trenn","is_ca":true},{"name":"Claire Mathieu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003429312,0.002612446,0.002875324,0.006708002,0.002982405,0.006115853,0.006056515,0.00269493,0.0275878],"category_scores_gemma":[0.01273325,0.001073756,0.003972859,0.008202929,0.001456734,0.005095282,0.005589416,0.002389646,0.02362363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003343682,"about_ca_system_score_gemma":0.004433169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009738219,"about_ca_topic_score_gemma":0.01697514,"domain_scores_codex":[0.9924628,0.001624363,0.0004931904,0.002461773,0.002420144,0.0005377101],"domain_scores_gemma":[0.9938301,0.001216544,0.0003931941,0.002348131,0.001975198,0.0002367984],"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.0002992357,0.0001673954,0.004265345,0.0017766,0.0008212059,0.0002866961,0.0007755331,0.07483504,0.004662727,0.1340771,0.2317518,0.5462813],"study_design_scores_gemma":[0.00008430688,0.0001190639,0.002808784,0.0005067384,0.0002821847,0.000586517,0.0007320257,0.3119563,0.00611871,0.2863572,0.3902747,0.0001735428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002632773,0.002177528,0.9594924,0.0007473163,0.0002957739,0.000735456,0.008067493,0.006840693,0.01901047],"genre_scores_gemma":[0.06916197,0.002484805,0.8647962,0.001100556,0.0003414628,0.001035596,0.03783154,0.00233954,0.02090835],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0275878,"threshold_uncertainty_score":0.0922904,"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","authors":[{"name":"Vincent Danos","is_ca":false},{"name":"Elham Kashefi","is_ca":false},{"name":"Prakash Panangaden","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003089341,0.0009592418,0.001035312,0.001663,0.003672781,0.005799835,0.002267695,0.002188535,0.01279735],"category_scores_gemma":[0.0053059,0.0007828499,0.001966286,0.002387449,0.005658161,0.01203376,0.005588052,0.005106103,0.004129234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002972225,"about_ca_system_score_gemma":0.002931227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003867798,"about_ca_topic_score_gemma":0.002327773,"domain_scores_codex":[0.9959632,0.000983765,0.0004434553,0.0009165315,0.00123831,0.0004547962],"domain_scores_gemma":[0.9978356,0.000860473,0.0001483902,0.0005143845,0.000507561,0.0001336405],"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.000002492334,0.000003381311,0.00002425983,0.00001605578,0.000002649651,0.00001987931,0.00007587464,0.0001570485,0.00008688822,0.9958062,0.001269714,0.002535611],"study_design_scores_gemma":[0.00000680889,0.000004859977,0.00003172935,0.00001965526,0.000007193583,0.00006887296,0.00004268421,0.001718039,0.0002746398,0.9534101,0.04440681,0.000008501112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007757349,0.00388815,0.7955721,0.005770702,0.001075784,0.0002653022,0.001331175,0.001057765,0.1832816],"genre_scores_gemma":[0.4812748,0.00690391,0.404011,0.005080267,0.002008001,0.001079701,0.002268882,0.0009223826,0.09645101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01279735,"threshold_uncertainty_score":0.04281139,"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","authors":[{"name":"Rafail Ostrovsky","is_ca":false},{"name":"Yuval Rabani","is_ca":false},{"name":"Leonard J. Schulman","is_ca":false},{"name":"Chaitanya Swamy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01032908,0.002069911,0.002452144,0.002573962,0.002165751,0.00394617,0.004857445,0.004114964,0.003192442],"category_scores_gemma":[0.04864528,0.001500118,0.001993753,0.002356225,0.003405437,0.00596827,0.004166868,0.003744483,0.001633201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002944557,"about_ca_system_score_gemma":0.003421683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006553896,"about_ca_topic_score_gemma":0.005160035,"domain_scores_codex":[0.9943504,0.002783767,0.0002949133,0.0008053196,0.001435943,0.000329735],"domain_scores_gemma":[0.9825193,0.01268532,0.0008956263,0.001714365,0.001682381,0.0005029521],"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.0003159616,0.0002196324,0.001842413,0.0003823439,0.0001578658,0.00009448543,0.0004428424,0.6936516,0.002059206,0.1723914,0.006618295,0.1218239],"study_design_scores_gemma":[0.00004710043,0.00007158265,0.0001399601,0.00004711022,0.0000143134,0.00004112081,0.00003869989,0.9356908,0.001112874,0.06030454,0.002467051,0.00002484417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005754602,0.0004963841,0.9902521,0.0003245521,0.00005870776,0.0000826612,0.00002901537,0.0002895258,0.002712403],"genre_scores_gemma":[0.1298261,0.0006841094,0.8651003,0.0003424932,0.0001593765,0.0003676894,0.0001872255,0.0003585848,0.002974262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01032908,"threshold_uncertainty_score":0.05462605,"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","authors":[{"name":"Libor Barto","is_ca":true},{"name":"Marcin Kozik","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005139999,0.001399969,0.001536759,0.001654157,0.001761537,0.003309875,0.005314791,0.001567008,0.0113546],"category_scores_gemma":[0.02791284,0.0009093415,0.0021037,0.002744591,0.003637148,0.008699419,0.00618017,0.005770674,0.001877381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001337714,"about_ca_system_score_gemma":0.001801642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001979824,"about_ca_topic_score_gemma":0.002983413,"domain_scores_codex":[0.9916672,0.003147523,0.0004053403,0.001851916,0.002121665,0.0008063253],"domain_scores_gemma":[0.961121,0.02662718,0.002331189,0.007327891,0.001856779,0.0007359929],"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.0005877318,0.0004997778,0.005716462,0.001461046,0.0003466892,0.0005457805,0.00114872,0.08757669,0.01181469,0.625686,0.01410128,0.2505151],"study_design_scores_gemma":[0.0001997701,0.0001444302,0.0005342817,0.0001221583,0.0001715827,0.0001933964,0.0002172681,0.4824812,0.01301857,0.4956824,0.007172257,0.0000626502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02545973,0.0003287245,0.9617592,0.0007856917,0.00005364494,0.0001070355,0.0002224565,0.002061023,0.00922256],"genre_scores_gemma":[0.532428,0.0004373391,0.4551973,0.0006478455,0.0002827524,0.0008267915,0.0007962642,0.0007809419,0.008602746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0113546,"threshold_uncertainty_score":0.03798491,"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","authors":[{"name":"Wenfei Fan","is_ca":false},{"name":"Leonid Libkin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009825457,0.001626623,0.001824364,0.002177781,0.003071408,0.006614729,0.002854351,0.003075841,0.006121113],"category_scores_gemma":[0.05507664,0.001943924,0.002345143,0.0056263,0.005850296,0.0210895,0.005149903,0.007096113,0.001045487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004876309,"about_ca_system_score_gemma":0.00393241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0112987,"about_ca_topic_score_gemma":0.00974946,"domain_scores_codex":[0.9844358,0.007217756,0.001392742,0.002130299,0.003752451,0.0010708],"domain_scores_gemma":[0.8988146,0.08855272,0.003968493,0.00428781,0.003573681,0.0008026639],"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.0001671058,0.0001108127,0.0007105806,0.000521152,0.00005875532,0.0009439238,0.0006154827,0.1610368,0.002159378,0.7908875,0.003859656,0.03892882],"study_design_scores_gemma":[0.00009012471,0.00007219196,0.0002242516,0.0002031772,0.00005376878,0.0005661089,0.0002932595,0.2441733,0.004473339,0.7311041,0.01869003,0.00005634661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02628368,0.001544959,0.9488677,0.005993593,0.0002032565,0.0003540715,0.0007994217,0.0004525343,0.01550082],"genre_scores_gemma":[0.3457747,0.004590786,0.6335754,0.001799133,0.0007950734,0.0009081019,0.002211789,0.0005062023,0.009838897],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0112987,"threshold_uncertainty_score":0.05196255,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001732215,0.0008935678,0.001586829,0.001717213,0.001153439,0.003406618,0.003032583,0.001743111,0.004700832],"category_scores_gemma":[0.01432714,0.0007219883,0.001149789,0.004783262,0.002109254,0.01036245,0.0033332,0.001988992,0.003137096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001715449,"about_ca_system_score_gemma":0.002210414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002688951,"about_ca_topic_score_gemma":0.003365817,"domain_scores_codex":[0.9963297,0.0007564528,0.0004270785,0.0008924361,0.00112105,0.0004732653],"domain_scores_gemma":[0.9916945,0.004156969,0.0005669447,0.002559929,0.0007775444,0.0002441314],"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.001993994,0.0003571077,0.002572204,0.0008752211,0.0001066619,0.0005653216,0.001375588,0.1630817,0.0398444,0.2976097,0.02348971,0.4681285],"study_design_scores_gemma":[0.0001867942,0.0002694005,0.0005494927,0.0001042275,0.00005400207,0.0004841162,0.0002311254,0.5128637,0.01228833,0.4580338,0.01485999,0.00007506116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1200477,0.002688652,0.8435944,0.001779389,0.000224579,0.0001714184,0.002134474,0.01404987,0.01530939],"genre_scores_gemma":[0.329333,0.0009796878,0.6566136,0.0004936987,0.0002794515,0.000364066,0.003968506,0.001387987,0.006580095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004700832,"threshold_uncertainty_score":0.01572585,"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","authors":[{"name":"Amos Beimel","is_ca":false},{"name":"Francesco Bergadano","is_ca":false},{"name":"Nader H. Bshouty","is_ca":true},{"name":"Eyal Kushilevitz","is_ca":false},{"name":"Stefano Varricchio","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001406796,0.0005548053,0.00102096,0.0009084996,0.0007636292,0.001195746,0.002143541,0.001182069,0.003299191],"category_scores_gemma":[0.01314833,0.0003638208,0.0009472074,0.0009731338,0.00149699,0.006509809,0.001685351,0.001975204,0.0004307005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001853962,"about_ca_system_score_gemma":0.000782278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002138838,"about_ca_topic_score_gemma":0.002217648,"domain_scores_codex":[0.9989859,0.0002320993,0.00006571834,0.0003434066,0.0002211913,0.000151606],"domain_scores_gemma":[0.9931366,0.004886003,0.0005704183,0.0008668691,0.000366849,0.0001731491],"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.0003846436,0.0001458336,0.005441482,0.0001846381,0.00005703388,0.0003065666,0.0003363865,0.3411321,0.006280007,0.523066,0.001878838,0.1207863],"study_design_scores_gemma":[0.00001187339,0.00003702882,0.0001366054,0.000006837374,0.000008553747,0.00005161167,0.00001648882,0.828723,0.001540238,0.1689597,0.0004981069,0.00001005266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1372405,0.0002388704,0.8582624,0.0005686405,0.00004196989,0.00004700225,0.0001871047,0.0006980248,0.002715655],"genre_scores_gemma":[0.8409901,0.0001954903,0.1544117,0.0001920075,0.00008210597,0.0001344955,0.0003152884,0.00008038546,0.003598384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003299191,"threshold_uncertainty_score":0.01345146,"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","authors":[{"name":"Ron Lavi","is_ca":false},{"name":"Chaitanya Swamy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01094289,0.001808166,0.002342056,0.001653727,0.0009865786,0.005004787,0.003399136,0.003795575,0.004782347],"category_scores_gemma":[0.04107239,0.001406615,0.002720351,0.002666103,0.004123594,0.00833075,0.003568198,0.005672557,0.0008647916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003158497,"about_ca_system_score_gemma":0.002467943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007217735,"about_ca_topic_score_gemma":0.0004666494,"domain_scores_codex":[0.9890647,0.00584228,0.0005494989,0.001638135,0.002069622,0.0008358697],"domain_scores_gemma":[0.977245,0.01636553,0.001397624,0.003714467,0.0008659965,0.0004113154],"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.0002102786,0.0001677095,0.000523499,0.0003121901,0.000126508,0.00011781,0.0002318769,0.4304048,0.002340372,0.5218276,0.002349554,0.0413878],"study_design_scores_gemma":[0.00006896989,0.00009708336,0.00008578286,0.00005256028,0.00002433938,0.00007863482,0.00002244876,0.6033554,0.00134514,0.3933219,0.001523625,0.00002413132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00657013,0.0003264429,0.9890642,0.0005682474,0.00003787463,0.00007969225,0.00007130364,0.0002872843,0.002994873],"genre_scores_gemma":[0.5267556,0.0008935611,0.4661659,0.0007666147,0.0002097455,0.0006414087,0.0002762231,0.0001873583,0.004103602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01094289,"threshold_uncertainty_score":0.05787224,"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","authors":[{"name":"Lyudmil Aleksandrov","is_ca":false},{"name":"Anil Maheshwari","is_ca":true},{"name":"Jörg-Rüdiger Sack","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008879039,0.00132615,0.001695771,0.001889476,0.0007914501,0.001397268,0.002047748,0.001416314,0.0029248],"category_scores_gemma":[0.007690911,0.0008965697,0.001136578,0.00234902,0.001079305,0.003242007,0.002277142,0.001373355,0.0006858253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152454,"about_ca_system_score_gemma":0.001108099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003983574,"about_ca_topic_score_gemma":0.004513556,"domain_scores_codex":[0.9984885,0.0003195217,0.0000855071,0.0003454526,0.0006108222,0.0001501346],"domain_scores_gemma":[0.9974958,0.001453674,0.0002387144,0.00040894,0.0003016675,0.0001010566],"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.0001182682,0.00003780038,0.000968413,0.000133587,0.00004074737,0.0001105551,0.0001363805,0.9023156,0.002796281,0.01949274,0.001327511,0.07252219],"study_design_scores_gemma":[0.00001172843,0.00002039617,0.00008380786,0.000007438626,0.000004161147,0.00003045154,0.00005557055,0.9665436,0.0007984279,0.03168632,0.0007524465,0.000005628764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05695695,0.0002030683,0.9405017,0.0001115288,0.00002823324,0.00008649098,0.0002313712,0.0007257094,0.001155014],"genre_scores_gemma":[0.34829,0.0003131821,0.647987,0.00004522495,0.00003029266,0.0002778771,0.001308074,0.0002793608,0.001468925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003983574,"threshold_uncertainty_score":0.00978446,"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","authors":[{"name":"David B. Shmoys","is_ca":false},{"name":"Chaitanya Swamy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004783104,0.001294255,0.001337965,0.0009363604,0.0007883624,0.002018912,0.001892138,0.001523663,0.003645635],"category_scores_gemma":[0.01372218,0.0006298666,0.001417071,0.001899459,0.001284239,0.002479015,0.002464965,0.004038658,0.0008697639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001992257,"about_ca_system_score_gemma":0.001936711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003491651,"about_ca_topic_score_gemma":0.003059454,"domain_scores_codex":[0.9975997,0.001116002,0.0001297017,0.0002443885,0.000686542,0.0002236654],"domain_scores_gemma":[0.9956813,0.00301802,0.0002682073,0.000538823,0.0003642342,0.0001293872],"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.0001362281,0.00006327338,0.0003134472,0.00008581772,0.00003145889,0.00006501467,0.0001407184,0.738718,0.001283323,0.194905,0.00200027,0.06225744],"study_design_scores_gemma":[0.00001481408,0.00002386084,0.00002307964,0.0000126741,0.000005362623,0.00001567408,0.00000710931,0.9650584,0.0002564825,0.03351323,0.001063718,0.000005622425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003562383,0.0002185842,0.993697,0.0002841484,0.00005935083,0.00004588132,0.00004483498,0.0002514855,0.001836424],"genre_scores_gemma":[0.1966185,0.0006609377,0.7986049,0.0002667151,0.0001513328,0.0003540354,0.0001997806,0.0001261123,0.00301766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004783104,"threshold_uncertainty_score":0.02529579,"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","authors":[{"name":"Kevin Leyton‐Brown","is_ca":true},{"name":"Eugene Nudelman","is_ca":false},{"name":"Yoav Shoham","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01056809,0.002053768,0.002355908,0.003657723,0.001293972,0.004810638,0.00563639,0.003521065,0.01499702],"category_scores_gemma":[0.08689384,0.001194237,0.002693808,0.002631382,0.0039288,0.01149124,0.002391045,0.006918444,0.00259283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003586657,"about_ca_system_score_gemma":0.001700116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002436,"about_ca_topic_score_gemma":0.00288833,"domain_scores_codex":[0.9917671,0.003030064,0.0004864,0.002175618,0.001670032,0.0008707102],"domain_scores_gemma":[0.9032117,0.07423607,0.006155157,0.01124255,0.003711027,0.001443628],"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.0002749367,0.0003150503,0.01477155,0.0004659286,0.0002629574,0.0001707315,0.0003694289,0.556791,0.0004170619,0.361701,0.02289889,0.04156154],"study_design_scores_gemma":[0.00004347104,0.00007389132,0.002034805,0.0000644387,0.000038374,0.0001291977,0.00006297457,0.7289229,0.0001927343,0.2641589,0.004243835,0.00003440768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1006465,0.002323694,0.8442644,0.007641329,0.0003691627,0.0004483114,0.004835372,0.001980562,0.03749061],"genre_scores_gemma":[0.8649176,0.001830989,0.1083161,0.001865554,0.0009481991,0.001610045,0.006648656,0.0007323038,0.01313047],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01499702,"threshold_uncertainty_score":0.05589008,"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","authors":[{"name":"Paul Beame","is_ca":false},{"name":"Paraschos Koutris","is_ca":false},{"name":"Dan Suciu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003970946,0.001363899,0.001381751,0.0009434355,0.002432597,0.003272889,0.00300795,0.001602061,0.007194223],"category_scores_gemma":[0.01783284,0.0009085615,0.001470283,0.002670432,0.001979321,0.008635825,0.003964625,0.003019598,0.001801415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002015316,"about_ca_system_score_gemma":0.002238621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00342472,"about_ca_topic_score_gemma":0.003134675,"domain_scores_codex":[0.9948691,0.001214203,0.0003459483,0.001044318,0.00180995,0.0007164894],"domain_scores_gemma":[0.9880492,0.007940753,0.0006061398,0.002041994,0.001032667,0.0003292821],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001455495,0.00055772,0.002395129,0.0007964535,0.0001942546,0.0003951969,0.001170417,0.4906895,0.01572586,0.2880273,0.01648192,0.1821108],"study_design_scores_gemma":[0.00009140948,0.000108259,0.0001842722,0.00001629071,0.00003735415,0.00009255246,0.0001664736,0.8066121,0.005283442,0.1826584,0.004727656,0.00002175203],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07550786,0.0009315846,0.9056692,0.00248205,0.0001720119,0.0003861458,0.00030698,0.002016405,0.01252782],"genre_scores_gemma":[0.4846696,0.0006254312,0.5028993,0.0007303961,0.0002463975,0.0008380392,0.0007648863,0.0006209838,0.008604835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007194223,"threshold_uncertainty_score":0.02406704,"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","authors":[{"name":"Valerie King","is_ca":true},{"name":"Jared Saia","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004941848,0.001431313,0.002219683,0.001098411,0.003345052,0.003427279,0.003895966,0.002305521,0.007312958],"category_scores_gemma":[0.01936636,0.0006657959,0.00149613,0.001030408,0.003820738,0.01043469,0.008190532,0.006539042,0.003830001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001724926,"about_ca_system_score_gemma":0.003355883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00103903,"about_ca_topic_score_gemma":0.0007958755,"domain_scores_codex":[0.9939178,0.0014436,0.0004163138,0.0008164056,0.002329882,0.001075943],"domain_scores_gemma":[0.9836426,0.005615021,0.002146003,0.006553615,0.001545981,0.0004968769],"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.003042164,0.0006460231,0.003822025,0.001121083,0.0003495796,0.0007057488,0.00270292,0.05361556,0.1471624,0.4894794,0.02102402,0.2763291],"study_design_scores_gemma":[0.0005814562,0.001075133,0.0009813249,0.0003185501,0.000195528,0.001131266,0.0007757517,0.3462787,0.1824556,0.3956091,0.0703501,0.0002474748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0537543,0.0004539896,0.9241758,0.002494776,0.0003052129,0.0004940758,0.0001789719,0.003933665,0.0142092],"genre_scores_gemma":[0.5928252,0.0004756343,0.3914685,0.0006666199,0.0001848067,0.0008353877,0.0003057646,0.001426046,0.0118121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007312958,"threshold_uncertainty_score":0.02613533,"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","authors":[{"name":"Bruce Reed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127681,0.0001883287,0.0004930252,0.0007928117,0.0005069122,0.001213927,0.0008555268,0.0007686891,0.003734874],"category_scores_gemma":[0.01513907,0.0003615063,0.0002285816,0.0008379942,0.0007660544,0.002322009,0.001053945,0.0006897877,0.0008418041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001076261,"about_ca_system_score_gemma":0.0008490996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001207216,"about_ca_topic_score_gemma":0.001666323,"domain_scores_codex":[0.9990163,0.000246831,0.0000362747,0.0001788484,0.0002953572,0.0002263256],"domain_scores_gemma":[0.9939693,0.003959205,0.0005176853,0.0006426409,0.0004805434,0.0004305405],"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.001591807,0.0001882792,0.0319655,0.0006123677,0.0001922649,0.0005293419,0.0005745748,0.3476055,0.04613889,0.359686,0.02747069,0.1834448],"study_design_scores_gemma":[0.0001299445,0.0002817945,0.01065106,0.00008914727,0.00007075324,0.0007613657,0.0002307066,0.758586,0.008502944,0.2113518,0.009274228,0.00007031875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6811479,0.002899147,0.2848557,0.003506045,0.0002390943,0.0001159136,0.002195911,0.001040865,0.02399931],"genre_scores_gemma":[0.9622296,0.0007103921,0.03211674,0.000300273,0.00009915618,0.0000716391,0.0007049791,0.0001319106,0.003635389],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003734874,"threshold_uncertainty_score":0.01249444,"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","authors":[{"name":"Marcelo Arenas","is_ca":true},{"name":"Leonid Libkin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02870125,0.001430822,0.001683536,0.006453341,0.002266741,0.01078014,0.00417277,0.003502863,0.005060656],"category_scores_gemma":[0.08525213,0.001340145,0.003028712,0.009620923,0.01887443,0.02657544,0.005448991,0.00829809,0.001744666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005306572,"about_ca_system_score_gemma":0.002925521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001448006,"about_ca_topic_score_gemma":0.001026479,"domain_scores_codex":[0.957243,0.01740416,0.005860485,0.00521352,0.01330019,0.0009787322],"domain_scores_gemma":[0.9400191,0.0342496,0.003868127,0.01348422,0.007563915,0.0008150239],"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.00001356354,0.00001493412,0.0001473941,0.00005219704,0.000008794408,0.000033458,0.0002318438,0.002157353,0.0002916906,0.9840077,0.0007571616,0.01228406],"study_design_scores_gemma":[0.000008162981,0.00002309376,0.00005262273,0.0000412044,0.000007091741,0.0001044569,0.00006213294,0.01048081,0.0007831471,0.9794612,0.008956778,0.00001933056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003004533,0.000529638,0.9891867,0.001566936,0.0001500439,0.0001321019,0.00017656,0.0002184852,0.005034947],"genre_scores_gemma":[0.09155771,0.00115669,0.8997121,0.0009830679,0.0008205055,0.0009064594,0.0005006398,0.0002863459,0.004076398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02870125,"threshold_uncertainty_score":0.1517885,"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","authors":[{"name":"Avrim Blum","is_ca":false},{"name":"Tüomas Sandholm","is_ca":false},{"name":"Martin Zinkevich","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003245012,0.002095091,0.002632175,0.001321312,0.002000291,0.00509732,0.004122524,0.003365085,0.02848087],"category_scores_gemma":[0.01577227,0.001171944,0.001828508,0.00298974,0.002098403,0.008345268,0.003700582,0.004165512,0.005991938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002676293,"about_ca_system_score_gemma":0.003589591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002067338,"about_ca_topic_score_gemma":0.002674145,"domain_scores_codex":[0.9951184,0.001613656,0.0003141276,0.001258673,0.001006669,0.0006884544],"domain_scores_gemma":[0.9912731,0.005488941,0.0005821435,0.001827755,0.0005597833,0.0002683061],"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.0003839128,0.0007637884,0.0006506891,0.0008008813,0.0001347032,0.0001747248,0.0002356574,0.2518408,0.00247332,0.5032596,0.02593066,0.2133514],"study_design_scores_gemma":[0.0002145942,0.0000883234,0.0001057347,0.0000495343,0.00003381117,0.0001575442,0.00006161793,0.5542467,0.001157416,0.4265428,0.01730982,0.00003211431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005162917,0.000740037,0.9712147,0.0007871157,0.0002329882,0.0003140385,0.0003194156,0.001704293,0.0195244],"genre_scores_gemma":[0.1925534,0.001237436,0.7888958,0.000779687,0.0004483172,0.0009026271,0.001267091,0.0008020258,0.01311357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02848087,"threshold_uncertainty_score":0.09527797,"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","authors":[{"name":"Timothy M. Chan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009830114,0.00193961,0.002018114,0.001391309,0.001459262,0.003379012,0.005087808,0.001771309,0.01977351],"category_scores_gemma":[0.005807155,0.001036207,0.001657487,0.004666917,0.0015948,0.01345036,0.005276066,0.002624405,0.006185221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002308747,"about_ca_system_score_gemma":0.001783356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005937607,"about_ca_topic_score_gemma":0.01006124,"domain_scores_codex":[0.9964818,0.0003656994,0.0002472097,0.0006797874,0.001534842,0.0006906064],"domain_scores_gemma":[0.9938663,0.001916995,0.0004351718,0.003126733,0.0004044976,0.0002503058],"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.003964763,0.0007249655,0.003173765,0.0009472134,0.0002748621,0.0005076692,0.0008632924,0.1451444,0.05096832,0.06766508,0.06606752,0.659698],"study_design_scores_gemma":[0.001162312,0.000502896,0.001703206,0.00009367649,0.000287154,0.001021313,0.0006533336,0.6829229,0.06184665,0.2027449,0.04691023,0.0001514207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09474459,0.001989265,0.837627,0.003806828,0.0002850405,0.0004578991,0.00381929,0.03307312,0.02419699],"genre_scores_gemma":[0.440813,0.001088911,0.5254131,0.0006821676,0.0002571942,0.0005703285,0.007798114,0.002976398,0.02040084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01977351,"threshold_uncertainty_score":0.066149,"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","authors":[{"name":"S. Gorbunov","is_ca":false},{"name":"Vinod Vaikuntanathan","is_ca":false},{"name":"Hoeteck Wee","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001259637,0.0004877292,0.0007195454,0.0006508668,0.00104706,0.002809507,0.001192213,0.0009936321,0.004825727],"category_scores_gemma":[0.004854007,0.0003024464,0.0009344678,0.001594478,0.001586569,0.006071779,0.00232892,0.003381693,0.001025563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002973002,"about_ca_system_score_gemma":0.00118178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008240819,"about_ca_topic_score_gemma":0.000759849,"domain_scores_codex":[0.9980043,0.000473671,0.0001560628,0.000307982,0.0008012909,0.0002567619],"domain_scores_gemma":[0.9974619,0.001121513,0.0001721173,0.0009256214,0.0002382299,0.00008056396],"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.00005901189,0.00002407866,0.000109657,0.00006683817,0.000006546579,0.0000390608,0.0001211861,0.007029821,0.001830083,0.9706035,0.002043895,0.01806623],"study_design_scores_gemma":[0.00004546968,0.00005151318,0.0001549613,0.00003946675,0.00001755197,0.0001692777,0.00003471143,0.08097684,0.004650062,0.8932077,0.02062904,0.00002340266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02923334,0.001037871,0.9446054,0.002083489,0.0001215789,0.0001957331,0.000764616,0.0007029162,0.0212551],"genre_scores_gemma":[0.6700697,0.00156509,0.3101694,0.0008209355,0.0002396392,0.0005707657,0.0008451709,0.0001420419,0.01557731],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004825727,"threshold_uncertainty_score":0.02157074,"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","authors":[{"name":"Mohab Safey El Din","is_ca":false},{"name":"Éric Schost","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002133626,0.001243334,0.001724627,0.00154645,0.001469362,0.003436196,0.002987503,0.00237012,0.005302954],"category_scores_gemma":[0.0146472,0.0009691359,0.002013971,0.002926074,0.001746266,0.008758543,0.004010193,0.00223474,0.001761006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002436525,"about_ca_system_score_gemma":0.004649623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003831382,"about_ca_topic_score_gemma":0.005669147,"domain_scores_codex":[0.9960173,0.0006076543,0.0003919775,0.001340583,0.001085547,0.0005569334],"domain_scores_gemma":[0.9893816,0.007185249,0.0005965419,0.001860823,0.0006791736,0.0002966886],"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.002265885,0.000556203,0.007246769,0.001229708,0.0002778887,0.0002616223,0.0008242303,0.1856047,0.02575248,0.1134806,0.02735187,0.6351481],"study_design_scores_gemma":[0.0003115495,0.0003349827,0.001580629,0.00004696344,0.0001109922,0.0004256031,0.0002771898,0.7530506,0.01082884,0.2270308,0.005913952,0.00008801852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08647081,0.0007090764,0.8973249,0.001175945,0.00008030667,0.0002662141,0.00116218,0.008069834,0.004740736],"genre_scores_gemma":[0.4655534,0.0003597662,0.5272084,0.0003635306,0.0001422426,0.0003487698,0.003342846,0.0006280066,0.002052982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005302954,"threshold_uncertainty_score":0.01774019,"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","authors":[{"name":"Lauri Hella","is_ca":false},{"name":"Leonid Libkin","is_ca":true},{"name":"Juha Nurmonen","is_ca":false},{"name":"Limsoon Wong","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003905231,0.001015618,0.0007517916,0.001873035,0.002109552,0.004282627,0.002292642,0.001247003,0.004313672],"category_scores_gemma":[0.008460006,0.0008420833,0.00299367,0.002922645,0.004508467,0.01311238,0.004859605,0.003951532,0.0007612943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002341091,"about_ca_system_score_gemma":0.001254293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002966114,"about_ca_topic_score_gemma":0.002415497,"domain_scores_codex":[0.9958884,0.001125917,0.0004080583,0.0008175395,0.001303683,0.0004564758],"domain_scores_gemma":[0.9938075,0.003662389,0.0006740722,0.0009211595,0.0005702227,0.0003646312],"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.00003540987,0.00003409162,0.0003300905,0.0001047385,0.00003010762,0.0001457811,0.000379855,0.004990988,0.001344933,0.973257,0.001215104,0.01813181],"study_design_scores_gemma":[0.00002625341,0.00004433189,0.0001454209,0.00003378013,0.00007189836,0.0002141786,0.0001128799,0.02415367,0.002216026,0.9527496,0.02020705,0.00002501828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02592067,0.0008149419,0.9394845,0.001681396,0.0001585314,0.0001314309,0.0003246232,0.0009415688,0.03054235],"genre_scores_gemma":[0.4372976,0.001300047,0.5461806,0.001745019,0.0007502301,0.0003418438,0.0006140641,0.0002523751,0.01151816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004313672,"threshold_uncertainty_score":0.02065313,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006562036,0.0009049817,0.0008419825,0.0009228029,0.001609464,0.002909152,0.001749465,0.0008803269,0.00807234],"category_scores_gemma":[0.00604815,0.0005417709,0.001196937,0.001202241,0.002152243,0.006989599,0.003322846,0.002307541,0.0009213774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00230838,"about_ca_system_score_gemma":0.001065097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003086283,"about_ca_topic_score_gemma":0.00353184,"domain_scores_codex":[0.9988632,0.0001216847,0.00004999469,0.000322864,0.0003226344,0.0003195941],"domain_scores_gemma":[0.9934124,0.002810681,0.001145834,0.00105727,0.0009754362,0.0005983214],"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.0004126276,0.0001005897,0.003886221,0.0003144343,0.00005367866,0.0002206217,0.0006829223,0.02822821,0.01597047,0.9147733,0.003988394,0.03136857],"study_design_scores_gemma":[0.00006590276,0.0001952059,0.0019852,0.0000458694,0.00009268552,0.0004174818,0.0002975033,0.06923608,0.01062698,0.8976608,0.01932067,0.00005573786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3386099,0.001008635,0.6140152,0.00175986,0.0001626661,0.0001734249,0.001182704,0.001202991,0.04188477],"genre_scores_gemma":[0.9041152,0.0008547378,0.08033966,0.0004407545,0.000111501,0.0001675477,0.0007544981,0.000358985,0.01285711],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00807234,"threshold_uncertainty_score":0.02700472,"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","authors":[{"name":"Timothy M. Chan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00156814,0.0009614959,0.00237091,0.001983565,0.002067772,0.002752073,0.005893496,0.001961146,0.007327477],"category_scores_gemma":[0.01094966,0.001249873,0.001596905,0.004760856,0.001860649,0.008079945,0.007836561,0.002894826,0.003411871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001954763,"about_ca_system_score_gemma":0.002578992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002981155,"about_ca_topic_score_gemma":0.003885075,"domain_scores_codex":[0.9965867,0.0004237773,0.000399608,0.0006989636,0.001558619,0.0003323311],"domain_scores_gemma":[0.9925635,0.001673202,0.000643571,0.003894929,0.0008331597,0.0003916226],"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.001798795,0.0008508137,0.003989939,0.0006661648,0.0001758642,0.0004360455,0.0006519273,0.1954479,0.02826419,0.2050124,0.06251624,0.5001898],"study_design_scores_gemma":[0.0003827981,0.0004453953,0.0005447753,0.00006373932,0.00006089019,0.0004295713,0.0001577281,0.8269182,0.01454447,0.1190874,0.03722724,0.0001377119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01360449,0.0004472016,0.975055,0.0008574957,0.0001651625,0.0002302435,0.001720108,0.005632168,0.002288193],"genre_scores_gemma":[0.1924306,0.0003900201,0.7944791,0.0005208132,0.0002344203,0.001137778,0.005799183,0.0007907459,0.004217348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007327477,"threshold_uncertainty_score":0.02451283,"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","authors":[{"name":"Rahul Jain","is_ca":false},{"name":"Zhengfeng Ji","is_ca":true},{"name":"Sarvagya Upadhyay","is_ca":true},{"name":"John Watrous","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001905762,0.0005557892,0.0007787235,0.0004886143,0.001621095,0.003258911,0.002009716,0.001155309,0.01609198],"category_scores_gemma":[0.008176011,0.0004183588,0.001245783,0.0008595044,0.002843172,0.008644913,0.003737742,0.004898279,0.002226532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001878174,"about_ca_system_score_gemma":0.002505103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002051227,"about_ca_topic_score_gemma":0.002169448,"domain_scores_codex":[0.9966307,0.0007335077,0.0001747624,0.0009420394,0.001075059,0.0004438489],"domain_scores_gemma":[0.9931622,0.003866514,0.000336643,0.001589856,0.0007454016,0.0002994537],"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.00007962015,0.00005070743,0.0002623578,0.0002540323,0.00002455042,0.0000552278,0.0001689887,0.006837224,0.001313216,0.9700272,0.006075602,0.01485122],"study_design_scores_gemma":[0.00002607634,0.00001979006,0.00009894843,0.00001138551,0.00001184433,0.0000710227,0.00003034417,0.02375953,0.002389333,0.9630796,0.01049124,0.00001088945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04903954,0.0005594891,0.801716,0.007727723,0.0002962356,0.0003382536,0.002057734,0.00202433,0.1362407],"genre_scores_gemma":[0.7392603,0.0008582214,0.2132672,0.002968216,0.0005383861,0.0005946743,0.002905891,0.0008406024,0.03876661],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01609198,"threshold_uncertainty_score":0.05383301,"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","authors":[{"name":"Michael Benedikt","is_ca":false},{"name":"Leonid Libkin","is_ca":true},{"name":"Thomas Schwentick","is_ca":false},{"name":"Luc Segoufin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003686951,0.0007011025,0.0008069732,0.001573977,0.001483144,0.006055765,0.002357538,0.001847663,0.006157507],"category_scores_gemma":[0.01445242,0.0006612833,0.002116705,0.002482676,0.005977697,0.01745045,0.002388905,0.003779812,0.0007271271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003678406,"about_ca_system_score_gemma":0.001624068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003111702,"about_ca_topic_score_gemma":0.001602485,"domain_scores_codex":[0.994727,0.001428077,0.0004018471,0.001105489,0.001731508,0.0006060692],"domain_scores_gemma":[0.9848241,0.01100934,0.001264074,0.001512904,0.0009208349,0.0004687291],"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.00001822316,0.00002699559,0.000150495,0.00003871531,0.000005399083,0.00005484898,0.0002709059,0.002815193,0.0007319785,0.9925715,0.0002422591,0.0030734],"study_design_scores_gemma":[0.00001291627,0.00002438549,0.0000877371,0.00001189205,0.000008849748,0.00009354309,0.00008419974,0.02095069,0.001126426,0.9744716,0.003114639,0.00001313201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1265285,0.001398241,0.8399268,0.003419395,0.000129227,0.0001848982,0.0005415824,0.001170344,0.02670101],"genre_scores_gemma":[0.7647955,0.001391675,0.2216718,0.001076671,0.0004099603,0.0003426604,0.000772805,0.0002596965,0.009279211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006157507,"threshold_uncertainty_score":0.02668887,"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","authors":[{"name":"Mika Göös","is_ca":true},{"name":"Juho Hirvonen","is_ca":false},{"name":"Jukka Suomela","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009631013,0.003753762,0.004654894,0.002820285,0.003280357,0.007433627,0.007962259,0.004430557,0.0165603],"category_scores_gemma":[0.06049491,0.001318001,0.004973833,0.004655046,0.005019392,0.0196953,0.0097666,0.01230786,0.005399267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006936437,"about_ca_system_score_gemma":0.00349001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001881217,"about_ca_topic_score_gemma":0.002219224,"domain_scores_codex":[0.9828269,0.00401073,0.0009972241,0.004728192,0.004539538,0.002897426],"domain_scores_gemma":[0.9369403,0.04133091,0.002596165,0.01404684,0.003318045,0.001767827],"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.00225988,0.0006660101,0.00590822,0.002096498,0.0005190447,0.0004013643,0.00134855,0.3731632,0.01142225,0.4381051,0.02052538,0.1435847],"study_design_scores_gemma":[0.000137525,0.0003346574,0.0007394127,0.0002306384,0.0002316044,0.0004132229,0.0002155964,0.7171947,0.006006942,0.2629605,0.01146595,0.00006919706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03278032,0.005446719,0.9196613,0.004315569,0.000412604,0.0002687158,0.0007601205,0.003085786,0.03326886],"genre_scores_gemma":[0.6422859,0.004161965,0.3275966,0.002750118,0.001344118,0.001685095,0.002108805,0.003251741,0.01481564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0165603,"threshold_uncertainty_score":0.05539966,"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","authors":[{"name":"Omar Fawzi","is_ca":true},{"name":"Patrick Hayden","is_ca":true},{"name":"Pranab Kumar Sen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001871854,0.0008394495,0.000818148,0.0008310038,0.0008460053,0.003369062,0.001167528,0.001384692,0.004896002],"category_scores_gemma":[0.01027035,0.0005580484,0.0008497673,0.000844,0.003377446,0.007490501,0.005197643,0.00356419,0.0007112636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001671247,"about_ca_system_score_gemma":0.0006044029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005146146,"about_ca_topic_score_gemma":0.0003368203,"domain_scores_codex":[0.9969267,0.0009738964,0.0002142838,0.0005789815,0.0009844032,0.0003216989],"domain_scores_gemma":[0.9944488,0.002867875,0.0007176272,0.001189997,0.0004630783,0.0003126989],"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.00006294888,0.00002069319,0.0001490771,0.00004823448,0.000007801007,0.00005749193,0.000175874,0.01041652,0.00226859,0.9790992,0.0003602619,0.007333449],"study_design_scores_gemma":[0.00002622443,0.00006874469,0.0001645077,0.0000220027,0.000007911774,0.0001141171,0.00008013205,0.06180004,0.004671682,0.9304228,0.002585797,0.00003600726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1387766,0.0009584666,0.8361061,0.0009518984,0.00009959256,0.00009931029,0.0002797725,0.0003599092,0.02236833],"genre_scores_gemma":[0.8977415,0.0006004268,0.09337117,0.0002786227,0.0001366168,0.0001833788,0.0002846282,0.0001748644,0.007228863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004896002,"threshold_uncertainty_score":0.01637882,"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","authors":[{"name":"Valerie King","is_ca":true},{"name":"Jared Saia","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007255043,0.001659464,0.002645,0.001080415,0.002680078,0.004094701,0.003640887,0.002382648,0.005990475],"category_scores_gemma":[0.02415221,0.0007712866,0.001448477,0.002137219,0.004086218,0.01039964,0.004840862,0.004709468,0.001862353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003229814,"about_ca_system_score_gemma":0.004681703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001470496,"about_ca_topic_score_gemma":0.002272729,"domain_scores_codex":[0.9888731,0.003564264,0.000497766,0.002116549,0.002702655,0.002245591],"domain_scores_gemma":[0.9757416,0.01532231,0.001794382,0.004674195,0.001624043,0.0008433473],"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.0009816501,0.0003676557,0.0012215,0.0004266341,0.0001697326,0.0002871141,0.0009914859,0.2173005,0.009075728,0.679177,0.009580135,0.0804208],"study_design_scores_gemma":[0.0001706519,0.0001109444,0.00008606478,0.00002254003,0.00003861939,0.0001049817,0.00007508694,0.4470498,0.004454006,0.543695,0.004167071,0.00002518878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03080481,0.0002254058,0.9581211,0.001432545,0.000127975,0.0002148568,0.0001408305,0.001706326,0.007226223],"genre_scores_gemma":[0.6329104,0.0002892609,0.3518996,0.0005591652,0.0002123895,0.0005822977,0.0004292411,0.000627632,0.01249001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007255043,"threshold_uncertainty_score":0.03836882,"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","authors":[{"name":"Ashwin Nayak","is_ca":true},{"name":"Julia Salzman","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008175037,0.001473279,0.00154084,0.001555389,0.002029408,0.006230766,0.004407336,0.003450779,0.01008233],"category_scores_gemma":[0.05081261,0.001069844,0.001138348,0.001548271,0.009112164,0.02089632,0.006444431,0.006596027,0.001462904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002482418,"about_ca_system_score_gemma":0.001304479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005425807,"about_ca_topic_score_gemma":0.0003017244,"domain_scores_codex":[0.9939058,0.001988644,0.0003413022,0.0009598238,0.001810285,0.0009940906],"domain_scores_gemma":[0.9163561,0.0707278,0.003112085,0.006552524,0.002141963,0.001109541],"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.0001912803,0.0000899673,0.0001672496,0.0001848149,0.0000243451,0.00008123583,0.000260774,0.0338144,0.00443803,0.946009,0.001125804,0.01361311],"study_design_scores_gemma":[0.00004016568,0.0001149125,0.0001127402,0.00006555808,0.00002757787,0.0001601493,0.00009291372,0.2089552,0.006033881,0.7820369,0.002313509,0.00004643447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1188696,0.002422753,0.8071761,0.005609913,0.000359673,0.0001567706,0.0002396092,0.0006123176,0.06455326],"genre_scores_gemma":[0.897713,0.00264981,0.08968253,0.0007727709,0.0006253723,0.0005314586,0.0001558972,0.0003027216,0.007566395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01008233,"threshold_uncertainty_score":0.04323423,"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","authors":[{"name":"Andris Ambainis","is_ca":true},{"name":"Leonard J. Schulman","is_ca":false},{"name":"Umesh Vazirani","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001761629,0.0004184987,0.0007978395,0.0005940755,0.001235902,0.003301663,0.001045876,0.001082104,0.00362114],"category_scores_gemma":[0.0068527,0.0005195859,0.0005915823,0.0006040688,0.003586001,0.006433023,0.003614258,0.001912821,0.0008240619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001078753,"about_ca_system_score_gemma":0.0008124262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000424145,"about_ca_topic_score_gemma":0.0006846084,"domain_scores_codex":[0.9985738,0.0005901293,0.00007431208,0.0002278358,0.0003256378,0.0002082918],"domain_scores_gemma":[0.9964756,0.001603664,0.0002410166,0.001251138,0.0002461192,0.0001823581],"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.0006698844,0.0001102132,0.001397375,0.0001084154,0.00006656803,0.0002212973,0.0003118721,0.04944338,0.01142397,0.9206588,0.001071558,0.01451671],"study_design_scores_gemma":[0.00005173351,0.00008185746,0.0003042424,0.00002326987,0.00002351921,0.00009041787,0.00007639005,0.4074527,0.01041473,0.5792388,0.002210534,0.00003188243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.497512,0.0004515265,0.4695644,0.001785301,0.0001027566,0.0001090613,0.0002443928,0.0009121348,0.02931852],"genre_scores_gemma":[0.9539161,0.00009475555,0.04272992,0.0001851789,0.00003152942,0.00009040215,0.00008230055,0.00005522621,0.002814672],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00362114,"threshold_uncertainty_score":0.01211387,"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","authors":[{"name":"Philippe Chaput","is_ca":true},{"name":"Vincent Danos","is_ca":false},{"name":"Prakash Panangaden","is_ca":true},{"name":"Gordon Plotkin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003943745,0.0007281125,0.001118663,0.001554226,0.0007003389,0.00192868,0.001489687,0.0009910346,0.002219581],"category_scores_gemma":[0.01419924,0.0005113946,0.001655529,0.0009098788,0.00227552,0.003380787,0.002233939,0.001884082,0.0003700592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002583124,"about_ca_system_score_gemma":0.001242628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006513045,"about_ca_topic_score_gemma":0.004333989,"domain_scores_codex":[0.9975878,0.0008696347,0.0001580816,0.0004059082,0.000759731,0.0002189693],"domain_scores_gemma":[0.9949275,0.003417826,0.0004412423,0.0006601374,0.0003736338,0.0001796807],"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.00007260319,0.00003021499,0.001522481,0.00006613333,0.00005897832,0.0001096672,0.0002590328,0.4063548,0.001941645,0.5761127,0.0003796316,0.01309204],"study_design_scores_gemma":[0.000004302296,0.00001481751,0.0001042344,0.000007942142,0.000008487536,0.00001726484,0.00001298589,0.8623143,0.000464483,0.1366326,0.0004105342,0.000007987048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02193282,0.0001349358,0.9754848,0.0001124005,0.00002338702,0.00001942611,0.00003344749,0.0002234347,0.002035301],"genre_scores_gemma":[0.734889,0.0004352426,0.2598196,0.0001224816,0.00009173968,0.0001478043,0.0002105826,0.0002285207,0.004054966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006513045,"threshold_uncertainty_score":0.02085674,"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","authors":[{"name":"Nathanael Ackerman","is_ca":false},{"name":"Cameron E. Freer","is_ca":false},{"name":"Daniel M. Roy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01374839,0.001234988,0.001661779,0.003041105,0.002216912,0.006207878,0.003305896,0.002312545,0.003900673],"category_scores_gemma":[0.09768727,0.001266943,0.002847426,0.002521435,0.01869365,0.01845659,0.007349228,0.00999931,0.0006188614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004651802,"about_ca_system_score_gemma":0.002279315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003642422,"about_ca_topic_score_gemma":0.001657983,"domain_scores_codex":[0.9864444,0.006351691,0.000631224,0.002928984,0.002765951,0.0008777278],"domain_scores_gemma":[0.8625879,0.1214108,0.002980938,0.009423663,0.002572849,0.001023834],"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.00002412109,0.0000111917,0.0003601091,0.00004505253,0.00001471043,0.00005524954,0.0001801513,0.01195606,0.000159435,0.9835538,0.0002636495,0.003376666],"study_design_scores_gemma":[0.000007329762,0.000005875593,0.0001092761,0.00001896516,0.000006155766,0.00002769053,0.00001538153,0.03699999,0.0002130822,0.9620566,0.000530026,0.000009786236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03078669,0.0009617466,0.9529188,0.003496293,0.00008488116,0.00006706033,0.0003116358,0.0003848551,0.01098802],"genre_scores_gemma":[0.8073764,0.001455976,0.1843067,0.0009384222,0.0005035329,0.0004133646,0.0006557056,0.0004013091,0.003948506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01374839,"threshold_uncertainty_score":0.07270932,"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","authors":[{"name":"Peyman Afshani","is_ca":false},{"name":"Jérémy Barbay","is_ca":false},{"name":"Timothy M. Chan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003635866,0.001992124,0.002542991,0.00145992,0.001457729,0.005080204,0.005920951,0.004080112,0.01122631],"category_scores_gemma":[0.02298791,0.001225693,0.003058874,0.003218879,0.003013962,0.009832761,0.005715763,0.005785974,0.002832747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004633675,"about_ca_system_score_gemma":0.003760589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001607429,"about_ca_topic_score_gemma":0.00227638,"domain_scores_codex":[0.9906651,0.001730799,0.0005501379,0.003464986,0.002050965,0.001538059],"domain_scores_gemma":[0.9827297,0.008788132,0.001235671,0.005729986,0.0008369851,0.0006795179],"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.0008743035,0.000611184,0.003479837,0.0006933348,0.0002843555,0.0001239046,0.0003499839,0.4973261,0.006554353,0.3021393,0.02089972,0.1666636],"study_design_scores_gemma":[0.0002067336,0.0001728221,0.0004572048,0.00004173397,0.00008517068,0.0001533487,0.00006465616,0.6930882,0.003788431,0.2932637,0.00864506,0.00003303303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05086394,0.0009345208,0.9165161,0.002004318,0.0002304727,0.0003712715,0.001127544,0.004299013,0.02365282],"genre_scores_gemma":[0.4049731,0.0006281073,0.5809316,0.001188015,0.0003728566,0.0005075702,0.002557785,0.001135033,0.007705938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01122631,"threshold_uncertainty_score":0.03755569,"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","authors":[{"name":"Julien Cassaigne","is_ca":false},{"name":"James D. Currie","is_ca":true},{"name":"Luke Schaeffer","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003703098,0.0005456055,0.0008035486,0.0004147636,0.002357219,0.001592937,0.001243957,0.001121991,0.01004756],"category_scores_gemma":[0.003109022,0.0004811873,0.0008686085,0.0005607591,0.001786342,0.00316262,0.002058253,0.001076779,0.002556138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005040265,"about_ca_system_score_gemma":0.0009723767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009613685,"about_ca_topic_score_gemma":0.001446355,"domain_scores_codex":[0.9992736,0.000136705,0.00008022675,0.0001839348,0.000144295,0.0001813081],"domain_scores_gemma":[0.996837,0.001308678,0.0005309782,0.0006181581,0.0003860651,0.0003190839],"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.001629522,0.0002860532,0.0037987,0.0009024257,0.0001062495,0.00384056,0.003144748,0.01094801,0.1711293,0.7495317,0.005740033,0.04894276],"study_design_scores_gemma":[0.0001758701,0.0004704409,0.001550732,0.0001854676,0.0002233151,0.002525878,0.001090162,0.04007656,0.1154517,0.7921139,0.0459663,0.0001696398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7428551,0.000360698,0.1993369,0.000804747,0.0005068375,0.00008824834,0.0002711294,0.0006629151,0.05511337],"genre_scores_gemma":[0.8897981,0.0002476094,0.08476414,0.0002693392,0.00005945789,0.0002057901,0.0003380667,0.000374791,0.02394272],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01004756,"threshold_uncertainty_score":0.03361243,"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","authors":[{"name":"EsperetLouis","is_ca":false},{"name":"MorinPat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003267278,0.0003138121,0.0002880539,0.0005251492,0.001002718,0.001064648,0.0008301531,0.0005412063,0.005771394],"category_scores_gemma":[0.003220163,0.000233439,0.0003097751,0.001031311,0.001124614,0.002326122,0.001487967,0.001036186,0.001074061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009083876,"about_ca_system_score_gemma":0.0006330126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001671017,"about_ca_topic_score_gemma":0.001884639,"domain_scores_codex":[0.9995598,0.0001071921,0.00001614209,0.000111838,0.0001240487,0.00008101353],"domain_scores_gemma":[0.9982252,0.0008144338,0.0002270404,0.0004613103,0.0001825489,0.00008956115],"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.0001174835,0.00005338752,0.0007440015,0.000208533,0.00001128561,0.00009682713,0.000273211,0.04345078,0.01807395,0.8251806,0.006567616,0.1052222],"study_design_scores_gemma":[0.00001851264,0.00008240071,0.0005746249,0.00003396797,0.00002212362,0.0002450578,0.0001453022,0.121427,0.009774224,0.8412416,0.02640367,0.00003145187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1349722,0.0005504345,0.8202918,0.00122666,0.00009823206,0.00007448517,0.000431604,0.001431214,0.04092338],"genre_scores_gemma":[0.6639266,0.0008098314,0.3221421,0.000374185,0.00008936493,0.0001241218,0.000689414,0.0002667089,0.0115777],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005771394,"threshold_uncertainty_score":0.01930726,"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","authors":[{"name":"Jiangzhuo Chen","is_ca":false},{"name":"Robert Kleinberg","is_ca":false},{"name":"László Lovász","is_ca":false},{"name":"Rajmohan Rajaraman","is_ca":false},{"name":"Ravi Sundaram","is_ca":false},{"name":"Adrian Vetta","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004272271,0.00222305,0.001638926,0.002399939,0.002021489,0.004107007,0.002652502,0.001606688,0.007916282],"category_scores_gemma":[0.02475592,0.001207663,0.002170797,0.002404887,0.003959335,0.01210924,0.005508597,0.006537986,0.001456292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002608886,"about_ca_system_score_gemma":0.001816551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001743991,"about_ca_topic_score_gemma":0.001553399,"domain_scores_codex":[0.9966109,0.0006880189,0.0001671545,0.0008657321,0.000951443,0.0007167356],"domain_scores_gemma":[0.9806671,0.01406346,0.001274282,0.001572154,0.001510166,0.0009127663],"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.0006445833,0.0004536698,0.002840043,0.001265681,0.0001579375,0.0004636074,0.001452223,0.2411902,0.01352984,0.6578488,0.0106215,0.06953188],"study_design_scores_gemma":[0.00007174101,0.0001701319,0.0008621003,0.0001477519,0.00009532234,0.0003104763,0.0003570277,0.414921,0.00644907,0.5684115,0.008147313,0.00005657079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09222925,0.002602713,0.8675771,0.002018973,0.000176975,0.0002472666,0.0006628212,0.0007909667,0.03369396],"genre_scores_gemma":[0.7211766,0.004004462,0.2628692,0.0009690095,0.0006625405,0.0006690917,0.001256968,0.0004863846,0.007905684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007916282,"threshold_uncertainty_score":0.02648258,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003355641,0.001081376,0.00107528,0.002362246,0.001388215,0.004474808,0.002053911,0.001400322,0.003666709],"category_scores_gemma":[0.02403886,0.0005701437,0.002079555,0.005418752,0.004128254,0.0125226,0.003566324,0.005383845,0.0004094607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004032889,"about_ca_system_score_gemma":0.001211521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003475634,"about_ca_topic_score_gemma":0.001989592,"domain_scores_codex":[0.9967043,0.001253484,0.0002321113,0.0005808622,0.0009617326,0.0002674805],"domain_scores_gemma":[0.9809022,0.01565786,0.0009030264,0.001233472,0.0009001594,0.0004032859],"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.00003303633,0.00003168356,0.0004641,0.00005970963,0.000009868231,0.00007140162,0.0002087088,0.01817453,0.0009019515,0.9637756,0.0007305163,0.01553906],"study_design_scores_gemma":[0.00001419735,0.00001879847,0.0001858672,0.00002202165,0.00001315397,0.00008634869,0.00007216657,0.1209235,0.0009125451,0.87525,0.00248583,0.00001555748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1357297,0.001527615,0.8304188,0.004759877,0.00009112382,0.0001177356,0.0004847382,0.0004775021,0.02639296],"genre_scores_gemma":[0.7703515,0.00195059,0.2156628,0.000720183,0.0004631313,0.0004401215,0.000732802,0.0002026926,0.009476233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004474808,"threshold_uncertainty_score":0.02926081,"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","authors":[{"name":"Jeffrey Scott Vitter","is_ca":false},{"name":"D. A. W. Hutchinson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001965139,0.0005702214,0.0007308599,0.0009978171,0.001316593,0.00195614,0.002635094,0.001060981,0.005010111],"category_scores_gemma":[0.008058168,0.0005052942,0.0006759791,0.001910631,0.001563198,0.003986348,0.002718671,0.001591771,0.001320442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002097847,"about_ca_system_score_gemma":0.003678902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002670234,"about_ca_topic_score_gemma":0.00274465,"domain_scores_codex":[0.9980544,0.0005246471,0.0001144231,0.0003920121,0.0005929112,0.0003216589],"domain_scores_gemma":[0.9957481,0.001387144,0.0003445467,0.001669438,0.0006142578,0.0002364823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001320321,0.0003574137,0.003233226,0.0002404902,0.00005506257,0.0001255652,0.0003497047,0.2688794,0.01745911,0.4443592,0.01097813,0.2526425],"study_design_scores_gemma":[0.0002165065,0.0002707581,0.0003059676,0.00002148125,0.00002835833,0.0001994825,0.00007506458,0.7837684,0.01889759,0.1799139,0.01625949,0.00004302628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06270707,0.0002253403,0.921627,0.0006205223,0.00009921163,0.0002421464,0.00018765,0.003984408,0.01030667],"genre_scores_gemma":[0.5850619,0.0002251835,0.4004987,0.0005426665,0.00009483475,0.0005046042,0.0005120398,0.0006164001,0.01194364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005010111,"threshold_uncertainty_score":0.01676047,"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","authors":[{"name":"Tao Jiang","is_ca":false},{"name":"Ming Li","is_ca":false},{"name":"Paul Vitányi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004498467,0.002523179,0.002591961,0.00233966,0.002756153,0.008153888,0.007047123,0.003291881,0.02705561],"category_scores_gemma":[0.04173655,0.00137467,0.003524386,0.003217919,0.003965102,0.0198868,0.007335639,0.007116184,0.004134068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00551085,"about_ca_system_score_gemma":0.003849316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003015751,"about_ca_topic_score_gemma":0.003806806,"domain_scores_codex":[0.9904051,0.001434282,0.0005905465,0.002132989,0.002954945,0.002481996],"domain_scores_gemma":[0.9576651,0.02611803,0.002170096,0.009269569,0.002321276,0.002455959],"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.002799406,0.0009883357,0.00911434,0.001398639,0.0004550608,0.000874507,0.0009032406,0.2629202,0.05715222,0.4918139,0.03925802,0.1323221],"study_design_scores_gemma":[0.0001028827,0.0002363825,0.001639328,0.0001254623,0.0001744946,0.000883203,0.000143117,0.6555274,0.01588533,0.3163457,0.008831108,0.0001056015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2511092,0.002982211,0.6285833,0.008169143,0.0007443528,0.0002779496,0.002112726,0.006279151,0.09974202],"genre_scores_gemma":[0.8455578,0.001846582,0.1278825,0.00183206,0.001112607,0.0005836061,0.001969128,0.003270801,0.01594487],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02705561,"threshold_uncertainty_score":0.09051007,"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","authors":[{"name":"Johan Håstad","is_ca":false},{"name":"Benjamin Rossman","is_ca":true},{"name":"Rocco A. Servedio","is_ca":false},{"name":"Li-Yang Tan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002959972,0.0008417054,0.00136272,0.001676037,0.001779123,0.003856182,0.00301456,0.001476569,0.007117067],"category_scores_gemma":[0.01796636,0.0009279427,0.002485832,0.001709217,0.003711142,0.0135034,0.00449646,0.005188354,0.0008311108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004447208,"about_ca_system_score_gemma":0.001482775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003255289,"about_ca_topic_score_gemma":0.00287965,"domain_scores_codex":[0.9949479,0.0006946236,0.0002000376,0.001209586,0.00176638,0.001181395],"domain_scores_gemma":[0.98408,0.01048307,0.0009719752,0.002376229,0.001149188,0.0009395973],"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.0003709092,0.0001290801,0.003503029,0.0003043817,0.0001010377,0.00029641,0.0006944785,0.03557498,0.01169799,0.9060469,0.005306453,0.03597441],"study_design_scores_gemma":[0.00007050685,0.0000822865,0.001106297,0.00003793004,0.00009890572,0.0004386138,0.00008158434,0.1772418,0.006821498,0.8085996,0.005365641,0.00005531202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1676845,0.001785526,0.7918363,0.004055237,0.0001074769,0.0001431607,0.001002301,0.001079265,0.03230637],"genre_scores_gemma":[0.9303669,0.001130127,0.06095772,0.001178211,0.0003983889,0.0001966956,0.0004792786,0.0002424569,0.005050182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007117067,"threshold_uncertainty_score":0.03226691,"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","authors":[{"name":"Li Chen","is_ca":false},{"name":"Rasmus Kyng","is_ca":false},{"name":"Yang P. Liu","is_ca":false},{"name":"Richard Peng","is_ca":true},{"name":"Maximilian Probst Gutenberg","is_ca":false},{"name":"Sushant Sachdeva","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008527552,0.001451514,0.000858074,0.00112196,0.0007607565,0.00160168,0.001660569,0.001278007,0.006065302],"category_scores_gemma":[0.00734357,0.000596755,0.000925791,0.001527571,0.0008578877,0.003903002,0.001396515,0.001656682,0.001521091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00203123,"about_ca_system_score_gemma":0.002605347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006270859,"about_ca_topic_score_gemma":0.007973064,"domain_scores_codex":[0.9990153,0.0001756613,0.00006251939,0.000295905,0.0002881627,0.0001623733],"domain_scores_gemma":[0.9978009,0.001137769,0.0002046608,0.0004757608,0.0002952723,0.00008565202],"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.0005218068,0.0002208712,0.002127318,0.0003125757,0.00009184873,0.0001324299,0.0002324252,0.6082665,0.008890172,0.06833792,0.01352262,0.2973436],"study_design_scores_gemma":[0.00003736656,0.00002567975,0.0002387086,0.00001256042,0.00001063953,0.00004999516,0.00003671374,0.9297438,0.002854004,0.06524307,0.001737905,0.000009506412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04239456,0.0002350104,0.9448634,0.0005138129,0.00006095308,0.0001612174,0.000623652,0.004620914,0.006526465],"genre_scores_gemma":[0.2914569,0.0001518704,0.701928,0.0001795113,0.00006781746,0.0002246437,0.001796857,0.0007996465,0.003394816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006270859,"threshold_uncertainty_score":0.02029049,"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","authors":[{"name":"Fabian Wirth","is_ca":false},{"name":"Sonja Stüdli","is_ca":false},{"name":"Jia Yuan Yu","is_ca":true},{"name":"M. Corless","is_ca":false},{"name":"Robert Shorten","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001700978,0.0007975333,0.001299613,0.000616595,0.0007362626,0.001498167,0.001928219,0.001302706,0.002863445],"category_scores_gemma":[0.004426892,0.0007198512,0.0007795878,0.001112885,0.001693689,0.001393641,0.002362296,0.00189775,0.0003596113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001915068,"about_ca_system_score_gemma":0.001926415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007945681,"about_ca_topic_score_gemma":0.007735048,"domain_scores_codex":[0.9990682,0.0003330417,0.00004320697,0.0002043371,0.0001940734,0.0001571282],"domain_scores_gemma":[0.9974065,0.001834815,0.0003134161,0.0001250751,0.0001786411,0.0001415676],"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.00002882847,0.0000154522,0.0002180617,0.00002726886,0.0000163396,0.00003344534,0.0000264661,0.9643102,0.0002132158,0.02903826,0.00023062,0.005841893],"study_design_scores_gemma":[0.0000071007,0.000006195568,0.00002883555,0.000002603691,0.000002023425,0.000005814078,0.000003605399,0.9881584,0.00007274107,0.01154043,0.000169266,0.000002999506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01200636,0.000143595,0.98524,0.0002108142,0.00002805318,0.00003492517,0.00004914578,0.0001387999,0.002148306],"genre_scores_gemma":[0.7103977,0.0003091983,0.2819351,0.0001592342,0.00006171894,0.0002606569,0.0001635027,0.0001025672,0.006610251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007945681,"threshold_uncertainty_score":0.01579887,"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","authors":[{"name":"Hassan Ashtiani","is_ca":true},{"name":"Shai Ben-David","is_ca":true},{"name":"Nicholas J. A. Harvey","is_ca":true},{"name":"Christopher Liaw","is_ca":true},{"name":"Abbas Mehrabian","is_ca":true},{"name":"Yaniv Plan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01047842,0.003214525,0.003248774,0.002781563,0.001214715,0.003760573,0.004301035,0.003439352,0.00525301],"category_scores_gemma":[0.08424353,0.00137759,0.00200798,0.002680292,0.004930072,0.01131969,0.008592726,0.008715078,0.001436618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004284321,"about_ca_system_score_gemma":0.002872596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001568001,"about_ca_topic_score_gemma":0.001637437,"domain_scores_codex":[0.9915192,0.002335581,0.000432923,0.001254246,0.003672842,0.0007851595],"domain_scores_gemma":[0.940284,0.04835927,0.002263736,0.005657926,0.002257438,0.001177673],"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.000886512,0.0003259648,0.002209328,0.0004727708,0.000172939,0.0002205142,0.0002850481,0.6549283,0.008278436,0.2288228,0.005548103,0.09784938],"study_design_scores_gemma":[0.00003093786,0.00007933752,0.0002356871,0.00004405093,0.0000193389,0.00007928858,0.00001889634,0.9194166,0.002427734,0.07667058,0.0009514858,0.00002610928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01285719,0.001381834,0.9792024,0.001157477,0.00007993784,0.0001442177,0.0001897668,0.0007400642,0.004247062],"genre_scores_gemma":[0.4839809,0.002889719,0.5007073,0.001693138,0.0009300708,0.001262014,0.001441146,0.0009778836,0.006117815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01047842,"threshold_uncertainty_score":0.05541587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}