{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":33,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":33,"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":"d33bc4190225","filters":{"venue":"ACM Transactions on Computation Theory"}},"results":[{"id":"W2177209050","doi":"10.1145/2633600","title":"(Leveled) Fully Homomorphic Encryption without Bootstrapping","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1374,"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; Defense Advanced Research Projects Agency; Simons Foundation","keywords":"Homomorphic encryption; Bootstrapping (finance); Learning with errors; Security parameter; Computation; Computer science; Polynomial; Encryption; Mathematics; Bounded function; Theoretical computer science; Cryptography; Algorithm","authors":[{"name":"Zvika Brakerski","is_ca":false},{"name":"Craig Gentry","is_ca":false},{"name":"Vinod Vaikuntanathan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01778963680264913,"gpt":0.250754521302626,"spread":0.2329648844999769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008720102,0.0003283707,0.0005134245,0.0003180274,0.0003647891,0.001505961,0.00117565,0.0009926765,0.004683305],"category_scores_gemma":[0.002773503,0.0003124662,0.0007345431,0.0003749689,0.001275297,0.004842899,0.003395664,0.001872231,0.001337462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006407868,"about_ca_system_score_gemma":0.0005790838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001673386,"about_ca_topic_score_gemma":0.000228598,"domain_scores_codex":[0.9985733,0.0002668823,0.0001127727,0.0002801625,0.0005412912,0.0002255835],"domain_scores_gemma":[0.997701,0.0003676707,0.0001429893,0.0015193,0.0002032976,0.0000658584],"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.000509425,0.0002575377,0.001778506,0.0004191237,0.0001120669,0.0005396477,0.0004518023,0.04454598,0.1230578,0.6142939,0.007470474,0.2065638],"study_design_scores_gemma":[0.000147062,0.0005978196,0.001236783,0.00009263132,0.00007376056,0.001274567,0.0001175687,0.429552,0.1644324,0.3684865,0.03385859,0.0001302849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0533529,0.000294727,0.9340293,0.0004916609,0.0000826589,0.0001569123,0.0003248942,0.001522392,0.009744519],"genre_scores_gemma":[0.6579852,0.0001673665,0.3347612,0.0005243026,0.00006881329,0.000162984,0.0003405737,0.00009837516,0.005891276],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004683305,"threshold_uncertainty_score":0.01566726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570115677","doi":"10.1145/2189778.2189780","title":"Complexity Theory for Operators in Analysis","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":60,"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":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computer science; Algebra over a field; Theoretical computer science; Pure mathematics","authors":[{"name":"Akitoshi Kawamura","is_ca":false},{"name":"Stephen Cook","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04978698707724363,"gpt":0.3141534168676975,"spread":0.2643664297904539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00467283,0.00138194,0.001318164,0.002988781,0.001972815,0.005750876,0.002415966,0.001879918,0.006051918],"category_scores_gemma":[0.01228772,0.0006095701,0.003940758,0.00324199,0.007538635,0.01633357,0.004154347,0.007466988,0.0008974295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005304294,"about_ca_system_score_gemma":0.001549746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002308572,"about_ca_topic_score_gemma":0.001263339,"domain_scores_codex":[0.9940118,0.002154132,0.0004188131,0.0009375902,0.001984284,0.0004933716],"domain_scores_gemma":[0.9845882,0.01179374,0.0005832365,0.001680185,0.001045031,0.0003095053],"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.00000510063,0.000005902428,0.00005767918,0.00004671862,0.000007397968,0.00001730342,0.00007233335,0.002692843,0.0001148621,0.9944187,0.0004171235,0.002143988],"study_design_scores_gemma":[0.000004347996,0.000006582299,0.00004071472,0.0000113312,0.000005235684,0.00001836273,0.00002090068,0.01153632,0.0001132601,0.9844826,0.003754969,0.000005498836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00972975,0.001953656,0.9602966,0.004370055,0.0002049298,0.00008740831,0.0003004281,0.0001935773,0.02286361],"genre_scores_gemma":[0.538418,0.004322264,0.4353035,0.002056329,0.002077468,0.001039178,0.00101642,0.0003546963,0.01541223],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006051918,"threshold_uncertainty_score":0.03848553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2569934227","doi":"10.1145/2493252.2493256","title":"Quantum rejection sampling","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Army Research Office; Defense Advanced Research Projects Agency","keywords":"Quantum algorithm; Mathematics; Quantum state; Quantum sort; Quantum; Quantum phase estimation algorithm; Quantum operation; Algorithm; Computer science; Quantum error correction; Open quantum system; Quantum mechanics; Physics","authors":[{"name":"Māris Ozols","is_ca":true},{"name":"Martin Roetteler","is_ca":false},{"name":"Jérémie Roland","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01902076159639874,"gpt":0.2617099762310813,"spread":0.2426892146346825,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00355043,0.0008633359,0.00146943,0.0007767548,0.001234102,0.002685503,0.00272627,0.002023064,0.01460404],"category_scores_gemma":[0.01665063,0.0005341827,0.001494266,0.00127781,0.00319445,0.005118372,0.003557311,0.002813458,0.002165618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00198593,"about_ca_system_score_gemma":0.002095279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001239965,"about_ca_topic_score_gemma":0.001335296,"domain_scores_codex":[0.9950995,0.001940378,0.0002193993,0.0009525384,0.001261463,0.0005266967],"domain_scores_gemma":[0.989418,0.005935901,0.0005319222,0.002939525,0.0008411799,0.0003334391],"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.0006989387,0.0002004703,0.001266772,0.0003021761,0.00009958455,0.000214721,0.0002211399,0.06839679,0.005369461,0.8370648,0.009658908,0.07650618],"study_design_scores_gemma":[0.0001313988,0.0001382957,0.0002648472,0.00004128748,0.00003161919,0.0001740824,0.00005843618,0.4686325,0.005721853,0.515677,0.009086553,0.00004220134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01796583,0.0003730974,0.9665637,0.000923697,0.0001534543,0.0002725011,0.0002944504,0.0007254829,0.01272788],"genre_scores_gemma":[0.5754649,0.0004808383,0.407344,0.001165531,0.0002881701,0.0007221426,0.0008876396,0.000476428,0.01317015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01460404,"threshold_uncertainty_score":0.04885536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007316622","doi":"10.1145/1714450.1714452","title":"Formula Caching in DPLL","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Division of Mathematical Sciences; National Science Foundation","keywords":"DPLL algorithm; Satisfiability; Mathematical proof; Resolution (logic); Computer science; Tree (set theory); Simple (philosophy); Algorithm; Mathematics; Conjunctive normal form; Boolean satisfiability problem; Discrete mathematics; Theoretical computer science; Combinatorics","authors":[{"name":"Paul Beame","is_ca":false},{"name":"Russell Impagliazzo","is_ca":false},{"name":"Toniann Pitassi","is_ca":true},{"name":"Nathan Segerlind","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01995854238267281,"gpt":0.3078544586707602,"spread":0.2878959162880874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005051133,0.0006886104,0.0009634431,0.001006119,0.001141886,0.002895481,0.003492397,0.001504453,0.004568826],"category_scores_gemma":[0.02089678,0.001033964,0.001651281,0.001399692,0.004059237,0.008888124,0.00455141,0.003429163,0.0009323966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003147678,"about_ca_system_score_gemma":0.002753441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00461025,"about_ca_topic_score_gemma":0.004490906,"domain_scores_codex":[0.9941227,0.002346417,0.0004184666,0.00102592,0.001402827,0.0006836985],"domain_scores_gemma":[0.9831844,0.009237937,0.0009454257,0.005335792,0.0009784857,0.000317924],"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.0003503781,0.000235035,0.002801926,0.0004966746,0.0001050398,0.0004978457,0.0009174953,0.05331985,0.01230086,0.786289,0.00403028,0.1386556],"study_design_scores_gemma":[0.0001698619,0.0002204983,0.0004244287,0.0001430243,0.0001408632,0.0005307226,0.0001724554,0.391146,0.03686035,0.5272406,0.04285038,0.0001007841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02524156,0.0004146793,0.9615686,0.0007220451,0.00007012037,0.0002153087,0.0001403169,0.004476594,0.007150777],"genre_scores_gemma":[0.3450761,0.0003738141,0.6471751,0.0007259331,0.00008268342,0.0003051427,0.0003037942,0.0007348429,0.00522252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005051133,"threshold_uncertainty_score":0.02671325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169488047","doi":"10.1145/2462896.2462897","title":"On the usefulness of predicates","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Predicate (mathematical logic); Mathematics; Combinatorics; Conjecture; Discrete mathematics; Randomness; Negation; Pairwise comparison; Constraint satisfaction problem; Computer science","authors":[{"name":"Per Austrin","is_ca":false},{"name":"Johan Håstad","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03124524853413456,"gpt":0.2423059758492957,"spread":0.2110607273151611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0112537,0.001511264,0.001579607,0.002599086,0.002925223,0.005908276,0.003132695,0.002507867,0.00429029],"category_scores_gemma":[0.04021939,0.00137179,0.002652173,0.003115417,0.01201314,0.01939375,0.008594171,0.007202914,0.0007688397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002251085,"about_ca_system_score_gemma":0.001512123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008860992,"about_ca_topic_score_gemma":0.0006081272,"domain_scores_codex":[0.9840369,0.007658626,0.0009952171,0.00263232,0.003197254,0.001479724],"domain_scores_gemma":[0.9370248,0.0479554,0.002609148,0.008735788,0.002329969,0.00134488],"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.00009544308,0.00002996409,0.0005043854,0.0001380344,0.0000234347,0.0001629297,0.0004403057,0.0102897,0.0008426257,0.9763494,0.001106267,0.01001749],"study_design_scores_gemma":[0.00004472316,0.00009602986,0.0003364566,0.00009122063,0.00005823273,0.0003876021,0.0001856083,0.04633072,0.00204552,0.9370075,0.01338398,0.00003240181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08384963,0.003318812,0.8610669,0.006372548,0.0003019959,0.0002293771,0.0006950495,0.0007016548,0.04346401],"genre_scores_gemma":[0.7968336,0.002500223,0.1869368,0.002069459,0.001195283,0.0006242978,0.0008801875,0.0005733859,0.008386749],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0112537,"threshold_uncertainty_score":0.05951595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963295189","doi":"10.1145/3134757","title":"Asking the Metaquestions in Constraint Tractability","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Constraint Satisfaction and Optimization","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":"Champlain Regional College; Université du Québec à Montréal","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Homomorphism; Algebraic structure; Bounded function; Discrete mathematics; Combinatorics; Set (abstract data type); Time complexity; Class (philosophy); Computational complexity theory; Computer science; Algorithm; Pure mathematics","authors":[{"name":"Hubie Chen","is_ca":false},{"name":"Benoît Larose","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02786421801486547,"gpt":0.2971308006780909,"spread":0.2692665826632255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01013959,0.0013555,0.002045066,0.002073341,0.002829009,0.007135168,0.003447368,0.004941555,0.01194522],"category_scores_gemma":[0.09485053,0.001376377,0.00367942,0.004021193,0.007833669,0.02841053,0.003879378,0.01421287,0.001608675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004678247,"about_ca_system_score_gemma":0.002569983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002432835,"about_ca_topic_score_gemma":0.002329815,"domain_scores_codex":[0.9866326,0.007211979,0.0006119235,0.002828389,0.002031483,0.0006835529],"domain_scores_gemma":[0.8068678,0.1795662,0.0037919,0.006083912,0.002564973,0.001125182],"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.0002461741,0.0002220931,0.00291698,0.0008575752,0.0001622923,0.0002448816,0.0005989865,0.03377462,0.0007331523,0.9041322,0.0193633,0.03674772],"study_design_scores_gemma":[0.00003772126,0.00002350938,0.0003402446,0.00006531848,0.00001966153,0.00007108582,0.0001166223,0.02521169,0.0003142331,0.9693468,0.004434942,0.00001829502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1275748,0.01158797,0.5955034,0.2006378,0.001115447,0.0003157812,0.00301312,0.001263299,0.05898841],"genre_scores_gemma":[0.718387,0.007552267,0.2385424,0.01193031,0.00626734,0.001001848,0.00340637,0.001047641,0.0118648],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01194522,"threshold_uncertainty_score":0.05362391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134098997","doi":"10.1145/2077336.2077337","title":"Pebbles and Branching Programs for Tree Evaluation","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Combinatorics; Upper and lower bounds; Mathematics; Branching (polymer chemistry); Boolean function; Tree (set theory); Binary decision diagram; Discrete mathematics; Algorithm","authors":[{"name":"Stephen Cook","is_ca":true},{"name":"Pierre McKenzie","is_ca":true},{"name":"Dustin Wehr","is_ca":true},{"name":"Mark Braverman","is_ca":true},{"name":"Rahul Santhanam","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06058992463226921,"gpt":0.3174479788893818,"spread":0.2568580542571126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001595841,0.0009338738,0.0008248358,0.0008024581,0.001516634,0.002742752,0.001651718,0.001457829,0.008183741],"category_scores_gemma":[0.01020702,0.0006396144,0.001820912,0.001603148,0.003773959,0.007465299,0.002979793,0.005769375,0.0009755066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003237847,"about_ca_system_score_gemma":0.002372783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003986632,"about_ca_topic_score_gemma":0.004539011,"domain_scores_codex":[0.9973049,0.0006792643,0.0001620911,0.0006225616,0.0006460443,0.0005851613],"domain_scores_gemma":[0.9932249,0.005152234,0.000389483,0.0006612052,0.0003782745,0.0001937792],"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.0003540585,0.0002374551,0.001598879,0.0004005904,0.00003624563,0.0001614249,0.0007621502,0.06221687,0.01151481,0.8280143,0.003464689,0.09123848],"study_design_scores_gemma":[0.00006392246,0.00009808294,0.0003401013,0.00006052196,0.00003555867,0.0001036737,0.00014095,0.1880659,0.01040712,0.7938229,0.006824645,0.00003660383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08122671,0.0004557138,0.9010868,0.001892559,0.00006375406,0.0001957326,0.000277937,0.002124257,0.01267655],"genre_scores_gemma":[0.4823763,0.0006112,0.5042002,0.0008404449,0.000124171,0.0007519781,0.0008258849,0.000732836,0.009536934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008183741,"threshold_uncertainty_score":0.02737737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989790471","doi":"10.1145/3470867","title":"The Complexity of Promise SAT on Non-Boolean Domains","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"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; European Commission","keywords":"Unary operation; Constraint satisfaction problem; Cover (algebra); Algebraic number; Constraint satisfaction; Fragment (logic); Theory of computation; Benchmark (surveying)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.04378162892982987,"gpt":0.3176665229709127,"spread":0.2738848940410828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00200685,0.0006874652,0.001371708,0.0008599795,0.00123575,0.005960122,0.002780493,0.002180071,0.008784687],"category_scores_gemma":[0.01400124,0.0007607631,0.00189902,0.002329155,0.002742081,0.01257824,0.002882304,0.005275285,0.0008088413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003186164,"about_ca_system_score_gemma":0.001724278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003782653,"about_ca_topic_score_gemma":0.002984097,"domain_scores_codex":[0.996758,0.0009094524,0.00015569,0.0006171614,0.0009420492,0.0006177108],"domain_scores_gemma":[0.9783719,0.01860981,0.0009007876,0.001124825,0.0004830461,0.0005096204],"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.0008772913,0.0002799894,0.00478703,0.001097137,0.0001840736,0.0004334253,0.0008102038,0.1701284,0.004257324,0.761109,0.0144243,0.04161181],"study_design_scores_gemma":[0.0001098425,0.0000455209,0.001824442,0.00005149435,0.00004601516,0.0002235315,0.0002204393,0.2429675,0.001563464,0.74914,0.003775651,0.00003210195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6067284,0.004176442,0.2911071,0.03246455,0.0002478182,0.0002161744,0.006648987,0.0009475845,0.05746304],"genre_scores_gemma":[0.9462223,0.001949052,0.03956033,0.0006832537,0.0004799565,0.0002343506,0.002732523,0.0002080923,0.007930128],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008784687,"threshold_uncertainty_score":0.02938771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914834722","doi":"10.1145/3305270","title":"Distribution Testing Lower Bounds via Reductions from Communication Complexity","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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":"Mathematical proof; Mathematics; Simple (philosophy); Measure (data warehouse); Connection (principal bundle); Distribution (mathematics); Upper and lower bounds; Property testing; Reduction (mathematics); Communication complexity; Identity (music); Discrete mathematics; Interpolation (computer graphics); Operator (biology); Sample (material); Combinatorics; Computer science; Mathematical analysis","authors":[{"name":"Eric Blais","is_ca":true},{"name":"Clément L. Canonne","is_ca":false},{"name":"Tom Gur","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03901239018548829,"gpt":0.2696844975486102,"spread":0.2306721073631219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01028929,0.002619114,0.00264787,0.003235546,0.001984047,0.005789091,0.005555704,0.00280657,0.01044376],"category_scores_gemma":[0.05996327,0.001124689,0.004917704,0.00296578,0.006844166,0.01903731,0.009789989,0.0152033,0.001405636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005811102,"about_ca_system_score_gemma":0.003002095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001672252,"about_ca_topic_score_gemma":0.001073047,"domain_scores_codex":[0.9857996,0.004267417,0.0005708757,0.002207776,0.005642448,0.001511876],"domain_scores_gemma":[0.8983299,0.08687904,0.00250221,0.007263021,0.00359109,0.00143471],"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.0001324703,0.0001403859,0.001035084,0.0002818964,0.00005970916,0.0001544478,0.0003811319,0.05114324,0.002854163,0.9173284,0.003494941,0.02299428],"study_design_scores_gemma":[0.0000252902,0.00006014611,0.0002843032,0.00004429798,0.00002743564,0.00008515345,0.00004979634,0.1972938,0.002168198,0.7974148,0.002516735,0.00002997174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01956043,0.0006200604,0.957035,0.003419127,0.000132787,0.0001792549,0.0003718106,0.0004707147,0.01821082],"genre_scores_gemma":[0.6900926,0.001492579,0.2879364,0.002522673,0.001469285,0.002010894,0.001137999,0.001206729,0.01213084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01044376,"threshold_uncertainty_score":0.05441558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2784736141","doi":"10.1145/3170711","title":"Randomized Communication versus Partition Number","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Mathematics; Communication complexity; Partition (number theory); Combinatorics; Randomized algorithm; Upper and lower bounds; Discrete mathematics; Clique; Set (abstract data type); Computer science","authors":[{"name":"Mika Göös","is_ca":false},{"name":"T. S. Jayram","is_ca":false},{"name":"Toniann Pitassi","is_ca":true},{"name":"Thomas Watson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04074193019947035,"gpt":0.3162857808016349,"spread":0.2755438506021645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004864907,0.001651775,0.002056653,0.001275772,0.002316042,0.004700623,0.004672136,0.002759707,0.0172594],"category_scores_gemma":[0.04869736,0.001027893,0.001360004,0.002197646,0.004218678,0.01273168,0.005000607,0.006190276,0.002200488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00548745,"about_ca_system_score_gemma":0.005018327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001562564,"about_ca_topic_score_gemma":0.002813632,"domain_scores_codex":[0.9874548,0.004535701,0.0003558993,0.002618604,0.002975144,0.002059949],"domain_scores_gemma":[0.9260398,0.05243616,0.00344247,0.01426671,0.001939303,0.001875586],"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.001904458,0.0005933743,0.002135898,0.0005157021,0.0001221826,0.0001347095,0.0002885551,0.3531638,0.01296685,0.5387885,0.01655174,0.07283417],"study_design_scores_gemma":[0.0001608188,0.0001939365,0.0004962034,0.00005364875,0.00005386207,0.0001203325,0.00005244763,0.6783204,0.006734808,0.3104733,0.00329248,0.00004773845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1261478,0.001772034,0.8078901,0.01008048,0.0006541166,0.0004957746,0.001368722,0.003055538,0.04853548],"genre_scores_gemma":[0.8725484,0.0006218442,0.1142182,0.001673911,0.0006004362,0.0007655743,0.0009817096,0.0008232975,0.007766528],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0172594,"threshold_uncertainty_score":0.05773842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035762900","doi":"10.1145/1595391.1595392","title":"Improved Separations between Nondeterministic and Randomized Multiparty Communication","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Division of Computing and Communication Foundations","keywords":"Mathematics; Nondeterministic algorithm; Constant (computer programming); Combinatorics; Function (biology); Communication complexity; Binary logarithm; Discrete mathematics; Set (abstract data type); Computer science","authors":[{"name":"Matei David","is_ca":true},{"name":"Toniann Pitassi","is_ca":true},{"name":"Emanuele Viola","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02359461181519825,"gpt":0.2962639757253391,"spread":0.2726693639101408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005525179,0.001090457,0.001622649,0.001007451,0.0016564,0.003616252,0.003767629,0.002762533,0.008154783],"category_scores_gemma":[0.02115308,0.001099266,0.001763693,0.001172179,0.003772979,0.01249495,0.007998616,0.01092823,0.002403887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002827545,"about_ca_system_score_gemma":0.002287949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005593744,"about_ca_topic_score_gemma":0.0005436743,"domain_scores_codex":[0.9922991,0.002662572,0.0003569305,0.001632013,0.002022894,0.001026526],"domain_scores_gemma":[0.9773187,0.01338041,0.0009712725,0.006775375,0.0007785286,0.0007757652],"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.0008799177,0.000173126,0.0003619391,0.0002188877,0.00003642899,0.0001629854,0.0003523947,0.0447836,0.007433796,0.9138314,0.002364812,0.02940087],"study_design_scores_gemma":[0.0001592074,0.0001398428,0.0002027064,0.00006199245,0.00003921907,0.0001724713,0.00005713225,0.2335299,0.01412635,0.7419555,0.009489058,0.00006656391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0647071,0.001038984,0.897926,0.00233535,0.0002630903,0.0001459737,0.0002992721,0.002026107,0.03125805],"genre_scores_gemma":[0.7649598,0.0005201204,0.2205563,0.0006347934,0.0001906223,0.0004026768,0.0003250739,0.0004905273,0.01192024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008154783,"threshold_uncertainty_score":0.02922022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2174589003","doi":"10.1145/2567671","title":"The Hardness of Being Private","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Common value auction; Context (archaeology); Communication complexity; Intersection (aeronautics); Conjecture; Computer science; Function (biology); Differential privacy; Mathematics; Exponential function; Upper and lower bounds; Discrete mathematics; Theoretical computer science; Algorithm; Statistics","authors":[{"name":"Anil Ada","is_ca":true},{"name":"Arkadev Chattopadhyay","is_ca":true},{"name":"Stephen Cook","is_ca":true},{"name":"Lila Fontes","is_ca":true},{"name":"Michal Koucký","is_ca":false},{"name":"Toniann Pitassi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0100595072265786,"gpt":0.2427421522029972,"spread":0.2326826449764186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006733706,0.0006591646,0.002040921,0.001020036,0.004178417,0.00791669,0.003031946,0.004657521,0.009096149],"category_scores_gemma":[0.03874711,0.001145141,0.002372006,0.001956343,0.0115339,0.02387929,0.007239365,0.00919504,0.001584123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003211463,"about_ca_system_score_gemma":0.001972564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001607069,"about_ca_topic_score_gemma":0.0006289965,"domain_scores_codex":[0.9840821,0.004964048,0.001047329,0.00414807,0.003937527,0.001820893],"domain_scores_gemma":[0.9385724,0.04016094,0.002687565,0.01461775,0.00248321,0.001478264],"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.0002168671,0.00005886904,0.0009860971,0.0001441346,0.00005546672,0.0001330064,0.0008813441,0.005898329,0.00098983,0.9733322,0.003269905,0.01403401],"study_design_scores_gemma":[0.00003164675,0.00002109045,0.0003249326,0.00002210134,0.00001705352,0.0001854098,0.0001399997,0.008735429,0.0006382281,0.9861626,0.00370015,0.00002130961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2624708,0.003873735,0.538134,0.04048564,0.0003277498,0.0002522018,0.003325521,0.0005820682,0.1505483],"genre_scores_gemma":[0.9622909,0.001199027,0.02358955,0.001492456,0.000325539,0.0002624471,0.0009453902,0.0002206164,0.009674086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009096149,"threshold_uncertainty_score":0.03561163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016263640","doi":"10.1145/2635822","title":"The complexity of the comparator circuit value problem","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"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":"Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Complexity class; Combinatorics; Bipartite graph; Conjecture; Discrete mathematics; Class (philosophy); P; Comparator; Oracle; Time complexity; Graph; Computer science","authors":[{"name":"Stephen Cook","is_ca":true},{"name":"Dai Le","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04217450054507668,"gpt":0.2620574507414464,"spread":0.2198829501963697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001822719,0.0007250195,0.001323324,0.001144558,0.001768705,0.006149995,0.002573702,0.002906965,0.01181619],"category_scores_gemma":[0.01815467,0.0006993582,0.002230217,0.002078408,0.002993708,0.0149256,0.003241522,0.005090623,0.0007087886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004397884,"about_ca_system_score_gemma":0.002445158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003168469,"about_ca_topic_score_gemma":0.001631569,"domain_scores_codex":[0.9954162,0.0009745234,0.0002496397,0.001125515,0.001416632,0.0008175331],"domain_scores_gemma":[0.9821713,0.014742,0.0008169035,0.001176466,0.0006099254,0.0004834987],"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.0007122831,0.0003540334,0.00531233,0.0009088241,0.000199476,0.0004741583,0.0009703915,0.1088729,0.004335177,0.7898402,0.01765821,0.07036205],"study_design_scores_gemma":[0.0001073539,0.00005935162,0.0014044,0.00005169133,0.00004812481,0.0003248668,0.0002185287,0.1361396,0.002540591,0.8514711,0.007594892,0.00003947676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5095769,0.003676116,0.3798861,0.02204103,0.0003089885,0.0006872402,0.007240451,0.001734725,0.07484847],"genre_scores_gemma":[0.9254757,0.001438225,0.05651293,0.001036025,0.0004812808,0.0005377944,0.004123434,0.000297996,0.01009666],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01181619,"threshold_uncertainty_score":0.03952903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077484581","doi":"10.1145/2633602","title":"On the One-Way Function Candidate Proposed by Goldreich","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Division of Computing and Communication Foundations; European Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Discrete mathematics; Satisfiability; Exponential function; Function (biology); Bipartite graph; Backtracking; Combinatorics; Upper and lower bounds; Algorithm; Graph","authors":[{"name":"James Cook","is_ca":false},{"name":"Omid Etesami","is_ca":false},{"name":"Rachel Miller","is_ca":false},{"name":"Luca Trevisan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01613267216452526,"gpt":0.2324303473210433,"spread":0.216297675156518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004185856,0.001554592,0.002359045,0.001926628,0.00240729,0.003373196,0.002848782,0.002993751,0.007205963],"category_scores_gemma":[0.02181915,0.0009624477,0.002908444,0.002676757,0.005050618,0.01166179,0.003091123,0.00368441,0.00253329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003363998,"about_ca_system_score_gemma":0.002528433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002059155,"about_ca_topic_score_gemma":0.001242078,"domain_scores_codex":[0.9955239,0.00139976,0.0001852689,0.001372683,0.0009793763,0.0005390087],"domain_scores_gemma":[0.9841344,0.0103828,0.0006410727,0.003107178,0.00142774,0.0003069031],"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.001750085,0.0002252807,0.002800755,0.0004366917,0.00008022127,0.000382657,0.0004189707,0.09177534,0.007271896,0.7897184,0.008222695,0.09691694],"study_design_scores_gemma":[0.000214506,0.0006260539,0.0005174899,0.0001905172,0.0001656126,0.0007312931,0.0001003044,0.5039623,0.01405569,0.4625553,0.01673365,0.0001473419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06913963,0.001921542,0.9110593,0.001648327,0.000162571,0.0002356408,0.0002758772,0.001096429,0.01446071],"genre_scores_gemma":[0.6045026,0.001950407,0.3730327,0.001066196,0.0002853149,0.0005599295,0.0007705712,0.0006328353,0.01719943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007205963,"threshold_uncertainty_score":0.02440763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3009023057","doi":"10.1145/3512751","title":"Quantum Distributed Complexity of Set Disjointness on a Line","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"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; Agence Nationale de la Recherche","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Path (computing); Constant (computer programming); Qubit; Binary logarithm; Discrete mathematics; Omega; Quantum; Computer science; Graph; Physics","authors":[{"name":"Frédéric Magniez","is_ca":false},{"name":"Ashwin Nayak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04058135794070367,"gpt":0.2855338444806818,"spread":0.2449524865399781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002520777,0.0007974142,0.001839678,0.0008886322,0.001675158,0.00458972,0.003503763,0.002402034,0.007189573],"category_scores_gemma":[0.02074955,0.0007307826,0.001382997,0.001544482,0.004357108,0.008736427,0.005309968,0.004810353,0.0007313134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004060805,"about_ca_system_score_gemma":0.00180834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001895959,"about_ca_topic_score_gemma":0.001248094,"domain_scores_codex":[0.9949592,0.001482198,0.0002609562,0.001285758,0.00102418,0.0009876885],"domain_scores_gemma":[0.9603258,0.03075992,0.002289313,0.004214813,0.001257827,0.001152329],"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.001453903,0.0002778032,0.002909538,0.0003834145,0.0002021661,0.0004910458,0.0009443297,0.4113255,0.01186405,0.5397927,0.004806081,0.02554953],"study_design_scores_gemma":[0.00008567081,0.00005366749,0.0002512749,0.00001539319,0.00002146774,0.00007439894,0.00005002489,0.7041339,0.002363815,0.2922738,0.0006515114,0.00002494865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5222707,0.0005004366,0.4549414,0.003902191,0.0000867617,0.0002120542,0.001090556,0.001209327,0.01578643],"genre_scores_gemma":[0.9485793,0.000193312,0.04613492,0.000393339,0.00009116239,0.0002660916,0.0006282548,0.0001773816,0.003536176],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007189573,"threshold_uncertainty_score":0.02946335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2956649389","doi":"10.1145/3389390","title":"Approximate Counting CSP Seen from the Other Side","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"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; European Commission","keywords":"Recursively enumerable language; Treewidth; Arity; Homomorphism; Bounded function; Constraint satisfaction problem; Class (philosophy); Time complexity; Polynomial","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03920015596666548,"gpt":0.2917818174662398,"spread":0.2525816614995743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003108781,0.0009480932,0.001915087,0.0007562181,0.001353983,0.004849999,0.002841512,0.002609485,0.0157563],"category_scores_gemma":[0.02463768,0.0006062282,0.00206747,0.002216382,0.003409349,0.01556268,0.003732259,0.00683977,0.001611935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002898045,"about_ca_system_score_gemma":0.002793318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004357561,"about_ca_topic_score_gemma":0.004402503,"domain_scores_codex":[0.9917746,0.002431477,0.0003787572,0.002092739,0.002508725,0.0008137278],"domain_scores_gemma":[0.979219,0.01408304,0.0009925055,0.004050594,0.001112312,0.0005425496],"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.0007214529,0.0001764108,0.001126389,0.0005341782,0.0001135766,0.0002720679,0.0004064339,0.08890492,0.005394896,0.8209667,0.01213445,0.06924853],"study_design_scores_gemma":[0.00006476268,0.00006208223,0.0002294176,0.0000348727,0.0000476198,0.0002278305,0.0001361046,0.2829731,0.002892273,0.7057876,0.00751087,0.00003343679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08569888,0.001374072,0.8710388,0.0105019,0.0004297518,0.0002831447,0.001295603,0.002603977,0.02677397],"genre_scores_gemma":[0.7179986,0.0009105551,0.2563116,0.002434101,0.0006533919,0.0004416086,0.001895864,0.0007853216,0.01856885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0157563,"threshold_uncertainty_score":0.05271012,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1663218918","doi":"10.1145/2698587","title":"Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Alice and Bob; Hamming distance; Communication complexity; Bounding overwatch; Upper and lower bounds; Mathematics; Quantum information science; Quantum; Discrete mathematics; Combinatorics; Computer science; Quantum entanglement; Quantum mechanics; Physics","authors":[{"name":"Andris Ambainis","is_ca":true},{"name":"William Gasarch","is_ca":false},{"name":"Aravind Srinivasan","is_ca":false},{"name":"Andrey Utis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04861793686885723,"gpt":0.2731714325194876,"spread":0.2245534956506303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007482897,0.002202227,0.002370593,0.002395489,0.003246846,0.007048768,0.006064445,0.004389598,0.01217129],"category_scores_gemma":[0.05953257,0.001254048,0.002560059,0.003019554,0.00556148,0.01824002,0.007436751,0.009915678,0.001985185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006918749,"about_ca_system_score_gemma":0.004587085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002336489,"about_ca_topic_score_gemma":0.002874153,"domain_scores_codex":[0.9870998,0.004077849,0.0006564514,0.001792908,0.00372385,0.00264913],"domain_scores_gemma":[0.873518,0.1096844,0.002888845,0.008642551,0.003191857,0.002074393],"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.001451053,0.0006414121,0.002765138,0.0008779522,0.0001605927,0.0002626714,0.0008583259,0.1586351,0.005913729,0.7495369,0.01525547,0.06364173],"study_design_scores_gemma":[0.0001311707,0.000109781,0.001022327,0.00009906704,0.00005132531,0.000131099,0.0001588287,0.2751163,0.002279575,0.7182155,0.002618091,0.00006690699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3333312,0.01061982,0.46683,0.03446985,0.0009750644,0.0005487285,0.003410324,0.001565751,0.1482493],"genre_scores_gemma":[0.8847321,0.003821313,0.08566796,0.001751295,0.001601097,0.001133542,0.002247778,0.0006433693,0.0184015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01217129,"threshold_uncertainty_score":0.05019921,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2257188417","doi":"10.1145/2786015","title":"Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"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; Packing problems; Mathematics; Set packing; Vertex (graph theory); Graph; Set (abstract data type); Discrete mathematics; Computer science","authors":[{"name":"Henning Fernau","is_ca":false},{"name":"Alejandro López-Ortíz","is_ca":true},{"name":"Jazmín Romero","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1535964510606377,"gpt":0.3655243488702394,"spread":0.2119278978096017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002660829,0.001541453,0.002162124,0.001112915,0.001187957,0.003162915,0.002859045,0.001849002,0.004538578],"category_scores_gemma":[0.02064422,0.0008467307,0.002642509,0.002010147,0.003218401,0.0126414,0.005695742,0.006940334,0.001368911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002831407,"about_ca_system_score_gemma":0.001465922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001913825,"about_ca_topic_score_gemma":0.001249068,"domain_scores_codex":[0.9957004,0.001180153,0.0002511023,0.0009840281,0.001116357,0.0007680865],"domain_scores_gemma":[0.9880884,0.007244685,0.0009828858,0.002665721,0.0005423781,0.0004759441],"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.000803176,0.0009214893,0.002182841,0.0003692862,0.00008241563,0.0003623415,0.001145523,0.4867961,0.01449345,0.3801876,0.004313387,0.1083424],"study_design_scores_gemma":[0.00005633157,0.0001075303,0.0002201975,0.0000161772,0.00001846623,0.00008714609,0.0001315085,0.7462808,0.002724125,0.2487189,0.001613176,0.0000257346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1299811,0.0002930549,0.8603092,0.00102205,0.00004709607,0.0001752592,0.000162032,0.001153825,0.006856232],"genre_scores_gemma":[0.7240105,0.0003747719,0.268647,0.0002908537,0.0001585159,0.0004864952,0.000460941,0.0006604854,0.004910462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004538578,"threshold_uncertainty_score":0.02054334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407545940","doi":"10.1145/3717450","title":"Lower Bounds for Learning Quantum States with Single-Copy Measurements","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quantum; Quantum state; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","authors":[{"name":"Angus Lowe","is_ca":true},{"name":"Ashwin Nayak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02065505414164063,"gpt":0.2656118194055775,"spread":0.2449567652639369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0152152,0.003529437,0.0036881,0.002730811,0.0023412,0.006464393,0.007126086,0.004854742,0.008843601],"category_scores_gemma":[0.1026989,0.001510246,0.002949835,0.003025816,0.008773281,0.01919675,0.01132031,0.01352836,0.001613013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008811126,"about_ca_system_score_gemma":0.004414055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001842781,"about_ca_topic_score_gemma":0.002097487,"domain_scores_codex":[0.9886254,0.003875854,0.000537264,0.002053844,0.003565115,0.001342522],"domain_scores_gemma":[0.8660627,0.1144003,0.003780821,0.008770314,0.004440628,0.002545145],"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.0005808994,0.0002888865,0.003209514,0.000722464,0.0001715201,0.0002421078,0.0005720325,0.2072374,0.003321783,0.7438307,0.004801501,0.03502121],"study_design_scores_gemma":[0.00003221328,0.00008648001,0.0004212232,0.0001062589,0.00002721668,0.0001125171,0.00006641696,0.5611334,0.001820115,0.4349337,0.001217174,0.00004330775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02955338,0.002561836,0.9487743,0.004504468,0.0001744143,0.0001800922,0.0004932375,0.0005953283,0.01316289],"genre_scores_gemma":[0.6304867,0.003705004,0.3444117,0.002784754,0.0008838054,0.001374515,0.001958386,0.001067465,0.01332774],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0152152,"threshold_uncertainty_score":0.08046663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2919078879","doi":"10.1145/3404860","title":"Circuit Lower Bounds for MCSP from Local Pseudorandom Generators","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"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","keywords":"Pseudorandom number generator; Upper and lower bounds; Boolean function; Mathematics; Combinatorics; Discrete mathematics; Truth table; Boolean circuit; Binary logarithm; Function (biology); Parity function; Algorithm; Boolean expression","authors":[{"name":"Mahdi Cheraghchi","is_ca":false},{"name":"Valentine Kabanets","is_ca":true},{"name":"Zhenjian Lu","is_ca":true},{"name":"Dimitrios Myrisiotis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04122917108285918,"gpt":0.2584555555495299,"spread":0.2172263844666708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002949422,0.002553366,0.002229184,0.002232707,0.001745784,0.00545194,0.005170483,0.002682007,0.02603814],"category_scores_gemma":[0.02980181,0.001233317,0.003782125,0.003043318,0.003170414,0.01573203,0.007122686,0.01085006,0.004064511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005126885,"about_ca_system_score_gemma":0.003381316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002285373,"about_ca_topic_score_gemma":0.004160211,"domain_scores_codex":[0.9925447,0.001224698,0.0003870577,0.00170614,0.002875006,0.001262578],"domain_scores_gemma":[0.9634252,0.02795037,0.001265944,0.004571276,0.001866638,0.0009205221],"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.001525461,0.0006350498,0.004588429,0.001839792,0.0002746867,0.0005392862,0.000656284,0.1946841,0.02529432,0.5828365,0.0438448,0.1432813],"study_design_scores_gemma":[0.0002197925,0.0002390708,0.0009362868,0.0002030158,0.0002265153,0.0003372668,0.0001119002,0.3453724,0.009841553,0.6292318,0.01320282,0.00007774777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1048094,0.006869063,0.7765556,0.01154437,0.0006775825,0.0006569628,0.004392655,0.006175198,0.08831916],"genre_scores_gemma":[0.6886507,0.00429642,0.2594248,0.006221229,0.001997127,0.002298899,0.007987565,0.002853004,0.02627032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02603814,"threshold_uncertainty_score":0.08710623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2952920300","doi":"10.1145/3013516","title":"Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"National Science Foundation","keywords":"Nondeterministic algorithm; Upper and lower bounds; Sublinear function; Branching (polymer chemistry); Computation; Boolean function","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03216755379160711,"gpt":0.3231520444204931,"spread":0.290984490628886,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00608315,0.001878739,0.001510119,0.002865084,0.001815926,0.004122657,0.0060297,0.002355312,0.01111436],"category_scores_gemma":[0.01696499,0.001227543,0.002647982,0.002888125,0.003854058,0.008675925,0.00492866,0.01037613,0.002598213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004509557,"about_ca_system_score_gemma":0.002352523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001705636,"about_ca_topic_score_gemma":0.00175434,"domain_scores_codex":[0.9925127,0.002182722,0.0004948258,0.001454916,0.002629677,0.0007251857],"domain_scores_gemma":[0.9891762,0.005998189,0.0003656883,0.002652462,0.001466148,0.0003412377],"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.00004232712,0.00003357874,0.00007985068,0.0000924273,0.0000201831,0.00004190851,0.0000741723,0.009995705,0.0009890654,0.9694526,0.003752455,0.01542568],"study_design_scores_gemma":[0.00003466783,0.00004516383,0.000138782,0.00006437269,0.00003957318,0.0001077071,0.00002716634,0.1658451,0.003358479,0.8108824,0.01941155,0.00004510967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003061224,0.0005780085,0.9710671,0.001604557,0.0002118242,0.00008372749,0.0001672268,0.0002472683,0.02297897],"genre_scores_gemma":[0.2169576,0.001587193,0.7473661,0.002085218,0.0009218292,0.00129058,0.0006818808,0.0006928481,0.02841668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01111436,"threshold_uncertainty_score":0.03718126,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991265104","doi":"10.1145/2537800","title":"New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"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":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation","keywords":"Cover (algebra); Combinatorics; Mathematics; Edge coloring; Graph coloring; Graph; Vertex cover; Discrete mathematics; Computer science; Graph power; Line graph; Engineering","authors":[{"name":"Per Austrin","is_ca":true},{"name":"Ryan O’Donnell","is_ca":false},{"name":"Li-Yang Tan","is_ca":false},{"name":"John C. Wright","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03570242712076727,"gpt":0.3221715244481421,"spread":0.2864690973273749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001828603,0.002413229,0.00209434,0.001644003,0.002750765,0.005296257,0.005018037,0.002994622,0.01828096],"category_scores_gemma":[0.01024062,0.001403552,0.003835062,0.002880132,0.003331236,0.01262109,0.0052947,0.009257515,0.002165964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003833738,"about_ca_system_score_gemma":0.002610047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004837553,"about_ca_topic_score_gemma":0.006668335,"domain_scores_codex":[0.996309,0.0006832139,0.0001808333,0.00089399,0.001098928,0.0008339224],"domain_scores_gemma":[0.9860439,0.01026892,0.000971164,0.001398746,0.0006333473,0.0006838794],"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.001832274,0.001580945,0.004310391,0.00296252,0.0005189303,0.001875055,0.001507388,0.2840621,0.01444769,0.4123086,0.1495387,0.1250554],"study_design_scores_gemma":[0.0003368084,0.0001509701,0.001323329,0.0001876145,0.0002431422,0.001024033,0.0003897344,0.244247,0.006360805,0.7136422,0.03199617,0.00009832241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1505806,0.004982542,0.6770415,0.02659433,0.001944627,0.0009453463,0.009373815,0.003460784,0.1250765],"genre_scores_gemma":[0.6338521,0.004011496,0.3104143,0.006960852,0.003101712,0.001260396,0.009012642,0.001910534,0.02947602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01828096,"threshold_uncertainty_score":0.06115586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405504959","doi":"10.1145/3708508","title":"Robustness for Space-Bounded Statistical Zero Knowledge","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":1,"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":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Bounded function; Robustness (evolution); Zero-knowledge proof; Zero (linguistics); Mathematics; Discrete mathematics; Computer science; Pure mathematics; Mathematical analysis; Algorithm","authors":[{"name":"Eric Allender","is_ca":false},{"name":"Jeremy C. Gray","is_ca":true},{"name":"Saachi Mutreja","is_ca":false},{"name":"Harsha Tirumala","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02207796201139703,"gpt":0.2946501928792737,"spread":0.2725722308678767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006796315,0.0008902823,0.001426623,0.001859365,0.001393145,0.005356311,0.00291649,0.002249052,0.004918905],"category_scores_gemma":[0.05593529,0.0006100569,0.001482387,0.001104828,0.005694384,0.007872921,0.006846572,0.003979686,0.0009067597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002498564,"about_ca_system_score_gemma":0.001932587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009221124,"about_ca_topic_score_gemma":0.0004382586,"domain_scores_codex":[0.9888456,0.002246504,0.0005064398,0.002013778,0.004535506,0.001852133],"domain_scores_gemma":[0.90785,0.06314646,0.009439435,0.01473717,0.003382808,0.001444148],"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.001642279,0.0001349591,0.004345203,0.0003917566,0.000193106,0.0003315845,0.0005686993,0.2418288,0.02099495,0.6887957,0.002643889,0.03812902],"study_design_scores_gemma":[0.00007963153,0.0002606124,0.001226031,0.00005220123,0.00004542013,0.0002180286,0.0001470066,0.5168093,0.0159531,0.463301,0.001826787,0.00008086141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1953204,0.0005631734,0.7845304,0.00211615,0.0001280589,0.0001792204,0.0008565501,0.001266304,0.01503972],"genre_scores_gemma":[0.9845889,0.0001909782,0.01302604,0.0003011192,0.00009750111,0.00009728822,0.0002500676,0.00009502131,0.001353067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006796315,"threshold_uncertainty_score":0.03594279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1598457899","doi":"10.1145/2540088","title":"Graph Isomorphism is Not AC0-Reducible to Group Isomorphism","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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","keywords":"Nondeterministic algorithm; Upper and lower bounds; Isomorphism (crystallography); Mathematics; Graph isomorphism; Quasigroup; Combinatorics; Discrete mathematics; Bounded function; Group (periodic table); Group isomorphism; Parity (physics); Graph; Automorphism; Automorphism group; Line graph","authors":[{"name":"Arkadev Chattopadhyay","is_ca":true},{"name":"Jacobo Torán","is_ca":false},{"name":"Fabian Wagner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02684005737958888,"gpt":0.2585651682899363,"spread":0.2317251109103474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002018458,0.0009259291,0.001148996,0.001078474,0.002207609,0.004209945,0.002399096,0.001826092,0.01154301],"category_scores_gemma":[0.01080487,0.000893698,0.002940537,0.001399216,0.003404285,0.009514596,0.004572121,0.006296098,0.00150385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002943672,"about_ca_system_score_gemma":0.003008246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003066269,"about_ca_topic_score_gemma":0.003560595,"domain_scores_codex":[0.9951261,0.000783511,0.0003038019,0.00112819,0.00149246,0.00116582],"domain_scores_gemma":[0.980746,0.011329,0.0009653561,0.005141194,0.001197948,0.000620575],"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.001184282,0.0007951324,0.004866862,0.001007818,0.0001948356,0.0007478555,0.0008771123,0.06570696,0.01860105,0.7951568,0.02186597,0.0889953],"study_design_scores_gemma":[0.0001091106,0.0001548194,0.0008548257,0.00004372779,0.000154466,0.0004377743,0.0001956724,0.08747629,0.01756307,0.8824291,0.01053196,0.00004905577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4559388,0.0008636385,0.4116639,0.008029073,0.0005835519,0.0005103652,0.001642956,0.005639066,0.1151286],"genre_scores_gemma":[0.9054968,0.0003841732,0.07260496,0.001598098,0.0003448673,0.0002770843,0.001873386,0.0007009729,0.01671956],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01154301,"threshold_uncertainty_score":0.03861523,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3001787625","doi":"10.1145/3726532","title":"Reconstruction of Depth-4 Multilinear Circuits","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"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":"Multilinear map; Electronic circuit; Computer science; Mathematics; Engineering; Electrical engineering; Pure mathematics","authors":[{"name":"Vishwas Bhargava","is_ca":false},{"name":"Shubhangi Saraf","is_ca":true},{"name":"Ilya Volkovich","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01300470353865764,"gpt":0.2806092736660844,"spread":0.2676045701274268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005580266,0.000712241,0.000693499,0.0005382062,0.0005732165,0.001322347,0.001408512,0.001025134,0.007291504],"category_scores_gemma":[0.006353941,0.0005864137,0.0009842208,0.0006010199,0.0007802299,0.002504345,0.003107364,0.001925344,0.00138748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00118082,"about_ca_system_score_gemma":0.0009900093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009744653,"about_ca_topic_score_gemma":0.001457484,"domain_scores_codex":[0.9984862,0.0002703621,0.00009276324,0.00036045,0.0004498883,0.000340374],"domain_scores_gemma":[0.9977055,0.001007269,0.0002427039,0.0006618014,0.0002896346,0.00009303326],"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.002305692,0.000254546,0.005480801,0.001003182,0.0001728838,0.0008526085,0.0009146828,0.2136686,0.07742136,0.290154,0.01189962,0.3958719],"study_design_scores_gemma":[0.0001916688,0.0003191512,0.0008329587,0.0001081591,0.0000847893,0.000544533,0.0001933315,0.5777498,0.06787071,0.3381413,0.01388796,0.0000756174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2017999,0.0005795276,0.781903,0.0008161185,0.00008068093,0.000141785,0.001024217,0.003223145,0.0104316],"genre_scores_gemma":[0.7851219,0.0002360077,0.2072211,0.0004424144,0.00003854774,0.0001309178,0.001270039,0.000323874,0.005215241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007291504,"threshold_uncertainty_score":0.02439249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1650544138","doi":"10.1145/2656209","title":"Exponential Lower Bounds for AC <sup>0</sup> -Frege Imply Superpolynomial Frege Lower Bounds","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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":"Mathematical proof; Mathematics; Bounded function; Cryptography; Upper and lower bounds; Exponential function; Discrete mathematics; Transformation (genetics); Proof complexity; Polynomial; Combinatorics; Mathematical analysis; Algorithm","authors":[{"name":"Toniann Pitassi","is_ca":true},{"name":"Rahul Santhanam","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04404148439805563,"gpt":0.3077857384622144,"spread":0.2637442540641588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0103906,0.001780899,0.001367387,0.003175127,0.002321248,0.007159599,0.004254914,0.002760124,0.02014668],"category_scores_gemma":[0.06003338,0.001409366,0.004096122,0.002029602,0.005980889,0.0234829,0.007935434,0.0115119,0.004558085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004835803,"about_ca_system_score_gemma":0.002842023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00147683,"about_ca_topic_score_gemma":0.002075472,"domain_scores_codex":[0.9870453,0.002436614,0.0007523835,0.00231784,0.004467529,0.002980344],"domain_scores_gemma":[0.8847172,0.08112603,0.003965225,0.02061659,0.007925619,0.001649377],"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.0005309597,0.0001701911,0.002768095,0.000574674,0.00009599206,0.0002731223,0.0005901603,0.01384907,0.01012733,0.908911,0.009525669,0.05258362],"study_design_scores_gemma":[0.00003637603,0.00006332016,0.0005776345,0.0001008001,0.00007598651,0.000323305,0.0001098396,0.02904516,0.01045627,0.9428831,0.01627007,0.00005820418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0761571,0.002513184,0.8223712,0.01101187,0.0006087224,0.0003414988,0.001050866,0.004780996,0.08116444],"genre_scores_gemma":[0.6923053,0.001391819,0.2790959,0.005039911,0.0008581145,0.0005631319,0.001024603,0.002217322,0.01750395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02014668,"threshold_uncertainty_score":0.0673973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3008826217","doi":"10.1145/3470861","title":"Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Product (mathematics); Mathematics; Upper and lower bounds; Boolean function; Physics; Mathematical analysis; Geometry","authors":[{"name":"Valentine Kabanets","is_ca":true},{"name":"Sajin Koroth","is_ca":true},{"name":"Zhenjian Lu","is_ca":true},{"name":"Dimitrios Myrisiotis","is_ca":false},{"name":"Igor Oliveira","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02419060904223568,"gpt":0.2875441675004525,"spread":0.2633535584582168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004058659,0.001889403,0.001742862,0.001874169,0.001896362,0.006601798,0.005464025,0.002568669,0.01171467],"category_scores_gemma":[0.02375783,0.001097923,0.003649788,0.002300061,0.003354993,0.01475431,0.00492376,0.008027015,0.002030397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007282952,"about_ca_system_score_gemma":0.005284464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002837637,"about_ca_topic_score_gemma":0.005862764,"domain_scores_codex":[0.9915417,0.001416696,0.000481042,0.00210187,0.002324299,0.00213439],"domain_scores_gemma":[0.96673,0.02317195,0.00181217,0.00565457,0.001604268,0.001026978],"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.002871866,0.0008967967,0.006932744,0.001391391,0.0003250387,0.0003598091,0.0008364575,0.1517658,0.02964366,0.6182489,0.01794538,0.1687821],"study_design_scores_gemma":[0.0002468621,0.0002353984,0.0009609564,0.0001337096,0.0001982064,0.0002193021,0.0001091783,0.5208246,0.01795983,0.4532952,0.005736331,0.00008050188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1639464,0.002710482,0.7833855,0.005783487,0.0002292843,0.0005354917,0.001427737,0.005193615,0.03678818],"genre_scores_gemma":[0.6650864,0.001158755,0.3107882,0.002148819,0.0004457692,0.0009502803,0.002705608,0.001041703,0.01567454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01171467,"threshold_uncertainty_score":0.05284178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3036487380","doi":"10.1145/3470869","title":"On the Parameterized Approximability of Contraction to Classes of Chordal Graphs","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"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":"Department of Science and Technology, Ministry of Science and Technology, India; European Commission","keywords":"Parameterized complexity; Combinatorics; Chordal graph; Mathematics; Bounded function; Contraction (grammar); Treewidth; Time complexity; Discrete mathematics; Graph; Pathwidth; Line graph; Mathematical analysis","authors":[{"name":"Spoorthy Gunda","is_ca":true},{"name":"Pallavi Jain","is_ca":false},{"name":"Daniel Lokshtanov","is_ca":false},{"name":"Saket Saurabh","is_ca":false},{"name":"Prafullkumar Tale","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0400114360570754,"gpt":0.3237282170312386,"spread":0.2837167809741632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002464307,0.00130126,0.001739095,0.001082889,0.001487967,0.003663717,0.003806175,0.001810205,0.005187879],"category_scores_gemma":[0.02443354,0.0007561024,0.002467083,0.001813237,0.00279291,0.01149074,0.003811819,0.00487847,0.0006157503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004322968,"about_ca_system_score_gemma":0.002387714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00579484,"about_ca_topic_score_gemma":0.004619527,"domain_scores_codex":[0.9965643,0.0006129476,0.0001958334,0.001137281,0.000718543,0.000771179],"domain_scores_gemma":[0.9783722,0.01441367,0.001442819,0.004049966,0.0007033457,0.001017905],"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.002680547,0.001044149,0.01937293,0.0008071503,0.0003134617,0.0004333276,0.002964597,0.5326599,0.02065299,0.2876721,0.01062458,0.1207742],"study_design_scores_gemma":[0.0001271923,0.000157788,0.001365553,0.00003567612,0.00007902964,0.0002269466,0.0002661839,0.789736,0.004152446,0.2016836,0.002134467,0.0000351461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6270781,0.0007939541,0.356954,0.002579718,0.00008054483,0.0002175974,0.0008836684,0.0022546,0.009157738],"genre_scores_gemma":[0.9098533,0.0005743466,0.08268131,0.0003867901,0.000162671,0.0002222198,0.001565924,0.0005569702,0.00399651],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00579484,"threshold_uncertainty_score":0.03136539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3032955444","doi":"10.1145/3397474","title":"Testing Linearity against Non-signaling Strategies","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"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":"Linearity; Generalization; Computer science; Probability distribution; Statistical hypothesis testing; Statistical physics; Mathematics; Property (philosophy); Theoretical computer science; Physics; Statistics; Quantum mechanics; Mathematical analysis","authors":[{"name":"Alessandro Chiesa","is_ca":false},{"name":"Peter Manohar","is_ca":false},{"name":"Igor Shinkar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03467971511545365,"gpt":0.2752646431158799,"spread":0.2405849280004263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0146755,0.0009177983,0.001424834,0.001806439,0.001637671,0.004024475,0.002980958,0.00269622,0.003183962],"category_scores_gemma":[0.1061568,0.0006487009,0.001797415,0.001386333,0.007601325,0.012464,0.004894903,0.004392301,0.0005108806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002803097,"about_ca_system_score_gemma":0.003131764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001169568,"about_ca_topic_score_gemma":0.0007665378,"domain_scores_codex":[0.9794515,0.007923866,0.001414175,0.004048889,0.005202854,0.001958822],"domain_scores_gemma":[0.7934266,0.1638764,0.01443387,0.01703561,0.007128044,0.004099577],"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.001062547,0.000499167,0.02932739,0.00033021,0.0004024545,0.0007523164,0.001451603,0.04137365,0.01314377,0.8562568,0.001454366,0.05394578],"study_design_scores_gemma":[0.0001180957,0.000619874,0.003907423,0.00006804522,0.00007403531,0.0004737724,0.0005217982,0.2224634,0.01319718,0.7573019,0.001163462,0.00009106603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5542898,0.0002073658,0.4318982,0.002990056,0.00005103854,0.0002588929,0.0004408714,0.0005716702,0.009292235],"genre_scores_gemma":[0.9776869,0.0001030251,0.02027359,0.0004424388,0.0000516432,0.0002008144,0.0002424718,0.0000508139,0.0009483686],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0146755,"threshold_uncertainty_score":0.0776124,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3108038062","doi":"10.1145/3488250","title":"Erasure-Resilient Sublinear-Time Graph Algorithms","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"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":"Simons Institute for the Theory of Computing, University of California Berkeley; Israel Science Foundation; National Science Foundation","keywords":"Sublinear function; Degree (music); Property testing; Social connectedness; Erasure; Adjacency list; Mathematics; Algorithm; Discrete mathematics; Graph property; Computer science; Graph; Time complexity; Combinatorics; Theoretical computer science; Line graph","authors":[{"name":"Amit Levi","is_ca":true},{"name":"Ramesh Krishnan S. Pallavoor","is_ca":false},{"name":"Sofya Raskhodnikova","is_ca":false},{"name":"Nithin Varma","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02675515628261876,"gpt":0.2754805988845482,"spread":0.2487254426019295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004020106,0.002426852,0.002448941,0.001423927,0.001205168,0.003202551,0.006638112,0.002936722,0.006897452],"category_scores_gemma":[0.02713303,0.001090895,0.001798323,0.00286129,0.00284162,0.01246212,0.003799316,0.004019946,0.002047829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003870862,"about_ca_system_score_gemma":0.002935064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002053267,"about_ca_topic_score_gemma":0.002886542,"domain_scores_codex":[0.9943476,0.001691591,0.0003032277,0.001801895,0.0009704787,0.0008852242],"domain_scores_gemma":[0.967136,0.02178665,0.002151581,0.007379486,0.0009125558,0.0006336912],"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.002076578,0.0006501171,0.002010227,0.0006648392,0.0002250159,0.0002350445,0.0005546018,0.7433994,0.008819671,0.08361429,0.01478662,0.1429635],"study_design_scores_gemma":[0.0001208449,0.0001129471,0.0001719905,0.00001586606,0.00004038347,0.0001197213,0.00004901943,0.9107625,0.004018187,0.08331966,0.001249046,0.0000198874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1221698,0.001728118,0.849926,0.00437034,0.0002707909,0.0003543865,0.001194837,0.01133284,0.008652901],"genre_scores_gemma":[0.6737473,0.0006430035,0.3158371,0.001377666,0.0003058766,0.0004178577,0.001386643,0.0008552588,0.005429226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006897452,"threshold_uncertainty_score":0.02808517,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416907084","doi":"10.1145/3779121","title":"Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trinity College","funders":"Univerzita Karlova v Praze","keywords":"Hypergraph; Chromatic scale; Graph; Enhanced Data Rates for GSM Evolution; Graph theory","authors":[{"name":"Marek Filakovský","is_ca":false},{"name":"Tamio-Vesa Nakajima","is_ca":true},{"name":"Jakub Opršal","is_ca":false},{"name":"Gianluca Tasinato","is_ca":false},{"name":"Uli Wagner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02582826452720564,"gpt":0.3139078574151777,"spread":0.288079592887972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001414072,0.0009235264,0.001498686,0.0007120119,0.001534446,0.005268021,0.003087274,0.002041929,0.007810521],"category_scores_gemma":[0.01413448,0.001016706,0.002067537,0.001752663,0.002568414,0.008417625,0.00255249,0.003042146,0.0007206811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003697939,"about_ca_system_score_gemma":0.001850429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009136095,"about_ca_topic_score_gemma":0.006422233,"domain_scores_codex":[0.9973783,0.000775424,0.0001782955,0.000718539,0.0004844069,0.0004650295],"domain_scores_gemma":[0.9777375,0.01623603,0.00165497,0.002684146,0.0006885769,0.0009986744],"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.004518184,0.0006805896,0.02242737,0.001902131,0.0003836141,0.001186844,0.00345853,0.5443118,0.0324248,0.3053964,0.01776989,0.0655399],"study_design_scores_gemma":[0.0003049583,0.0001955471,0.004245698,0.00009976887,0.0001456402,0.0007593097,0.0008422192,0.5908914,0.0135447,0.3843384,0.004540099,0.00009227006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8593651,0.0004738857,0.1207423,0.002905618,0.000054319,0.0001661447,0.003189763,0.0013454,0.01175758],"genre_scores_gemma":[0.9639596,0.0003124465,0.02880459,0.0004067003,0.00006647442,0.000110681,0.002615085,0.0002583904,0.003466067],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009136095,"threshold_uncertainty_score":0.02683049,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4376874065","doi":"10.1145/3583085","title":"Catalytic Branching Programs from Groups and General Protocols","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Branching (polymer chemistry); Amortized analysis; Boolean function; Exponential function; Mathematics; Multiplicity (mathematics); Binary decision diagram; Combinatorics; Range (aeronautics); Discrete mathematics; Data structure; Computer science; Algorithm; Geometry","authors":[{"name":"Hugo Côté","is_ca":true},{"name":"Pierre McKenzie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04121551144187059,"gpt":0.2996425383301834,"spread":0.2584270268883129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001657699,0.0008005019,0.0006962731,0.0009348727,0.001111255,0.002625327,0.001778541,0.001701309,0.01169515],"category_scores_gemma":[0.005884114,0.0005617975,0.001244245,0.001449561,0.003216206,0.005758641,0.004150124,0.003874872,0.001488409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002117575,"about_ca_system_score_gemma":0.001661843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00129,"about_ca_topic_score_gemma":0.001219962,"domain_scores_codex":[0.9980166,0.0006168138,0.00009910065,0.0004173463,0.0005331368,0.0003170574],"domain_scores_gemma":[0.9964779,0.00191478,0.0002205385,0.0009671932,0.0002454506,0.000174105],"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.00005637328,0.00002596241,0.00009353747,0.00008585167,0.000007564106,0.00005361446,0.0001242694,0.01464435,0.001185001,0.9666494,0.001541414,0.01553284],"study_design_scores_gemma":[0.00002565469,0.00002415786,0.00004163135,0.0000188444,0.000009215751,0.00005398621,0.00002233529,0.04330211,0.001568199,0.9480029,0.006919243,0.00001154372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05830613,0.0008285035,0.8789152,0.001844194,0.0001493627,0.0003132331,0.0003940902,0.001497738,0.05775169],"genre_scores_gemma":[0.627523,0.001294711,0.3367629,0.0009253536,0.0002924865,0.001093937,0.0009536651,0.0007688919,0.03038519],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01169515,"threshold_uncertainty_score":0.03912419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2757265255","doi":"10.1145/3282431","title":"Surjective H-Colouring over Reflexive Digraphs","year":2018,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Leverhulme Trust","keywords":"Surjective function; Mathematics; Combinatorics; Homomorphism; Transitive relation; Discrete mathematics; Unary operation; Digraph","authors":[{"name":"Benoît Larose","is_ca":true},{"name":"Barnaby Martin","is_ca":false},{"name":"Daniël Paulusma","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03918373471789331,"gpt":0.3530785267569117,"spread":0.3138947920390184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001265295,0.0006989341,0.0009024045,0.000824459,0.001174949,0.003934406,0.001622988,0.001084702,0.004699325],"category_scores_gemma":[0.006871922,0.0005578386,0.001685986,0.00111165,0.002844148,0.006472728,0.002479949,0.002270732,0.0003343452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002273126,"about_ca_system_score_gemma":0.001249628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004393512,"about_ca_topic_score_gemma":0.003766109,"domain_scores_codex":[0.9975758,0.0004738495,0.0001991195,0.0009821402,0.0003494578,0.0004195682],"domain_scores_gemma":[0.9860855,0.008408302,0.00132524,0.002587543,0.000632528,0.0009607991],"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.0008733497,0.0003645788,0.01698007,0.000970563,0.0002735282,0.001518279,0.002379029,0.1297512,0.02698112,0.7334532,0.003226799,0.08322825],"study_design_scores_gemma":[0.0001167637,0.0001591566,0.003283002,0.0000496681,0.000132561,0.0005841117,0.0005253302,0.1432664,0.01301895,0.834551,0.004239163,0.00007390073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7771182,0.0003492034,0.2083937,0.0009810637,0.00004355385,0.000227563,0.001553065,0.0008583966,0.01047524],"genre_scores_gemma":[0.9575921,0.0002228386,0.03752138,0.000182112,0.00004718944,0.0000760578,0.001079279,0.00007992667,0.0031992],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004699325,"threshold_uncertainty_score":0.01649278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}