{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4559388,0.0008636385,0.41166395,0.008029073,0.00058355194,0.0005103652,0.0016429564,0.0056390655,0.11512858],"genre_scores_gemma":[0.9054968,0.00038417324,0.07260496,0.0015980983,0.00034486727,0.0002770843,0.0018733861,0.00070097286,0.016719563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951261,0.000783511,0.00030380193,0.0011281897,0.0014924605,0.0011658196],"domain_scores_gemma":[0.98074603,0.011328996,0.0009653561,0.0051411944,0.0011979477,0.000620575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020184577,0.00092592905,0.0011489962,0.0010784735,0.0022076094,0.004209945,0.0023990965,0.0018260918,0.011543009],"category_scores_gemma":[0.010804867,0.000893698,0.0029405372,0.0013992164,0.003404285,0.009514596,0.0045721214,0.006296098,0.00150385],"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.0011842822,0.00079513236,0.0048668617,0.001007818,0.00019483558,0.0007478555,0.00087711227,0.06570696,0.018601052,0.7951568,0.02186597,0.0889953],"study_design_scores_gemma":[0.000109110595,0.00015481941,0.00085482566,0.000043727792,0.00015446605,0.00043777426,0.00019567239,0.08747629,0.017563067,0.8824291,0.010531958,0.00004905577],"about_ca_topic_score_codex":0.0030662694,"about_ca_topic_score_gemma":0.003560595,"teacher_disagreement_score":0.011543009,"about_ca_system_score_codex":0.0029436718,"about_ca_system_score_gemma":0.003008246,"threshold_uncertainty_score":0.038615227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0761571,0.0025131842,0.82237124,0.01101187,0.00060872245,0.0003414988,0.0010508661,0.0047809957,0.08116444],"genre_scores_gemma":[0.69230527,0.001391819,0.27909592,0.0050399113,0.0008581145,0.00056313194,0.0010246034,0.0022173221,0.017503945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98704535,0.0024366141,0.0007523835,0.0023178402,0.004467529,0.002980344],"domain_scores_gemma":[0.8847172,0.08112603,0.003965225,0.020616593,0.007925619,0.0016493773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010390598,0.001780899,0.001367387,0.0031751266,0.002321248,0.0071595986,0.0042549144,0.0027601244,0.020146675],"category_scores_gemma":[0.060033377,0.0014093663,0.0040961225,0.0020296017,0.005980889,0.0234829,0.007935434,0.011511903,0.0045580845],"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.00053095975,0.00017019114,0.0027680947,0.000574674,0.00009599206,0.00027312234,0.00059016026,0.013849069,0.0101273265,0.90891105,0.009525669,0.052583616],"study_design_scores_gemma":[0.000036376034,0.000063320156,0.0005776345,0.00010080006,0.00007598651,0.00032330502,0.0001098396,0.029045159,0.010456269,0.9428831,0.016270068,0.000058204176],"about_ca_topic_score_codex":0.0014768302,"about_ca_topic_score_gemma":0.0020754721,"teacher_disagreement_score":0.020146675,"about_ca_system_score_codex":0.004835803,"about_ca_system_score_gemma":0.0028420233,"threshold_uncertainty_score":0.0673973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3333312,0.010619819,0.46683004,0.034469847,0.0009750644,0.0005487285,0.0034103235,0.0015657513,0.14824925],"genre_scores_gemma":[0.8847321,0.003821313,0.08566796,0.0017512949,0.0016010972,0.0011335417,0.0022477778,0.0006433693,0.018401498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98709977,0.0040778485,0.0006564514,0.0017929081,0.0037238505,0.0026491298],"domain_scores_gemma":[0.873518,0.109684385,0.002888845,0.008642551,0.0031918574,0.002074393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074828966,0.0022022275,0.0023705934,0.0023954886,0.0032468461,0.0070487675,0.006064445,0.0043895976,0.012171295],"category_scores_gemma":[0.05953257,0.0012540478,0.0025600586,0.0030195538,0.00556148,0.01824002,0.0074367514,0.009915678,0.0019851848],"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.0014510526,0.0006414121,0.0027651377,0.0008779522,0.00016059268,0.00026267138,0.0008583259,0.15863506,0.005913729,0.7495369,0.015255468,0.06364173],"study_design_scores_gemma":[0.00013117067,0.000109781,0.0010223272,0.00009906704,0.000051325307,0.00013109902,0.00015882873,0.2751163,0.0022795754,0.7182155,0.0026180912,0.00006690699],"about_ca_topic_score_codex":0.0023364893,"about_ca_topic_score_gemma":0.0028741525,"teacher_disagreement_score":0.012171295,"about_ca_system_score_codex":0.0069187493,"about_ca_system_score_gemma":0.0045870855,"threshold_uncertainty_score":0.05019921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1505806,0.0049825422,0.67704153,0.026594328,0.0019446274,0.0009453463,0.009373815,0.0034607837,0.12507647],"genre_scores_gemma":[0.63385206,0.0040114964,0.31041428,0.0069608516,0.0031017116,0.0012603962,0.009012642,0.0019105336,0.029476024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996309,0.0006832139,0.00018083335,0.00089399,0.0010989278,0.00083392236],"domain_scores_gemma":[0.98604393,0.01026892,0.00097116403,0.0013987463,0.00063334726,0.0006838794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018286034,0.0024132289,0.0020943396,0.0016440026,0.0027507648,0.0052962573,0.005018037,0.002994622,0.018280959],"category_scores_gemma":[0.010240624,0.0014035525,0.0038350618,0.0028801318,0.003331236,0.012621085,0.0052947,0.009257515,0.0021659639],"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.0018322745,0.001580945,0.0043103914,0.0029625196,0.0005189303,0.0018750549,0.0015073876,0.28406206,0.01444769,0.41230863,0.14953871,0.12505545],"study_design_scores_gemma":[0.00033680839,0.00015097014,0.0013233288,0.00018761447,0.00024314219,0.0010240331,0.0003897344,0.24424696,0.0063608047,0.7136422,0.03199617,0.00009832241],"about_ca_topic_score_codex":0.0048375526,"about_ca_topic_score_gemma":0.006668335,"teacher_disagreement_score":0.018280959,"about_ca_system_score_codex":0.0038337384,"about_ca_system_score_gemma":0.002610047,"threshold_uncertainty_score":0.061155856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025241565,0.00041467932,0.9615686,0.00072204514,0.00007012037,0.00021530871,0.00014031693,0.0044765943,0.0071507767],"genre_scores_gemma":[0.3450761,0.0003738141,0.64717513,0.00072593306,0.00008268342,0.0003051427,0.00030379422,0.0007348429,0.00522252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941227,0.002346417,0.00041846657,0.0010259204,0.0014028273,0.0006836985],"domain_scores_gemma":[0.9831844,0.009237937,0.0009454257,0.0053357924,0.0009784857,0.00031792404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005051133,0.00068861037,0.00096344313,0.0010061192,0.0011418859,0.002895481,0.0034923973,0.0015044535,0.004568826],"category_scores_gemma":[0.020896783,0.0010339638,0.0016512815,0.0013996916,0.0040592374,0.0088881245,0.00455141,0.0034291625,0.00093239656],"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.00035037808,0.00023503504,0.002801926,0.0004966746,0.00010503981,0.0004978457,0.0009174953,0.053319845,0.012300865,0.78628904,0.00403028,0.13865565],"study_design_scores_gemma":[0.00016986193,0.00022049833,0.00042442867,0.0001430243,0.00014086318,0.0005307226,0.00017245543,0.39114603,0.036860347,0.5272406,0.042850375,0.00010078411],"about_ca_topic_score_codex":0.0046102502,"about_ca_topic_score_gemma":0.004490906,"teacher_disagreement_score":0.005051133,"about_ca_system_score_codex":0.0031476784,"about_ca_system_score_gemma":0.002753441,"threshold_uncertainty_score":0.026713252},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5095769,0.0036761155,0.37988606,0.022041028,0.0003089885,0.0006872402,0.0072404514,0.0017347253,0.074848466],"genre_scores_gemma":[0.9254757,0.0014382252,0.05651293,0.0010360254,0.00048128082,0.0005377944,0.004123434,0.00029799595,0.010096665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541616,0.0009745234,0.0002496397,0.0011255153,0.0014166317,0.00081753306],"domain_scores_gemma":[0.9821713,0.014741998,0.0008169035,0.0011764655,0.00060992537,0.0004834987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001822719,0.00072501955,0.0013233243,0.0011445578,0.0017687045,0.0061499947,0.0025737025,0.0029069646,0.011816188],"category_scores_gemma":[0.018154666,0.0006993582,0.0022302172,0.0020784084,0.0029937082,0.014925595,0.0032415218,0.005090623,0.00070878863],"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.0007122831,0.00035403337,0.0053123296,0.00090882415,0.00019947604,0.00047415833,0.0009703915,0.108872876,0.0043351767,0.78984016,0.017658211,0.070362054],"study_design_scores_gemma":[0.00010735389,0.000059351616,0.0014044,0.000051691328,0.00004812481,0.00032486682,0.00021852874,0.13613956,0.0025405914,0.85147107,0.007594892,0.000039476756],"about_ca_topic_score_codex":0.003168469,"about_ca_topic_score_gemma":0.001631569,"teacher_disagreement_score":0.011816188,"about_ca_system_score_codex":0.0043978845,"about_ca_system_score_gemma":0.0024451576,"threshold_uncertainty_score":0.039529026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0647071,0.0010389837,0.89792603,0.00233535,0.00026309033,0.00014597365,0.00029927207,0.0020261072,0.03125805],"genre_scores_gemma":[0.76495975,0.00052012043,0.22055627,0.0006347934,0.00019062235,0.00040267676,0.00032507387,0.00049052725,0.011920235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99229914,0.0026625718,0.00035693048,0.0016320132,0.0020228936,0.0010265255],"domain_scores_gemma":[0.9773187,0.0133804055,0.00097127253,0.0067753745,0.00077852857,0.0007757652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055251787,0.0010904574,0.0016226487,0.0010074505,0.0016563998,0.0036162522,0.003767629,0.0027625326,0.008154783],"category_scores_gemma":[0.021153076,0.0010992661,0.001763693,0.0011721792,0.0037729787,0.012494952,0.0079986155,0.010928228,0.0024038865],"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.0008799177,0.000173126,0.0003619391,0.00021888767,0.00003642899,0.00016298541,0.00035239465,0.044783603,0.0074337963,0.91383135,0.002364812,0.02940087],"study_design_scores_gemma":[0.00015920744,0.00013984278,0.00020270636,0.000061992454,0.000039219074,0.00017247131,0.000057132245,0.23352987,0.014126349,0.7419555,0.009489058,0.00006656391],"about_ca_topic_score_codex":0.0005593744,"about_ca_topic_score_gemma":0.00054367434,"teacher_disagreement_score":0.008154783,"about_ca_system_score_codex":0.0028275454,"about_ca_system_score_gemma":0.0022879492,"threshold_uncertainty_score":0.029220223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06913963,0.0019215418,0.91105926,0.001648327,0.00016257097,0.00023564078,0.00027587716,0.0010964288,0.014460706],"genre_scores_gemma":[0.60450256,0.001950407,0.37303272,0.001066196,0.00028531495,0.0005599295,0.0007705712,0.00063283526,0.017199425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955239,0.0013997605,0.00018526886,0.0013726826,0.0009793763,0.0005390087],"domain_scores_gemma":[0.9841344,0.0103827985,0.0006410727,0.0031071776,0.0014277403,0.0003069031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004185856,0.0015545919,0.0023590445,0.0019266282,0.0024072898,0.003373196,0.0028487823,0.002993751,0.007205963],"category_scores_gemma":[0.02181915,0.0009624477,0.0029084436,0.0026767573,0.005050618,0.01166179,0.0030911227,0.00368441,0.00253329],"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.0017500853,0.00022528069,0.0028007545,0.00043669174,0.00008022127,0.00038265696,0.00041897065,0.09177534,0.007271896,0.78971845,0.0082226945,0.09691694],"study_design_scores_gemma":[0.00021450597,0.0006260539,0.0005174899,0.00019051721,0.00016561264,0.00073129305,0.0001003044,0.5039623,0.014055691,0.46255526,0.01673365,0.00014734191],"about_ca_topic_score_codex":0.0020591551,"about_ca_topic_score_gemma":0.0012420784,"teacher_disagreement_score":0.007205963,"about_ca_system_score_codex":0.003363998,"about_ca_system_score_gemma":0.002528433,"threshold_uncertainty_score":0.024407625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081226714,0.0004557138,0.9010868,0.0018925585,0.00006375406,0.00019573257,0.00027793695,0.002124257,0.012676548],"genre_scores_gemma":[0.48237634,0.0006112,0.5042002,0.00084044493,0.00012417104,0.00075197814,0.00082588487,0.00073283596,0.009536934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973049,0.00067926425,0.0001620911,0.0006225616,0.00064604427,0.0005851613],"domain_scores_gemma":[0.9932249,0.0051522343,0.000389483,0.00066120515,0.00037827453,0.00019377917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015958415,0.0009338738,0.0008248358,0.00080245815,0.0015166339,0.0027427517,0.0016517178,0.0014578286,0.008183741],"category_scores_gemma":[0.010207021,0.00063961436,0.0018209118,0.001603148,0.0037739591,0.0074652988,0.0029797931,0.005769375,0.0009755066],"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.00035405855,0.00023745513,0.0015988786,0.00040059036,0.000036245634,0.0001614249,0.00076215016,0.06221687,0.01151481,0.8280143,0.0034646888,0.091238484],"study_design_scores_gemma":[0.00006392246,0.000098082935,0.0003401013,0.000060521957,0.00003555867,0.00010367371,0.00014094998,0.18806595,0.010407125,0.7938229,0.006824645,0.00003660383],"about_ca_topic_score_codex":0.003986632,"about_ca_topic_score_gemma":0.004539011,"teacher_disagreement_score":0.008183741,"about_ca_system_score_codex":0.0032378465,"about_ca_system_score_gemma":0.0023727831,"threshold_uncertainty_score":0.027377367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08384963,0.0033188125,0.86106694,0.006372548,0.00030199593,0.00022937705,0.0006950495,0.0007016548,0.04346401],"genre_scores_gemma":[0.7968336,0.0025002225,0.18693678,0.0020694586,0.0011952833,0.0006242978,0.0008801875,0.00057338586,0.008386749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98403686,0.007658626,0.0009952171,0.0026323202,0.003197254,0.0014797237],"domain_scores_gemma":[0.93702483,0.047955405,0.0026091477,0.008735788,0.0023299686,0.0013448801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011253704,0.0015112638,0.0015796075,0.0025990857,0.0029252225,0.0059082764,0.003132695,0.0025078668,0.0042902897],"category_scores_gemma":[0.040219393,0.0013717897,0.0026521727,0.003115417,0.012013138,0.01939375,0.008594171,0.007202914,0.0007688397],"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.00009544308,0.000029964094,0.00050438545,0.0001380344,0.000023434703,0.00016292975,0.00044030574,0.010289703,0.00084262574,0.97634935,0.0011062673,0.010017495],"study_design_scores_gemma":[0.000044723158,0.000096029864,0.0003364566,0.00009122063,0.00005823273,0.00038760208,0.00018560833,0.046330724,0.0020455203,0.9370075,0.013383984,0.000032401815],"about_ca_topic_score_codex":0.0008860992,"about_ca_topic_score_gemma":0.0006081272,"teacher_disagreement_score":0.011253704,"about_ca_system_score_codex":0.0022510847,"about_ca_system_score_gemma":0.0015121232,"threshold_uncertainty_score":0.059515953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2624708,0.0038737347,0.538134,0.04048564,0.00032774982,0.0002522018,0.003325521,0.00058206817,0.15054834],"genre_scores_gemma":[0.9622909,0.0011990272,0.023589553,0.0014924561,0.00032553903,0.00026244705,0.0009453902,0.00022061636,0.009674086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9840821,0.0049640476,0.0010473289,0.00414807,0.003937527,0.0018208929],"domain_scores_gemma":[0.9385724,0.040160943,0.002687565,0.014617746,0.0024832103,0.0014782645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006733706,0.0006591646,0.0020409215,0.0010200357,0.004178417,0.00791669,0.0030319458,0.004657521,0.009096149],"category_scores_gemma":[0.038747106,0.0011451407,0.0023720057,0.0019563427,0.011533905,0.023879286,0.0072393646,0.00919504,0.001584123],"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.00021686708,0.00005886904,0.0009860971,0.00014413462,0.000055466717,0.00013300635,0.00088134414,0.005898329,0.00098983,0.97333217,0.0032699052,0.0140340105],"study_design_scores_gemma":[0.00003164675,0.00002109045,0.0003249326,0.000022101336,0.000017053524,0.00018540976,0.00013999974,0.008735429,0.0006382281,0.9861626,0.00370015,0.00002130961],"about_ca_topic_score_codex":0.0016070687,"about_ca_topic_score_gemma":0.00062899647,"teacher_disagreement_score":0.009096149,"about_ca_system_score_codex":0.0032114629,"about_ca_system_score_gemma":0.0019725638,"threshold_uncertainty_score":0.03561163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053352904,0.000294727,0.93402934,0.0004916609,0.0000826589,0.00015691231,0.00032489424,0.0015223916,0.009744519],"genre_scores_gemma":[0.6579852,0.00016736651,0.33476117,0.0005243026,0.00006881329,0.00016298401,0.00034057372,0.00009837516,0.005891276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985733,0.00026688233,0.00011277266,0.00028016252,0.0005412912,0.00022558348],"domain_scores_gemma":[0.997701,0.0003676707,0.0001429893,0.0015193003,0.00020329758,0.000065858396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087201025,0.0003283707,0.0005134245,0.00031802742,0.0003647891,0.0015059607,0.0011756502,0.0009926765,0.004683305],"category_scores_gemma":[0.0027735033,0.00031246623,0.0007345431,0.00037496895,0.001275297,0.0048428993,0.0033956636,0.0018722311,0.0013374622],"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.000509425,0.0002575377,0.0017785057,0.0004191237,0.00011206688,0.0005396477,0.00045180228,0.04454598,0.12305775,0.6142939,0.007470474,0.20656379],"study_design_scores_gemma":[0.00014706199,0.00059781957,0.0012367828,0.00009263132,0.00007376056,0.0012745672,0.00011756872,0.42955202,0.16443242,0.36848652,0.03385859,0.00013028485],"about_ca_topic_score_codex":0.0001673386,"about_ca_topic_score_gemma":0.00022859799,"teacher_disagreement_score":0.004683305,"about_ca_system_score_codex":0.0006407868,"about_ca_system_score_gemma":0.0005790838,"threshold_uncertainty_score":0.01566726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12998112,0.00029305485,0.86030924,0.0010220502,0.000047096066,0.00017525918,0.000162032,0.0011538252,0.0068562324],"genre_scores_gemma":[0.7240105,0.00037477186,0.268647,0.00029085367,0.00015851589,0.0004864952,0.00046094102,0.00066048536,0.004910462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99570036,0.0011801525,0.00025110226,0.0009840281,0.0011163566,0.00076808647],"domain_scores_gemma":[0.9880884,0.007244685,0.0009828858,0.002665721,0.0005423781,0.0004759441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002660829,0.0015414526,0.0021621236,0.0011129152,0.0011879575,0.0031629151,0.0028590453,0.0018490015,0.0045385784],"category_scores_gemma":[0.020644216,0.00084673066,0.0026425086,0.0020101469,0.0032184005,0.0126414,0.0056957416,0.006940334,0.0013689115],"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.00080317596,0.00092148926,0.0021828413,0.0003692862,0.00008241563,0.0003623415,0.0011455232,0.4867961,0.01449345,0.3801876,0.0043133865,0.10834244],"study_design_scores_gemma":[0.000056331573,0.00010753032,0.00022019751,0.000016177204,0.000018466228,0.000087146094,0.00013150852,0.7462808,0.002724125,0.24871886,0.0016131758,0.000025734604],"about_ca_topic_score_codex":0.0019138248,"about_ca_topic_score_gemma":0.001249068,"teacher_disagreement_score":0.0045385784,"about_ca_system_score_codex":0.0028314067,"about_ca_system_score_gemma":0.0014659215,"threshold_uncertainty_score":0.020543337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017965835,0.00037309737,0.9665637,0.000923697,0.00015345434,0.00027250114,0.00029445044,0.0007254829,0.01272788],"genre_scores_gemma":[0.5754649,0.00048083832,0.40734404,0.0011655309,0.00028817012,0.00072214263,0.0008876396,0.00047642805,0.013170147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950995,0.0019403781,0.00021939933,0.0009525384,0.0012614632,0.00052669673],"domain_scores_gemma":[0.98941797,0.005935901,0.0005319222,0.0029395253,0.0008411799,0.00033343906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035504303,0.0008633359,0.0014694296,0.00077675475,0.0012341024,0.002685503,0.0027262697,0.0020230638,0.014604041],"category_scores_gemma":[0.016650628,0.0005341827,0.001494266,0.0012778102,0.00319445,0.005118372,0.0035573111,0.0028134582,0.0021656177],"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.0006989387,0.00020047034,0.0012667724,0.00030217608,0.00009958455,0.00021472099,0.00022113991,0.06839679,0.005369461,0.8370648,0.009658908,0.076506175],"study_design_scores_gemma":[0.00013139882,0.00013829568,0.00026484724,0.000041287483,0.00003161919,0.00017408244,0.000058436184,0.4686325,0.0057218526,0.515677,0.009086553,0.00004220134],"about_ca_topic_score_codex":0.0012399654,"about_ca_topic_score_gemma":0.0013352958,"teacher_disagreement_score":0.014604041,"about_ca_system_score_codex":0.0019859304,"about_ca_system_score_gemma":0.0020952786,"threshold_uncertainty_score":0.048855364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00972975,0.0019536559,0.96029663,0.004370055,0.00020492985,0.000087408305,0.0003004281,0.00019357735,0.022863606],"genre_scores_gemma":[0.538418,0.004322264,0.4353035,0.0020563288,0.0020774684,0.0010391775,0.00101642,0.00035469627,0.015412226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940118,0.0021541317,0.0004188131,0.0009375902,0.0019842845,0.0004933716],"domain_scores_gemma":[0.9845882,0.011793741,0.00058323645,0.0016801849,0.0010450309,0.0003095053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046728295,0.0013819397,0.0013181644,0.0029887808,0.0019728146,0.005750876,0.002415966,0.0018799182,0.006051918],"category_scores_gemma":[0.012287723,0.0006095701,0.0039407583,0.00324199,0.007538635,0.016333569,0.0041543473,0.007466988,0.00089742953],"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.0000051006296,0.0000059024283,0.000057679183,0.000046718622,0.000007397968,0.000017303422,0.00007233335,0.0026928426,0.000114862116,0.99441874,0.0004171235,0.002143988],"study_design_scores_gemma":[0.000004347996,0.000006582299,0.000040714716,0.000011331198,0.000005235684,0.00001836273,0.000020900676,0.011536316,0.00011326007,0.9844826,0.0037549695,0.000005498836],"about_ca_topic_score_codex":0.0023085724,"about_ca_topic_score_gemma":0.0012633391,"teacher_disagreement_score":0.006051918,"about_ca_system_score_codex":0.005304294,"about_ca_system_score_gemma":0.0015497457,"threshold_uncertainty_score":0.038485527},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7771182,0.0003492034,0.20839372,0.0009810637,0.000043553853,0.000227563,0.0015530649,0.0008583966,0.010475243],"genre_scores_gemma":[0.95759207,0.0002228386,0.037521385,0.00018211197,0.000047189442,0.000076057804,0.0010792791,0.00007992667,0.0031992004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975758,0.00047384953,0.00019911946,0.0009821402,0.00034945784,0.00041956824],"domain_scores_gemma":[0.98608553,0.0084083015,0.0013252401,0.002587543,0.00063252804,0.00096079905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012652948,0.0006989341,0.0009024045,0.00082445896,0.0011749492,0.0039344057,0.0016229878,0.0010847021,0.0046993247],"category_scores_gemma":[0.006871922,0.0005578386,0.0016859856,0.0011116496,0.002844148,0.006472728,0.0024799493,0.0022707323,0.0003343452],"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.00087334967,0.00036457877,0.01698007,0.000970563,0.00027352825,0.0015182788,0.0023790286,0.12975118,0.026981125,0.73345315,0.0032267994,0.08322825],"study_design_scores_gemma":[0.000116763746,0.00015915664,0.003283002,0.000049668102,0.00013256099,0.0005841117,0.0005253302,0.1432664,0.013018946,0.83455104,0.0042391634,0.00007390073],"about_ca_topic_score_codex":0.0043935124,"about_ca_topic_score_gemma":0.0037661095,"teacher_disagreement_score":0.0046993247,"about_ca_system_score_codex":0.0022731263,"about_ca_system_score_gemma":0.0012496285,"threshold_uncertainty_score":0.016492784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12614776,0.0017720335,0.8078901,0.010080478,0.0006541166,0.00049577456,0.001368722,0.003055538,0.048535477],"genre_scores_gemma":[0.8725484,0.0006218442,0.114218235,0.0016739112,0.0006004362,0.00076557434,0.0009817096,0.00082329754,0.007766528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874548,0.0045357007,0.00035589933,0.0026186036,0.0029751442,0.0020599486],"domain_scores_gemma":[0.92603976,0.052436158,0.0034424695,0.0142667135,0.0019393027,0.0018755863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004864907,0.0016517752,0.0020566531,0.0012757715,0.0023160416,0.0047006225,0.0046721357,0.002759707,0.017259398],"category_scores_gemma":[0.048697356,0.001027893,0.0013600043,0.0021976463,0.0042186775,0.012731677,0.0050006066,0.006190276,0.002200488],"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.0019044584,0.00059337425,0.0021358985,0.00051570206,0.00012218261,0.00013470948,0.0002885551,0.35316384,0.012966852,0.5387885,0.016551742,0.07283417],"study_design_scores_gemma":[0.00016081885,0.00019393646,0.0004962034,0.000053648753,0.000053862066,0.00012033247,0.000052447627,0.6783204,0.0067348075,0.3104733,0.0032924798,0.000047738446],"about_ca_topic_score_codex":0.0015625636,"about_ca_topic_score_gemma":0.002813632,"teacher_disagreement_score":0.017259398,"about_ca_system_score_codex":0.00548745,"about_ca_system_score_gemma":0.0050183274,"threshold_uncertainty_score":0.057738423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019560428,0.0006200604,0.957035,0.0034191266,0.00013278701,0.00017925486,0.00037181063,0.00047071473,0.018210815],"genre_scores_gemma":[0.69009256,0.0014925789,0.28793645,0.0025226735,0.0014692852,0.002010894,0.0011379985,0.0012067291,0.012130839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98579955,0.004267417,0.0005708757,0.0022077763,0.0056424476,0.0015118761],"domain_scores_gemma":[0.89832985,0.08687904,0.0025022104,0.0072630206,0.0035910904,0.0014347105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010289287,0.0026191142,0.0026478702,0.0032355464,0.0019840468,0.005789091,0.0055557042,0.0028065704,0.01044376],"category_scores_gemma":[0.059963267,0.0011246894,0.0049177036,0.0029657797,0.006844166,0.01903731,0.009789989,0.015203298,0.001405636],"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.0001324703,0.00014038595,0.0010350842,0.00028189644,0.00005970916,0.00015444781,0.0003811319,0.05114324,0.0028541626,0.91732836,0.003494941,0.022994278],"study_design_scores_gemma":[0.000025290201,0.000060146107,0.0002843032,0.00004429798,0.000027435635,0.00008515345,0.000049796345,0.1972938,0.0021681983,0.7974148,0.002516735,0.00002997174],"about_ca_topic_score_codex":0.0016722517,"about_ca_topic_score_gemma":0.001073047,"teacher_disagreement_score":0.01044376,"about_ca_system_score_codex":0.0058111018,"about_ca_system_score_gemma":0.0030020946,"threshold_uncertainty_score":0.054415584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10480941,0.006869063,0.7765556,0.011544372,0.00067758246,0.0006569628,0.0043926546,0.0061751977,0.08831916],"genre_scores_gemma":[0.6886507,0.00429642,0.25942478,0.006221229,0.0019971274,0.002298899,0.007987565,0.0028530043,0.026270317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99254465,0.0012246981,0.0003870577,0.0017061401,0.0028750056,0.0012625781],"domain_scores_gemma":[0.9634252,0.02795037,0.0012659437,0.0045712763,0.0018666376,0.00092052214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029494225,0.0025533657,0.002229184,0.0022327069,0.0017457844,0.0054519395,0.0051704827,0.002682007,0.026038138],"category_scores_gemma":[0.029801814,0.0012333167,0.0037821252,0.003043318,0.003170414,0.01573203,0.007122686,0.010850061,0.004064511],"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.001525461,0.0006350498,0.004588429,0.0018397922,0.00027468667,0.0005392862,0.00065628404,0.19468409,0.02529432,0.5828365,0.0438448,0.14328128],"study_design_scores_gemma":[0.0002197925,0.00023907083,0.00093628676,0.00020301582,0.00022651529,0.00033726677,0.000111900205,0.34537238,0.009841553,0.62923175,0.013202821,0.00007774777],"about_ca_topic_score_codex":0.0022853732,"about_ca_topic_score_gemma":0.004160211,"teacher_disagreement_score":0.026038138,"about_ca_system_score_codex":0.0051268847,"about_ca_system_score_gemma":0.0033813159,"threshold_uncertainty_score":0.08710623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030612242,0.0005780085,0.97106713,0.0016045566,0.00021182418,0.000083727486,0.00016722683,0.0002472683,0.022978975],"genre_scores_gemma":[0.21695761,0.0015871928,0.74736613,0.0020852184,0.0009218292,0.0012905798,0.0006818808,0.0006928481,0.028416684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925127,0.0021827219,0.00049482577,0.0014549162,0.002629677,0.00072518573],"domain_scores_gemma":[0.9891762,0.0059981886,0.0003656883,0.0026524616,0.0014661484,0.00034123773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060831504,0.0018787392,0.0015101194,0.0028650844,0.0018159256,0.004122657,0.0060297,0.0023553115,0.011114364],"category_scores_gemma":[0.016964989,0.0012275431,0.0026479822,0.0028881254,0.0038540582,0.0086759245,0.0049286596,0.010376135,0.002598213],"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.000042327123,0.00003357874,0.00007985068,0.000092427304,0.000020183099,0.000041908508,0.0000741723,0.009995705,0.0009890654,0.96945256,0.0037524546,0.015425678],"study_design_scores_gemma":[0.000034667828,0.000045163826,0.00013878204,0.00006437269,0.000039573177,0.00010770706,0.000027166336,0.16584505,0.0033584794,0.81088245,0.019411545,0.000045109675],"about_ca_topic_score_codex":0.0017056357,"about_ca_topic_score_gemma":0.0017543405,"teacher_disagreement_score":0.011114364,"about_ca_system_score_codex":0.004509557,"about_ca_system_score_gemma":0.0023525232,"threshold_uncertainty_score":0.03718126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08569888,0.0013740723,0.8710388,0.0105019035,0.00042975176,0.0002831447,0.0012956035,0.0026039772,0.026773967],"genre_scores_gemma":[0.7179986,0.0009105551,0.25631163,0.002434101,0.00065339194,0.00044160857,0.0018958641,0.00078532164,0.018568851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917746,0.0024314772,0.00037875722,0.0020927386,0.002508725,0.00081372785],"domain_scores_gemma":[0.979219,0.014083045,0.0009925055,0.0040505943,0.001112312,0.0005425496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031087806,0.0009480932,0.001915087,0.0007562181,0.0013539831,0.0048499987,0.0028415124,0.0026094846,0.015756302],"category_scores_gemma":[0.024637682,0.0006062282,0.0020674702,0.0022163824,0.0034093491,0.0155626815,0.0037322592,0.00683977,0.0016119351],"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.0007214529,0.00017641082,0.001126389,0.0005341782,0.000113576585,0.0002720679,0.00040643386,0.088904925,0.0053948956,0.82096666,0.012134452,0.06924853],"study_design_scores_gemma":[0.00006476268,0.00006208223,0.00022941762,0.0000348727,0.0000476198,0.00022783055,0.00013610456,0.2829731,0.0028922728,0.7057876,0.0075108698,0.00003343679],"about_ca_topic_score_codex":0.0043575615,"about_ca_topic_score_gemma":0.004402503,"teacher_disagreement_score":0.015756302,"about_ca_system_score_codex":0.0028980453,"about_ca_system_score_gemma":0.002793318,"threshold_uncertainty_score":0.052710116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12757477,0.011587968,0.59550345,0.20063779,0.0011154475,0.00031578122,0.0030131203,0.0012632994,0.058988415],"genre_scores_gemma":[0.718387,0.007552267,0.23854244,0.011930314,0.0062673404,0.001001848,0.0034063696,0.0010476414,0.011864802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9866326,0.0072119785,0.0006119235,0.0028283887,0.002031483,0.00068355293],"domain_scores_gemma":[0.8068678,0.17956623,0.0037919001,0.006083912,0.0025649732,0.001125182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010139591,0.0013554998,0.0020450659,0.002073341,0.0028290087,0.0071351677,0.0034473683,0.004941555,0.011945217],"category_scores_gemma":[0.094850525,0.0013763773,0.0036794199,0.004021193,0.007833669,0.028410533,0.0038793779,0.014212875,0.0016086753],"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.00024617414,0.0002220931,0.0029169796,0.0008575752,0.00016229227,0.0002448816,0.00059898646,0.03377462,0.0007331523,0.9041322,0.0193633,0.036747716],"study_design_scores_gemma":[0.00003772126,0.000023509385,0.00034024462,0.00006531848,0.000019661531,0.00007108582,0.00011662227,0.02521169,0.0003142331,0.9693468,0.004434942,0.000018295024],"about_ca_topic_score_codex":0.0024328353,"about_ca_topic_score_gemma":0.0023298154,"teacher_disagreement_score":0.011945217,"about_ca_system_score_codex":0.0046782466,"about_ca_system_score_gemma":0.002569983,"threshold_uncertainty_score":0.053623915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6067284,0.0041764416,0.29110706,0.032464553,0.00024781816,0.00021617445,0.006648987,0.0009475845,0.057463042],"genre_scores_gemma":[0.9462223,0.0019490519,0.03956033,0.0006832537,0.00047995648,0.00023435062,0.0027325235,0.00020809234,0.007930128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675804,0.0009094524,0.00015568997,0.0006171614,0.0009420492,0.0006177108],"domain_scores_gemma":[0.9783719,0.018609807,0.0009007876,0.0011248249,0.0004830461,0.0005096204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020068495,0.0006874652,0.0013717081,0.00085997954,0.0012357497,0.005960122,0.0027804927,0.0021800708,0.008784687],"category_scores_gemma":[0.014001244,0.00076076307,0.0018990202,0.0023291546,0.0027420812,0.012578243,0.0028823044,0.0052752853,0.00080884126],"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.0008772913,0.00027998936,0.00478703,0.0010971371,0.0001840736,0.00043342533,0.00081020384,0.17012836,0.0042573237,0.761109,0.014424299,0.041611806],"study_design_scores_gemma":[0.00010984246,0.0000455209,0.0018244422,0.000051494353,0.00004601516,0.00022353155,0.00022043928,0.2429675,0.0015634641,0.74913996,0.0037756513,0.000032101954],"about_ca_topic_score_codex":0.0037826535,"about_ca_topic_score_gemma":0.0029840968,"teacher_disagreement_score":0.008784687,"about_ca_system_score_codex":0.0031861644,"about_ca_system_score_gemma":0.0017242776,"threshold_uncertainty_score":0.029387712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20179988,0.0005795276,0.78190297,0.0008161185,0.000080680926,0.00014178496,0.001024217,0.0032231447,0.010431596],"genre_scores_gemma":[0.78512186,0.00023600769,0.20722106,0.00044241443,0.00003854774,0.00013091783,0.001270039,0.000323874,0.0052152406],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984862,0.00027036207,0.00009276324,0.00036044995,0.00044988835,0.00034037398],"domain_scores_gemma":[0.9977055,0.0010072691,0.00024270393,0.00066180143,0.00028963457,0.00009303326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005580266,0.000712241,0.000693499,0.0005382062,0.00057321653,0.0013223472,0.0014085117,0.0010251342,0.0072915037],"category_scores_gemma":[0.0063539413,0.0005864137,0.0009842208,0.00060101994,0.0007802299,0.0025043446,0.0031073638,0.001925344,0.0013874803],"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.0023056916,0.00025454603,0.0054808008,0.0010031824,0.00017288383,0.00085260853,0.00091468275,0.21366857,0.07742136,0.29015398,0.011899618,0.39587194],"study_design_scores_gemma":[0.00019166876,0.0003191512,0.0008329587,0.00010815909,0.000084789295,0.000544533,0.00019333146,0.57774985,0.067870714,0.33814126,0.013887956,0.0000756174],"about_ca_topic_score_codex":0.0009744653,"about_ca_topic_score_gemma":0.0014574836,"teacher_disagreement_score":0.0072915037,"about_ca_system_score_codex":0.0011808196,"about_ca_system_score_gemma":0.0009900093,"threshold_uncertainty_score":0.024392486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16394636,0.0027104823,0.78338546,0.0057834866,0.00022928428,0.00053549174,0.0014277368,0.005193615,0.036788177],"genre_scores_gemma":[0.66508645,0.0011587548,0.31078818,0.0021488187,0.0004457692,0.0009502803,0.0027056076,0.0010417034,0.015674543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915417,0.0014166962,0.000481042,0.00210187,0.002324299,0.0021343902],"domain_scores_gemma":[0.96673,0.023171952,0.0018121699,0.0056545697,0.0016042676,0.001026978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004058659,0.0018894029,0.0017428617,0.0018741693,0.0018963622,0.006601798,0.005464025,0.0025686692,0.0117146745],"category_scores_gemma":[0.023757827,0.0010979233,0.0036497875,0.002300061,0.0033549932,0.014754307,0.00492376,0.008027015,0.0020303966],"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.0028718659,0.0008967967,0.006932744,0.0013913908,0.0003250387,0.00035980906,0.0008364575,0.15176581,0.029643657,0.61824894,0.017945385,0.16878206],"study_design_scores_gemma":[0.00024686207,0.00023539843,0.00096095644,0.00013370965,0.00019820644,0.00021930208,0.0001091783,0.5208246,0.017959828,0.45329517,0.0057363305,0.00008050188],"about_ca_topic_score_codex":0.0028376372,"about_ca_topic_score_gemma":0.005862764,"teacher_disagreement_score":0.0117146745,"about_ca_system_score_codex":0.007282952,"about_ca_system_score_gemma":0.0052844635,"threshold_uncertainty_score":0.052841783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52227074,0.0005004366,0.45494142,0.0039021906,0.0000867617,0.00021205425,0.0010905556,0.0012093271,0.015786432],"genre_scores_gemma":[0.94857925,0.00019331201,0.046134923,0.00039333897,0.00009116239,0.00026609164,0.00062825484,0.00017738157,0.0035361757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495924,0.0014821984,0.00026095624,0.0012857579,0.0010241795,0.0009876885],"domain_scores_gemma":[0.9603258,0.030759923,0.0022893134,0.0042148135,0.0012578274,0.0011523286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025207768,0.0007974142,0.001839678,0.0008886322,0.0016751584,0.00458972,0.0035037633,0.0024020337,0.0071895733],"category_scores_gemma":[0.020749552,0.00073078263,0.001382997,0.0015444821,0.004357108,0.008736427,0.0053099683,0.0048103533,0.00073131337],"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.0014539027,0.00027780322,0.0029095379,0.0003834145,0.0002021661,0.0004910458,0.00094432966,0.41132545,0.011864047,0.53979266,0.004806081,0.025549533],"study_design_scores_gemma":[0.00008567081,0.000053667485,0.0002512749,0.000015393187,0.00002146774,0.00007439894,0.000050024886,0.7041339,0.0023638152,0.29227385,0.0006515114,0.000024948655],"about_ca_topic_score_codex":0.0018959588,"about_ca_topic_score_gemma":0.0012480945,"teacher_disagreement_score":0.0071895733,"about_ca_system_score_codex":0.004060805,"about_ca_system_score_gemma":0.0018083404,"threshold_uncertainty_score":0.02946335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5542898,0.00020736584,0.4318982,0.002990056,0.000051038536,0.00025889295,0.00044087137,0.00057167024,0.009292235],"genre_scores_gemma":[0.9776869,0.000103025064,0.020273587,0.0004424388,0.000051643205,0.00020081444,0.00024247181,0.000050813902,0.00094836863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9794515,0.007923866,0.0014141749,0.0040488886,0.005202854,0.0019588224],"domain_scores_gemma":[0.7934266,0.16387635,0.014433867,0.017035613,0.0071280436,0.0040995767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014675502,0.00091779826,0.0014248339,0.0018064394,0.0016376714,0.004024475,0.0029809575,0.00269622,0.0031839616],"category_scores_gemma":[0.10615676,0.00064870086,0.001797415,0.0013863333,0.007601325,0.012464002,0.004894903,0.004392301,0.0005108806],"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.0010625472,0.00049916696,0.029327393,0.00033021,0.00040245446,0.0007523164,0.0014516035,0.041373648,0.013143769,0.8562568,0.0014543658,0.05394578],"study_design_scores_gemma":[0.00011809571,0.00061987404,0.003907423,0.00006804522,0.000074035306,0.00047377244,0.0005217982,0.22246341,0.013197185,0.75730187,0.0011634617,0.00009106603],"about_ca_topic_score_codex":0.0011695676,"about_ca_topic_score_gemma":0.0007665378,"teacher_disagreement_score":0.014675502,"about_ca_system_score_codex":0.0028030975,"about_ca_system_score_gemma":0.0031317645,"threshold_uncertainty_score":0.0776124},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6270781,0.0007939541,0.35695404,0.0025797177,0.00008054483,0.00021759738,0.00088366837,0.0022546,0.009157738],"genre_scores_gemma":[0.9098533,0.00057434663,0.08268131,0.0003867901,0.00016267101,0.00022221982,0.001565924,0.00055697025,0.00399651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965643,0.0006129476,0.00019583345,0.001137281,0.000718543,0.00077117904],"domain_scores_gemma":[0.97837216,0.014413672,0.0014428194,0.0040499656,0.0007033457,0.0010179053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024643068,0.0013012599,0.0017390953,0.0010828892,0.0014879666,0.003663717,0.003806175,0.0018102049,0.0051878793],"category_scores_gemma":[0.024433544,0.00075610244,0.0024670828,0.0018132369,0.0027929102,0.011490739,0.0038118185,0.00487847,0.00061575026],"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.0026805473,0.0010441487,0.019372934,0.0008071503,0.0003134617,0.00043332757,0.0029645967,0.5326599,0.02065299,0.28767213,0.010624576,0.12077419],"study_design_scores_gemma":[0.00012719225,0.00015778797,0.0013655528,0.000035676116,0.00007902964,0.00022694656,0.00026618392,0.78973603,0.0041524456,0.20168355,0.002134467,0.0000351461],"about_ca_topic_score_codex":0.0057948404,"about_ca_topic_score_gemma":0.004619527,"teacher_disagreement_score":0.0057948404,"about_ca_system_score_codex":0.004322968,"about_ca_system_score_gemma":0.0023877136,"threshold_uncertainty_score":0.031365395},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122169845,0.0017281179,0.849926,0.0043703397,0.00027079092,0.00035438646,0.0011948367,0.0113328425,0.008652901],"genre_scores_gemma":[0.6737473,0.0006430035,0.31583714,0.0013776659,0.00030587657,0.0004178577,0.001386643,0.00085525884,0.0054292264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99434763,0.0016915911,0.00030322775,0.0018018945,0.0009704787,0.0008852242],"domain_scores_gemma":[0.967136,0.021786654,0.0021515808,0.0073794858,0.0009125558,0.0006336912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004020106,0.0024268518,0.0024489406,0.0014239271,0.0012051677,0.0032025506,0.0066381125,0.0029367218,0.0068974523],"category_scores_gemma":[0.027133035,0.0010908948,0.0017983229,0.0028612905,0.0028416205,0.012462117,0.0037993162,0.004019946,0.0020478289],"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.0020765776,0.00065011706,0.002010227,0.00066483923,0.00022501592,0.00023504453,0.0005546018,0.74339944,0.008819671,0.08361429,0.01478662,0.14296354],"study_design_scores_gemma":[0.000120844925,0.000112947055,0.00017199047,0.000015866057,0.000040383467,0.00011972133,0.00004901943,0.9107625,0.0040181866,0.083319664,0.0012490463,0.000019887404],"about_ca_topic_score_codex":0.0020532669,"about_ca_topic_score_gemma":0.0028865424,"teacher_disagreement_score":0.0068974523,"about_ca_system_score_codex":0.0038708616,"about_ca_system_score_gemma":0.0029350636,"threshold_uncertainty_score":0.028085172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05830613,0.00082850346,0.8789152,0.001844194,0.00014936269,0.0003132331,0.00039409022,0.0014977384,0.05775169],"genre_scores_gemma":[0.627523,0.0012947111,0.33676288,0.0009253536,0.00029248654,0.0010939373,0.00095366506,0.00076889194,0.03038519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980166,0.0006168138,0.00009910065,0.0004173463,0.0005331368,0.00031705736],"domain_scores_gemma":[0.9964779,0.0019147795,0.00022053852,0.00096719316,0.00024545056,0.00017410498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016576989,0.0008005019,0.0006962731,0.00093487266,0.0011112553,0.0026253273,0.0017785407,0.0017013095,0.0116951475],"category_scores_gemma":[0.0058841137,0.0005617975,0.0012442452,0.0014495613,0.003216206,0.005758641,0.0041501243,0.0038748716,0.0014884094],"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.000056373283,0.000025962407,0.00009353747,0.00008585167,0.0000075641065,0.000053614458,0.00012426944,0.014644349,0.0011850012,0.96664935,0.0015414143,0.015532839],"study_design_scores_gemma":[0.000025654688,0.000024157856,0.000041631345,0.000018844396,0.000009215751,0.000053986212,0.00002233529,0.04330211,0.0015681987,0.94800293,0.006919243,0.000011543719],"about_ca_topic_score_codex":0.0012900003,"about_ca_topic_score_gemma":0.0012199624,"teacher_disagreement_score":0.0116951475,"about_ca_system_score_codex":0.0021175747,"about_ca_system_score_gemma":0.0016618433,"threshold_uncertainty_score":0.03912419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19532038,0.0005631734,0.7845304,0.00211615,0.00012805889,0.00017922044,0.00085655006,0.001266304,0.015039721],"genre_scores_gemma":[0.9845889,0.0001909782,0.013026036,0.00030111923,0.000097501106,0.00009728822,0.00025006765,0.00009502131,0.0013530673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98884565,0.002246504,0.00050643977,0.002013778,0.0045355055,0.0018521334],"domain_scores_gemma":[0.90785,0.063146465,0.009439435,0.014737171,0.0033828083,0.001444148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006796315,0.0008902823,0.0014266233,0.0018593655,0.0013931454,0.005356311,0.0029164904,0.0022490518,0.0049189054],"category_scores_gemma":[0.05593529,0.00061005686,0.0014823872,0.0011048275,0.0056943838,0.007872921,0.0068465723,0.0039796857,0.0009067597],"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.0016422787,0.00013495907,0.004345203,0.00039175656,0.00019310603,0.00033158445,0.00056869927,0.24182875,0.020994952,0.6887957,0.002643889,0.038129024],"study_design_scores_gemma":[0.00007963153,0.0002606124,0.0012260308,0.000052201227,0.000045420133,0.00021802858,0.00014700665,0.5168093,0.015953097,0.46330103,0.0018267875,0.000080861406],"about_ca_topic_score_codex":0.00092211243,"about_ca_topic_score_gemma":0.0004382586,"teacher_disagreement_score":0.006796315,"about_ca_system_score_codex":0.0024985643,"about_ca_system_score_gemma":0.0019325874,"threshold_uncertainty_score":0.035942793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029553382,0.0025618358,0.94877434,0.0045044683,0.00017441426,0.00018009223,0.00049323746,0.0005953283,0.013162894],"genre_scores_gemma":[0.63048667,0.0037050045,0.34441167,0.0027847544,0.00088380545,0.0013745147,0.0019583863,0.0010674652,0.0133277355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886254,0.0038758544,0.00053726404,0.0020538438,0.0035651147,0.0013425217],"domain_scores_gemma":[0.8660627,0.11440031,0.0037808206,0.008770314,0.0044406285,0.0025451449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015215197,0.0035294371,0.0036880998,0.0027308112,0.0023412001,0.006464393,0.0071260864,0.004854742,0.008843601],"category_scores_gemma":[0.10269888,0.001510246,0.0029498348,0.003025816,0.008773281,0.01919675,0.011320312,0.013528356,0.0016130127],"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.00058089936,0.00028888654,0.003209514,0.000722464,0.00017152008,0.00024210778,0.00057203247,0.20723736,0.0033217832,0.74383074,0.004801501,0.035021212],"study_design_scores_gemma":[0.000032213276,0.00008648001,0.00042122317,0.00010625887,0.000027216684,0.000112517126,0.00006641696,0.5611334,0.0018201147,0.4349337,0.0012171741,0.000043307748],"about_ca_topic_score_codex":0.0018427812,"about_ca_topic_score_gemma":0.0020974872,"teacher_disagreement_score":0.015215197,"about_ca_system_score_codex":0.0088111255,"about_ca_system_score_gemma":0.004414055,"threshold_uncertainty_score":0.08046663},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8593651,0.00047388565,0.12074234,0.0029056184,0.000054318996,0.00016614466,0.0031897628,0.0013454002,0.011757581],"genre_scores_gemma":[0.96395963,0.0003124465,0.028804587,0.00040670027,0.00006647442,0.00011068103,0.0026150846,0.00025839044,0.003466067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737835,0.000775424,0.0001782955,0.000718539,0.00048440692,0.0004650295],"domain_scores_gemma":[0.97773755,0.016236033,0.00165497,0.0026841457,0.0006885769,0.0009986744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014140724,0.00092352636,0.0014986863,0.00071201194,0.0015344459,0.0052680215,0.0030872738,0.002041929,0.0078105214],"category_scores_gemma":[0.0141344825,0.0010167065,0.0020675373,0.0017526627,0.002568414,0.008417625,0.00255249,0.0030421459,0.0007206811],"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.0045181843,0.0006805896,0.022427373,0.0019021305,0.0003836141,0.0011868442,0.0034585297,0.5443118,0.0324248,0.30539644,0.017769892,0.065539904],"study_design_scores_gemma":[0.00030495826,0.00019554711,0.0042456985,0.00009976887,0.00014564015,0.0007593097,0.00084221916,0.59089136,0.013544701,0.38433844,0.004540099,0.000092270064],"about_ca_topic_score_codex":0.009136095,"about_ca_topic_score_gemma":0.0064222333,"teacher_disagreement_score":0.009136095,"about_ca_system_score_codex":0.003697939,"about_ca_system_score_gemma":0.0018504286,"threshold_uncertainty_score":0.026830494},"labels":[],"label_agreement":null}]}