{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":18,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":18,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"285351b47482","filters":{"venue":"Electronic colloquium on computational complexity"}},"results":[{"id":"W2135134090","doi":"","title":"Uniform Hardness Amplification in NP via Monotone Codes","year":2006,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monotone polygon; Mathematics; Decoding methods; Lemma (botany); Code (set theory); Discrete mathematics; Combinatorics; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01916991826963298,"gpt":0.2556825115246827,"spread":0.2365125932550498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000680235,0.0003556739,0.0004020857,0.0005071727,0.0004368687,0.0002432389,0.001188435,0.0001033388,0.00005512593],"category_scores_gemma":[0.00002470098,0.0003973794,0.0001534438,0.001694209,0.0002227797,0.000470084,0.0002231677,0.0005119352,0.000102185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006826065,"about_ca_system_score_gemma":0.0003928824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006731771,"about_ca_topic_score_gemma":0.001302467,"domain_scores_codex":[0.9966487,0.0002089679,0.0006617025,0.0008427028,0.0007893735,0.0008485958],"domain_scores_gemma":[0.9984716,0.0003492686,0.0002301124,0.0006126887,0.0002347586,0.0001015244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005266789,0.0005127116,0.000635098,0.0000120833,0.00001713077,0.000008171767,0.00006579532,0.04185895,0.000123256,0.9523449,0.000854122,0.003515134],"study_design_scores_gemma":[0.0007097548,0.0001639966,0.04500647,0.00001296874,0.000003273504,0.00002727117,0.000005333489,0.385709,0.0001941022,0.5643404,0.003519182,0.0003083122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06804111,0.0001221786,0.9243793,0.002691805,0.0003749483,0.0005906581,0.00002575595,0.0003775406,0.003396668],"genre_scores_gemma":[0.9703081,0.000005503134,0.02853455,0.000510959,0.0001360229,0.00008913966,0.0001938543,0.00002041825,0.0002014427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.902267,"threshold_uncertainty_score":0.9998478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W39832950","doi":"","title":"An Exponential Time/Space Speedup For Resolution","year":2007,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Resolution (logic); DPLL algorithm; Satisfiability; Speedup; Heuristics; Bottleneck; PSPACE; Mathematical proof; Heuristic; Proof complexity; Space (punctuation); Computer science; Mathematics; Algorithm; Conjunctive normal form; Automated theorem proving; Exponential function; Discrete mathematics; Computational complexity theory; Mathematical optimization; Parallel computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02567232214564987,"gpt":0.2977253419486561,"spread":0.2720530198030063,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001449508,0.000292998,0.0002981497,0.0002413652,0.0006475627,0.0002094748,0.0009665125,0.0001156956,0.00007522989],"category_scores_gemma":[0.00008648864,0.0003067545,0.0001830346,0.0005851952,0.0001336907,0.0004210347,0.0001276445,0.0002843607,0.0001978608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005917287,"about_ca_system_score_gemma":0.000540869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002755483,"about_ca_topic_score_gemma":0.0001745161,"domain_scores_codex":[0.997053,0.0001526874,0.0004025824,0.0007833542,0.0006029007,0.001005428],"domain_scores_gemma":[0.9981406,0.0005442111,0.0001999498,0.0004934194,0.0003849528,0.0002368266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003019049,0.0004343207,0.00005310603,0.00001053084,0.00003700155,0.000004521825,0.00029385,0.006876367,0.00108931,0.9838764,0.003786432,0.00323627],"study_design_scores_gemma":[0.001730594,0.001960583,0.00909668,0.00001429643,0.00001499637,0.00004010386,0.00002165523,0.6824703,0.001408452,0.2840766,0.01863533,0.0005304146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0623721,0.0001177262,0.9306779,0.0006882351,0.0005051348,0.0006042744,0.00001439048,0.000413134,0.004607088],"genre_scores_gemma":[0.9468746,0.000001620676,0.051411,0.000333288,0.000540793,0.00002664473,0.000149469,0.00002354473,0.000639011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8845025,"threshold_uncertainty_score":0.9999384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W11888698","doi":"10.1016/s0378-1135(01)00499-0","title":"Comments on ECCC Report TR06-133: The Resolution Width Problem is EXPTIME-Complete","year":2009,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Counterexample; Lemma (botany); Simple (philosophy); Pebble; Resolution (logic); Mathematics; Argument (complex analysis); Reduction (mathematics); Combinatorics; Computer science; Geometry; Philosophy; Artificial intelligence; Biology; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.06241613730404857,"gpt":0.2656478985926266,"spread":0.203231761288578,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001905242,0.0003241482,0.0005069199,0.0002037489,0.0007428004,0.0001446199,0.000507918,0.00009960285,0.0003430324],"category_scores_gemma":[0.00008422666,0.0003112564,0.0002277171,0.0004553806,0.0001341361,0.0001316471,0.00004995672,0.0005231427,0.0008151425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006542485,"about_ca_system_score_gemma":0.0001176231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000910975,"about_ca_topic_score_gemma":0.00002106953,"domain_scores_codex":[0.9971361,0.0001785569,0.001010357,0.0007361507,0.0002376078,0.0007012845],"domain_scores_gemma":[0.9981567,0.0003127545,0.0007451576,0.0005908454,0.00009500217,0.00009957404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002357511,0.0003398492,0.0004659369,0.00001007995,0.00007871774,0.000007321489,0.0002996872,0.00933873,0.00001155501,0.9770477,0.01172472,0.0004398948],"study_design_scores_gemma":[0.001073421,0.001145081,0.0242164,0.0000440103,0.000009053539,0.00007220339,0.00002173891,0.0362833,0.0000277313,0.8497682,0.08694258,0.0003963123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5922542,0.001337234,0.07699268,0.07291657,0.002054913,0.005039364,0.0009232214,0.000873884,0.247608],"genre_scores_gemma":[0.9920496,0.000006100559,0.0009181599,0.004678504,0.0002462211,0.00004421751,0.0001892964,0.00002659121,0.001841284],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3997955,"threshold_uncertainty_score":0.9999629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W32072441","doi":"10.1007/s11060-020-03434-7","title":"Efficient Communication Using Partial Information.","year":2010,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Computer science; Bounded function; Protocol (science); Theoretical computer science; Computational complexity theory; Discrete mathematics; Communications protocol; Mathematics; Algorithm; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0231787037010444,"gpt":0.2737260755837392,"spread":0.2505473718826948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007258623,0.0002672683,0.0002479576,0.0003083224,0.0009686218,0.0003906684,0.001452864,0.00009777907,0.000132504],"category_scores_gemma":[0.00009043021,0.0002882085,0.0001544581,0.0009303131,0.0002856337,0.0004685748,0.0004269939,0.0008688385,0.0001494127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002121334,"about_ca_system_score_gemma":0.0006097011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008101202,"about_ca_topic_score_gemma":0.00006690399,"domain_scores_codex":[0.9975005,0.0001725643,0.0005214143,0.0003906277,0.0007858062,0.0006290684],"domain_scores_gemma":[0.9979696,0.000370075,0.0002571279,0.0008807792,0.0003643569,0.0001580602],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002274821,0.0001602465,0.00004217824,0.000005565734,0.00002147601,8.227219e-7,0.0001874075,0.1241079,0.00009598219,0.8724174,0.0002728376,0.002665492],"study_design_scores_gemma":[0.0005461313,0.0001080321,0.002208561,0.00001065106,0.000005383162,0.00004116812,0.00001114402,0.8039868,0.0001433943,0.1847982,0.007869296,0.0002711749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2487932,0.00003411879,0.7452818,0.001824262,0.0007152013,0.0004321217,0.00002364302,0.0003928416,0.002502823],"genre_scores_gemma":[0.8833115,0.000001385993,0.1157303,0.0007525316,0.00009260639,0.00002486917,0.0000622786,0.000009784198,0.00001473237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6876191,"threshold_uncertainty_score":0.999957,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2398812037","doi":"","title":"Is the Valiant-Vazirani Isolation Lemma Improvable?","year":2011,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lemma (botany); Combinatorics; Witness; Mathematics; Isolation (microbiology); Time complexity; Polynomial; Discrete mathematics; Computer science; Botany; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.0715601453350734,"gpt":0.2694981997654061,"spread":0.1979380544303327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000823302,0.0003755762,0.0003107683,0.0002171524,0.001096513,0.0002452027,0.001955634,0.00009642491,0.0004598656],"category_scores_gemma":[0.00004095519,0.0003145989,0.0002830304,0.001223327,0.0003071435,0.0004989419,0.0003834515,0.0006341648,0.000271846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002585117,"about_ca_system_score_gemma":0.000474492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000210146,"about_ca_topic_score_gemma":0.0001180196,"domain_scores_codex":[0.9966104,0.0002813625,0.0005298936,0.0008253413,0.0008766978,0.0008762923],"domain_scores_gemma":[0.9979702,0.0004006746,0.000259184,0.0009187916,0.0003122201,0.0001389107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006891422,0.000250197,0.000180409,0.000009262045,0.00008068812,0.000005012236,0.001066485,0.0005872126,0.00003913046,0.9885446,0.003789918,0.005378188],"study_design_scores_gemma":[0.0005914355,0.0005112262,0.01794466,0.00001357068,0.00001367204,0.0000471064,0.00002846287,0.3174078,0.000373028,0.6553384,0.007371546,0.00035915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02591133,0.0001881706,0.9503669,0.006767227,0.0008960779,0.0009011829,0.00003649778,0.000570214,0.01436245],"genre_scores_gemma":[0.9536381,0.000009222523,0.04230213,0.003361623,0.0001644212,0.00005770404,0.00002597195,0.00002447479,0.0004163752],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9277267,"threshold_uncertainty_score":0.9999306,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W96496641","doi":"","title":"Black-White Pebbling is PSPACE-Complete","year":2007,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"PSPACE; PH; White (mutation); Completeness (order theory); Complexity class; Computational complexity theory; Computation; Discrete mathematics; Mathematics; Bounded function; Structural complexity theory; Combinatorics; Computer science; Model of computation; Theoretical computer science; Time complexity; Algorithm; Quantum complexity theory; Quantum computer; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03925007688016794,"gpt":0.290956658325877,"spread":0.2517065814457091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002381581,0.0006929828,0.0007001459,0.0006313536,0.0008004265,0.0004618818,0.002318842,0.0001853623,0.0003343165],"category_scores_gemma":[0.0001306113,0.0007475276,0.0004126614,0.002173038,0.0004585689,0.0005326224,0.0008328325,0.001027363,0.0006012812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001328195,"about_ca_system_score_gemma":0.0008511275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006666144,"about_ca_topic_score_gemma":0.0002240104,"domain_scores_codex":[0.9931391,0.000295075,0.001034192,0.001727467,0.001816596,0.0019875],"domain_scores_gemma":[0.9958907,0.001275601,0.0004112032,0.001288645,0.0006840288,0.0004497798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002241774,0.0009066731,0.001518218,0.00005160555,0.0001830063,0.00006602396,0.001850194,0.05556965,0.0002138576,0.9186198,0.006735847,0.01406098],"study_design_scores_gemma":[0.00138854,0.0008239856,0.03680185,0.00002568644,0.00001611547,0.00009496859,0.00005109117,0.5944611,0.0002344148,0.346275,0.0189333,0.0008939739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06751897,0.0001302416,0.9150711,0.006811895,0.0007713793,0.0008243652,0.00003514585,0.0008748174,0.007962082],"genre_scores_gemma":[0.8985184,0.000004940242,0.09706002,0.003345756,0.0004568183,0.00001993835,0.00005683532,0.00004874912,0.0004885638],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8309994,"threshold_uncertainty_score":0.9994976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403413752","doi":"","title":"Fourier Concentration from Shrinkage.","year":2013,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Exponent; Combinatorics; Degree (music); Fourier series; Fourier transform; Mathematics; Connection (principal bundle); Function (biology); Shrinkage; Physics; Mathematical analysis; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02087328373466813,"gpt":0.2487809314631965,"spread":0.2279076477285284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004303487,0.0004387955,0.0004444126,0.0001315437,0.0004726791,0.0005976182,0.001492974,0.0001291209,0.001015871],"category_scores_gemma":[0.0001047843,0.0004528625,0.0002059627,0.0007977175,0.0002215225,0.0008266594,0.0004491314,0.0005725298,0.001105791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007807377,"about_ca_system_score_gemma":0.0006836418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005013103,"about_ca_topic_score_gemma":0.0001015109,"domain_scores_codex":[0.9956676,0.0003813717,0.0006481607,0.001170952,0.00113577,0.0009961003],"domain_scores_gemma":[0.9970769,0.000964907,0.0002516164,0.0009164152,0.0005133664,0.000276811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004386664,0.0006788865,0.001103573,0.00001131481,0.0001374986,0.00001144802,0.0004207928,0.03250896,0.0003088717,0.9172181,0.0087149,0.03884173],"study_design_scores_gemma":[0.0006540478,0.0002728584,0.03907922,0.00000767491,0.000005650531,0.000008831315,0.000007753129,0.5110617,0.000151311,0.4462059,0.002221492,0.0003235852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1998299,0.0001449499,0.7876142,0.005914511,0.0007555832,0.001085533,0.00002647812,0.0006765468,0.003952243],"genre_scores_gemma":[0.908786,0.000003788962,0.08864657,0.001796546,0.0003153534,0.000120874,0.0001389651,0.0000241611,0.0001677743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7089561,"threshold_uncertainty_score":0.9998974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041058635","doi":"","title":"Towards deterministic tree code constructions.","year":2011,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Tree (set theory); Computation; Code (set theory); Bounded function; Product (mathematics); Mathematics; K-ary tree; Interval tree; Discrete mathematics; Construct (python library); Theoretical computer science; Computer science; Operator (biology); Algorithm; Tree structure; Binary tree; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.07038306872289203,"gpt":0.2931564632101951,"spread":0.2227733944873031,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000489768,0.0003443513,0.000348727,0.0003176127,0.0004585258,0.0001212738,0.001398124,0.0001009014,0.0001426589],"category_scores_gemma":[0.0001234564,0.0003725837,0.0001712515,0.0007889284,0.0002914649,0.0003094996,0.0003120188,0.0005218009,0.0001416973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000516586,"about_ca_system_score_gemma":0.0009136642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001173128,"about_ca_topic_score_gemma":0.000320747,"domain_scores_codex":[0.9971111,0.0002253492,0.0004981615,0.0007873671,0.0006406539,0.0007372982],"domain_scores_gemma":[0.9982884,0.0002856128,0.00024386,0.0007061212,0.0003087131,0.0001673192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005983587,0.0002252966,0.000280669,0.000009237538,0.00004277296,0.00001935226,0.0004025766,0.0002432265,0.00005195901,0.9778945,0.001131658,0.01963893],"study_design_scores_gemma":[0.0006744458,0.001207047,0.02141731,0.00003165595,0.00001928745,0.0003439723,0.00002664488,0.1646006,0.001616686,0.8067749,0.002668779,0.000618667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03798021,0.00004625619,0.9089966,0.0004783595,0.0007145012,0.0004872274,0.00001934233,0.001723356,0.04955412],"genre_scores_gemma":[0.8381563,0.000002774985,0.1610062,0.000544849,0.00006535305,0.00006141701,0.00001440975,0.00002335552,0.0001253777],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8001761,"threshold_uncertainty_score":0.9998726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2396953629","doi":"","title":"An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas.","year":2013,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Time complexity; Algorithm; Constructive; struct; Running time; Deterministic algorithm; Discrete mathematics; Computational complexity theory; Random variable; Combinatorics; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02286164684050804,"gpt":0.2770429379744798,"spread":0.2541812911339718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004149379,0.000352487,0.0003404012,0.0001651399,0.0006156443,0.0005018587,0.001444481,0.0001104337,0.00006694125],"category_scores_gemma":[0.00004448797,0.0003445511,0.0001468908,0.0003419665,0.00009759617,0.0006759173,0.0002501634,0.0003090599,0.00007874432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000447435,"about_ca_system_score_gemma":0.0007388256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001670191,"about_ca_topic_score_gemma":0.00006780518,"domain_scores_codex":[0.9971954,0.0001374247,0.0004412246,0.0008237348,0.0003763766,0.001025889],"domain_scores_gemma":[0.9979271,0.0004583486,0.0002011558,0.0007083484,0.0003827935,0.0003222302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000122614,0.001519535,0.0001053318,0.00006513092,0.0001502964,0.00001224282,0.0004716103,0.01357601,0.003106163,0.3257479,0.004505484,0.6506177],"study_design_scores_gemma":[0.0009161096,0.001179041,0.003388443,0.00001042078,0.000008419945,0.00003160452,0.000009558727,0.7736635,0.000286406,0.2188055,0.001369809,0.0003312621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02668448,0.00003895572,0.9708022,0.0005862289,0.000254211,0.001087838,0.00008206454,0.0003357124,0.0001282362],"genre_scores_gemma":[0.528978,0.000001850069,0.4691526,0.0009769755,0.0002028262,0.0002505354,0.0003089561,0.00002925773,0.00009895131],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7600874,"threshold_uncertainty_score":0.9999006,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397518487","doi":"","title":"Nonuniform catalytic space and the direct sum for space","year":2015,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Boolean function; Branching (polymer chemistry); Computation; Space (punctuation); Function (biology); Mathematics; Discrete mathematics; Literal (mathematical logic); Binary decision diagram; Combinatorics; Property (philosophy); Computer science; Algorithm; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.03804816408237615,"gpt":0.2734843221984433,"spread":0.2354361581160672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001541801,0.0003232334,0.0004323273,0.000170236,0.000670858,0.0003477178,0.001054244,0.00006657514,0.000006381158],"category_scores_gemma":[0.0002382878,0.0002575089,0.0001833144,0.0007239431,0.0005921192,0.0003085428,0.0003932951,0.0003569709,0.00002730173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003287669,"about_ca_system_score_gemma":0.0007274291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001533085,"about_ca_topic_score_gemma":0.0002302324,"domain_scores_codex":[0.9973492,0.0002010341,0.0003457082,0.0006757715,0.0006932154,0.0007350647],"domain_scores_gemma":[0.9970249,0.001613937,0.0001857922,0.0005827416,0.0003646477,0.0002279944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002655428,0.00009456395,0.00002870051,0.0000132861,0.00006070231,0.000001984317,0.0004262538,0.004731922,0.00000188217,0.9885432,0.00428481,0.001547174],"study_design_scores_gemma":[0.002805755,0.0003774429,0.0005202066,0.00001112884,0.00001497831,0.00003772015,0.00003876466,0.4272997,0.00004706355,0.5498506,0.01875264,0.0002439904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0108787,0.0009456425,0.9309195,0.03686937,0.0009172331,0.002076803,0.00007283853,0.000488346,0.01683155],"genre_scores_gemma":[0.9650875,0.00001197719,0.03281109,0.001026405,0.0002013546,0.0001282795,0.00004914809,0.00002251129,0.0006617951],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9542087,"threshold_uncertainty_score":0.9999877,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W172422417","doi":"","title":"Polynomial Time with Restricted Use of Randomness","year":2009,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Randomness; Turing machine; Time complexity; Focus (optics); Hierarchy; Computer science; Stack (abstract data type); Polynomial hierarchy; Computation; Time hierarchy theorem; Binary logarithm; DTIME; Discrete mathematics; Random number generation; PSPACE; Theoretical computer science; Mathematics; Algorithm; Computational complexity theory; Universal Turing machine; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02529183199500784,"gpt":0.2433837459703609,"spread":0.2180919139753531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002553904,0.0003139047,0.0004883913,0.0003497225,0.0003163395,0.0001777918,0.0009227353,0.00007415708,0.00006500423],"category_scores_gemma":[0.00006087243,0.0002886347,0.0001621771,0.001481746,0.0002292989,0.0004958354,0.0001137651,0.000380045,0.00002548015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001879924,"about_ca_system_score_gemma":0.0006232584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004440882,"about_ca_topic_score_gemma":0.0000213396,"domain_scores_codex":[0.997216,0.0002151398,0.0004865695,0.0006117116,0.0008430376,0.0006274849],"domain_scores_gemma":[0.9979414,0.0007091219,0.0002769142,0.0005803923,0.0003529228,0.0001392669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002978732,0.001627722,0.0001732748,0.00001732291,0.0002209321,0.00004173015,0.0002634248,0.07432887,0.0008958659,0.8845422,0.0120758,0.0228341],"study_design_scores_gemma":[0.007892749,0.005416599,0.0630618,0.00009329159,0.00003899058,0.0001495275,0.000005954333,0.72541,0.00105638,0.1859062,0.009975722,0.0009927509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3473099,0.0001051981,0.6432467,0.004265829,0.0002495873,0.001104574,0.00006400563,0.0006314967,0.003022678],"genre_scores_gemma":[0.9560227,0.000003509862,0.04296843,0.000658159,0.0000792304,0.00001103753,0.00005645116,0.00001216948,0.0001882529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6986361,"threshold_uncertainty_score":0.9999566,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2394568608","doi":"","title":"Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits.","year":2014,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Satisfiability; Mathematics; Parity (physics); Electronic circuit; Binary number; Algorithm; Boolean circuit; Boolean function; Correlation; Constant (computer programming); Discrete mathematics; Combinatorics; Arithmetic; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03848540810114379,"gpt":0.2754499485606698,"spread":0.2369645404595261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001009623,0.0003722055,0.0004212775,0.0001999915,0.0008875899,0.0002944492,0.0007978776,0.0001266218,0.00002511006],"category_scores_gemma":[0.0002703708,0.0004064434,0.0001884444,0.0006333804,0.0002604968,0.0002941798,0.0002425245,0.0004294892,0.00003096524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000242348,"about_ca_system_score_gemma":0.0003334457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002689661,"about_ca_topic_score_gemma":0.0000791904,"domain_scores_codex":[0.9970234,0.0002142334,0.0005002804,0.0009298648,0.0005396886,0.0007925084],"domain_scores_gemma":[0.9964914,0.002235409,0.0002312279,0.000493316,0.0003469888,0.0002016416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004189825,0.000170475,0.0001404588,0.00002933945,0.00005216633,0.000001014533,0.0001574748,0.01085191,0.00002052892,0.9496251,0.0005337778,0.03837582],"study_design_scores_gemma":[0.0009847746,0.0006168113,0.005784041,0.00001428748,0.00001014048,0.00002591623,0.000004907436,0.5545074,0.00002422269,0.4280527,0.009696822,0.0002779182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01343568,0.0001358718,0.9813055,0.002093939,0.000635891,0.0006899668,0.00003535355,0.0003517906,0.001315982],"genre_scores_gemma":[0.8580963,0.000007832383,0.1393363,0.001468877,0.0003674046,0.0001026786,0.0001323029,0.00003186267,0.0004564706],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8446606,"threshold_uncertainty_score":0.9998388,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402863327","doi":"","title":"Non-commutative circuits and the sum-of-squares problem.","year":2010,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Commutative property; Mathematics; Upper and lower bounds; Combinatorics; Discrete mathematics; Mathematical proof; Polynomial; Integer (computer science); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01641980183737616,"gpt":0.2615900276857136,"spread":0.2451702258483374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001110477,0.0002887239,0.0004324559,0.0001988471,0.0006480796,0.0001875773,0.001337693,0.00007823911,0.00004382607],"category_scores_gemma":[0.00007987823,0.0002274376,0.0001682496,0.0008073707,0.001249797,0.0002712004,0.0004231994,0.0008988097,0.00001527212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005874267,"about_ca_system_score_gemma":0.0004485192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001418069,"about_ca_topic_score_gemma":0.0003281179,"domain_scores_codex":[0.9975211,0.0002259378,0.0004808696,0.0005531249,0.000674532,0.0005444537],"domain_scores_gemma":[0.9971589,0.001537278,0.0002824414,0.0005864732,0.00032412,0.0001108296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006295944,0.0001475323,0.000136437,0.00001862205,0.00006529188,0.000001979348,0.0008816976,0.001074106,0.0001342655,0.9877741,0.000282553,0.009420438],"study_design_scores_gemma":[0.001887029,0.0003155049,0.0109559,0.00001822208,0.00001133341,0.00004693566,0.00003148244,0.2306995,0.0003316256,0.754218,0.001242479,0.0002419847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.312838,0.0003354555,0.657463,0.01187861,0.0009234013,0.002112969,0.00005906296,0.0003522609,0.01403726],"genre_scores_gemma":[0.9802334,0.000008187467,0.01902056,0.0005011875,0.00008121241,0.00006444074,0.00001753682,0.00001397337,0.00005945269],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6673955,"threshold_uncertainty_score":0.9274638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2407080619","doi":"","title":"Low uniform versions of NC1.","year":2011,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Characterization (materials science); Logarithm; Power (physics); Electronic circuit; Mathematics; Computer science; Value (mathematics); Word (group theory); Discrete mathematics; Combinatorics; Algorithm; Topology (electrical circuits); Geometry; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03610587064497138,"gpt":0.2449870468116865,"spread":0.2088811761667151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003615328,0.0001858332,0.0002449797,0.0001834294,0.0002065187,0.00003075907,0.001012117,0.00005447955,0.0002602531],"category_scores_gemma":[0.00002670189,0.0001834469,0.0001361829,0.0005952627,0.0001639238,0.0002605299,0.000237606,0.0002234773,0.0001052801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001718058,"about_ca_system_score_gemma":0.0004110318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005008201,"about_ca_topic_score_gemma":0.00002418919,"domain_scores_codex":[0.998271,0.00009921326,0.0003328309,0.0003844665,0.0004576951,0.0004547939],"domain_scores_gemma":[0.9988416,0.0002457231,0.0001798407,0.0004636642,0.0001670814,0.0001020513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005133072,0.0003281586,0.0000639142,0.00001087401,0.00003607748,0.000003983512,0.0003356503,0.001148356,0.0001189152,0.9949296,0.0006422161,0.002330885],"study_design_scores_gemma":[0.0008086885,0.0008370461,0.01414585,0.00003364967,0.000009362141,0.00002350373,0.00004053804,0.1765891,0.004096986,0.8020568,0.001051968,0.0003064463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2724011,0.00008327604,0.7008375,0.0006045246,0.0004434745,0.0003978866,0.00003352689,0.0004086433,0.02479009],"genre_scores_gemma":[0.9759111,0.000003775943,0.02350869,0.0003960729,0.00003156788,0.000009714684,0.00002220881,0.00001079985,0.0001060498],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.70351,"threshold_uncertainty_score":0.7480747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2610939548","doi":"","title":"Communication Complexity of Set-Disjointness for All Probabilities.","year":2014,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Characterization (materials science); Mathematics; Class (philosophy); Bounded function; Complexity class; Set (abstract data type); Upper and lower bounds; Discrete mathematics; Simple (philosophy); Combinatorics; Structural complexity theory; Computational complexity theory; Time complexity; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.05825951324735681,"gpt":0.3010568026989903,"spread":0.2427972894516335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00162645,0.0003960337,0.0006433728,0.0002812013,0.0005737398,0.0001493226,0.002104777,0.0001132326,0.00005564183],"category_scores_gemma":[0.0002238003,0.0004259822,0.0003460388,0.0007301868,0.0009304152,0.0003704128,0.0004744448,0.0004236093,0.00001831693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003379912,"about_ca_system_score_gemma":0.0004275998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001051918,"about_ca_topic_score_gemma":0.0002319789,"domain_scores_codex":[0.9962212,0.0005264902,0.0008517771,0.0008011122,0.000788268,0.0008111616],"domain_scores_gemma":[0.9956894,0.001692167,0.0004822678,0.001276197,0.0006980473,0.000161945],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001049274,0.0004008588,0.00004623594,0.00008760615,0.00007610844,1.878447e-7,0.0003485241,0.008178433,0.00004154479,0.9858613,0.001198179,0.003656104],"study_design_scores_gemma":[0.0009640239,0.0006123992,0.002122848,0.00003087253,0.00001175618,0.000008985464,0.00001780209,0.3727143,0.0002555748,0.615657,0.007318803,0.0002855693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02819965,0.000123967,0.9617241,0.004890299,0.0003112033,0.001328431,0.0001142295,0.0003677951,0.002940301],"genre_scores_gemma":[0.8505698,0.000005883429,0.1480694,0.0007450297,0.00008193373,0.0001537161,0.0002709433,0.0000249445,0.00007828942],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8223702,"threshold_uncertainty_score":0.9998192,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2220261014","doi":"","title":"Making Hard Problems Harder","year":2006,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Randomness; Boolean function; Mathematics; Combinatorics; Advice (programming); Function (biology); Discrete mathematics; String (physics); Space (punctuation); Exponential function; Computer science; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03360477641972189,"gpt":0.2719475750839072,"spread":0.2383427986641853,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004630421,0.0003610476,0.0003315154,0.0002434908,0.0006511383,0.0003783007,0.001081758,0.00008010868,0.00005431394],"category_scores_gemma":[0.00002237146,0.0003551781,0.0001882232,0.0008207589,0.0001283042,0.000200268,0.0002969109,0.0005614895,0.0001382809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002993174,"about_ca_system_score_gemma":0.0004052814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006317925,"about_ca_topic_score_gemma":0.0000661796,"domain_scores_codex":[0.9967229,0.0001791036,0.0004702515,0.0008582953,0.0008257665,0.0009437132],"domain_scores_gemma":[0.9987049,0.0002844337,0.000210858,0.0005141002,0.0001996696,0.00008600693],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001350408,0.0001702541,0.0001190262,0.00001257968,0.00002368239,0.000008736723,0.0000604122,0.4174775,0.00005997315,0.5749088,0.003226725,0.00391883],"study_design_scores_gemma":[0.0004630379,0.0002242573,0.01281839,0.00002915629,0.0000040064,0.0000545285,0.000001667841,0.6186252,0.00004184618,0.3536051,0.01382253,0.0003102534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0717002,0.0002371835,0.9155627,0.005078232,0.0005076333,0.0004824797,0.00001411557,0.0008463853,0.005571111],"genre_scores_gemma":[0.9258376,0.000001087132,0.07231485,0.0009933059,0.0003527694,0.00002777929,0.00004397297,0.00002707754,0.0004015843],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8541374,"threshold_uncertainty_score":0.99989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406984000","doi":"","title":"Lower Bounds against Weakly Uniform Circuits.","year":2012,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Succinctness; Connection (principal bundle); Boolean circuit; Mathematics; Electronic circuit; Discrete mathematics; Circuit complexity; Polynomial; Relaxation (psychology); Boolean function; Combinatorics; Pigeonhole principle; Time complexity; Physics; Mathematical analysis; Quantum mechanics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02439709428338311,"gpt":0.2601159559057044,"spread":0.2357188616223213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008966218,0.0003506902,0.0003268652,0.0002197928,0.0005418014,0.0002513081,0.001180324,0.0000981257,0.0001494641],"category_scores_gemma":[0.00004384968,0.0003525688,0.0001924659,0.0008163589,0.0001679115,0.0008321911,0.0002950906,0.0004614067,0.0004913695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006434981,"about_ca_system_score_gemma":0.0005011288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001489654,"about_ca_topic_score_gemma":0.00001455497,"domain_scores_codex":[0.9967766,0.0001722031,0.0004247946,0.0005434786,0.0008108139,0.001272066],"domain_scores_gemma":[0.9983406,0.0003854376,0.0001888349,0.0006411338,0.0001595084,0.0002844806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002036247,0.0004194741,0.0001829151,0.000008894641,0.0000508899,0.000004342791,0.0001910482,0.002564255,0.0001611511,0.9836171,0.00312351,0.009656082],"study_design_scores_gemma":[0.001524643,0.0008204535,0.0322822,0.00004888779,0.00002016446,0.0001133589,0.00004817809,0.3000169,0.0005416526,0.5749617,0.08837258,0.001249302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.345634,0.0007130079,0.6018193,0.003101949,0.002303344,0.0006761107,0.0000391029,0.001245114,0.04446801],"genre_scores_gemma":[0.9909815,0.000007918373,0.00511454,0.003042382,0.0003522075,0.00003125624,0.00007509538,0.00002810584,0.0003670168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6453474,"threshold_uncertainty_score":0.9998927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2408470475","doi":"","title":"The Power of Super-logarithmic Number of Players.","year":2014,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Logarithm; Combinatorics; Block (permutation group theory); Randomness; Mathematics; Communication complexity; Discrete mathematics; Function (biology); Boolean function; Matrix (chemical analysis); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02921431922958444,"gpt":0.323155116604116,"spread":0.2939407973745315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006442666,0.0001330985,0.0002794549,0.00004323119,0.0002418177,0.0000190837,0.0003289912,0.00004507426,0.0002058304],"category_scores_gemma":[0.0001587612,0.0001017071,0.0001405262,0.000286673,0.0002212344,0.00003449101,0.00005109515,0.0001784595,0.00003112793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007391191,"about_ca_system_score_gemma":0.0001615471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002571438,"about_ca_topic_score_gemma":0.00006793722,"domain_scores_codex":[0.9985223,0.000126018,0.0004546045,0.0001884681,0.0004322353,0.0002763643],"domain_scores_gemma":[0.9967619,0.002380041,0.0002746597,0.0003070501,0.0002353304,0.00004106608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001073632,0.0001636471,0.0001982043,0.00001634817,0.00004832407,6.176202e-8,0.00008367185,0.0006120663,0.00006602486,0.9966091,0.001664567,0.0004306187],"study_design_scores_gemma":[0.001096042,0.0001964103,0.004216708,0.00001282416,0.000023729,0.000008464567,0.00004318196,0.01680472,0.0003340954,0.9679475,0.009193505,0.0001228391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9363021,0.00004743016,0.04541238,0.001197895,0.00009445939,0.0005650285,0.00005153858,0.0000418173,0.0162873],"genre_scores_gemma":[0.9949998,0.000004948985,0.004581012,0.00005189471,0.00003832072,0.00002989054,0.00001314002,0.00001452072,0.0002664815],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05869764,"threshold_uncertainty_score":0.4147494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}