{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008248196,0.000203152,0.0001845838,0.0003476915,0.0004531272,0.000194485,0.0007953363,0.00009692578,0.00005949356],"category_scores_gemma":[0.00005688853,0.0002088056,0.0001423936,0.0006178007,0.0000967446,0.0007201112,0.00001863821,0.0002922367,0.0002032975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003178765,"about_ca_system_score_gemma":0.00004476734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009049087,"about_ca_topic_score_gemma":0.000006798894,"domain_scores_codex":[0.9982311,0.0003859716,0.000303051,0.0004901325,0.0003215884,0.0002681835],"domain_scores_gemma":[0.9982691,0.0005785755,0.0001181558,0.0007978698,0.0001153697,0.0001209104],"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.00005524816,0.000235768,0.00004314626,0.00002533991,0.00005271967,0.000002267733,0.000935436,0.01246813,0.0007682825,0.4918731,0.00007456962,0.4934659],"study_design_scores_gemma":[0.0009919468,0.0002943776,0.003783487,0.00006133558,0.00003583007,0.00004136889,0.000107108,0.124617,0.00179617,0.8658623,0.001939923,0.0004691701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01562228,0.00002565333,0.9817275,0.000522364,0.0005289185,0.0001890394,0.00000934531,0.0007457885,0.0006290678],"genre_scores_gemma":[0.9142057,0.00001370868,0.08512212,0.0005275188,0.00005680039,0.00002643615,0.0000120814,0.00001709435,0.0000185702],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8985834,"threshold_uncertainty_score":0.8514846,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002751113,0.0002637852,0.0003913143,0.0008095009,0.000318019,0.0001256179,0.001031798,0.0001097495,0.0001074413],"category_scores_gemma":[0.0001470679,0.0002589733,0.0003308725,0.002075788,0.0001499496,0.0007373421,0.00004195833,0.000257508,0.00005258526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001974048,"about_ca_system_score_gemma":0.0000663126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002001781,"about_ca_topic_score_gemma":0.00003369649,"domain_scores_codex":[0.9972587,0.0008700106,0.0004987015,0.0005584081,0.0003057063,0.0005085125],"domain_scores_gemma":[0.9957654,0.002849534,0.0001145616,0.000932544,0.0001620926,0.000175901],"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.0001157211,0.001177941,0.0009057587,0.00002717247,0.0003839871,0.000001561507,0.00358366,0.1988971,0.00003570951,0.420815,0.00002200159,0.3740344],"study_design_scores_gemma":[0.0009071007,0.0001630205,0.0204962,0.00001046404,0.0001655445,0.000007123791,0.0002852668,0.3078057,0.0007248313,0.6687667,0.0002142348,0.0004537359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02566859,0.00008340479,0.9719173,0.0004762258,0.0007313661,0.0005549812,0.00002458981,0.0003023409,0.0002411511],"genre_scores_gemma":[0.7977042,0.000003049099,0.2016339,0.0004024276,0.00005378082,0.0001005474,0.00001484674,0.00001531637,0.00007191981],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7720356,"threshold_uncertainty_score":0.9999862,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000349824,0.0001869717,0.0001495743,0.0002732893,0.0004942378,0.0002569465,0.0006480297,0.00007534782,0.00007981909],"category_scores_gemma":[0.00004452878,0.0001731347,0.0001163087,0.0005319823,0.00004787661,0.0004247407,0.00002130443,0.0003262809,0.0004377853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004613414,"about_ca_system_score_gemma":0.00004004097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003303901,"about_ca_topic_score_gemma":0.000001107777,"domain_scores_codex":[0.998534,0.0002139789,0.0002755456,0.0004395403,0.000258173,0.0002788234],"domain_scores_gemma":[0.9983588,0.0007322882,0.00009544045,0.0005830264,0.0001266203,0.0001037974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000641958,0.00008686406,0.000002510459,0.000007453898,0.00002327714,0.000001228213,0.0005233233,0.2408008,0.0003165611,0.02256999,0.0000787183,0.7355829],"study_design_scores_gemma":[0.0002256611,0.0001273094,0.0007278292,0.00002578069,0.000005871775,0.00002980824,0.00005556949,0.6439404,0.0006249526,0.3537554,0.0002908985,0.0001904972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03752192,0.0000271967,0.9586483,0.001684601,0.0009576529,0.0002308971,0.000001674003,0.0006768296,0.0002508867],"genre_scores_gemma":[0.8137676,0.000005688055,0.1853757,0.0005640423,0.00007325308,0.00003224982,0.000003126324,0.00001731947,0.0001610601],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7762457,"threshold_uncertainty_score":0.7060227,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00113519,0.0001148053,0.0001027677,0.0003226393,0.0001744828,0.00008431303,0.0007109698,0.00008672941,0.0000380625],"category_scores_gemma":[0.0001100765,0.0001187633,0.00005601191,0.000483204,0.00004461453,0.0007183085,0.000008858041,0.0004958819,0.0001332604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000043565,"about_ca_system_score_gemma":0.00003869354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001352497,"about_ca_topic_score_gemma":0.00002886668,"domain_scores_codex":[0.9988635,0.0002240725,0.0002600611,0.0002762862,0.0001906036,0.0001854971],"domain_scores_gemma":[0.9987195,0.0005072736,0.00007626812,0.0005849377,0.00005485753,0.00005718308],"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.00002373404,0.0001371123,0.00002297682,0.000008560544,0.000007570937,0.000002491614,0.001568717,0.0460907,0.002212618,0.3179201,0.000008642869,0.6319968],"study_design_scores_gemma":[0.0006619337,0.00008045595,0.003788924,0.00002249172,0.000007019355,0.00003492052,0.00008767182,0.4677362,0.01491933,0.5116869,0.0006712209,0.0003028696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05752783,0.00000476579,0.9396212,0.0002946956,0.0009773024,0.0001584397,0.000001552609,0.0002060069,0.001208254],"genre_scores_gemma":[0.5644622,0.000001949345,0.4352264,0.000169869,0.00001486288,0.00001947719,0.000001373576,0.000006959614,0.00009692495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6316939,"threshold_uncertainty_score":0.4843029,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003393485,0.0001101505,0.0001077451,0.0001457108,0.0002607686,0.00007538553,0.0009734326,0.00003945286,0.0002805917],"category_scores_gemma":[0.00008000217,0.00007807698,0.00009429357,0.0004362713,0.0001498577,0.0002428374,0.00001698201,0.0001827942,0.0001615479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001411806,"about_ca_system_score_gemma":0.00002614658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001514644,"about_ca_topic_score_gemma":0.000001121565,"domain_scores_codex":[0.9989517,0.0002261448,0.0002080073,0.00021798,0.0002597517,0.000136448],"domain_scores_gemma":[0.9959556,0.003178784,0.00008529014,0.0006300492,0.0001067806,0.00004348243],"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.00001075882,0.000225958,0.000002852066,0.000009463473,0.00004418337,4.76945e-7,0.0007325971,0.01673575,0.00006446945,0.6246787,0.000527034,0.3569677],"study_design_scores_gemma":[0.0001722433,0.0001377614,0.0008291645,0.000028193,0.000006620228,0.000003576472,0.0001044488,0.07370329,0.005600055,0.91923,0.00008595137,0.00009872704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02414332,0.00001375205,0.9710922,0.00344901,0.0003178228,0.0002317741,0.000004914523,0.0001351323,0.0006120785],"genre_scores_gemma":[0.9823616,0.000004564886,0.01662308,0.000799021,0.00001392627,0.00006641715,0.000001380527,0.000007130108,0.0001229191],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9582182,"threshold_uncertainty_score":0.3183887,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100273,0.0001440505,0.0001405016,0.0001721949,0.001171808,0.0004419728,0.0009615885,0.00006856003,0.0001145087],"category_scores_gemma":[0.0003206002,0.0001189295,0.0001030686,0.0001941126,0.0002833178,0.0007974052,0.00002166073,0.0003411439,0.0000454141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008718465,"about_ca_system_score_gemma":0.0001057355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003861952,"about_ca_topic_score_gemma":0.0001433894,"domain_scores_codex":[0.9985723,0.0003580195,0.0003162409,0.0003444878,0.0002201558,0.0001888081],"domain_scores_gemma":[0.997565,0.0009674067,0.0001816893,0.001128297,0.0000967363,0.00006092139],"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.00001473894,0.0001136934,0.0002370353,0.000004123826,0.00002223485,0.000003799787,0.0007980784,0.0844228,0.00003889457,0.119606,0.000007354484,0.7947313],"study_design_scores_gemma":[0.001484694,0.0001038512,0.1715965,0.00007721213,0.00004326411,0.00008058206,0.0005987987,0.3256878,0.001034379,0.4982853,0.0005016144,0.000505996],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006900216,0.00001097015,0.9826669,0.007010745,0.0005829487,0.000295191,0.000005938819,0.000162039,0.002365112],"genre_scores_gemma":[0.9631971,0.00001245046,0.0363043,0.0003325741,0.00001781254,0.00004063312,0.00000224076,0.000007615894,0.00008527005],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9562969,"threshold_uncertainty_score":0.9012721,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001242245,0.0001218269,0.0001085663,0.0001600772,0.0004064978,0.0001285123,0.0002839868,0.00004718304,0.00001274025],"category_scores_gemma":[0.00004968589,0.0001200391,0.00007750523,0.0002548767,0.00005942422,0.0006710665,0.00001126924,0.0001043067,0.000007880514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003206054,"about_ca_system_score_gemma":0.00002735888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003378064,"about_ca_topic_score_gemma":0.000005723486,"domain_scores_codex":[0.9989229,0.0001929274,0.0001765942,0.0002401909,0.0002410726,0.0002263409],"domain_scores_gemma":[0.9987437,0.0007111786,0.00006441456,0.0002902228,0.0001069767,0.0000835133],"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.00001598864,0.0001405428,0.0000241103,0.00001363825,0.00002299671,5.892403e-8,0.001222793,0.001478857,0.00003095772,0.05002008,0.00001331389,0.9470167],"study_design_scores_gemma":[0.0009342564,0.0001761445,0.002224584,0.00003564308,0.00005141463,0.00001785215,0.0002055084,0.3314813,0.0006913748,0.6632473,0.000695185,0.0002394481],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01160017,0.0002409239,0.9861724,0.0004258148,0.0005814933,0.0005321671,0.000003636986,0.0001908459,0.0002525867],"genre_scores_gemma":[0.7811943,0.000006670761,0.2184245,0.0001352425,0.00006029243,0.000124313,0.000008977365,0.000008476538,0.0000373179],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9467772,"threshold_uncertainty_score":0.4895052,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008819313,0.0001671922,0.0001867331,0.0001591371,0.0006952517,0.00009686829,0.001072324,0.00005526237,0.00003614458],"category_scores_gemma":[0.0001507274,0.0001342295,0.0001620654,0.0007961213,0.0005851983,0.0002283552,0.00004227322,0.0003569853,0.00009161579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006940599,"about_ca_system_score_gemma":0.000146245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002608762,"about_ca_topic_score_gemma":0.00001372324,"domain_scores_codex":[0.9977918,0.0006747392,0.0003224227,0.0004202286,0.0004960952,0.0002947067],"domain_scores_gemma":[0.9959033,0.002370699,0.000119054,0.001214336,0.0002909813,0.0001016274],"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.0002264374,0.0003517567,0.000006069066,0.00002018584,0.00007796696,0.00001410703,0.000780782,0.02925887,0.001399567,0.7008773,0.00003912235,0.2669478],"study_design_scores_gemma":[0.0006974584,0.0002396521,0.0008420419,0.00004077289,0.000009809805,0.00001578556,0.0002652961,0.01756349,0.0338545,0.9460585,0.0002527987,0.0001599583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01639549,0.00003886478,0.9794679,0.002101051,0.0003134787,0.0002901537,0.00001480693,0.0001148453,0.001263397],"genre_scores_gemma":[0.9595855,0.00002663054,0.03944494,0.0002656011,0.00002000219,0.00003541945,0.000006494564,0.00001765497,0.0005977005],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.94319,"threshold_uncertainty_score":0.547372,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005058676,0.0002249425,0.0002182623,0.0001616413,0.0008476854,0.0002500356,0.001174065,0.0001022252,0.000210706],"category_scores_gemma":[0.00007184614,0.0002488394,0.0001473752,0.0009757881,0.0002204749,0.0007730895,0.00005939778,0.0004494766,0.0003787909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001501686,"about_ca_system_score_gemma":0.00006768842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001637907,"about_ca_topic_score_gemma":0.00002003737,"domain_scores_codex":[0.9980136,0.0004304959,0.0004012464,0.0005329894,0.0003515001,0.0002702368],"domain_scores_gemma":[0.9965017,0.001522754,0.0001820522,0.001436879,0.0002558208,0.0001007619],"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.00009878689,0.0009836112,0.0001400305,0.00002085104,0.0001650853,0.000003138363,0.001120692,0.04960777,0.0008150174,0.206019,0.0002533904,0.7407726],"study_design_scores_gemma":[0.0005131739,0.0001567009,0.005327256,0.00005920656,0.00002476291,0.0000176877,0.0001109056,0.2268593,0.0006589305,0.7652123,0.0007460005,0.0003137769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04007465,0.00005521957,0.9558597,0.001121269,0.00119382,0.0003061208,0.00008833563,0.0005369984,0.0007638394],"genre_scores_gemma":[0.8160328,0.000007046086,0.1833197,0.0002262986,0.00004291502,0.00002676579,0.0001824296,0.00001471957,0.0001472379],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7759582,"threshold_uncertainty_score":0.9999964,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001074334,0.0001498489,0.0002139474,0.0001429675,0.0006245504,0.0001486624,0.0008217563,0.00006828317,0.0003203564],"category_scores_gemma":[0.0001125941,0.0001473101,0.0001678582,0.0005150653,0.0004140199,0.0005054348,0.00002754757,0.0001969124,0.0006724843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004666997,"about_ca_system_score_gemma":0.00003657637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001580996,"about_ca_topic_score_gemma":0.00001341416,"domain_scores_codex":[0.998108,0.0008281649,0.0003112876,0.0003048519,0.0002593797,0.0001883707],"domain_scores_gemma":[0.996501,0.002215032,0.0001195494,0.0008855729,0.0002090842,0.00006973142],"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.007697687,0.000218532,0.000001224826,0.000005936142,0.0001113867,0.000001010349,0.001474603,0.001772364,0.00001335202,0.6401271,0.0002013864,0.3483755],"study_design_scores_gemma":[0.03767036,0.0001215475,0.00004230448,0.00002960413,0.00003679908,0.000009349107,0.0000775127,0.1093888,0.001256996,0.8503853,0.0007566306,0.0002247409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003432192,0.00002482235,0.9875635,0.001243318,0.001062075,0.0002702643,0.000003912172,0.0004084586,0.005991466],"genre_scores_gemma":[0.8482421,0.00002977941,0.1510001,0.0003860607,0.00006243955,0.00006414462,0.00001176276,0.00001060204,0.0001930255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8448099,"threshold_uncertainty_score":0.864365,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008630455,0.000177768,0.000314113,0.0002281106,0.000619966,0.0001971188,0.0006190187,0.00007435343,0.00001465084],"category_scores_gemma":[0.0001098256,0.0001711297,0.0001306877,0.0003470418,0.0002024486,0.0004436848,0.00001915598,0.0002491453,0.0000162125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002693357,"about_ca_system_score_gemma":0.00003725472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008159292,"about_ca_topic_score_gemma":0.00000425109,"domain_scores_codex":[0.9983197,0.0006053537,0.0003923627,0.0003361953,0.0001666763,0.0001797433],"domain_scores_gemma":[0.9962049,0.002727644,0.0001349372,0.0007347501,0.0001003418,0.00009742596],"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.0007285625,0.0002053698,0.00000404361,0.000008546092,0.00006390709,0.000001316698,0.001880153,0.002961593,0.0001234321,0.1266325,0.00002396575,0.8673666],"study_design_scores_gemma":[0.01219857,0.0001512722,0.0006388973,0.00002470616,0.00005578501,0.00001049101,0.00004507547,0.3603275,0.0005033606,0.6257399,0.00007426801,0.0002302254],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004819938,0.0000781967,0.9919532,0.001833179,0.0001281609,0.0004566872,0.00001186645,0.0002895906,0.0004292069],"genre_scores_gemma":[0.8116878,0.00003132677,0.1876633,0.000435743,0.00001932616,0.00003434189,0.00001625785,0.000006196356,0.0001056443],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8671364,"threshold_uncertainty_score":0.6978466,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007850204,0.00008459967,0.00009120652,0.00009574671,0.000404343,0.00008159564,0.0008200089,0.00003303953,0.000006805405],"category_scores_gemma":[0.000062636,0.00006472084,0.00008690533,0.0003748688,0.0001018885,0.0002632943,0.00001750798,0.0001248578,0.00001653287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008464091,"about_ca_system_score_gemma":0.00001574167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003165451,"about_ca_topic_score_gemma":0.000002889037,"domain_scores_codex":[0.9990301,0.0002591361,0.0002009329,0.0001905731,0.0001890269,0.0001302704],"domain_scores_gemma":[0.9980036,0.001146393,0.00008554121,0.0006550709,0.00006945545,0.00003994302],"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.00001431878,0.00004060934,0.000007500276,0.000005582742,0.00001495755,1.403293e-7,0.0004243058,0.00177856,0.00007422223,0.6757676,0.00001671806,0.3218555],"study_design_scores_gemma":[0.000245957,0.00008060332,0.0009045186,0.00001697391,0.000009708676,0.000002964375,0.00004865153,0.02361074,0.003822608,0.9682961,0.002863681,0.00009748904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009431102,0.00001723208,0.9888892,0.0005198556,0.0004964262,0.00009020069,0.000003929584,0.000109539,0.0004424915],"genre_scores_gemma":[0.9567579,0.00001533891,0.0430298,0.0001505443,0.00001636117,0.000009364945,0.000002631722,0.000005112704,0.00001293334],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9473268,"threshold_uncertainty_score":0.3109921,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010853,0.0001624665,0.0001806057,0.0000812461,0.001158672,0.0001288776,0.002066155,0.00004930772,0.00001395725],"category_scores_gemma":[0.00005799959,0.0001050347,0.0002020495,0.0006601175,0.0007917694,0.0001773887,0.00005303015,0.0002989203,0.00002963177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000346815,"about_ca_system_score_gemma":0.00006404733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001781061,"about_ca_topic_score_gemma":0.00001853571,"domain_scores_codex":[0.9978707,0.0008022533,0.0003741046,0.0003016151,0.0004185614,0.000232771],"domain_scores_gemma":[0.9967499,0.001698798,0.0001978047,0.001143305,0.0001496066,0.00006052677],"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.00001052416,0.00009734368,0.000008246813,0.000009710499,0.00003121136,9.96914e-8,0.0004305709,0.01695308,0.00005023359,0.8453132,0.0000736931,0.1370221],"study_design_scores_gemma":[0.0002876801,0.00007904666,0.001738594,0.0000266958,0.00001327665,0.00000994139,0.00005138722,0.1160092,0.001569792,0.8787436,0.001348616,0.0001221812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002292408,0.00003420248,0.9921355,0.002555746,0.00075673,0.0003010252,0.000008114122,0.0001415249,0.001774793],"genre_scores_gemma":[0.9657438,0.00000497516,0.03357435,0.0004698028,0.0000337436,0.00002473984,0.000001262106,0.00001006018,0.0001372541],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9634514,"threshold_uncertainty_score":0.8911685,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008589241,0.0001955927,0.0001491271,0.0001657567,0.0007410055,0.0002033519,0.0008903113,0.00007123094,0.0001312253],"category_scores_gemma":[0.00006877853,0.0001531071,0.000113855,0.0005510605,0.0001179338,0.000268845,0.00001830931,0.0003546689,0.0002403106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005092007,"about_ca_system_score_gemma":0.00003190543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000197676,"about_ca_topic_score_gemma":0.00001039933,"domain_scores_codex":[0.9980968,0.0005644754,0.0002474687,0.0004402433,0.0004019576,0.0002490928],"domain_scores_gemma":[0.9972185,0.001661553,0.000103841,0.0008401161,0.00009514621,0.00008077612],"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.0000746565,0.0002703559,0.000001387418,0.000007668195,0.00005872992,4.468616e-7,0.0003347845,0.009540884,0.0002823544,0.5442484,0.0009637518,0.4442166],"study_design_scores_gemma":[0.0005590005,0.0005395418,0.0002452252,0.00003457399,0.00002577438,0.00000503433,0.00004633241,0.1185972,0.004116989,0.8732224,0.002341371,0.0002666043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006718135,0.00001560713,0.9866597,0.003580629,0.0007416792,0.0002984267,0.00001142179,0.0003382599,0.001636162],"genre_scores_gemma":[0.9869106,0.000006368816,0.009869576,0.002556607,0.00004977724,0.00003689267,0.00001311213,0.00001690218,0.0005401318],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9801925,"threshold_uncertainty_score":0.6243527,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006263256,0.0001999919,0.0002582298,0.0002675847,0.0007088485,0.00004761675,0.001017055,0.00003573583,0.00008208127],"category_scores_gemma":[0.00004026754,0.0001947279,0.0001666289,0.0008542851,0.000149519,0.000094022,0.00007955408,0.0004873067,0.00001433198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000746245,"about_ca_system_score_gemma":0.00007227298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001691111,"about_ca_topic_score_gemma":0.000001628694,"domain_scores_codex":[0.9978328,0.0006030943,0.0003791529,0.0004464274,0.0004932931,0.0002451993],"domain_scores_gemma":[0.9980561,0.0008593595,0.0001966866,0.0007160202,0.0000884682,0.00008335034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009684522,0.0004079163,0.000002033287,0.00001462923,0.00003608788,0.00000703477,0.0008067884,0.8211753,0.00005801719,0.08928695,0.00005543653,0.08805299],"study_design_scores_gemma":[0.000514579,0.0007242382,0.0003058289,0.00001967628,0.00001055585,0.00002755139,0.0001363138,0.7326056,0.0008117092,0.2644335,0.0002299078,0.0001804994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0664774,0.00001589141,0.9300806,0.001966895,0.0006590902,0.0002001577,0.0002808304,0.0002753295,0.00004381067],"genre_scores_gemma":[0.9807414,0.000001543301,0.01870585,0.0003664574,0.00002902569,0.00002913361,0.00007496071,0.00001632997,0.00003526878],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.914264,"threshold_uncertainty_score":0.7940771,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006241495,0.0001770873,0.000154758,0.00007036678,0.0004833049,0.0001962759,0.00147961,0.0000560239,0.00009818589],"category_scores_gemma":[0.0001427216,0.0001388407,0.0001097344,0.0006824517,0.0001377192,0.0004807382,0.00004462378,0.0004040725,0.0003020835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003442356,"about_ca_system_score_gemma":0.00005113405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002309832,"about_ca_topic_score_gemma":0.000005258087,"domain_scores_codex":[0.99803,0.0005425806,0.0002529449,0.0004782026,0.0004136276,0.0002826198],"domain_scores_gemma":[0.9964507,0.002560833,0.00009724512,0.0006773999,0.0001009928,0.0001128484],"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.0002075352,0.0001303197,0.00004774964,0.00001856123,0.0001721671,0.00001188775,0.007783498,0.1462058,0.001919257,0.2187688,0.0001635812,0.6245708],"study_design_scores_gemma":[0.0006553041,0.0001095477,0.0003014106,0.00002763319,0.00001986385,0.000004848252,0.0005492303,0.2399157,0.005161627,0.7504094,0.002557639,0.0002878082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003839887,0.00006456254,0.9854923,0.008966674,0.0001715063,0.0002876934,0.00002822237,0.0004093983,0.0007397509],"genre_scores_gemma":[0.9231229,0.000007984004,0.07078917,0.005795187,0.0001019441,0.00003988558,0.000006163732,0.0000325562,0.0001042326],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.919283,"threshold_uncertainty_score":0.5661759,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009338497,0.000165979,0.0001775916,0.0001137583,0.0004175318,0.0001242111,0.0008191528,0.00004978961,0.00000473131],"category_scores_gemma":[0.0001002352,0.0001252612,0.00006246955,0.0003242391,0.0004314297,0.000131252,0.0000403482,0.0002906721,0.00001112608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003539431,"about_ca_system_score_gemma":0.00006609286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001329411,"about_ca_topic_score_gemma":0.000007894706,"domain_scores_codex":[0.9984652,0.0004647767,0.0003021208,0.0002941532,0.0003015385,0.0001722319],"domain_scores_gemma":[0.9973561,0.001361505,0.0001834186,0.0008627623,0.0001509078,0.00008530149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000126492,0.0004554251,0.00001018068,0.00004669336,0.00005969231,0.000003548547,0.007182064,0.2398942,0.00005855563,0.5465094,0.0001436114,0.2055101],"study_design_scores_gemma":[0.0002907936,0.0003224803,0.0002366726,0.00007817704,0.000008823664,0.00001440997,0.0001174899,0.5691168,0.0001289532,0.4292701,0.0002952512,0.0001200799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05770386,0.00008686473,0.9390102,0.002324783,0.0002666056,0.0002223642,0.000008267129,0.0001229998,0.000254071],"genre_scores_gemma":[0.9730549,0.000006587774,0.02650168,0.0003398286,0.00001538772,0.00001628866,0.000003477071,0.0000119844,0.00004986479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.915351,"threshold_uncertainty_score":0.5108002,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001528623,0.0002430738,0.000253125,0.0008113611,0.0004938027,0.000253913,0.0009067212,0.000109765,0.000009182965],"category_scores_gemma":[0.0002318254,0.0002516461,0.0002226471,0.001434673,0.00009968886,0.001549922,0.00002073391,0.0003083477,0.00002985762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002563771,"about_ca_system_score_gemma":0.0002390498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000106049,"about_ca_topic_score_gemma":0.00000257589,"domain_scores_codex":[0.9976988,0.0003545051,0.0004612862,0.0004810336,0.0005160232,0.0004883428],"domain_scores_gemma":[0.9972833,0.001468225,0.0001292171,0.0005547862,0.0003238031,0.0002406457],"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.0001333911,0.0001719032,0.000006844351,0.00004109952,0.00008332029,0.00000213106,0.003647063,0.7575537,0.0004336571,0.03556337,0.00003276054,0.2023307],"study_design_scores_gemma":[0.001686696,0.0003009098,0.00002789866,0.00005223946,0.00003440508,0.00002892288,0.0005122857,0.4785227,0.002940081,0.5150125,0.0005228475,0.0003585592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008839373,0.0000843204,0.9884882,0.0004653172,0.0006348339,0.0008990341,0.00002523235,0.0003506345,0.0002130766],"genre_scores_gemma":[0.7815468,0.000007369141,0.2180511,0.0001525929,0.00004618763,0.0001000816,0.000009964298,0.00002975565,0.00005606589],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7727075,"threshold_uncertainty_score":0.9999936,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005559132,0.0002158179,0.0001918543,0.0002987717,0.0006980124,0.0002566536,0.000570156,0.00006039575,0.000007324746],"category_scores_gemma":[0.00005411901,0.0001858552,0.0001085707,0.0005805158,0.00007501784,0.0001970256,0.00001650431,0.0002737834,0.0000101516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007391073,"about_ca_system_score_gemma":0.0001052434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005741022,"about_ca_topic_score_gemma":0.00000395884,"domain_scores_codex":[0.9984775,0.0002049098,0.000256448,0.0004776976,0.0002793469,0.0003041589],"domain_scores_gemma":[0.9982194,0.0009920667,0.0001038099,0.0003990651,0.0002228891,0.00006277604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001652976,0.0002426352,0.00001820694,0.00003200452,0.0001108643,0.000001887684,0.0006150723,0.6469666,0.0001996502,0.008328447,0.0000604682,0.3432589],"study_design_scores_gemma":[0.001248019,0.001020833,0.0001305196,0.0001727387,0.00004036601,0.000008335162,0.0001105602,0.8029749,0.003271328,0.1889749,0.001748678,0.0002988984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01985977,0.00004962758,0.9771881,0.00122288,0.0007291675,0.0003085106,0.00000398412,0.0004346945,0.0002033354],"genre_scores_gemma":[0.840829,0.000002715166,0.1580924,0.0005304124,0.00002758148,0.00004164195,0.000008858819,0.00001941739,0.000447987],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8209692,"threshold_uncertainty_score":0.7578954,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002489014,0.0002087822,0.0002330719,0.0001177265,0.0004566093,0.0002085647,0.0008904076,0.00008996283,0.0001116802],"category_scores_gemma":[0.00004539921,0.0002171725,0.000240246,0.0005075455,0.0001286959,0.0003626008,0.00002028438,0.0002243491,0.00008564003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004425409,"about_ca_system_score_gemma":0.00008280271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001276575,"about_ca_topic_score_gemma":0.000005149437,"domain_scores_codex":[0.9984345,0.0001679409,0.000315013,0.0005589334,0.0002750596,0.0002485452],"domain_scores_gemma":[0.9980556,0.001094404,0.00008378217,0.0004676618,0.0001195385,0.0001789653],"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.0002414684,0.000230208,0.000003231716,0.00002197445,0.0001440505,0.000008363829,0.00184701,0.06103642,0.0001870647,0.07629918,0.0005210148,0.85946],"study_design_scores_gemma":[0.001863139,0.0003285836,0.00004316983,0.0000162648,0.00003707161,0.000004153711,0.0001184914,0.4032846,0.002765071,0.5881366,0.00307924,0.0003236518],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003036403,0.0000941903,0.9925052,0.002309307,0.001133498,0.0003123748,0.00007762099,0.0004003297,0.0001311089],"genre_scores_gemma":[0.8595466,0.000009288259,0.1366723,0.003447784,0.0001809503,0.00005945395,0.00002470188,0.00002208651,0.00003680062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8591363,"threshold_uncertainty_score":0.8856038,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919316,0.0001337218,0.0001523156,0.0002277191,0.0001944856,0.00006466138,0.0003934183,0.00006776708,0.00005567747],"category_scores_gemma":[0.00002547997,0.0001061567,0.00007728391,0.0002115788,0.00008543737,0.0008812,0.00001549498,0.00009185685,0.000009681668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002168078,"about_ca_system_score_gemma":0.00003774272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008862082,"about_ca_topic_score_gemma":0.000006507683,"domain_scores_codex":[0.998873,0.0001433797,0.0002922353,0.0003279086,0.0002105385,0.0001529157],"domain_scores_gemma":[0.9982021,0.0009949587,0.000131254,0.0004927993,0.00009768893,0.00008115031],"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.00003776724,0.0001343848,0.000006244747,0.00000920945,0.00002117682,0.000001949401,0.0004559146,0.001266249,0.00172804,0.06569683,0.000003775475,0.9306385],"study_design_scores_gemma":[0.0008648668,0.0004771732,0.005645551,0.00005673048,0.00002074404,0.0000230167,0.00005357571,0.05374703,0.010461,0.9282351,0.0001623681,0.0002527984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03834011,0.00001476601,0.9604437,0.0003656574,0.0003428026,0.0001300058,0.00001202686,0.0001147454,0.0002361831],"genre_scores_gemma":[0.780521,0.000008279434,0.2192585,0.0001022709,0.00002150741,0.00000710998,0.000001512054,0.000008108087,0.0000716896],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9303856,"threshold_uncertainty_score":0.4328946,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001078779,0.0001542516,0.0001628139,0.0002999497,0.0003502843,0.0001364247,0.0006270536,0.00005827809,0.000007166023],"category_scores_gemma":[0.0003330322,0.0001557609,0.00005339482,0.0004921313,0.00004919494,0.000427189,0.00003103848,0.0001631107,0.00007693173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004323384,"about_ca_system_score_gemma":0.0000524697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003982998,"about_ca_topic_score_gemma":0.000002954758,"domain_scores_codex":[0.9984969,0.0002212453,0.0002388239,0.0005081928,0.0002427046,0.0002921677],"domain_scores_gemma":[0.9966788,0.002333043,0.00006176149,0.0005699635,0.0001420206,0.0002144152],"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.0005148509,0.00006402897,0.000002154078,0.00001890145,0.0000301402,7.926191e-7,0.0009107501,0.04367115,0.0004748739,0.2263628,0.0004318542,0.7275177],"study_design_scores_gemma":[0.002932176,0.0006639303,0.000207117,0.00003833967,0.00001451398,0.00001161697,0.00004712655,0.08070351,0.004942137,0.9017888,0.008330766,0.0003199663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002869049,0.00001403087,0.9936053,0.00188518,0.0004729422,0.0004541438,0.00001570286,0.0002141674,0.0004695531],"genre_scores_gemma":[0.5318277,0.000006443612,0.4649021,0.0008466137,0.00006551281,0.00008149273,0.0000048699,0.00002429936,0.00224095],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7271977,"threshold_uncertainty_score":0.6351746,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281268,0.0001862936,0.0001654942,0.0002372576,0.0003488794,0.0004950736,0.000401659,0.00009840404,0.00006245139],"category_scores_gemma":[0.00004516745,0.0001795777,0.0001354015,0.0006424625,0.00007517738,0.0003329175,0.00001128389,0.000232835,0.0001098016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001002636,"about_ca_system_score_gemma":0.0001088147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002161118,"about_ca_topic_score_gemma":0.000003151587,"domain_scores_codex":[0.9986207,0.000157658,0.0002637847,0.0004974283,0.0001859977,0.0002744579],"domain_scores_gemma":[0.9972879,0.002023052,0.00003538451,0.0003820737,0.0001479986,0.0001236446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000317575,0.00009803992,5.673751e-8,0.00003270484,0.00005131586,0.000005859084,0.0001423957,0.2218646,0.00001052072,0.2795029,0.001159401,0.4971005],"study_design_scores_gemma":[0.0002969938,0.0001436193,0.000007072078,0.00003383393,0.00002532223,0.00002403376,0.00002872663,0.7568299,0.0003075866,0.2350485,0.007079611,0.0001747952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001246288,0.0001666778,0.9944875,0.0007470043,0.002715457,0.0003116076,0.00008820822,0.0008899396,0.0004690254],"genre_scores_gemma":[0.689423,0.00001816569,0.308469,0.0001470729,0.0001398819,0.000114061,0.00004764643,0.00003657912,0.001604554],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6892984,"threshold_uncertainty_score":0.7322967,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004524167,0.0003275465,0.0002868085,0.0006912423,0.000650108,0.0003567763,0.001588216,0.0001208922,0.0008032244],"category_scores_gemma":[0.00003358842,0.0003386855,0.0002487943,0.001380111,0.000145163,0.0008964206,0.00006233762,0.0003792356,0.00194852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006823735,"about_ca_system_score_gemma":0.00005008528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001213172,"about_ca_topic_score_gemma":0.000007288391,"domain_scores_codex":[0.9975102,0.0002408046,0.000449901,0.0008121462,0.000514151,0.0004728063],"domain_scores_gemma":[0.9974416,0.0006744619,0.0001150005,0.001254676,0.0002178183,0.0002964092],"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.00004731842,0.0006354603,0.000006329607,0.00002281833,0.0001310925,0.00000889794,0.003335641,0.009674122,0.002073959,0.152705,0.005461391,0.825898],"study_design_scores_gemma":[0.0009691716,0.0005266464,0.001731584,0.0000681064,0.00003270117,0.00005434944,0.0002250215,0.04354226,0.008327588,0.9398653,0.003892917,0.0007643589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01123037,0.00003893842,0.9747881,0.0108868,0.00132649,0.0006157247,0.00002665432,0.0005500634,0.0005369022],"genre_scores_gemma":[0.7651397,0.0000204157,0.222965,0.01065383,0.00008078548,0.0002051624,0.000009548147,0.00003363609,0.0008919344],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8251336,"threshold_uncertainty_score":0.9999065,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003592797,0.0001032709,0.0001358889,0.0003161846,0.0001687059,0.00003708161,0.000414353,0.00005822145,0.00002580684],"category_scores_gemma":[0.00007739753,0.0001040293,0.00008779496,0.0005539508,0.0000583516,0.0001878,0.000009625879,0.000203519,0.00002594444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002699357,"about_ca_system_score_gemma":0.00006421826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001269073,"about_ca_topic_score_gemma":0.000002526448,"domain_scores_codex":[0.9990079,0.0002169518,0.0002585163,0.0002610435,0.0001387352,0.0001168932],"domain_scores_gemma":[0.9988062,0.0005557569,0.0000919481,0.0003979985,0.000114592,0.00003352572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008066369,0.00007114957,0.00003557345,0.00001651263,0.00002969232,5.772833e-7,0.0002128745,0.04731677,0.0001967966,0.01623873,0.00001038716,0.9358629],"study_design_scores_gemma":[0.001162058,0.0001694287,0.003445887,0.0001555955,0.00003661348,0.00002880574,0.0001747114,0.8080859,0.01791963,0.1681232,0.0004401121,0.0002579958],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009419992,0.00002899884,0.9867142,0.0004504544,0.0008642257,0.0001079363,0.000002455001,0.0002133807,0.002198295],"genre_scores_gemma":[0.9095685,0.000008378137,0.08953622,0.0001581904,0.00001656386,0.000009081158,0.000002063777,0.000005601626,0.0006953586],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9356049,"threshold_uncertainty_score":0.4242191,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001969246,0.0004012985,0.0003580068,0.0004386084,0.0006255886,0.0004660366,0.001581196,0.0002631338,0.00007765429],"category_scores_gemma":[0.0002809417,0.0004204442,0.000322473,0.0006484741,0.0002552441,0.00167009,0.00005154491,0.0003881607,0.0002128482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000314395,"about_ca_system_score_gemma":0.0003420886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002343805,"about_ca_topic_score_gemma":0.000004273807,"domain_scores_codex":[0.9967424,0.0005408236,0.0006729093,0.0008273565,0.0006261822,0.0005902753],"domain_scores_gemma":[0.9968414,0.0007988069,0.0002050316,0.001381621,0.0004582514,0.000314897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002716437,0.002016956,0.00001968689,0.0000981741,0.0003779841,0.00001987066,0.01191992,0.1781721,0.001487807,0.2621926,0.006116779,0.5348617],"study_design_scores_gemma":[0.005808915,0.00246456,0.0002129466,0.00007654828,0.0001589469,0.0001263885,0.0009362809,0.6723976,0.01110514,0.2761085,0.0292,0.001404153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03359198,0.00006484737,0.9597372,0.0007277196,0.003994425,0.0007257567,0.00006189972,0.0005321323,0.0005639671],"genre_scores_gemma":[0.593916,0.000005838919,0.4043199,0.0005157461,0.0002898913,0.000204392,0.00003549054,0.00005074583,0.0006619349],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.560324,"threshold_uncertainty_score":0.9998248,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007994735,0.0002798601,0.0003711378,0.0003129374,0.0003817726,0.0002953084,0.00117836,0.000233331,0.00002070624],"category_scores_gemma":[0.00008446842,0.0003152728,0.0002599767,0.000316905,0.0002103507,0.000316562,0.000173802,0.0004948523,0.000001606703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008514158,"about_ca_system_score_gemma":0.0002317687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003440417,"about_ca_topic_score_gemma":0.00001838339,"domain_scores_codex":[0.9981743,0.0002870252,0.0004769355,0.0005615212,0.0002490738,0.0002512194],"domain_scores_gemma":[0.9965529,0.001448756,0.0002739725,0.001272043,0.0003608211,0.00009145262],"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.0001093011,0.0008165188,0.00001057438,0.0006607854,0.000372244,0.000004260258,0.006354635,0.1025417,0.0003210295,0.04649032,0.00004716258,0.8422714],"study_design_scores_gemma":[0.0005584902,0.0001437286,0.0002577462,0.0003222535,0.00006019802,0.00001735585,0.0002893489,0.372076,0.007270541,0.6186092,0.00007058869,0.0003246165],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01979638,0.0005196274,0.9774914,0.0008233011,0.0006122552,0.0004646717,0.00005353643,0.0001665782,0.00007220006],"genre_scores_gemma":[0.5889301,0.0001998886,0.4104402,0.0001577044,0.00002763972,0.00009451327,0.00005972503,0.0000220673,0.00006810771],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8419468,"threshold_uncertainty_score":0.99993,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002012935,0.0003298189,0.0005708598,0.0005539198,0.000198136,0.0001116836,0.001742214,0.000211755,0.00006590761],"category_scores_gemma":[0.0008896879,0.0002727696,0.000444034,0.001031496,0.0003350536,0.0002237981,0.0001370931,0.0009995409,0.00000836236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001021389,"about_ca_system_score_gemma":0.0002501735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002045346,"about_ca_topic_score_gemma":0.000007202373,"domain_scores_codex":[0.9954554,0.001942671,0.0007292805,0.0008250651,0.000763055,0.0002845327],"domain_scores_gemma":[0.9885243,0.008115385,0.0004437087,0.002155731,0.0006518618,0.0001090596],"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.001225342,0.00143255,0.000009493684,0.0002828304,0.0004191883,0.000004513611,0.002253511,0.4138373,0.006621842,0.3636274,0.00001686407,0.2102692],"study_design_scores_gemma":[0.0004690406,0.0004249037,0.0005466683,0.0002098449,0.00003923522,0.000004503517,0.0003612255,0.01604087,0.04765717,0.9339731,0.0000108047,0.0002625883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2205996,0.00002938455,0.7768423,0.0007826886,0.0005457511,0.0009268991,0.0000442774,0.00009493029,0.0001341751],"genre_scores_gemma":[0.9236124,0.00002609839,0.07586382,0.0001995711,0.0000106303,0.0002214167,0.00001420773,0.00002352324,0.00002828454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7030129,"threshold_uncertainty_score":0.9999725,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001334731,0.0001271421,0.0001185118,0.00003923514,0.0003207909,0.0000977812,0.0001759662,0.00002864098,0.0001455351],"category_scores_gemma":[0.000009437996,0.0001327865,0.00007728635,0.0003036125,0.00002479162,0.0001369148,0.000005706315,0.0002230191,0.000150626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009888359,"about_ca_system_score_gemma":0.00007106894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001083795,"about_ca_topic_score_gemma":2.488733e-7,"domain_scores_codex":[0.9992594,0.00005086025,0.0002067596,0.0002329561,0.0001098006,0.0001402341],"domain_scores_gemma":[0.9992397,0.0003403673,0.00007868079,0.0001611166,0.00008895839,0.00009111041],"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.0000426025,0.0003014847,0.00005200457,0.00002895271,0.0001235572,0.00000132618,0.00134549,0.2857555,0.0174714,0.2970893,0.00006447929,0.3977239],"study_design_scores_gemma":[0.000480027,0.0001025437,0.0001315311,0.00003087965,0.00004393666,3.725348e-7,0.00241617,0.2813024,0.009543271,0.705386,0.0002887775,0.0002740659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09041386,0.000003744651,0.9071826,0.000469425,0.00007666621,0.0001580182,0.00003267225,0.0001037431,0.001559312],"genre_scores_gemma":[0.9862827,4.523577e-7,0.01309773,0.0003663958,0.000148833,0.00003652065,0.00003354194,0.00001937968,0.00001445942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8958688,"threshold_uncertainty_score":0.5414875,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007994198,0.0005799989,0.0005691786,0.0007181307,0.0005494386,0.0008370986,0.002192266,0.0003319043,0.0002172288],"category_scores_gemma":[0.00004517657,0.0005738757,0.0004907791,0.001146173,0.0002211031,0.0004170148,0.0002043485,0.001360679,0.000113153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001210493,"about_ca_system_score_gemma":0.0003895683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003579724,"about_ca_topic_score_gemma":0.00001519933,"domain_scores_codex":[0.9960048,0.0006810456,0.0005929656,0.001365221,0.0008854449,0.0004705092],"domain_scores_gemma":[0.9958814,0.001023628,0.0002747796,0.002089313,0.0005135829,0.0002172802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007385234,0.0008541704,0.000003471789,0.0001022385,0.0004666891,0.00009364686,0.001347395,0.451654,0.00005874229,0.01046801,0.0001485413,0.5347293],"study_design_scores_gemma":[0.001355154,0.0004383714,0.0006004745,0.0005007617,0.0001735545,0.0001418798,0.0002150525,0.4965173,0.003312596,0.4947328,0.0004501322,0.00156192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003951311,0.0002995053,0.9909008,0.001288994,0.00182032,0.0005129525,0.00006101013,0.0008049017,0.0003602273],"genre_scores_gemma":[0.2506379,0.000115577,0.7469431,0.0007893598,0.0001892141,0.0001997732,0.0002166443,0.00008449242,0.0008239967],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5331674,"threshold_uncertainty_score":0.9996713,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006001308,0.0001635032,0.0003554659,0.0004539382,0.0002511465,0.0000121763,0.0003499374,0.0001235611,0.00009509845],"category_scores_gemma":[0.0002325473,0.0001474925,0.0002001225,0.0005792934,0.0001846126,0.000102399,0.00001512984,0.0002078678,0.000001652596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002775413,"about_ca_system_score_gemma":0.00006795622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001217319,"about_ca_topic_score_gemma":0.000007011181,"domain_scores_codex":[0.9987229,0.0001863707,0.0005267748,0.0001983104,0.0002030969,0.0001625793],"domain_scores_gemma":[0.9974256,0.001601733,0.0002193044,0.0004674326,0.0002513254,0.00003463891],"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.0005515855,0.0004568855,0.0000746775,0.0004793289,0.0004501038,0.000001073356,0.002171011,0.01224974,0.001256796,0.9215737,0.0001041631,0.06063092],"study_design_scores_gemma":[0.0007872751,0.0001212424,0.0003589862,0.0001493983,0.0001300428,0.000002712439,0.000560692,0.001118537,0.02653277,0.9700381,0.00007614012,0.000124109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3947221,0.00005050683,0.6003723,0.00008562578,0.0005519501,0.0002709136,0.00002524998,0.00007808928,0.003843215],"genre_scores_gemma":[0.9677123,0.00002034048,0.03129452,0.00006757861,0.000007350771,0.00001834518,0.000003036325,0.00001883922,0.0008577039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5729901,"threshold_uncertainty_score":0.6014569,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003829067,0.0001568297,0.0001510054,0.000231809,0.0004137547,0.0002703645,0.0005659999,0.00005628434,0.00001067399],"category_scores_gemma":[0.00001994268,0.0001566746,0.00007880419,0.0007701685,0.00009338865,0.0004138129,0.00003748914,0.0002106025,0.0000840825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002415804,"about_ca_system_score_gemma":0.00003085677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003663937,"about_ca_topic_score_gemma":0.0000126607,"domain_scores_codex":[0.9986936,0.0001638317,0.0002229908,0.0004383512,0.0002471065,0.0002340796],"domain_scores_gemma":[0.9988226,0.0004958186,0.00006162068,0.0004859286,0.00004398867,0.00009007633],"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.00001712406,0.00009553711,0.00002950517,0.00001560251,0.00003670251,0.000008169654,0.001401999,0.005469963,0.00006655927,0.03040611,0.00002548582,0.9624273],"study_design_scores_gemma":[0.0005691944,0.0001371743,0.002654737,0.00006491186,0.00001089323,0.0000116986,0.00008988346,0.278805,0.0005863448,0.7165086,0.0003301017,0.0002314548],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.029981,0.00001339726,0.9663619,0.0005221708,0.0002760283,0.00195013,0.00001176287,0.0007689306,0.0001146338],"genre_scores_gemma":[0.8645284,0.000008381972,0.1327772,0.0003552282,0.0001040562,0.001921014,0.00005262771,0.00002516965,0.0002278293],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9621958,"threshold_uncertainty_score":0.6389005,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001428091,0.0005353679,0.0004685415,0.001135461,0.0006380466,0.0003392665,0.002711432,0.0003836295,0.0001365463],"category_scores_gemma":[0.0001670784,0.000559258,0.0004244449,0.0009731777,0.000438718,0.0005825033,0.0003268322,0.00157586,0.0002413878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003226351,"about_ca_system_score_gemma":0.0002794726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001672442,"about_ca_topic_score_gemma":0.00001208513,"domain_scores_codex":[0.9955117,0.001156191,0.0005270298,0.001418098,0.0007873756,0.0005995781],"domain_scores_gemma":[0.9945404,0.002245983,0.0003275648,0.002157041,0.0005143486,0.0002146654],"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.0009293655,0.0009239482,0.00005177899,0.000233116,0.001096906,0.00008028698,0.007326727,0.2900924,0.0002640103,0.2818194,0.0003339513,0.416848],"study_design_scores_gemma":[0.0005065664,0.0002805995,0.0007181305,0.0001523426,0.00004053563,0.00001247959,0.0000908135,0.02169567,0.00312221,0.972665,0.0001547848,0.0005608595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0170177,0.0001002038,0.9771973,0.000320826,0.001777079,0.0008012958,0.00005683062,0.0008321336,0.001896575],"genre_scores_gemma":[0.8932021,0.0000670987,0.1052304,0.0003545947,0.000151735,0.000242377,0.00002611779,0.00007740007,0.0006482686],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8761843,"threshold_uncertainty_score":0.9996859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}