{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Joshua Buresh-Oppenheim","is_ca":true},{"name":"Valentine Kabanets","is_ca":true},{"name":"Rahul Santhanam","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002932367,0.001301099,0.001491323,0.001511429,0.001439412,0.003373315,0.002784259,0.001625033,0.006072147],"category_scores_gemma":[0.02701009,0.0008436812,0.001674005,0.001483326,0.004535548,0.01016098,0.006800423,0.00773757,0.001004636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003089268,"about_ca_system_score_gemma":0.001313507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001164818,"about_ca_topic_score_gemma":0.0007905342,"domain_scores_codex":[0.9924647,0.001535091,0.0002597824,0.001474368,0.002995202,0.001270959],"domain_scores_gemma":[0.9698703,0.02237568,0.001105752,0.004570398,0.001382524,0.0006953151],"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.0006484613,0.0002288328,0.002420657,0.0005935318,0.00009720647,0.0004524262,0.0009293665,0.1751693,0.01694307,0.7296311,0.004552728,0.06833313],"study_design_scores_gemma":[0.00006268809,0.0001473692,0.0004801897,0.00004732094,0.00003838758,0.0003419562,0.0001079766,0.3543281,0.01160844,0.6278724,0.00491664,0.0000483969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1621212,0.0008232406,0.7902309,0.003622302,0.0001213219,0.0002312234,0.0005389304,0.001661796,0.04064913],"genre_scores_gemma":[0.8898072,0.0006289134,0.09935071,0.0008172281,0.0003379909,0.000443971,0.0004427432,0.0003946276,0.007776632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006072147,"threshold_uncertainty_score":0.02241427,"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","authors":[{"name":"Philipp Hertel","is_ca":true},{"name":"Toniann Pitassi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003928499,0.002144016,0.001340002,0.001406935,0.001225813,0.003960912,0.003279794,0.003326647,0.02973611],"category_scores_gemma":[0.01628278,0.001050213,0.002644545,0.002369453,0.002227647,0.01377627,0.003449769,0.005848985,0.005825638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002887485,"about_ca_system_score_gemma":0.00262616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001662766,"about_ca_topic_score_gemma":0.002542292,"domain_scores_codex":[0.9935048,0.001187216,0.000364182,0.001560737,0.002227997,0.001155097],"domain_scores_gemma":[0.9872963,0.007724205,0.0004888545,0.003432638,0.0007807955,0.0002771537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002486635,0.0008524176,0.002236558,0.002170858,0.000231268,0.0006029153,0.000509236,0.07881025,0.06091848,0.3454887,0.061892,0.4438007],"study_design_scores_gemma":[0.0005220829,0.0003258144,0.0009639492,0.0002322875,0.0002116616,0.001368892,0.0003316258,0.4233636,0.03722343,0.4940577,0.04133477,0.00006417545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08143615,0.006616788,0.8123696,0.02332962,0.001196078,0.0003354882,0.00190191,0.01049993,0.06231441],"genre_scores_gemma":[0.3931162,0.002932079,0.579157,0.003098848,0.0008932293,0.0003934788,0.001813278,0.001854585,0.01674135],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02973611,"threshold_uncertainty_score":0.09947717,"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","authors":[{"name":"Alexander Hertel","is_ca":true},{"name":"Alasdair Urquhart","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007271078,0.001432571,0.001485274,0.00171013,0.003419742,0.006011657,0.004853362,0.02311453,0.2061844],"category_scores_gemma":[0.05339609,0.0005866966,0.001897884,0.001897701,0.001671189,0.004838652,0.00211373,0.01561195,0.2062316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004239978,"about_ca_system_score_gemma":0.004348206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01192192,"about_ca_topic_score_gemma":0.01021836,"domain_scores_codex":[0.993872,0.0008226199,0.0006543248,0.0006692229,0.003195681,0.0007860581],"domain_scores_gemma":[0.9713567,0.00628051,0.0009607244,0.00285197,0.01649441,0.002055762],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001797439,0.00001046466,0.00002319735,0.00002873848,0.000001789204,0.00005716518,0.000009948571,0.00001856275,0.0000538732,0.0007355028,0.9965063,0.002536453],"study_design_scores_gemma":[0.000006580573,0.00000879429,0.00009767708,0.00004397011,0.000001967263,0.00002552719,0.00001792929,0.00003936594,0.00006169388,0.0004068149,0.9992804,0.000009190128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"commentary","genre_scores_codex":[0.0004664932,0.002267758,0.001944415,0.4825857,0.3828125,0.0003932286,0.002682676,0.002212394,0.1246348],"genre_scores_gemma":[0.005907167,0.003555923,0.002922324,0.317891,0.1578905,0.0004710395,0.003086046,0.002284379,0.5059916],"genre_candidate":"commentary","genre_consensus":"commentary","teacher_disagreement_score":0.2061844,"threshold_uncertainty_score":0.6897557,"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","authors":[{"name":"Mark Braverman","is_ca":true},{"name":"Anup Rao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002826832,0.001233336,0.001945679,0.00146779,0.001827068,0.003192419,0.002552376,0.001797956,0.01014021],"category_scores_gemma":[0.02405712,0.0008508579,0.001169182,0.002606385,0.001495561,0.00778044,0.004669123,0.001981903,0.002554566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001568287,"about_ca_system_score_gemma":0.00299394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002239269,"about_ca_topic_score_gemma":0.003245288,"domain_scores_codex":[0.9960373,0.001334785,0.0003514925,0.000645321,0.0008415809,0.0007895911],"domain_scores_gemma":[0.9696381,0.02028696,0.001391705,0.006621651,0.001496012,0.0005655796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002260066,0.0003156911,0.002019342,0.0009061111,0.0003033512,0.0004175792,0.0006753262,0.3386664,0.006729938,0.3143268,0.04712366,0.2862557],"study_design_scores_gemma":[0.0001348416,0.000140958,0.000374728,0.00006128595,0.00008665433,0.0002335964,0.0001160974,0.6490185,0.003171999,0.3399702,0.006651296,0.0000397841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0470354,0.001507642,0.9200969,0.003422217,0.0004031227,0.0002530675,0.002215721,0.001674995,0.02339095],"genre_scores_gemma":[0.8089951,0.001256971,0.1702408,0.0006692144,0.0004198218,0.0005354042,0.002505976,0.0003551745,0.01502158],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01014021,"threshold_uncertainty_score":0.03392237,"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","authors":[{"name":"Valentine Kabanets","is_ca":true},{"name":"Osamu Watanabe","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01036864,0.0008340385,0.001751806,0.0009990323,0.00226438,0.003513481,0.00430467,0.002813794,0.009049986],"category_scores_gemma":[0.05258707,0.001046379,0.002345447,0.001030352,0.008500618,0.01044404,0.007406999,0.008690557,0.001677651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002413164,"about_ca_system_score_gemma":0.002003262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008823125,"about_ca_topic_score_gemma":0.0006196561,"domain_scores_codex":[0.9847944,0.004896841,0.0005403447,0.003020582,0.00430002,0.002447811],"domain_scores_gemma":[0.9183831,0.05893421,0.003738874,0.01409411,0.00368001,0.00116979],"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.0006119802,0.0001927311,0.00185585,0.0003025024,0.0001305032,0.0003208762,0.0004446039,0.0279202,0.005356567,0.909304,0.01005199,0.04350831],"study_design_scores_gemma":[0.0002050672,0.0001768446,0.0006951624,0.00009966063,0.00007448535,0.0003435317,0.0001599384,0.1436791,0.01286034,0.8305863,0.01105183,0.00006776254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06217699,0.001221142,0.9009076,0.008501831,0.0003795531,0.0001855082,0.0002246521,0.001704586,0.02469803],"genre_scores_gemma":[0.8264758,0.000851056,0.1590489,0.003262614,0.0007688932,0.0006385093,0.0003942635,0.0006487982,0.00791128],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01036864,"threshold_uncertainty_score":0.0548352,"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","authors":[{"name":"Philipp Hertel","is_ca":true},{"name":"Toniann Pitassi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182272,0.001174582,0.00172849,0.0006343821,0.002581083,0.005760697,0.001619571,0.002916395,0.0110879],"category_scores_gemma":[0.008331487,0.000848594,0.001662618,0.001434011,0.003951614,0.007130048,0.003480246,0.005326285,0.002013136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002208555,"about_ca_system_score_gemma":0.003689123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004269189,"about_ca_topic_score_gemma":0.005100895,"domain_scores_codex":[0.9973236,0.0003885104,0.0001383047,0.0006821796,0.0007582104,0.0007093254],"domain_scores_gemma":[0.9903898,0.007394501,0.00051912,0.0005582836,0.0006525005,0.000485824],"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.000723997,0.0005478698,0.001472099,0.001129784,0.0001934923,0.001100904,0.0008485978,0.1117038,0.01505316,0.7944711,0.02564896,0.04710615],"study_design_scores_gemma":[0.0001269119,0.00004979096,0.0002083492,0.00002811138,0.00002587071,0.000235538,0.0001286449,0.06689877,0.004000353,0.9219548,0.006316606,0.00002631211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.273923,0.001899216,0.5191548,0.01314044,0.0005238249,0.0006780915,0.002597466,0.002356827,0.1857263],"genre_scores_gemma":[0.8746204,0.002001528,0.07776812,0.002511322,0.0003366916,0.0004941371,0.003113068,0.0004733257,0.03868152],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0110879,"threshold_uncertainty_score":0.03709269,"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","authors":[{"name":"Russell Impagliazzo","is_ca":false},{"name":"Valentine Kabanets","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001817942,0.001206805,0.001052179,0.002320935,0.001503184,0.002908736,0.001238456,0.001559124,0.01569914],"category_scores_gemma":[0.01234145,0.0005930024,0.00125519,0.001118764,0.004890279,0.007103891,0.004152748,0.00379102,0.002400751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002218295,"about_ca_system_score_gemma":0.0006553773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001340794,"about_ca_topic_score_gemma":0.0007697131,"domain_scores_codex":[0.9980397,0.0004314255,0.00007356773,0.0005440289,0.000621954,0.0002893762],"domain_scores_gemma":[0.9953049,0.002532658,0.0005480461,0.0007066162,0.000559658,0.0003480929],"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.00004897455,0.00001251857,0.0004171297,0.00006494525,0.0000121405,0.00007280755,0.0001798321,0.001482523,0.001426195,0.9838938,0.002816863,0.00957217],"study_design_scores_gemma":[0.00002047673,0.00004331546,0.0008288919,0.0000453982,0.00002049994,0.0003681544,0.00009056987,0.01781984,0.002279523,0.9650092,0.01344621,0.00002784383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1679714,0.008711598,0.5104282,0.008795574,0.0009997191,0.0001639697,0.001144117,0.0010431,0.3007423],"genre_scores_gemma":[0.8834379,0.003225325,0.04743855,0.002931957,0.002232288,0.000305274,0.0007957456,0.0008318207,0.05880113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01569914,"threshold_uncertainty_score":0.0525189,"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","authors":[{"name":"Mark Braverman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00244826,0.0007327997,0.000676871,0.001146026,0.00132252,0.001586786,0.001809778,0.0015701,0.002662018],"category_scores_gemma":[0.01170006,0.0008088632,0.001060499,0.001243714,0.00335729,0.003722366,0.004984215,0.004225574,0.001331727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001622329,"about_ca_system_score_gemma":0.001732417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009590961,"about_ca_topic_score_gemma":0.001080953,"domain_scores_codex":[0.9969164,0.0008354528,0.0001236962,0.0004115807,0.001377934,0.0003349028],"domain_scores_gemma":[0.9898997,0.005273224,0.000745244,0.002620853,0.001168926,0.0002920725],"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.00005880633,0.00003536207,0.0003681454,0.0001573765,0.00001882247,0.000100144,0.0002836315,0.02753241,0.007653637,0.9378319,0.001878325,0.02408143],"study_design_scores_gemma":[0.00003818251,0.00007856374,0.0001854617,0.00008244756,0.00002625757,0.0003301861,0.00005143578,0.2092677,0.01799031,0.7556311,0.01625347,0.00006499704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0115422,0.000356261,0.982451,0.0003068398,0.00006636453,0.00005610978,0.00008339479,0.0003646525,0.00477304],"genre_scores_gemma":[0.289592,0.001038187,0.7005997,0.0004492055,0.0001477431,0.0005657228,0.0003167539,0.0004224798,0.006868123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002662018,"threshold_uncertainty_score":0.0129478,"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","authors":[{"name":"Ruiwen Chen","is_ca":true},{"name":"Valentine Kabanets","is_ca":true},{"name":"Nitin Saurabh","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001986945,0.0008848508,0.0009824033,0.00116715,0.0008959399,0.001312495,0.002907715,0.001004206,0.006485221],"category_scores_gemma":[0.01129123,0.000852096,0.001779816,0.001506873,0.00127954,0.003490228,0.003442374,0.002469046,0.002405942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0013737,"about_ca_system_score_gemma":0.002478526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002678521,"about_ca_topic_score_gemma":0.005037392,"domain_scores_codex":[0.9969147,0.0006340271,0.0002307507,0.0006332126,0.001337788,0.0002494411],"domain_scores_gemma":[0.9933881,0.003112988,0.0003326298,0.002063002,0.0009956486,0.0001076143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005981116,0.0002924588,0.002557239,0.0004478367,0.0002006317,0.0002313903,0.0003216712,0.0906719,0.03349743,0.1221183,0.02191427,0.7271487],"study_design_scores_gemma":[0.0002311657,0.0001990443,0.0008604664,0.00004763637,0.0001589823,0.0004139985,0.00006407601,0.8283312,0.03053601,0.1181397,0.02095386,0.00006381501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009537929,0.0001644817,0.9835597,0.000366718,0.00007484161,0.0001673832,0.0002013454,0.00265123,0.00327637],"genre_scores_gemma":[0.1351587,0.0001705199,0.8581742,0.0004299288,0.00009146723,0.0003971471,0.001065326,0.0004291034,0.004083538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006485221,"threshold_uncertainty_score":0.02169526,"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","authors":[{"name":"Vincent Girard","is_ca":false},{"name":"Michal Kouck","is_ca":false},{"name":"Pierre McKenzie","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001917847,0.0006841681,0.001132461,0.0007489988,0.001262109,0.00292447,0.002346235,0.001156377,0.008555349],"category_scores_gemma":[0.01003239,0.0005346528,0.001482188,0.001351789,0.004217949,0.009068564,0.003794266,0.002517858,0.0008351305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001820743,"about_ca_system_score_gemma":0.001368268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00102136,"about_ca_topic_score_gemma":0.0008304652,"domain_scores_codex":[0.9974506,0.0007129018,0.0001332803,0.0006239704,0.0006970911,0.0003820108],"domain_scores_gemma":[0.9927832,0.003960217,0.0003710723,0.0021817,0.000374949,0.0003288848],"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.00009265808,0.00002255094,0.0003641027,0.00006104953,0.0000133878,0.00007366901,0.0001293027,0.023227,0.001152781,0.9644239,0.000665926,0.009773786],"study_design_scores_gemma":[0.00002298011,0.0000571679,0.0001074412,0.0000134967,0.00001924091,0.0001470601,0.00004414741,0.1209729,0.00220871,0.8730202,0.003371072,0.00001562557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2604603,0.001088331,0.6971858,0.001875849,0.0001055286,0.0001053498,0.0003426289,0.0006359961,0.03820022],"genre_scores_gemma":[0.91454,0.0005594777,0.07216389,0.0003539079,0.0001121162,0.0001871424,0.0002594723,0.0002521354,0.01157189],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008555349,"threshold_uncertainty_score":0.02862048,"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","authors":[{"name":"Matei David","is_ca":true},{"name":"Periklis A. Papakonstantinou","is_ca":true},{"name":"Anastasios Sidiropoulos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003774632,0.0009896524,0.001611449,0.001087533,0.001476573,0.005438979,0.002702468,0.001454117,0.004302208],"category_scores_gemma":[0.01625077,0.000712684,0.00204864,0.001499351,0.004322527,0.0106475,0.003907254,0.004448303,0.0007153295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00350116,"about_ca_system_score_gemma":0.002511174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001313202,"about_ca_topic_score_gemma":0.001276945,"domain_scores_codex":[0.9934036,0.001986453,0.0003451927,0.001465424,0.00149079,0.001308463],"domain_scores_gemma":[0.9664949,0.0228727,0.00203426,0.006826992,0.000822309,0.0009489021],"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.0002365328,0.00004860581,0.000859552,0.0001252174,0.00005125959,0.00009199735,0.0002169051,0.08258239,0.002622549,0.9017333,0.001364693,0.01006689],"study_design_scores_gemma":[0.00005967473,0.00006112969,0.0003262046,0.00001744029,0.00003625145,0.000111749,0.00004282155,0.2450985,0.002500197,0.7488225,0.00289624,0.00002733492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2064987,0.0006668122,0.753258,0.003418315,0.00006143849,0.0001867041,0.0007086978,0.001508608,0.03369278],"genre_scores_gemma":[0.9328526,0.0004869777,0.05905851,0.000320184,0.0001714131,0.0003119824,0.0004163173,0.0002430241,0.006139006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005438979,"threshold_uncertainty_score":0.02540284,"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","authors":[{"name":"Ruiwen Chen","is_ca":false},{"name":"Valentine Kabanets","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006690226,0.002170342,0.001744645,0.002442483,0.002295905,0.004587952,0.00578401,0.002676542,0.01419165],"category_scores_gemma":[0.05281118,0.001658858,0.00350814,0.004617889,0.004029627,0.01331278,0.004679648,0.008229,0.00303337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007153672,"about_ca_system_score_gemma":0.005271093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003348504,"about_ca_topic_score_gemma":0.004219517,"domain_scores_codex":[0.9911299,0.002731244,0.0003663246,0.001709393,0.002544234,0.001518898],"domain_scores_gemma":[0.9108474,0.07205503,0.004390238,0.008362629,0.003138036,0.001206668],"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.001310129,0.0008035974,0.007507139,0.0008727888,0.0003691237,0.0003894721,0.0005540125,0.1865836,0.0173494,0.6319135,0.02231131,0.1300359],"study_design_scores_gemma":[0.0001131875,0.0001563492,0.001665328,0.000120269,0.0001767424,0.0002874288,0.00006880189,0.6428296,0.01436468,0.333581,0.006579404,0.00005729135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0563213,0.001944987,0.9055988,0.003105443,0.0001670643,0.0002777246,0.0006796778,0.002568879,0.02933607],"genre_scores_gemma":[0.6486948,0.001673663,0.32763,0.003186152,0.0005863839,0.001241703,0.002355054,0.00163894,0.01299339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01419165,"threshold_uncertainty_score":0.05190378,"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","authors":[{"name":"Pavel Hrubeš","is_ca":true},{"name":"Avi Wigderson","is_ca":false},{"name":"Amir Yehudayoff","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004630057,0.001225314,0.001474184,0.001037774,0.002233609,0.004680456,0.004201408,0.001888177,0.01809882],"category_scores_gemma":[0.02533723,0.0009718839,0.002968449,0.001671035,0.005158446,0.02496402,0.005186339,0.008219856,0.00214968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003905986,"about_ca_system_score_gemma":0.002883572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001167521,"about_ca_topic_score_gemma":0.001513665,"domain_scores_codex":[0.9947174,0.001140671,0.0002551569,0.001406081,0.001772398,0.0007082113],"domain_scores_gemma":[0.9428846,0.0456711,0.002033096,0.00651481,0.001914935,0.000981362],"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.0004572273,0.00009965251,0.001239527,0.0005429033,0.00007910944,0.000146308,0.0003685642,0.01436067,0.005475415,0.9385723,0.007277586,0.03138064],"study_design_scores_gemma":[0.00006232551,0.0000710645,0.0003346606,0.00004231969,0.00005041582,0.0001738077,0.00007780829,0.02673132,0.00705707,0.9574674,0.007908245,0.00002351746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1637597,0.004000118,0.7358416,0.01874638,0.0007935787,0.0003388175,0.002266103,0.001838809,0.07241501],"genre_scores_gemma":[0.7780516,0.002432132,0.1792253,0.003308141,0.001481376,0.0006670804,0.002181829,0.0009002959,0.03175217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01809882,"threshold_uncertainty_score":0.06054664,"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","authors":[{"name":"Christoph Behle","is_ca":false},{"name":"Andreas Krebs","is_ca":false},{"name":"Klaus-Jörn Lange","is_ca":false},{"name":"Pierre McKenzie","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001358387,0.0005161131,0.000610714,0.0008989427,0.001532916,0.003512661,0.001608489,0.0008279257,0.007801946],"category_scores_gemma":[0.01115558,0.0003892664,0.00109487,0.001138749,0.00206701,0.006434044,0.002122052,0.002934656,0.0007861864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003350646,"about_ca_system_score_gemma":0.001322389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003164697,"about_ca_topic_score_gemma":0.003291687,"domain_scores_codex":[0.9967017,0.0004303827,0.0002425323,0.001236764,0.0008495162,0.000539134],"domain_scores_gemma":[0.9860869,0.007754938,0.0009825459,0.002959726,0.001511198,0.000704714],"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.0003580392,0.0000749882,0.003047931,0.0002724418,0.00004413764,0.0001675913,0.0005406431,0.01002027,0.00692173,0.951728,0.004778664,0.0220455],"study_design_scores_gemma":[0.00005550824,0.0001246779,0.002285582,0.00004616943,0.00006838897,0.0005548519,0.0002286397,0.06493055,0.0139968,0.8944061,0.02324948,0.00005319134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3641364,0.0008570411,0.5369712,0.002694703,0.0002423903,0.0002925784,0.003859838,0.002143927,0.08880197],"genre_scores_gemma":[0.9236997,0.0002469709,0.05779378,0.00101946,0.0001877756,0.0002563871,0.002307605,0.0003350755,0.01415311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007801946,"threshold_uncertainty_score":0.0261001,"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","authors":[{"name":"Mika Göös","is_ca":true},{"name":"Thomas Watson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005460844,0.001245338,0.001585721,0.001281647,0.001775519,0.004641608,0.0040636,0.002885198,0.006622441],"category_scores_gemma":[0.04425173,0.0007342148,0.002429689,0.00159882,0.005092558,0.01409753,0.005474818,0.008940887,0.0006198206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005107096,"about_ca_system_score_gemma":0.002169363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001433467,"about_ca_topic_score_gemma":0.0008622524,"domain_scores_codex":[0.9903583,0.003666218,0.0003611025,0.00197821,0.002190852,0.001445316],"domain_scores_gemma":[0.9045138,0.08013954,0.00525339,0.006732161,0.001558727,0.001802433],"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.0003690036,0.0001634725,0.001915689,0.0002438778,0.0001294783,0.0001768569,0.0005356801,0.1086502,0.002478076,0.8696096,0.003180254,0.01254778],"study_design_scores_gemma":[0.00005709489,0.00005493161,0.0004443869,0.00002097093,0.00003856144,0.0001052312,0.00006667282,0.289003,0.001561414,0.7073177,0.00130443,0.00002565397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.34937,0.001090958,0.617035,0.008117673,0.0001544058,0.0003255655,0.001227312,0.0005113894,0.02216768],"genre_scores_gemma":[0.9574519,0.0004794455,0.03568854,0.0006267219,0.0002790533,0.0004217374,0.0004859557,0.0001600111,0.004406597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006622441,"threshold_uncertainty_score":0.03705472,"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","authors":[{"name":"Joshua Buresh-Oppenheim","is_ca":true},{"name":"Rahul Santhanam","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009946477,0.001860227,0.001853706,0.001946789,0.003030879,0.007360287,0.005148389,0.003945739,0.02603082],"category_scores_gemma":[0.05701617,0.001898595,0.004005454,0.00185236,0.01289815,0.02522802,0.01175848,0.01543945,0.003523882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00460321,"about_ca_system_score_gemma":0.00227079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0010391,"about_ca_topic_score_gemma":0.001138693,"domain_scores_codex":[0.9859287,0.004675675,0.000723327,0.003913018,0.003471033,0.00128822],"domain_scores_gemma":[0.9183776,0.05909809,0.002417311,0.01641384,0.00239832,0.001294756],"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.00006866902,0.00007367047,0.0003708192,0.0003253657,0.00005339433,0.0000831722,0.0003686984,0.0143259,0.0009885477,0.9500631,0.006768885,0.02650988],"study_design_scores_gemma":[0.00003134769,0.00004312775,0.0001157587,0.00005961087,0.00001747924,0.00007459756,0.00008593483,0.01897191,0.001016864,0.9610287,0.01853694,0.00001780342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02219856,0.00183867,0.8873796,0.02446215,0.0007877511,0.000377235,0.0004643872,0.00128003,0.06121161],"genre_scores_gemma":[0.4360673,0.003588351,0.4998401,0.01131598,0.003599111,0.001513189,0.00124462,0.001728958,0.04110244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02603082,"threshold_uncertainty_score":0.08708173,"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","authors":[{"name":"Ruiwen Chen","is_ca":true},{"name":"Valentine Kabanets","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004840351,0.002120873,0.002126767,0.002501409,0.002450762,0.00578006,0.004706029,0.002221286,0.01425642],"category_scores_gemma":[0.04063443,0.001407442,0.002452582,0.002511263,0.003910655,0.01601495,0.006729147,0.005331429,0.002356516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003840015,"about_ca_system_score_gemma":0.001633598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001275178,"about_ca_topic_score_gemma":0.001819541,"domain_scores_codex":[0.9917461,0.00202092,0.0005168455,0.002004788,0.002284422,0.001426792],"domain_scores_gemma":[0.9324646,0.05454903,0.002307694,0.006798324,0.002343056,0.001537278],"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.001930912,0.0002835044,0.004463978,0.001274981,0.0002541843,0.0003851156,0.0009181357,0.09122304,0.01188246,0.7814178,0.0176881,0.08827794],"study_design_scores_gemma":[0.0001195589,0.0001901949,0.0005956378,0.0001342657,0.0001485058,0.0002724614,0.00007775619,0.1678836,0.006422527,0.8171341,0.006977436,0.00004397194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1532794,0.005982105,0.7531697,0.008200714,0.0006464322,0.0004448893,0.004007102,0.005061119,0.06920857],"genre_scores_gemma":[0.8467444,0.002147367,0.1256969,0.002596695,0.001104246,0.0008333747,0.004169891,0.001090839,0.01561618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01425642,"threshold_uncertainty_score":0.04769248,"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","authors":[{"name":"Arkadev Chattopadhyay","is_ca":true},{"name":"Michael Saks","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005994937,0.001217932,0.001572884,0.0006625503,0.00141733,0.004203968,0.003740723,0.002243021,0.01061311],"category_scores_gemma":[0.02865702,0.000926772,0.001200669,0.0009286427,0.005316786,0.01677682,0.006212154,0.006796315,0.003015033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001909684,"about_ca_system_score_gemma":0.001685585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004892439,"about_ca_topic_score_gemma":0.0004534908,"domain_scores_codex":[0.9926491,0.002851205,0.0002355142,0.001628051,0.001911835,0.000724336],"domain_scores_gemma":[0.9611627,0.02529354,0.00128479,0.01021324,0.001077603,0.0009681133],"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.0006688033,0.0000973459,0.0006821868,0.0003032019,0.00006374457,0.0002224179,0.0002547479,0.02157772,0.00717668,0.9338615,0.008080771,0.02701087],"study_design_scores_gemma":[0.0001124885,0.0001086642,0.000189049,0.00005980459,0.00003809231,0.0002871797,0.00005448838,0.1650644,0.00549279,0.8143888,0.01417261,0.00003174417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06972101,0.002785136,0.8179048,0.0119124,0.0008692417,0.0002406974,0.0005816683,0.001524097,0.0944609],"genre_scores_gemma":[0.8389192,0.001442864,0.1208778,0.00209847,0.000749398,0.0007164219,0.0003592376,0.0005339377,0.03430273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01061311,"threshold_uncertainty_score":0.0355044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}