{"meta":{"query_hash":"c8748a2891c2","filters":{"venue":"Computational Complexity"},"cohort_total":40,"direct_labels_cover":0,"predictions_cover":40,"exported":40,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/c8748a2891c2","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computational+Complexity"},"results":[{"id":"W1205694693","doi":"10.1007/s00037-009-0263-7","title":"The Black-Box Query Complexity of Polynomial Summation","year":2009,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Toronto","funders":"","keywords":"Combinatorics; Degree (music); Mathematics; Polynomial; Field (mathematics); Discrete mathematics; Finite field; Connection (principal bundle); Physics; Pure mathematics","score_opus":0.05658031693308873,"score_gpt":0.2870780996604076,"score_spread":0.23049778272731886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1205694693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06220251,0.00019082775,0.9222826,0.009139381,0.0006632923,0.0004195984,0.00004741135,0.00032176808,0.0047326074],"genre_scores_gemma":[0.8770367,0.0000076274646,0.1221758,0.0005011583,0.00016397228,0.000004750594,0.00005208465,0.0000074926224,0.00005043556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730664,0.00026947295,0.00071836385,0.00048128792,0.00079360104,0.000430604],"domain_scores_gemma":[0.99770033,0.00060661935,0.00036629912,0.00073815335,0.00044807055,0.00014052875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071973715,0.00026400393,0.00034690186,0.00015922972,0.000850029,0.0002617179,0.0017501493,0.000074119416,0.000026621916],"category_scores_gemma":[0.0001019515,0.00022487622,0.00024104887,0.0007614688,0.0013545078,0.00051096734,0.00031797192,0.00029253098,0.00004588269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003754714,0.00018044488,0.00018290043,0.000011888622,0.00002875084,0.0000029106316,0.00039189623,0.0047128014,0.000077547644,0.96443206,0.0035578008,0.026383433],"study_design_scores_gemma":[0.0003599621,0.00012029014,0.07394475,0.00001537882,0.0000048386964,0.000014164792,0.000026214495,0.32571754,0.00020727089,0.59772,0.0016771962,0.0001923998],"about_ca_topic_score_codex":0.00006290501,"about_ca_topic_score_gemma":0.000045648583,"teacher_disagreement_score":0.8148342,"about_ca_system_score_codex":0.000083928375,"about_ca_system_score_gemma":0.00018311056,"threshold_uncertainty_score":0.9170186},"labels":[],"label_agreement":null},{"id":"W1972068724","doi":"10.1007/s00037-007-0220-2","title":"A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness","year":2006,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Washington; National Science Foundation","keywords":"Corollary; Communication complexity; Upper and lower bounds; Mathematics; Product (mathematics); Direct product; Combinatorics; Function (biology); Discrete mathematics; Simple (philosophy); Computer science","score_opus":0.0649624365213801,"score_gpt":0.2936631913235376,"score_spread":0.22870075480215746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972068724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051539566,0.0005333859,0.9414292,0.0029920493,0.00021473132,0.0011852728,0.00013438886,0.00017165208,0.0017997745],"genre_scores_gemma":[0.82599956,0.0000050438925,0.17355575,0.000073530406,0.000076342476,0.00007424429,0.00017639656,0.000010049447,0.000029112547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977929,0.0004536907,0.00058196374,0.0004837429,0.00041458747,0.00027309012],"domain_scores_gemma":[0.99693197,0.001385654,0.0003919885,0.0007353412,0.00050124904,0.000053788714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013200238,0.00022922938,0.0004276666,0.00011041734,0.00076019403,0.00016722741,0.0009778639,0.000041834024,0.000009151769],"category_scores_gemma":[0.00013289819,0.00017858615,0.0001777869,0.00040943848,0.0026401526,0.0003769834,0.00048962224,0.00017960322,0.0000021534004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010914907,0.00017003456,0.00065128214,0.000051739513,0.000023116592,2.0458661e-7,0.00028445508,0.0072380663,0.00002285221,0.9872041,0.00028098392,0.0039640595],"study_design_scores_gemma":[0.0011447277,0.000031954296,0.049602803,0.000020133028,0.0000116189585,0.00000845122,0.000019187666,0.43225786,0.000081009384,0.51648706,0.000211565,0.00012359557],"about_ca_topic_score_codex":0.00040119656,"about_ca_topic_score_gemma":0.00017139719,"teacher_disagreement_score":0.77445996,"about_ca_system_score_codex":0.000043330278,"about_ca_system_score_gemma":0.00006797438,"threshold_uncertainty_score":0.9727752},"labels":[],"label_agreement":null},{"id":"W1977227483","doi":"10.1007/s00037-009-0266-4","title":"Space-Efficient Counting in Graphs on Surfaces","year":2009,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Modulo; Discrete mathematics; Algebraic number; Planar graph; Counting problem; Graph","score_opus":0.0639715632429065,"score_gpt":0.3344310122917777,"score_spread":0.2704594490488712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977227483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65685713,0.00006438318,0.33604938,0.0021175034,0.00012108069,0.00022875091,0.0000052543805,0.00017299352,0.004383501],"genre_scores_gemma":[0.94621146,0.0000011049843,0.05325783,0.00047112518,0.000017054843,0.000004112064,0.000008953378,0.000005550945,0.000022791804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979746,0.00017426677,0.00026419703,0.0004929585,0.0006911394,0.00040285912],"domain_scores_gemma":[0.99886936,0.00043996534,0.000085172396,0.00034437035,0.00016205493,0.0000990966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006501749,0.00016305948,0.00018963603,0.00036471285,0.00021927443,0.00012958735,0.00080035994,0.00003706565,0.000016755832],"category_scores_gemma":[0.00009169962,0.00016433549,0.000066113156,0.0011283841,0.00015156786,0.0002105035,0.00013344319,0.0002774661,0.00008046707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014107103,0.00011925157,0.00070181413,0.0000024397414,0.0000021282103,0.000014525061,0.00010405519,0.3730081,0.00004894079,0.624627,0.000056320358,0.0013013076],"study_design_scores_gemma":[0.00021715532,0.0000696131,0.12683178,0.000013637564,2.982125e-7,0.000005162826,0.0000068933696,0.3967496,0.00004638612,0.47591004,0.000049317605,0.00010012271],"about_ca_topic_score_codex":0.0000113230035,"about_ca_topic_score_gemma":0.000008319575,"teacher_disagreement_score":0.28935432,"about_ca_system_score_codex":0.00009921866,"about_ca_system_score_gemma":0.00007336025,"threshold_uncertainty_score":0.6701407},"labels":[],"label_agreement":null},{"id":"W1981850523","doi":"10.1007/s00037-007-0222-0","title":"The Complexity of Tensor Circuit Evaluation","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Semiring; Mathematics; Discrete mathematics; Combinatorics; Tensor (intrinsic definition); Boolean circuit; Matrix exponential; Kleene algebra; Complexity class; Diagonal; Matrix (chemical analysis); Boolean function; Time complexity; Pure mathematics","score_opus":0.16958956963516084,"score_gpt":0.3361128090989626,"score_spread":0.16652323946380174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981850523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037897035,0.0002761164,0.95156586,0.0016982517,0.0007261313,0.00049052684,0.000021975326,0.00017251179,0.0071515734],"genre_scores_gemma":[0.8986574,0.0000028487948,0.10091767,0.00021716823,0.00011672871,0.000011040153,0.000037479636,0.000009651156,0.000030017443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654835,0.00027290313,0.00075367617,0.00048083888,0.0014672896,0.00047690817],"domain_scores_gemma":[0.9963594,0.0011754277,0.00037401702,0.00075956626,0.0011856508,0.00014593033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00384101,0.00022262907,0.00028063962,0.00017955278,0.0009412638,0.00016120065,0.0016663668,0.00006562689,0.000058609297],"category_scores_gemma":[0.00026823522,0.00018530205,0.00019996769,0.0009584659,0.001716903,0.00033087068,0.00042865938,0.00026621277,0.0000387537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017986378,0.000113028116,0.00068705983,0.000011640692,0.00003698652,0.0000023652788,0.00022782406,0.0021183868,0.00004447623,0.94270515,0.00039247636,0.053642605],"study_design_scores_gemma":[0.00033248338,0.00004639421,0.1364089,0.000009445025,0.000007483489,0.000019804073,0.000029765582,0.28925955,0.00011284349,0.57285285,0.0007868516,0.00013366425],"about_ca_topic_score_codex":0.000065773325,"about_ca_topic_score_gemma":0.0001254851,"teacher_disagreement_score":0.8607604,"about_ca_system_score_codex":0.00012672697,"about_ca_system_score_gemma":0.00022367855,"threshold_uncertainty_score":0.75563985},"labels":[],"label_agreement":null},{"id":"W1985813832","doi":"10.1007/s00037-013-0063-y","title":"Modular Composition Modulo Triangular Sets and Applications","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Modulo; Modular design; Elliptic curve; Mathematics; Modular arithmetic; Discrete mathematics; Exponential function; Computer science; Algorithm; Cryptography; Pure mathematics","score_opus":0.027523732170211975,"score_gpt":0.25565941027182837,"score_spread":0.2281356781016164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985813832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15145385,0.00012581678,0.8450317,0.0018848042,0.00011057628,0.0005555817,0.000010723632,0.0002526667,0.00057433476],"genre_scores_gemma":[0.8757231,0.0000018864862,0.12329686,0.0006110606,0.000103105354,0.00012032432,0.00010765164,0.000008714011,0.000027305843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985634,0.000100488855,0.00031248506,0.00047358344,0.00030949604,0.0002405134],"domain_scores_gemma":[0.99901664,0.00017373214,0.00011824453,0.00029347363,0.00021960684,0.00017829868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014600705,0.0001791446,0.0001977038,0.00013596898,0.00037091473,0.00031476855,0.00043569942,0.00005202789,0.000046025347],"category_scores_gemma":[0.000010651449,0.00018521985,0.0000643792,0.00034578494,0.00014352097,0.00071866956,0.00026571113,0.0001249929,0.0002278857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006239687,0.00019529206,0.0003054788,0.000036208057,0.00004327039,0.0000031304965,0.00024351936,0.031346045,0.0012424139,0.8325468,0.0011351486,0.13289648],"study_design_scores_gemma":[0.0002942855,0.00002290849,0.0620741,0.0000056176905,0.0000031867303,0.00002258929,0.0000039362144,0.50012535,0.00004856061,0.4369423,0.0003194675,0.0001376665],"about_ca_topic_score_codex":0.000070412185,"about_ca_topic_score_gemma":0.0000019515285,"teacher_disagreement_score":0.7242693,"about_ca_system_score_codex":0.00005245577,"about_ca_system_score_gemma":0.000052720126,"threshold_uncertainty_score":0.75530463},"labels":[],"label_agreement":null},{"id":"W2003104918","doi":"10.1007/s00037-001-8195-x","title":"Communication complexity towards lower bounds on circuit depth","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Boolean function; Circuit complexity; Communication complexity; Upper and lower bounds; Omega; Mathematics; Binary logarithm; Bounded function; Function (biology); Discrete mathematics; Boolean circuit; Conjecture; Combinatorics; Characterization (materials science); Electronic circuit; Physics; Mathematical analysis","score_opus":0.1246287817561772,"score_gpt":0.31596490909890745,"score_spread":0.19133612734273026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003104918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06267783,0.00018177695,0.8619535,0.004733219,0.0008990005,0.00046493972,0.000047317324,0.0009271543,0.068115234],"genre_scores_gemma":[0.88671076,0.000018049499,0.110293016,0.002355319,0.00016673685,0.000032135187,0.00019547003,0.000026070753,0.00020247036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621654,0.00040870797,0.000669967,0.0009075195,0.0011461253,0.0006511618],"domain_scores_gemma":[0.99685514,0.0004643177,0.00027861947,0.0016034107,0.0004940961,0.00030444367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007217328,0.00044951017,0.00047354418,0.000345653,0.0012321335,0.00057250506,0.0028149877,0.00012930532,0.0003337088],"category_scores_gemma":[0.00009977603,0.00048086565,0.00029729254,0.0012689428,0.00089105574,0.0007547776,0.00086084893,0.00060968735,0.0004271218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042708525,0.0006428002,0.0008195138,0.000013336317,0.00005067148,0.000029512872,0.0002915214,0.0043613315,0.0000070414144,0.96292216,0.0023664343,0.028452964],"study_design_scores_gemma":[0.0006396559,0.00018282076,0.12597717,0.000037741353,0.0000071472577,0.0001007718,0.000014505969,0.1948216,0.000015564483,0.6665706,0.011200305,0.0004321259],"about_ca_topic_score_codex":0.0002004641,"about_ca_topic_score_gemma":0.00016349759,"teacher_disagreement_score":0.8240329,"about_ca_system_score_codex":0.00025451064,"about_ca_system_score_gemma":0.00022722493,"threshold_uncertainty_score":0.9997643},"labels":[],"label_agreement":null},{"id":"W2004004688","doi":"10.1007/s00037-002-0171-6","title":"Homogenization and the polynomial calculus","year":2002,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Homogenization (climate); Polynomial; Degree (music); Combinatorics; Discrete mathematics; Calculus (dental); Mathematical analysis","score_opus":0.0360283342793621,"score_gpt":0.2313772949803246,"score_spread":0.19534896070096253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004004688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06032298,0.0004314275,0.9245144,0.010723416,0.00036224435,0.00024429007,0.0000055480145,0.00020090923,0.0031947787],"genre_scores_gemma":[0.9824585,0.0000054926154,0.01612183,0.0010904567,0.00015669003,0.000010465214,0.00001084172,0.000005879123,0.00013988458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988419,0.00015247028,0.000242135,0.0003017505,0.00027470777,0.00018706098],"domain_scores_gemma":[0.9991857,0.00032656707,0.00009592587,0.00021092538,0.00009728461,0.000083623425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002344952,0.00013014495,0.00015674347,0.000068574605,0.00043837578,0.00023680498,0.0004475733,0.000032424836,0.000050906507],"category_scores_gemma":[0.00005727928,0.00009732632,0.00006318719,0.00033335114,0.0003624228,0.00031732937,0.00027231983,0.0001123021,0.00008612416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019925123,0.000056327004,0.00019323872,0.000006771236,0.000025072679,0.000003634742,0.0009682483,0.008587355,0.000007278928,0.918649,0.0052001122,0.06628301],"study_design_scores_gemma":[0.0011634928,0.000019171304,0.009783586,0.0000032749779,0.0000048152983,0.000038346134,0.000004791716,0.8682162,0.000008379957,0.119083494,0.0015566609,0.00011779378],"about_ca_topic_score_codex":0.00005207037,"about_ca_topic_score_gemma":0.000007212096,"teacher_disagreement_score":0.9221355,"about_ca_system_score_codex":0.000031552492,"about_ca_system_score_gemma":0.000022032276,"threshold_uncertainty_score":0.39688522},"labels":[],"label_agreement":null},{"id":"W2006872837","doi":"10.1007/s00037-011-0016-2","title":"A Quantum Characterization Of NP","year":2011,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Complexity class; Class (philosophy); Quantum entanglement; Soundness; Completeness (order theory); Discrete mathematics; Quantum complexity theory; Characterization (materials science); Logarithm; Mathematics; Quantum; Context (archaeology); Combinatorics; Computer science; Quantum algorithm; Time complexity; Quantum mechanics; Physics","score_opus":0.06338483869152876,"score_gpt":0.25711491752253,"score_spread":0.19373007883100124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006872837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38094655,0.000007645748,0.6179493,0.00014739433,0.0001840749,0.00006942515,0.000009462823,0.00011550125,0.0005706361],"genre_scores_gemma":[0.83768255,5.020284e-7,0.1620511,0.00017518879,0.0000423606,0.0000027378471,0.000028386185,0.00000655338,0.000010613776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988316,0.00008690628,0.0003159213,0.0002954031,0.00028551187,0.00018464684],"domain_scores_gemma":[0.999173,0.0000652218,0.00019531413,0.00029380692,0.0001992048,0.00007346862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019583829,0.00013004134,0.00018852191,0.00012787661,0.00012328828,0.000031000392,0.0006555235,0.000036555237,0.000041036034],"category_scores_gemma":[0.000019357727,0.00012435648,0.00008072706,0.00038574307,0.00012801382,0.00019609334,0.00023759324,0.00011236464,0.000025512085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017262932,0.0002570722,0.0013578252,0.000035107365,0.00003108324,0.000008577894,0.0020486468,0.0028753497,0.0020098467,0.97837174,0.000070534436,0.012916937],"study_design_scores_gemma":[0.00015571502,0.000072561896,0.15516491,0.000011536589,0.000002134618,0.000023466207,0.0000021743942,0.6376622,0.0004536902,0.20621218,0.00012723845,0.00011224129],"about_ca_topic_score_codex":0.00002662429,"about_ca_topic_score_gemma":9.4963116e-7,"teacher_disagreement_score":0.7721596,"about_ca_system_score_codex":0.000013577658,"about_ca_system_score_gemma":0.000066604574,"threshold_uncertainty_score":0.507111},"labels":[],"label_agreement":null},{"id":"W2018522462","doi":"10.1007/s00037-007-0225-x","title":"Special Issue “Conference on Computational Complexity 2006” Guest Editors’ Foreword","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computational complexity theory; Theoretical computer science; Algorithm","score_opus":0.09065063507808688,"score_gpt":0.3221336832850516,"score_spread":0.23148304820696472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018522462","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008394492,0.000023837109,0.92994195,0.0053115226,0.018930828,0.0008988455,0.00019418352,0.00089819025,0.03540616],"genre_scores_gemma":[0.42445242,0.000001633065,0.49775124,0.0023831704,0.074377745,0.000029083123,0.0006414053,0.00006539074,0.0002979145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99261206,0.00040029004,0.0014337925,0.0018363529,0.0024275451,0.001289948],"domain_scores_gemma":[0.9943802,0.0017485521,0.00055282895,0.0011510492,0.0014879233,0.0006794719],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019061093,0.00082872034,0.0008641662,0.00058006635,0.0010616347,0.00064394216,0.0028119094,0.000273531,0.00093083363],"category_scores_gemma":[0.00025887217,0.00088682486,0.0003839353,0.0014338256,0.0012181367,0.0008780079,0.001251999,0.00093632657,0.0013569404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015618998,0.0013249825,0.0016969048,0.00005879144,0.000091033864,0.000103146405,0.0007346129,0.064792186,0.000007849385,0.7397461,0.16857624,0.022711946],"study_design_scores_gemma":[0.0009696121,0.0003402562,0.10794029,0.000036546433,0.000010451585,0.00007655494,0.000030396068,0.3355552,0.000029494973,0.51182073,0.04243831,0.0007521911],"about_ca_topic_score_codex":0.0001428938,"about_ca_topic_score_gemma":0.00020958115,"teacher_disagreement_score":0.4321907,"about_ca_system_score_codex":0.0006342036,"about_ca_system_score_gemma":0.0005198509,"threshold_uncertainty_score":0.9999825},"labels":[],"label_agreement":null},{"id":"W2026036943","doi":"10.1007/s00037-004-0182-6","title":"Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds","year":2004,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":384,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Polynomial; Arithmetic circuit complexity; Combinatorics; Nondeterministic algorithm; Discrete mathematics; Bounded function; Identity (music); Degree (music); Upper and lower bounds; Arithmetic; Arbitrary-precision arithmetic","score_opus":0.05471051344573013,"score_gpt":0.28800868506642247,"score_spread":0.23329817162069233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026036943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10380455,0.00010993786,0.8906953,0.001142936,0.0011651235,0.0003394833,0.00001898069,0.00048501304,0.0022387023],"genre_scores_gemma":[0.82172626,0.0000014223937,0.17721002,0.00068520923,0.00028649377,0.000018530001,0.000028210281,0.000017336237,0.000026511818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970379,0.00013551825,0.00056876737,0.0007825448,0.0009016008,0.00057368283],"domain_scores_gemma":[0.9983326,0.00032627504,0.00021341264,0.0005777249,0.00031690448,0.00023308663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006420803,0.0003296811,0.000402633,0.0002684023,0.0010350457,0.0008355961,0.001586326,0.0000882833,0.00005390993],"category_scores_gemma":[0.0001541225,0.00036232208,0.0002817445,0.00086298195,0.00039251972,0.0018579547,0.0006682646,0.0003897944,0.00012806873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045343197,0.00040696235,0.00071832543,0.00003632054,0.000070256865,0.000061939245,0.00070509774,0.04093824,0.00014599515,0.95101434,0.00033578405,0.0055213673],"study_design_scores_gemma":[0.0031418302,0.0000997575,0.034520347,0.00005506076,0.000012458295,0.00012869861,0.00001474195,0.08973329,0.00007094455,0.8711692,0.0005741602,0.00047949332],"about_ca_topic_score_codex":0.00025947427,"about_ca_topic_score_gemma":0.000248667,"teacher_disagreement_score":0.71792173,"about_ca_system_score_codex":0.0002959656,"about_ca_system_score_gemma":0.00044153573,"threshold_uncertainty_score":0.9998829},"labels":[],"label_agreement":null},{"id":"W2028368516","doi":"10.1007/s00037-014-0091-2","title":"The complexity of estimating min-entropy","year":2014,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Logarithm; Entropy (arrow of time); Discrete mathematics; Markov chain; Sample complexity; Combinatorics; Computer science; Statistics; Mathematical analysis","score_opus":0.04906858431237536,"score_gpt":0.29609605101110653,"score_spread":0.24702746669873116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028368516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012541088,0.000037219634,0.98088986,0.0033216716,0.00050108205,0.0001011444,0.000004827074,0.00015075655,0.0024523314],"genre_scores_gemma":[0.552637,2.1685732e-7,0.44704488,0.00013387208,0.00011861988,0.0000030509987,0.000011811311,0.0000049128907,0.000045678524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982164,0.00032744918,0.00038467254,0.0003042831,0.0005037037,0.00026351388],"domain_scores_gemma":[0.99802494,0.00094699214,0.00026593788,0.00043605495,0.0002381179,0.00008796125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008515268,0.00014710483,0.00022347699,0.00005225918,0.0006908275,0.00015957424,0.0010821101,0.000028084558,0.000016617943],"category_scores_gemma":[0.0003331934,0.00011196281,0.00010428588,0.00028107042,0.0006836495,0.00014306998,0.00034838996,0.0002146558,0.000041270247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004215957,0.000038172082,0.0004479602,0.000013998048,0.000013629679,4.982996e-7,0.00013048285,0.05298032,0.000016623277,0.9233781,0.00046531172,0.022510663],"study_design_scores_gemma":[0.00016164403,0.000040082647,0.019929247,0.000008854683,0.0000019149918,0.000007799081,0.0000034454529,0.59469426,0.000018540231,0.38365757,0.0014005667,0.00007609987],"about_ca_topic_score_codex":0.00007160304,"about_ca_topic_score_gemma":0.00000822755,"teacher_disagreement_score":0.5417139,"about_ca_system_score_codex":0.00002528371,"about_ca_system_score_gemma":0.000057218258,"threshold_uncertainty_score":0.53133565},"labels":[],"label_agreement":null},{"id":"W2029495732","doi":"10.1007/s00037-014-0084-1","title":"On the Power of Non-adaptive Learning Graphs","year":2014,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Social Fund; Latvijas Universitate; National Science Foundation","keywords":"Certificate; Computer science; Bounded function; Theoretical computer science; Discrete mathematics; Mathematics; Graph; Upper and lower bounds; Combinatorics","score_opus":0.024800020624360965,"score_gpt":0.2534712184792243,"score_spread":0.22867119785486337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029495732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29855916,0.0000068629593,0.697609,0.00088718504,0.00014717734,0.00008278748,0.0000018281694,0.000072882496,0.0026331495],"genre_scores_gemma":[0.93525654,1.3064563e-7,0.06414158,0.0005399558,0.000031087773,0.0000029755279,0.0000036233773,0.0000071433165,0.000016974634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859154,0.00024624323,0.00022615494,0.00030834595,0.000426932,0.00020075189],"domain_scores_gemma":[0.99797875,0.001314307,0.0001658593,0.0003146254,0.0001685737,0.000057874364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005245308,0.00014651119,0.0001814212,0.00009670521,0.0003570009,0.0000615645,0.00078150706,0.000031186133,0.000021268903],"category_scores_gemma":[0.00012295802,0.00010287027,0.00011317205,0.00038167837,0.00020330344,0.00006385519,0.00024934256,0.0003218038,0.00003446905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058648975,0.000037704882,0.00008183995,0.0000028137292,0.00001241054,6.387501e-7,0.0003996088,0.29995802,0.000015659025,0.6953251,0.00026351507,0.0038968895],"study_design_scores_gemma":[0.000109854234,0.00019156918,0.019919153,0.00001608004,0.0000010908007,0.0000040341683,0.000007750827,0.59134007,0.000032497926,0.38818863,0.00011422844,0.00007505962],"about_ca_topic_score_codex":0.000013024163,"about_ca_topic_score_gemma":9.3544924e-7,"teacher_disagreement_score":0.63669735,"about_ca_system_score_codex":0.000013641215,"about_ca_system_score_gemma":0.000040312345,"threshold_uncertainty_score":0.41949278},"labels":[],"label_agreement":null},{"id":"W2053658780","doi":"10.1007/s00037-015-0100-0","title":"Mining Circuit Lower Bound Proofs for Meta-Algorithms","year":2015,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Mathematical proof; Algorithm; Truth table; Computer science; Upper and lower bounds; Boolean function; Circuit minimization for Boolean functions; Discrete mathematics; Boolean circuit; Mathematics","score_opus":0.30987741822452286,"score_gpt":0.34170317087719915,"score_spread":0.03182575265267629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053658780","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004975388,0.00038926516,0.98819715,0.0015387295,0.001287881,0.0005789155,0.00007170948,0.00040697586,0.0025539675],"genre_scores_gemma":[0.28612748,5.684176e-7,0.71185476,0.0009749913,0.00035791128,0.00024916138,0.00010219948,0.000026579622,0.0003063635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971493,0.00014322757,0.00053330086,0.0008062781,0.0008343703,0.00053355185],"domain_scores_gemma":[0.9974052,0.0005628623,0.00021634182,0.00060585735,0.00085762615,0.00035216068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010461141,0.00034004092,0.0005514206,0.00021312556,0.0004861563,0.00047811415,0.0014162039,0.000084641055,0.00006408952],"category_scores_gemma":[0.00019642997,0.00032778597,0.0004351898,0.0006569468,0.00031290678,0.00070530723,0.00045749592,0.00018875953,0.00006580883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032011707,0.00035968365,0.00009192377,0.00003765711,0.00061566377,0.00001937444,0.0008313434,0.013208315,0.0000055523215,0.9578258,0.015469913,0.011502779],"study_design_scores_gemma":[0.0006450954,0.00017699192,0.0008013762,0.0000058166047,0.00007197651,0.000040928502,0.000019798368,0.3923003,0.000021749898,0.59291494,0.012704429,0.0002965847],"about_ca_topic_score_codex":0.000024832178,"about_ca_topic_score_gemma":0.000015709966,"teacher_disagreement_score":0.37909198,"about_ca_system_score_codex":0.000120660276,"about_ca_system_score_gemma":0.0003781494,"threshold_uncertainty_score":0.99991745},"labels":[],"label_agreement":null},{"id":"W2066938865","doi":"10.1007/s00037-001-8191-1","title":"Reducing the complexity of reductions","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Gap theorem; Isomorphism (crystallography); Discrete mathematics; Combinatorics; Invertible matrix; Complexity class; Conjecture; Time complexity; Pure mathematics; Fundamental theorem; Crystallography; Crystal structure","score_opus":0.12454342522397675,"score_gpt":0.3089948682333011,"score_spread":0.1844514430093243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066938865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06498257,0.00018358404,0.9142869,0.011143131,0.00081072137,0.00030669256,0.000028588775,0.00028362314,0.00797418],"genre_scores_gemma":[0.8281727,0.0000074621485,0.17124353,0.00027873728,0.00015683462,0.0000126152045,0.000026329215,0.000009010577,0.000092789145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977769,0.00022919841,0.0005490583,0.00047697916,0.00062020385,0.0003476397],"domain_scores_gemma":[0.99804574,0.00034733512,0.0002598381,0.0008286447,0.00040646497,0.00011199364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005508587,0.00021061549,0.00028927685,0.00017580732,0.000825198,0.00013105413,0.0016714737,0.00004943545,0.00014379119],"category_scores_gemma":[0.00008553381,0.00017545852,0.00021005204,0.0013164822,0.0018840894,0.0004119611,0.00054297113,0.00030683266,0.00004158998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010498379,0.00017027695,0.00029214853,0.00001110436,0.00003970611,0.000004644027,0.00046301985,0.01682755,0.00006453268,0.97326094,0.0015464823,0.0073091234],"study_design_scores_gemma":[0.00021781394,0.000047781297,0.040486813,0.000018345425,0.0000073546666,0.0001618539,0.00004595114,0.27274862,0.000079693724,0.6834071,0.002614847,0.00016376899],"about_ca_topic_score_codex":0.00021736321,"about_ca_topic_score_gemma":0.000030658328,"teacher_disagreement_score":0.76319015,"about_ca_system_score_codex":0.00005820777,"about_ca_system_score_gemma":0.00014624496,"threshold_uncertainty_score":0.7154991},"labels":[],"label_agreement":null},{"id":"W2081819660","doi":"10.1007/s00037-013-0078-4","title":"The NOF Multiparty Communication Complexity of Composed Functions","year":2014,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Communication complexity; Computer science; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.15298541159022244,"score_gpt":0.3443344110008818,"score_spread":0.19134899941065936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081819660","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64341354,0.000073823096,0.33576,0.0037403337,0.00017934316,0.0008226613,0.00018980539,0.0002855891,0.0155348815],"genre_scores_gemma":[0.9484652,0.000002002199,0.051005896,0.000101811514,0.000039605733,0.000046661597,0.00019968509,0.000015950587,0.00012314723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815166,0.00053568813,0.0005665285,0.00021678898,0.00032733163,0.00020197942],"domain_scores_gemma":[0.99479693,0.0035387839,0.00037011522,0.00076917757,0.00044499701,0.00008001884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010552728,0.00016312458,0.00026513461,0.00005856557,0.0012863317,0.000045464647,0.0005861529,0.000052437754,0.000083031875],"category_scores_gemma":[0.00034648858,0.00013169639,0.00015308005,0.00030855866,0.0016233636,0.0000858245,0.00015794246,0.00022172501,0.00005430101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003343007,0.00022433387,0.00049472315,0.000023467817,0.00003200972,3.2651982e-8,0.00015462005,0.0011855674,0.00011973299,0.9942731,0.0027899018,0.0006690655],"study_design_scores_gemma":[0.00044210497,0.00003264729,0.03267581,0.000016462764,0.000025357906,0.0000039842757,0.00008895978,0.06011128,0.000098991266,0.90159476,0.0047845854,0.00012506546],"about_ca_topic_score_codex":0.00003409198,"about_ca_topic_score_gemma":0.00013957528,"teacher_disagreement_score":0.30505168,"about_ca_system_score_codex":0.000032022668,"about_ca_system_score_gemma":0.000037710382,"threshold_uncertainty_score":0.9893553},"labels":[],"label_agreement":null},{"id":"W2083633130","doi":"10.1007/s00037-013-0065-9","title":"Parallel Approximation of Min-Max Problems","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PSPACE; Multiplicative function; Mathematical proof; Mathematics; Class (philosophy); Matrix (chemical analysis); Complexity class; Discrete mathematics; Combinatorics; Computational complexity theory; Time complexity; Computer science; Algorithm","score_opus":0.03443949735732771,"score_gpt":0.25069047393640637,"score_spread":0.21625097657907866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083633130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13629785,0.00006749187,0.860675,0.0011683296,0.00014765235,0.0003224495,0.0000045219044,0.00016322939,0.0011534787],"genre_scores_gemma":[0.57379204,4.456655e-7,0.4259753,0.0001246922,0.000039913295,0.000015113134,0.000020173346,0.0000055515425,0.00002675486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984828,0.00009475435,0.00040095468,0.0003541211,0.00042548275,0.00024185037],"domain_scores_gemma":[0.9988473,0.00018774455,0.00021769012,0.00033016253,0.00032334108,0.00009373003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020428866,0.00016090153,0.00022590446,0.00012109817,0.00015899105,0.00011619814,0.00072419335,0.000045007586,0.000044446995],"category_scores_gemma":[0.000032355183,0.00014584126,0.00009375947,0.00038606967,0.00014580702,0.00031058802,0.00027275758,0.00014726628,0.00009848872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027440572,0.00018457817,0.00049374223,0.00008190574,0.000028960705,0.0000012178399,0.00073366426,0.7263284,0.00022292214,0.24017036,0.0012842758,0.030467227],"study_design_scores_gemma":[0.00018582733,0.000045071272,0.025107058,0.000020544638,0.0000013901198,0.000010934834,0.0000042239258,0.6333899,0.000036753183,0.34096718,0.00012402397,0.000107068336],"about_ca_topic_score_codex":0.00010012219,"about_ca_topic_score_gemma":0.000002538481,"teacher_disagreement_score":0.43749422,"about_ca_system_score_codex":0.00002348434,"about_ca_system_score_gemma":0.00006852593,"threshold_uncertainty_score":0.59472334},"labels":[],"label_agreement":null},{"id":"W2099449032","doi":"10.1007/s00037-011-0032-2","title":"Special Issue In Memory of Misha Alekhnovich. Foreword","year":2011,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Lomonosov Moscow State University","keywords":"Computer science; Mathematics; Discrete mathematics; Theoretical computer science","score_opus":0.10974431150704561,"score_gpt":0.3271698014169991,"score_spread":0.21742548990995347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099449032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16314025,0.00008381562,0.7032804,0.00040381143,0.00085980585,0.00057168235,0.000029038525,0.00016394928,0.13146727],"genre_scores_gemma":[0.7235157,0.0000013337801,0.27564755,0.00015427732,0.00048748803,0.00001167967,0.000013593934,0.000011416126,0.00015695789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831146,0.00014825804,0.00038268714,0.00038192698,0.00047231498,0.00030333703],"domain_scores_gemma":[0.9989079,0.00023930815,0.00012280612,0.00040034397,0.00023259642,0.00009699706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045204582,0.00013839567,0.00024148686,0.00030261636,0.000078605764,0.000021883396,0.0011537829,0.000047823414,0.0005651791],"category_scores_gemma":[0.000081082995,0.00014752231,0.00007888533,0.00076720066,0.00037153007,0.00041046384,0.0004168737,0.00020560797,0.0000992054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010321403,0.00034468525,0.0065545514,0.000041372732,0.000020904205,0.000048267648,0.0021792126,0.0036330866,0.000038022725,0.9645401,0.0024241,0.02007243],"study_design_scores_gemma":[0.00048067246,0.000086183885,0.1209349,0.000017082142,0.000001211237,0.000013959758,0.000035814308,0.034482107,0.00031915304,0.842517,0.00095979095,0.00015211481],"about_ca_topic_score_codex":0.00005872902,"about_ca_topic_score_gemma":0.00007889873,"teacher_disagreement_score":0.56037545,"about_ca_system_score_codex":0.00005308319,"about_ca_system_score_gemma":0.00011288907,"threshold_uncertainty_score":0.61883146},"labels":[],"label_agreement":null},{"id":"W2100827027","doi":"10.1007/s00037-005-0194-x","title":"Quantum Arthur–Merlin games","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":253,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Quantum pseudo-telepathy; Soundness; Quantum sort; Merlin (protein); Quantum; Discrete mathematics; Mathematics; Quantum computer; Quantum information; Quantum complexity theory; Computer science; Combinatorics; Quantum mechanics; Quantum error correction; Quantum network; Physics","score_opus":0.034762398109001,"score_gpt":0.2775044403854839,"score_spread":0.24274204227648288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100827027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20838526,0.00019799061,0.78324276,0.0061551346,0.00033636202,0.00012216045,0.0000090978565,0.00051318057,0.0010380428],"genre_scores_gemma":[0.70852524,0.0000013112602,0.28990433,0.0011351784,0.0003400962,0.00000473027,0.000019809106,0.00001068162,0.000058646772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998,0.00012326725,0.0003773466,0.00057233457,0.0005143672,0.00041264287],"domain_scores_gemma":[0.998861,0.00019817989,0.00013458569,0.00045806076,0.00017098828,0.0001772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030966653,0.00023831188,0.00024812296,0.00015335326,0.00037605668,0.00022878488,0.0010218045,0.000055652526,0.0000646075],"category_scores_gemma":[0.00004003304,0.00022691184,0.00014065678,0.0004383349,0.0001656769,0.0003219153,0.0003908779,0.0002910151,0.0003717035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055325045,0.00013856453,0.00014148743,0.000009485102,0.000021963946,0.000010046599,0.0004606189,0.37174314,0.00002702612,0.4916775,0.0021965741,0.13356806],"study_design_scores_gemma":[0.00027298697,0.000047694008,0.019240318,0.0000127096955,0.0000021761762,0.000060255086,0.0000041278677,0.75774246,0.000037781512,0.21433628,0.008020282,0.00022290887],"about_ca_topic_score_codex":0.000015838255,"about_ca_topic_score_gemma":0.0000091980955,"teacher_disagreement_score":0.50013995,"about_ca_system_score_codex":0.000052987558,"about_ca_system_score_gemma":0.0001200431,"threshold_uncertainty_score":0.9253196},"labels":[],"label_agreement":null},{"id":"W2124396273","doi":"10.1007/s00037-013-0064-x","title":"Lifting lower bounds for tree-like proofs","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Mathematical proof; Proof complexity; Mathematics; Constant (computer programming); Upper and lower bounds; Bounded function; Discrete mathematics; Sequent; Tree (set theory); Sequent calculus; Hierarchy; Combinatorics; Computer science","score_opus":0.0681648188073247,"score_gpt":0.28769024952469163,"score_spread":0.21952543071736694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124396273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008252052,0.000085568885,0.98387575,0.0007796063,0.0010334391,0.0007504805,0.000002638108,0.0003279613,0.004892512],"genre_scores_gemma":[0.8775916,1.8424016e-7,0.12092544,0.00052246545,0.00025186312,0.00014376266,0.000041659718,0.0000122249085,0.0005107902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984108,0.00006869899,0.00034057323,0.0004574985,0.00034627502,0.00037614888],"domain_scores_gemma":[0.99870026,0.00024505716,0.00015824128,0.0003181066,0.00044601146,0.00013233848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032410875,0.00017874839,0.00021822129,0.00008046278,0.00039212045,0.00052195136,0.00070906384,0.00006175881,0.0000482971],"category_scores_gemma":[0.00005668731,0.00016069971,0.00013249824,0.0002607402,0.00011724162,0.00050275255,0.00020957216,0.000106696316,0.000284869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060987873,0.0001409359,0.001052069,0.000053892145,0.000032542586,0.0000023842451,0.0004313433,0.0009230119,0.00002522544,0.95564353,0.008042841,0.033646125],"study_design_scores_gemma":[0.00040717624,0.00014529083,0.009872139,0.0000037916427,0.000003596941,0.000015975833,0.000016490221,0.35511613,0.000014157702,0.61171955,0.022463636,0.00022205977],"about_ca_topic_score_codex":0.00008591873,"about_ca_topic_score_gemma":0.000024439909,"teacher_disagreement_score":0.8693396,"about_ca_system_score_codex":0.00006100781,"about_ca_system_score_gemma":0.000112700014,"threshold_uncertainty_score":0.65531445},"labels":[],"label_agreement":null},{"id":"W2125063528","doi":"10.1007/s00037-013-0059-7","title":"Is Valiant–Vazirani’s isolation probability improvable?","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Alexander von Humboldt-Stiftung; National Science Foundation","keywords":"Lemma (botany); Combinatorics; Randomized algorithm; Discrete mathematics; Time complexity; Isolation (microbiology); Upper and lower bounds; Mathematics; Satisfiability; Computer science","score_opus":0.07230848095357204,"score_gpt":0.27751235173216143,"score_spread":0.2052038707785894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125063528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0744851,0.000051454546,0.9154986,0.0048282067,0.00048335028,0.0007097003,0.00002428863,0.0004956978,0.0034236035],"genre_scores_gemma":[0.61804664,9.3651704e-7,0.38038582,0.0012334125,0.00009493266,0.00005114231,0.000036107213,0.00001073591,0.00014028516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974001,0.00016460939,0.00053254183,0.0007836371,0.0006556235,0.0004634968],"domain_scores_gemma":[0.9979873,0.00024836633,0.00018678926,0.0007407529,0.0006344562,0.00020235676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039592542,0.0002827485,0.00029195176,0.00016155188,0.00053667946,0.00048754146,0.0012069796,0.00008986174,0.00078705605],"category_scores_gemma":[0.00006219008,0.0002850769,0.00019383337,0.0007852116,0.0002901052,0.001340584,0.00049952953,0.00027926362,0.00076635554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001132002,0.00048070666,0.0050294036,0.00009035014,0.000072002986,0.000003993822,0.00094415765,0.0053144707,0.00022477625,0.9398738,0.014283343,0.033671677],"study_design_scores_gemma":[0.0002174774,0.000044121403,0.07492627,0.0000074675004,0.000002622082,0.000011665778,0.000005288907,0.42162776,0.000054645123,0.5022903,0.0006244151,0.00018797965],"about_ca_topic_score_codex":0.00027451396,"about_ca_topic_score_gemma":0.000013477116,"teacher_disagreement_score":0.5435615,"about_ca_system_score_codex":0.00010705228,"about_ca_system_score_gemma":0.00014525991,"threshold_uncertainty_score":0.9999601},"labels":[],"label_agreement":null},{"id":"W2167854544","doi":"10.1007/s00037-010-0294-0","title":"Interpolation of Shifted-Lacunary Polynomials","year":2010,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lacunary function; Mathematics; Combinatorics; Interpolation (computer graphics); Polynomial; Logarithm; Degree (music); Modulo; Discrete mathematics; Prime (order theory); Exponent; Representation (politics); Rational function; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.031052942470248285,"score_gpt":0.2759480848059405,"score_spread":0.24489514233569223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167854544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46462458,0.000011187843,0.5310429,0.00038664823,0.00038794594,0.0000740985,0.000008960487,0.00010930915,0.003354406],"genre_scores_gemma":[0.7969331,1.4044997e-7,0.20284002,0.00014125828,0.000057011544,0.0000028204563,0.00001467621,0.000003937202,0.000007016077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990333,0.00009470724,0.00027431428,0.00023750699,0.000226199,0.00013399744],"domain_scores_gemma":[0.9990093,0.0003164158,0.00014266798,0.0003162201,0.0001479807,0.000067380344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041235465,0.000103394916,0.00015036803,0.00016936593,0.000116716314,0.000054958233,0.0006554416,0.000052452266,0.00013576212],"category_scores_gemma":[0.000058152593,0.00010559909,0.00010481493,0.00036877082,0.00021836211,0.00030377612,0.00021801109,0.00019872324,0.00002542216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016323207,0.00007274232,0.0015346468,0.000007668739,0.00001326896,9.408795e-7,0.0002470913,0.00015728163,0.0022191345,0.99017036,0.00026915854,0.0052913805],"study_design_scores_gemma":[0.00017601528,0.000051952906,0.082492165,0.0000068802387,0.0000029355797,0.000011671061,0.000006495755,0.10549893,0.00040829953,0.810923,0.0003148547,0.00010679983],"about_ca_topic_score_codex":0.000011773469,"about_ca_topic_score_gemma":0.000010468751,"teacher_disagreement_score":0.33230853,"about_ca_system_score_codex":0.0000063105936,"about_ca_system_score_gemma":0.00005637214,"threshold_uncertainty_score":0.43062058},"labels":[],"label_agreement":null},{"id":"W2177980858","doi":"10.1007/s00037-008-0250-4","title":"Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems","year":2008,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gas meter prover; Mathematics; Discrete mathematics; XOR gate; Function (biology); Repetition (rhetorical device); Class (philosophy); Automated theorem proving; Computer science; Algorithm; Mathematical proof","score_opus":0.10071733271677694,"score_gpt":0.293439077805599,"score_spread":0.1927217450888221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177980858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04537351,0.00021922817,0.94955754,0.0010745877,0.0010438147,0.0013467465,0.00005332115,0.00053043594,0.0008008387],"genre_scores_gemma":[0.7646334,0.0000022451404,0.23446406,0.00018606462,0.0003105213,0.00017563619,0.00012140251,0.000020712841,0.00008593304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673176,0.000349907,0.000662099,0.0009895241,0.0007439409,0.00052277703],"domain_scores_gemma":[0.99698263,0.0010081459,0.00027785383,0.0007474194,0.00079085486,0.00019308463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008865595,0.00034244134,0.00047520341,0.00017421403,0.00081261696,0.00020421916,0.0011578705,0.00010523796,0.000022477449],"category_scores_gemma":[0.00020931405,0.00033080208,0.00026330602,0.00048420133,0.0004026644,0.0005059256,0.000385578,0.0002203125,0.00006280926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004538076,0.00031795914,0.00059449417,0.000095605144,0.000037349007,0.00001721736,0.00038946755,0.13000712,0.0000180685,0.8651519,0.001986024,0.0013394444],"study_design_scores_gemma":[0.0005615313,0.00022085711,0.015687013,0.000016912296,0.0000051842053,0.0002145811,0.000009552056,0.63143504,0.000015770775,0.3505,0.0010670812,0.0002665002],"about_ca_topic_score_codex":0.000055300763,"about_ca_topic_score_gemma":0.000006459121,"teacher_disagreement_score":0.7192599,"about_ca_system_score_codex":0.00022182731,"about_ca_system_score_gemma":0.00030544016,"threshold_uncertainty_score":0.9999144},"labels":[],"label_agreement":null},{"id":"W2395991959","doi":"10.1007/s00037-017-0156-0","title":"The Average Sensitivity of Bounded-Depth Formulas","year":2017,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley","keywords":"Bounded function; Omega; Lemma (botany); Mathematics; Boolean function; Combinatorics; Upper and lower bounds; Sensitivity (control systems); Parity (physics); Function (biology); Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.06812620353572955,"score_gpt":0.30958691097718677,"score_spread":0.2414607074414572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395991959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06194871,0.000060051596,0.92756474,0.002318593,0.0006636795,0.00018760272,0.000023532824,0.00011056762,0.0071225367],"genre_scores_gemma":[0.93132246,0.000005625642,0.0683644,0.00012793158,0.00008741315,0.0000046515643,0.000008480822,0.0000068174963,0.00007221602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823123,0.00019265675,0.00033815956,0.00035585833,0.00057136285,0.0003107065],"domain_scores_gemma":[0.99702406,0.000912213,0.00039456,0.0012317534,0.00034221934,0.000095196156],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001122379,0.00017103582,0.0002338026,0.000057618436,0.00295013,0.00065948133,0.0017336225,0.000044216373,0.000008612183],"category_scores_gemma":[0.00026800975,0.00013862013,0.00017921637,0.00012852886,0.0009990749,0.00060417707,0.0010556258,0.00021073225,0.000027461945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011147824,0.00006628954,0.0016667894,0.0000096908225,0.000032811015,0.000010694363,0.00012674258,0.0021607634,0.000024249,0.96677256,0.0003645722,0.028753709],"study_design_scores_gemma":[0.00017919161,0.000023004877,0.18254559,0.0000085045685,0.000001575633,0.000020702648,0.000003445038,0.3540547,0.000089782225,0.46140975,0.0015685727,0.000095179734],"about_ca_topic_score_codex":0.00017610045,"about_ca_topic_score_gemma":0.000337046,"teacher_disagreement_score":0.86937374,"about_ca_system_score_codex":0.00004022433,"about_ca_system_score_gemma":0.00013532155,"threshold_uncertainty_score":0.9983479},"labels":[],"label_agreement":null},{"id":"W2399132114","doi":"10.1007/s00037-018-0166-6","title":"The Landscape of Communication Complexity Classes","year":2018,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Computer science; Communication complexity; Theoretical computer science","score_opus":0.07522345276282445,"score_gpt":0.31081136914360635,"score_spread":0.23558791638078191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399132114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06206445,0.0004944842,0.91236037,0.0054069543,0.00066866225,0.00036458633,0.000044289514,0.00034370477,0.018252524],"genre_scores_gemma":[0.83690256,0.000013806549,0.1626255,0.00024850306,0.0001076678,0.000009907353,0.00003560059,0.00000799611,0.000048471094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978736,0.00032503647,0.0005288681,0.00036319206,0.0005882421,0.00032108586],"domain_scores_gemma":[0.9965973,0.0010661159,0.0003114687,0.0010949284,0.0008328183,0.000097397446],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007708585,0.0001899841,0.000252602,0.00011418676,0.0014066026,0.0002287854,0.0024403713,0.000053728465,0.000070503884],"category_scores_gemma":[0.00012222456,0.00015323762,0.00014024496,0.00080357277,0.0023394504,0.0003630784,0.0008885439,0.00022369875,0.000069275855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018235804,0.00009554365,0.0009128219,0.000008114895,0.000034155666,5.550298e-7,0.00028262768,0.00032689577,0.00001412106,0.9854612,0.0035750214,0.009270744],"study_design_scores_gemma":[0.0002567318,0.000120957935,0.066410005,0.000016436645,0.0000042577162,0.000014626358,0.000036700963,0.28376862,0.00010917276,0.64425015,0.004873034,0.00013930503],"about_ca_topic_score_codex":0.00006752734,"about_ca_topic_score_gemma":0.00018831543,"teacher_disagreement_score":0.7748381,"about_ca_system_score_codex":0.000034317574,"about_ca_system_score_gemma":0.00014290573,"threshold_uncertainty_score":0.9998934},"labels":[],"label_agreement":null},{"id":"W2402456376","doi":"10.1007/s00037-016-0124-0","title":"The Minimum Oracle Circuit Size Problem","year":2016,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Circuit complexity; Complexity class; Mathematics; Kolmogorov complexity; Bounded function; Discrete mathematics; Variety (cybernetics); Function (biology); Computational complexity theory; Combinatorics; Random oracle; PSPACE; Computer science; Time complexity; Algorithm; Electronic circuit; Statistics","score_opus":0.057049807582766204,"score_gpt":0.27272874210327475,"score_spread":0.21567893452050854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402456376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018271485,0.00013629848,0.96279746,0.013339233,0.0007082861,0.00048222998,0.000020834694,0.0005591777,0.0036850208],"genre_scores_gemma":[0.84702444,0.000003848245,0.15174924,0.0004712429,0.00021246345,0.000042967597,0.000004214178,0.000017676295,0.0004739241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684775,0.00033562796,0.0005694438,0.0008036304,0.0008412541,0.00060231145],"domain_scores_gemma":[0.99376357,0.004317248,0.00022106979,0.00094434916,0.0005440687,0.00020970005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009773539,0.00028372149,0.0002731787,0.00006084559,0.00085764297,0.00040104156,0.002284273,0.00007005476,0.00008922511],"category_scores_gemma":[0.00039704412,0.0001731872,0.0001716687,0.0005745467,0.00060210365,0.0005145274,0.0010097024,0.00017749303,0.00041938928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016561975,0.00020946139,0.001303133,0.000015878884,0.00004671085,0.000012954414,0.00025772915,0.0011818713,0.00017549652,0.78906727,0.0035140864,0.20419885],"study_design_scores_gemma":[0.00053976494,0.00008010831,0.08092336,0.00001661912,0.0000038188828,0.00004575399,0.0000070741603,0.06780775,0.000049543036,0.84128845,0.008955023,0.0002827181],"about_ca_topic_score_codex":0.000021851203,"about_ca_topic_score_gemma":0.000027800206,"teacher_disagreement_score":0.82875293,"about_ca_system_score_codex":0.00021612302,"about_ca_system_score_gemma":0.000286148,"threshold_uncertainty_score":0.70623696},"labels":[],"label_agreement":null},{"id":"W256395497","doi":"10.1007/s00037-007-0231-z","title":"New Results on the Complexity of the Middle Bit of Multiplication","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Omega; Integer (computer science); Mathematics; Binary logarithm; Multiplication (music); Upper and lower bounds; Space (punctuation); Discrete mathematics; Arithmetic; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.16132877308405602,"score_gpt":0.2907668538330652,"score_spread":0.1294380807490092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W256395497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11704991,0.00011569647,0.82459104,0.04789259,0.00056756067,0.0009716057,0.00024427386,0.00018277201,0.008384525],"genre_scores_gemma":[0.84100866,0.0000013150512,0.15817252,0.000573756,0.00011607123,0.0000063141397,0.00001894158,0.0000070923456,0.00009531961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975874,0.00026058473,0.00069134816,0.00041846032,0.0008079082,0.00023432395],"domain_scores_gemma":[0.997036,0.0008779676,0.0005312418,0.0011200106,0.0003504868,0.00008428928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005904019,0.00019945974,0.00026851575,0.00010553826,0.00038769515,0.000053489737,0.0022281422,0.000054290445,0.00004988909],"category_scores_gemma":[0.00020171017,0.00013260003,0.000239649,0.00090943376,0.00096810533,0.00019718631,0.000572719,0.00026846718,0.00003228268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039247512,0.00019444645,0.00013185907,0.000013332652,0.000026619331,1.5032306e-7,0.0006893452,0.02122849,0.00010443193,0.9651608,0.0030543283,0.009356951],"study_design_scores_gemma":[0.0006193276,0.000075507094,0.097867556,0.0000576648,0.0000064875735,0.0000063462903,0.000020558015,0.36836138,0.0021043874,0.5283886,0.0023451985,0.00014697405],"about_ca_topic_score_codex":0.00017948714,"about_ca_topic_score_gemma":0.0001032684,"teacher_disagreement_score":0.72395873,"about_ca_system_score_codex":0.00005962079,"about_ca_system_score_gemma":0.00018830193,"threshold_uncertainty_score":0.54072726},"labels":[],"label_agreement":null},{"id":"W2565232885","doi":"10.1007/s00037-007-0229-6","title":"The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Concatenation (mathematics); Natural number; Intersection (aeronautics); Computer science; Discrete mathematics; Set (abstract data type); Integer (computer science); Prime (order theory); Electronic circuit; Range (aeronautics); Mathematics; Time complexity; Computational complexity theory; Circuit complexity; Combinatorics; Algorithm","score_opus":0.09899804868414189,"score_gpt":0.3208446374831788,"score_spread":0.22184658879903693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565232885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08614844,0.00038591772,0.9075696,0.0010054341,0.0011803414,0.0009573356,0.00012844722,0.00014966032,0.002474851],"genre_scores_gemma":[0.8946477,0.000002133777,0.105026506,0.00014025788,0.000067462235,0.000012679268,0.000056276072,0.00001310583,0.0000338701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712586,0.00013056507,0.0008966723,0.00047536922,0.00084230205,0.0005292429],"domain_scores_gemma":[0.9958675,0.0020367277,0.00057712063,0.00059114746,0.0007972124,0.00013031844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760705,0.0002590713,0.0004226683,0.00016295734,0.00056421227,0.000086394066,0.001629072,0.00007614165,0.0000215027],"category_scores_gemma":[0.00017546809,0.00022049797,0.00033159516,0.0007932011,0.0018359885,0.00031865056,0.0003746812,0.00026074628,0.0000034993848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043843447,0.00016425147,0.00087564305,0.00012804162,0.00008984433,0.0000012700756,0.0005792422,0.0021336162,0.00013205338,0.9847183,0.00063204137,0.010501825],"study_design_scores_gemma":[0.00072289916,0.00010287029,0.07882291,0.000039983373,0.000010305782,0.00001652312,0.000041739833,0.19217196,0.0004967083,0.72648215,0.00087578286,0.0002161941],"about_ca_topic_score_codex":0.00011776346,"about_ca_topic_score_gemma":0.00033478724,"teacher_disagreement_score":0.8084993,"about_ca_system_score_codex":0.00007735688,"about_ca_system_score_gemma":0.00015984099,"threshold_uncertainty_score":0.8991646},"labels":[],"label_agreement":null},{"id":"W2789382863","doi":"10.1007/978-1-4614-1800-9_35","title":"Complex Gene Regulatory Networks – from Structure to Biological Observables: Cell Fate Determination","year":2011,"lang":"en","type":"book-chapter","venue":"Computational Complexity","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Terminology; Glossary; Gene regulatory network; Boolean network; Systems biology; Computer science; Subject (documents); Computational biology; And-inverter graph; Observable; Network dynamics; Biology; Theoretical computer science; Gene; Boolean function; Boolean expression; Mathematics; Genetics; Gene expression; Philosophy; Library science; Linguistics; Algorithm; Physics; Discrete mathematics","score_opus":0.06614006773660074,"score_gpt":0.2506371343267032,"score_spread":0.18449706659010245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789382863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50646377,0.0049132323,0.43683574,0.00019384295,0.0013436753,0.0021599524,0.0041223434,0.00027971057,0.043687727],"genre_scores_gemma":[0.9224965,0.000057157933,0.039562315,0.0009144812,0.0014048987,0.000014624855,0.023879258,0.00012414635,0.011546605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972206,0.00012011568,0.00064888585,0.0012058667,0.00040250624,0.00040205286],"domain_scores_gemma":[0.99795955,0.000050765968,0.000457549,0.0008016648,0.00043258918,0.00029790282],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001474317,0.00066784583,0.00066465425,0.00013299267,0.00024814744,0.000054927077,0.00066135515,0.00078841805,0.0009921398],"category_scores_gemma":[0.0000150359,0.0006954699,0.0003959881,0.00007717887,0.00031395728,0.0000061217756,0.0005365458,0.00031031985,0.00007207529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012329447,0.00038313598,0.0036060356,0.00013822965,0.002293698,0.000103548984,0.0002699965,0.77535284,0.09428371,0.034462817,0.058129802,0.029743247],"study_design_scores_gemma":[0.0023854868,0.0012210286,0.22580288,0.00020984617,0.00083725376,0.000071531686,0.000017617447,0.10359797,0.007782026,0.4844104,0.16817585,0.005488094],"about_ca_topic_score_codex":0.000024362838,"about_ca_topic_score_gemma":0.000098892015,"teacher_disagreement_score":0.67175484,"about_ca_system_score_codex":0.00009725212,"about_ca_system_score_gemma":0.00011632951,"threshold_uncertainty_score":0.9999211},"labels":[],"label_agreement":null},{"id":"W2805918291","doi":"10.1007/s00037-022-00231-8","title":"Quantum generalizations of the polynomial hierarchy with applications to QMA(2)","year":2022,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Hierarchy; Computer science; Quantum; Polynomial; Polynomial hierarchy; Quantum computer; Theoretical computer science; Mathematics; Algorithm; Time complexity; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.02945818609854594,"score_gpt":0.2619659994610362,"score_spread":0.23250781336249027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805918291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11843651,0.000026087851,0.8758381,0.0046808487,0.00018155026,0.00042842823,0.00007725684,0.000098573255,0.00023262526],"genre_scores_gemma":[0.8373258,1.0213792e-7,0.16144644,0.00096637633,0.00007773562,0.000098308694,0.00002585201,0.000010190541,0.000049158396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983759,0.00019194956,0.00026390512,0.00036527222,0.00059082085,0.00021216218],"domain_scores_gemma":[0.9989333,0.00014041846,0.00014914565,0.00052719546,0.00015893321,0.00009099085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019490637,0.0001322317,0.00015679016,0.00013417425,0.0011143894,0.000058276823,0.0014474642,0.000013973155,0.00002934391],"category_scores_gemma":[0.000011643558,0.00010277184,0.0000822993,0.0013939744,0.00014607268,0.00006368315,0.0011028445,0.0002176016,0.00000554357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065087197,0.00008111957,0.0004362758,0.0000047441463,0.000012387265,6.23971e-7,0.0003347901,0.73089075,0.000043454475,0.26533723,0.0010787325,0.0017734116],"study_design_scores_gemma":[0.00025081355,0.00012710558,0.025627252,0.000005740636,0.000005057949,0.000050317198,0.00001872254,0.90107554,0.00004351844,0.060488135,0.012144456,0.00016333713],"about_ca_topic_score_codex":0.000062843945,"about_ca_topic_score_gemma":0.000010833173,"teacher_disagreement_score":0.71888936,"about_ca_system_score_codex":0.00006437732,"about_ca_system_score_gemma":0.0002627021,"threshold_uncertainty_score":0.8571094},"labels":[],"label_agreement":null},{"id":"W2928599599","doi":"10.1007/s00037-021-00210-5","title":"Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity","year":2021,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Hierarchy; Randomness; Theoretical computer science; Boolean function; Product term; Boolean expression; Computer science; Mathematics; Communication complexity; Discrete mathematics; Parity function; Standard Boolean model; And-inverter graph; Two-element Boolean algebra; Algebra over a field","score_opus":0.047338408468813244,"score_gpt":0.29101494548610046,"score_spread":0.24367653701728723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928599599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11147093,0.0011199368,0.87810326,0.0032261834,0.00019304056,0.00041054093,0.000065129374,0.00015540206,0.0052555953],"genre_scores_gemma":[0.9075318,0.000017855908,0.09174912,0.00039883016,0.000022166969,0.000028564882,0.00018081558,0.000006800817,0.00006405622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976573,0.00075373874,0.0005665838,0.0004532688,0.00032502718,0.0002441043],"domain_scores_gemma":[0.99812865,0.00084196817,0.00016042276,0.0005192513,0.0002439247,0.00010576604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074221916,0.0001822391,0.0005500379,0.00010870125,0.00025942994,0.00029030556,0.00054155645,0.000051725867,0.000022888004],"category_scores_gemma":[0.00019336893,0.0001874339,0.00009215385,0.00044419148,0.00062933646,0.0003378831,0.00046725434,0.00022599423,0.000017994866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002590223,0.00012887557,0.000774685,0.000046145,0.000020445179,0.000034791952,0.000630277,0.0019475359,0.000014056713,0.9922927,0.00024481717,0.0036066435],"study_design_scores_gemma":[0.012137919,0.000011485972,0.038877793,0.000059773425,0.0000041858093,0.00007593848,0.00003487631,0.4607395,0.000011035496,0.487313,0.0005516874,0.00018280449],"about_ca_topic_score_codex":0.0000955202,"about_ca_topic_score_gemma":0.00015939007,"teacher_disagreement_score":0.79606086,"about_ca_system_score_codex":0.000054548345,"about_ca_system_score_gemma":0.00014604522,"threshold_uncertainty_score":0.7643333},"labels":[],"label_agreement":null},{"id":"W2932807114","doi":"10.1007/s00037-019-00180-9","title":"Correction to: Query-to-Communication Lifting for PNP","year":2019,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Image (mathematics); Theoretical computer science; Information retrieval; Discrete mathematics; Algorithm; Mathematics; Artificial intelligence","score_opus":0.04433134717812037,"score_gpt":0.3166030198724693,"score_spread":0.27227167269434893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932807114","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015630266,0.000018853018,0.97617966,0.002274172,0.00090220093,0.0008013614,0.0000060180664,0.0007165337,0.003470953],"genre_scores_gemma":[0.47832558,4.155021e-7,0.51994216,0.0012402713,0.000042189844,0.000041465282,0.00004126014,0.000009523184,0.00035714172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852747,0.00011297278,0.0003404803,0.00047604507,0.00028350783,0.00025953833],"domain_scores_gemma":[0.9980414,0.000619782,0.0001325258,0.0005511813,0.0005118118,0.00014333706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005503799,0.00015825781,0.00020131461,0.00023341985,0.00032697635,0.00022326948,0.0009596115,0.00004361351,0.000016758355],"category_scores_gemma":[0.00023251105,0.00017894903,0.00008558843,0.0006298019,0.000023102504,0.00028373234,0.0004075407,0.00013140914,0.0002564658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024239636,0.000067159424,0.0008234461,0.00001590939,0.000012848494,1.8543628e-7,0.00057740207,0.8223897,0.0000919466,0.13249269,0.032049987,0.011454433],"study_design_scores_gemma":[0.00022710625,0.00014345051,0.01064648,0.000056660814,0.0000020489533,0.0000059171994,0.000010157372,0.9320054,0.00022775898,0.050611738,0.0058308626,0.00023241433],"about_ca_topic_score_codex":0.00004297309,"about_ca_topic_score_gemma":0.0000108849335,"teacher_disagreement_score":0.46269533,"about_ca_system_score_codex":0.00011994294,"about_ca_system_score_gemma":0.0000968445,"threshold_uncertainty_score":0.729733},"labels":[],"label_agreement":null},{"id":"W2949775108","doi":"10.1007/978-1-4614-1800-9_147","title":"Quantum Computational Complexity","year":2011,"lang":"en","type":"book-chapter","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.08558391872999488,"score_gpt":0.2735751312171957,"score_spread":0.1879912124872008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949775108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002393673,0.00046908052,0.7981067,0.0012519317,0.0014122897,0.0006072729,0.00033890706,0.001172695,0.19640177],"genre_scores_gemma":[0.122495785,0.000028554214,0.8193676,0.0036401686,0.0018479788,0.00004034986,0.0028614297,0.0003877019,0.049330436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939749,0.00017514295,0.0013494145,0.0019377095,0.0016855008,0.0008773075],"domain_scores_gemma":[0.99561226,0.00064564997,0.0009831548,0.0013065498,0.00092441577,0.00052794744],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005867617,0.0012253538,0.0012584443,0.0006187299,0.0009901215,0.00043782583,0.0031105883,0.0004930408,0.00087112514],"category_scores_gemma":[0.00004571826,0.0012875019,0.00071780157,0.00025963516,0.0012394412,0.00037677886,0.0017555836,0.0015643319,0.0013195602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020785625,0.000116338626,0.000011005805,0.000074541276,0.00017704393,0.00008326406,0.000273881,0.054175165,5.7388166e-7,0.9299336,0.00631466,0.008819128],"study_design_scores_gemma":[0.0003608154,0.0001240035,0.0013304215,0.0001121523,0.000022708997,0.0001648342,0.0000010835147,0.42697287,8.4788957e-7,0.55027527,0.019859161,0.00077587296],"about_ca_topic_score_codex":0.00006632122,"about_ca_topic_score_gemma":0.000019005844,"teacher_disagreement_score":0.37965837,"about_ca_system_score_codex":0.00025501868,"about_ca_system_score_gemma":0.00069457275,"threshold_uncertainty_score":0.999458},"labels":[],"label_agreement":null},{"id":"W3014805183","doi":"10.1007/s00037-004-0183-5","title":"Non-Automatizability of Bounded-Depth Frege Proofs","year":2004,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Bounded function; Corollary; Mathematical proof; Mathematics; Argument (complex analysis); Discrete mathematics; Polynomial","score_opus":0.03632872527826129,"score_gpt":0.2831419397445236,"score_spread":0.24681321446626234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014805183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29717955,0.000050487535,0.7004459,0.00039659903,0.00014976348,0.00021655345,0.00005409461,0.00016441474,0.0013426292],"genre_scores_gemma":[0.70682544,8.189928e-7,0.29294926,0.00012097503,0.000028389612,0.000007650662,0.00006241352,0.000004511587,5.8290016e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827886,0.00005518282,0.00042719813,0.00046348767,0.0005250819,0.000250168],"domain_scores_gemma":[0.9986708,0.0001200063,0.00018546655,0.00062071846,0.00027939913,0.0001235679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036550034,0.0001742021,0.00026599847,0.00013432925,0.00021274699,0.00009784849,0.0009883967,0.00005811503,0.000026720114],"category_scores_gemma":[0.000044178847,0.00017528195,0.00015390459,0.00070291816,0.00040115323,0.0005834254,0.00038262378,0.0001616496,0.000034014185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009710867,0.00038899577,0.004531005,0.0000552047,0.000021687236,0.0000034441491,0.00048089077,0.005660404,0.000040306684,0.98712033,0.00021135046,0.0014766463],"study_design_scores_gemma":[0.00048485937,0.000070107926,0.26507682,0.000018070768,0.0000025406725,0.00001180262,0.00000684521,0.034948338,0.00031266414,0.69874394,0.00018550176,0.00013849745],"about_ca_topic_score_codex":0.00013854825,"about_ca_topic_score_gemma":0.000080219834,"teacher_disagreement_score":0.40964586,"about_ca_system_score_codex":0.00006857554,"about_ca_system_score_gemma":0.00026514693,"threshold_uncertainty_score":0.7147791},"labels":[],"label_agreement":null},{"id":"W3021390709","doi":"10.1007/s00037-020-00204-9","title":"Subquadratic-Time Algorithms for Normal Bases","year":2021,"lang":"en","type":"preprint","venue":"Computational Complexity","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Normal basis; Basis (linear algebra); Combinatorics; Galois group; Abelian group; Invertible matrix; Mathematics; Physics; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.07333356916538013,"score_gpt":0.3050625484096439,"score_spread":0.23172897924426378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021390709","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016032914,0.00048024938,0.97908217,0.0015718316,0.0010679682,0.0006348446,0.00020554513,0.00031444753,0.00061002263],"genre_scores_gemma":[0.17170517,0.0000058763453,0.8257752,0.0006135111,0.0003429609,0.00012725707,0.001298259,0.000025787895,0.00010594999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717706,0.00019972536,0.00055872876,0.0010175105,0.00061184197,0.00043513664],"domain_scores_gemma":[0.9972221,0.0007925807,0.00027615964,0.00077084044,0.00075256336,0.00018574129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041214837,0.00040194023,0.0005532961,0.0002525002,0.0004331523,0.0007819568,0.0014758792,0.00020926821,0.00011842386],"category_scores_gemma":[0.0000977643,0.00042502413,0.0005462021,0.00041318312,0.00023830916,0.0002904041,0.0017345856,0.00045293637,0.000034985285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073068375,0.0015512176,0.0007174486,0.0013170589,0.000932358,0.00017068938,0.0019361565,0.45159176,0.00014278745,0.48324418,0.01323999,0.04508329],"study_design_scores_gemma":[0.0003855808,0.000060180664,0.010403937,0.00008109044,0.000028465593,0.00003043384,0.000011098323,0.72962934,0.00008571877,0.25821683,0.0006251935,0.00044213491],"about_ca_topic_score_codex":0.000055654622,"about_ca_topic_score_gemma":0.00001720132,"teacher_disagreement_score":0.2780376,"about_ca_system_score_codex":0.00006727904,"about_ca_system_score_gemma":0.0006263287,"threshold_uncertainty_score":0.9998202},"labels":[],"label_agreement":null},{"id":"W3040249201","doi":"10.1007/s00037-024-00250-7","title":"KRW Composition Theorems via Lifting","year":2024,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation; Vetenskapsrådet; Natural Sciences and Engineering Research Council of Canada; European Commission; McGill University; Lunds Universitet","keywords":"Composition (language); Mathematics; Discrete mathematics; Combinatorics; Computer science; Linguistics; Philosophy","score_opus":0.03902938089658899,"score_gpt":0.28683573876716145,"score_spread":0.24780635787057245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040249201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009959347,0.00048825136,0.9793483,0.0022016917,0.0012342499,0.00017634383,0.000021944421,0.0011641054,0.005405755],"genre_scores_gemma":[0.798473,0.000002291184,0.20063826,0.00047261355,0.00026292918,0.000011517354,0.0000855162,0.000014702682,0.000039138708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793905,0.00014972995,0.0003759095,0.0006345898,0.00055167783,0.0003490634],"domain_scores_gemma":[0.99874544,0.0005099815,0.00006456826,0.00037842855,0.00016532933,0.00013624516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004683886,0.00023305528,0.00021598098,0.00026304144,0.00048303633,0.0006897009,0.0009024198,0.00006138746,0.0001322311],"category_scores_gemma":[0.000016357644,0.00023347809,0.00018582966,0.00092227996,0.00026551128,0.0007119064,0.00041774844,0.00033110895,0.00036891358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039927936,0.00006629863,0.00004825594,0.000042904652,0.00003758799,0.000036153804,0.00033599074,0.0063229944,0.00014829279,0.9525148,0.0009940091,0.039448686],"study_design_scores_gemma":[0.00008372384,0.000028172319,0.0023387945,0.0000399281,0.0000038684993,0.00008819436,0.0000036033878,0.5116644,0.00006164816,0.48401344,0.0015154303,0.0001587678],"about_ca_topic_score_codex":0.000026443635,"about_ca_topic_score_gemma":0.0000037494121,"teacher_disagreement_score":0.78851366,"about_ca_system_score_codex":0.00008990394,"about_ca_system_score_gemma":0.000102240745,"threshold_uncertainty_score":0.952096},"labels":[],"label_agreement":null},{"id":"W316638553","doi":"10.1007/s00037-008-0252-2","title":"On the Complexity of Succinct Zero-Sum Games","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Game complexity; Mathematics; Multiplicative function; Zero-sum game; Zero (linguistics); Complement (music); Discrete mathematics; Combinatorics; PSPACE; Value (mathematics); Combinatorial game theory; Class (philosophy); P; Complexity class; Time complexity; Computational complexity theory; Repeated game; Game theory; Computer science; Algorithm; Mathematical economics; Average-case complexity","score_opus":0.08495536218311425,"score_gpt":0.2882672099705096,"score_spread":0.20331184778739533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W316638553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13473773,0.00012707802,0.8368512,0.018374903,0.00042912705,0.00044317893,0.000083034014,0.00031961352,0.00863414],"genre_scores_gemma":[0.8724818,0.0000022576926,0.12544134,0.0018309923,0.00011760409,0.0000142838835,0.000028625249,0.00001258027,0.00007048486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971755,0.00030662952,0.00060224085,0.00057852705,0.0009155673,0.0004215225],"domain_scores_gemma":[0.9973446,0.0009502349,0.0002950032,0.00092425145,0.0003457952,0.00014012118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006914148,0.0003090834,0.0003921013,0.0001950434,0.0005661559,0.00015264607,0.002072928,0.000066757566,0.00031548753],"category_scores_gemma":[0.00013762974,0.00024206901,0.00026895182,0.0007617197,0.0014174461,0.00035992195,0.0005908431,0.0003884404,0.00018270728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018827739,0.0002714585,0.00012915448,0.0000131471215,0.0000391812,0.0000022528802,0.00024764292,0.014159079,0.000020651869,0.97230726,0.004441397,0.008349938],"study_design_scores_gemma":[0.00031005382,0.00009450181,0.032961193,0.000023128658,0.000004690929,0.000016489534,0.000009467255,0.31587905,0.00022294321,0.6486314,0.0016526922,0.00019440395],"about_ca_topic_score_codex":0.00007592309,"about_ca_topic_score_gemma":0.000042815012,"teacher_disagreement_score":0.7377441,"about_ca_system_score_codex":0.00008478186,"about_ca_system_score_gemma":0.00012997039,"threshold_uncertainty_score":0.9871288},"labels":[],"label_agreement":null},{"id":"W3198583770","doi":"10.1007/s00037-023-00241-0","title":"The Power of Natural Properties as Oracles","year":2023,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Combinatorics; Mathematics; Discrete mathematics; Randomized algorithm; Upper and lower bounds; Random oracle; Computer science","score_opus":0.06434584726470818,"score_gpt":0.28898157429051835,"score_spread":0.22463572702581017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198583770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86241937,0.0011545565,0.11481959,0.012289633,0.0026020964,0.0005956864,0.000028912908,0.0012641399,0.004826037],"genre_scores_gemma":[0.9862307,0.0000066914286,0.013261604,0.0001964511,0.00003881581,0.000010900512,0.000012594877,0.0000071975337,0.00023505828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984352,0.00011656667,0.0003105144,0.00028068468,0.00058146927,0.0002755712],"domain_scores_gemma":[0.9986136,0.00049369404,0.000120368,0.0004056511,0.00030993533,0.000056727433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044196763,0.00013454672,0.000161703,0.00012133549,0.00064706034,0.0001709124,0.0012471222,0.000027413913,0.00001549886],"category_scores_gemma":[0.00013889132,0.00009477321,0.00012012193,0.00097458245,0.00054903154,0.00026541884,0.00061243284,0.00016821484,0.0001827621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016831473,0.000042372194,0.00016968917,0.000014379546,0.00003550016,0.000006118008,0.0007032724,0.0036427812,0.000108587126,0.98296475,0.0026335358,0.009662151],"study_design_scores_gemma":[0.00015938513,0.000052922478,0.0405492,0.00001773624,0.0000018533927,0.000017583792,0.00008789256,0.32110623,0.00024603764,0.63483423,0.0027961507,0.00013079241],"about_ca_topic_score_codex":0.000034109293,"about_ca_topic_score_gemma":0.000013177445,"teacher_disagreement_score":0.34813058,"about_ca_system_score_codex":0.000021735994,"about_ca_system_score_gemma":0.000121656274,"threshold_uncertainty_score":0.49767303},"labels":[],"label_agreement":null},{"id":"W4210248983","doi":"10.1007/978-1-4614-1800-9_169","title":"Rough Sets: Foundations and Perspectives","year":2011,"lang":"en","type":"book-chapter","venue":"Computational Complexity","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science","score_opus":0.17885875770413145,"score_gpt":0.2942854099804757,"score_spread":0.11542665227634424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210248983","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029287768,0.0009741006,0.31725124,0.001170329,0.000250759,0.00024724615,0.000075080345,0.00022542139,0.67977655],"genre_scores_gemma":[0.16097416,0.0003072531,0.7676995,0.0016240324,0.00062228466,0.000036569356,0.00068328367,0.00011836042,0.06793456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831814,0.00003454952,0.00032585513,0.0007325916,0.00036868456,0.00022017656],"domain_scores_gemma":[0.9987273,0.00017131216,0.00022371828,0.0004510053,0.00029235767,0.00013429954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014583196,0.00034155248,0.0003476938,0.00016463068,0.00039772253,0.00024837904,0.0006734853,0.00015421752,0.00035375738],"category_scores_gemma":[0.000018833902,0.00033774876,0.00012942529,0.00006088571,0.00045257813,0.0003468231,0.000539927,0.00032793713,0.0002358537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003570778,0.000027503318,0.000008150093,0.000013871118,0.00005254871,0.000010251917,0.0007894811,0.00015893551,7.001715e-8,0.98768586,0.0017316771,0.009518108],"study_design_scores_gemma":[0.0001708501,0.000073719115,0.003428859,0.000030406183,0.000015822421,0.000056419893,0.000008361934,0.020287557,9.044939e-8,0.9445342,0.031027783,0.00036594318],"about_ca_topic_score_codex":0.000026066311,"about_ca_topic_score_gemma":0.000013663852,"teacher_disagreement_score":0.611842,"about_ca_system_score_codex":0.00009332299,"about_ca_system_score_gemma":0.00015693098,"threshold_uncertainty_score":0.99990743},"labels":[],"label_agreement":null},{"id":"W4376504252","doi":"10.1007/s00037-023-00236-x","title":"Schur Polynomials Do Not Have Small Formulas If the Determinant does not","year":2023,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.17210854399133257,"score_gpt":0.366638139190427,"score_spread":0.1945295951990944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376504252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9181822,0.000013382711,0.074017994,0.0025974954,0.0014246294,0.0011760498,0.00019914343,0.00071613595,0.0016729999],"genre_scores_gemma":[0.9545352,0.000002208701,0.0440536,0.00024636835,0.0003669344,0.000078735146,0.000037928847,0.00006366091,0.000615365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974837,0.00017527427,0.00074089016,0.00042132175,0.0006774471,0.000501407],"domain_scores_gemma":[0.99447227,0.004065668,0.00039298023,0.0006317969,0.00031236187,0.00012490586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008812026,0.00033407504,0.0004909749,0.00013860935,0.0006951571,0.00015863155,0.0007304888,0.000104801584,0.00008018528],"category_scores_gemma":[0.0013169065,0.00022112209,0.00021226547,0.00032860032,0.00029994987,0.00015227111,0.0004980132,0.00030934872,0.00030305353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007279108,0.00013636841,0.00014145894,0.0001663847,0.00006748089,0.000021907199,0.0009897867,0.002642034,0.00026630965,0.9926066,0.0014368579,0.0014520397],"study_design_scores_gemma":[0.0006558558,0.000052746564,0.0033697137,0.000058635975,0.00003599462,0.000021157937,0.00019162604,0.047048636,0.001653194,0.94562405,0.0009799511,0.00030843975],"about_ca_topic_score_codex":0.00001483012,"about_ca_topic_score_gemma":0.00004820284,"teacher_disagreement_score":0.04698253,"about_ca_system_score_codex":0.00013416442,"about_ca_system_score_gemma":0.00009723872,"threshold_uncertainty_score":0.9017097},"labels":[],"label_agreement":null},{"id":"W4415590863","doi":"10.1007/s00037-025-00278-3","title":"Separation of the Factorization Norm and Randomized Communication Complexity","year":2025,"lang":"en","type":"article","venue":"Computational Complexity","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria; Island Health; McGill University","funders":"University of Toronto; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Communication complexity; Upper and lower bounds; Randomized algorithm; Norm (philosophy); Conjecture; Nondeterministic algorithm; Logarithm; Factorization; Boolean function","score_opus":0.02315802691439623,"score_gpt":0.2658649143461981,"score_spread":0.24270688743180185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415590863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68748534,0.00040906656,0.30024657,0.00026467195,0.0003779063,0.0006586298,0.000038419683,0.00013299916,0.010386429],"genre_scores_gemma":[0.9985272,0.0000070360147,0.0012654178,0.000042380118,0.000010542253,0.000018041224,0.00008500578,0.000005450678,0.00003891221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990805,0.00028559403,0.00033306,0.000093456336,0.00013388364,0.000073505515],"domain_scores_gemma":[0.99920684,0.0003604894,0.000084325635,0.00020449322,0.00012511648,0.000018753848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037594186,0.000098608034,0.00024885553,0.000065669694,0.00018869006,0.000026763353,0.00016851566,0.000043277392,0.000015809177],"category_scores_gemma":[0.000053967535,0.000079874255,0.00007502589,0.00026400737,0.00043038442,0.00009304271,0.00005666012,0.00009699944,0.000001837231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029539308,0.000020536914,0.001677878,0.000107281485,0.00006631944,2.448508e-8,0.0003687508,0.058929544,0.00019779064,0.93787116,0.0002274604,0.00023788949],"study_design_scores_gemma":[0.0052240044,0.000003618843,0.05714762,0.000050609975,0.000022427132,0.0000012164925,0.00003832514,0.33263913,0.00028637616,0.6043698,0.00014367793,0.00007314777],"about_ca_topic_score_codex":0.000021435251,"about_ca_topic_score_gemma":0.000028618319,"teacher_disagreement_score":0.33350128,"about_ca_system_score_codex":0.00003120942,"about_ca_system_score_gemma":0.000019806528,"threshold_uncertainty_score":0.32571775},"labels":[],"label_agreement":null}]}