{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":40,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":40,"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":"c8748a2891c2","filters":{"venue":"Computational Complexity"}},"results":[{"id":"W2026036943","doi":"10.1007/s00037-004-0182-6","title":"Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds","year":2004,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":384,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Polynomial; Arithmetic circuit complexity; Combinatorics; Nondeterministic algorithm; Discrete mathematics; Bounded function; Identity (music); Degree (music); Upper and lower bounds; Arithmetic; Arbitrary-precision arithmetic","authors":[{"name":"Valentine Kabanets","is_ca":true},{"name":"Russell Impagliazzo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05471051344573013,"gpt":0.2880086850664225,"spread":0.2332981716206923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01121547,0.003161337,0.0040759,0.002569047,0.003537974,0.009421405,0.009121137,0.005902006,0.01670546],"category_scores_gemma":[0.1016763,0.002284436,0.005622747,0.003682809,0.01241993,0.02525092,0.01391639,0.01946206,0.003557791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007584944,"about_ca_system_score_gemma":0.006049356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002344676,"about_ca_topic_score_gemma":0.002917585,"domain_scores_codex":[0.9723041,0.01087232,0.001073435,0.005968978,0.005630726,0.004150483],"domain_scores_gemma":[0.7276943,0.2354011,0.003436155,0.02558283,0.005453487,0.002432057],"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.001336877,0.0006862612,0.00385777,0.0009436024,0.0002680207,0.0003014616,0.0008564426,0.07379137,0.006289975,0.8242863,0.02035287,0.06702907],"study_design_scores_gemma":[0.0001431807,0.00008412386,0.0003647086,0.00006580207,0.0001206004,0.0001192292,0.0001356754,0.1074015,0.008317246,0.8796413,0.003561433,0.00004522394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1022752,0.001231065,0.8325782,0.01568997,0.0009170226,0.0004763764,0.00132583,0.003026344,0.04248005],"genre_scores_gemma":[0.8415281,0.001424141,0.1312929,0.005365496,0.001629935,0.0008100466,0.002250286,0.002182998,0.01351606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01670546,"threshold_uncertainty_score":0.05931377,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100827027","doi":"10.1007/s00037-005-0194-x","title":"Quantum Arthur–Merlin games","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":253,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Quantum pseudo-telepathy; Soundness; Quantum sort; Merlin (protein); Quantum; Discrete mathematics; Mathematics; Quantum computer; Quantum information; Quantum complexity theory; Computer science; Combinatorics; Quantum mechanics; Quantum error correction; Quantum network; Physics","authors":[{"name":"Chris Marriott","is_ca":true},{"name":"John Watrous","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.034762398109001,"gpt":0.2775044403854839,"spread":0.2427420422764829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002328167,0.000654944,0.0008119913,0.00076777,0.001487078,0.002079805,0.001416686,0.001246659,0.004851069],"category_scores_gemma":[0.009664674,0.0003173914,0.0008074716,0.0006096221,0.004267993,0.006175538,0.002676269,0.002800781,0.0004996246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001904145,"about_ca_system_score_gemma":0.00138378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001849271,"about_ca_topic_score_gemma":0.00155711,"domain_scores_codex":[0.9972264,0.001072973,0.00011673,0.0003827764,0.000762128,0.0004389338],"domain_scores_gemma":[0.9927561,0.004903248,0.0004360338,0.0008415641,0.0006305155,0.0004326532],"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.00004494119,0.00002255085,0.0001031663,0.00002363681,0.00000500296,0.00002797565,0.0001432459,0.004767086,0.0006345831,0.9917079,0.0003850231,0.002134906],"study_design_scores_gemma":[0.00006274148,0.00005152907,0.0001447236,0.00002157392,0.00001055832,0.00005514009,0.0001007685,0.08312485,0.00224132,0.9099974,0.004163056,0.00002638421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4717799,0.0008946207,0.4168626,0.004701555,0.0003262967,0.0003402943,0.0002370414,0.0002956737,0.104562],"genre_scores_gemma":[0.9486601,0.0003621734,0.03502319,0.0004655652,0.0001563718,0.0001710465,0.0001085166,0.00004592191,0.01500709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004851069,"threshold_uncertainty_score":0.01622844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2177980858","doi":"10.1007/s00037-008-0250-4","title":"Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems","year":2008,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gas meter prover; Mathematics; Discrete mathematics; XOR gate; Function (biology); Repetition (rhetorical device); Class (philosophy); Automated theorem proving; Computer science; Algorithm; Mathematical proof","authors":[{"name":"Richard Cleve","is_ca":true},{"name":"William Slofstra","is_ca":false},{"name":"Falk Unger","is_ca":false},{"name":"Sarvagya Upadhyay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1007173327167769,"gpt":0.293439077805599,"spread":0.1927217450888221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003502541,0.0007409712,0.001474435,0.001393357,0.00240285,0.00413699,0.002851932,0.001856896,0.01238805],"category_scores_gemma":[0.01534779,0.0008859421,0.0016582,0.001314375,0.004539302,0.01103463,0.004476354,0.004463421,0.001493072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002360082,"about_ca_system_score_gemma":0.002911421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001097744,"about_ca_topic_score_gemma":0.001067659,"domain_scores_codex":[0.996204,0.0009900871,0.0002403931,0.000640652,0.001455333,0.0004695842],"domain_scores_gemma":[0.9855462,0.009563534,0.000758181,0.00257783,0.001141749,0.0004124728],"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.00009860165,0.00002896813,0.0001641562,0.00006823674,0.00002332566,0.00006023881,0.0001153654,0.004728136,0.0008538174,0.9847312,0.001818831,0.007309191],"study_design_scores_gemma":[0.00002472722,0.00001175618,0.00005419712,0.000008053962,0.0000111141,0.00003568841,0.00001230831,0.01786794,0.0007999567,0.9802403,0.0009231972,0.00001076774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1533002,0.001177595,0.7269093,0.006369153,0.0004799441,0.0003366054,0.0007803764,0.001268913,0.1093778],"genre_scores_gemma":[0.8887812,0.0007139691,0.09043293,0.001099489,0.0006885271,0.0003914215,0.000449613,0.00031352,0.01712936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01238805,"threshold_uncertainty_score":0.04144216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014805183","doi":"10.1007/s00037-004-0183-5","title":"Non-Automatizability of Bounded-Depth Frege Proofs","year":2004,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Bounded function; Corollary; Mathematical proof; Mathematics; Argument (complex analysis); Discrete mathematics; Polynomial","authors":[{"name":"Marı́a Luisa Bonet","is_ca":false},{"name":"Carlos Domingo","is_ca":false},{"name":"Ricard Gavald�","is_ca":false},{"name":"Alexis Maciel","is_ca":false},{"name":"Toniann Pitassi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03632872527826129,"gpt":0.2831419397445236,"spread":0.2468132144662623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005965305,0.001508984,0.002285057,0.002459184,0.003633519,0.00735324,0.003962978,0.003602596,0.01261058],"category_scores_gemma":[0.04104402,0.001875098,0.003174111,0.002018057,0.009157188,0.02532889,0.008861161,0.009933736,0.001816275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003761652,"about_ca_system_score_gemma":0.002527051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001054284,"about_ca_topic_score_gemma":0.00112546,"domain_scores_codex":[0.991986,0.002552146,0.0004022627,0.001362708,0.00216884,0.001527888],"domain_scores_gemma":[0.9453525,0.04083469,0.002043488,0.008318434,0.002296516,0.001154423],"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.0002170241,0.00004679512,0.0004132135,0.0001535546,0.00004464613,0.0001233557,0.0004800481,0.003701344,0.001423047,0.9823814,0.001976059,0.009039493],"study_design_scores_gemma":[0.00002464835,0.00001195805,0.00007599202,0.0000179504,0.00002092609,0.00008176744,0.00003126544,0.004498123,0.00111811,0.9927056,0.00139608,0.00001748935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3065191,0.002848675,0.5697082,0.01022806,0.0003989476,0.0002183285,0.0008208258,0.003328905,0.105929],"genre_scores_gemma":[0.9544132,0.00071952,0.03208951,0.0008384617,0.0002555414,0.000141566,0.0003568526,0.0004668565,0.01071853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01261058,"threshold_uncertainty_score":0.04218662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003104918","doi":"10.1007/s00037-001-8195-x","title":"Communication complexity towards lower bounds on circuit depth","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Boolean function; Circuit complexity; Communication complexity; Upper and lower bounds; Omega; Mathematics; Binary logarithm; Bounded function; Function (biology); Discrete mathematics; Boolean circuit; Conjecture; Combinatorics; Characterization (materials science); Electronic circuit; Physics; Mathematical analysis","authors":[{"name":"Jeff Edmonds","is_ca":true},{"name":"Russell Impagliazzo","is_ca":false},{"name":"Steven Rudich","is_ca":false},{"name":"Jiřı́ Sgall","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1246287817561772,"gpt":0.3159649090989075,"spread":0.1913361273427303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008463288,0.005100482,0.004312089,0.006398665,0.003784882,0.01144963,0.01060217,0.006134367,0.02146068],"category_scores_gemma":[0.07139127,0.00309061,0.004055646,0.008619263,0.007417938,0.03470306,0.01263131,0.02305036,0.004190336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01150192,"about_ca_system_score_gemma":0.004520395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004932929,"about_ca_topic_score_gemma":0.006004489,"domain_scores_codex":[0.9867776,0.003082916,0.0003789829,0.002254298,0.004817618,0.002688527],"domain_scores_gemma":[0.8607691,0.1192807,0.002502595,0.009900911,0.004646876,0.0028999],"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.0008967411,0.0004372341,0.001423188,0.0008922399,0.0001181757,0.0001473004,0.0008099985,0.08635771,0.004366122,0.805893,0.03386221,0.06479615],"study_design_scores_gemma":[0.0000688101,0.00005442481,0.0004862315,0.0001694926,0.00009391575,0.00008480496,0.0001041414,0.1513087,0.002208234,0.8360214,0.009360155,0.00003964859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07169758,0.01474687,0.7164593,0.03154431,0.001687115,0.0004046058,0.002319894,0.002563023,0.1585773],"genre_scores_gemma":[0.621447,0.01932631,0.2605947,0.01202016,0.008723834,0.002366564,0.003808189,0.005461532,0.0662518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02146068,"threshold_uncertainty_score":0.0834527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949775108","doi":"10.1007/978-1-4614-1800-9_147","title":"Quantum Computational Complexity","year":2011,"lang":"en","type":"book-chapter","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum; Theoretical computer science; Physics; Quantum mechanics","authors":[{"name":"John Watrous","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08558391872999488,"gpt":0.2735751312171957,"spread":0.1879912124872008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003470237,0.0008927687,0.0007819958,0.001176015,0.001274881,0.002743166,0.0008208535,0.001019296,0.02719183],"category_scores_gemma":[0.001288816,0.000418397,0.0004152592,0.001532897,0.003100519,0.004006459,0.001453248,0.003076091,0.006948459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002997371,"about_ca_system_score_gemma":0.001299172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001020449,"about_ca_topic_score_gemma":0.001429777,"domain_scores_codex":[0.9995232,0.00008372834,0.00001178979,0.00006278533,0.0002806904,0.00003781372],"domain_scores_gemma":[0.9996386,0.0001630601,0.00001331401,0.00008188518,0.00008172782,0.00002140607],"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.000002137281,0.00001018794,0.00001549445,0.00007043979,0.000003509594,0.00000818688,0.00005766299,0.0005164445,0.0001548477,0.9419814,0.0358221,0.02135749],"study_design_scores_gemma":[0.000002133153,0.000004286356,0.00006713947,0.00005890938,0.00000295069,0.0000441626,0.00002314501,0.001178588,0.0002534726,0.7714732,0.2268862,0.000005671695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.001772797,0.01778318,0.03872617,0.004217363,0.001492536,0.00005470565,0.000151067,0.0001588817,0.9356434],"genre_scores_gemma":[0.1041375,0.03849943,0.02983686,0.002579935,0.005302182,0.0003065634,0.0005293656,0.00046633,0.8183419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02719183,"threshold_uncertainty_score":0.09096581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972068724","doi":"10.1007/s00037-007-0220-2","title":"A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness","year":2006,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Washington; National Science Foundation","keywords":"Corollary; Communication complexity; Upper and lower bounds; Mathematics; Product (mathematics); Direct product; Combinatorics; Function (biology); Discrete mathematics; Simple (philosophy); Computer science","authors":[{"name":"Paul Beame","is_ca":false},{"name":"Toniann Pitassi","is_ca":true},{"name":"Nathan Segerlind","is_ca":false},{"name":"Avi Wigderson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0649624365213801,"gpt":0.2936631913235376,"spread":0.2287007548021575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01001425,0.001396263,0.002277565,0.001529192,0.002094837,0.005391201,0.004122844,0.002306054,0.008307949],"category_scores_gemma":[0.05271873,0.001323273,0.003535033,0.001683635,0.01026433,0.01824042,0.01057222,0.01054657,0.001476572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003730021,"about_ca_system_score_gemma":0.002269021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006602061,"about_ca_topic_score_gemma":0.0004291479,"domain_scores_codex":[0.9864928,0.005180871,0.0006247348,0.002863946,0.003401206,0.001436488],"domain_scores_gemma":[0.8648338,0.1092041,0.005007198,0.01613224,0.002984936,0.001837762],"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.0003167179,0.000152921,0.0009514508,0.0002440642,0.00007125251,0.0001602714,0.0004764257,0.03864212,0.003664557,0.9349495,0.002388336,0.01798245],"study_design_scores_gemma":[0.0000835664,0.0001081465,0.0004107888,0.00004891601,0.00005405686,0.0002576585,0.00005747467,0.1780438,0.006660986,0.8109513,0.003274821,0.00004859083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0676839,0.0005575976,0.9037819,0.003096901,0.0001024344,0.0001845959,0.0002218202,0.0003527535,0.02401817],"genre_scores_gemma":[0.8590695,0.0006927602,0.127554,0.0009236808,0.000367737,0.001166553,0.0003534171,0.0004055068,0.009466883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01001425,"threshold_uncertainty_score":0.05296105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066938865","doi":"10.1007/s00037-001-8191-1","title":"Reducing the complexity of reductions","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Gap theorem; Isomorphism (crystallography); Discrete mathematics; Combinatorics; Invertible matrix; Complexity class; Conjecture; Time complexity; Pure mathematics; Fundamental theorem; Crystallography; Crystal structure","authors":[{"name":"M. Agrawal","is_ca":false},{"name":"Eric Allender","is_ca":false},{"name":"Russell Impagliazzo","is_ca":false},{"name":"Toniann Pitassi","is_ca":true},{"name":"Steven Rudich","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1245434252239768,"gpt":0.3089948682333011,"spread":0.1844514430093243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002218084,0.001614568,0.001629615,0.002222244,0.002481771,0.005197422,0.003716747,0.001937248,0.01720229],"category_scores_gemma":[0.01945761,0.0009288671,0.003957354,0.002285834,0.003530158,0.01215857,0.006537159,0.007417475,0.003516053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003225219,"about_ca_system_score_gemma":0.002822421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002716211,"about_ca_topic_score_gemma":0.003269933,"domain_scores_codex":[0.9944121,0.001339851,0.0002145274,0.001021334,0.002152094,0.0008599478],"domain_scores_gemma":[0.9806095,0.01125556,0.0003834968,0.005844169,0.001542878,0.0003643143],"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.0002245971,0.0002014677,0.0005043445,0.0003447249,0.00007714609,0.0001220494,0.0004303384,0.02559464,0.002757973,0.8755632,0.02164966,0.07252988],"study_design_scores_gemma":[0.00003391404,0.00001911319,0.0001854714,0.00003355744,0.0000537513,0.00006949609,0.0001016569,0.04086147,0.002053695,0.9417199,0.0148516,0.00001634449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08263636,0.002169017,0.7420635,0.01144494,0.001112486,0.0003648598,0.0009721929,0.004191151,0.1550456],"genre_scores_gemma":[0.6265251,0.002608907,0.3157018,0.00265504,0.001655431,0.0006102887,0.002418876,0.0028668,0.04495769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01720229,"threshold_uncertainty_score":0.05754739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053658780","doi":"10.1007/s00037-015-0100-0","title":"Mining Circuit Lower Bound Proofs for Meta-Algorithms","year":2015,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Mathematical proof; Algorithm; Truth table; Computer science; Upper and lower bounds; Boolean function; Circuit minimization for Boolean functions; Discrete mathematics; Boolean circuit; Mathematics","authors":[{"name":"Ruiwen Chen","is_ca":true},{"name":"Valentine Kabanets","is_ca":true},{"name":"Antonina Kolokolova","is_ca":true},{"name":"Ronen Shaltiel","is_ca":false},{"name":"David Zuckerman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3098774182245229,"gpt":0.3417031708771991,"spread":0.03182575265267629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004082973,0.001631439,0.001821095,0.004873542,0.00189476,0.007300355,0.005127371,0.002621689,0.01627334],"category_scores_gemma":[0.07500808,0.002008634,0.003172714,0.005114804,0.002072475,0.01441961,0.003141381,0.005861141,0.003319012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00246759,"about_ca_system_score_gemma":0.003766994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008280216,"about_ca_topic_score_gemma":0.002089406,"domain_scores_codex":[0.9922551,0.002297578,0.0005351913,0.001452131,0.002792417,0.0006675972],"domain_scores_gemma":[0.9039083,0.07729338,0.003679257,0.009201215,0.004838835,0.001078986],"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.001052053,0.0008702247,0.01443553,0.003840786,0.0009811501,0.0008102602,0.0006399944,0.09362995,0.007650958,0.4229982,0.07539633,0.3776946],"study_design_scores_gemma":[0.0001498173,0.0001131989,0.001205543,0.0003446323,0.0003509146,0.0004444821,0.0001514696,0.171735,0.005983819,0.8053626,0.01411036,0.00004819939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1245876,0.006352395,0.8197657,0.008852283,0.0007002945,0.0005644888,0.007386322,0.00474646,0.02704436],"genre_scores_gemma":[0.6649897,0.003570683,0.3044359,0.00230627,0.001253469,0.0005324611,0.01264358,0.001747701,0.008520328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01627334,"threshold_uncertainty_score":0.05443978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167854544","doi":"10.1007/s00037-010-0294-0","title":"Interpolation of Shifted-Lacunary Polynomials","year":2010,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Lacunary function; Mathematics; Combinatorics; Interpolation (computer graphics); Polynomial; Logarithm; Degree (music); Modulo; Discrete mathematics; Prime (order theory); Exponent; Representation (politics); Rational function; Pure mathematics; Mathematical analysis; Computer science","authors":[{"name":"Mark Giesbrecht","is_ca":true},{"name":"Daniel S. Roche","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03105294247024828,"gpt":0.2759480848059405,"spread":0.2448951423356922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427384,0.0005489178,0.0007509374,0.001316208,0.0007847355,0.001549991,0.001214992,0.0007139086,0.005380113],"category_scores_gemma":[0.008680712,0.0003012398,0.0006143141,0.001466058,0.002370155,0.003110435,0.002277259,0.002506572,0.0008288559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001629725,"about_ca_system_score_gemma":0.0009201729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009208302,"about_ca_topic_score_gemma":0.0009128503,"domain_scores_codex":[0.998922,0.0003236035,0.00004160358,0.0001580176,0.0003392089,0.0002155799],"domain_scores_gemma":[0.9970039,0.001562667,0.0002714071,0.000591862,0.0003548022,0.0002154335],"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.0001755259,0.00002063296,0.0002307819,0.00003883885,0.000006011163,0.00005260386,0.00009814368,0.01136271,0.00211205,0.969302,0.0006648313,0.01593575],"study_design_scores_gemma":[0.00002473798,0.0000470203,0.0001711609,0.00001972329,0.000007927089,0.00008006901,0.00003829974,0.08461506,0.002984081,0.9088494,0.003142694,0.0000199037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.342189,0.001192644,0.6090126,0.001088309,0.0003181084,0.0000669947,0.0002267162,0.0003308109,0.04557477],"genre_scores_gemma":[0.9148772,0.0006666459,0.07030604,0.0002143274,0.0002693408,0.00004656737,0.0001917773,0.0001110158,0.01331697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005380113,"threshold_uncertainty_score":0.01799828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402456376","doi":"10.1007/s00037-016-0124-0","title":"The Minimum Oracle Circuit Size Problem","year":2016,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Circuit complexity; Complexity class; Mathematics; Kolmogorov complexity; Bounded function; Discrete mathematics; Variety (cybernetics); Function (biology); Computational complexity theory; Combinatorics; Random oracle; PSPACE; Computer science; Time complexity; Algorithm; Electronic circuit; Statistics","authors":[{"name":"Eric Allender","is_ca":false},{"name":"Dhiraj Holden","is_ca":false},{"name":"Valentine Kabanets","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0570498075827662,"gpt":0.2727287421032747,"spread":0.2156789345205085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002749889,0.0008584024,0.001796677,0.001024439,0.001048801,0.00528205,0.005124894,0.003426682,0.01960278],"category_scores_gemma":[0.03049723,0.0006937968,0.0011942,0.002081392,0.002448413,0.01469932,0.002125652,0.005273084,0.001453762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002507465,"about_ca_system_score_gemma":0.002227466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001133397,"about_ca_topic_score_gemma":0.001499149,"domain_scores_codex":[0.9961189,0.001310076,0.0001671492,0.001009434,0.0009653457,0.0004291043],"domain_scores_gemma":[0.954594,0.03740571,0.001121427,0.004582166,0.001165332,0.001131428],"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.001263775,0.0004789932,0.003079665,0.001110913,0.0001497808,0.0002075164,0.000335221,0.08017034,0.00731406,0.7222462,0.03612586,0.1475178],"study_design_scores_gemma":[0.0001969128,0.00008603117,0.00097046,0.00006405274,0.00006229983,0.0002584905,0.00009352009,0.1311458,0.002917104,0.8580447,0.006134528,0.00002613082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2018522,0.004340396,0.6506703,0.04226611,0.0006871349,0.0003869184,0.005882095,0.00227228,0.09164256],"genre_scores_gemma":[0.8427675,0.002149386,0.1305605,0.001899485,0.00124774,0.0004149081,0.003285524,0.0008037398,0.01687134],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01960278,"threshold_uncertainty_score":0.06557781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985813832","doi":"10.1007/s00037-013-0063-y","title":"Modular Composition Modulo Triangular Sets and Applications","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Modulo; Modular design; Elliptic curve; Mathematics; Modular arithmetic; Discrete mathematics; Exponential function; Computer science; Algorithm; Cryptography; Pure mathematics","authors":[{"name":"Adrien Poteaux","is_ca":false},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02752373217021198,"gpt":0.2556594102718284,"spread":0.2281356781016164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009929413,0.0007310222,0.001018022,0.001328469,0.001692834,0.002564864,0.001164519,0.000778267,0.0109357],"category_scores_gemma":[0.004085475,0.0004524405,0.000892488,0.002514106,0.003851738,0.006915264,0.003307956,0.002957574,0.001348545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001642175,"about_ca_system_score_gemma":0.0006758622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006213582,"about_ca_topic_score_gemma":0.000670406,"domain_scores_codex":[0.9991124,0.0002092134,0.00004400744,0.0001769244,0.0003211524,0.0001363861],"domain_scores_gemma":[0.9981,0.001183927,0.0001386892,0.0002623628,0.0001678072,0.0001472072],"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.00001687557,0.00001407933,0.00006169922,0.00002919305,0.00000264295,0.00001934141,0.00008637176,0.001069711,0.0002901759,0.9895795,0.000703202,0.008127328],"study_design_scores_gemma":[0.000006071456,0.000005749314,0.00003691165,0.000006665894,0.000003961403,0.00003625523,0.00002629389,0.003601073,0.0004431073,0.9936339,0.002195807,0.000004153555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.257883,0.004302041,0.4560899,0.004376935,0.0006323747,0.0001484498,0.0001990895,0.0005645512,0.2758036],"genre_scores_gemma":[0.8990526,0.002395337,0.06569698,0.0003660957,0.0009816327,0.0001322943,0.0001932116,0.00013113,0.03105074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0109357,"threshold_uncertainty_score":0.03658354,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004004688","doi":"10.1007/s00037-002-0171-6","title":"Homogenization and the polynomial calculus","year":2002,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Homogenization (climate); Polynomial; Degree (music); Combinatorics; Discrete mathematics; Calculus (dental); Mathematical analysis","authors":[{"name":"Joshua Buresh-Oppenheim","is_ca":true},{"name":"Matthew Clegg","is_ca":false},{"name":"Russell Impagliazzo","is_ca":false},{"name":"Toniann Pitassi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0360283342793621,"gpt":0.2313772949803246,"spread":0.1953489607009625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001443394,0.0004502493,0.001176847,0.001383697,0.001895505,0.003170862,0.001127125,0.001025565,0.007295995],"category_scores_gemma":[0.007440544,0.000407653,0.001134869,0.001975458,0.008639913,0.01004361,0.00324257,0.003466842,0.0007967915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003018705,"about_ca_system_score_gemma":0.00102725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002173276,"about_ca_topic_score_gemma":0.001312288,"domain_scores_codex":[0.9981117,0.0005708877,0.00007090581,0.000415607,0.0005507949,0.0002800349],"domain_scores_gemma":[0.994528,0.003571105,0.0003155227,0.001008273,0.0003856321,0.0001915106],"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.000008048883,0.000003638442,0.00004783406,0.0000131575,0.000002768905,0.000008381783,0.00005468904,0.0009193657,0.00009050893,0.9964886,0.0004478108,0.001915111],"study_design_scores_gemma":[0.000003784167,0.000002424522,0.00006139467,0.000002161399,0.000002705403,0.00001331943,0.00001630217,0.002107521,0.0001150237,0.9956734,0.0019994,0.000002762975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2303429,0.009204662,0.5125679,0.01628688,0.0004337412,0.00009454865,0.0003160902,0.0006069686,0.2301463],"genre_scores_gemma":[0.9587652,0.002004845,0.02148906,0.0005379706,0.0007606291,0.00005478368,0.000158926,0.0001187641,0.01610975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007295995,"threshold_uncertainty_score":0.02440757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2789382863","doi":"10.1007/978-1-4614-1800-9_35","title":"Complex Gene Regulatory Networks – from Structure to Biological Observables: Cell Fate Determination","year":2011,"lang":"en","type":"book-chapter","venue":"Computational Complexity","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Terminology; Glossary; Gene regulatory network; Boolean network; Systems biology; Computer science; Subject (documents); Computational biology; And-inverter graph; Observable; Network dynamics; Biology; Theoretical computer science; Gene; Boolean function; Boolean expression; Mathematics; Genetics; Gene expression; Philosophy; Library science; Linguistics; Algorithm; Physics; Discrete mathematics","authors":[{"name":"Sui Huang","is_ca":true},{"name":"Stuart Kauffman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06614006773660074,"gpt":0.2506371343267032,"spread":0.1844970665901025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003875827,0.0006770936,0.0006163691,0.0006576871,0.0002573384,0.001848435,0.0009774603,0.0007123821,0.002969882],"category_scores_gemma":[0.001120365,0.0005259534,0.0003774801,0.001046954,0.0021207,0.002888254,0.0006771387,0.001523917,0.0009574107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006719861,"about_ca_system_score_gemma":0.0004514518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006002671,"about_ca_topic_score_gemma":0.0008824869,"domain_scores_codex":[0.99984,0.00003079058,0.000006810916,0.00004963274,0.00006335489,0.000009369057],"domain_scores_gemma":[0.9995383,0.0003375784,0.00002546151,0.00004263821,0.00003740826,0.00001856125],"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.00001928507,0.00002827855,0.0003420392,0.0002891601,0.00003524576,0.00007950704,0.0001036154,0.04021235,0.004567563,0.8284814,0.01344728,0.1123942],"study_design_scores_gemma":[0.000002902412,0.000006085111,0.0002453253,0.0000432408,0.000008571069,0.00009125321,0.00001969081,0.05543458,0.00127954,0.9155685,0.02728589,0.00001442502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0117976,0.03857935,0.9016519,0.003495325,0.0004465656,0.00002862811,0.000352176,0.0006060644,0.04304241],"genre_scores_gemma":[0.3989475,0.07679709,0.4726644,0.0009542843,0.001771823,0.0002499632,0.001249995,0.0006019746,0.04676287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002969882,"threshold_uncertainty_score":0.00993526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083633130","doi":"10.1007/s00037-013-0065-9","title":"Parallel Approximation of Min-Max Problems","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"PSPACE; Multiplicative function; Mathematical proof; Mathematics; Class (philosophy); Matrix (chemical analysis); Complexity class; Discrete mathematics; Combinatorics; Computational complexity theory; Time complexity; Computer science; Algorithm","authors":[{"name":"Gus Gutoski","is_ca":true},{"name":"Xiaodi Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03443949735732771,"gpt":0.2506904739364064,"spread":0.2162509765790787,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002027535,0.001005327,0.001727122,0.0008399292,0.0009169399,0.00226581,0.002060635,0.001074624,0.008328662],"category_scores_gemma":[0.008979375,0.0005218402,0.0009302957,0.001714073,0.001212834,0.0034039,0.00207647,0.002602628,0.0009719901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002156675,"about_ca_system_score_gemma":0.002092924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00279736,"about_ca_topic_score_gemma":0.005869413,"domain_scores_codex":[0.998937,0.0003751313,0.00003643427,0.0001498039,0.0003142327,0.0001874229],"domain_scores_gemma":[0.9971315,0.00190565,0.0001169787,0.0005151542,0.0002053771,0.0001253388],"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.0008380205,0.0002980633,0.0009417715,0.0002793584,0.00007822963,0.00006752651,0.0001251823,0.5230002,0.001722911,0.3414464,0.0125509,0.1186514],"study_design_scores_gemma":[0.00004274405,0.00001950357,0.0001146649,0.00001005868,0.00001040105,0.00001827327,0.00001894223,0.7603859,0.0006570206,0.2374949,0.001222973,0.000004709167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09649782,0.001596029,0.8533777,0.003066452,0.0004386521,0.00009503025,0.0003475657,0.001068511,0.04351227],"genre_scores_gemma":[0.709411,0.0009773661,0.2696332,0.000453583,0.0004403919,0.0002377858,0.0006156633,0.0004044286,0.01782653],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008328662,"threshold_uncertainty_score":0.02786219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029495732","doi":"10.1007/s00037-014-0084-1","title":"On the Power of Non-adaptive Learning Graphs","year":2014,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"European Social Fund; Latvijas Universitate; National Science Foundation","keywords":"Certificate; Computer science; Bounded function; Theoretical computer science; Discrete mathematics; Mathematics; Graph; Upper and lower bounds; Combinatorics","authors":[{"name":"Aleksandrs Belovs","is_ca":false},{"name":"Ansis Rosmanis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02480002062436096,"gpt":0.2534712184792243,"spread":0.2286711978548634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003139603,0.0008098211,0.001571318,0.001581759,0.001863301,0.003081758,0.002859887,0.002245045,0.007632268],"category_scores_gemma":[0.02561713,0.0007071701,0.0009683619,0.001397623,0.006748284,0.0114102,0.003543414,0.005039465,0.0005915688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002155182,"about_ca_system_score_gemma":0.00114767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002540683,"about_ca_topic_score_gemma":0.002578476,"domain_scores_codex":[0.9980437,0.000943249,0.00006025091,0.0003032525,0.0004445766,0.0002049998],"domain_scores_gemma":[0.9614785,0.03205055,0.0009988635,0.003464198,0.001178223,0.0008295867],"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.0000439182,0.00002437207,0.0002094016,0.00004800388,0.00001410167,0.00002369998,0.00006448199,0.02522321,0.0002901558,0.9672458,0.001513643,0.005299286],"study_design_scores_gemma":[0.000009117116,0.000006883306,0.00007409933,0.000006340527,0.000003944184,0.00000995588,0.00001086801,0.07294842,0.00008308171,0.926378,0.0004640329,0.000005369438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1982923,0.003486911,0.7043897,0.01790119,0.0005317399,0.0001002562,0.0003817591,0.0006520913,0.07426404],"genre_scores_gemma":[0.9337528,0.001695066,0.05118475,0.001293067,0.000781521,0.0001259107,0.0002069958,0.0002540961,0.01070578],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007632268,"threshold_uncertainty_score":0.02553242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081819660","doi":"10.1007/s00037-013-0078-4","title":"The NOF Multiparty Communication Complexity of Composed Functions","year":2014,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Communication complexity; Computer science; Theoretical computer science; Mathematics; Discrete mathematics","authors":[{"name":"Anil Ada","is_ca":true},{"name":"Arkadev Chattopadhyay","is_ca":false},{"name":"Omar Fawzi","is_ca":false},{"name":"Phuong Minh Binh Nguyen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1529854115902224,"gpt":0.3443344110008818,"spread":0.1913489994106594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00657186,0.001547034,0.003377092,0.002203303,0.003243124,0.007988448,0.00516403,0.005143609,0.01155181],"category_scores_gemma":[0.04321137,0.001205262,0.002361967,0.002605587,0.006339183,0.02783802,0.005743122,0.008893932,0.001229236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005952928,"about_ca_system_score_gemma":0.002921571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001331753,"about_ca_topic_score_gemma":0.000978742,"domain_scores_codex":[0.9910544,0.003487857,0.0003389659,0.001543455,0.002187215,0.00138817],"domain_scores_gemma":[0.9443374,0.04422655,0.001929497,0.005974976,0.001878312,0.001653278],"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.0001400638,0.00005524241,0.0004370115,0.0001099289,0.00003135777,0.00005534639,0.0001649006,0.01515492,0.0003431992,0.9720973,0.003685981,0.007724585],"study_design_scores_gemma":[0.00001353011,0.00001061685,0.0001981854,0.00001895759,0.00001494649,0.00004468756,0.0000281706,0.04425041,0.0002298776,0.9542962,0.0008790946,0.00001536114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2472179,0.004267361,0.5975139,0.02472742,0.0008679447,0.0002278891,0.001877374,0.0005105616,0.1227897],"genre_scores_gemma":[0.9371659,0.001753387,0.03767245,0.001080862,0.001361199,0.0004801563,0.0007140213,0.0003244763,0.01944759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01155181,"threshold_uncertainty_score":0.04319167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981850523","doi":"10.1007/s00037-007-0222-0","title":"The Complexity of Tensor Circuit Evaluation","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Semiring; Mathematics; Discrete mathematics; Combinatorics; Tensor (intrinsic definition); Boolean circuit; Matrix exponential; Kleene algebra; Complexity class; Diagonal; Matrix (chemical analysis); Boolean function; Time complexity; Pure mathematics","authors":[{"name":"Martin Beaudry","is_ca":true},{"name":"Markus Holzer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1695895696351608,"gpt":0.3361128090989626,"spread":0.1665232394638017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003392624,0.0008281608,0.001608646,0.001638449,0.001900178,0.007091776,0.002969587,0.001682542,0.01643548],"category_scores_gemma":[0.02699438,0.0007684445,0.001738481,0.003255414,0.003786463,0.02108409,0.002936399,0.003738632,0.001393145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005652643,"about_ca_system_score_gemma":0.003663456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005548585,"about_ca_topic_score_gemma":0.005062037,"domain_scores_codex":[0.9951599,0.001457686,0.0002462485,0.0006821735,0.001568024,0.0008858502],"domain_scores_gemma":[0.9729865,0.01936179,0.0008817229,0.004218553,0.001842392,0.0007090737],"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.0005535365,0.000115328,0.001718693,0.0003157694,0.00006212349,0.0001143025,0.0003207032,0.05215114,0.002035977,0.8620349,0.01428082,0.06629678],"study_design_scores_gemma":[0.00002531282,0.0000178721,0.0003004623,0.00002090795,0.00003214417,0.00005618428,0.00004717147,0.1120214,0.001022237,0.8845143,0.001923562,0.00001852328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3594026,0.003737801,0.5147291,0.01526036,0.0006802946,0.0002215306,0.00209753,0.002579406,0.1012914],"genre_scores_gemma":[0.9091459,0.001461845,0.07086065,0.0007007872,0.0006365126,0.0001584441,0.001093302,0.0007395907,0.01520292],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01643548,"threshold_uncertainty_score":0.05498213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125063528","doi":"10.1007/s00037-013-0059-7","title":"Is Valiant–Vazirani’s isolation probability improvable?","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Alexander von Humboldt-Stiftung; National Science Foundation","keywords":"Lemma (botany); Combinatorics; Randomized algorithm; Discrete mathematics; Time complexity; Isolation (microbiology); Upper and lower bounds; Mathematics; Satisfiability; Computer science","authors":[{"name":"Holger Dell","is_ca":false},{"name":"Valentine Kabanets","is_ca":true},{"name":"Dieter van Melkebeek","is_ca":false},{"name":"Osamu Watanabe","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07230848095357204,"gpt":0.2775123517321614,"spread":0.2052038707785894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004681861,0.001004604,0.002491687,0.00208374,0.003550203,0.005131048,0.003481098,0.004229434,0.01480981],"category_scores_gemma":[0.0564464,0.0008729072,0.001743159,0.001679937,0.00975119,0.01692701,0.006441516,0.008209192,0.002596853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002238465,"about_ca_system_score_gemma":0.00167189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004806611,"about_ca_topic_score_gemma":0.0003622832,"domain_scores_codex":[0.9961598,0.0013421,0.0001291967,0.0008720864,0.0008041649,0.0006926665],"domain_scores_gemma":[0.9608077,0.02932509,0.001630931,0.00496897,0.001682486,0.00158489],"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.00007628639,0.0000230491,0.0004618319,0.00005753244,0.00001986922,0.0000473276,0.0001432896,0.002202486,0.0002761223,0.9870848,0.00340532,0.006202046],"study_design_scores_gemma":[0.00002492644,0.00001540843,0.0001823904,0.00001752361,0.000008018153,0.00008200618,0.00005084863,0.008391737,0.0003149632,0.9886593,0.002238359,0.00001443007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.216478,0.00433404,0.5260187,0.04104165,0.001740901,0.0001234135,0.0004804728,0.0009569103,0.2088258],"genre_scores_gemma":[0.9540771,0.001178825,0.02527441,0.003138022,0.00111246,0.0001703246,0.0001737438,0.0004125507,0.01446258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01480981,"threshold_uncertainty_score":0.0495438,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028368516","doi":"10.1007/s00037-014-0091-2","title":"The complexity of estimating min-entropy","year":2014,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Logarithm; Entropy (arrow of time); Discrete mathematics; Markov chain; Sample complexity; Combinatorics; Computer science; Statistics; Mathematical analysis","authors":[{"name":"Thomas Watson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04906858431237536,"gpt":0.2960960510111065,"spread":0.2470274666987312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007621982,0.0009980976,0.001949891,0.001887293,0.001071884,0.005165694,0.003102299,0.001736743,0.006570191],"category_scores_gemma":[0.08926117,0.0009806938,0.00127255,0.002197092,0.002888805,0.01263568,0.004038409,0.003813297,0.001045703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002684489,"about_ca_system_score_gemma":0.002244116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003101666,"about_ca_topic_score_gemma":0.002840753,"domain_scores_codex":[0.9910333,0.00453209,0.0005052088,0.001151572,0.002369726,0.0004081664],"domain_scores_gemma":[0.8887076,0.09919789,0.001722332,0.006686874,0.003004859,0.0006804491],"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.0007564866,0.0001372448,0.008013254,0.0007797017,0.0003183878,0.0003193839,0.0003810179,0.3268894,0.003377785,0.4420059,0.01278791,0.2042335],"study_design_scores_gemma":[0.00002237028,0.00003832602,0.001649725,0.00004986975,0.00003199252,0.000153057,0.00006816888,0.5572869,0.001362458,0.4377456,0.001551597,0.00004005619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06140753,0.002812603,0.9210568,0.005048866,0.0003200844,0.00007088943,0.0008401602,0.0006052382,0.007837804],"genre_scores_gemma":[0.6995602,0.002574541,0.2869453,0.0007238262,0.001394403,0.0002787794,0.001903139,0.0006086802,0.006011132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007621982,"threshold_uncertainty_score":0.04030943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006872837","doi":"10.1007/s00037-011-0016-2","title":"A Quantum Characterization Of NP","year":2011,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Complexity class; Class (philosophy); Quantum entanglement; Soundness; Completeness (order theory); Discrete mathematics; Quantum complexity theory; Characterization (materials science); Logarithm; Mathematics; Quantum; Context (archaeology); Combinatorics; Computer science; Quantum algorithm; Time complexity; Quantum mechanics; Physics","authors":[{"name":"Hugue Blier","is_ca":true},{"name":"Alain Tapp","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06338483869152876,"gpt":0.25711491752253,"spread":0.1937300788310012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002311893,0.0008788602,0.001580312,0.003059213,0.003187704,0.005872536,0.002474284,0.00202046,0.008469312],"category_scores_gemma":[0.01341052,0.0006825234,0.001431505,0.003011457,0.00907902,0.01763139,0.004217889,0.008036149,0.0009955899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003392397,"about_ca_system_score_gemma":0.00171446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001514099,"about_ca_topic_score_gemma":0.0007375256,"domain_scores_codex":[0.9968752,0.0008586362,0.0001438828,0.0005853472,0.001105245,0.0004316218],"domain_scores_gemma":[0.9850063,0.01081277,0.0006058896,0.002025878,0.0009996217,0.0005495165],"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.00001515668,0.0000168963,0.0001165703,0.00003337067,0.000004406385,0.00001618771,0.00006498451,0.001510213,0.0002683393,0.9931719,0.001602848,0.003179032],"study_design_scores_gemma":[0.000004361925,0.000007447547,0.0001347878,0.00000930789,0.000003877883,0.00003248348,0.00002388188,0.008589158,0.0001553388,0.9888786,0.00215345,0.000007213387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1335143,0.005086167,0.6049049,0.02875107,0.001064199,0.0002141079,0.001183649,0.0006613032,0.2246202],"genre_scores_gemma":[0.9266421,0.002388396,0.0489129,0.002358405,0.002823264,0.0004316287,0.0006030766,0.0002885112,0.01555174],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008469312,"threshold_uncertainty_score":0.02833265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977227483","doi":"10.1007/s00037-009-0266-4","title":"Space-Efficient Counting in Graphs on Surfaces","year":2009,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Modulo; Discrete mathematics; Algebraic number; Planar graph; Counting problem; Graph","authors":[{"name":"Mark Braverman","is_ca":true},{"name":"Raghav Kulkarni","is_ca":false},{"name":"Sambuddha Roy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0639715632429065,"gpt":0.3344310122917777,"spread":0.2704594490488712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001435859,0.001169062,0.001900406,0.002339172,0.002161964,0.007427234,0.004110294,0.002143322,0.01332179],"category_scores_gemma":[0.01352356,0.0007991407,0.001747829,0.005738014,0.002944289,0.01473243,0.003440933,0.003057179,0.001517432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003017162,"about_ca_system_score_gemma":0.002519918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004914538,"about_ca_topic_score_gemma":0.007939045,"domain_scores_codex":[0.9969277,0.0008209238,0.0001774922,0.000558147,0.0008929147,0.0006228711],"domain_scores_gemma":[0.9876422,0.007705251,0.0007307151,0.002667751,0.0007284503,0.0005257276],"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.0004146089,0.0002935609,0.002466213,0.0004208999,0.00007178383,0.0001777492,0.0006972865,0.09467135,0.006685692,0.7681836,0.01686153,0.1090557],"study_design_scores_gemma":[0.00004511179,0.00002184984,0.0003624262,0.00002102169,0.00003166993,0.00007151155,0.0001480714,0.1622716,0.002365689,0.8320397,0.002600848,0.0000206159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4791901,0.001229836,0.4630827,0.007043381,0.0003890327,0.000235826,0.001586617,0.002829748,0.0444128],"genre_scores_gemma":[0.7979183,0.0008198516,0.180832,0.0005120357,0.0003827451,0.0002427286,0.001972991,0.0009954664,0.01632371],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01332179,"threshold_uncertainty_score":0.0445658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399132114","doi":"10.1007/s00037-018-0166-6","title":"The Landscape of Communication Complexity Classes","year":2018,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Computer science; Communication complexity; Theoretical computer science","authors":[{"name":"Mika Göös","is_ca":false},{"name":"Toniann Pitassi","is_ca":true},{"name":"Thomas Watson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07522345276282445,"gpt":0.3108113691436064,"spread":0.2355879163807819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00294746,0.0008366303,0.00135844,0.003748284,0.001970094,0.009699756,0.002205496,0.003452127,0.0108913],"category_scores_gemma":[0.02225256,0.0007222123,0.0006783469,0.003682224,0.006531751,0.01760477,0.002543366,0.005602721,0.0009472498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003996004,"about_ca_system_score_gemma":0.001163294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002057028,"about_ca_topic_score_gemma":0.001390731,"domain_scores_codex":[0.9973694,0.000885018,0.00008139218,0.0006131273,0.0006957586,0.0003552154],"domain_scores_gemma":[0.9580546,0.03585896,0.001255974,0.001735414,0.001617398,0.001477647],"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.00003186426,0.00002425654,0.0005021567,0.0001114303,0.00001180043,0.0000196555,0.0001219322,0.004121661,0.0001378027,0.9723935,0.005832724,0.01669122],"study_design_scores_gemma":[0.000009318213,0.000006528929,0.0004603773,0.00003943423,0.00000500158,0.00003916468,0.00008730496,0.008329585,0.00006546651,0.9844556,0.006493562,0.000008595105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2067619,0.08123181,0.2377053,0.1990052,0.001014253,0.00009839873,0.002636032,0.00108063,0.2704666],"genre_scores_gemma":[0.9215029,0.02710824,0.02951515,0.004311176,0.004293586,0.0002820675,0.0008363109,0.0003838782,0.01176666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0108913,"threshold_uncertainty_score":0.03643501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3198583770","doi":"10.1007/s00037-023-00241-0","title":"The Power of Natural Properties as Oracles","year":2023,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Combinatorics; Mathematics; Discrete mathematics; Randomized algorithm; Upper and lower bounds; Random oracle; Computer science","authors":[{"name":"Russell Impagliazzo","is_ca":false},{"name":"Valentine Kabanets","is_ca":true},{"name":"Ilya Volkovich","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06434584726470818,"gpt":0.2889815742905184,"spread":0.2246357270258102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007209925,0.0008439432,0.001505929,0.002895162,0.001915369,0.008338857,0.002841308,0.002711775,0.008394429],"category_scores_gemma":[0.05271155,0.001199733,0.001632271,0.002424279,0.01675604,0.04607266,0.005434786,0.006834978,0.0007504166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00187268,"about_ca_system_score_gemma":0.00114527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00110567,"about_ca_topic_score_gemma":0.0009405185,"domain_scores_codex":[0.9924931,0.003899363,0.0004460304,0.001499081,0.001257775,0.0004045945],"domain_scores_gemma":[0.9033436,0.07862949,0.00248947,0.01142464,0.002594127,0.001518524],"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.00002255302,0.00001091604,0.0001975615,0.00004414134,0.00000583682,0.00001590278,0.0001115488,0.00108095,0.00009417079,0.9937261,0.0005865438,0.004103896],"study_design_scores_gemma":[0.000004996146,0.000003288435,0.0000366809,0.000008754872,0.000003111374,0.00001295601,0.00001662301,0.003029673,0.00006966828,0.9959177,0.0008923227,0.000004144736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08402935,0.005743349,0.8165228,0.02126648,0.0005704247,0.00007699044,0.0007606166,0.0009690932,0.0700608],"genre_scores_gemma":[0.8839976,0.002876446,0.1024269,0.001729178,0.001342045,0.0001745897,0.0005583973,0.0003898501,0.006505048],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008394429,"threshold_uncertainty_score":0.03813016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4376504252","doi":"10.1007/s00037-023-00236-x","title":"Schur Polynomials Do Not Have Small Formulas If the Determinant does not","year":2023,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Algebra over a field; Pure mathematics","authors":[{"name":"Prasad Chaugule","is_ca":false},{"name":"Mrinal Kumar","is_ca":false},{"name":"Nutan Limaye","is_ca":false},{"name":"Chandra Kanta Mohapatra","is_ca":false},{"name":"Adrian She","is_ca":true},{"name":"Srikanth Srinivasan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1721085439913326,"gpt":0.366638139190427,"spread":0.1945295951990944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009489057,0.001035438,0.001291531,0.002186187,0.001558981,0.003226437,0.001534937,0.001496407,0.01171251],"category_scores_gemma":[0.01004105,0.000550397,0.0007615983,0.001355617,0.004762293,0.006220635,0.002021319,0.002407988,0.00194228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007335127,"about_ca_system_score_gemma":0.0008029519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005789086,"about_ca_topic_score_gemma":0.0011057,"domain_scores_codex":[0.9986738,0.000204542,0.00006545915,0.000242647,0.0004491144,0.0003645444],"domain_scores_gemma":[0.9920438,0.004427466,0.0006641374,0.00111457,0.0009994464,0.0007506195],"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.0001853003,0.0001091277,0.001392651,0.00009906478,0.00002391552,0.0004342126,0.0003009714,0.000739975,0.006112723,0.9703761,0.003737037,0.0164889],"study_design_scores_gemma":[0.00004454789,0.00005270474,0.0008328216,0.00001344874,0.00001985212,0.0004682753,0.0001327416,0.006038043,0.003965147,0.9861466,0.002250353,0.00003557329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7258271,0.0004479367,0.1300093,0.003177681,0.0006052855,0.0001478209,0.0005317563,0.001475542,0.1377776],"genre_scores_gemma":[0.9797861,0.0001276415,0.008520681,0.0003988549,0.0002069757,0.00008669634,0.0002926713,0.0001939593,0.01038637],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01171251,"threshold_uncertainty_score":0.03918231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2805918291","doi":"10.1007/s00037-022-00231-8","title":"Quantum generalizations of the polynomial hierarchy with applications to QMA(2)","year":2022,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"","keywords":"Hierarchy; Computer science; Quantum; Polynomial; Polynomial hierarchy; Quantum computer; Theoretical computer science; Mathematics; Algorithm; Time complexity; Quantum mechanics; Physics; Mathematical analysis","authors":[{"name":"Sevag Gharibian","is_ca":false},{"name":"Miklós Sántha","is_ca":false},{"name":"Jamie Sikora","is_ca":true},{"name":"Aarthi Sundaram","is_ca":false},{"name":"Justin Yirka","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02945818609854594,"gpt":0.2619659994610362,"spread":0.2325078133624903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559062,0.000745469,0.00137016,0.001974561,0.002022524,0.002197688,0.001803208,0.00156968,0.00881585],"category_scores_gemma":[0.005856581,0.0003888695,0.001516236,0.002215869,0.003801607,0.004840754,0.003097685,0.004083345,0.001079594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00218396,"about_ca_system_score_gemma":0.001378353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002940675,"about_ca_topic_score_gemma":0.003404309,"domain_scores_codex":[0.9991406,0.0003422508,0.00003650549,0.0001237118,0.000218167,0.0001387432],"domain_scores_gemma":[0.9980817,0.0008945495,0.0001498514,0.0004059938,0.0002534211,0.0002145355],"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.000007084135,0.0000126332,0.00004331355,0.00002299942,0.000002556069,0.00001917449,0.00004517792,0.002362902,0.0001690782,0.9937728,0.0009894641,0.00255276],"study_design_scores_gemma":[0.000003961155,0.000003935033,0.00006856757,0.000005899436,0.000001905338,0.00002117921,0.00001450139,0.02067772,0.00005962165,0.9777014,0.001435111,0.000006066318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1487285,0.007512036,0.5726392,0.01392873,0.002258489,0.0001605303,0.0006669521,0.0009460939,0.2531595],"genre_scores_gemma":[0.8377897,0.003429147,0.127363,0.001554613,0.003300852,0.0001783329,0.0002826197,0.0002667898,0.02583497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00881585,"threshold_uncertainty_score":0.02949196,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1205694693","doi":"10.1007/s00037-009-0263-7","title":"The Black-Box Query Complexity of Polynomial Summation","year":2009,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Toronto","funders":"","keywords":"Combinatorics; Degree (music); Mathematics; Polynomial; Field (mathematics); Discrete mathematics; Finite field; Connection (principal bundle); Physics; Pure mathematics","authors":[{"name":"Ali Juma","is_ca":true},{"name":"Valentine Kabanets","is_ca":true},{"name":"Charles Rackoff","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05658031693308873,"gpt":0.2870780996604076,"spread":0.2304977827273189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006393205,0.001235699,0.00296719,0.001491458,0.001856112,0.00737528,0.005025268,0.0027705,0.01676065],"category_scores_gemma":[0.04767619,0.001033184,0.001490863,0.003558799,0.004293544,0.02608372,0.003448192,0.005392257,0.002380308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005536322,"about_ca_system_score_gemma":0.005135563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003506745,"about_ca_topic_score_gemma":0.002116812,"domain_scores_codex":[0.9918938,0.00218267,0.0003010891,0.001591106,0.002405284,0.001626009],"domain_scores_gemma":[0.9495088,0.04061231,0.001340698,0.005653755,0.001680411,0.001203845],"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.002398437,0.0004060589,0.002686074,0.0005989663,0.0001555472,0.0001909282,0.0005367241,0.1323644,0.005437212,0.721662,0.03943738,0.09412638],"study_design_scores_gemma":[0.0001256079,0.00005221307,0.0007066383,0.00004337724,0.00006465852,0.000127566,0.00008581996,0.3005866,0.001591147,0.6938781,0.002703991,0.00003438146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2978095,0.007877261,0.5925566,0.02501841,0.0008761364,0.0002988777,0.003167715,0.002273464,0.07012196],"genre_scores_gemma":[0.9089138,0.002544682,0.06860623,0.001164846,0.001379641,0.0002995814,0.001122823,0.0008520237,0.0151164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01676065,"threshold_uncertainty_score":0.05606997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3040249201","doi":"10.1007/s00037-024-00250-7","title":"KRW Composition Theorems via Lifting","year":2024,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation; Vetenskapsrådet; Natural Sciences and Engineering Research Council of Canada; European Commission; McGill University; Lunds Universitet","keywords":"Composition (language); Mathematics; Discrete mathematics; Combinatorics; Computer science; Linguistics; Philosophy","authors":[{"name":"Susanna F. de Rezende","is_ca":false},{"name":"Or Meir","is_ca":false},{"name":"Jakob Nordstr”öm","is_ca":false},{"name":"Toniann Pitassi","is_ca":false},{"name":"Robert Robere","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03902938089658899,"gpt":0.2868357387671615,"spread":0.2478063578705725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00227207,0.001245285,0.001418028,0.002112263,0.002047003,0.003899774,0.002333105,0.001448744,0.01879532],"category_scores_gemma":[0.007850565,0.001072644,0.00257049,0.002616042,0.00408262,0.02326899,0.007327393,0.009089425,0.00321141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001564627,"about_ca_system_score_gemma":0.001121711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009238,"about_ca_topic_score_gemma":0.0009522158,"domain_scores_codex":[0.9970799,0.0005433992,0.0001534345,0.0007306895,0.001051291,0.0004411662],"domain_scores_gemma":[0.9926846,0.00444292,0.0003101463,0.001556991,0.0006473023,0.0003580208],"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.00002842766,0.0000447111,0.0001342288,0.0000639728,0.000009079098,0.00004274194,0.0001327928,0.001031834,0.000598031,0.9852362,0.002053941,0.01062393],"study_design_scores_gemma":[0.000009473862,0.000005233709,0.00007896047,0.000008752218,0.00000993318,0.00004447092,0.00003286381,0.004382951,0.0006738944,0.992213,0.002533102,0.000007379982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0574233,0.0008497654,0.7993356,0.006014071,0.0004433345,0.0001479769,0.000525837,0.001154581,0.1341056],"genre_scores_gemma":[0.6717375,0.002660869,0.2637619,0.002791526,0.00165789,0.0006957304,0.001382597,0.001609432,0.05370251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01879532,"threshold_uncertainty_score":0.06287658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2928599599","doi":"10.1007/s00037-021-00210-5","title":"Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity","year":2021,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Hierarchy; Randomness; Theoretical computer science; Boolean function; Product term; Boolean expression; Computer science; Mathematics; Communication complexity; Discrete mathematics; Parity function; Standard Boolean model; And-inverter graph; Two-element Boolean algebra; Algebra over a field","authors":[{"name":"Toniann Pitassi","is_ca":true},{"name":"Morgan Shirley","is_ca":true},{"name":"Thomas Watson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04733840846881324,"gpt":0.2910149454861005,"spread":0.2436765370172872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006833719,0.0009420575,0.002019185,0.001986959,0.002521734,0.006963255,0.002878705,0.003341397,0.00821635],"category_scores_gemma":[0.04604268,0.001207081,0.001377351,0.002901999,0.008578528,0.0226169,0.003418934,0.008274473,0.0005101342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006531429,"about_ca_system_score_gemma":0.002902865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003406494,"about_ca_topic_score_gemma":0.003464713,"domain_scores_codex":[0.9930285,0.003210768,0.0003078508,0.001047989,0.001635393,0.0007694666],"domain_scores_gemma":[0.9299933,0.06206466,0.001748557,0.003467804,0.001618371,0.001107386],"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.00003644251,0.00003081439,0.0001876053,0.00004264171,0.000006202536,0.00001509385,0.00009321696,0.00606921,0.0001131379,0.9890189,0.0009293731,0.003457438],"study_design_scores_gemma":[0.00001381304,0.000005528122,0.00008872376,0.000008038562,0.000005827234,0.00001482337,0.0000224206,0.02955823,0.00007562034,0.96964,0.000559744,0.000007176574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2068813,0.009183376,0.6791725,0.03174949,0.0007636501,0.0001491912,0.0007263135,0.0005461914,0.07082798],"genre_scores_gemma":[0.925299,0.002766043,0.0562499,0.001253321,0.001364628,0.0003302136,0.0003151915,0.0001788933,0.01224293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00821635,"threshold_uncertainty_score":0.04738909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3021390709","doi":"10.1007/s00037-020-00204-9","title":"Subquadratic-Time Algorithms for Normal Bases","year":2021,"lang":"en","type":"preprint","venue":"Computational Complexity","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Normal basis; Basis (linear algebra); Combinatorics; Galois group; Abelian group; Invertible matrix; Mathematics; Physics; Discrete mathematics; Pure mathematics; Geometry","authors":[{"name":"Mark Giesbrecht","is_ca":true},{"name":"Armin Jamshidpey","is_ca":true},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07333356916538013,"gpt":0.3050625484096439,"spread":0.2317289792442638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002545608,0.001906631,0.001577296,0.002269617,0.001692978,0.007134674,0.003603091,0.001721865,0.02570898],"category_scores_gemma":[0.01419959,0.0007396198,0.00137131,0.003231394,0.002149063,0.01435671,0.004251333,0.005169123,0.007072151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004431421,"about_ca_system_score_gemma":0.002997326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002082384,"about_ca_topic_score_gemma":0.003169035,"domain_scores_codex":[0.9961821,0.0008795086,0.0001943059,0.0007487817,0.00133338,0.0006618568],"domain_scores_gemma":[0.9922732,0.004208755,0.0003175637,0.002100103,0.0007333946,0.0003669861],"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.001230511,0.0005226818,0.0009958139,0.0004868395,0.00007030947,0.00009369042,0.0003450213,0.02432117,0.005796984,0.6393643,0.03816726,0.2886055],"study_design_scores_gemma":[0.0001512058,0.00005409589,0.000197154,0.00003742884,0.00003795273,0.0001103653,0.00008418182,0.09232478,0.003728786,0.8950502,0.00819584,0.00002804702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06308211,0.002010641,0.8588865,0.004442159,0.0006171459,0.0002450176,0.0009208581,0.00482001,0.06497552],"genre_scores_gemma":[0.5092604,0.001706671,0.436195,0.001550448,0.001158574,0.0005856337,0.002620277,0.002066195,0.04485696],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02570898,"threshold_uncertainty_score":0.08600509,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124396273","doi":"10.1007/s00037-013-0064-x","title":"Lifting lower bounds for tree-like proofs","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Mathematical proof; Proof complexity; Mathematics; Constant (computer programming); Upper and lower bounds; Bounded function; Discrete mathematics; Sequent; Tree (set theory); Sequent calculus; Hierarchy; Combinatorics; Computer science","authors":[{"name":"Alexis Maciel","is_ca":false},{"name":"Phuong Nguyen","is_ca":true},{"name":"Toniann Pitassi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0681648188073247,"gpt":0.2876902495246916,"spread":0.2195254307173669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006001536,0.001770738,0.001702568,0.00441355,0.002350526,0.007252722,0.004725693,0.002324466,0.02783375],"category_scores_gemma":[0.04143658,0.001481061,0.003655128,0.004481421,0.004448295,0.02386352,0.009323793,0.01289965,0.004514235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00457226,"about_ca_system_score_gemma":0.001799093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001473251,"about_ca_topic_score_gemma":0.001859765,"domain_scores_codex":[0.9939907,0.001344069,0.0003253722,0.0009274349,0.002520445,0.0008920624],"domain_scores_gemma":[0.9584967,0.03011034,0.001319428,0.006324428,0.002338981,0.001410227],"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.0001061812,0.00009638404,0.0004034328,0.0002477336,0.00003402048,0.00006324697,0.0002444541,0.005038374,0.0008201043,0.944762,0.009412957,0.03877101],"study_design_scores_gemma":[0.00001310508,0.00001577073,0.000116013,0.00005690182,0.00003215354,0.00003900818,0.00002711297,0.01122536,0.0004751718,0.9831951,0.004791582,0.0000126406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03683399,0.003525712,0.8564434,0.007915995,0.0008633519,0.0001822634,0.001085407,0.001435619,0.09171423],"genre_scores_gemma":[0.5877874,0.007393984,0.3521846,0.004011635,0.003923585,0.0007639491,0.003234597,0.00175587,0.03894445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02783375,"threshold_uncertainty_score":0.09311318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W316638553","doi":"10.1007/s00037-008-0252-2","title":"On the Complexity of Succinct Zero-Sum Games","year":2005,"lang":"en","type":"article","venue":"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":"Game complexity; Mathematics; Multiplicative function; Zero-sum game; Zero (linguistics); Complement (music); Discrete mathematics; Combinatorics; PSPACE; Value (mathematics); Combinatorial game theory; Class (philosophy); P; Complexity class; Time complexity; Computational complexity theory; Repeated game; Game theory; Computer science; Algorithm; Mathematical economics; Average-case complexity","authors":[{"name":"Lance Fortnow","is_ca":false},{"name":"Russell Impagliazzo","is_ca":false},{"name":"Valentine Kabanets","is_ca":true},{"name":"Christopher Umans","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08495536218311425,"gpt":0.2882672099705096,"spread":0.2033118477873953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003456963,0.001786871,0.002167326,0.001260306,0.001649428,0.00596825,0.003728522,0.002591558,0.009539934],"category_scores_gemma":[0.02911139,0.001045872,0.002189285,0.001959818,0.003800129,0.01393161,0.004523263,0.00726642,0.0010387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005323772,"about_ca_system_score_gemma":0.003145332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005030595,"about_ca_topic_score_gemma":0.004368679,"domain_scores_codex":[0.9937938,0.001932643,0.0003378373,0.001178402,0.001646703,0.001110459],"domain_scores_gemma":[0.9600261,0.03452334,0.001406135,0.002197076,0.0009718349,0.0008754296],"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.001584628,0.0005052522,0.004248949,0.000890744,0.0002247995,0.0003567753,0.001117104,0.4611142,0.004512347,0.4696885,0.01131618,0.04444057],"study_design_scores_gemma":[0.0001212979,0.00005352707,0.0003952916,0.00004343659,0.00003871507,0.00008199382,0.0001084066,0.4652396,0.001167379,0.5312537,0.001468075,0.00002854837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4047859,0.002730627,0.5336621,0.01369565,0.0002809273,0.0006244275,0.004534873,0.001712163,0.03797339],"genre_scores_gemma":[0.8902498,0.00166299,0.0930165,0.00115082,0.0003888655,0.0006589658,0.003027024,0.0005065662,0.009338496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009539934,"threshold_uncertainty_score":0.03862679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395991959","doi":"10.1007/s00037-017-0156-0","title":"The Average Sensitivity of Bounded-Depth Formulas","year":2017,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley","keywords":"Bounded function; Omega; Lemma (botany); Mathematics; Boolean function; Combinatorics; Upper and lower bounds; Sensitivity (control systems); Parity (physics); Function (biology); Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","authors":[{"name":"Benjamin Rossman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06812620353572955,"gpt":0.3095869109771868,"spread":0.2414607074414572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006460484,0.001622857,0.003037065,0.003760709,0.001549949,0.004777945,0.004653628,0.003138147,0.007968419],"category_scores_gemma":[0.1092769,0.001964166,0.002156663,0.002885115,0.00435788,0.01676489,0.003975588,0.006748249,0.0006337503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00519254,"about_ca_system_score_gemma":0.002571142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002476377,"about_ca_topic_score_gemma":0.001439349,"domain_scores_codex":[0.9914534,0.002872371,0.000358047,0.001888832,0.002127817,0.001299626],"domain_scores_gemma":[0.8078194,0.1682621,0.005035841,0.01062502,0.00483711,0.00342049],"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.0013379,0.0002469833,0.00898254,0.0009265189,0.0004760705,0.0004659582,0.0007798132,0.3218395,0.009043304,0.5923295,0.009638545,0.05393338],"study_design_scores_gemma":[0.00003758363,0.00007553414,0.00171776,0.00006964652,0.0001688338,0.000258027,0.00007516092,0.3488361,0.003186097,0.6443458,0.001180991,0.00004848207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4975267,0.0058317,0.4430909,0.01070212,0.0004541847,0.0001533762,0.002458524,0.002371529,0.03741089],"genre_scores_gemma":[0.9760335,0.001347199,0.01775411,0.0008824511,0.0004636454,0.00009763964,0.0005340197,0.0004341766,0.002453173],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007968419,"threshold_uncertainty_score":0.03767467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099449032","doi":"10.1007/s00037-011-0032-2","title":"Special Issue In Memory of Misha Alekhnovich. Foreword","year":2011,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Lomonosov Moscow State University","keywords":"Computer science; Mathematics; Discrete mathematics; Theoretical computer science","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Toniann Pitassi","is_ca":true},{"name":"Alexander Razborov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1097443115070456,"gpt":0.3271698014169991,"spread":0.2174254899099535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001440628,0.002010887,0.003111436,0.002483143,0.002035668,0.005192877,0.002208973,0.004197517,0.2873246],"category_scores_gemma":[0.01070081,0.000605183,0.0009397984,0.001613529,0.0008593734,0.005002265,0.002484573,0.004811131,0.2109597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002073633,"about_ca_system_score_gemma":0.001321586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007129096,"about_ca_topic_score_gemma":0.0009189309,"domain_scores_codex":[0.9986093,0.0001654856,0.0001560803,0.0004375043,0.0004716549,0.0001599044],"domain_scores_gemma":[0.9929489,0.001812617,0.0006413704,0.000439282,0.002432799,0.001725017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005537159,0.00001134429,0.00003087719,0.0001566145,0.000006366036,0.00005773433,0.00001143174,0.00001997257,0.0001063942,0.0008512441,0.9879551,0.01073755],"study_design_scores_gemma":[0.00001527789,0.00002370729,0.0002094422,0.0001165067,0.000007834083,0.0001201846,0.00001742384,0.00008274689,0.0001810992,0.001215471,0.9980021,0.000008308576],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0003773428,0.01372551,0.0007665782,0.07923346,0.8545453,0.00009010718,0.0008968026,0.0003585945,0.05000633],"genre_scores_gemma":[0.004283207,0.01140303,0.000367355,0.01948755,0.6189322,0.0001016555,0.001032942,0.0005101566,0.3438818],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.2873246,"threshold_uncertainty_score":0.9611965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4415590863","doi":"10.1007/s00037-025-00278-3","title":"Separation of the Factorization Norm and Randomized Communication Complexity","year":2025,"lang":"en","type":"article","venue":"Computational Complexity","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Vancouver Island University; University of Victoria; Island Health; McGill University","funders":"University of Toronto; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Communication complexity; Upper and lower bounds; Randomized algorithm; Norm (philosophy); Conjecture; Nondeterministic algorithm; Logarithm; Factorization; Boolean function","authors":[{"name":"Tsun-Ming Cheung","is_ca":false},{"name":"Hamed Hatami","is_ca":true},{"name":"Kaave Hosseini","is_ca":false},{"name":"Morgan Shirley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02315802691439623,"gpt":0.2658649143461981,"spread":0.2427068874318019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007403389,0.001548999,0.002468159,0.001668815,0.00139255,0.006614018,0.002993192,0.002749771,0.009334987],"category_scores_gemma":[0.05096173,0.0008284323,0.001267637,0.002348732,0.00570187,0.01401223,0.004226738,0.007324793,0.001220971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004479105,"about_ca_system_score_gemma":0.004463534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001787227,"about_ca_topic_score_gemma":0.001539009,"domain_scores_codex":[0.9882063,0.005392485,0.0004334926,0.001984061,0.002895645,0.001087993],"domain_scores_gemma":[0.930492,0.05497768,0.002017518,0.008018305,0.003276992,0.001217479],"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.0001481583,0.00006469303,0.0001948089,0.0001105519,0.00002049028,0.00002656326,0.00007773669,0.03770529,0.0005364154,0.9419446,0.003524959,0.01564572],"study_design_scores_gemma":[0.00002649142,0.0000272009,0.0001077254,0.00002482997,0.000007548248,0.00002950094,0.00002040991,0.1496587,0.000393547,0.8482093,0.001475348,0.00001937466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02302847,0.001527958,0.9488614,0.005889311,0.0004266198,0.00007413689,0.0004151877,0.0002800163,0.01949692],"genre_scores_gemma":[0.793214,0.002774151,0.1808827,0.00158198,0.00264321,0.0005801575,0.0007493411,0.0004447594,0.01712971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009334987,"threshold_uncertainty_score":0.03915334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W256395497","doi":"10.1007/s00037-007-0231-z","title":"New Results on the Complexity of the Middle Bit of Multiplication","year":2005,"lang":"en","type":"article","venue":"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 Calgary","funders":"","keywords":"Combinatorics; Omega; Integer (computer science); Mathematics; Binary logarithm; Multiplication (music); Upper and lower bounds; Space (punctuation); Discrete mathematics; Arithmetic; Physics; Mathematical analysis; Quantum mechanics","authors":[{"name":"Ingo Wegener","is_ca":false},{"name":"Philipp Woelfel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.161328773084056,"gpt":0.2907668538330652,"spread":0.1294380807490092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001904338,0.001392548,0.001578125,0.0019273,0.001761139,0.004825925,0.002585391,0.001662149,0.01360808],"category_scores_gemma":[0.01691175,0.001011207,0.002245543,0.002129189,0.004071909,0.01090103,0.004140319,0.007212126,0.001723282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003762737,"about_ca_system_score_gemma":0.003228652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002446513,"about_ca_topic_score_gemma":0.002362587,"domain_scores_codex":[0.9946383,0.0008435239,0.000258347,0.001426775,0.00194658,0.00088648],"domain_scores_gemma":[0.9810777,0.01331585,0.001299653,0.002820289,0.0008151971,0.0006713091],"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.001675584,0.0006636998,0.003904675,0.0007903446,0.0001394121,0.0004742066,0.0006324506,0.08156208,0.02156222,0.7732667,0.02239666,0.092932],"study_design_scores_gemma":[0.0001262173,0.0001769598,0.001208862,0.00009369038,0.00006504056,0.0002556051,0.00009236179,0.3337108,0.008110714,0.6471735,0.008908884,0.00007742718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2569301,0.006689666,0.5735205,0.0137514,0.001098783,0.0003541304,0.002111731,0.003691856,0.1418519],"genre_scores_gemma":[0.8110024,0.002706199,0.1582814,0.00239287,0.001663301,0.0005929655,0.00148499,0.001021703,0.02085428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01360808,"threshold_uncertainty_score":0.04552352,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2932807114","doi":"10.1007/s00037-019-00180-9","title":"Correction to: Query-to-Communication Lifting for PNP","year":2019,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Image (mathematics); Theoretical computer science; Information retrieval; Discrete mathematics; Algorithm; Mathematics; Artificial intelligence","authors":[{"name":"Mika Göös","is_ca":false},{"name":"Pritish Kamath","is_ca":false},{"name":"Toniann Pitassi","is_ca":true},{"name":"Thomas Watson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04433134717812037,"gpt":0.3166030198724693,"spread":0.2722716726943489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003144475,0.002080015,0.00244577,0.003100037,0.003624701,0.00384997,0.003548257,0.007653548,0.08594985],"category_scores_gemma":[0.06675006,0.001178501,0.002055824,0.003018434,0.003416733,0.003280417,0.002038997,0.01224165,0.0389398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005033684,"about_ca_system_score_gemma":0.005308908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01336514,"about_ca_topic_score_gemma":0.01190015,"domain_scores_codex":[0.9954056,0.0006301033,0.0006610369,0.0009449738,0.001697233,0.0006611406],"domain_scores_gemma":[0.9708526,0.008206217,0.00102939,0.003038631,0.01555054,0.001322672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005610765,0.000008479086,0.00007711242,0.0001086563,0.00002021243,0.0002438451,0.00003199357,0.0001446411,0.00009515922,0.003832388,0.9881274,0.007253862],"study_design_scores_gemma":[0.00009223451,0.0000352399,0.0008289975,0.0001565532,0.00005408558,0.0009479176,0.00008725937,0.002066365,0.0009904553,0.01528599,0.9793767,0.00007818345],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0003216199,0.0007854453,0.004963817,0.0833851,0.904152,0.00002710545,0.001699982,0.001511845,0.003152998],"genre_scores_gemma":[0.06747274,0.006018298,0.02532179,0.1137472,0.5458857,0.0003007415,0.003935505,0.004462318,0.2328558],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.08594985,"threshold_uncertainty_score":0.2875309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018522462","doi":"10.1007/s00037-007-0225-x","title":"Special Issue “Conference on Computational Complexity 2006” Guest Editors’ Foreword","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computational complexity theory; Theoretical computer science; Algorithm","authors":[{"name":"Venkatesan Guruswami","is_ca":false},{"name":"Valentine Kabanets","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09065063507808688,"gpt":0.3221336832850516,"spread":0.2314830482069647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003773986,0.003354915,0.003767541,0.005936481,0.00345416,0.01039403,0.003141177,0.006158348,0.1118008],"category_scores_gemma":[0.009086918,0.0009145336,0.002296017,0.00345834,0.001085796,0.006033717,0.003354325,0.008743297,0.04897418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003809782,"about_ca_system_score_gemma":0.002743988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001081387,"about_ca_topic_score_gemma":0.002624253,"domain_scores_codex":[0.9971149,0.0004011033,0.0002644646,0.0005253659,0.001281303,0.0004129313],"domain_scores_gemma":[0.9894186,0.001771881,0.0005758337,0.0006177364,0.005320697,0.002295296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003434787,0.00002041825,0.00004364313,0.0001571715,0.000007672828,0.00003132289,0.000007038439,0.00004724337,0.0001086539,0.001517834,0.9879692,0.01005551],"study_design_scores_gemma":[0.0000397988,0.00004761585,0.0005490629,0.0002810947,0.00002927697,0.0001170958,0.0000295684,0.0004300284,0.0002851648,0.003172662,0.9949982,0.00002045379],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0002340621,0.01157959,0.0007740553,0.0357606,0.92936,0.00005332225,0.0002177313,0.0001611016,0.02185962],"genre_scores_gemma":[0.00343443,0.009913513,0.0006633239,0.01006974,0.8575864,0.0001357655,0.0005845721,0.0003586365,0.1172537],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.1118008,"threshold_uncertainty_score":0.3740109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2565232885","doi":"10.1007/s00037-007-0229-6","title":"The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Concatenation (mathematics); Natural number; Intersection (aeronautics); Computer science; Discrete mathematics; Set (abstract data type); Integer (computer science); Prime (order theory); Electronic circuit; Range (aeronautics); Mathematics; Time complexity; Computational complexity theory; Circuit complexity; Combinatorics; Algorithm","authors":[{"name":"Pierre McKenzie","is_ca":true},{"name":"Klaus W. Wagner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09899804868414189,"gpt":0.3208446374831788,"spread":0.2218465887990369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004264606,0.001036588,0.001931927,0.001994393,0.002918572,0.01240244,0.005050345,0.004183616,0.009724434],"category_scores_gemma":[0.04958374,0.001261477,0.002411572,0.003948011,0.006531869,0.02985584,0.003901301,0.00810006,0.0006441029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005823439,"about_ca_system_score_gemma":0.002975903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004259365,"about_ca_topic_score_gemma":0.003997108,"domain_scores_codex":[0.9936686,0.002185607,0.0003400176,0.001303245,0.001732213,0.0007704713],"domain_scores_gemma":[0.9101831,0.08180583,0.00250148,0.00268667,0.001429221,0.001393639],"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.000774178,0.0004750592,0.00624364,0.0008064404,0.0002075729,0.0002111229,0.002045124,0.08516552,0.001412289,0.8407636,0.01268376,0.04921172],"study_design_scores_gemma":[0.00006532836,0.00002259773,0.0007603824,0.00003248842,0.00004458692,0.0001168517,0.0002898247,0.07762633,0.0004985583,0.9188375,0.001678816,0.00002670931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6058076,0.005232973,0.308953,0.03212962,0.0003548075,0.0003761435,0.003479323,0.0007926665,0.04287382],"genre_scores_gemma":[0.9340373,0.002034356,0.04995701,0.0008501622,0.0008531954,0.0003361304,0.002498563,0.0002487169,0.009184564],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01240244,"threshold_uncertainty_score":0.04225218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4210248983","doi":"10.1007/978-1-4614-1800-9_169","title":"Rough Sets: Foundations and Perspectives","year":2011,"lang":"en","type":"book-chapter","venue":"Computational Complexity","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science","authors":[{"name":"James F. Peters","is_ca":true},{"name":"Andrzej Skowron","is_ca":false},{"name":"Jarosław Stepaniuk","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1788587577041315,"gpt":0.2942854099804757,"spread":0.1154266522763442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002591237,0.001141418,0.001860878,0.003286985,0.001347887,0.008901943,0.001471672,0.00211466,0.003674558],"category_scores_gemma":[0.006646195,0.000918699,0.001070131,0.005382737,0.006901449,0.00840621,0.001824721,0.004821654,0.001095244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003429431,"about_ca_system_score_gemma":0.001307392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001614894,"about_ca_topic_score_gemma":0.001368306,"domain_scores_codex":[0.9980944,0.0006927248,0.0001194773,0.0002115185,0.0007933946,0.0000885497],"domain_scores_gemma":[0.9959821,0.003133661,0.0001683574,0.0002811897,0.0003545628,0.00008020252],"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.000003160561,0.000006897153,0.00003438482,0.0001247448,0.000007356293,0.00001372851,0.0001148852,0.001480675,0.00005319731,0.9830268,0.00308439,0.01204977],"study_design_scores_gemma":[0.000001455441,0.000003755652,0.00006374409,0.00006944888,0.000003666068,0.00002887205,0.00005448968,0.001820931,0.0000316224,0.9807696,0.01714592,0.000006522895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"methods","genre_scores_codex":[0.00753155,0.4547262,0.3004921,0.02355247,0.003023709,0.0000665564,0.0004263556,0.0001888256,0.2099921],"genre_scores_gemma":[0.4113622,0.3361793,0.19683,0.003513487,0.01239149,0.0004145353,0.0006014993,0.0001760286,0.03853137],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.008901943,"threshold_uncertainty_score":0.02488238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}