{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":40,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":40,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"c8748a2891c2","filters":{"venue":"Computational Complexity"}},"results":[{"id":"W2026036943","doi":"10.1007/s00037-004-0182-6","title":"Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds","year":2004,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":384,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Polynomial; Arithmetic circuit complexity; Combinatorics; Nondeterministic algorithm; Discrete mathematics; Bounded function; Identity (music); Degree (music); Upper and lower bounds; Arithmetic; Arbitrary-precision arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.05471051344573013,"gpt":0.2880086850664225,"spread":0.2332981716206923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006420803,0.0003296811,0.000402633,0.0002684023,0.001035046,0.0008355961,0.001586326,0.0000882833,0.00005390993],"category_scores_gemma":[0.0001541225,0.0003623221,0.0002817445,0.0008629819,0.0003925197,0.001857955,0.0006682646,0.0003897944,0.0001280687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002959656,"about_ca_system_score_gemma":0.0004415357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002594743,"about_ca_topic_score_gemma":0.000248667,"domain_scores_codex":[0.9970379,0.0001355182,0.0005687674,0.0007825448,0.0009016008,0.0005736828],"domain_scores_gemma":[0.9983326,0.000326275,0.0002134126,0.0005777249,0.0003169045,0.0002330866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000453432,0.0004069624,0.0007183254,0.00003632054,0.00007025687,0.00006193924,0.0007050977,0.04093824,0.0001459951,0.9510143,0.000335784,0.005521367],"study_design_scores_gemma":[0.00314183,0.0000997575,0.03452035,0.00005506076,0.00001245829,0.0001286986,0.00001474195,0.08973329,0.00007094455,0.8711692,0.0005741602,0.0004794933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1038046,0.0001099379,0.8906953,0.001142936,0.001165124,0.0003394833,0.00001898069,0.000485013,0.002238702],"genre_scores_gemma":[0.8217263,0.000001422394,0.17721,0.0006852092,0.0002864938,0.00001853,0.00002821028,0.00001733624,0.00002651182],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7179217,"threshold_uncertainty_score":0.9998829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100827027","doi":"10.1007/s00037-005-0194-x","title":"Quantum Arthur–Merlin games","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":253,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Quantum pseudo-telepathy; Soundness; Quantum sort; Merlin (protein); Quantum; Discrete mathematics; Mathematics; Quantum computer; Quantum information; Quantum complexity theory; Computer science; Combinatorics; Quantum mechanics; Quantum error correction; Quantum network; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.034762398109001,"gpt":0.2775044403854839,"spread":0.2427420422764829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003096665,0.0002383119,0.000248123,0.0001533533,0.0003760567,0.0002287849,0.001021805,0.00005565253,0.0000646075],"category_scores_gemma":[0.00004003304,0.0002269118,0.0001406568,0.0004383349,0.0001656769,0.0003219153,0.0003908779,0.0002910151,0.0003717035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005298756,"about_ca_system_score_gemma":0.0001200431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001583826,"about_ca_topic_score_gemma":0.000009198096,"domain_scores_codex":[0.998,0.0001232673,0.0003773466,0.0005723346,0.0005143672,0.0004126429],"domain_scores_gemma":[0.998861,0.0001981799,0.0001345857,0.0004580608,0.0001709883,0.0001772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005532504,0.0001385645,0.0001414874,0.000009485102,0.00002196395,0.0000100466,0.0004606189,0.3717431,0.00002702612,0.4916775,0.002196574,0.1335681],"study_design_scores_gemma":[0.000272987,0.00004769401,0.01924032,0.0000127097,0.000002176176,0.00006025509,0.000004127868,0.7577425,0.00003778151,0.2143363,0.008020282,0.0002229089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2083853,0.0001979906,0.7832428,0.006155135,0.000336362,0.0001221604,0.000009097856,0.0005131806,0.001038043],"genre_scores_gemma":[0.7085252,0.00000131126,0.2899043,0.001135178,0.0003400962,0.00000473027,0.00001980911,0.00001068162,0.00005864677],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.50014,"threshold_uncertainty_score":0.9253196,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2177980858","doi":"10.1007/s00037-008-0250-4","title":"Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems","year":2008,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gas meter prover; Mathematics; Discrete mathematics; XOR gate; Function (biology); Repetition (rhetorical device); Class (philosophy); Automated theorem proving; Computer science; Algorithm; Mathematical proof","retraction":null,"screen_n_in":null,"score":{"opus":0.1007173327167769,"gpt":0.293439077805599,"spread":0.1927217450888221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008865595,0.0003424413,0.0004752034,0.000174214,0.000812617,0.0002042192,0.001157871,0.000105238,0.00002247745],"category_scores_gemma":[0.0002093141,0.0003308021,0.000263306,0.0004842013,0.0004026644,0.0005059256,0.000385578,0.0002203125,0.00006280926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002218273,"about_ca_system_score_gemma":0.0003054402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005530076,"about_ca_topic_score_gemma":0.000006459121,"domain_scores_codex":[0.9967318,0.000349907,0.000662099,0.0009895241,0.0007439409,0.000522777],"domain_scores_gemma":[0.9969826,0.001008146,0.0002778538,0.0007474194,0.0007908549,0.0001930846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004538076,0.0003179591,0.0005944942,0.00009560514,0.00003734901,0.00001721736,0.0003894675,0.1300071,0.0000180685,0.8651519,0.001986024,0.001339444],"study_design_scores_gemma":[0.0005615313,0.0002208571,0.01568701,0.0000169123,0.000005184205,0.0002145811,0.000009552056,0.631435,0.00001577077,0.3505,0.001067081,0.0002665002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04537351,0.0002192282,0.9495575,0.001074588,0.001043815,0.001346746,0.00005332115,0.0005304359,0.0008008387],"genre_scores_gemma":[0.7646334,0.00000224514,0.2344641,0.0001860646,0.0003105213,0.0001756362,0.0001214025,0.00002071284,0.00008593304],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7192599,"threshold_uncertainty_score":0.9999144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014805183","doi":"10.1007/s00037-004-0183-5","title":"Non-Automatizability of Bounded-Depth Frege Proofs","year":2004,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Bounded function; Corollary; Mathematical proof; Mathematics; Argument (complex analysis); Discrete mathematics; Polynomial","retraction":null,"screen_n_in":null,"score":{"opus":0.03632872527826129,"gpt":0.2831419397445236,"spread":0.2468132144662623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003655003,0.0001742021,0.0002659985,0.0001343293,0.000212747,0.00009784849,0.0009883967,0.00005811503,0.00002672011],"category_scores_gemma":[0.00004417885,0.000175282,0.0001539046,0.0007029182,0.0004011532,0.0005834254,0.0003826238,0.0001616496,0.00003401419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006857554,"about_ca_system_score_gemma":0.0002651469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001385482,"about_ca_topic_score_gemma":0.00008021983,"domain_scores_codex":[0.9982789,0.00005518282,0.0004271981,0.0004634877,0.0005250819,0.000250168],"domain_scores_gemma":[0.9986708,0.0001200063,0.0001854665,0.0006207185,0.0002793991,0.0001235679],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009710867,0.0003889958,0.004531005,0.0000552047,0.00002168724,0.000003444149,0.0004808908,0.005660404,0.00004030668,0.9871203,0.0002113505,0.001476646],"study_design_scores_gemma":[0.0004848594,0.00007010793,0.2650768,0.00001807077,0.000002540673,0.00001180262,0.00000684521,0.03494834,0.0003126641,0.6987439,0.0001855018,0.0001384974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2971795,0.00005048754,0.7004459,0.000396599,0.0001497635,0.0002165535,0.00005409461,0.0001644147,0.001342629],"genre_scores_gemma":[0.7068254,8.189928e-7,0.2929493,0.000120975,0.00002838961,0.000007650662,0.00006241352,0.000004511587,5.829002e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4096459,"threshold_uncertainty_score":0.7147791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003104918","doi":"10.1007/s00037-001-8195-x","title":"Communication complexity towards lower bounds on circuit depth","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Boolean function; Circuit complexity; Communication complexity; Upper and lower bounds; Omega; Mathematics; Binary logarithm; Bounded function; Function (biology); Discrete mathematics; Boolean circuit; Conjecture; Combinatorics; Characterization (materials science); Electronic circuit; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1246287817561772,"gpt":0.3159649090989075,"spread":0.1913361273427303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007217328,0.0004495102,0.0004735442,0.000345653,0.001232133,0.0005725051,0.002814988,0.0001293053,0.0003337088],"category_scores_gemma":[0.00009977603,0.0004808657,0.0002972925,0.001268943,0.0008910557,0.0007547776,0.0008608489,0.0006096874,0.0004271218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002545106,"about_ca_system_score_gemma":0.0002272249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002004641,"about_ca_topic_score_gemma":0.0001634976,"domain_scores_codex":[0.9962165,0.000408708,0.000669967,0.0009075195,0.001146125,0.0006511618],"domain_scores_gemma":[0.9968551,0.0004643177,0.0002786195,0.001603411,0.0004940961,0.0003044437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004270853,0.0006428002,0.0008195138,0.00001333632,0.00005067148,0.00002951287,0.0002915214,0.004361331,0.000007041414,0.9629222,0.002366434,0.02845296],"study_design_scores_gemma":[0.0006396559,0.0001828208,0.1259772,0.00003774135,0.000007147258,0.0001007718,0.00001450597,0.1948216,0.00001556448,0.6665706,0.01120031,0.0004321259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06267783,0.000181777,0.8619535,0.004733219,0.0008990005,0.0004649397,0.00004731732,0.0009271543,0.06811523],"genre_scores_gemma":[0.8867108,0.0000180495,0.110293,0.002355319,0.0001667368,0.00003213519,0.00019547,0.00002607075,0.0002024704],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8240329,"threshold_uncertainty_score":0.9997643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949775108","doi":"10.1007/978-1-4614-1800-9_147","title":"Quantum Computational Complexity","year":2011,"lang":"en","type":"book-chapter","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum; Theoretical computer science; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.08558391872999488,"gpt":0.2735751312171957,"spread":0.1879912124872008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005867617,0.001225354,0.001258444,0.0006187299,0.0009901215,0.0004378258,0.003110588,0.0004930408,0.0008711251],"category_scores_gemma":[0.00004571826,0.001287502,0.0007178016,0.0002596352,0.001239441,0.0003767789,0.001755584,0.001564332,0.00131956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002550187,"about_ca_system_score_gemma":0.0006945728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006632122,"about_ca_topic_score_gemma":0.00001900584,"domain_scores_codex":[0.9939749,0.000175143,0.001349414,0.00193771,0.001685501,0.0008773075],"domain_scores_gemma":[0.9956123,0.00064565,0.0009831548,0.00130655,0.0009244158,0.0005279474],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002078562,0.0001163386,0.00001100581,0.00007454128,0.0001770439,0.00008326406,0.000273881,0.05417516,5.738817e-7,0.9299336,0.00631466,0.008819128],"study_design_scores_gemma":[0.0003608154,0.0001240035,0.001330422,0.0001121523,0.000022709,0.0001648342,0.000001083515,0.4269729,8.478896e-7,0.5502753,0.01985916,0.000775873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002393673,0.0004690805,0.7981067,0.001251932,0.00141229,0.0006072729,0.0003389071,0.001172695,0.1964018],"genre_scores_gemma":[0.1224958,0.00002855421,0.8193676,0.003640169,0.001847979,0.00004034986,0.00286143,0.0003877019,0.04933044],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3796584,"threshold_uncertainty_score":0.999458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972068724","doi":"10.1007/s00037-007-0220-2","title":"A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness","year":2006,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Washington; National Science Foundation","keywords":"Corollary; Communication complexity; Upper and lower bounds; Mathematics; Product (mathematics); Direct product; Combinatorics; Function (biology); Discrete mathematics; Simple (philosophy); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0649624365213801,"gpt":0.2936631913235376,"spread":0.2287007548021575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001320024,0.0002292294,0.0004276666,0.0001104173,0.000760194,0.0001672274,0.0009778639,0.00004183402,0.000009151769],"category_scores_gemma":[0.0001328982,0.0001785862,0.0001777869,0.0004094385,0.002640153,0.0003769834,0.0004896222,0.0001796032,0.0000021534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004333028,"about_ca_system_score_gemma":0.00006797438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004011966,"about_ca_topic_score_gemma":0.0001713972,"domain_scores_codex":[0.9977929,0.0004536907,0.0005819637,0.0004837429,0.0004145875,0.0002730901],"domain_scores_gemma":[0.996932,0.001385654,0.0003919885,0.0007353412,0.000501249,0.00005378871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001091491,0.0001700346,0.0006512821,0.00005173951,0.00002311659,2.045866e-7,0.0002844551,0.007238066,0.00002285221,0.9872041,0.0002809839,0.00396406],"study_design_scores_gemma":[0.001144728,0.0000319543,0.0496028,0.00002013303,0.00001161896,0.00000845122,0.00001918767,0.4322579,0.00008100938,0.5164871,0.000211565,0.0001235956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05153957,0.0005333859,0.9414292,0.002992049,0.0002147313,0.001185273,0.0001343889,0.0001716521,0.001799774],"genre_scores_gemma":[0.8259996,0.000005043893,0.1735557,0.00007353041,0.00007634248,0.00007424429,0.0001763966,0.00001004945,0.00002911255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.77446,"threshold_uncertainty_score":0.9727752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066938865","doi":"10.1007/s00037-001-8191-1","title":"Reducing the complexity of reductions","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Gap theorem; Isomorphism (crystallography); Discrete mathematics; Combinatorics; Invertible matrix; Complexity class; Conjecture; Time complexity; Pure mathematics; Fundamental theorem; Crystallography; Crystal structure","retraction":null,"screen_n_in":null,"score":{"opus":0.1245434252239768,"gpt":0.3089948682333011,"spread":0.1844514430093243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005508587,0.0002106155,0.0002892769,0.0001758073,0.000825198,0.0001310541,0.001671474,0.00004943545,0.0001437912],"category_scores_gemma":[0.00008553381,0.0001754585,0.000210052,0.001316482,0.001884089,0.0004119611,0.0005429711,0.0003068327,0.00004158998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005820777,"about_ca_system_score_gemma":0.000146245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002173632,"about_ca_topic_score_gemma":0.00003065833,"domain_scores_codex":[0.9977769,0.0002291984,0.0005490583,0.0004769792,0.0006202038,0.0003476397],"domain_scores_gemma":[0.9980457,0.0003473351,0.0002598381,0.0008286447,0.000406465,0.0001119936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001049838,0.000170277,0.0002921485,0.00001110436,0.00003970611,0.000004644027,0.0004630199,0.01682755,0.00006453268,0.9732609,0.001546482,0.007309123],"study_design_scores_gemma":[0.0002178139,0.0000477813,0.04048681,0.00001834542,0.000007354667,0.0001618539,0.00004595114,0.2727486,0.00007969372,0.6834071,0.002614847,0.000163769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06498257,0.000183584,0.9142869,0.01114313,0.0008107214,0.0003066926,0.00002858877,0.0002836231,0.00797418],"genre_scores_gemma":[0.8281727,0.000007462148,0.1712435,0.0002787373,0.0001568346,0.0000126152,0.00002632921,0.000009010577,0.00009278915],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7631902,"threshold_uncertainty_score":0.7154991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053658780","doi":"10.1007/s00037-015-0100-0","title":"Mining Circuit Lower Bound Proofs for Meta-Algorithms","year":2015,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Mathematical proof; Algorithm; Truth table; Computer science; Upper and lower bounds; Boolean function; Circuit minimization for Boolean functions; Discrete mathematics; Boolean circuit; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.3098774182245229,"gpt":0.3417031708771991,"spread":0.03182575265267629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001046114,0.0003400409,0.0005514206,0.0002131256,0.0004861563,0.0004781141,0.001416204,0.00008464105,0.00006408952],"category_scores_gemma":[0.00019643,0.000327786,0.0004351898,0.0006569468,0.0003129068,0.0007053072,0.0004574959,0.0001887595,0.00006580883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001206603,"about_ca_system_score_gemma":0.0003781494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002483218,"about_ca_topic_score_gemma":0.00001570997,"domain_scores_codex":[0.9971493,0.0001432276,0.0005333009,0.0008062781,0.0008343703,0.0005335519],"domain_scores_gemma":[0.9974052,0.0005628623,0.0002163418,0.0006058573,0.0008576261,0.0003521607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003201171,0.0003596836,0.00009192377,0.00003765711,0.0006156638,0.00001937444,0.0008313434,0.01320831,0.000005552321,0.9578258,0.01546991,0.01150278],"study_design_scores_gemma":[0.0006450954,0.0001769919,0.0008013762,0.000005816605,0.00007197651,0.0000409285,0.00001979837,0.3923003,0.0000217499,0.5929149,0.01270443,0.0002965847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004975388,0.0003892652,0.9881971,0.00153873,0.001287881,0.0005789155,0.00007170948,0.0004069759,0.002553968],"genre_scores_gemma":[0.2861275,5.684176e-7,0.7118548,0.0009749913,0.0003579113,0.0002491614,0.0001021995,0.00002657962,0.0003063635],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.379092,"threshold_uncertainty_score":0.9999174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167854544","doi":"10.1007/s00037-010-0294-0","title":"Interpolation of Shifted-Lacunary Polynomials","year":2010,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Lacunary function; Mathematics; Combinatorics; Interpolation (computer graphics); Polynomial; Logarithm; Degree (music); Modulo; Discrete mathematics; Prime (order theory); Exponent; Representation (politics); Rational function; Pure mathematics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03105294247024828,"gpt":0.2759480848059405,"spread":0.2448951423356922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004123547,0.0001033949,0.000150368,0.0001693659,0.0001167163,0.00005495823,0.0006554416,0.00005245227,0.0001357621],"category_scores_gemma":[0.00005815259,0.0001055991,0.0001048149,0.0003687708,0.0002183621,0.0003037761,0.0002180111,0.0001987232,0.00002542216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006310594,"about_ca_system_score_gemma":0.00005637214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001177347,"about_ca_topic_score_gemma":0.00001046875,"domain_scores_codex":[0.9990333,0.00009470724,0.0002743143,0.000237507,0.000226199,0.0001339974],"domain_scores_gemma":[0.9990093,0.0003164158,0.000142668,0.0003162201,0.0001479807,0.00006738034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001632321,0.00007274232,0.001534647,0.000007668739,0.00001326896,9.408795e-7,0.0002470913,0.0001572816,0.002219134,0.9901704,0.0002691585,0.00529138],"study_design_scores_gemma":[0.0001760153,0.00005195291,0.08249217,0.000006880239,0.00000293558,0.00001167106,0.000006495755,0.1054989,0.0004082995,0.810923,0.0003148547,0.0001067998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4646246,0.00001118784,0.5310429,0.0003866482,0.0003879459,0.0000740985,0.000008960487,0.0001093091,0.003354406],"genre_scores_gemma":[0.7969331,1.4045e-7,0.20284,0.0001412583,0.00005701154,0.000002820456,0.00001467621,0.000003937202,0.000007016077],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3323085,"threshold_uncertainty_score":0.4306206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402456376","doi":"10.1007/s00037-016-0124-0","title":"The Minimum Oracle Circuit Size Problem","year":2016,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Circuit complexity; Complexity class; Mathematics; Kolmogorov complexity; Bounded function; Discrete mathematics; Variety (cybernetics); Function (biology); Computational complexity theory; Combinatorics; Random oracle; PSPACE; Computer science; Time complexity; Algorithm; Electronic circuit; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0570498075827662,"gpt":0.2727287421032747,"spread":0.2156789345205085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009773539,0.0002837215,0.0002731787,0.00006084559,0.000857643,0.0004010416,0.002284273,0.00007005476,0.00008922511],"category_scores_gemma":[0.0003970441,0.0001731872,0.0001716687,0.0005745467,0.0006021037,0.0005145274,0.001009702,0.000177493,0.0004193893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000216123,"about_ca_system_score_gemma":0.000286148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000218512,"about_ca_topic_score_gemma":0.00002780021,"domain_scores_codex":[0.9968477,0.000335628,0.0005694438,0.0008036304,0.0008412541,0.0006023115],"domain_scores_gemma":[0.9937636,0.004317248,0.0002210698,0.0009443492,0.0005440687,0.0002097001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001656197,0.0002094614,0.001303133,0.00001587888,0.00004671085,0.00001295441,0.0002577291,0.001181871,0.0001754965,0.7890673,0.003514086,0.2041989],"study_design_scores_gemma":[0.0005397649,0.00008010831,0.08092336,0.00001661912,0.000003818883,0.00004575399,0.00000707416,0.06780775,0.00004954304,0.8412884,0.008955023,0.0002827181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01827149,0.0001362985,0.9627975,0.01333923,0.0007082861,0.00048223,0.00002083469,0.0005591777,0.003685021],"genre_scores_gemma":[0.8470244,0.000003848245,0.1517492,0.0004712429,0.0002124634,0.0000429676,0.000004214178,0.0000176763,0.0004739241],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8287529,"threshold_uncertainty_score":0.706237,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985813832","doi":"10.1007/s00037-013-0063-y","title":"Modular Composition Modulo Triangular Sets and Applications","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Modulo; Modular design; Elliptic curve; Mathematics; Modular arithmetic; Discrete mathematics; Exponential function; Computer science; Algorithm; Cryptography; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02752373217021198,"gpt":0.2556594102718284,"spread":0.2281356781016164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000146007,0.0001791446,0.0001977038,0.000135969,0.0003709147,0.0003147685,0.0004356994,0.00005202789,0.00004602535],"category_scores_gemma":[0.00001065145,0.0001852198,0.0000643792,0.0003457849,0.000143521,0.0007186696,0.0002657111,0.0001249929,0.0002278857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005245577,"about_ca_system_score_gemma":0.00005272013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007041218,"about_ca_topic_score_gemma":0.000001951528,"domain_scores_codex":[0.9985634,0.0001004889,0.0003124851,0.0004735834,0.000309496,0.0002405134],"domain_scores_gemma":[0.9990166,0.0001737321,0.0001182445,0.0002934736,0.0002196068,0.0001782987],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006239687,0.0001952921,0.0003054788,0.00003620806,0.00004327039,0.000003130496,0.0002435194,0.03134605,0.001242414,0.8325468,0.001135149,0.1328965],"study_design_scores_gemma":[0.0002942855,0.00002290849,0.0620741,0.00000561769,0.00000318673,0.00002258929,0.000003936214,0.5001253,0.00004856061,0.4369423,0.0003194675,0.0001376665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1514539,0.0001258168,0.8450317,0.001884804,0.0001105763,0.0005555817,0.00001072363,0.0002526667,0.0005743348],"genre_scores_gemma":[0.8757231,0.000001886486,0.1232969,0.0006110606,0.0001031054,0.0001203243,0.0001076516,0.000008714011,0.00002730584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7242693,"threshold_uncertainty_score":0.7553046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004004688","doi":"10.1007/s00037-002-0171-6","title":"Homogenization and the polynomial calculus","year":2002,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Homogenization (climate); Polynomial; Degree (music); Combinatorics; Discrete mathematics; Calculus (dental); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0360283342793621,"gpt":0.2313772949803246,"spread":0.1953489607009625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002344952,0.000130145,0.0001567435,0.00006857461,0.0004383758,0.000236805,0.0004475733,0.00003242484,0.00005090651],"category_scores_gemma":[0.00005727928,0.00009732632,0.00006318719,0.0003333511,0.0003624228,0.0003173294,0.0002723198,0.0001123021,0.00008612416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003155249,"about_ca_system_score_gemma":0.00002203228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005207037,"about_ca_topic_score_gemma":0.000007212096,"domain_scores_codex":[0.9988419,0.0001524703,0.000242135,0.0003017505,0.0002747078,0.000187061],"domain_scores_gemma":[0.9991857,0.0003265671,0.00009592587,0.0002109254,0.00009728461,0.00008362342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001992512,0.000056327,0.0001932387,0.000006771236,0.00002507268,0.000003634742,0.0009682483,0.008587355,0.000007278928,0.918649,0.005200112,0.06628301],"study_design_scores_gemma":[0.001163493,0.0000191713,0.009783586,0.000003274978,0.000004815298,0.00003834613,0.000004791716,0.8682162,0.000008379957,0.1190835,0.001556661,0.0001177938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06032298,0.0004314275,0.9245144,0.01072342,0.0003622443,0.0002442901,0.000005548015,0.0002009092,0.003194779],"genre_scores_gemma":[0.9824585,0.000005492615,0.01612183,0.001090457,0.00015669,0.00001046521,0.00001084172,0.000005879123,0.0001398846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9221355,"threshold_uncertainty_score":0.3968852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2789382863","doi":"10.1007/978-1-4614-1800-9_35","title":"Complex Gene Regulatory Networks – from Structure to Biological Observables: Cell Fate Determination","year":2011,"lang":"en","type":"book-chapter","venue":"Computational Complexity","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Terminology; Glossary; Gene regulatory network; Boolean network; Systems biology; Computer science; Subject (documents); Computational biology; And-inverter graph; Observable; Network dynamics; Biology; Theoretical computer science; Gene; Boolean function; Boolean expression; Mathematics; Genetics; Gene expression; Philosophy; Library science; Linguistics; Algorithm; Physics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06614006773660074,"gpt":0.2506371343267032,"spread":0.1844970665901025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001474317,0.0006678458,0.0006646542,0.0001329927,0.0002481474,0.00005492708,0.0006613552,0.0007884181,0.0009921398],"category_scores_gemma":[0.0000150359,0.0006954699,0.0003959881,0.00007717887,0.0003139573,0.000006121776,0.0005365458,0.0003103199,0.00007207529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009725212,"about_ca_system_score_gemma":0.0001163295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002436284,"about_ca_topic_score_gemma":0.00009889201,"domain_scores_codex":[0.9972206,0.0001201157,0.0006488858,0.001205867,0.0004025062,0.0004020529],"domain_scores_gemma":[0.9979596,0.00005076597,0.000457549,0.0008016648,0.0004325892,0.0002979028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001232945,0.000383136,0.003606036,0.0001382296,0.002293698,0.000103549,0.0002699965,0.7753528,0.09428371,0.03446282,0.0581298,0.02974325],"study_design_scores_gemma":[0.002385487,0.001221029,0.2258029,0.0002098462,0.0008372538,0.00007153169,0.00001761745,0.103598,0.007782026,0.4844104,0.1681758,0.005488094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5064638,0.004913232,0.4368357,0.0001938429,0.001343675,0.002159952,0.004122343,0.0002797106,0.04368773],"genre_scores_gemma":[0.9224965,0.00005715793,0.03956231,0.0009144812,0.001404899,0.00001462485,0.02387926,0.0001241463,0.01154661],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6717548,"threshold_uncertainty_score":0.9999211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083633130","doi":"10.1007/s00037-013-0065-9","title":"Parallel Approximation of Min-Max Problems","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"PSPACE; Multiplicative function; Mathematical proof; Mathematics; Class (philosophy); Matrix (chemical analysis); Complexity class; Discrete mathematics; Combinatorics; Computational complexity theory; Time complexity; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03443949735732771,"gpt":0.2506904739364064,"spread":0.2162509765790787,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002042887,0.0001609015,0.0002259045,0.0001210982,0.0001589911,0.0001161981,0.0007241933,0.00004500759,0.000044447],"category_scores_gemma":[0.00003235518,0.0001458413,0.00009375947,0.0003860697,0.000145807,0.000310588,0.0002727576,0.0001472663,0.00009848872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002348434,"about_ca_system_score_gemma":0.00006852593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001001222,"about_ca_topic_score_gemma":0.000002538481,"domain_scores_codex":[0.9984828,0.00009475435,0.0004009547,0.0003541211,0.0004254828,0.0002418504],"domain_scores_gemma":[0.9988473,0.0001877445,0.0002176901,0.0003301625,0.0003233411,0.00009373003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002744057,0.0001845782,0.0004937422,0.00008190574,0.00002896071,0.00000121784,0.0007336643,0.7263284,0.0002229221,0.2401704,0.001284276,0.03046723],"study_design_scores_gemma":[0.0001858273,0.00004507127,0.02510706,0.00002054464,0.00000139012,0.00001093483,0.000004223926,0.6333899,0.00003675318,0.3409672,0.000124024,0.0001070683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1362979,0.00006749187,0.860675,0.00116833,0.0001476523,0.0003224495,0.000004521904,0.0001632294,0.001153479],"genre_scores_gemma":[0.573792,4.456655e-7,0.4259753,0.0001246922,0.0000399133,0.00001511313,0.00002017335,0.000005551542,0.00002675486],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4374942,"threshold_uncertainty_score":0.5947233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029495732","doi":"10.1007/s00037-014-0084-1","title":"On the Power of Non-adaptive Learning Graphs","year":2014,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"European Social Fund; Latvijas Universitate; National Science Foundation","keywords":"Certificate; Computer science; Bounded function; Theoretical computer science; Discrete mathematics; Mathematics; Graph; Upper and lower bounds; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02480002062436096,"gpt":0.2534712184792243,"spread":0.2286711978548634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005245308,0.0001465112,0.0001814212,0.00009670521,0.0003570009,0.0000615645,0.0007815071,0.00003118613,0.0000212689],"category_scores_gemma":[0.000122958,0.0001028703,0.000113172,0.0003816784,0.0002033034,0.00006385519,0.0002493426,0.0003218038,0.00003446905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001364122,"about_ca_system_score_gemma":0.00004031234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001302416,"about_ca_topic_score_gemma":9.354492e-7,"domain_scores_codex":[0.9985915,0.0002462432,0.0002261549,0.0003083459,0.000426932,0.0002007519],"domain_scores_gemma":[0.9979787,0.001314307,0.0001658593,0.0003146254,0.0001685737,0.00005787436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005864898,0.00003770488,0.00008183995,0.000002813729,0.00001241054,6.387501e-7,0.0003996088,0.299958,0.00001565902,0.6953251,0.0002635151,0.00389689],"study_design_scores_gemma":[0.0001098542,0.0001915692,0.01991915,0.00001608004,0.000001090801,0.000004034168,0.000007750827,0.5913401,0.00003249793,0.3881886,0.0001142284,0.00007505962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2985592,0.000006862959,0.697609,0.000887185,0.0001471773,0.00008278748,0.000001828169,0.0000728825,0.00263315],"genre_scores_gemma":[0.9352565,1.306456e-7,0.06414158,0.0005399558,0.00003108777,0.000002975528,0.000003623377,0.000007143316,0.00001697463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6366974,"threshold_uncertainty_score":0.4194928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081819660","doi":"10.1007/s00037-013-0078-4","title":"The NOF Multiparty Communication Complexity of Composed Functions","year":2014,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Communication complexity; Computer science; Theoretical computer science; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1529854115902224,"gpt":0.3443344110008818,"spread":0.1913489994106594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055273,0.0001631246,0.0002651346,0.00005856557,0.001286332,0.00004546465,0.0005861529,0.00005243775,0.00008303187],"category_scores_gemma":[0.0003464886,0.0001316964,0.0001530801,0.0003085587,0.001623364,0.0000858245,0.0001579425,0.000221725,0.00005430101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003202267,"about_ca_system_score_gemma":0.00003771038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003409198,"about_ca_topic_score_gemma":0.0001395753,"domain_scores_codex":[0.9981517,0.0005356881,0.0005665285,0.000216789,0.0003273316,0.0002019794],"domain_scores_gemma":[0.9947969,0.003538784,0.0003701152,0.0007691776,0.000444997,0.00008001884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003343007,0.0002243339,0.0004947232,0.00002346782,0.00003200972,3.265198e-8,0.0001546201,0.001185567,0.000119733,0.9942731,0.002789902,0.0006690655],"study_design_scores_gemma":[0.000442105,0.00003264729,0.03267581,0.00001646276,0.00002535791,0.000003984276,0.00008895978,0.06011128,0.00009899127,0.9015948,0.004784585,0.0001250655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6434135,0.0000738231,0.33576,0.003740334,0.0001793432,0.0008226613,0.0001898054,0.0002855891,0.01553488],"genre_scores_gemma":[0.9484652,0.000002002199,0.0510059,0.0001018115,0.00003960573,0.0000466616,0.0001996851,0.00001595059,0.0001231472],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3050517,"threshold_uncertainty_score":0.9893553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981850523","doi":"10.1007/s00037-007-0222-0","title":"The Complexity of Tensor Circuit Evaluation","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Semiring; Mathematics; Discrete mathematics; Combinatorics; Tensor (intrinsic definition); Boolean circuit; Matrix exponential; Kleene algebra; Complexity class; Diagonal; Matrix (chemical analysis); Boolean function; Time complexity; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1695895696351608,"gpt":0.3361128090989626,"spread":0.1665232394638017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00384101,0.0002226291,0.0002806396,0.0001795528,0.0009412638,0.0001612006,0.001666367,0.00006562689,0.0000586093],"category_scores_gemma":[0.0002682352,0.0001853021,0.0001999677,0.0009584659,0.001716903,0.0003308707,0.0004286594,0.0002662128,0.0000387537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000126727,"about_ca_system_score_gemma":0.0002236786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006577333,"about_ca_topic_score_gemma":0.0001254851,"domain_scores_codex":[0.9965484,0.0002729031,0.0007536762,0.0004808389,0.00146729,0.0004769082],"domain_scores_gemma":[0.9963594,0.001175428,0.000374017,0.0007595663,0.001185651,0.0001459303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001798638,0.0001130281,0.0006870598,0.00001164069,0.00003698652,0.000002365279,0.0002278241,0.002118387,0.00004447623,0.9427052,0.0003924764,0.0536426],"study_design_scores_gemma":[0.0003324834,0.00004639421,0.1364089,0.000009445025,0.000007483489,0.00001980407,0.00002976558,0.2892596,0.0001128435,0.5728528,0.0007868516,0.0001336642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03789704,0.0002761164,0.9515659,0.001698252,0.0007261313,0.0004905268,0.00002197533,0.0001725118,0.007151573],"genre_scores_gemma":[0.8986574,0.000002848795,0.1009177,0.0002171682,0.0001167287,0.00001104015,0.00003747964,0.000009651156,0.00003001744],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8607604,"threshold_uncertainty_score":0.7556399,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125063528","doi":"10.1007/s00037-013-0059-7","title":"Is Valiant–Vazirani’s isolation probability improvable?","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Alexander von Humboldt-Stiftung; National Science Foundation","keywords":"Lemma (botany); Combinatorics; Randomized algorithm; Discrete mathematics; Time complexity; Isolation (microbiology); Upper and lower bounds; Mathematics; Satisfiability; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.07230848095357204,"gpt":0.2775123517321614,"spread":0.2052038707785894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003959254,0.0002827485,0.0002919518,0.0001615519,0.0005366795,0.0004875415,0.00120698,0.00008986174,0.0007870561],"category_scores_gemma":[0.00006219008,0.0002850769,0.0001938334,0.0007852116,0.0002901052,0.001340584,0.0004995295,0.0002792636,0.0007663555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001070523,"about_ca_system_score_gemma":0.0001452599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000274514,"about_ca_topic_score_gemma":0.00001347712,"domain_scores_codex":[0.9974001,0.0001646094,0.0005325418,0.0007836371,0.0006556235,0.0004634968],"domain_scores_gemma":[0.9979873,0.0002483663,0.0001867893,0.0007407529,0.0006344562,0.0002023568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001132002,0.0004807067,0.005029404,0.00009035014,0.00007200299,0.000003993822,0.0009441577,0.005314471,0.0002247762,0.9398738,0.01428334,0.03367168],"study_design_scores_gemma":[0.0002174774,0.0000441214,0.07492627,0.0000074675,0.000002622082,0.00001166578,0.000005288907,0.4216278,0.00005464512,0.5022903,0.0006244151,0.0001879796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0744851,0.00005145455,0.9154986,0.004828207,0.0004833503,0.0007097003,0.00002428863,0.0004956978,0.003423603],"genre_scores_gemma":[0.6180466,9.36517e-7,0.3803858,0.001233413,0.00009493266,0.00005114231,0.00003610721,0.00001073591,0.0001402852],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5435615,"threshold_uncertainty_score":0.9999601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028368516","doi":"10.1007/s00037-014-0091-2","title":"The complexity of estimating min-entropy","year":2014,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Logarithm; Entropy (arrow of time); Discrete mathematics; Markov chain; Sample complexity; Combinatorics; Computer science; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04906858431237536,"gpt":0.2960960510111065,"spread":0.2470274666987312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008515268,0.0001471048,0.000223477,0.00005225918,0.0006908275,0.0001595742,0.00108211,0.00002808456,0.00001661794],"category_scores_gemma":[0.0003331934,0.0001119628,0.0001042859,0.0002810704,0.0006836495,0.00014307,0.00034839,0.0002146558,0.00004127025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002528371,"about_ca_system_score_gemma":0.00005721826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007160304,"about_ca_topic_score_gemma":0.00000822755,"domain_scores_codex":[0.9982164,0.0003274492,0.0003846725,0.0003042831,0.0005037037,0.0002635139],"domain_scores_gemma":[0.9980249,0.0009469921,0.0002659379,0.000436055,0.0002381179,0.00008796125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004215957,0.00003817208,0.0004479602,0.00001399805,0.00001362968,4.982996e-7,0.0001304828,0.05298032,0.00001662328,0.9233781,0.0004653117,0.02251066],"study_design_scores_gemma":[0.000161644,0.00004008265,0.01992925,0.000008854683,0.000001914992,0.000007799081,0.000003445453,0.5946943,0.00001854023,0.3836576,0.001400567,0.00007609987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01254109,0.00003721963,0.9808899,0.003321672,0.000501082,0.0001011444,0.000004827074,0.0001507565,0.002452331],"genre_scores_gemma":[0.552637,2.168573e-7,0.4470449,0.0001338721,0.0001186199,0.000003050999,0.00001181131,0.000004912891,0.00004567852],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5417139,"threshold_uncertainty_score":0.5313357,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006872837","doi":"10.1007/s00037-011-0016-2","title":"A Quantum Characterization Of NP","year":2011,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Complexity class; Class (philosophy); Quantum entanglement; Soundness; Completeness (order theory); Discrete mathematics; Quantum complexity theory; Characterization (materials science); Logarithm; Mathematics; Quantum; Context (archaeology); Combinatorics; Computer science; Quantum algorithm; Time complexity; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.06338483869152876,"gpt":0.25711491752253,"spread":0.1937300788310012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001958383,0.0001300413,0.0001885219,0.0001278766,0.0001232883,0.00003100039,0.0006555235,0.00003655524,0.00004103603],"category_scores_gemma":[0.00001935773,0.0001243565,0.00008072706,0.0003857431,0.0001280138,0.0001960933,0.0002375932,0.0001123646,0.00002551208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001357766,"about_ca_system_score_gemma":0.00006660457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002662429,"about_ca_topic_score_gemma":9.496312e-7,"domain_scores_codex":[0.9988316,0.00008690628,0.0003159213,0.0002954031,0.0002855119,0.0001846468],"domain_scores_gemma":[0.999173,0.0000652218,0.0001953141,0.0002938069,0.0001992048,0.00007346862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001726293,0.0002570722,0.001357825,0.00003510736,0.00003108324,0.000008577894,0.002048647,0.00287535,0.002009847,0.9783717,0.00007053444,0.01291694],"study_design_scores_gemma":[0.000155715,0.0000725619,0.1551649,0.00001153659,0.000002134618,0.00002346621,0.000002174394,0.6376622,0.0004536902,0.2062122,0.0001272385,0.0001122413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3809465,0.000007645748,0.6179493,0.0001473943,0.0001840749,0.00006942515,0.000009462823,0.0001155013,0.0005706361],"genre_scores_gemma":[0.8376825,5.020284e-7,0.1620511,0.0001751888,0.0000423606,0.000002737847,0.00002838618,0.00000655338,0.00001061378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7721596,"threshold_uncertainty_score":0.507111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977227483","doi":"10.1007/s00037-009-0266-4","title":"Space-Efficient Counting in Graphs on Surfaces","year":2009,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Modulo; Discrete mathematics; Algebraic number; Planar graph; Counting problem; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.0639715632429065,"gpt":0.3344310122917777,"spread":0.2704594490488712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006501749,0.0001630595,0.000189636,0.0003647128,0.0002192744,0.0001295874,0.0008003599,0.00003706565,0.00001675583],"category_scores_gemma":[0.00009169962,0.0001643355,0.00006611316,0.001128384,0.0001515679,0.0002105035,0.0001334432,0.0002774661,0.00008046707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009921866,"about_ca_system_score_gemma":0.00007336025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000011323,"about_ca_topic_score_gemma":0.000008319575,"domain_scores_codex":[0.9979746,0.0001742668,0.000264197,0.0004929585,0.0006911394,0.0004028591],"domain_scores_gemma":[0.9988694,0.0004399653,0.0000851724,0.0003443703,0.0001620549,0.0000990966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000141071,0.0001192516,0.0007018141,0.000002439741,0.00000212821,0.00001452506,0.0001040552,0.3730081,0.00004894079,0.624627,0.00005632036,0.001301308],"study_design_scores_gemma":[0.0002171553,0.0000696131,0.1268318,0.00001363756,2.982125e-7,0.000005162826,0.00000689337,0.3967496,0.00004638612,0.47591,0.0000493176,0.0001001227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6568571,0.00006438318,0.3360494,0.002117503,0.0001210807,0.0002287509,0.000005254381,0.0001729935,0.004383501],"genre_scores_gemma":[0.9462115,0.000001104984,0.05325783,0.0004711252,0.00001705484,0.000004112064,0.000008953378,0.000005550945,0.0000227918],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2893543,"threshold_uncertainty_score":0.6701407,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399132114","doi":"10.1007/s00037-018-0166-6","title":"The Landscape of Communication Complexity Classes","year":2018,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Computer science; Communication complexity; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.07522345276282445,"gpt":0.3108113691436064,"spread":0.2355879163807819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007708585,0.0001899841,0.000252602,0.0001141868,0.001406603,0.0002287854,0.002440371,0.00005372846,0.00007050388],"category_scores_gemma":[0.0001222246,0.0001532376,0.000140245,0.0008035728,0.00233945,0.0003630784,0.0008885439,0.0002236987,0.00006927585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003431757,"about_ca_system_score_gemma":0.0001429057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006752734,"about_ca_topic_score_gemma":0.0001883154,"domain_scores_codex":[0.9978736,0.0003250365,0.0005288681,0.0003631921,0.0005882421,0.0003210859],"domain_scores_gemma":[0.9965973,0.001066116,0.0003114687,0.001094928,0.0008328183,0.00009739745],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000182358,0.00009554365,0.0009128219,0.000008114895,0.00003415567,5.550298e-7,0.0002826277,0.0003268958,0.00001412106,0.9854612,0.003575021,0.009270744],"study_design_scores_gemma":[0.0002567318,0.0001209579,0.06641001,0.00001643664,0.000004257716,0.00001462636,0.00003670096,0.2837686,0.0001091728,0.6442502,0.004873034,0.000139305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06206445,0.0004944842,0.9123604,0.005406954,0.0006686623,0.0003645863,0.00004428951,0.0003437048,0.01825252],"genre_scores_gemma":[0.8369026,0.00001380655,0.1626255,0.0002485031,0.0001076678,0.000009907353,0.00003560059,0.00000799611,0.00004847109],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7748381,"threshold_uncertainty_score":0.9998934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3198583770","doi":"10.1007/s00037-023-00241-0","title":"The Power of Natural Properties as Oracles","year":2023,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Combinatorics; Mathematics; Discrete mathematics; Randomized algorithm; Upper and lower bounds; Random oracle; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06434584726470818,"gpt":0.2889815742905184,"spread":0.2246357270258102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004419676,0.0001345467,0.000161703,0.0001213355,0.0006470603,0.0001709124,0.001247122,0.00002741391,0.00001549886],"category_scores_gemma":[0.0001388913,0.00009477321,0.0001201219,0.0009745824,0.0005490315,0.0002654188,0.0006124328,0.0001682148,0.0001827621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002173599,"about_ca_system_score_gemma":0.0001216563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003410929,"about_ca_topic_score_gemma":0.00001317744,"domain_scores_codex":[0.9984352,0.0001165667,0.0003105144,0.0002806847,0.0005814693,0.0002755712],"domain_scores_gemma":[0.9986136,0.000493694,0.000120368,0.0004056511,0.0003099353,0.00005672743],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001683147,0.00004237219,0.0001696892,0.00001437955,0.00003550016,0.000006118008,0.0007032724,0.003642781,0.0001085871,0.9829648,0.002633536,0.009662151],"study_design_scores_gemma":[0.0001593851,0.00005292248,0.0405492,0.00001773624,0.000001853393,0.00001758379,0.00008789256,0.3211062,0.0002460376,0.6348342,0.002796151,0.0001307924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8624194,0.001154557,0.1148196,0.01228963,0.002602096,0.0005956864,0.00002891291,0.00126414,0.004826037],"genre_scores_gemma":[0.9862307,0.000006691429,0.0132616,0.0001964511,0.00003881581,0.00001090051,0.00001259488,0.000007197534,0.0002350583],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3481306,"threshold_uncertainty_score":0.497673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4376504252","doi":"10.1007/s00037-023-00236-x","title":"Schur Polynomials Do Not Have Small Formulas If the Determinant does not","year":2023,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Algebra over a field; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1721085439913326,"gpt":0.366638139190427,"spread":0.1945295951990944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008812026,0.000334075,0.0004909749,0.0001386093,0.0006951571,0.0001586315,0.0007304888,0.0001048016,0.00008018528],"category_scores_gemma":[0.001316907,0.0002211221,0.0002122655,0.0003286003,0.0002999499,0.0001522711,0.0004980132,0.0003093487,0.0003030535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001341644,"about_ca_system_score_gemma":0.00009723872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001483012,"about_ca_topic_score_gemma":0.00004820284,"domain_scores_codex":[0.9974837,0.0001752743,0.0007408902,0.0004213217,0.0006774471,0.000501407],"domain_scores_gemma":[0.9944723,0.004065668,0.0003929802,0.0006317969,0.0003123619,0.0001249059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007279108,0.0001363684,0.0001414589,0.0001663847,0.00006748089,0.0000219072,0.0009897867,0.002642034,0.0002663097,0.9926066,0.001436858,0.00145204],"study_design_scores_gemma":[0.0006558558,0.00005274656,0.003369714,0.00005863597,0.00003599462,0.00002115794,0.000191626,0.04704864,0.001653194,0.9456241,0.0009799511,0.0003084397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9181822,0.00001338271,0.07401799,0.002597495,0.001424629,0.00117605,0.0001991434,0.000716136,0.001673],"genre_scores_gemma":[0.9545352,0.000002208701,0.0440536,0.0002463683,0.0003669344,0.00007873515,0.00003792885,0.00006366091,0.000615365],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04698253,"threshold_uncertainty_score":0.9017097,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2805918291","doi":"10.1007/s00037-022-00231-8","title":"Quantum generalizations of the polynomial hierarchy with applications to QMA(2)","year":2022,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"","keywords":"Hierarchy; Computer science; Quantum; Polynomial; Polynomial hierarchy; Quantum computer; Theoretical computer science; Mathematics; Algorithm; Time complexity; Quantum mechanics; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02945818609854594,"gpt":0.2619659994610362,"spread":0.2325078133624903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001949064,0.0001322317,0.0001567902,0.0001341742,0.001114389,0.00005827682,0.001447464,0.00001397315,0.00002934391],"category_scores_gemma":[0.00001164356,0.0001027718,0.0000822993,0.001393974,0.0001460727,0.00006368315,0.001102844,0.0002176016,0.00000554357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006437732,"about_ca_system_score_gemma":0.0002627021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006284394,"about_ca_topic_score_gemma":0.00001083317,"domain_scores_codex":[0.9983759,0.0001919496,0.0002639051,0.0003652722,0.0005908209,0.0002121622],"domain_scores_gemma":[0.9989333,0.0001404185,0.0001491456,0.0005271955,0.0001589332,0.00009099085],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000650872,0.00008111957,0.0004362758,0.000004744146,0.00001238727,6.23971e-7,0.0003347901,0.7308908,0.00004345447,0.2653372,0.001078733,0.001773412],"study_design_scores_gemma":[0.0002508136,0.0001271056,0.02562725,0.000005740636,0.000005057949,0.0000503172,0.00001872254,0.9010755,0.00004351844,0.06048813,0.01214446,0.0001633371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1184365,0.00002608785,0.8758381,0.004680849,0.0001815503,0.0004284282,0.00007725684,0.00009857325,0.0002326253],"genre_scores_gemma":[0.8373258,1.021379e-7,0.1614464,0.0009663763,0.00007773562,0.00009830869,0.00002585201,0.00001019054,0.0000491584],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7188894,"threshold_uncertainty_score":0.8571094,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1205694693","doi":"10.1007/s00037-009-0263-7","title":"The Black-Box Query Complexity of Polynomial Summation","year":2009,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Toronto","funders":"","keywords":"Combinatorics; Degree (music); Mathematics; Polynomial; Field (mathematics); Discrete mathematics; Finite field; Connection (principal bundle); Physics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05658031693308873,"gpt":0.2870780996604076,"spread":0.2304977827273189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007197371,0.0002640039,0.0003469019,0.0001592297,0.000850029,0.0002617179,0.001750149,0.00007411942,0.00002662192],"category_scores_gemma":[0.0001019515,0.0002248762,0.0002410489,0.0007614688,0.001354508,0.0005109673,0.0003179719,0.000292531,0.00004588269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008392837,"about_ca_system_score_gemma":0.0001831106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006290501,"about_ca_topic_score_gemma":0.00004564858,"domain_scores_codex":[0.9973066,0.0002694729,0.0007183639,0.0004812879,0.000793601,0.000430604],"domain_scores_gemma":[0.9977003,0.0006066193,0.0003662991,0.0007381534,0.0004480706,0.0001405287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003754714,0.0001804449,0.0001829004,0.00001188862,0.00002875084,0.000002910632,0.0003918962,0.004712801,0.00007754764,0.9644321,0.003557801,0.02638343],"study_design_scores_gemma":[0.0003599621,0.0001202901,0.07394475,0.00001537882,0.000004838696,0.00001416479,0.00002621449,0.3257175,0.0002072709,0.59772,0.001677196,0.0001923998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06220251,0.0001908277,0.9222826,0.009139381,0.0006632923,0.0004195984,0.00004741135,0.0003217681,0.004732607],"genre_scores_gemma":[0.8770367,0.000007627465,0.1221758,0.0005011583,0.0001639723,0.000004750594,0.00005208465,0.000007492622,0.00005043556],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8148342,"threshold_uncertainty_score":0.9170186,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3040249201","doi":"10.1007/s00037-024-00250-7","title":"KRW Composition Theorems via Lifting","year":2024,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation; Vetenskapsrådet; Natural Sciences and Engineering Research Council of Canada; European Commission; McGill University; Lunds Universitet","keywords":"Composition (language); Mathematics; Discrete mathematics; Combinatorics; Computer science; Linguistics; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.03902938089658899,"gpt":0.2868357387671615,"spread":0.2478063578705725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004683886,0.0002330553,0.000215981,0.0002630414,0.0004830363,0.0006897009,0.0009024198,0.00006138746,0.0001322311],"category_scores_gemma":[0.00001635764,0.0002334781,0.0001858297,0.00092228,0.0002655113,0.0007119064,0.0004177484,0.000331109,0.0003689136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008990394,"about_ca_system_score_gemma":0.0001022407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002644363,"about_ca_topic_score_gemma":0.000003749412,"domain_scores_codex":[0.9979391,0.00014973,0.0003759095,0.0006345898,0.0005516778,0.0003490634],"domain_scores_gemma":[0.9987454,0.0005099815,0.00006456826,0.0003784286,0.0001653293,0.0001362452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003992794,0.00006629863,0.00004825594,0.00004290465,0.00003758799,0.0000361538,0.0003359907,0.006322994,0.0001482928,0.9525148,0.0009940091,0.03944869],"study_design_scores_gemma":[0.00008372384,0.00002817232,0.002338795,0.0000399281,0.000003868499,0.00008819436,0.000003603388,0.5116644,0.00006164816,0.4840134,0.00151543,0.0001587678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009959347,0.0004882514,0.9793483,0.002201692,0.00123425,0.0001763438,0.00002194442,0.001164105,0.005405755],"genre_scores_gemma":[0.798473,0.000002291184,0.2006383,0.0004726136,0.0002629292,0.00001151735,0.0000855162,0.00001470268,0.00003913871],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7885137,"threshold_uncertainty_score":0.952096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2928599599","doi":"10.1007/s00037-021-00210-5","title":"Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity","year":2021,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Hierarchy; Randomness; Theoretical computer science; Boolean function; Product term; Boolean expression; Computer science; Mathematics; Communication complexity; Discrete mathematics; Parity function; Standard Boolean model; And-inverter graph; Two-element Boolean algebra; Algebra over a field","retraction":null,"screen_n_in":null,"score":{"opus":0.04733840846881324,"gpt":0.2910149454861005,"spread":0.2436765370172872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007422192,0.0001822391,0.0005500379,0.0001087012,0.0002594299,0.0002903056,0.0005415565,0.00005172587,0.000022888],"category_scores_gemma":[0.0001933689,0.0001874339,0.00009215385,0.0004441915,0.0006293365,0.0003378831,0.0004672543,0.0002259942,0.00001799487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005454835,"about_ca_system_score_gemma":0.0001460452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000955202,"about_ca_topic_score_gemma":0.0001593901,"domain_scores_codex":[0.9976573,0.0007537387,0.0005665838,0.0004532688,0.0003250272,0.0002441043],"domain_scores_gemma":[0.9981287,0.0008419682,0.0001604228,0.0005192513,0.0002439247,0.000105766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002590223,0.0001288756,0.000774685,0.000046145,0.00002044518,0.00003479195,0.000630277,0.001947536,0.00001405671,0.9922927,0.0002448172,0.003606644],"study_design_scores_gemma":[0.01213792,0.00001148597,0.03887779,0.00005977343,0.000004185809,0.00007593848,0.00003487631,0.4607395,0.0000110355,0.487313,0.0005516874,0.0001828045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1114709,0.001119937,0.8781033,0.003226183,0.0001930406,0.0004105409,0.00006512937,0.0001554021,0.005255595],"genre_scores_gemma":[0.9075318,0.00001785591,0.09174912,0.0003988302,0.00002216697,0.00002856488,0.0001808156,0.000006800817,0.00006405622],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7960609,"threshold_uncertainty_score":0.7643333,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3021390709","doi":"10.1007/s00037-020-00204-9","title":"Subquadratic-Time Algorithms for Normal Bases","year":2021,"lang":"en","type":"preprint","venue":"Computational Complexity","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Normal basis; Basis (linear algebra); Combinatorics; Galois group; Abelian group; Invertible matrix; Mathematics; Physics; Discrete mathematics; Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.07333356916538013,"gpt":0.3050625484096439,"spread":0.2317289792442638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004121484,0.0004019402,0.0005532961,0.0002525002,0.0004331523,0.0007819568,0.001475879,0.0002092682,0.0001184239],"category_scores_gemma":[0.0000977643,0.0004250241,0.0005462021,0.0004131831,0.0002383092,0.0002904041,0.001734586,0.0004529364,0.00003498529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006727904,"about_ca_system_score_gemma":0.0006263287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005565462,"about_ca_topic_score_gemma":0.00001720132,"domain_scores_codex":[0.9971771,0.0001997254,0.0005587288,0.001017511,0.000611842,0.0004351366],"domain_scores_gemma":[0.9972221,0.0007925807,0.0002761596,0.0007708404,0.0007525634,0.0001857413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007306838,0.001551218,0.0007174486,0.001317059,0.000932358,0.0001706894,0.001936157,0.4515918,0.0001427875,0.4832442,0.01323999,0.04508329],"study_design_scores_gemma":[0.0003855808,0.00006018066,0.01040394,0.00008109044,0.00002846559,0.00003043384,0.00001109832,0.7296293,0.00008571877,0.2582168,0.0006251935,0.0004421349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01603291,0.0004802494,0.9790822,0.001571832,0.001067968,0.0006348446,0.0002055451,0.0003144475,0.0006100226],"genre_scores_gemma":[0.1717052,0.000005876345,0.8257752,0.0006135111,0.0003429609,0.0001272571,0.001298259,0.00002578789,0.00010595],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2780376,"threshold_uncertainty_score":0.9998202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124396273","doi":"10.1007/s00037-013-0064-x","title":"Lifting lower bounds for tree-like proofs","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Mathematical proof; Proof complexity; Mathematics; Constant (computer programming); Upper and lower bounds; Bounded function; Discrete mathematics; Sequent; Tree (set theory); Sequent calculus; Hierarchy; Combinatorics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0681648188073247,"gpt":0.2876902495246916,"spread":0.2195254307173669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003241088,0.0001787484,0.0002182213,0.00008046278,0.0003921204,0.0005219514,0.0007090638,0.00006175881,0.0000482971],"category_scores_gemma":[0.00005668731,0.0001606997,0.0001324982,0.0002607402,0.0001172416,0.0005027525,0.0002095722,0.0001066963,0.000284869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006100781,"about_ca_system_score_gemma":0.0001127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008591873,"about_ca_topic_score_gemma":0.00002443991,"domain_scores_codex":[0.9984108,0.00006869899,0.0003405732,0.0004574985,0.000346275,0.0003761489],"domain_scores_gemma":[0.9987003,0.0002450572,0.0001582413,0.0003181066,0.0004460115,0.0001323385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006098787,0.0001409359,0.001052069,0.00005389214,0.00003254259,0.000002384245,0.0004313433,0.0009230119,0.00002522544,0.9556435,0.008042841,0.03364613],"study_design_scores_gemma":[0.0004071762,0.0001452908,0.009872139,0.000003791643,0.000003596941,0.00001597583,0.00001649022,0.3551161,0.0000141577,0.6117195,0.02246364,0.0002220598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008252052,0.00008556888,0.9838758,0.0007796063,0.001033439,0.0007504805,0.000002638108,0.0003279613,0.004892512],"genre_scores_gemma":[0.8775916,1.842402e-7,0.1209254,0.0005224654,0.0002518631,0.0001437627,0.00004165972,0.00001222491,0.0005107902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8693396,"threshold_uncertainty_score":0.6553144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W316638553","doi":"10.1007/s00037-008-0252-2","title":"On the Complexity of Succinct Zero-Sum Games","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Game complexity; Mathematics; Multiplicative function; Zero-sum game; Zero (linguistics); Complement (music); Discrete mathematics; Combinatorics; PSPACE; Value (mathematics); Combinatorial game theory; Class (philosophy); P; Complexity class; Time complexity; Computational complexity theory; Repeated game; Game theory; Computer science; Algorithm; Mathematical economics; Average-case complexity","retraction":null,"screen_n_in":null,"score":{"opus":0.08495536218311425,"gpt":0.2882672099705096,"spread":0.2033118477873953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006914148,0.0003090834,0.0003921013,0.0001950434,0.0005661559,0.0001526461,0.002072928,0.00006675757,0.0003154875],"category_scores_gemma":[0.0001376297,0.000242069,0.0002689518,0.0007617197,0.001417446,0.0003599219,0.0005908431,0.0003884404,0.0001827073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008478186,"about_ca_system_score_gemma":0.0001299704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007592309,"about_ca_topic_score_gemma":0.00004281501,"domain_scores_codex":[0.9971755,0.0003066295,0.0006022408,0.000578527,0.0009155673,0.0004215225],"domain_scores_gemma":[0.9973446,0.0009502349,0.0002950032,0.0009242514,0.0003457952,0.0001401212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001882774,0.0002714585,0.0001291545,0.00001314712,0.0000391812,0.00000225288,0.0002476429,0.01415908,0.00002065187,0.9723073,0.004441397,0.008349938],"study_design_scores_gemma":[0.0003100538,0.00009450181,0.03296119,0.00002312866,0.000004690929,0.00001648953,0.000009467255,0.315879,0.0002229432,0.6486314,0.001652692,0.000194404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1347377,0.000127078,0.8368512,0.0183749,0.000429127,0.0004431789,0.00008303401,0.0003196135,0.00863414],"genre_scores_gemma":[0.8724818,0.000002257693,0.1254413,0.001830992,0.0001176041,0.00001428388,0.00002862525,0.00001258027,0.00007048486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7377441,"threshold_uncertainty_score":0.9871288,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395991959","doi":"10.1007/s00037-017-0156-0","title":"The Average Sensitivity of Bounded-Depth Formulas","year":2017,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley","keywords":"Bounded function; Omega; Lemma (botany); Mathematics; Boolean function; Combinatorics; Upper and lower bounds; Sensitivity (control systems); Parity (physics); Function (biology); Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.06812620353572955,"gpt":0.3095869109771868,"spread":0.2414607074414572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001122379,0.0001710358,0.0002338026,0.00005761844,0.00295013,0.0006594813,0.001733623,0.00004421637,0.000008612183],"category_scores_gemma":[0.0002680098,0.0001386201,0.0001792164,0.0001285289,0.0009990749,0.0006041771,0.001055626,0.0002107323,0.00002746195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004022433,"about_ca_system_score_gemma":0.0001353215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001761005,"about_ca_topic_score_gemma":0.000337046,"domain_scores_codex":[0.9982312,0.0001926567,0.0003381596,0.0003558583,0.0005713628,0.0003107065],"domain_scores_gemma":[0.9970241,0.000912213,0.00039456,0.001231753,0.0003422193,0.00009519616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001114782,0.00006628954,0.001666789,0.000009690822,0.00003281101,0.00001069436,0.0001267426,0.002160763,0.000024249,0.9667726,0.0003645722,0.02875371],"study_design_scores_gemma":[0.0001791916,0.00002300488,0.1825456,0.000008504569,0.000001575633,0.00002070265,0.000003445038,0.3540547,0.00008978222,0.4614097,0.001568573,0.00009517973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06194871,0.0000600516,0.9275647,0.002318593,0.0006636795,0.0001876027,0.00002353282,0.0001105676,0.007122537],"genre_scores_gemma":[0.9313225,0.000005625642,0.0683644,0.0001279316,0.00008741315,0.000004651564,0.000008480822,0.000006817496,0.00007221602],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8693737,"threshold_uncertainty_score":0.9983479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099449032","doi":"10.1007/s00037-011-0032-2","title":"Special Issue In Memory of Misha Alekhnovich. Foreword","year":2011,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Lomonosov Moscow State University","keywords":"Computer science; Mathematics; Discrete mathematics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1097443115070456,"gpt":0.3271698014169991,"spread":0.2174254899099535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004520458,0.0001383957,0.0002414869,0.0003026164,0.00007860576,0.0000218834,0.001153783,0.00004782341,0.0005651791],"category_scores_gemma":[0.000081083,0.0001475223,0.00007888533,0.0007672007,0.0003715301,0.0004104638,0.0004168737,0.000205608,0.0000992054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005308319,"about_ca_system_score_gemma":0.0001128891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005872902,"about_ca_topic_score_gemma":0.00007889873,"domain_scores_codex":[0.9983115,0.000148258,0.0003826871,0.000381927,0.000472315,0.000303337],"domain_scores_gemma":[0.9989079,0.0002393082,0.0001228061,0.000400344,0.0002325964,0.00009699706],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000103214,0.0003446852,0.006554551,0.00004137273,0.0000209042,0.00004826765,0.002179213,0.003633087,0.00003802272,0.9645401,0.0024241,0.02007243],"study_design_scores_gemma":[0.0004806725,0.00008618389,0.1209349,0.00001708214,0.000001211237,0.00001395976,0.00003581431,0.03448211,0.000319153,0.842517,0.000959791,0.0001521148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1631403,0.00008381562,0.7032804,0.0004038114,0.0008598058,0.0005716824,0.00002903853,0.0001639493,0.1314673],"genre_scores_gemma":[0.7235157,0.00000133378,0.2756476,0.0001542773,0.000487488,0.00001167967,0.00001359393,0.00001141613,0.0001569579],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5603755,"threshold_uncertainty_score":0.6188315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4415590863","doi":"10.1007/s00037-025-00278-3","title":"Separation of the Factorization Norm and Randomized Communication Complexity","year":2025,"lang":"en","type":"article","venue":"Computational Complexity","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Vancouver Island University; University of Victoria; Island Health; McGill University","funders":"University of Toronto; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Communication complexity; Upper and lower bounds; Randomized algorithm; Norm (philosophy); Conjecture; Nondeterministic algorithm; Logarithm; Factorization; Boolean function","retraction":null,"screen_n_in":null,"score":{"opus":0.02315802691439623,"gpt":0.2658649143461981,"spread":0.2427068874318019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003759419,0.00009860803,0.0002488555,0.00006566969,0.0001886901,0.00002676335,0.0001685157,0.00004327739,0.00001580918],"category_scores_gemma":[0.00005396753,0.00007987425,0.00007502589,0.0002640074,0.0004303844,0.00009304271,0.00005666012,0.00009699944,0.000001837231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003120942,"about_ca_system_score_gemma":0.00001980653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002143525,"about_ca_topic_score_gemma":0.00002861832,"domain_scores_codex":[0.9990805,0.000285594,0.00033306,0.00009345634,0.0001338836,0.00007350551],"domain_scores_gemma":[0.9992068,0.0003604894,0.00008432563,0.0002044932,0.0001251165,0.00001875385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002953931,0.00002053691,0.001677878,0.0001072815,0.00006631944,2.448508e-8,0.0003687508,0.05892954,0.0001977906,0.9378712,0.0002274604,0.0002378895],"study_design_scores_gemma":[0.005224004,0.000003618843,0.05714762,0.00005060998,0.00002242713,0.000001216492,0.00003832514,0.3326391,0.0002863762,0.6043698,0.0001436779,0.00007314777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6874853,0.0004090666,0.3002466,0.000264672,0.0003779063,0.0006586298,0.00003841968,0.0001329992,0.01038643],"genre_scores_gemma":[0.9985272,0.000007036015,0.001265418,0.00004238012,0.00001054225,0.00001804122,0.00008500578,0.000005450678,0.00003891221],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3335013,"threshold_uncertainty_score":0.3257177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W256395497","doi":"10.1007/s00037-007-0231-z","title":"New Results on the Complexity of the Middle Bit of Multiplication","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Omega; Integer (computer science); Mathematics; Binary logarithm; Multiplication (music); Upper and lower bounds; Space (punctuation); Discrete mathematics; Arithmetic; Physics; Mathematical analysis; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.161328773084056,"gpt":0.2907668538330652,"spread":0.1294380807490092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005904019,0.0001994597,0.0002685158,0.0001055383,0.0003876952,0.00005348974,0.002228142,0.00005429045,0.00004988909],"category_scores_gemma":[0.0002017102,0.0001326,0.000239649,0.0009094338,0.0009681053,0.0001971863,0.000572719,0.0002684672,0.00003228268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005962079,"about_ca_system_score_gemma":0.0001883019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001794871,"about_ca_topic_score_gemma":0.0001032684,"domain_scores_codex":[0.9975874,0.0002605847,0.0006913482,0.0004184603,0.0008079082,0.0002343239],"domain_scores_gemma":[0.997036,0.0008779676,0.0005312418,0.001120011,0.0003504868,0.00008428928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003924751,0.0001944464,0.0001318591,0.00001333265,0.00002661933,1.503231e-7,0.0006893452,0.02122849,0.0001044319,0.9651608,0.003054328,0.009356951],"study_design_scores_gemma":[0.0006193276,0.00007550709,0.09786756,0.0000576648,0.000006487574,0.00000634629,0.00002055801,0.3683614,0.002104387,0.5283886,0.002345199,0.0001469741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1170499,0.0001156965,0.824591,0.04789259,0.0005675607,0.0009716057,0.0002442739,0.000182772,0.008384525],"genre_scores_gemma":[0.8410087,0.000001315051,0.1581725,0.000573756,0.0001160712,0.00000631414,0.00001894158,0.000007092346,0.00009531961],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7239587,"threshold_uncertainty_score":0.5407273,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2932807114","doi":"10.1007/s00037-019-00180-9","title":"Correction to: Query-to-Communication Lifting for PNP","year":2019,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Image (mathematics); Theoretical computer science; Information retrieval; Discrete mathematics; Algorithm; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04433134717812037,"gpt":0.3166030198724693,"spread":0.2722716726943489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005503799,0.0001582578,0.0002013146,0.0002334199,0.0003269764,0.0002232695,0.0009596115,0.00004361351,0.00001675835],"category_scores_gemma":[0.0002325111,0.000178949,0.00008558843,0.0006298019,0.0000231025,0.0002837323,0.0004075407,0.0001314091,0.0002564658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001199429,"about_ca_system_score_gemma":0.0000968445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004297309,"about_ca_topic_score_gemma":0.00001088493,"domain_scores_codex":[0.9985275,0.0001129728,0.0003404803,0.0004760451,0.0002835078,0.0002595383],"domain_scores_gemma":[0.9980414,0.000619782,0.0001325258,0.0005511813,0.0005118118,0.0001433371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002423964,0.00006715942,0.0008234461,0.00001590939,0.00001284849,1.854363e-7,0.0005774021,0.8223897,0.0000919466,0.1324927,0.03204999,0.01145443],"study_design_scores_gemma":[0.0002271063,0.0001434505,0.01064648,0.00005666081,0.000002048953,0.000005917199,0.00001015737,0.9320054,0.000227759,0.05061174,0.005830863,0.0002324143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01563027,0.00001885302,0.9761797,0.002274172,0.0009022009,0.0008013614,0.000006018066,0.0007165337,0.003470953],"genre_scores_gemma":[0.4783256,4.155021e-7,0.5199422,0.001240271,0.00004218984,0.00004146528,0.00004126014,0.000009523184,0.0003571417],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4626953,"threshold_uncertainty_score":0.729733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018522462","doi":"10.1007/s00037-007-0225-x","title":"Special Issue “Conference on Computational Complexity 2006” Guest Editors’ Foreword","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computational complexity theory; Theoretical computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.09065063507808688,"gpt":0.3221336832850516,"spread":0.2314830482069647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001906109,0.0008287203,0.0008641662,0.0005800663,0.001061635,0.0006439422,0.002811909,0.000273531,0.0009308336],"category_scores_gemma":[0.0002588722,0.0008868249,0.0003839353,0.001433826,0.001218137,0.0008780079,0.001251999,0.0009363266,0.00135694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006342036,"about_ca_system_score_gemma":0.0005198509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001428938,"about_ca_topic_score_gemma":0.0002095812,"domain_scores_codex":[0.9926121,0.00040029,0.001433793,0.001836353,0.002427545,0.001289948],"domain_scores_gemma":[0.9943802,0.001748552,0.0005528289,0.001151049,0.001487923,0.0006794719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00015619,0.001324982,0.001696905,0.00005879144,0.00009103386,0.0001031464,0.0007346129,0.06479219,0.000007849385,0.7397461,0.1685762,0.02271195],"study_design_scores_gemma":[0.0009696121,0.0003402562,0.1079403,0.00003654643,0.00001045158,0.00007655494,0.00003039607,0.3355552,0.00002949497,0.5118207,0.04243831,0.0007521911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008394492,0.00002383711,0.929942,0.005311523,0.01893083,0.0008988455,0.0001941835,0.0008981903,0.03540616],"genre_scores_gemma":[0.4244524,0.000001633065,0.4977512,0.00238317,0.07437775,0.00002908312,0.0006414053,0.00006539074,0.0002979145],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4321907,"threshold_uncertainty_score":0.9999825,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2565232885","doi":"10.1007/s00037-007-0229-6","title":"The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Concatenation (mathematics); Natural number; Intersection (aeronautics); Computer science; Discrete mathematics; Set (abstract data type); Integer (computer science); Prime (order theory); Electronic circuit; Range (aeronautics); Mathematics; Time complexity; Computational complexity theory; Circuit complexity; Combinatorics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.09899804868414189,"gpt":0.3208446374831788,"spread":0.2218465887990369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760705,0.0002590713,0.0004226683,0.0001629573,0.0005642123,0.00008639407,0.001629072,0.00007614165,0.0000215027],"category_scores_gemma":[0.0001754681,0.000220498,0.0003315952,0.0007932011,0.001835988,0.0003186506,0.0003746812,0.0002607463,0.000003499385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007735688,"about_ca_system_score_gemma":0.000159841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001177635,"about_ca_topic_score_gemma":0.0003347872,"domain_scores_codex":[0.9971259,0.0001305651,0.0008966723,0.0004753692,0.000842302,0.0005292429],"domain_scores_gemma":[0.9958675,0.002036728,0.0005771206,0.0005911475,0.0007972124,0.0001303184],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004384345,0.0001642515,0.000875643,0.0001280416,0.00008984433,0.000001270076,0.0005792422,0.002133616,0.0001320534,0.9847183,0.0006320414,0.01050183],"study_design_scores_gemma":[0.0007228992,0.0001028703,0.07882291,0.00003998337,0.00001030578,0.00001652312,0.00004173983,0.192172,0.0004967083,0.7264822,0.0008757829,0.0002161941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08614844,0.0003859177,0.9075696,0.001005434,0.001180341,0.0009573356,0.0001284472,0.0001496603,0.002474851],"genre_scores_gemma":[0.8946477,0.000002133777,0.1050265,0.0001402579,0.00006746224,0.00001267927,0.00005627607,0.00001310583,0.0000338701],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8084993,"threshold_uncertainty_score":0.8991646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4210248983","doi":"10.1007/978-1-4614-1800-9_169","title":"Rough Sets: Foundations and Perspectives","year":2011,"lang":"en","type":"book-chapter","venue":"Computational Complexity","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1788587577041315,"gpt":0.2942854099804757,"spread":0.1154266522763442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000145832,0.0003415525,0.0003476938,0.0001646307,0.0003977225,0.000248379,0.0006734853,0.0001542175,0.0003537574],"category_scores_gemma":[0.0000188339,0.0003377488,0.0001294253,0.00006088571,0.0004525781,0.0003468231,0.000539927,0.0003279371,0.0002358537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009332299,"about_ca_system_score_gemma":0.000156931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002606631,"about_ca_topic_score_gemma":0.00001366385,"domain_scores_codex":[0.9983181,0.00003454952,0.0003258551,0.0007325916,0.0003686846,0.0002201766],"domain_scores_gemma":[0.9987273,0.0001713122,0.0002237183,0.0004510053,0.0002923577,0.0001342995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003570778,0.00002750332,0.000008150093,0.00001387112,0.00005254871,0.00001025192,0.0007894811,0.0001589355,7.001715e-8,0.9876859,0.001731677,0.009518108],"study_design_scores_gemma":[0.0001708501,0.00007371911,0.003428859,0.00003040618,0.00001582242,0.00005641989,0.000008361934,0.02028756,9.044939e-8,0.9445342,0.03102778,0.0003659432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.00002928777,0.0009741006,0.3172512,0.001170329,0.000250759,0.0002472461,0.00007508034,0.0002254214,0.6797765],"genre_scores_gemma":[0.1609742,0.0003072531,0.7676995,0.001624032,0.0006222847,0.00003656936,0.0006832837,0.0001183604,0.06793456],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.611842,"threshold_uncertainty_score":0.9999074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}