{"meta":{"query_hash":"c8748a2891c2","filters":{"venue":"Computational Complexity"},"cohort_total":40,"direct_labels_cover":0,"predictions_cover":40,"exported":40,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/c8748a2891c2","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computational+Complexity"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05658031693308873,"score_gpt":0.2870780996604076,"score_spread":0.23049778272731886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1205694693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2978095,0.007877261,0.5925566,0.025018407,0.0008761364,0.00029887774,0.0031677152,0.0022734636,0.07012196],"genre_scores_gemma":[0.9089138,0.0025446822,0.06860623,0.001164846,0.0013796415,0.00029958144,0.0011228226,0.0008520237,0.015116401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918938,0.0021826697,0.0003010891,0.0015911057,0.0024052842,0.001626009],"domain_scores_gemma":[0.94950885,0.04061231,0.0013406976,0.0056537553,0.0016804109,0.0012038447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006393205,0.0012356986,0.0029671902,0.0014914577,0.0018561117,0.00737528,0.005025268,0.0027705005,0.016760655],"category_scores_gemma":[0.04767619,0.0010331839,0.0014908633,0.003558799,0.0042935438,0.026083715,0.0034481925,0.005392257,0.0023803082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023984374,0.00040605888,0.0026860735,0.0005989663,0.00015554721,0.00019092824,0.0005367241,0.1323644,0.0054372116,0.721662,0.03943738,0.09412638],"study_design_scores_gemma":[0.00012560791,0.00005221307,0.00070663827,0.000043377237,0.000064658525,0.00012756599,0.00008581996,0.3005866,0.0015911474,0.69387805,0.0027039908,0.000034381465],"about_ca_topic_score_codex":0.0035067445,"about_ca_topic_score_gemma":0.0021168122,"teacher_disagreement_score":0.016760655,"about_ca_system_score_codex":0.0055363225,"about_ca_system_score_gemma":0.0051355627,"threshold_uncertainty_score":0.05606997},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.0649624365213801,"score_gpt":0.2936631913235376,"score_spread":0.22870075480215746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972068724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0676839,0.0005575976,0.9037819,0.0030969006,0.000102434446,0.00018459595,0.0002218202,0.00035275353,0.024018167],"genre_scores_gemma":[0.85906947,0.0006927602,0.12755398,0.00092368084,0.000367737,0.0011665535,0.00035341707,0.0004055068,0.009466883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9864928,0.005180871,0.0006247348,0.0028639457,0.003401206,0.0014364879],"domain_scores_gemma":[0.86483383,0.10920408,0.0050071976,0.01613224,0.0029849357,0.001837762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010014251,0.0013962628,0.0022775647,0.001529192,0.002094837,0.0053912015,0.0041228444,0.0023060543,0.008307949],"category_scores_gemma":[0.052718725,0.0013232726,0.0035350332,0.0016836349,0.010264329,0.018240422,0.010572224,0.010546567,0.0014765721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031671787,0.00015292095,0.0009514508,0.00024406418,0.000071252514,0.00016027139,0.00047642575,0.038642116,0.0036645574,0.93494946,0.0023883362,0.017982455],"study_design_scores_gemma":[0.0000835664,0.00010814645,0.0004107888,0.00004891601,0.000054056858,0.00025765854,0.00005747467,0.17804375,0.0066609858,0.8109513,0.0032748207,0.000048590828],"about_ca_topic_score_codex":0.00066020613,"about_ca_topic_score_gemma":0.00042914794,"teacher_disagreement_score":0.010014251,"about_ca_system_score_codex":0.0037300207,"about_ca_system_score_gemma":0.0022690205,"threshold_uncertainty_score":0.05296105},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Modulo; Discrete mathematics; Algebraic number; Planar graph; Counting problem; Graph","score_opus":0.0639715632429065,"score_gpt":0.3344310122917777,"score_spread":0.2704594490488712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977227483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47919005,0.0012298357,0.4630827,0.007043381,0.0003890327,0.00023582598,0.0015866171,0.0028297484,0.044412795],"genre_scores_gemma":[0.7979183,0.00081985164,0.18083204,0.00051203574,0.00038274511,0.0002427286,0.0019729906,0.0009954664,0.016323712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969277,0.00082092383,0.0001774922,0.00055814703,0.00089291466,0.0006228711],"domain_scores_gemma":[0.98764217,0.007705251,0.00073071505,0.0026677512,0.0007284503,0.0005257276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014358589,0.0011690619,0.0019004061,0.0023391717,0.002161964,0.0074272337,0.0041102944,0.0021433216,0.013321787],"category_scores_gemma":[0.013523559,0.0007991407,0.0017478291,0.005738014,0.0029442892,0.0147324335,0.0034409333,0.0030571788,0.001517432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041460892,0.00029356088,0.0024662132,0.00042089992,0.00007178383,0.00017774921,0.0006972865,0.094671346,0.006685692,0.76818365,0.016861526,0.10905566],"study_design_scores_gemma":[0.000045111792,0.000021849844,0.00036242622,0.00002102169,0.00003166993,0.00007151155,0.00014807141,0.16227165,0.0023656893,0.83203965,0.0026008477,0.0000206159],"about_ca_topic_score_codex":0.004914538,"about_ca_topic_score_gemma":0.007939045,"teacher_disagreement_score":0.013321787,"about_ca_system_score_codex":0.0030171617,"about_ca_system_score_gemma":0.0025199184,"threshold_uncertainty_score":0.044565797},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16958956963516084,"score_gpt":0.3361128090989626,"score_spread":0.16652323946380174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981850523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35940257,0.0037378008,0.5147291,0.015260356,0.0006802946,0.00022153056,0.0020975298,0.0025794061,0.10129139],"genre_scores_gemma":[0.9091459,0.0014618452,0.07086065,0.00070078723,0.00063651265,0.00015844415,0.0010933022,0.0007395907,0.015202916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951599,0.0014576856,0.0002462485,0.0006821735,0.0015680237,0.0008858502],"domain_scores_gemma":[0.9729865,0.019361794,0.0008817229,0.004218553,0.0018423924,0.0007090737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033926244,0.00082816085,0.0016086464,0.0016384488,0.0019001785,0.0070917765,0.0029695865,0.0016825421,0.016435483],"category_scores_gemma":[0.026994381,0.0007684445,0.0017384811,0.0032554143,0.0037864628,0.021084094,0.002936399,0.0037386317,0.0013931447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055353646,0.00011532801,0.0017186931,0.00031576937,0.00006212349,0.00011430248,0.00032070317,0.052151144,0.0020359769,0.86203486,0.014280823,0.06629678],"study_design_scores_gemma":[0.000025312816,0.000017872098,0.0003004623,0.000020907954,0.00003214417,0.000056184275,0.000047171474,0.1120214,0.0010222374,0.8845143,0.0019235619,0.00001852328],"about_ca_topic_score_codex":0.005548585,"about_ca_topic_score_gemma":0.0050620367,"teacher_disagreement_score":0.016435483,"about_ca_system_score_codex":0.0056526433,"about_ca_system_score_gemma":0.0036634563,"threshold_uncertainty_score":0.054982126},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027523732170211975,"score_gpt":0.25565941027182837,"score_spread":0.2281356781016164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985813832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.257883,0.0043020407,0.4560899,0.004376935,0.00063237466,0.00014844982,0.00019908953,0.00056455116,0.27580363],"genre_scores_gemma":[0.8990526,0.0023953374,0.065696985,0.00036609572,0.0009816327,0.00013229427,0.00019321163,0.00013112999,0.03105074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991124,0.00020921341,0.000044007436,0.00017692443,0.00032115245,0.0001363861],"domain_scores_gemma":[0.9981,0.0011839268,0.00013868917,0.00026236282,0.00016780719,0.00014720716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009929413,0.0007310222,0.0010180217,0.0013284689,0.0016928344,0.002564864,0.0011645189,0.000778267,0.010935703],"category_scores_gemma":[0.004085475,0.0004524405,0.000892488,0.002514106,0.0038517378,0.0069152643,0.0033079563,0.0029575736,0.0013485446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016875574,0.000014079325,0.00006169922,0.00002919305,0.0000026429504,0.000019341413,0.00008637176,0.0010697107,0.00029017587,0.9895795,0.000703202,0.008127328],"study_design_scores_gemma":[0.0000060714556,0.0000057493144,0.00003691165,0.0000066658945,0.0000039614033,0.000036255235,0.000026293894,0.0036010733,0.0004431073,0.99363387,0.002195807,0.000004153555],"about_ca_topic_score_codex":0.00062135817,"about_ca_topic_score_gemma":0.00067040604,"teacher_disagreement_score":0.010935703,"about_ca_system_score_codex":0.0016421754,"about_ca_system_score_gemma":0.0006758622,"threshold_uncertainty_score":0.036583543},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1246287817561772,"score_gpt":0.31596490909890745,"score_spread":0.19133612734273026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003104918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07169758,0.014746865,0.7164593,0.03154431,0.0016871154,0.00040460585,0.0023198945,0.002563023,0.15857732],"genre_scores_gemma":[0.62144697,0.019326312,0.26059467,0.012020161,0.008723834,0.0023665638,0.003808189,0.005461532,0.0662518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867776,0.0030829164,0.00037898286,0.0022542982,0.0048176176,0.0026885266],"domain_scores_gemma":[0.8607691,0.11928068,0.002502595,0.009900911,0.004646876,0.0028998996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008463288,0.0051004817,0.004312089,0.0063986653,0.0037848821,0.011449633,0.01060217,0.006134367,0.021460677],"category_scores_gemma":[0.07139127,0.00309061,0.004055646,0.008619263,0.007417938,0.03470306,0.0126313055,0.02305036,0.0041903364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089674105,0.00043723406,0.0014231884,0.0008922399,0.00011817569,0.00014730041,0.00080999854,0.08635771,0.0043661217,0.805893,0.033862207,0.06479615],"study_design_scores_gemma":[0.0000688101,0.000054424807,0.00048623147,0.00016949262,0.000093915754,0.00008480496,0.00010414141,0.15130875,0.0022082343,0.8360214,0.009360155,0.00003964859],"about_ca_topic_score_codex":0.0049329293,"about_ca_topic_score_gemma":0.006004489,"teacher_disagreement_score":0.021460677,"about_ca_system_score_codex":0.011501924,"about_ca_system_score_gemma":0.0045203953,"threshold_uncertainty_score":0.0834527},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Homogenization (climate); Polynomial; Degree (music); Combinatorics; Discrete mathematics; Calculus (dental); Mathematical analysis","score_opus":0.0360283342793621,"score_gpt":0.2313772949803246,"score_spread":0.19534896070096253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004004688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23034294,0.009204662,0.51256794,0.016286882,0.00043374122,0.000094548646,0.00031609015,0.0006069686,0.23014632],"genre_scores_gemma":[0.9587652,0.0020048453,0.021489056,0.00053797057,0.00076062913,0.000054783683,0.000158926,0.00011876405,0.016109746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981117,0.0005708877,0.000070905815,0.000415607,0.00055079494,0.0002800349],"domain_scores_gemma":[0.994528,0.003571105,0.0003155227,0.0010082725,0.00038563207,0.00019151057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014433943,0.00045024927,0.0011768473,0.0013836971,0.001895505,0.0031708616,0.0011271251,0.0010255651,0.007295995],"category_scores_gemma":[0.007440544,0.00040765296,0.0011348694,0.001975458,0.008639913,0.010043613,0.0032425695,0.0034668418,0.00079679146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008048883,0.000003638442,0.000047834063,0.000013157504,0.0000027689048,0.000008381783,0.000054689044,0.0009193657,0.00009050893,0.9964886,0.00044781077,0.0019151106],"study_design_scores_gemma":[0.0000037841671,0.000002424522,0.00006139467,0.0000021613994,0.0000027054027,0.000013319431,0.000016302165,0.0021075206,0.0001150237,0.99567336,0.0019993996,0.0000027629746],"about_ca_topic_score_codex":0.002173276,"about_ca_topic_score_gemma":0.0013122876,"teacher_disagreement_score":0.007295995,"about_ca_system_score_codex":0.0030187054,"about_ca_system_score_gemma":0.0010272498,"threshold_uncertainty_score":0.024407566},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06338483869152876,"score_gpt":0.25711491752253,"score_spread":0.19373007883100124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006872837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13351434,0.005086167,0.60490495,0.028751068,0.001064199,0.00021410793,0.001183649,0.00066130323,0.2246202],"genre_scores_gemma":[0.92664206,0.0023883963,0.048912898,0.002358405,0.0028232643,0.00043162872,0.0006030766,0.00028851116,0.015551739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687517,0.00085863617,0.00014388277,0.00058534724,0.0011052447,0.00043162177],"domain_scores_gemma":[0.9850063,0.0108127715,0.0006058896,0.0020258783,0.0009996217,0.00054951647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023118926,0.0008788602,0.0015803117,0.0030592126,0.0031877037,0.0058725355,0.0024742845,0.0020204603,0.0084693115],"category_scores_gemma":[0.013410516,0.0006825234,0.0014315048,0.003011457,0.0090790205,0.017631385,0.0042178887,0.008036149,0.0009955899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001515668,0.000016896296,0.00011657033,0.000033370674,0.0000044063845,0.000016187712,0.00006498451,0.0015102135,0.0002683393,0.99317193,0.0016028483,0.0031790317],"study_design_scores_gemma":[0.0000043619248,0.000007447547,0.00013478778,0.00000930789,0.0000038778826,0.000032483484,0.000023881885,0.008589158,0.00015533876,0.9888786,0.0021534497,0.0000072133867],"about_ca_topic_score_codex":0.0015140986,"about_ca_topic_score_gemma":0.0007375256,"teacher_disagreement_score":0.0084693115,"about_ca_system_score_codex":0.0033923972,"about_ca_system_score_gemma":0.0017144596,"threshold_uncertainty_score":0.02833265},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computational complexity theory; Theoretical computer science; Algorithm","score_opus":0.09065063507808688,"score_gpt":0.3221336832850516,"score_spread":0.23148304820696472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018522462","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023406211,0.011579585,0.00077405525,0.0357606,0.92936003,0.00005332225,0.00021773129,0.00016110158,0.021859618],"genre_scores_gemma":[0.00343443,0.0099135125,0.0006633239,0.010069736,0.8575864,0.00013576551,0.0005845721,0.00035863652,0.11725372],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971149,0.00040110326,0.0002644646,0.0005253659,0.0012813034,0.0004129313],"domain_scores_gemma":[0.98941857,0.0017718811,0.00057583366,0.00061773637,0.005320697,0.002295296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037739861,0.0033549152,0.0037675411,0.005936481,0.0034541604,0.0103940265,0.0031411767,0.006158348,0.1118008],"category_scores_gemma":[0.009086918,0.00091453356,0.002296017,0.00345834,0.0010857964,0.0060337167,0.0033543252,0.008743297,0.048974175],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034347868,0.000020418247,0.000043643126,0.00015717154,0.000007672828,0.000031322892,0.000007038439,0.00004724337,0.00010865389,0.0015178337,0.98796916,0.010055515],"study_design_scores_gemma":[0.000039798797,0.00004761585,0.0005490629,0.00028109472,0.000029276975,0.00011709583,0.000029568397,0.00043002836,0.00028516483,0.0031726619,0.9949982,0.00002045379],"about_ca_topic_score_codex":0.0010813866,"about_ca_topic_score_gemma":0.0026242526,"teacher_disagreement_score":0.1118008,"about_ca_system_score_codex":0.003809782,"about_ca_system_score_gemma":0.0027439883,"threshold_uncertainty_score":0.37401092},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05471051344573013,"score_gpt":0.28800868506642247,"score_spread":0.23329817162069233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026036943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10227519,0.0012310651,0.8325782,0.015689967,0.00091702264,0.00047637642,0.0013258295,0.0030263439,0.042480048],"genre_scores_gemma":[0.8415281,0.0014241411,0.1312929,0.0053654956,0.0016299348,0.0008100466,0.0022502863,0.0021829978,0.013516056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9723041,0.0108723175,0.0010734347,0.0059689777,0.005630726,0.0041504833],"domain_scores_gemma":[0.72769433,0.2354011,0.0034361552,0.025582826,0.0054534874,0.0024320567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011215466,0.003161337,0.0040759,0.0025690468,0.0035379736,0.009421405,0.009121137,0.0059020063,0.016705455],"category_scores_gemma":[0.10167631,0.002284436,0.0056227474,0.0036828087,0.01241993,0.025250921,0.013916389,0.019462056,0.0035577915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001336877,0.00068626116,0.0038577698,0.00094360235,0.00026802067,0.00030146158,0.00085644255,0.07379137,0.006289975,0.8242863,0.020352867,0.06702907],"study_design_scores_gemma":[0.00014318073,0.00008412386,0.00036470857,0.00006580207,0.000120600394,0.00011922923,0.0001356754,0.10740147,0.008317246,0.8796413,0.0035614327,0.00004522394],"about_ca_topic_score_codex":0.0023446756,"about_ca_topic_score_gemma":0.0029175847,"teacher_disagreement_score":0.016705455,"about_ca_system_score_codex":0.007584944,"about_ca_system_score_gemma":0.0060493564,"threshold_uncertainty_score":0.059313774},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04906858431237536,"score_gpt":0.29609605101110653,"score_spread":0.24702746669873116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028368516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061407525,0.0028126026,0.9210568,0.005048866,0.00032008442,0.00007088943,0.00084016024,0.0006052382,0.007837804],"genre_scores_gemma":[0.6995602,0.0025745407,0.28694528,0.00072382623,0.0013944034,0.00027877936,0.0019031392,0.0006086802,0.0060111317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99103326,0.0045320904,0.0005052088,0.0011515722,0.0023697263,0.00040816638],"domain_scores_gemma":[0.88870764,0.09919789,0.0017223321,0.006686874,0.003004859,0.0006804491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076219817,0.0009980976,0.0019498912,0.0018872926,0.001071884,0.0051656943,0.0031022986,0.0017367433,0.006570191],"category_scores_gemma":[0.089261174,0.0009806938,0.00127255,0.0021970922,0.002888805,0.012635677,0.0040384093,0.0038132966,0.0010457026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075648655,0.00013724477,0.008013254,0.00077970175,0.00031838779,0.0003193839,0.00038101795,0.3268894,0.003377785,0.44200593,0.012787915,0.20423351],"study_design_scores_gemma":[0.000022370277,0.00003832602,0.0016497248,0.00004986975,0.00003199252,0.00015305704,0.000068168876,0.55728686,0.0013624579,0.43774557,0.001551597,0.00004005619],"about_ca_topic_score_codex":0.003101666,"about_ca_topic_score_gemma":0.0028407532,"teacher_disagreement_score":0.0076219817,"about_ca_system_score_codex":0.002684489,"about_ca_system_score_gemma":0.0022441158,"threshold_uncertainty_score":0.04030943},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024800020624360965,"score_gpt":0.2534712184792243,"score_spread":0.22867119785486337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029495732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1982923,0.0034869113,0.7043897,0.017901191,0.0005317399,0.000100256206,0.0003817591,0.0006520913,0.07426404],"genre_scores_gemma":[0.9337528,0.0016950658,0.051184747,0.0012930669,0.000781521,0.00012591068,0.00020699578,0.0002540961,0.010705782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804366,0.000943249,0.000060250914,0.00030325245,0.00044457664,0.00020499977],"domain_scores_gemma":[0.96147853,0.032050546,0.0009988635,0.0034641984,0.0011782228,0.0008295867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031396034,0.0008098211,0.0015713179,0.0015817591,0.0018633008,0.0030817578,0.0028598867,0.002245045,0.0076322677],"category_scores_gemma":[0.025617134,0.0007071701,0.0009683619,0.001397623,0.0067482837,0.011410198,0.0035434142,0.0050394647,0.0005915688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043918204,0.000024372073,0.0002094016,0.000048003883,0.000014101667,0.00002369998,0.00006448199,0.025223209,0.00029015585,0.96724576,0.0015136428,0.0052992855],"study_design_scores_gemma":[0.000009117116,0.000006883306,0.000074099335,0.0000063405273,0.000003944184,0.00000995588,0.000010868006,0.07294842,0.00008308171,0.92637795,0.00046403287,0.0000053694375],"about_ca_topic_score_codex":0.0025406834,"about_ca_topic_score_gemma":0.0025784762,"teacher_disagreement_score":0.0076322677,"about_ca_system_score_codex":0.0021551822,"about_ca_system_score_gemma":0.0011476704,"threshold_uncertainty_score":0.025532424},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.30987741822452286,"score_gpt":0.34170317087719915,"score_spread":0.03182575265267629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053658780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12458758,0.0063523953,0.81976575,0.008852283,0.0007002945,0.0005644888,0.0073863217,0.00474646,0.02704436],"genre_scores_gemma":[0.66498965,0.0035706828,0.30443588,0.0023062704,0.0012534694,0.0005324611,0.012643577,0.001747701,0.008520328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922551,0.0022975777,0.00053519127,0.001452131,0.002792417,0.0006675972],"domain_scores_gemma":[0.9039083,0.07729338,0.0036792574,0.009201215,0.0048388345,0.0010789855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004082973,0.0016314386,0.0018210948,0.004873542,0.0018947598,0.0073003545,0.0051273713,0.0026216889,0.016273338],"category_scores_gemma":[0.07500808,0.0020086344,0.0031727143,0.005114804,0.002072475,0.014419614,0.0031413813,0.0058611413,0.0033190125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010520534,0.00087022467,0.014435532,0.0038407864,0.0009811501,0.00081026024,0.0006399944,0.09362995,0.007650958,0.42299822,0.07539633,0.3776946],"study_design_scores_gemma":[0.00014981734,0.00011319887,0.0012055434,0.00034463228,0.00035091463,0.00044448205,0.0001514696,0.17173496,0.005983819,0.80536264,0.0141103575,0.000048199392],"about_ca_topic_score_codex":0.00082802156,"about_ca_topic_score_gemma":0.0020894064,"teacher_disagreement_score":0.016273338,"about_ca_system_score_codex":0.0024675897,"about_ca_system_score_gemma":0.0037669935,"threshold_uncertainty_score":0.054439783},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12454342522397675,"score_gpt":0.3089948682333011,"score_spread":0.1844514430093243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066938865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08263636,0.0021690167,0.74206346,0.01144494,0.0011124864,0.0003648598,0.00097219285,0.004191151,0.15504557],"genre_scores_gemma":[0.6265251,0.002608907,0.3157018,0.0026550402,0.0016554305,0.0006102887,0.0024188762,0.0028667997,0.04495769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944121,0.0013398513,0.00021452745,0.0010213344,0.0021520942,0.00085994776],"domain_scores_gemma":[0.9806095,0.011255561,0.00038349684,0.005844169,0.0015428776,0.0003643143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002218084,0.0016145678,0.0016296151,0.0022222437,0.0024817714,0.0051974216,0.0037167473,0.0019372478,0.017202286],"category_scores_gemma":[0.019457612,0.0009288671,0.003957354,0.0022858342,0.0035301584,0.012158574,0.006537159,0.007417475,0.003516053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002245971,0.00020146774,0.00050434447,0.00034472492,0.00007714609,0.000122049394,0.0004303384,0.02559464,0.002757973,0.8755632,0.021649664,0.07252988],"study_design_scores_gemma":[0.00003391404,0.000019113195,0.00018547144,0.000033557437,0.0000537513,0.00006949609,0.00010165691,0.04086147,0.0020536946,0.94171995,0.014851602,0.000016344486],"about_ca_topic_score_codex":0.002716211,"about_ca_topic_score_gemma":0.0032699334,"teacher_disagreement_score":0.017202286,"about_ca_system_score_codex":0.0032252194,"about_ca_system_score_gemma":0.002822421,"threshold_uncertainty_score":0.05754739},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Communication complexity; Computer science; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.15298541159022244,"score_gpt":0.3443344110008818,"score_spread":0.19134899941065936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081819660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2472179,0.0042673605,0.5975139,0.02472742,0.0008679447,0.00022788912,0.0018773745,0.0005105616,0.12278973],"genre_scores_gemma":[0.93716586,0.0017533866,0.037672453,0.0010808619,0.0013611988,0.00048015628,0.00071402127,0.00032447634,0.019447595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99105436,0.0034878573,0.00033896588,0.001543455,0.0021872148,0.0013881704],"domain_scores_gemma":[0.9443374,0.04422655,0.0019294972,0.005974976,0.001878312,0.001653278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00657186,0.0015470335,0.0033770923,0.002203303,0.0032431243,0.007988448,0.0051640305,0.005143609,0.01155181],"category_scores_gemma":[0.04321137,0.0012052619,0.0023619672,0.002605587,0.006339183,0.027838022,0.005743122,0.008893932,0.0012292356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014006384,0.000055242406,0.00043701153,0.00010992888,0.000031357766,0.000055346394,0.00016490056,0.015154916,0.00034319918,0.97209734,0.0036859808,0.0077245855],"study_design_scores_gemma":[0.00001353011,0.000010616847,0.00019818536,0.000018957593,0.000014946488,0.000044687557,0.000028170598,0.04425041,0.00022987755,0.9542962,0.00087909464,0.000015361142],"about_ca_topic_score_codex":0.0013317531,"about_ca_topic_score_gemma":0.000978742,"teacher_disagreement_score":0.01155181,"about_ca_system_score_codex":0.005952928,"about_ca_system_score_gemma":0.002921571,"threshold_uncertainty_score":0.04319167},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03443949735732771,"score_gpt":0.25069047393640637,"score_spread":0.21625097657907866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083633130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09649782,0.001596029,0.8533777,0.0030664515,0.00043865215,0.00009503025,0.00034756574,0.0010685113,0.043512274],"genre_scores_gemma":[0.709411,0.0009773661,0.26963317,0.00045358302,0.0004403919,0.00023778577,0.0006156633,0.00040442857,0.01782653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893695,0.0003751313,0.000036434274,0.00014980393,0.00031423275,0.00018742286],"domain_scores_gemma":[0.99713147,0.0019056501,0.00011697872,0.0005151542,0.00020537709,0.00012533885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020275349,0.0010053272,0.0017271225,0.0008399292,0.0009169399,0.0022658103,0.0020606352,0.0010746241,0.008328662],"category_scores_gemma":[0.0089793755,0.0005218402,0.00093029573,0.0017140729,0.0012128339,0.0034039,0.00207647,0.0026026282,0.00097199006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008380205,0.0002980633,0.00094177155,0.0002793584,0.00007822963,0.00006752651,0.00012518225,0.52300024,0.0017229108,0.3414464,0.0125509,0.11865138],"study_design_scores_gemma":[0.000042744054,0.000019503568,0.0001146649,0.000010058677,0.000010401049,0.000018273275,0.000018942232,0.76038593,0.0006570206,0.23749486,0.0012229728,0.000004709167],"about_ca_topic_score_codex":0.0027973598,"about_ca_topic_score_gemma":0.0058694133,"teacher_disagreement_score":0.008328662,"about_ca_system_score_codex":0.0021566746,"about_ca_system_score_gemma":0.002092924,"threshold_uncertainty_score":0.027862191},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Lomonosov Moscow State University","keywords":"Computer science; Mathematics; Discrete mathematics; Theoretical computer science","score_opus":0.10974431150704561,"score_gpt":0.3271698014169991,"score_spread":0.21742548990995347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099449032","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003773428,0.0137255145,0.00076657825,0.07923346,0.8545453,0.00009010718,0.0008968026,0.0003585945,0.050006326],"genre_scores_gemma":[0.0042832065,0.011403027,0.00036735498,0.01948755,0.61893225,0.00010165545,0.0010329416,0.0005101566,0.34388182],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986093,0.00016548562,0.0001560803,0.0004375043,0.0004716549,0.00015990436],"domain_scores_gemma":[0.9929489,0.0018126174,0.0006413704,0.00043928198,0.0024327987,0.0017250173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001440628,0.0020108875,0.0031114358,0.0024831435,0.0020356684,0.0051928773,0.002208973,0.0041975174,0.28732458],"category_scores_gemma":[0.010700812,0.000605183,0.0009397984,0.0016135289,0.00085937337,0.0050022653,0.002484573,0.0048111314,0.21095972],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005537159,0.000011344293,0.000030877185,0.0001566145,0.000006366036,0.000057734327,0.000011431741,0.000019972573,0.00010639424,0.0008512441,0.9879551,0.010737546],"study_design_scores_gemma":[0.000015277892,0.00002370729,0.0002094422,0.00011650668,0.000007834083,0.00012018459,0.000017423838,0.00008274689,0.00018109918,0.001215471,0.9980021,0.000008308576],"about_ca_topic_score_codex":0.00071290956,"about_ca_topic_score_gemma":0.0009189309,"teacher_disagreement_score":0.28732458,"about_ca_system_score_codex":0.002073633,"about_ca_system_score_gemma":0.0013215861,"threshold_uncertainty_score":0.9611965},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.034762398109001,"score_gpt":0.2775044403854839,"score_spread":0.24274204227648288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100827027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47177994,0.00089462067,0.41686258,0.0047015552,0.00032629672,0.00034029427,0.00023704137,0.00029567367,0.10456196],"genre_scores_gemma":[0.94866014,0.0003621734,0.03502319,0.00046556524,0.00015637178,0.00017104647,0.000108516564,0.000045921908,0.01500709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972264,0.0010729731,0.000116729956,0.00038277637,0.000762128,0.00043893376],"domain_scores_gemma":[0.99275607,0.004903248,0.00043603385,0.0008415641,0.0006305155,0.0004326532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023281667,0.00065494404,0.0008119913,0.00076777,0.0014870784,0.0020798054,0.001416686,0.0012466587,0.004851069],"category_scores_gemma":[0.009664674,0.00031739136,0.00080747163,0.0006096221,0.0042679934,0.006175538,0.0026762686,0.0028007806,0.0004996246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044941185,0.00002255085,0.000103166334,0.000023636807,0.00000500296,0.000027975653,0.00014324591,0.0047670864,0.00063458306,0.99170786,0.00038502313,0.0021349057],"study_design_scores_gemma":[0.00006274148,0.000051529067,0.0001447236,0.000021573922,0.000010558322,0.000055140088,0.00010076854,0.08312485,0.0022413197,0.9099974,0.004163056,0.000026384214],"about_ca_topic_score_codex":0.0018492707,"about_ca_topic_score_gemma":0.0015571105,"teacher_disagreement_score":0.004851069,"about_ca_system_score_codex":0.0019041453,"about_ca_system_score_gemma":0.0013837796,"threshold_uncertainty_score":0.016228437},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0681648188073247,"score_gpt":0.28769024952469163,"score_spread":0.21952543071736694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124396273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03683399,0.0035257118,0.8564434,0.007915995,0.00086335186,0.0001822634,0.0010854074,0.0014356192,0.09171423],"genre_scores_gemma":[0.5877874,0.0073939837,0.35218456,0.0040116347,0.003923585,0.00076394907,0.0032345974,0.0017558701,0.03894445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99399066,0.0013440689,0.0003253722,0.00092743494,0.0025204453,0.00089206244],"domain_scores_gemma":[0.9584967,0.030110339,0.0013194281,0.0063244277,0.0023389808,0.0014102267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060015363,0.0017707378,0.0017025677,0.0044135503,0.0023505264,0.0072527216,0.004725693,0.002324466,0.02783375],"category_scores_gemma":[0.041436583,0.0014810615,0.0036551284,0.004481421,0.004448295,0.023863519,0.0093237925,0.012899648,0.0045142346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001061812,0.000096384036,0.00040343276,0.00024773364,0.000034020475,0.000063246975,0.00024445407,0.005038374,0.00082010427,0.944762,0.009412957,0.038771007],"study_design_scores_gemma":[0.000013105077,0.000015770729,0.00011601297,0.000056901816,0.000032153544,0.00003900818,0.000027112974,0.011225356,0.00047517184,0.9831951,0.0047915815,0.0000126405985],"about_ca_topic_score_codex":0.0014732511,"about_ca_topic_score_gemma":0.0018597646,"teacher_disagreement_score":0.02783375,"about_ca_system_score_codex":0.00457226,"about_ca_system_score_gemma":0.0017990934,"threshold_uncertainty_score":0.093113184},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07230848095357204,"score_gpt":0.27751235173216143,"score_spread":0.2052038707785894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125063528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21647802,0.0043340395,0.52601874,0.04104165,0.0017409015,0.0001234135,0.00048047275,0.00095691025,0.2088258],"genre_scores_gemma":[0.95407706,0.001178825,0.02527441,0.0031380223,0.0011124602,0.00017032461,0.00017374376,0.00041255073,0.014462584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961598,0.0013421,0.00012919669,0.0008720864,0.00080416485,0.00069266645],"domain_scores_gemma":[0.9608077,0.029325094,0.0016309313,0.00496897,0.0016824859,0.0015848903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046818606,0.0010046044,0.002491687,0.00208374,0.0035502026,0.005131048,0.003481098,0.0042294343,0.014809808],"category_scores_gemma":[0.0564464,0.00087290717,0.0017431588,0.0016799371,0.00975119,0.01692701,0.0064415163,0.008209192,0.002596853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076286386,0.000023049095,0.0004618319,0.000057532445,0.000019869223,0.000047327605,0.00014328957,0.0022024857,0.00027612227,0.9870848,0.00340532,0.006202046],"study_design_scores_gemma":[0.000024926443,0.000015408432,0.00018239036,0.000017523613,0.0000080181535,0.00008200618,0.00005084863,0.008391737,0.0003149632,0.98865926,0.0022383588,0.000014430074],"about_ca_topic_score_codex":0.00048066108,"about_ca_topic_score_gemma":0.00036228323,"teacher_disagreement_score":0.014809808,"about_ca_system_score_codex":0.0022384652,"about_ca_system_score_gemma":0.0016718905,"threshold_uncertainty_score":0.049543798},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031052942470248285,"score_gpt":0.2759480848059405,"score_spread":0.24489514233569223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167854544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34218895,0.0011926438,0.6090126,0.0010883095,0.00031810842,0.0000669947,0.00022671623,0.00033081087,0.045574773],"genre_scores_gemma":[0.91487724,0.0006666459,0.07030604,0.00021432742,0.0002693408,0.000046567373,0.00019177733,0.00011101581,0.01331697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998922,0.00032360345,0.000041603584,0.00015801763,0.00033920887,0.00021557993],"domain_scores_gemma":[0.99700385,0.0015626668,0.0002714071,0.00059186196,0.00035480218,0.00021543351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014273843,0.0005489178,0.0007509374,0.0013162079,0.0007847355,0.0015499907,0.001214992,0.00071390864,0.0053801127],"category_scores_gemma":[0.0086807115,0.0003012398,0.0006143141,0.0014660577,0.0023701547,0.0031104346,0.0022772592,0.0025065716,0.0008288559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001755259,0.000020632962,0.0002307819,0.00003883885,0.0000060111634,0.000052603864,0.00009814368,0.011362712,0.0021120498,0.969302,0.00066483126,0.015935754],"study_design_scores_gemma":[0.000024737981,0.000047020298,0.0001711609,0.00001972329,0.0000079270885,0.00008006901,0.00003829974,0.08461506,0.0029840814,0.90884936,0.0031426935,0.000019903704],"about_ca_topic_score_codex":0.0009208302,"about_ca_topic_score_gemma":0.0009128503,"teacher_disagreement_score":0.0053801127,"about_ca_system_score_codex":0.0016297245,"about_ca_system_score_gemma":0.0009201729,"threshold_uncertainty_score":0.017998278},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.10071733271677694,"score_gpt":0.293439077805599,"score_spread":0.1927217450888221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177980858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1533002,0.0011775945,0.72690934,0.0063691526,0.00047994408,0.0003366054,0.00078037643,0.0012689128,0.10937781],"genre_scores_gemma":[0.88878125,0.00071396906,0.09043293,0.0010994892,0.0006885271,0.0003914215,0.00044961297,0.00031351997,0.01712936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620396,0.000990087,0.00024039314,0.000640652,0.0014553332,0.00046958416],"domain_scores_gemma":[0.98554623,0.009563534,0.000758181,0.0025778299,0.0011417492,0.0004124728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035025412,0.0007409712,0.001474435,0.001393357,0.0024028497,0.0041369903,0.002851932,0.0018568955,0.012388053],"category_scores_gemma":[0.015347792,0.0008859421,0.0016582,0.0013143752,0.004539302,0.011034631,0.0044763545,0.004463421,0.0014930725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009860165,0.000028968134,0.00016415618,0.00006823674,0.00002332566,0.00006023881,0.00011536544,0.004728136,0.00085381744,0.9847312,0.001818831,0.0073091914],"study_design_scores_gemma":[0.000024727216,0.000011756179,0.000054197124,0.000008053962,0.000011114096,0.00003568841,0.00001230831,0.017867943,0.00079995673,0.9802403,0.0009231972,0.000010767736],"about_ca_topic_score_codex":0.0010977444,"about_ca_topic_score_gemma":0.0010676587,"teacher_disagreement_score":0.012388053,"about_ca_system_score_codex":0.0023600818,"about_ca_system_score_gemma":0.002911421,"threshold_uncertainty_score":0.041442156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley","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","score_opus":0.06812620353572955,"score_gpt":0.30958691097718677,"score_spread":0.2414607074414572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395991959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49752674,0.0058317003,0.4430909,0.010702122,0.00045418472,0.0001533762,0.002458524,0.0023715294,0.037410885],"genre_scores_gemma":[0.9760335,0.0013471988,0.01775411,0.00088245113,0.0004636454,0.00009763964,0.00053401967,0.00043417665,0.002453173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914534,0.0028723706,0.00035804702,0.0018888322,0.002127817,0.0012996258],"domain_scores_gemma":[0.8078194,0.1682621,0.0050358414,0.010625017,0.00483711,0.0034204896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064604837,0.0016228574,0.0030370653,0.0037607087,0.0015499486,0.0047779446,0.0046536275,0.0031381468,0.007968419],"category_scores_gemma":[0.10927692,0.001964166,0.0021566625,0.0028851153,0.0043578795,0.016764892,0.003975588,0.0067482493,0.0006337503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013379,0.0002469833,0.00898254,0.0009265189,0.00047607053,0.00046595823,0.00077981316,0.32183954,0.009043304,0.5923295,0.009638545,0.05393338],"study_design_scores_gemma":[0.00003758363,0.00007553414,0.0017177595,0.00006964652,0.00016883377,0.000258027,0.00007516092,0.34883612,0.003186097,0.64434576,0.0011809906,0.000048482067],"about_ca_topic_score_codex":0.0024763767,"about_ca_topic_score_gemma":0.0014393486,"teacher_disagreement_score":0.007968419,"about_ca_system_score_codex":0.0051925397,"about_ca_system_score_gemma":0.0025711418,"threshold_uncertainty_score":0.037674665},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Computer science; Communication complexity; Theoretical computer science","score_opus":0.07522345276282445,"score_gpt":0.31081136914360635,"score_spread":0.23558791638078191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399132114","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20676187,0.08123181,0.23770532,0.19900519,0.0010142529,0.000098398734,0.002636032,0.0010806296,0.27046657],"genre_scores_gemma":[0.92150295,0.027108243,0.029515153,0.004311176,0.004293586,0.00028206749,0.0008363109,0.0003838782,0.011766658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973694,0.00088501803,0.00008139218,0.0006131273,0.00069575856,0.00035521536],"domain_scores_gemma":[0.9580546,0.03585896,0.0012559744,0.0017354139,0.0016173978,0.0014776475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00294746,0.0008366303,0.0013584398,0.0037482844,0.0019700937,0.009699756,0.0022054957,0.0034521273,0.010891299],"category_scores_gemma":[0.022252563,0.00072221225,0.0006783469,0.0036822243,0.0065317512,0.017604768,0.0025433663,0.0056027207,0.0009472498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003186426,0.000024256544,0.0005021567,0.000111430265,0.000011800429,0.000019655503,0.00012193218,0.0041216607,0.00013780274,0.97239345,0.005832724,0.016691223],"study_design_scores_gemma":[0.000009318213,0.0000065289287,0.0004603773,0.000039434228,0.0000050015797,0.00003916468,0.00008730496,0.008329585,0.000065466505,0.9844556,0.0064935624,0.000008595105],"about_ca_topic_score_codex":0.002057028,"about_ca_topic_score_gemma":0.0013907307,"teacher_disagreement_score":0.010891299,"about_ca_system_score_codex":0.003996004,"about_ca_system_score_gemma":0.0011632944,"threshold_uncertainty_score":0.036435008},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.057049807582766204,"score_gpt":0.27272874210327475,"score_spread":0.21567893452050854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402456376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20185223,0.0043403963,0.65067035,0.04226611,0.0006871349,0.0003869184,0.005882095,0.0022722797,0.09164256],"genre_scores_gemma":[0.8427675,0.0021493856,0.13056047,0.0018994854,0.0012477401,0.00041490808,0.0032855237,0.0008037398,0.01687134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961189,0.0013100764,0.00016714924,0.0010094339,0.00096534565,0.00042910432],"domain_scores_gemma":[0.95459396,0.03740571,0.0011214268,0.0045821657,0.0011653324,0.001131428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027498887,0.0008584024,0.0017966768,0.0010244391,0.0010488009,0.0052820505,0.0051248935,0.0034266817,0.019602781],"category_scores_gemma":[0.030497229,0.00069379684,0.0011941998,0.0020813923,0.0024484128,0.014699317,0.0021256518,0.0052730837,0.0014537618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012637748,0.00047899323,0.0030796647,0.0011109135,0.00014978078,0.00020751636,0.00033522103,0.08017034,0.0073140603,0.72224617,0.036125857,0.1475178],"study_design_scores_gemma":[0.00019691285,0.00008603117,0.00097045995,0.000064052736,0.00006229983,0.00025849047,0.00009352009,0.13114576,0.0029171037,0.8580447,0.006134528,0.000026130823],"about_ca_topic_score_codex":0.0011333973,"about_ca_topic_score_gemma":0.0014991487,"teacher_disagreement_score":0.019602781,"about_ca_system_score_codex":0.002507465,"about_ca_system_score_gemma":0.0022274663,"threshold_uncertainty_score":0.065577805},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16132877308405602,"score_gpt":0.2907668538330652,"score_spread":0.1294380807490092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W256395497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25693008,0.006689666,0.5735205,0.013751395,0.0010987831,0.00035413043,0.0021117306,0.0036918556,0.14185193],"genre_scores_gemma":[0.8110024,0.0027061987,0.15828137,0.0023928697,0.0016633015,0.00059296546,0.0014849897,0.0010217032,0.020854283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99463826,0.00084352394,0.00025834696,0.0014267745,0.0019465795,0.00088648],"domain_scores_gemma":[0.98107773,0.013315851,0.0012996529,0.0028202888,0.00081519707,0.0006713091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019043384,0.0013925484,0.0015781253,0.0019272995,0.0017611395,0.0048259255,0.002585391,0.0016621486,0.01360808],"category_scores_gemma":[0.016911749,0.001011207,0.0022455426,0.0021291887,0.0040719085,0.010901027,0.0041403193,0.007212126,0.0017232824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016755837,0.00066369976,0.003904675,0.0007903446,0.00013941209,0.00047420655,0.0006324506,0.08156208,0.021562219,0.7732667,0.022396656,0.092932],"study_design_scores_gemma":[0.00012621735,0.00017695983,0.0012088616,0.00009369038,0.00006504056,0.00025560515,0.00009236179,0.3337108,0.008110714,0.64717346,0.008908884,0.00007742718],"about_ca_topic_score_codex":0.002446513,"about_ca_topic_score_gemma":0.0023625866,"teacher_disagreement_score":0.01360808,"about_ca_system_score_codex":0.0037627371,"about_ca_system_score_gemma":0.0032286518,"threshold_uncertainty_score":0.045523524},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09899804868414189,"score_gpt":0.3208446374831788,"score_spread":0.22184658879903693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565232885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6058076,0.0052329735,0.30895305,0.03212962,0.00035480747,0.0003761435,0.0034793227,0.0007926665,0.042873822],"genre_scores_gemma":[0.9340373,0.0020343564,0.049957007,0.00085016224,0.00085319544,0.00033613044,0.002498563,0.00024871694,0.0091845635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936686,0.0021856066,0.00034001758,0.0013032447,0.0017322127,0.0007704713],"domain_scores_gemma":[0.91018313,0.081805825,0.0025014796,0.0026866703,0.0014292208,0.0013936388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004264606,0.0010365882,0.0019319269,0.0019943926,0.0029185724,0.012402442,0.005050345,0.0041836165,0.009724434],"category_scores_gemma":[0.04958374,0.0012614771,0.0024115718,0.0039480105,0.0065318686,0.029855836,0.0039013007,0.00810006,0.0006441029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000774178,0.0004750592,0.0062436396,0.0008064404,0.00020757286,0.00021112294,0.0020451236,0.085165516,0.0014122891,0.8407636,0.012683757,0.049211722],"study_design_scores_gemma":[0.00006532836,0.000022597727,0.00076038245,0.000032488417,0.00004458692,0.00011685166,0.0002898247,0.077626325,0.0004985583,0.91883755,0.0016788163,0.000026709311],"about_ca_topic_score_codex":0.004259365,"about_ca_topic_score_gemma":0.0039971084,"teacher_disagreement_score":0.012402442,"about_ca_system_score_codex":0.0058234395,"about_ca_system_score_gemma":0.0029759025,"threshold_uncertainty_score":0.042252183},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06614006773660074,"score_gpt":0.2506371343267032,"score_spread":0.18449706659010245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789382863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117975995,0.038579352,0.90165186,0.0034953249,0.0004465656,0.00002862811,0.000352176,0.0006060644,0.043042414],"genre_scores_gemma":[0.3989475,0.07679709,0.47266442,0.0009542843,0.0017718228,0.00024996322,0.001249995,0.0006019746,0.04676287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984,0.000030790583,0.000006810916,0.000049632738,0.00006335489,0.000009369057],"domain_scores_gemma":[0.9995383,0.00033757839,0.000025461506,0.00004263821,0.000037408256,0.000018561253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003875827,0.0006770936,0.0006163691,0.00065768714,0.00025733843,0.0018484349,0.0009774603,0.00071238214,0.0029698815],"category_scores_gemma":[0.0011203645,0.0005259534,0.00037748006,0.0010469536,0.0021206995,0.0028882544,0.00067713874,0.0015239168,0.00095741067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001928507,0.000028278551,0.00034203922,0.00028916012,0.000035245765,0.000079507045,0.00010361539,0.040212348,0.004567563,0.82848144,0.013447285,0.11239423],"study_design_scores_gemma":[0.0000029024116,0.000006085111,0.00024532533,0.000043240798,0.000008571069,0.00009125321,0.000019690808,0.055434577,0.0012795397,0.91556853,0.027285894,0.000014425019],"about_ca_topic_score_codex":0.00060026714,"about_ca_topic_score_gemma":0.00088248693,"teacher_disagreement_score":0.0029698815,"about_ca_system_score_codex":0.00067198614,"about_ca_system_score_gemma":0.0004514518,"threshold_uncertainty_score":0.00993526},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02945818609854594,"score_gpt":0.2619659994610362,"score_spread":0.23250781336249027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805918291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14872853,0.007512036,0.5726392,0.013928734,0.0022584891,0.00016053033,0.00066695205,0.00094609393,0.25315946],"genre_scores_gemma":[0.8377897,0.0034291472,0.12736303,0.0015546125,0.0033008521,0.00017833292,0.0002826197,0.00026678984,0.02583497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991406,0.00034225077,0.000036505495,0.00012371175,0.00021816698,0.00013874323],"domain_scores_gemma":[0.9980817,0.0008945495,0.00014985136,0.0004059938,0.0002534211,0.0002145355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015590622,0.000745469,0.0013701597,0.0019745606,0.002022524,0.002197688,0.0018032084,0.0015696797,0.00881585],"category_scores_gemma":[0.0058565815,0.00038886952,0.001516236,0.0022158688,0.0038016073,0.0048407535,0.0030976848,0.004083345,0.001079594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070841347,0.000012633196,0.000043313554,0.000022999422,0.000002556069,0.000019174486,0.000045177923,0.0023629023,0.00016907816,0.9937728,0.0009894641,0.0025527596],"study_design_scores_gemma":[0.0000039611555,0.0000039350325,0.00006856757,0.0000058994365,0.0000019053376,0.000021179207,0.000014501386,0.020677723,0.00005962165,0.9777014,0.001435111,0.0000060663183],"about_ca_topic_score_codex":0.0029406755,"about_ca_topic_score_gemma":0.003404309,"teacher_disagreement_score":0.00881585,"about_ca_system_score_codex":0.00218396,"about_ca_system_score_gemma":0.0013783533,"threshold_uncertainty_score":0.029491961},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.047338408468813244,"score_gpt":0.29101494548610046,"score_spread":0.24367653701728723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928599599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20688125,0.009183376,0.6791725,0.03174949,0.00076365005,0.00014919117,0.0007263135,0.0005461914,0.070827976],"genre_scores_gemma":[0.925299,0.0027660434,0.0562499,0.001253321,0.0013646277,0.00033021363,0.00031519152,0.0001788933,0.012242925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99302846,0.0032107679,0.0003078508,0.0010479895,0.0016353925,0.00076946657],"domain_scores_gemma":[0.9299933,0.06206466,0.0017485572,0.003467804,0.0016183715,0.0011073857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006833719,0.00094205746,0.0020191849,0.001986959,0.0025217338,0.0069632553,0.0028787053,0.0033413966,0.00821635],"category_scores_gemma":[0.046042677,0.0012070806,0.0013773509,0.0029019988,0.008578528,0.0226169,0.0034189343,0.008274473,0.00051013415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036442514,0.000030814394,0.00018760528,0.00004264171,0.0000062025365,0.000015093849,0.000093216964,0.0060692104,0.000113137925,0.9890189,0.00092937314,0.0034574377],"study_design_scores_gemma":[0.000013813038,0.0000055281216,0.00008872376,0.000008038562,0.000005827234,0.0000148233685,0.000022420601,0.029558234,0.00007562034,0.96964,0.000559744,0.000007176574],"about_ca_topic_score_codex":0.0034064937,"about_ca_topic_score_gemma":0.0034647125,"teacher_disagreement_score":0.00821635,"about_ca_system_score_codex":0.006531429,"about_ca_system_score_gemma":0.0029028652,"threshold_uncertainty_score":0.04738909},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04433134717812037,"score_gpt":0.3166030198724693,"score_spread":0.27227167269434893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932807114","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032161988,0.00078544527,0.0049638166,0.0833851,0.90415204,0.000027105445,0.0016999823,0.0015118449,0.003152998],"genre_scores_gemma":[0.06747274,0.0060182977,0.025321795,0.11374724,0.5458857,0.00030074146,0.003935505,0.004462318,0.23285577],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99540555,0.0006301033,0.00066103693,0.0009449738,0.0016972333,0.0006611406],"domain_scores_gemma":[0.97085255,0.008206217,0.0010293898,0.0030386306,0.015550535,0.0013226724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031444752,0.0020800151,0.0024457704,0.0031000373,0.0036247014,0.0038499704,0.0035482566,0.007653548,0.08594985],"category_scores_gemma":[0.06675006,0.0011785008,0.0020558243,0.0030184344,0.0034167334,0.0032804173,0.0020389967,0.012241649,0.038939804],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005610765,0.000008479086,0.00007711242,0.00010865627,0.000020212434,0.00024384513,0.00003199357,0.0001446411,0.00009515922,0.0038323882,0.9881274,0.007253862],"study_design_scores_gemma":[0.00009223451,0.000035239904,0.0008289975,0.00015655317,0.000054085584,0.00094791764,0.000087259374,0.002066365,0.0009904553,0.015285992,0.9793767,0.000078183446],"about_ca_topic_score_codex":0.013365142,"about_ca_topic_score_gemma":0.011900154,"teacher_disagreement_score":0.08594985,"about_ca_system_score_codex":0.005033684,"about_ca_system_score_gemma":0.0053089084,"threshold_uncertainty_score":0.2875309},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.08558391872999488,"score_gpt":0.2735751312171957,"score_spread":0.1879912124872008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949775108","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001772797,0.01778318,0.038726173,0.004217363,0.0014925357,0.000054705648,0.00015106703,0.00015888165,0.9356434],"genre_scores_gemma":[0.10413751,0.038499434,0.029836861,0.0025799351,0.005302182,0.00030656342,0.00052936556,0.00046632998,0.81834185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952316,0.000083728344,0.000011789794,0.00006278533,0.00028069044,0.000037813716],"domain_scores_gemma":[0.99963856,0.00016306007,0.000013314015,0.00008188518,0.00008172782,0.000021406071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034702374,0.0008927687,0.0007819958,0.0011760152,0.0012748812,0.0027431664,0.00082085346,0.001019296,0.027191833],"category_scores_gemma":[0.0012888158,0.00041839704,0.00041525916,0.0015328972,0.003100519,0.004006459,0.0014532475,0.0030760907,0.0069484594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002137281,0.0000101879405,0.000015494448,0.00007043979,0.000003509594,0.00000818688,0.00005766299,0.0005164445,0.00015484767,0.9419814,0.0358221,0.02135749],"study_design_scores_gemma":[0.0000021331527,0.0000042863558,0.00006713947,0.000058909383,0.00000295069,0.0000441626,0.000023145009,0.0011785884,0.00025347256,0.7714732,0.22688624,0.0000056716954],"about_ca_topic_score_codex":0.0010204487,"about_ca_topic_score_gemma":0.0014297774,"teacher_disagreement_score":0.027191833,"about_ca_system_score_codex":0.0029973714,"about_ca_system_score_gemma":0.0012991719,"threshold_uncertainty_score":0.09096581},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Bounded function; Corollary; Mathematical proof; Mathematics; Argument (complex analysis); Discrete mathematics; Polynomial","score_opus":0.03632872527826129,"score_gpt":0.2831419397445236,"score_spread":0.24681321446626234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014805183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30651912,0.0028486752,0.5697082,0.010228063,0.0003989476,0.00021832854,0.0008208258,0.003328905,0.10592901],"genre_scores_gemma":[0.95441324,0.00071952003,0.032089513,0.00083846174,0.00025554135,0.00014156601,0.0003568526,0.00046685652,0.010718533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99198604,0.002552146,0.00040226267,0.0013627084,0.0021688403,0.0015278881],"domain_scores_gemma":[0.9453525,0.040834688,0.0020434884,0.008318434,0.0022965162,0.0011544229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059653055,0.0015089838,0.0022850565,0.0024591836,0.003633519,0.0073532397,0.003962978,0.0036025965,0.012610584],"category_scores_gemma":[0.04104402,0.0018750981,0.0031741112,0.0020180573,0.009157188,0.025328888,0.008861161,0.009933736,0.0018162748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021702408,0.00004679512,0.0004132135,0.00015355462,0.000044646134,0.00012335565,0.0004800481,0.003701344,0.0014230466,0.9823814,0.0019760588,0.009039493],"study_design_scores_gemma":[0.000024648352,0.000011958045,0.00007599202,0.000017950399,0.000020926085,0.00008176744,0.00003126544,0.004498123,0.0011181104,0.99270564,0.00139608,0.000017489352],"about_ca_topic_score_codex":0.0010542836,"about_ca_topic_score_gemma":0.00112546,"teacher_disagreement_score":0.012610584,"about_ca_system_score_codex":0.0037616522,"about_ca_system_score_gemma":0.0025270514,"threshold_uncertainty_score":0.042186618},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07333356916538013,"score_gpt":0.3050625484096439,"score_spread":0.23172897924426378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021390709","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06308211,0.0020106407,0.85888654,0.0044421586,0.0006171459,0.00024501764,0.00092085806,0.0048200097,0.06497552],"genre_scores_gemma":[0.50926036,0.0017066707,0.43619496,0.0015504479,0.0011585737,0.0005856337,0.0026202775,0.0020661945,0.044856958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99618214,0.0008795086,0.0001943059,0.0007487817,0.0013333801,0.0006618568],"domain_scores_gemma":[0.99227315,0.0042087547,0.00031756368,0.002100103,0.00073339464,0.00036698612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025456075,0.0019066309,0.0015772961,0.0022696166,0.0016929779,0.007134674,0.0036030908,0.0017218654,0.025708985],"category_scores_gemma":[0.014199587,0.0007396198,0.0013713104,0.0032313936,0.0021490627,0.014356712,0.0042513334,0.0051691234,0.007072151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012305107,0.0005226818,0.0009958139,0.00048683953,0.00007030947,0.00009369042,0.0003450213,0.024321169,0.0057969843,0.6393643,0.038167257,0.28860545],"study_design_scores_gemma":[0.0001512058,0.00005409589,0.00019715405,0.00003742884,0.00003795273,0.00011036529,0.00008418182,0.09232478,0.0037287865,0.89505017,0.00819584,0.000028047025],"about_ca_topic_score_codex":0.002082384,"about_ca_topic_score_gemma":0.0031690353,"teacher_disagreement_score":0.025708985,"about_ca_system_score_codex":0.004431421,"about_ca_system_score_gemma":0.0029973255,"threshold_uncertainty_score":0.08600509},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03902938089658899,"score_gpt":0.28683573876716145,"score_spread":0.24780635787057245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040249201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0574233,0.0008497654,0.7993356,0.006014071,0.00044333455,0.00014797694,0.000525837,0.001154581,0.13410562],"genre_scores_gemma":[0.6717375,0.0026608694,0.2637619,0.0027915258,0.0016578896,0.0006957304,0.0013825975,0.0016094323,0.053702515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970799,0.0005433992,0.00015343454,0.0007306895,0.0010512908,0.00044116616],"domain_scores_gemma":[0.9926846,0.0044429204,0.0003101463,0.001556991,0.00064730225,0.0003580208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022720702,0.001245285,0.0014180285,0.0021122633,0.0020470025,0.003899774,0.002333105,0.0014487436,0.018795319],"category_scores_gemma":[0.007850565,0.0010726444,0.0025704901,0.002616042,0.00408262,0.023268986,0.007327393,0.009089425,0.0032114096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028427665,0.000044711098,0.00013422883,0.0000639728,0.000009079098,0.00004274194,0.00013279283,0.0010318343,0.00059803104,0.98523617,0.002053941,0.010623935],"study_design_scores_gemma":[0.000009473862,0.000005233709,0.000078960475,0.000008752218,0.00000993318,0.00004447092,0.000032863805,0.0043829507,0.00067389436,0.99221295,0.0025331024,0.0000073799815],"about_ca_topic_score_codex":0.00092380005,"about_ca_topic_score_gemma":0.0009522158,"teacher_disagreement_score":0.018795319,"about_ca_system_score_codex":0.001564627,"about_ca_system_score_gemma":0.0011217111,"threshold_uncertainty_score":0.06287658},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08495536218311425,"score_gpt":0.2882672099705096,"score_spread":0.20331184778739533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W316638553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40478587,0.002730627,0.5336621,0.01369565,0.00028092726,0.00062442746,0.0045348727,0.0017121627,0.03797339],"genre_scores_gemma":[0.89024985,0.0016629904,0.0930165,0.0011508196,0.00038886548,0.0006589658,0.0030270235,0.0005065662,0.009338496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99379385,0.0019326425,0.0003378373,0.001178402,0.0016467026,0.0011104594],"domain_scores_gemma":[0.9600261,0.034523338,0.0014061352,0.0021970759,0.0009718349,0.0008754296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003456963,0.0017868715,0.0021673257,0.0012603062,0.001649428,0.0059682503,0.003728522,0.0025915576,0.009539934],"category_scores_gemma":[0.029111391,0.001045872,0.0021892847,0.0019598177,0.0038001286,0.01393161,0.004523263,0.00726642,0.0010386998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001584628,0.00050525216,0.004248949,0.000890744,0.00022479949,0.0003567753,0.0011171037,0.46111417,0.0045123473,0.46968853,0.011316183,0.04444057],"study_design_scores_gemma":[0.00012129787,0.000053527066,0.00039529163,0.000043436594,0.000038715072,0.00008199382,0.00010840663,0.46523955,0.0011673794,0.5312537,0.0014680754,0.000028548366],"about_ca_topic_score_codex":0.0050305948,"about_ca_topic_score_gemma":0.0043686787,"teacher_disagreement_score":0.009539934,"about_ca_system_score_codex":0.0053237723,"about_ca_system_score_gemma":0.0031453317,"threshold_uncertainty_score":0.03862679},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06434584726470818,"score_gpt":0.28898157429051835,"score_spread":0.22463572702581017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198583770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084029354,0.0057433494,0.81652284,0.021266477,0.00057042466,0.000076990436,0.0007606166,0.0009690932,0.070060804],"genre_scores_gemma":[0.88399756,0.0028764461,0.102426894,0.0017291777,0.001342045,0.0001745897,0.00055839727,0.00038985015,0.006505048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924931,0.0038993629,0.00044603038,0.0014990806,0.0012577745,0.00040459447],"domain_scores_gemma":[0.9033436,0.078629486,0.0024894704,0.011424641,0.002594127,0.0015185238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072099245,0.0008439432,0.0015059292,0.0028951617,0.0019153693,0.008338857,0.0028413085,0.002711775,0.008394429],"category_scores_gemma":[0.052711546,0.0011997335,0.0016322705,0.0024242788,0.016756045,0.04607266,0.0054347864,0.006834978,0.0007504166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022553018,0.00001091604,0.00019756153,0.000044141336,0.0000058368205,0.000015902782,0.00011154884,0.0010809504,0.00009417079,0.9937261,0.00058654376,0.0041038957],"study_design_scores_gemma":[0.000004996146,0.0000032884354,0.0000366809,0.000008754872,0.000003111374,0.000012956014,0.000016623006,0.003029673,0.000069668284,0.99591774,0.00089232274,0.000004144736],"about_ca_topic_score_codex":0.0011056704,"about_ca_topic_score_gemma":0.0009405185,"teacher_disagreement_score":0.008394429,"about_ca_system_score_codex":0.0018726804,"about_ca_system_score_gemma":0.00114527,"threshold_uncertainty_score":0.038130164},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science","score_opus":0.17885875770413145,"score_gpt":0.2942854099804757,"score_spread":0.11542665227634424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210248983","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075315502,0.45472625,0.3004921,0.02355247,0.0030237092,0.0000665564,0.00042635557,0.00018882562,0.2099921],"genre_scores_gemma":[0.4113622,0.33617932,0.19683002,0.0035134868,0.012391487,0.0004145353,0.0006014993,0.00017602861,0.038531374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980944,0.00069272483,0.00011947731,0.00021151852,0.0007933946,0.0000885497],"domain_scores_gemma":[0.99598205,0.0031336613,0.00016835741,0.0002811897,0.0003545628,0.000080202524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002591237,0.0011414182,0.0018608784,0.0032869847,0.0013478872,0.0089019425,0.0014716723,0.0021146599,0.0036745581],"category_scores_gemma":[0.006646195,0.00091869896,0.0010701306,0.0053827367,0.006901449,0.00840621,0.0018247205,0.004821654,0.0010952443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031605607,0.000006897153,0.000034384815,0.00012474484,0.000007356293,0.00001372851,0.00011488515,0.0014806747,0.000053197313,0.9830268,0.0030843904,0.012049774],"study_design_scores_gemma":[0.0000014554408,0.0000037556524,0.00006374409,0.00006944888,0.000003666068,0.000028872046,0.000054489683,0.0018209311,0.0000316224,0.98076963,0.017145917,0.000006522895],"about_ca_topic_score_codex":0.0016148938,"about_ca_topic_score_gemma":0.0013683061,"teacher_disagreement_score":0.0089019425,"about_ca_system_score_codex":0.0034294312,"about_ca_system_score_gemma":0.0013073917,"threshold_uncertainty_score":0.024882376},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.17210854399133257,"score_gpt":0.366638139190427,"score_spread":0.1945295951990944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376504252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7258271,0.00044793668,0.1300093,0.0031776815,0.00060528546,0.00014782093,0.0005317563,0.0014755417,0.13777764],"genre_scores_gemma":[0.9797861,0.00012764153,0.008520681,0.00039885487,0.00020697569,0.00008669634,0.0002926713,0.00019395932,0.010386371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986738,0.000204542,0.00006545915,0.00024264703,0.0004491144,0.0003645444],"domain_scores_gemma":[0.9920438,0.004427466,0.00066413736,0.0011145696,0.0009994464,0.0007506195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094890565,0.0010354384,0.0012915314,0.0021861868,0.0015589806,0.0032264367,0.001534937,0.0014964067,0.01171251],"category_scores_gemma":[0.010041049,0.00055039703,0.0007615983,0.0013556173,0.0047622933,0.006220635,0.0020213192,0.0024079883,0.00194228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018530028,0.000109127686,0.0013926511,0.00009906478,0.000023915516,0.00043421265,0.00030097144,0.00073997496,0.006112723,0.9703761,0.003737037,0.016488904],"study_design_scores_gemma":[0.000044547895,0.000052704738,0.00083282165,0.000013448739,0.000019852117,0.00046827528,0.00013274162,0.0060380427,0.003965147,0.9861466,0.0022503529,0.00003557329],"about_ca_topic_score_codex":0.0005789086,"about_ca_topic_score_gemma":0.0011056998,"teacher_disagreement_score":0.01171251,"about_ca_system_score_codex":0.00073351274,"about_ca_system_score_gemma":0.0008029519,"threshold_uncertainty_score":0.039182305},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02315802691439623,"score_gpt":0.2658649143461981,"score_spread":0.24270688743180185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415590863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023028469,0.0015279576,0.94886136,0.0058893105,0.0004266198,0.000074136886,0.00041518768,0.0002800163,0.019496918],"genre_scores_gemma":[0.793214,0.0027741506,0.18088269,0.00158198,0.0026432103,0.0005801575,0.0007493411,0.0004447594,0.01712971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9882063,0.0053924853,0.0004334926,0.0019840605,0.0028956446,0.0010879929],"domain_scores_gemma":[0.93049204,0.054977678,0.002017518,0.008018305,0.0032769921,0.0012174788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007403389,0.0015489992,0.002468159,0.0016688148,0.0013925497,0.0066140178,0.0029931918,0.0027497709,0.009334987],"category_scores_gemma":[0.050961733,0.0008284323,0.0012676374,0.0023487324,0.0057018697,0.014012228,0.004226738,0.007324793,0.0012209715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014815829,0.000064693035,0.00019480889,0.00011055189,0.000020490277,0.000026563264,0.000077736695,0.037705295,0.00053641543,0.9419446,0.003524959,0.015645716],"study_design_scores_gemma":[0.00002649142,0.000027200904,0.000107725384,0.000024829966,0.0000075482476,0.000029500941,0.000020409912,0.14965871,0.000393547,0.84820926,0.0014753483,0.000019374664],"about_ca_topic_score_codex":0.001787227,"about_ca_topic_score_gemma":0.0015390093,"teacher_disagreement_score":0.009334987,"about_ca_system_score_codex":0.0044791047,"about_ca_system_score_gemma":0.004463534,"threshold_uncertainty_score":0.039153337},"labels":[],"label_agreement":null}]}