{"meta":{"query_hash":"d33bc4190225","filters":{"venue":"ACM Transactions on Computation Theory"},"cohort_total":33,"direct_labels_cover":0,"predictions_cover":33,"exported":33,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/d33bc4190225","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+Transactions+on+Computation+Theory"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02684005737958888,"score_gpt":0.25856516828993625,"score_spread":0.23172511091034736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598457899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011230369,0.00003893842,0.97478807,0.010886798,0.0013264904,0.00061572465,0.000026654316,0.0005500634,0.0005369022],"genre_scores_gemma":[0.7651397,0.000020415704,0.222965,0.0106538255,0.00008078548,0.00020516237,0.000009548147,0.000033636094,0.0008919344],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975102,0.0002408046,0.000449901,0.00081214623,0.000514151,0.0004728063],"domain_scores_gemma":[0.99744165,0.00067446195,0.000115000454,0.0012546764,0.00021781829,0.00029640915],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045241672,0.00032754647,0.00028680847,0.00069124234,0.00065010804,0.0003567763,0.0015882162,0.00012089218,0.0008032244],"category_scores_gemma":[0.00003358842,0.0003386855,0.0002487943,0.0013801114,0.00014516298,0.00089642056,0.00006233762,0.00037923563,0.0019485203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047318415,0.00063546025,0.0000063296075,0.000022818334,0.00013109246,0.0000088979405,0.0033356408,0.009674122,0.0020739585,0.152705,0.005461391,0.825898],"study_design_scores_gemma":[0.0009691716,0.00052664644,0.0017315837,0.000068106405,0.000032701173,0.000054349435,0.0002250215,0.043542262,0.008327588,0.9398653,0.0038929167,0.0007643589],"about_ca_topic_score_codex":0.000121317236,"about_ca_topic_score_gemma":0.000007288391,"teacher_disagreement_score":0.8251336,"about_ca_system_score_codex":0.00006823735,"about_ca_system_score_gemma":0.000050085284,"threshold_uncertainty_score":0.99990654},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04404148439805563,"score_gpt":0.3077857384622144,"score_spread":0.2637442540641588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650544138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033591982,0.00006484737,0.95973724,0.0007277196,0.003994425,0.00072575675,0.00006189972,0.0005321323,0.0005639671],"genre_scores_gemma":[0.593916,0.0000058389187,0.40431994,0.0005157461,0.0002898913,0.00020439195,0.000035490535,0.000050745828,0.0006619349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967424,0.00054082356,0.0006729093,0.0008273565,0.00062618224,0.00059027533],"domain_scores_gemma":[0.9968414,0.0007988069,0.00020503164,0.0013816205,0.00045825136,0.00031489704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001969246,0.00040129852,0.00035800677,0.00043860843,0.00062558864,0.00046603658,0.0015811957,0.00026313376,0.00007765429],"category_scores_gemma":[0.00028094166,0.00042044415,0.00032247297,0.00064847415,0.00025524406,0.0016700896,0.000051544906,0.00038816067,0.0002128482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027164365,0.002016956,0.000019686886,0.000098174096,0.00037798414,0.000019870664,0.0119199185,0.17817213,0.0014878074,0.26219258,0.0061167786,0.5348617],"study_design_scores_gemma":[0.0058089145,0.0024645596,0.00021294656,0.000076548284,0.00015894692,0.00012638849,0.00093628094,0.6723976,0.011105142,0.27610853,0.029199997,0.0014041531],"about_ca_topic_score_codex":0.000023438048,"about_ca_topic_score_gemma":0.0000042738075,"teacher_disagreement_score":0.560324,"about_ca_system_score_codex":0.00031439503,"about_ca_system_score_gemma":0.0003420886,"threshold_uncertainty_score":0.99982476},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04861793686885723,"score_gpt":0.27317143251948756,"score_spread":0.22455349565063032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1663218918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057703864,0.00008686473,0.9390102,0.0023247825,0.00026660558,0.0002223642,0.0000082671295,0.00012299977,0.00025407097],"genre_scores_gemma":[0.9730549,0.0000065877744,0.02650168,0.00033982864,0.00001538772,0.000016288655,0.0000034770705,0.000011984398,0.000049864786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984652,0.00046477673,0.00030212084,0.00029415317,0.0003015385,0.00017223191],"domain_scores_gemma":[0.9973561,0.0013615048,0.00018341861,0.0008627623,0.00015090781,0.00008530149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093384966,0.00016597899,0.00017759165,0.000113758324,0.00041753176,0.0001242111,0.0008191528,0.000049789614,0.0000047313097],"category_scores_gemma":[0.00010023524,0.00012526115,0.000062469546,0.00032423908,0.0004314297,0.00013125196,0.000040348197,0.00029067215,0.000011126076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012649197,0.00045542506,0.000010180675,0.000046693363,0.000059692306,0.0000035485468,0.0071820645,0.2398942,0.000058555634,0.54650944,0.0001436114,0.20551011],"study_design_scores_gemma":[0.00029079363,0.0003224803,0.00023667257,0.000078177036,0.000008823664,0.000014409975,0.00011748991,0.5691168,0.00012895324,0.42927012,0.00029525117,0.00012007985],"about_ca_topic_score_codex":0.0000132941095,"about_ca_topic_score_gemma":0.000007894706,"teacher_disagreement_score":0.91535103,"about_ca_system_score_codex":0.000035394314,"about_ca_system_score_gemma":0.00006609286,"threshold_uncertainty_score":0.5108002},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03570242712076727,"score_gpt":0.3221715244481421,"score_spread":0.28646909732737486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991265104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028690486,0.000014030873,0.99360526,0.0018851805,0.0004729422,0.00045414377,0.000015702863,0.00021416745,0.00046955305],"genre_scores_gemma":[0.5318277,0.000006443612,0.4649021,0.0008466137,0.00006551281,0.00008149273,0.0000048699003,0.000024299361,0.0022409502],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984969,0.00022124528,0.00023882388,0.00050819275,0.00024270455,0.00029216774],"domain_scores_gemma":[0.99667877,0.0023330431,0.000061761486,0.0005699635,0.00014202057,0.00021441515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010787786,0.00015425163,0.00016281393,0.00029994972,0.00035028433,0.00013642471,0.00062705355,0.000058278092,0.0000071660234],"category_scores_gemma":[0.00033303216,0.00015576092,0.000053394822,0.0004921313,0.00004919494,0.000427189,0.000031038482,0.00016311073,0.00007693173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005148509,0.00006402897,0.0000021540784,0.00001890145,0.000030140201,7.926191e-7,0.0009107501,0.04367115,0.0004748739,0.22636282,0.0004318542,0.72751766],"study_design_scores_gemma":[0.0029321765,0.00066393026,0.00020711696,0.00003833967,0.000014513979,0.000011616967,0.000047126552,0.08070351,0.004942137,0.9017888,0.008330766,0.0003199663],"about_ca_topic_score_codex":0.0000039829984,"about_ca_topic_score_gemma":0.0000029547582,"teacher_disagreement_score":0.7271977,"about_ca_system_score_codex":0.00004323384,"about_ca_system_score_gemma":0.000052469695,"threshold_uncertainty_score":0.6351746},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019958542382672806,"score_gpt":0.3078544586707602,"score_spread":0.2878959162880874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007316622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057527833,0.0000047657895,0.93962115,0.00029469555,0.0009773024,0.0001584397,0.0000015526092,0.00020600694,0.0012082544],"genre_scores_gemma":[0.5644622,0.0000019493452,0.43522638,0.00016986902,0.000014862875,0.00001947719,0.0000013735759,0.0000069596144,0.00009692495],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886346,0.00022407254,0.00026006115,0.00027628615,0.00019060358,0.00018549706],"domain_scores_gemma":[0.99871945,0.0005072736,0.00007626812,0.0005849377,0.000054857534,0.00005718308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011351901,0.00011480526,0.00010276772,0.00032263933,0.00017448282,0.000084313026,0.0007109698,0.00008672941,0.0000380625],"category_scores_gemma":[0.00011007653,0.000118763346,0.000056011908,0.00048320403,0.000044614528,0.0007183085,0.000008858041,0.0004958819,0.00013326043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002373404,0.00013711226,0.000022976816,0.000008560544,0.0000075709368,0.0000024916142,0.001568717,0.046090703,0.0022126175,0.31792012,0.000008642869,0.63199675],"study_design_scores_gemma":[0.0006619337,0.000080455946,0.0037889238,0.000022491722,0.0000070193546,0.00003492052,0.00008767182,0.4677362,0.014919332,0.5116869,0.0006712209,0.00030286962],"about_ca_topic_score_codex":0.000013524973,"about_ca_topic_score_gemma":0.000028866676,"teacher_disagreement_score":0.6316939,"about_ca_system_score_codex":0.000043565,"about_ca_system_score_gemma":0.00003869354,"threshold_uncertainty_score":0.48430288},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04217450054507668,"score_gpt":0.2620574507414464,"score_spread":0.2198829501963697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016263640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022924081,0.00003420248,0.99213547,0.0025557457,0.00075673,0.0003010252,0.000008114122,0.00014152488,0.0017747929],"genre_scores_gemma":[0.96574384,0.0000049751598,0.033574346,0.0004698028,0.000033743596,0.000024739838,0.000001262106,0.000010060176,0.00013725413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978707,0.00080225326,0.00037410462,0.00030161513,0.00041856142,0.00023277104],"domain_scores_gemma":[0.99674994,0.0016987982,0.00019780468,0.0011433051,0.00014960661,0.00006052677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010853001,0.00016246647,0.00018060567,0.0000812461,0.0011586719,0.00012887757,0.0020661554,0.000049307724,0.000013957247],"category_scores_gemma":[0.000057999594,0.000105034684,0.00020204949,0.00066011754,0.0007917694,0.00017738868,0.000053030148,0.00029892035,0.000029631774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010524162,0.00009734368,0.000008246813,0.000009710499,0.000031211363,9.96914e-8,0.00043057094,0.016953083,0.00005023359,0.8453132,0.000073693096,0.13702211],"study_design_scores_gemma":[0.00028768013,0.00007904666,0.0017385941,0.000026695801,0.000013276654,0.00000994139,0.000051387222,0.11600922,0.0015697917,0.8787436,0.001348616,0.00012218124],"about_ca_topic_score_codex":0.000017810611,"about_ca_topic_score_gemma":0.000018535711,"teacher_disagreement_score":0.9634514,"about_ca_system_score_codex":0.000034681496,"about_ca_system_score_gemma":0.00006404733,"threshold_uncertainty_score":0.8911685},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023594611815198247,"score_gpt":0.2962639757253391,"score_spread":0.27266936391014085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035762900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048199375,0.000078196696,0.9919532,0.0018331795,0.00012816094,0.00045668724,0.00001186645,0.00028959056,0.0004292069],"genre_scores_gemma":[0.8116878,0.000031326766,0.18766332,0.00043574304,0.00001932616,0.00003434189,0.000016257853,0.0000061963565,0.0001056443],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983197,0.00060535374,0.00039236268,0.00033619528,0.00016667625,0.0001797433],"domain_scores_gemma":[0.9962049,0.0027276436,0.00013493722,0.00073475007,0.00010034176,0.00009742596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008630455,0.00017776804,0.000314113,0.00022811061,0.00061996595,0.00019711877,0.00061901874,0.000074353426,0.0000146508355],"category_scores_gemma":[0.000109825625,0.00017112968,0.00013068765,0.00034704176,0.00020244862,0.0004436848,0.000019155985,0.00024914532,0.0000162125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072856253,0.00020536978,0.0000040436103,0.000008546092,0.000063907086,0.0000013166982,0.0018801532,0.0029615925,0.00012343208,0.12663254,0.000023965746,0.86736655],"study_design_scores_gemma":[0.012198569,0.00015127224,0.0006388973,0.000024706162,0.00005578501,0.000010491009,0.000045075467,0.3603275,0.00050336064,0.6257399,0.00007426801,0.00023022541],"about_ca_topic_score_codex":0.000008159292,"about_ca_topic_score_gemma":0.0000042510896,"teacher_disagreement_score":0.86713636,"about_ca_system_score_codex":0.000026933569,"about_ca_system_score_gemma":0.000037254722,"threshold_uncertainty_score":0.6978466},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016132672164525262,"score_gpt":0.23243034732104328,"score_spread":0.21629767515651802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077484581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067181345,0.000015607131,0.9866597,0.003580629,0.0007416792,0.00029842672,0.000011421792,0.0003382599,0.0016361616],"genre_scores_gemma":[0.98691064,0.000006368816,0.0098695755,0.0025566067,0.000049777238,0.00003689267,0.000013112134,0.000016902179,0.0005401318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809676,0.00056447537,0.00024746868,0.00044024334,0.00040195757,0.00024909276],"domain_scores_gemma":[0.99721855,0.0016615529,0.00010384096,0.00084011606,0.00009514621,0.00008077612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085892406,0.00019559266,0.00014912708,0.00016575668,0.0007410055,0.00020335194,0.00089031126,0.00007123094,0.0001312253],"category_scores_gemma":[0.00006877853,0.00015310712,0.000113855014,0.0005510605,0.000117933756,0.00026884497,0.000018309309,0.0003546689,0.00024031065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000746565,0.00027035593,0.0000013874179,0.000007668195,0.00005872992,4.468616e-7,0.0003347845,0.009540884,0.00028235445,0.5442484,0.0009637518,0.44421658],"study_design_scores_gemma":[0.00055900053,0.00053954177,0.00024522518,0.00003457399,0.000025774385,0.00000503433,0.000046332407,0.1185972,0.004116989,0.87322235,0.002341371,0.00026660433],"about_ca_topic_score_codex":0.000019767602,"about_ca_topic_score_gemma":0.000010399334,"teacher_disagreement_score":0.9801925,"about_ca_system_score_codex":0.00005092007,"about_ca_system_score_gemma":0.00003190543,"threshold_uncertainty_score":0.6243527},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06058992463226921,"score_gpt":0.31744797888938175,"score_spread":0.25685805425711256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134098997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011600171,0.00024092387,0.9861724,0.00042581483,0.00058149325,0.0005321671,0.0000036369859,0.00019084591,0.0002525867],"genre_scores_gemma":[0.78119427,0.0000066707607,0.21842445,0.00013524253,0.000060292426,0.00012431302,0.000008977365,0.000008476538,0.000037317903],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989229,0.00019292737,0.00017659423,0.0002401909,0.0002410726,0.00022634091],"domain_scores_gemma":[0.9987437,0.00071117864,0.00006441456,0.00029022284,0.000106976724,0.000083513296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012422454,0.0001218269,0.0001085663,0.00016007718,0.00040649777,0.00012851227,0.0002839868,0.00004718304,0.000012740252],"category_scores_gemma":[0.00004968589,0.00012003908,0.00007750523,0.00025487674,0.000059424223,0.00067106646,0.000011269235,0.000104306695,0.000007880514],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015988639,0.00014054282,0.000024110295,0.000013638254,0.000022996706,5.892403e-8,0.0012227934,0.0014788568,0.00003095772,0.050020084,0.00001331389,0.94701666],"study_design_scores_gemma":[0.00093425636,0.00017614449,0.002224584,0.000035643083,0.000051414634,0.00001785215,0.0002055084,0.33148134,0.00069137476,0.6632473,0.000695185,0.0002394481],"about_ca_topic_score_codex":0.0000033780639,"about_ca_topic_score_gemma":0.000005723486,"teacher_disagreement_score":0.9467772,"about_ca_system_score_codex":0.000032060543,"about_ca_system_score_gemma":0.000027358878,"threshold_uncertainty_score":0.48950517},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.031245248534134563,"score_gpt":0.2423059758492957,"score_spread":0.21106072731516112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169488047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024143316,0.000013752051,0.9710922,0.00344901,0.00031782276,0.00023177415,0.000004914523,0.00013513233,0.0006120785],"genre_scores_gemma":[0.98236156,0.000004564886,0.01662308,0.00079902104,0.0000139262675,0.00006641715,0.0000013805274,0.000007130108,0.00012291913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989517,0.00022614477,0.00020800735,0.00021797996,0.00025975166,0.00013644797],"domain_scores_gemma":[0.9959556,0.0031787842,0.000085290136,0.0006300492,0.00010678064,0.000043482432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033934845,0.00011015048,0.00010774513,0.00014571082,0.00026076857,0.000075385535,0.0009734326,0.000039452858,0.0002805917],"category_scores_gemma":[0.000080002166,0.00007807698,0.000094293566,0.00043627134,0.00014985766,0.00024283743,0.000016982014,0.00018279419,0.00016154794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010758823,0.00022595802,0.0000028520658,0.000009463473,0.00004418337,4.7694505e-7,0.00073259714,0.01673575,0.00006446945,0.62467873,0.000527034,0.35696772],"study_design_scores_gemma":[0.0001722433,0.00013776144,0.0008291645,0.000028193,0.000006620228,0.000003576472,0.00010444877,0.07370329,0.0056000547,0.91923,0.00008595137,0.00009872704],"about_ca_topic_score_codex":0.000015146436,"about_ca_topic_score_gemma":0.0000011215654,"teacher_disagreement_score":0.9582182,"about_ca_system_score_codex":0.000014118062,"about_ca_system_score_gemma":0.00002614658,"threshold_uncertainty_score":0.31838867},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010059507226578602,"score_gpt":0.24274215220299716,"score_spread":0.23268264497641855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174589003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009431102,0.000017232082,0.9888892,0.00051985565,0.0004964262,0.000090200694,0.000003929584,0.00010953897,0.00044249152],"genre_scores_gemma":[0.9567579,0.000015338912,0.0430298,0.00015054429,0.00001636117,0.000009364945,0.0000026317216,0.0000051127035,0.0000129333375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903005,0.00025913614,0.0002009329,0.00019057312,0.00018902689,0.00013027045],"domain_scores_gemma":[0.9980036,0.0011463925,0.000085541215,0.00065507094,0.000069455455,0.000039943017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007850204,0.00008459967,0.00009120652,0.00009574671,0.00040434304,0.00008159564,0.00082000886,0.00003303953,0.0000068054046],"category_scores_gemma":[0.000062636,0.00006472084,0.000086905326,0.00037486883,0.000101888545,0.00026329426,0.000017507979,0.00012485778,0.000016532875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143187835,0.00004060934,0.000007500276,0.0000055827422,0.000014957552,1.4032926e-7,0.00042430576,0.0017785605,0.00007422223,0.6757676,0.000016718055,0.3218555],"study_design_scores_gemma":[0.00024595697,0.00008060332,0.00090451865,0.00001697391,0.000009708676,0.0000029643752,0.000048651527,0.023610739,0.0038226077,0.9682961,0.0028636812,0.00009748904],"about_ca_topic_score_codex":0.0000031654508,"about_ca_topic_score_gemma":0.000002889037,"teacher_disagreement_score":0.94732684,"about_ca_system_score_codex":0.0000084640915,"about_ca_system_score_gemma":0.000015741665,"threshold_uncertainty_score":0.31099206},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017789636802649125,"score_gpt":0.250754521302626,"score_spread":0.23296488449997688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177209050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015622281,0.000025653328,0.98172754,0.000522364,0.00052891846,0.00018903942,0.00000934531,0.0007457885,0.00062906777],"genre_scores_gemma":[0.9142057,0.000013708677,0.08512212,0.0005275188,0.00005680039,0.000026436146,0.000012081398,0.000017094353,0.000018570205],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823105,0.00038597162,0.00030305103,0.00049013254,0.0003215884,0.0002681835],"domain_scores_gemma":[0.99826914,0.00057857553,0.00011815576,0.0007978698,0.00011536965,0.00012091036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008248196,0.00020315195,0.00018458383,0.00034769153,0.00045312723,0.00019448496,0.0007953363,0.00009692578,0.000059493555],"category_scores_gemma":[0.00005688853,0.00020880562,0.00014239363,0.00061780075,0.0000967446,0.0007201112,0.000018638206,0.00029223668,0.0002032975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005524816,0.00023576804,0.00004314626,0.000025339908,0.00005271967,0.000002267733,0.000935436,0.012468134,0.0007682825,0.49187315,0.000074569616,0.49346593],"study_design_scores_gemma":[0.0009919468,0.00029437756,0.0037834872,0.00006133558,0.000035830068,0.00004136889,0.00010710798,0.12461695,0.0017961701,0.8658623,0.001939923,0.00046917013],"about_ca_topic_score_codex":0.000009049087,"about_ca_topic_score_gemma":0.000006798894,"teacher_disagreement_score":0.8985834,"about_ca_system_score_codex":0.000031787647,"about_ca_system_score_gemma":0.00004476734,"threshold_uncertainty_score":0.8514846},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1535964510606377,"score_gpt":0.36552434887023943,"score_spread":0.21192789780960172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257188417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008839373,0.0000843204,0.9884882,0.0004653172,0.00063483394,0.00089903414,0.000025232348,0.0003506345,0.0002130766],"genre_scores_gemma":[0.78154683,0.0000073691413,0.21805114,0.00015259294,0.000046187626,0.00010008156,0.0000099642975,0.000029755653,0.00005606589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976988,0.0003545051,0.0004612862,0.00048103358,0.0005160232,0.00048834283],"domain_scores_gemma":[0.99728334,0.0014682254,0.00012921711,0.00055478624,0.00032380308,0.0002406457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015286228,0.00024307377,0.00025312504,0.00081136107,0.0004938027,0.000253913,0.0009067212,0.00010976495,0.000009182965],"category_scores_gemma":[0.00023182543,0.0002516461,0.0002226471,0.001434673,0.000099688856,0.0015499224,0.000020733913,0.00030834775,0.000029857621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013339114,0.0001719032,0.0000068443505,0.000041099516,0.00008332029,0.00000213106,0.0036470632,0.7575537,0.00043365706,0.03556337,0.00003276054,0.20233074],"study_design_scores_gemma":[0.0016866961,0.00030090983,0.000027898663,0.00005223946,0.00003440508,0.00002892288,0.0005122857,0.47852266,0.0029400813,0.5150125,0.0005228475,0.00035855925],"about_ca_topic_score_codex":0.0000106049,"about_ca_topic_score_gemma":0.0000025758904,"teacher_disagreement_score":0.77270746,"about_ca_system_score_codex":0.00025637713,"about_ca_system_score_gemma":0.00023904975,"threshold_uncertainty_score":0.99999356},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019020761596398737,"score_gpt":0.2617099762310813,"score_spread":0.24268921463468254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569934227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03752192,0.000027196696,0.9586483,0.0016846012,0.00095765287,0.00023089707,0.0000016740029,0.0006768296,0.00025088675],"genre_scores_gemma":[0.81376755,0.0000056880554,0.1853757,0.0005640423,0.000073253075,0.000032249824,0.0000031263241,0.00001731947,0.00016106006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853396,0.00021397888,0.00027554564,0.00043954034,0.00025817298,0.00027882343],"domain_scores_gemma":[0.99835885,0.0007322882,0.000095440446,0.00058302644,0.00012662026,0.000103797414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000349824,0.00018697167,0.00014957426,0.00027328933,0.0004942378,0.0002569465,0.0006480297,0.000075347816,0.00007981909],"category_scores_gemma":[0.000044528784,0.00017313467,0.00011630869,0.00053198234,0.00004787661,0.0004247407,0.000021304426,0.00032628092,0.00043778526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000641958,0.000086864056,0.0000025104594,0.0000074538984,0.000023277142,0.000001228213,0.0005233233,0.24080077,0.00031656108,0.022569994,0.0000787183,0.7355829],"study_design_scores_gemma":[0.00022566115,0.00012730941,0.00072782923,0.000025780691,0.000005871775,0.00002980824,0.00005556949,0.64394045,0.0006249526,0.35375538,0.0002908985,0.00019049719],"about_ca_topic_score_codex":0.000033039007,"about_ca_topic_score_gemma":0.0000011077772,"teacher_disagreement_score":0.77624565,"about_ca_system_score_codex":0.000046134137,"about_ca_system_score_gemma":0.000040040966,"threshold_uncertainty_score":0.7060227},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04978698707724363,"score_gpt":0.31415341686769754,"score_spread":0.2643664297904539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570115677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025668586,0.00008340479,0.97191733,0.00047622577,0.0007313661,0.00055498123,0.000024589812,0.00030234086,0.00024115111],"genre_scores_gemma":[0.7977042,0.000003049099,0.2016339,0.0004024276,0.00005378082,0.00010054737,0.000014846739,0.00001531637,0.000071919814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725866,0.00087001064,0.0004987015,0.0005584081,0.0003057063,0.00050851254],"domain_scores_gemma":[0.9957654,0.0028495344,0.00011456159,0.000932544,0.00016209263,0.00017590103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027511134,0.0002637852,0.00039131433,0.00080950087,0.00031801895,0.0001256179,0.0010317976,0.000109749504,0.00010744127],"category_scores_gemma":[0.00014706793,0.00025897333,0.0003308725,0.002075788,0.00014994963,0.00073734205,0.000041958327,0.00025750796,0.000052585256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011572111,0.0011779406,0.0009057587,0.000027172468,0.0003839871,0.0000015615066,0.0035836597,0.1988971,0.000035709505,0.42081496,0.00002200159,0.37403443],"study_design_scores_gemma":[0.0009071007,0.0001630205,0.020496199,0.0000104640385,0.00016554446,0.0000071237914,0.00028526678,0.30780575,0.0007248313,0.66876674,0.0002142348,0.00045373588],"about_ca_topic_score_codex":0.00002001781,"about_ca_topic_score_gemma":0.000033696495,"teacher_disagreement_score":0.7720356,"about_ca_system_score_codex":0.00019740482,"about_ca_system_score_gemma":0.000066312605,"threshold_uncertainty_score":0.99998623},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.039183734717893305,"score_gpt":0.3530785267569117,"score_spread":0.3138947920390184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757265255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017017704,0.000100203804,0.97719735,0.00032082602,0.0017770791,0.0008012958,0.000056830617,0.00083213364,0.0018965754],"genre_scores_gemma":[0.89320207,0.0000670987,0.10523036,0.00035459467,0.00015173502,0.00024237699,0.000026117794,0.00007740007,0.0006482686],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955117,0.0011561906,0.0005270298,0.0014180983,0.0007873756,0.00059957814],"domain_scores_gemma":[0.9945404,0.0022459829,0.00032756478,0.002157041,0.00051434856,0.00021466542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001428091,0.00053536793,0.00046854155,0.0011354615,0.0006380466,0.00033926647,0.0027114318,0.00038362946,0.00013654631],"category_scores_gemma":[0.00016707835,0.00055925804,0.00042444488,0.0009731777,0.00043871798,0.0005825033,0.0003268322,0.0015758597,0.00024138778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092936546,0.0009239482,0.00005177899,0.00023311596,0.0010969063,0.00008028698,0.007326727,0.29009244,0.00026401028,0.28181943,0.0003339513,0.41684803],"study_design_scores_gemma":[0.00050656643,0.0002805995,0.0007181305,0.00015234262,0.00004053563,0.000012479589,0.000090813504,0.021695672,0.0031222096,0.972665,0.00015478482,0.00056085945],"about_ca_topic_score_codex":0.00001672442,"about_ca_topic_score_gemma":0.000012085129,"teacher_disagreement_score":0.87618434,"about_ca_system_score_codex":0.00032263508,"about_ca_system_score_gemma":0.00027947262,"threshold_uncertainty_score":0.9996859},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040741930199470346,"score_gpt":0.3162857808016349,"score_spread":0.2755438506021645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784736141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034321924,0.000024822353,0.9875635,0.0012433182,0.0010620748,0.00027026434,0.000003912172,0.00040845858,0.0059914663],"genre_scores_gemma":[0.8482421,0.000029779414,0.1510001,0.00038606065,0.00006243955,0.000064144624,0.000011762763,0.000010602039,0.00019302547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810797,0.0008281649,0.00031128756,0.0003048519,0.0002593797,0.00018837069],"domain_scores_gemma":[0.996501,0.0022150322,0.00011954943,0.00088557287,0.00020908422,0.000069731424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010743338,0.00014984893,0.00021394744,0.00014296753,0.0006245504,0.00014866238,0.00082175626,0.00006828317,0.0003203564],"category_scores_gemma":[0.0001125941,0.00014731009,0.00016785823,0.0005150653,0.00041401986,0.00050543476,0.000027547569,0.00019691243,0.00067248434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0076976875,0.00021853205,0.0000012248263,0.000005936142,0.00011138665,0.0000010103488,0.0014746026,0.0017723641,0.0000133520225,0.64012706,0.0002013864,0.34837547],"study_design_scores_gemma":[0.03767036,0.00012154749,0.000042304477,0.000029604134,0.000036799076,0.000009349107,0.000077512705,0.109388836,0.0012569958,0.8503853,0.00075663056,0.0002247409],"about_ca_topic_score_codex":0.000015809961,"about_ca_topic_score_gemma":0.000013414158,"teacher_disagreement_score":0.8448099,"about_ca_system_score_codex":0.000046669968,"about_ca_system_score_gemma":0.000036576366,"threshold_uncertainty_score":0.864365},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.039012390185488285,"score_gpt":0.2696844975486102,"score_spread":0.23067210736312188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914834722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040074654,0.000055219574,0.9558597,0.0011212694,0.0011938196,0.00030612078,0.00008833563,0.00053699844,0.0007638394],"genre_scores_gemma":[0.8160328,0.000007046086,0.18331975,0.00022629858,0.000042915024,0.000026765787,0.00018242965,0.000014719574,0.0001472379],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801356,0.00043049586,0.0004012464,0.0005329894,0.00035150014,0.0002702368],"domain_scores_gemma":[0.99650174,0.0015227537,0.00018205219,0.0014368787,0.00025582078,0.000100761914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005058676,0.00022494252,0.0002182623,0.00016164126,0.0008476854,0.0002500356,0.0011740654,0.00010222517,0.00021070596],"category_scores_gemma":[0.00007184614,0.00024883938,0.0001473752,0.0009757881,0.00022047495,0.00077308953,0.000059397782,0.00044947665,0.0003787909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009878689,0.0009836112,0.00014003048,0.00002085104,0.00016508526,0.0000031383634,0.0011206918,0.049607772,0.00081501744,0.20601904,0.00025339043,0.7407726],"study_design_scores_gemma":[0.0005131739,0.00015670095,0.005327256,0.00005920656,0.00002476291,0.000017687698,0.000110905574,0.22685933,0.00065893045,0.7652123,0.0007460005,0.0003137769],"about_ca_topic_score_codex":0.00016379071,"about_ca_topic_score_gemma":0.000020037374,"teacher_disagreement_score":0.7759582,"about_ca_system_score_codex":0.00015016858,"about_ca_system_score_gemma":0.000067688416,"threshold_uncertainty_score":0.99999636},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04122917108285918,"score_gpt":0.2584555555495299,"score_spread":0.21722638446667075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919078879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030364029,0.0000941903,0.9925052,0.0023093072,0.0011334984,0.00031237476,0.000077620985,0.00040032968,0.0001311089],"genre_scores_gemma":[0.8595466,0.000009288259,0.13667233,0.0034477836,0.00018095034,0.000059453945,0.000024701876,0.000022086513,0.000036800622],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984345,0.00016794095,0.00031501296,0.0005589334,0.00027505957,0.00024854517],"domain_scores_gemma":[0.99805564,0.0010944041,0.00008378217,0.00046766177,0.00011953847,0.00017896533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024890143,0.00020878222,0.00023307194,0.00011772652,0.0004566093,0.00020856467,0.0008904076,0.00008996283,0.00011168017],"category_scores_gemma":[0.00004539921,0.0002171725,0.000240246,0.0005075455,0.00012869587,0.00036260075,0.000020284378,0.00022434913,0.00008564003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024146843,0.00023020802,0.0000032317157,0.000021974447,0.00014405049,0.000008363829,0.0018470105,0.06103642,0.00018706468,0.07629918,0.0005210148,0.85946],"study_design_scores_gemma":[0.0018631385,0.00032858358,0.00004316983,0.000016264803,0.000037071608,0.000004153711,0.00011849137,0.4032846,0.0027650709,0.58813655,0.00307924,0.00032365177],"about_ca_topic_score_codex":0.000012765751,"about_ca_topic_score_gemma":0.0000051494367,"teacher_disagreement_score":0.85913634,"about_ca_system_score_codex":0.000044254088,"about_ca_system_score_gemma":0.00008280271,"threshold_uncertainty_score":0.8856038},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03216755379160711,"score_gpt":0.3231520444204931,"score_spread":0.290984490628886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952920300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038340114,0.000014766007,0.9604437,0.0003656574,0.0003428026,0.00013000579,0.000012026863,0.000114745395,0.00023618307],"genre_scores_gemma":[0.78052104,0.000008279434,0.21925849,0.00010227093,0.000021507414,0.0000071099803,0.0000015120542,0.000008108087,0.000071689596],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998873,0.00014337974,0.00029223535,0.00032790855,0.00021053846,0.00015291575],"domain_scores_gemma":[0.99820215,0.0009949587,0.00013125401,0.0004927993,0.00009768893,0.00008115031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059193163,0.00013372184,0.0001523156,0.00022771905,0.00019448559,0.000064661384,0.0003934183,0.000067767076,0.00005567747],"category_scores_gemma":[0.000025479965,0.00010615674,0.00007728391,0.00021157878,0.00008543737,0.00088119996,0.000015494978,0.00009185685,0.0000096816675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003776724,0.0001343848,0.000006244747,0.00000920945,0.00002117682,0.0000019494014,0.0004559146,0.0012662485,0.0017280403,0.06569683,0.0000037754746,0.9306385],"study_design_scores_gemma":[0.0008648668,0.00047717316,0.005645551,0.000056730478,0.000020744043,0.000023016699,0.000053575706,0.05374703,0.010461002,0.9282351,0.0001623681,0.00025279843],"about_ca_topic_score_codex":0.000008862082,"about_ca_topic_score_gemma":0.000006507683,"teacher_disagreement_score":0.93038565,"about_ca_system_score_codex":0.000021680777,"about_ca_system_score_gemma":0.000037742717,"threshold_uncertainty_score":0.43289462},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03920015596666548,"score_gpt":0.2917818174662398,"score_spread":0.25258166149957434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956649389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003839887,0.00006456254,0.9854923,0.008966674,0.00017150627,0.0002876934,0.00002822237,0.00040939834,0.00073975086],"genre_scores_gemma":[0.9231229,0.000007984004,0.070789166,0.005795187,0.00010194415,0.000039885577,0.000006163732,0.000032556203,0.00010423264],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803,0.00054258056,0.00025294488,0.00047820256,0.00041362757,0.00028261985],"domain_scores_gemma":[0.99645066,0.0025608332,0.000097245116,0.00067739986,0.000100992795,0.000112848415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062414946,0.00017708728,0.00015475797,0.000070366776,0.00048330487,0.00019627591,0.0014796098,0.000056023895,0.00009818589],"category_scores_gemma":[0.00014272165,0.0001388407,0.00010973436,0.0006824517,0.00013771915,0.00048073818,0.000044623775,0.00040407255,0.00030208347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020753524,0.00013031972,0.000047749643,0.000018561226,0.00017216707,0.000011887753,0.0077834977,0.14620583,0.0019192569,0.21876879,0.00016358124,0.62457085],"study_design_scores_gemma":[0.00065530406,0.00010954775,0.00030141065,0.000027633194,0.00001986385,0.0000048482516,0.0005492303,0.23991574,0.005161627,0.75040936,0.0025576395,0.0002878082],"about_ca_topic_score_codex":0.000023098319,"about_ca_topic_score_gemma":0.0000052580867,"teacher_disagreement_score":0.919283,"about_ca_system_score_codex":0.00003442356,"about_ca_system_score_gemma":0.000051134055,"threshold_uncertainty_score":0.56617594},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027864218014865466,"score_gpt":0.29713080067809094,"score_spread":0.26926658266322545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963295189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069002155,0.000010970151,0.98266685,0.0070107454,0.00058294873,0.00029519098,0.0000059388194,0.00016203901,0.0023651116],"genre_scores_gemma":[0.9631971,0.000012450464,0.036304295,0.00033257407,0.000017812537,0.000040633116,0.0000022407598,0.0000076158935,0.00008527005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985723,0.00035801955,0.0003162409,0.00034448778,0.00022015577,0.00018880809],"domain_scores_gemma":[0.997565,0.00096740667,0.00018168926,0.0011282972,0.0000967363,0.000060921393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011002729,0.00014405047,0.00014050156,0.00017219492,0.0011718083,0.00044197278,0.00096158846,0.00006856003,0.00011450868],"category_scores_gemma":[0.00032060017,0.00011892954,0.000103068574,0.00019411257,0.0002833178,0.0007974052,0.000021660726,0.00034114387,0.000045414105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014738937,0.00011369344,0.00023703526,0.000004123826,0.000022234846,0.0000037997875,0.0007980784,0.0844228,0.000038894574,0.11960597,0.000007354484,0.79473126],"study_design_scores_gemma":[0.0014846941,0.000103851184,0.17159651,0.000077212135,0.00004326411,0.00008058206,0.00059879874,0.32568783,0.0010343794,0.49828526,0.0005016144,0.000505996],"about_ca_topic_score_codex":0.000038619524,"about_ca_topic_score_gemma":0.00014338944,"teacher_disagreement_score":0.9562969,"about_ca_system_score_codex":0.00008718465,"about_ca_system_score_gemma":0.000105735526,"threshold_uncertainty_score":0.90127206},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.04378162892982987,"score_gpt":0.31766652297091275,"score_spread":0.27388489404108285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989790471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016395494,0.00003886478,0.9794679,0.0021010512,0.00031347873,0.00029015372,0.000014806932,0.00011484532,0.0012633974],"genre_scores_gemma":[0.95958555,0.000026630543,0.03944494,0.00026560115,0.000020002186,0.000035419445,0.000006494564,0.000017654966,0.00059770053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977918,0.0006747392,0.00032242274,0.00042022858,0.0004960952,0.0002947067],"domain_scores_gemma":[0.9959033,0.0023706986,0.000119054006,0.0012143361,0.00029098132,0.00010162744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008819313,0.00016719224,0.00018673306,0.00015913713,0.00069525174,0.00009686829,0.0010723236,0.00005526237,0.00003614458],"category_scores_gemma":[0.00015072744,0.0001342295,0.00016206542,0.0007961213,0.0005851983,0.00022835522,0.00004227322,0.0003569853,0.00009161579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022643745,0.0003517567,0.0000060690663,0.000020185838,0.00007796696,0.000014107031,0.000780782,0.029258873,0.0013995672,0.7008773,0.000039122348,0.2669478],"study_design_scores_gemma":[0.0006974584,0.00023965212,0.00084204186,0.000040772895,0.000009809805,0.00001578556,0.00026529605,0.017563492,0.0338545,0.94605845,0.0002527987,0.00015995835],"about_ca_topic_score_codex":0.000002608762,"about_ca_topic_score_gemma":0.000013723243,"teacher_disagreement_score":0.94319004,"about_ca_system_score_codex":0.00006940599,"about_ca_system_score_gemma":0.00014624499,"threshold_uncertainty_score":0.547372},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multilinear map; Electronic circuit; Computer science; Mathematics; Engineering; Electrical engineering; Pure mathematics","score_opus":0.013004703538657644,"score_gpt":0.2806092736660844,"score_spread":0.2676045701274268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001787625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009419992,0.000028998844,0.98671424,0.00045045445,0.0008642257,0.00010793626,0.000002455001,0.00021338067,0.0021982952],"genre_scores_gemma":[0.90956855,0.000008378137,0.08953622,0.00015819038,0.000016563856,0.000009081158,0.0000020637774,0.000005601626,0.0006953586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990079,0.00021695178,0.00025851626,0.00026104346,0.00013873515,0.00011689319],"domain_scores_gemma":[0.9988062,0.00055575685,0.000091948095,0.00039799846,0.000114592025,0.000033525717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003592797,0.0001032709,0.00013588891,0.00031618463,0.00016870587,0.000037081605,0.00041435304,0.000058221445,0.000025806841],"category_scores_gemma":[0.00007739753,0.000104029285,0.00008779496,0.0005539508,0.000058351598,0.00018780002,0.000009625879,0.00020351897,0.000025944442],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008066369,0.00007114957,0.000035573452,0.000016512633,0.000029692317,5.772833e-7,0.00021287453,0.047316767,0.0001967966,0.016238732,0.000010387156,0.9358629],"study_design_scores_gemma":[0.0011620577,0.00016942868,0.003445887,0.00015559551,0.000036613485,0.000028805738,0.00017471139,0.8080859,0.017919632,0.16812325,0.00044011205,0.00025799577],"about_ca_topic_score_codex":0.000012690733,"about_ca_topic_score_gemma":0.000002526448,"teacher_disagreement_score":0.9356049,"about_ca_system_score_codex":0.000026993566,"about_ca_system_score_gemma":0.00006421826,"threshold_uncertainty_score":0.42421913},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Product (mathematics); Mathematics; Upper and lower bounds; Boolean function; Physics; Mathematical analysis; Geometry","score_opus":0.02419060904223568,"score_gpt":0.28754416750045253,"score_spread":0.26335355845821684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008826217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019796375,0.0005196274,0.97749144,0.0008233011,0.0006122552,0.00046467173,0.000053536434,0.00016657816,0.00007220006],"genre_scores_gemma":[0.58893013,0.00019988863,0.41044024,0.00015770443,0.000027639719,0.00009451327,0.00005972503,0.000022067305,0.00006810771],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817425,0.00028702518,0.00047693547,0.00056152116,0.0002490738,0.00025121938],"domain_scores_gemma":[0.99655294,0.0014487559,0.00027397246,0.0012720433,0.00036082114,0.00009145262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007994735,0.00027986013,0.0003711378,0.0003129374,0.00038177264,0.00029530845,0.00117836,0.00023333095,0.000020706242],"category_scores_gemma":[0.00008446842,0.0003152728,0.00025997666,0.00031690497,0.00021035071,0.00031656201,0.00017380196,0.00049485225,0.0000016067027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109301094,0.00081651885,0.000010574376,0.00066078536,0.00037224405,0.000004260258,0.006354635,0.102541745,0.0003210295,0.046490315,0.000047162583,0.84227145],"study_design_scores_gemma":[0.0005584902,0.0001437286,0.00025774617,0.00032225353,0.00006019802,0.00001735585,0.0002893489,0.37207597,0.0072705406,0.6186092,0.00007058869,0.0003246165],"about_ca_topic_score_codex":0.000034404173,"about_ca_topic_score_gemma":0.000018383385,"teacher_disagreement_score":0.8419468,"about_ca_system_score_codex":0.00008514158,"about_ca_system_score_gemma":0.00023176875,"threshold_uncertainty_score":0.99992996},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.040581357940703666,"score_gpt":0.28553384448068175,"score_spread":0.2449524865399781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009023057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066477396,0.000015891412,0.9300806,0.0019668953,0.0006590902,0.00020015766,0.00028083037,0.0002753295,0.00004381067],"genre_scores_gemma":[0.98074144,0.0000015433014,0.018705849,0.00036645745,0.000029025688,0.000029133613,0.000074960706,0.000016329972,0.000035268782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783283,0.00060309435,0.00037915292,0.00044642735,0.0004932931,0.00024519934],"domain_scores_gemma":[0.9980561,0.00085935945,0.00019668657,0.0007160202,0.0000884682,0.00008335034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006263256,0.00019999186,0.0002582298,0.00026758472,0.0007088485,0.000047616748,0.0010170552,0.000035735826,0.00008208127],"category_scores_gemma":[0.000040267536,0.00019472785,0.00016662892,0.00085428514,0.00014951904,0.000094022,0.00007955408,0.00048730674,0.000014331981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009684522,0.0004079163,0.0000020332866,0.0000146292305,0.000036087877,0.00000703477,0.00080678845,0.8211753,0.000058017195,0.089286946,0.00005543653,0.08805299],"study_design_scores_gemma":[0.000514579,0.00072423817,0.00030582887,0.00001967628,0.000010555852,0.00002755139,0.00013631376,0.73260564,0.0008117092,0.2644335,0.0002299078,0.00018049941],"about_ca_topic_score_codex":0.000016911112,"about_ca_topic_score_gemma":0.0000016286936,"teacher_disagreement_score":0.914264,"about_ca_system_score_codex":0.0000746245,"about_ca_system_score_gemma":0.00007227298,"threshold_uncertainty_score":0.7940771},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03467971511545365,"score_gpt":0.27526464311587995,"score_spread":0.2405849280004263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032955444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09041386,0.000003744651,0.9071826,0.00046942502,0.000076666205,0.00015801821,0.000032672247,0.00010374311,0.0015593123],"genre_scores_gemma":[0.9862827,4.523577e-7,0.013097734,0.0003663958,0.00014883296,0.00003652065,0.000033541935,0.00001937968,0.000014459419],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992594,0.00005086025,0.00020675958,0.00023295611,0.00010980064,0.00014023407],"domain_scores_gemma":[0.99923974,0.00034036732,0.00007868079,0.00016111662,0.00008895839,0.000091110414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001334731,0.00012714212,0.000118511845,0.000039235143,0.00032079095,0.0000977812,0.0001759662,0.000028640983,0.00014553513],"category_scores_gemma":[0.000009437996,0.00013278646,0.00007728635,0.00030361247,0.000024791621,0.00013691475,0.000005706315,0.00022301912,0.00015062599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042602496,0.00030148466,0.00005200457,0.000028952712,0.00012355717,0.0000013261799,0.0013454905,0.2857555,0.017471401,0.2970893,0.00006447929,0.39772388],"study_design_scores_gemma":[0.00048002703,0.00010254372,0.00013153107,0.000030879648,0.00004393666,3.7253477e-7,0.0024161695,0.28130236,0.009543271,0.70538604,0.0002887775,0.00027406588],"about_ca_topic_score_codex":0.000010837947,"about_ca_topic_score_gemma":2.4887328e-7,"teacher_disagreement_score":0.89586884,"about_ca_system_score_codex":0.000009888359,"about_ca_system_score_gemma":0.00007106894,"threshold_uncertainty_score":0.54148746},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0400114360570754,"score_gpt":0.3237282170312386,"score_spread":0.2837167809741632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036487380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22059958,0.00002938455,0.7768423,0.0007826886,0.0005457511,0.00092689914,0.000044277396,0.00009493029,0.00013417513],"genre_scores_gemma":[0.9236124,0.000026098387,0.07586382,0.0001995711,0.000010630297,0.00022141672,0.000014207725,0.000023523238,0.000028284543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954554,0.0019426714,0.0007292805,0.0008250651,0.000763055,0.00028453273],"domain_scores_gemma":[0.98852426,0.008115385,0.0004437087,0.0021557305,0.00065186183,0.000109059554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020129348,0.00032981887,0.0005708598,0.00055391976,0.00019813601,0.00011168363,0.0017422141,0.00021175496,0.00006590761],"category_scores_gemma":[0.0008896879,0.00027276963,0.000444034,0.0010314955,0.0003350536,0.0002237981,0.00013709305,0.0009995409,0.00000836236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012253424,0.0014325497,0.000009493684,0.0002828304,0.00041918832,0.0000045136107,0.0022535105,0.41383725,0.0066218423,0.36362743,0.000016864065,0.21026917],"study_design_scores_gemma":[0.00046904056,0.00042490373,0.0005466683,0.00020984495,0.00003923522,0.0000045035167,0.00036122548,0.016040867,0.047657166,0.93397313,0.0000108047025,0.00026258835],"about_ca_topic_score_codex":0.000020453455,"about_ca_topic_score_gemma":0.0000072023727,"teacher_disagreement_score":0.7030129,"about_ca_system_score_codex":0.00010213887,"about_ca_system_score_gemma":0.0002501735,"threshold_uncertainty_score":0.99997246},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026755156282618764,"score_gpt":0.27548059888454823,"score_spread":0.24872544260192947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108038062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039513106,0.00029950528,0.99090075,0.0012889942,0.0018203203,0.0005129525,0.00006101013,0.0008049017,0.00036022728],"genre_scores_gemma":[0.2506379,0.000115576986,0.74694306,0.0007893598,0.00018921414,0.00019977323,0.00021664434,0.00008449242,0.00082399667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960048,0.00068104564,0.00059296563,0.0013652212,0.00088544487,0.0004705092],"domain_scores_gemma":[0.99588144,0.0010236278,0.00027477957,0.0020893128,0.0005135829,0.00021728025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079941977,0.0005799989,0.0005691786,0.00071813073,0.0005494386,0.0008370986,0.0021922656,0.00033190427,0.00021722878],"category_scores_gemma":[0.00004517657,0.00057387573,0.00049077906,0.0011461729,0.0002211031,0.00041701476,0.00020434851,0.0013606792,0.00011315296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073852345,0.0008541704,0.0000034717887,0.00010223849,0.00046668915,0.00009364686,0.0013473952,0.45165396,0.000058742287,0.010468008,0.00014854134,0.5347293],"study_design_scores_gemma":[0.0013551542,0.00043837135,0.0006004745,0.00050076173,0.00017355446,0.00014187982,0.00021505253,0.4965173,0.0033125961,0.49473283,0.0004501322,0.0015619198],"about_ca_topic_score_codex":0.000035797242,"about_ca_topic_score_gemma":0.000015199325,"teacher_disagreement_score":0.53316736,"about_ca_system_score_codex":0.00012104934,"about_ca_system_score_gemma":0.00038956827,"threshold_uncertainty_score":0.9996713},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04121551144187059,"score_gpt":0.29964253833018345,"score_spread":0.25842702688831287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376874065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029980997,0.000013397259,0.96636194,0.0005221708,0.0002760283,0.0019501299,0.000011762867,0.0007689306,0.00011463375],"genre_scores_gemma":[0.8645284,0.000008381972,0.13277724,0.00035522823,0.000104056184,0.0019210143,0.00005262771,0.000025169646,0.00022782927],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869365,0.0001638317,0.00022299078,0.0004383512,0.00024710654,0.00023407959],"domain_scores_gemma":[0.99882257,0.0004958186,0.00006162068,0.00048592864,0.00004398867,0.000090076326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038290667,0.00015682967,0.00015100544,0.00023180898,0.0004137547,0.00027036454,0.0005659999,0.000056284338,0.000010673988],"category_scores_gemma":[0.00001994268,0.0001566746,0.000078804194,0.0007701685,0.00009338865,0.00041381287,0.000037489135,0.00021060249,0.0000840825],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001712406,0.000095537114,0.000029505167,0.000015602509,0.000036702513,0.000008169654,0.0014019993,0.005469963,0.000066559274,0.030406108,0.000025485822,0.96242726],"study_design_scores_gemma":[0.00056919444,0.0001371743,0.0026547366,0.00006491186,0.000010893229,0.000011698601,0.000089883455,0.27880502,0.0005863448,0.71650857,0.0003301017,0.00023145483],"about_ca_topic_score_codex":0.00003663937,"about_ca_topic_score_gemma":0.000012660704,"teacher_disagreement_score":0.9621958,"about_ca_system_score_codex":0.00002415804,"about_ca_system_score_gemma":0.00003085677,"threshold_uncertainty_score":0.6389005},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022077962011397025,"score_gpt":0.2946501928792737,"score_spread":0.2725722308678767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405504959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012462877,0.0001666778,0.99448746,0.00074700435,0.0027154572,0.00031160764,0.000088208224,0.0008899396,0.0004690254],"genre_scores_gemma":[0.689423,0.00001816569,0.308469,0.00014707287,0.00013988189,0.00011406102,0.000047646427,0.000036579117,0.0016045538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986207,0.00015765797,0.0002637847,0.0004974283,0.00018599772,0.00027445794],"domain_scores_gemma":[0.99728787,0.0020230517,0.000035384506,0.0003820737,0.00014799858,0.00012364464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042812683,0.00018629358,0.00016549417,0.00023725764,0.00034887943,0.0004950736,0.00040165897,0.00009840404,0.000062451385],"category_scores_gemma":[0.000045167453,0.00017957772,0.00013540145,0.00064246246,0.00007517738,0.00033291752,0.000011283885,0.00023283498,0.00010980164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000317575,0.00009803992,5.673751e-8,0.00003270484,0.00005131586,0.0000058590845,0.00014239573,0.22186461,0.000010520723,0.27950287,0.0011594009,0.49710047],"study_design_scores_gemma":[0.00029699382,0.00014361931,0.0000070720785,0.00003383393,0.000025322233,0.000024033756,0.000028726627,0.7568299,0.00030758657,0.23504847,0.007079611,0.00017479518],"about_ca_topic_score_codex":0.0000021611183,"about_ca_topic_score_gemma":0.0000031515867,"teacher_disagreement_score":0.6892984,"about_ca_system_score_codex":0.000100263605,"about_ca_system_score_gemma":0.00010881475,"threshold_uncertainty_score":0.7322967},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quantum; Quantum state; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.020655054141640625,"score_gpt":0.2656118194055775,"score_spread":0.24495676526393687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407545940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019859772,0.000049627582,0.97718805,0.0012228799,0.00072916754,0.00030851061,0.0000039841198,0.00043469446,0.00020333541],"genre_scores_gemma":[0.84082896,0.000002715166,0.15809241,0.00053041236,0.00002758148,0.000041641946,0.000008858819,0.000019417388,0.00044798697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847746,0.0002049098,0.00025644797,0.00047769764,0.00027934686,0.00030415886],"domain_scores_gemma":[0.9982194,0.0009920667,0.00010380993,0.00039906506,0.00022288908,0.00006277604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005559132,0.0002158179,0.00019185433,0.0002987717,0.00069801236,0.00025665355,0.000570156,0.00006039575,0.000007324746],"category_scores_gemma":[0.000054119006,0.00018585518,0.000108570726,0.0005805158,0.00007501784,0.00019702557,0.000016504313,0.00027378337,0.000010151601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001652976,0.00024263521,0.000018206943,0.000032004522,0.0001108643,0.0000018876842,0.0006150723,0.6469666,0.00019965024,0.008328447,0.000060468203,0.34325886],"study_design_scores_gemma":[0.0012480188,0.0010208329,0.0001305196,0.00017273866,0.00004036601,0.000008335162,0.000110560235,0.8029749,0.0032713276,0.18897486,0.0017486782,0.0002988984],"about_ca_topic_score_codex":0.0000057410216,"about_ca_topic_score_gemma":0.00000395884,"teacher_disagreement_score":0.8209692,"about_ca_system_score_codex":0.00007391073,"about_ca_system_score_gemma":0.00010524339,"threshold_uncertainty_score":0.7578954},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025828264527205644,"score_gpt":0.3139078574151777,"score_spread":0.288079592887972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416907084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39472213,0.00005050683,0.6003723,0.00008562578,0.0005519501,0.00027091365,0.000025249983,0.00007808928,0.0038432153],"genre_scores_gemma":[0.9677123,0.000020340482,0.03129452,0.000067578614,0.0000073507713,0.000018345185,0.0000030363253,0.000018839224,0.0008577039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872285,0.00018637073,0.0005267748,0.00019831037,0.00020309686,0.00016257931],"domain_scores_gemma":[0.99742556,0.0016017328,0.0002193044,0.0004674326,0.00025132543,0.000034638906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060013076,0.00016350315,0.00035546586,0.0004539382,0.0002511465,0.000012176296,0.0003499374,0.00012356111,0.00009509845],"category_scores_gemma":[0.00023254735,0.00014749248,0.00020012246,0.0005792934,0.00018461255,0.00010239895,0.000015129843,0.0002078678,0.0000016525962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055158546,0.0004568855,0.0000746775,0.00047932894,0.00045010378,0.0000010733562,0.002171011,0.012249744,0.0012567961,0.9215737,0.00010416305,0.060630925],"study_design_scores_gemma":[0.00078727514,0.000121242374,0.00035898617,0.00014939833,0.00013004283,0.0000027124393,0.000560692,0.0011185367,0.026532767,0.9700381,0.000076140124,0.00012410896],"about_ca_topic_score_codex":0.000012173188,"about_ca_topic_score_gemma":0.0000070111814,"teacher_disagreement_score":0.5729901,"about_ca_system_score_codex":0.000027754128,"about_ca_system_score_gemma":0.00006795622,"threshold_uncertainty_score":0.6014569},"labels":[],"label_agreement":null}]}