{"meta":{"query_hash":"e86205b3fe25","filters":{"venue":"Theory of Computing"},"cohort_total":34,"direct_labels_cover":0,"predictions_cover":34,"exported":34,"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/e86205b3fe25","api":"https://metacan.xera.ac/api/v1/cohort?venue=Theory+of+Computing"},"results":[{"id":"W153015188","doi":"10.4086/toc.2006.v002a004","title":"","year":2006,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Rank (graph theory); Combinatorics; Mathematics; Pigeonhole principle; Discrete mathematics; Upper and lower bounds","score_opus":0.013459984448297577,"score_gpt":0.2270239102562561,"score_spread":0.21356392580795852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153015188","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.4417699,0.000111531954,0.55635905,0.0001317033,0.00018738533,0.00007305925,5.4441966e-7,0.00025482662,0.0011120162],"genre_scores_gemma":[0.78794295,7.411631e-7,0.21177691,0.00011212507,0.00014116969,9.220727e-7,0.000001072282,0.000007392309,0.000016755155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753547,0.00037640758,0.0006661053,0.00047268177,0.0004261897,0.00052314525],"domain_scores_gemma":[0.99739707,0.0011602651,0.00034746635,0.00087712443,0.00015051298,0.00006755713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022349872,0.0002212435,0.0003763126,0.0002458715,0.0003749601,0.000112476824,0.0021478992,0.00005282154,0.0000030052126],"category_scores_gemma":[0.00005583499,0.00022187555,0.00019815455,0.0008799383,0.000300404,0.0004862027,0.00088985835,0.00019237249,0.0000021865162],"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.00000990234,0.000118337084,0.0012307578,0.000019044099,0.000012411932,0.000009049694,0.0008789822,0.0055249413,0.0020284692,0.9128605,0.0000121398225,0.07729544],"study_design_scores_gemma":[0.00046864667,0.000086958535,0.03968773,0.000059010334,0.0000050429794,0.00003943812,0.0000946626,0.14390709,0.014181292,0.8011931,0.000039943156,0.00023705982],"about_ca_topic_score_codex":0.000092489696,"about_ca_topic_score_gemma":0.0000054936486,"teacher_disagreement_score":0.34617302,"about_ca_system_score_codex":0.000019050854,"about_ca_system_score_gemma":0.000039222577,"threshold_uncertainty_score":0.90478224},"labels":[],"label_agreement":null},{"id":"W1546090284","doi":"10.4086/toc.2011.v007a007","title":"","year":2011,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research; W. M. Keck Foundation; National Science Foundation","keywords":"Gas meter prover; Expressive power; Discrete mathematics; Computer science; Mathematics; Logarithm; Quantum; Theoretical computer science; Mathematical proof; Quantum mechanics","score_opus":0.03739569460194093,"score_gpt":0.23011846106527764,"score_spread":0.19272276646333672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546090284","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.46096858,0.00006734686,0.5373709,0.000011246373,0.0001255312,0.00005993227,0.0000010609226,0.00017445737,0.0012208989],"genre_scores_gemma":[0.744587,0.000002281398,0.25525627,0.00012199298,0.00002630046,6.364801e-7,7.6806873e-7,0.000004531559,2.384487e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980654,0.00036820184,0.00047840437,0.00041941946,0.00025875113,0.00040983525],"domain_scores_gemma":[0.9978964,0.00047896436,0.00029260435,0.0010991673,0.00011126787,0.000121644334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025138075,0.00017561259,0.00028975162,0.00020524331,0.00021145817,0.000039007708,0.0023315132,0.000051949668,0.000008409],"category_scores_gemma":[0.000085927786,0.00016738384,0.00016121531,0.0007044252,0.00023866004,0.00079631107,0.0010042267,0.0001668896,0.0000024024332],"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.000037726662,0.00014188817,0.0036609443,0.00001913595,0.000023982058,0.0000080364025,0.027133064,0.000013298908,0.000714602,0.9149528,0.0000035014857,0.053290978],"study_design_scores_gemma":[0.0004325393,0.00018330323,0.08251051,0.000052846546,0.000008578004,0.000027827027,0.00058565487,0.0067511555,0.026774088,0.88242394,0.000013175353,0.00023637546],"about_ca_topic_score_codex":0.000041865656,"about_ca_topic_score_gemma":0.0000024801848,"teacher_disagreement_score":0.2836184,"about_ca_system_score_codex":0.0000059068916,"about_ca_system_score_gemma":0.000028848464,"threshold_uncertainty_score":0.68257153},"labels":[],"label_agreement":null},{"id":"W1942244853","doi":"10.4086/toc.2015.v011a020","title":"","year":2015,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum many-body systems","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Boson; Hamiltonian (control theory); Subspace topology; Bose–Hubbard model; Mathematics; Hubbard model; Combinatorics; Physics; Discrete mathematics; Quantum mechanics; Superconductivity","score_opus":0.030826224244160816,"score_gpt":0.26661172615985257,"score_spread":0.23578550191569175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1942244853","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.8143977,0.000038889397,0.17807104,0.00003248067,0.0002907475,0.00015593295,0.0000027895967,0.00006536471,0.0069450727],"genre_scores_gemma":[0.9981769,1.7155271e-8,0.0010499288,0.000021862934,0.0006714757,0.000002096464,0.000005258979,0.000023195566,0.000049281396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980761,0.00046195873,0.0005544935,0.00024300859,0.00029124998,0.00037321853],"domain_scores_gemma":[0.9983751,0.00042582254,0.00042270063,0.00041081794,0.00018993596,0.00017562219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002911024,0.0001891208,0.00041909458,0.000081081635,0.000101984915,0.000033224107,0.00040477669,0.000025611605,0.000013898274],"category_scores_gemma":[0.000036520858,0.00018001426,0.00012258206,0.00019740658,0.00014143407,0.00014970041,0.00020022498,0.00014237304,0.000014921802],"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.000057710182,0.00008655594,0.0838595,0.000019199382,0.00007951158,0.0000011223005,0.0090332115,0.004082284,0.0012350776,0.88904464,0.000043006443,0.0124581875],"study_design_scores_gemma":[0.003537654,0.0003131408,0.017255701,0.00032016443,0.00006831875,0.000007734035,0.04082831,0.107500285,0.020107433,0.80916697,0.00021780086,0.000676503],"about_ca_topic_score_codex":0.00017240294,"about_ca_topic_score_gemma":3.4945447e-7,"teacher_disagreement_score":0.18377921,"about_ca_system_score_codex":0.000017949767,"about_ca_system_score_gemma":0.000079062855,"threshold_uncertainty_score":0.7340769},"labels":[],"label_agreement":null},{"id":"W2099170023","doi":"10.4086/toc.2009.v005a005","title":"","year":2009,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs; National Science Foundation","keywords":"Hamiltonian (control theory); Quantum algorithm; Quantum; Quantum computer; Point (geometry); Running time; Hamiltonian path","score_opus":0.009077966139590523,"score_gpt":0.23556527225177484,"score_spread":0.22648730611218432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099170023","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.49026546,0.00010753992,0.5081469,0.00069020176,0.00014381969,0.00008362542,2.3151217e-7,0.00036440426,0.00019786513],"genre_scores_gemma":[0.79898554,0.0000014383462,0.19999306,0.00086097815,0.00014501021,2.46037e-7,5.1044935e-7,0.0000075893054,0.000005632227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693644,0.00048435226,0.00072909147,0.00064107036,0.0004934127,0.00071561977],"domain_scores_gemma":[0.997225,0.0009207086,0.00044295366,0.0010776588,0.00015717366,0.00017649373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026446285,0.00031998137,0.0005285808,0.00027030654,0.00039477658,0.00013176826,0.0025978126,0.00007456071,0.0000010116635],"category_scores_gemma":[0.00015997383,0.00028628504,0.00022408551,0.0008931937,0.00012721152,0.0003470083,0.00049300224,0.00035689643,0.0000016408177],"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.000016698677,0.00010123216,0.000120476274,0.000009427778,0.0000137715215,0.000015461512,0.00570766,0.048856076,0.0043039112,0.42836177,0.0000042163233,0.51248926],"study_design_scores_gemma":[0.0005118769,0.00048332888,0.028595828,0.00011592727,0.000005358049,0.000096386124,0.00007299863,0.6068652,0.009866159,0.35308853,0.0000125572105,0.0002858646],"about_ca_topic_score_codex":0.000004341758,"about_ca_topic_score_gemma":1.7140532e-7,"teacher_disagreement_score":0.55800915,"about_ca_system_score_codex":0.000019193505,"about_ca_system_score_gemma":0.0000609067,"threshold_uncertainty_score":0.99995893},"labels":[],"label_agreement":null},{"id":"W2116560510","doi":"10.4086/toc.2015.v011a003","title":"","year":2015,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Office of Naval Research; Industry Canada; Centre de Recherches Mathématiques; Canada Research Chairs; Government of Canada; McGill University; Institut Périmètre de physique théorique; Canadian Institute for Advanced Research","keywords":"LOCC; Quantum entanglement; Separable space; Separable state; Quantum complexity theory; Quantum state; Hilbert space; State (computer science); Class (philosophy)","score_opus":0.02375489289472492,"score_gpt":0.25114493347704003,"score_spread":0.2273900405823151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116560510","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.49054527,0.00013603576,0.5080619,0.0002789263,0.00033357815,0.00008063352,3.1786524e-7,0.00033094216,0.00023242978],"genre_scores_gemma":[0.7768318,5.133751e-7,0.22271495,0.00026302866,0.00016645165,6.937603e-7,6.1251023e-7,0.000013421803,0.000008541797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966281,0.0007341326,0.0007019128,0.0006031996,0.0006698263,0.0006628343],"domain_scores_gemma":[0.9967455,0.0010100605,0.00044860842,0.0010776324,0.00034343055,0.00037472433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005078183,0.00030118975,0.00051649427,0.0002542122,0.00022511318,0.00012914812,0.0026285553,0.00007299872,4.944966e-7],"category_scores_gemma":[0.00042433667,0.00026679458,0.00016486281,0.00089102396,0.00020776888,0.0003779797,0.0015139568,0.0003255919,0.000003522927],"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.000040975137,0.00012756312,0.0011075007,0.000026987052,0.000041541043,0.00003141678,0.026914066,0.2055632,0.00082519255,0.4797151,0.000027518041,0.28557894],"study_design_scores_gemma":[0.00090659497,0.0003236465,0.0029336205,0.0000899057,0.000005924475,0.00013006793,0.0004286836,0.73514736,0.004885744,0.2548149,0.000045058445,0.00028847216],"about_ca_topic_score_codex":0.00002157833,"about_ca_topic_score_gemma":6.4151124e-7,"teacher_disagreement_score":0.52958417,"about_ca_system_score_codex":0.00003419414,"about_ca_system_score_gemma":0.00017962694,"threshold_uncertainty_score":0.9999784},"labels":[],"label_agreement":null},{"id":"W2122271558","doi":"10.4086/toc.2010.v006a001","title":"","year":2010,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; European Social Fund; Latvijas Universitate; State Education Development Agency Republic of Latvia; Mitacs; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Extension (predicate logic); Mathematics; Product (mathematics); Adversary; Quantum; Discrete mathematics; Computer science; Quantum mechanics","score_opus":0.007055393626629365,"score_gpt":0.22917347887980083,"score_spread":0.22211808525317148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122271558","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.5139982,0.000019271944,0.48449624,0.0002623118,0.0006515784,0.000082942344,4.083239e-7,0.00033222605,0.00015680154],"genre_scores_gemma":[0.72551686,3.9101099e-7,0.2740263,0.00020829558,0.00022750985,7.3617247e-7,4.836789e-7,0.000013721054,0.0000056757067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971376,0.0003383186,0.00069041026,0.00066084444,0.0004788673,0.0006939791],"domain_scores_gemma":[0.9960885,0.0016647226,0.0004555213,0.0013851218,0.00019949135,0.0002066559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036118496,0.00031318763,0.00047228968,0.00026268145,0.00045427564,0.00014957675,0.0031453322,0.000110306864,0.0000035702685],"category_scores_gemma":[0.00032869092,0.0002777976,0.00021368041,0.0007502226,0.00031263925,0.0003283146,0.0013213091,0.0008975555,0.000002728866],"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.000012038226,0.000090920585,0.0009805249,0.000023172835,0.00002372435,0.000012887556,0.0062152715,0.011207742,0.057278156,0.59177226,0.0000032145535,0.3323801],"study_design_scores_gemma":[0.0005455764,0.00015187841,0.020554885,0.00005597787,0.000006118547,0.00018347934,0.00008016779,0.7296237,0.03361008,0.21479584,0.000049111542,0.00034321775],"about_ca_topic_score_codex":0.000015180743,"about_ca_topic_score_gemma":0.0000035647154,"teacher_disagreement_score":0.7184159,"about_ca_system_score_codex":0.0000067461247,"about_ca_system_score_gemma":0.00008644105,"threshold_uncertainty_score":0.9999674},"labels":[],"label_agreement":null},{"id":"W2153235257","doi":"10.4086/toc.2009.v005a011","title":"","year":2009,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":198,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Mathematical proof; TRACE (psycholinguistics); Bounded function; Mathematics; Semidefinite programming; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical optimization; Mathematical analysis","score_opus":0.06200837786253834,"score_gpt":0.38890946106747765,"score_spread":0.3269010832049393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153235257","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.38237062,0.000028867655,0.6161327,0.00015891282,0.000023457445,0.00018038251,6.1216366e-7,0.00015132142,0.00095313287],"genre_scores_gemma":[0.6156945,0.000002514289,0.38409805,0.00008792955,0.000048628397,4.6523368e-7,8.092049e-7,0.000012807197,0.000054263266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977635,0.00041001255,0.00063384144,0.0002552506,0.0004916137,0.0004457709],"domain_scores_gemma":[0.9960346,0.0027336727,0.00033299383,0.00046841332,0.00032146755,0.00010880684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025861175,0.00017405653,0.00040632306,0.00018912401,0.00019110923,0.000019970998,0.00045395782,0.000058300677,0.000023411087],"category_scores_gemma":[0.0023679847,0.00016723524,0.000099064244,0.0004741068,0.00014888866,0.00018585003,0.00010981166,0.00023525947,0.0000014964079],"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.0001203119,0.00021197971,0.00007097495,0.00004024189,0.000021923883,0.0000066167613,0.0035294334,0.02830519,0.0025169188,0.81738937,0.000011319162,0.14777575],"study_design_scores_gemma":[0.00076509855,0.00018962706,0.0012705498,0.00009173111,0.000009682896,0.000014782879,0.0008345613,0.0684809,0.01222209,0.9159558,0.0000035603866,0.00016164995],"about_ca_topic_score_codex":5.303733e-7,"about_ca_topic_score_gemma":1.6565184e-7,"teacher_disagreement_score":0.23332389,"about_ca_system_score_codex":0.00003842685,"about_ca_system_score_gemma":0.000035345558,"threshold_uncertainty_score":0.68196553},"labels":[],"label_agreement":null},{"id":"W2168814002","doi":"10.4086/toc.2011.v007a002","title":"","year":2011,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Industry Canada; Mitacs; Government of Canada","keywords":"Permutation (music); Mathematics; Reduction (mathematics); Combinatorics; Discrete mathematics; Quantum","score_opus":0.023316422373446794,"score_gpt":0.22486341839625787,"score_spread":0.20154699602281106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168814002","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.49188843,0.00006582377,0.5067546,0.00003635975,0.00022491014,0.00008158597,2.945853e-7,0.00032662612,0.0006213798],"genre_scores_gemma":[0.69207764,9.832673e-7,0.3076641,0.00016887826,0.00006984307,7.3656065e-7,2.5769518e-7,0.000012711197,0.000004881927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698555,0.0005563237,0.0007328911,0.00063673663,0.00039873781,0.0006897404],"domain_scores_gemma":[0.9972757,0.00073723623,0.000488305,0.0011511523,0.00016855451,0.00017903316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002793173,0.00031247325,0.00048723214,0.00027020855,0.0003420535,0.00005494975,0.002935171,0.000075154516,0.0000049727464],"category_scores_gemma":[0.00012886172,0.00027730843,0.00021633225,0.0007581153,0.00025103675,0.00034988474,0.0013425977,0.0003282753,0.0000031407608],"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.000035386765,0.00017121466,0.0016152846,0.000034514316,0.000049712125,0.000030928637,0.047798153,0.0041538705,0.0015177361,0.6457277,0.0000024604049,0.29886305],"study_design_scores_gemma":[0.0006127246,0.00040093606,0.046008922,0.00014492427,0.000010749598,0.00013667729,0.00032461327,0.5474607,0.03115196,0.37332612,0.0000078473195,0.00041384678],"about_ca_topic_score_codex":0.000036238187,"about_ca_topic_score_gemma":7.5942677e-7,"teacher_disagreement_score":0.54330677,"about_ca_system_score_codex":0.000014086105,"about_ca_system_score_gemma":0.00006158232,"threshold_uncertainty_score":0.99996793},"labels":[],"label_agreement":null},{"id":"W2185716868","doi":"10.4086/toc.2012.v008a012","title":"","year":2012,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Predicate (mathematical logic); Constraint satisfaction problem; Pairwise independence; Discrete mathematics; Hierarchy; Pairwise comparison; Semidefinite programming; Random variable; Omega; Mathematical optimization; Multivariate random variable; Sum of normally distributed random variables; Probabilistic logic; Computer science","score_opus":0.030771538958363084,"score_gpt":0.2621209887200663,"score_spread":0.23134944976170319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185716868","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.45102587,0.0002848426,0.54734296,0.00008320751,0.00044325626,0.000069196554,3.5856704e-7,0.00019585679,0.00055446627],"genre_scores_gemma":[0.7849762,0.0000020100706,0.21458401,0.0002176002,0.00020501982,0.0000010312223,4.3981987e-7,0.000007512942,0.0000061663204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743664,0.00051027,0.00053686154,0.0002972402,0.00040739277,0.0008116148],"domain_scores_gemma":[0.99707824,0.0013940253,0.0003089841,0.00089522044,0.00010754788,0.00021600076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004401643,0.00021379566,0.0003624918,0.00021472834,0.00034769325,0.000062260544,0.0019843047,0.000053710057,0.0000051763977],"category_scores_gemma":[0.00014812185,0.00020753112,0.00018368477,0.00077102793,0.00024850847,0.0011576867,0.0012127417,0.00022045002,0.0000046760656],"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.000008655316,0.00014929746,0.00529656,0.000020424626,0.000024521338,0.0000011062707,0.009489251,0.00028014343,0.000967373,0.8290283,0.0000046256882,0.15472971],"study_design_scores_gemma":[0.0008901054,0.00018779551,0.1439636,0.00014551556,0.000018492665,0.00013894762,0.0009780123,0.092458665,0.03266948,0.7277459,0.00016782645,0.00063566066],"about_ca_topic_score_codex":0.000009107299,"about_ca_topic_score_gemma":3.1720805e-7,"teacher_disagreement_score":0.33395034,"about_ca_system_score_codex":0.000019440564,"about_ca_system_score_gemma":0.000026651624,"threshold_uncertainty_score":0.84628737},"labels":[],"label_agreement":null},{"id":"W2201916012","doi":"10.4086/toc.2018.v014a011","title":"","year":2018,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; University of Ottawa","keywords":"Computer science; Quantum computer; Gas meter prover; Soundness; Theoretical computer science; Encryption; Quantum entanglement; Computation; Qubit; Quantum algorithm; Algorithm; Quantum; Discrete mathematics; Mathematics; Quantum mechanics","score_opus":0.015333802026982236,"score_gpt":0.2533487615405014,"score_spread":0.23801495951351917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201916012","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.47392207,0.000043723117,0.5249979,0.00006430335,0.0002038017,0.000055772947,0.0000011994434,0.00017162341,0.0005396024],"genre_scores_gemma":[0.8263651,0.0000013717814,0.17315044,0.00028657445,0.00018962662,4.5826388e-7,0.0000010436765,0.0000049322066,4.2043925e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795973,0.00037336888,0.00045565056,0.0004575292,0.000313871,0.0004398271],"domain_scores_gemma":[0.9974715,0.0007503068,0.00027286302,0.0011533306,0.00023607336,0.0001159025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028630022,0.00017092733,0.00027879144,0.00020380526,0.00038708028,0.000091591,0.002234714,0.000051838026,0.0000061116057],"category_scores_gemma":[0.00014770309,0.0001627168,0.0001327778,0.00094463385,0.0005979726,0.0007130589,0.0011419099,0.00014013522,0.0000056430335],"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.00003291906,0.000071436734,0.0014148251,0.000013785097,0.000019919325,0.0000025898275,0.009180604,0.000016341388,0.0026528533,0.90859306,0.000017141538,0.07798452],"study_design_scores_gemma":[0.0005937858,0.00043535288,0.032567292,0.00008126636,0.0000081396565,0.00003202088,0.00038440537,0.032680728,0.045492228,0.8873002,0.00014119159,0.00028340972],"about_ca_topic_score_codex":0.000016010576,"about_ca_topic_score_gemma":0.000004398711,"teacher_disagreement_score":0.35244307,"about_ca_system_score_codex":0.00000780298,"about_ca_system_score_gemma":0.000036904985,"threshold_uncertainty_score":0.6635398},"labels":[],"label_agreement":null},{"id":"W2280059905","doi":"10.4086/toc.2015.v011a001","title":"","year":2015,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Independent and identically distributed random variables; Completeness (order theory); Discrete mathematics; Bounded function; Distribution (mathematics); Pairwise independence; Pairwise comparison; Joint probability distribution; Uncorrelated; Independence (probability theory); Random variable; Mathematical analysis; Statistics","score_opus":0.06171816415099145,"score_gpt":0.27406741929279277,"score_spread":0.2123492551418013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280059905","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.40355933,0.00013117773,0.59452116,0.00020164906,0.00036425513,0.00007698518,3.8796674e-7,0.0002517801,0.0008932578],"genre_scores_gemma":[0.76032573,8.0720844e-7,0.23935513,0.00021141797,0.00008960124,8.270486e-7,4.9748814e-7,0.0000067319766,0.000009231105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973903,0.0005542217,0.0005641436,0.00044225683,0.00056688575,0.00048223714],"domain_scores_gemma":[0.99722266,0.0009022918,0.00031120353,0.0009766058,0.00031896768,0.00026829474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004707155,0.00020849331,0.00039195758,0.0002297112,0.00019770939,0.00010343378,0.0025575415,0.000051919225,0.000001163673],"category_scores_gemma":[0.0003326391,0.00020364375,0.00014485745,0.000896598,0.00028812073,0.000627015,0.0013912213,0.00020972973,0.000003850013],"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.000022784297,0.000087238535,0.0007076499,0.0000125280585,0.00002196613,0.00001035977,0.010285651,0.003613397,0.00023615712,0.85378027,0.000018933019,0.13120307],"study_design_scores_gemma":[0.00082566164,0.00022921103,0.0035937089,0.00006040636,0.000005320105,0.00006144495,0.0008626531,0.21141025,0.005142434,0.77750117,0.00006669906,0.00024101221],"about_ca_topic_score_codex":0.000022104958,"about_ca_topic_score_gemma":0.0000014031094,"teacher_disagreement_score":0.35676643,"about_ca_system_score_codex":0.000029698722,"about_ca_system_score_gemma":0.00011845901,"threshold_uncertainty_score":0.8304351},"labels":[],"label_agreement":null},{"id":"W2399884099","doi":"10.4086/toc.2013.v009a003","title":"","year":2013,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Nash equilibrium; Epsilon-equilibrium; Best response; Risk dominance; Correlated equilibrium; Trembling hand perfect equilibrium; Mathematics; Mathematical economics; Symmetric equilibrium; Combinatorics; Equilibrium selection; Mathematical optimization; Game theory; Repeated game","score_opus":0.11232443874160188,"score_gpt":0.3821212525641821,"score_spread":0.26979681382258025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399884099","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.7590806,0.000027804092,0.23550104,0.0005973293,0.00007228821,0.00027194293,0.0000012406357,0.00007219295,0.0043755677],"genre_scores_gemma":[0.9934006,4.2717454e-7,0.0058277813,0.00035123882,0.000081768,0.000009904106,6.535825e-7,0.0000103425045,0.00031729357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573964,0.0012059148,0.001269533,0.00047092716,0.00093124976,0.00038274788],"domain_scores_gemma":[0.9838649,0.013369691,0.00071964256,0.0011947693,0.0006884704,0.00016254837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013251771,0.00016773106,0.00044562778,0.00024719027,0.00036926847,0.00017708243,0.0019002199,0.000055296747,0.00062412827],"category_scores_gemma":[0.0036438326,0.000122905,0.00018276145,0.0010498284,0.00054092245,0.00047221017,0.00042287624,0.00016445295,0.00045087174],"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.000020564737,0.000072729395,0.0038652152,0.0000027012961,0.000011943351,2.8875195e-7,0.004145347,0.002464962,0.023232754,0.7268167,0.00009737539,0.23926939],"study_design_scores_gemma":[0.00023016286,0.000044583994,0.10024011,0.000016322969,0.000005830012,0.000007814114,0.0068672886,0.0048834193,0.012331944,0.87517893,0.00007028714,0.00012329475],"about_ca_topic_score_codex":0.000019929812,"about_ca_topic_score_gemma":8.369404e-7,"teacher_disagreement_score":0.2391461,"about_ca_system_score_codex":0.000009635572,"about_ca_system_score_gemma":0.00002863121,"threshold_uncertainty_score":0.68337667},"labels":[],"label_agreement":null},{"id":"W2403315016","doi":"10.4086/toc.2013.v009a002","title":"","year":2013,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Industry Canada; National Science Foundation; Government of Canada; Institut Périmètre de physique théorique; Canadian Institute for Advanced Research; California Institute of Technology","keywords":"Mathematics; Combinatorics; Class (philosophy); Discrete mathematics; Counting problem; Quantum","score_opus":0.008336922265740671,"score_gpt":0.21656755383699125,"score_spread":0.20823063157125057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403315016","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.5037176,0.00006996833,0.49495414,0.00042476054,0.0001864841,0.00016789025,1.8417684e-7,0.00032046725,0.00015851014],"genre_scores_gemma":[0.78534937,9.628442e-7,0.21410331,0.00039662368,0.00011980903,0.0000030711449,4.813089e-7,0.000014393634,0.000011961207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681234,0.0005563207,0.000763071,0.00063263316,0.0004733551,0.00076225045],"domain_scores_gemma":[0.99640435,0.0015349579,0.00045449618,0.0011229563,0.0002750637,0.00020818296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018646984,0.0003226424,0.0005065853,0.0002532085,0.00038164138,0.00023174463,0.0027128083,0.0000754457,0.00000909774],"category_scores_gemma":[0.00017046751,0.0002766314,0.00020519401,0.0007766721,0.00021656493,0.00061364914,0.0013731512,0.00034804613,0.000015873911],"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.0000057876546,0.00010814316,0.001041884,0.00004320243,0.00004430722,0.0000068504487,0.009289677,0.046741642,0.007987564,0.33524492,0.00002376671,0.5994623],"study_design_scores_gemma":[0.00039857955,0.00016091096,0.030859884,0.00009665648,0.000003913896,0.00006148702,0.0001724818,0.71325225,0.0071647186,0.24754216,0.0000093062245,0.00027765502],"about_ca_topic_score_codex":0.000070690534,"about_ca_topic_score_gemma":4.0138758e-7,"teacher_disagreement_score":0.66651064,"about_ca_system_score_codex":0.00001818465,"about_ca_system_score_gemma":0.00005557305,"threshold_uncertainty_score":0.9999686},"labels":[],"label_agreement":null},{"id":"W2404437241","doi":"10.4086/toc.2012.v008a013","title":"","year":2012,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"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 Waterloo","funders":"Army Research Office; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Quantum computer; Span (engineering); Quantum algorithm; Computer science; Quantum; Algorithm; Mathematics; Theoretical computer science; Quantum mechanics; Physics; Engineering","score_opus":0.013188188914694312,"score_gpt":0.24159888306533683,"score_spread":0.22841069415064252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404437241","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.4996139,0.00031241888,0.49900964,0.0001239672,0.00043158227,0.00007745699,3.1573225e-7,0.00027561688,0.00015507972],"genre_scores_gemma":[0.8006791,0.0000012702773,0.19864857,0.0002710831,0.00037789924,8.6226487e-7,5.4528556e-7,0.000014970298,0.0000057188868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665403,0.0006768659,0.0006683507,0.00040679914,0.00048431268,0.0011096464],"domain_scores_gemma":[0.99659526,0.0015508295,0.00044526072,0.0009886386,0.000117821786,0.00030219197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004774335,0.0003087231,0.00047841916,0.00023784491,0.0003931249,0.00007814326,0.0020443785,0.00007545322,0.0000021467113],"category_scores_gemma":[0.00019174487,0.0002717806,0.00020805502,0.0007688453,0.00017941535,0.0006901228,0.0013219898,0.000341918,0.0000042497486],"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.000015200766,0.00021060999,0.00784445,0.000042424967,0.000044938257,0.000003322675,0.024167525,0.017992822,0.0032120442,0.6284788,0.000006799628,0.317981],"study_design_scores_gemma":[0.0008880173,0.00024250426,0.10247428,0.00019565674,0.000018456321,0.000265419,0.0004441078,0.77125734,0.027565008,0.09586104,0.0001025109,0.0006856632],"about_ca_topic_score_codex":0.000008944017,"about_ca_topic_score_gemma":1.4645174e-7,"teacher_disagreement_score":0.75326455,"about_ca_system_score_codex":0.000022584656,"about_ca_system_score_gemma":0.000041172803,"threshold_uncertainty_score":0.9999734},"labels":[],"label_agreement":null},{"id":"W2405665546","doi":"10.4086/toc.2018.v014a020","title":"","year":2018,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Environment and Climate Change Canada; National Science Foundation","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.014508259151787866,"score_gpt":0.24930232802088315,"score_spread":0.2347940688690953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405665546","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.66924506,0.00012903755,0.3259402,0.000018603017,0.00006398289,0.0000797684,6.9868275e-7,0.0013084573,0.0032141977],"genre_scores_gemma":[0.96683913,0.000013869576,0.032948468,0.000048492206,0.000112098685,0.0000020631385,0.0000014370963,0.000032678327,0.0000017830885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889356,0.00017108444,0.00042979914,0.00011361508,0.00014532793,0.00024660345],"domain_scores_gemma":[0.9985068,0.00047546948,0.00008567196,0.0007293257,0.00015364877,0.00004910154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012821578,0.00014290215,0.00024884034,0.00013567037,0.0001188491,0.000016078617,0.00070850586,0.00006305183,0.000011749605],"category_scores_gemma":[0.000071089504,0.00016051382,0.00005823548,0.000268393,0.00037719766,0.00013513652,0.00020915561,0.0001737822,0.0000043085424],"study_design_candidate":"bench_or_experimental","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.000057528956,0.000077928555,0.0018319845,0.0001970589,0.00013059522,0.0000013794271,0.034711625,0.006326866,0.1947011,0.5435378,0.00012803813,0.21829806],"study_design_scores_gemma":[0.00029957,0.00011702747,0.008083776,0.0002259767,0.000011572894,0.000011218309,0.00076834083,0.14663365,0.7545908,0.08871866,0.00023112471,0.00030825767],"about_ca_topic_score_codex":0.0000046328055,"about_ca_topic_score_gemma":0.0000030326298,"teacher_disagreement_score":0.55988973,"about_ca_system_score_codex":0.00002625445,"about_ca_system_score_gemma":0.0000070707893,"threshold_uncertainty_score":0.6545564},"labels":[],"label_agreement":null},{"id":"W2556555060","doi":"10.4086/toc.2018.v014a006","title":"","year":2018,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Communication complexity; Mathematics; Combinatorics; Omega; Order (exchange); Function (biology); Discrete mathematics; Upper and lower bounds; Physics","score_opus":0.025175251675771865,"score_gpt":0.26485716712213536,"score_spread":0.2396819154463635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556555060","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.43834826,0.000039493923,0.55975467,0.00014071542,0.00038301732,0.0000699212,3.885794e-7,0.00023583852,0.0010277216],"genre_scores_gemma":[0.7589562,9.507604e-7,0.24043801,0.00031943904,0.00026811898,6.410688e-7,2.8251006e-7,0.00000700285,0.0000093700155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975611,0.00042435326,0.000561372,0.0005095205,0.00040489767,0.00053878734],"domain_scores_gemma":[0.9971114,0.001028168,0.00031644746,0.0010956163,0.00032696183,0.000121411955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029154802,0.00021070366,0.00035552258,0.00024296294,0.000551288,0.00010190357,0.002743072,0.00005337318,0.000008792796],"category_scores_gemma":[0.00017030441,0.00020595027,0.00015758025,0.0010120277,0.0008683466,0.0005193312,0.0014003117,0.00017812371,0.000008133802],"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.000018474804,0.000063625506,0.00043947736,0.000012410963,0.000023464132,0.0000035378675,0.0067252126,0.000080385136,0.001739179,0.78262985,0.000008462744,0.2082559],"study_design_scores_gemma":[0.0005029091,0.0004443548,0.015005379,0.0000987941,0.0000060843317,0.00004893999,0.00028070653,0.1856836,0.037879717,0.7596957,0.00007924442,0.00027457517],"about_ca_topic_score_codex":0.000014601853,"about_ca_topic_score_gemma":0.0000029602015,"teacher_disagreement_score":0.32060793,"about_ca_system_score_codex":0.000015818398,"about_ca_system_score_gemma":0.000051166266,"threshold_uncertainty_score":0.8398409},"labels":[],"label_agreement":null},{"id":"W2562861483","doi":"10.4086/toc.2019.v015a015","title":"","year":2019,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Mathematics; Gaussian measure; Combinatorics; Convex body; Regular polygon; Equivalence (formal languages); Constructive; Norm (philosophy); Sequence (biology); Distribution (mathematics); Discrete mathematics; Gaussian; Convex optimization; Computer science; Mathematical analysis; Geometry","score_opus":0.07994249218843967,"score_gpt":0.3770214135503005,"score_spread":0.2970789213618608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562861483","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.54038876,0.000008697276,0.45662186,0.000014293376,0.00008859847,0.000112402806,0.0000012394711,0.000042989843,0.0027211786],"genre_scores_gemma":[0.6165235,2.7285336e-7,0.3833637,0.000048893497,0.000025898973,3.974578e-7,1.6410345e-7,0.000009889483,0.000027302593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981705,0.00057978835,0.0005265269,0.00020907819,0.00022964207,0.00028449274],"domain_scores_gemma":[0.983771,0.015381894,0.00028211361,0.00038621316,0.00011642222,0.000062321196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035525442,0.00013668169,0.0004635257,0.000053698623,0.000053786633,0.00001215137,0.00029015378,0.000047236503,0.00013449907],"category_scores_gemma":[0.0033395006,0.00011434693,0.00008112837,0.00014218771,0.00011354422,0.00004210229,0.00015654799,0.00015420339,0.000008508114],"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.000056135734,0.000053050666,0.00366554,0.00017801483,0.000021740396,9.3846893e-7,0.0017174382,0.000036858146,0.0055862674,0.93468255,0.000003345423,0.05399811],"study_design_scores_gemma":[0.00042741257,0.00016925753,0.012147228,0.00020482294,0.000017838633,0.000005272935,0.0007863259,0.0077389693,0.008590828,0.96977097,0.000002919902,0.00013812922],"about_ca_topic_score_codex":0.000003833209,"about_ca_topic_score_gemma":1.4764305e-7,"teacher_disagreement_score":0.07613474,"about_ca_system_score_codex":0.000010698227,"about_ca_system_score_gemma":0.000019872832,"threshold_uncertainty_score":0.46629322},"labels":[],"label_agreement":null},{"id":"W2585327097","doi":"10.4086/toc.2016.v012a018","title":"","year":2016,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Mathematics; Computational complexity theory; Quantum algorithm; Communication complexity; Query optimization; Quantum; Bipartite graph; Matching (statistics); Worst-case complexity; Discrete mathematics; Combinatorics; Constructive; Computer science; Algorithm; Graph; Information retrieval","score_opus":0.009925032442266456,"score_gpt":0.22655946152639345,"score_spread":0.216634429084127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585327097","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.48747388,0.000054314693,0.51096934,0.0008231807,0.00021644849,0.000071756825,6.845062e-7,0.00031556736,0.00007486089],"genre_scores_gemma":[0.869123,0.000002700517,0.13046698,0.00021659354,0.00015451985,9.1219204e-7,1.3216989e-7,0.000015273012,0.00001991422],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968143,0.0006019229,0.0007062846,0.0006799301,0.00047532286,0.00072222337],"domain_scores_gemma":[0.9950693,0.0029539692,0.00046082347,0.0011632618,0.00017588402,0.00017676581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029088971,0.00030046437,0.0004724652,0.00024512367,0.00030410796,0.00006804696,0.0025986985,0.00006988713,0.000002991585],"category_scores_gemma":[0.00031349206,0.0001847208,0.00021086959,0.00059155934,0.00028577354,0.00040508827,0.0013093058,0.00015878036,0.0000047482986],"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.000017778906,0.000050175186,0.00083641487,0.000014752434,0.000026535645,0.0000106618945,0.0025688177,0.0023254647,0.021195037,0.37858424,0.000004321988,0.59436584],"study_design_scores_gemma":[0.0020632779,0.00051157427,0.03148229,0.0007563701,0.000011473575,0.00019448568,0.00010110887,0.30410963,0.08283204,0.5771609,0.00008114448,0.0006957167],"about_ca_topic_score_codex":0.0000055620726,"about_ca_topic_score_gemma":4.320983e-7,"teacher_disagreement_score":0.59367007,"about_ca_system_score_codex":0.000026913785,"about_ca_system_score_gemma":0.00006945133,"threshold_uncertainty_score":0.75326955},"labels":[],"label_agreement":null},{"id":"W2594003820","doi":"10.4086/toc.2019.v015a017","title":"","year":2019,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Science and Engineering Research Board; Alfred P. Sloan Foundation","keywords":"Combinatorics; Upper and lower bounds; Boolean function; Degree (music); Mathematics; Omega; Polynomial; Monotone polygon; Function (biology); Binary logarithm; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics; Geometry","score_opus":0.014177357646648656,"score_gpt":0.2334054208585872,"score_spread":0.21922806321193855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594003820","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.50875336,0.0000598589,0.48941922,0.00009737119,0.00036574647,0.00012292966,3.5024183e-7,0.00018091533,0.0010002546],"genre_scores_gemma":[0.8660485,0.0000015238062,0.13360235,0.00025623612,0.000051620034,6.8297453e-7,5.3485286e-7,0.000008351996,0.000030156494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976003,0.0003863055,0.00054814917,0.0005270924,0.00044057413,0.00049754337],"domain_scores_gemma":[0.99680084,0.0014216983,0.00032476117,0.0012139274,0.00014054166,0.000098229095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025973695,0.00021240127,0.0004348448,0.00023232562,0.00018076805,0.000090661415,0.0026133722,0.000054328586,0.000013992003],"category_scores_gemma":[0.00006978578,0.00020862084,0.00020157154,0.000795187,0.00015926477,0.0005884005,0.0012793707,0.00023524268,0.000018142062],"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.000016549087,0.00006810852,0.003507061,0.00004050619,0.000026934631,0.0000032963758,0.0036527372,0.0028234634,0.002912821,0.87606233,0.0000022663917,0.11088394],"study_design_scores_gemma":[0.0008423936,0.00026184847,0.032106757,0.00014601002,0.000005224838,0.000041140003,0.0004203642,0.29865265,0.012535236,0.6546026,0.000049832768,0.00033596312],"about_ca_topic_score_codex":0.000011004525,"about_ca_topic_score_gemma":5.655185e-7,"teacher_disagreement_score":0.3572952,"about_ca_system_score_codex":0.000017420232,"about_ca_system_score_gemma":0.000047671685,"threshold_uncertainty_score":0.8507311},"labels":[],"label_agreement":null},{"id":"W2611061920","doi":"10.4086/toc.2013.v009a001","title":"","year":2013,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association; National Science Foundation","keywords":"Tile; Combinatorics; Discrete mathematics; Terminal (telecommunication); Mathematics; Computer science; Pure mathematics","score_opus":0.01080034766990897,"score_gpt":0.2211525095681928,"score_spread":0.21035216189828382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611061920","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.48204294,0.00003435474,0.5167243,0.0003113939,0.00003526626,0.00014517765,1.2692736e-7,0.00020245358,0.0005040131],"genre_scores_gemma":[0.89241725,8.3125883e-7,0.107310414,0.00020098177,0.000031163603,0.000008806793,9.579063e-7,0.0000063771718,0.000023189627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856496,0.00016863,0.0004148731,0.00031754677,0.00021481053,0.00031915132],"domain_scores_gemma":[0.99801415,0.00061543385,0.00022424944,0.00091234065,0.00013643566,0.00009739755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084511813,0.00013103476,0.00021445414,0.00009679584,0.00021272908,0.00012250007,0.0016605697,0.000034094046,0.000012564021],"category_scores_gemma":[0.000044966157,0.00012258868,0.000091189264,0.00046392542,0.00011237504,0.00056541635,0.00064172014,0.000100869416,0.000040966905],"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":[7.059681e-7,0.000055123935,0.00035182943,0.0000113759515,0.00001053831,5.5774905e-7,0.0022327139,0.0005365803,0.04093414,0.79166526,0.00002069478,0.16418047],"study_design_scores_gemma":[0.0003194539,0.000047686346,0.055182643,0.000035667363,0.0000050678996,0.00002418962,0.00029854188,0.41881356,0.051729944,0.47327834,0.000045131022,0.00021978334],"about_ca_topic_score_codex":0.000039542203,"about_ca_topic_score_gemma":3.4068017e-7,"teacher_disagreement_score":0.41827697,"about_ca_system_score_codex":0.000011071049,"about_ca_system_score_gemma":0.000027231836,"threshold_uncertainty_score":0.49990216},"labels":[],"label_agreement":null},{"id":"W2611365002","doi":"10.4086/toc.2007.v003a005","title":"","year":2007,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Mathematics and Applications","field":"Mathematics","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Deutsche Forschungsgemeinschaft; University of Pittsburgh","keywords":"Computer science; Mathematics","score_opus":0.06560666522432046,"score_gpt":0.35982758213689614,"score_spread":0.2942209169125757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611365002","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.5210335,0.000009919438,0.47561333,0.000030368084,0.000018317502,0.0001419117,5.813121e-7,0.00007350621,0.0030785643],"genre_scores_gemma":[0.7858804,4.4121091e-7,0.21394846,0.000037694022,0.00006939326,0.0000011742696,5.4779474e-7,0.000018062863,0.000043848824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983458,0.00007280448,0.0008111551,0.00017385521,0.0002546665,0.000341708],"domain_scores_gemma":[0.99315023,0.0056470814,0.0004924281,0.0004952428,0.00013057285,0.00008445253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074098213,0.00014383596,0.00033904787,0.00010263374,0.00017825789,0.000012216639,0.00035244814,0.00005115645,0.000014782051],"category_scores_gemma":[0.0006520988,0.0001302986,0.00011185211,0.00025408764,0.00012929743,0.000041588002,0.00013461986,0.00012397942,0.0000018497403],"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.000020711646,0.0001924931,0.00016641771,0.00015713964,0.000028073784,0.000001297985,0.005422901,0.000020571397,0.009481146,0.9738282,0.00006577737,0.010615281],"study_design_scores_gemma":[0.00030753211,0.000032185224,0.0011650948,0.000113468865,0.000029211353,0.000013716744,0.0023177706,0.0010515627,0.042030826,0.9527588,0.00004073879,0.00013907318],"about_ca_topic_score_codex":0.000002326729,"about_ca_topic_score_gemma":0.0000027401181,"teacher_disagreement_score":0.26484686,"about_ca_system_score_codex":0.0000150849555,"about_ca_system_score_gemma":0.00001398378,"threshold_uncertainty_score":0.53134227},"labels":[],"label_agreement":null},{"id":"W2942259633","doi":"10.4086/toc.2019.v015a001","title":"","year":2019,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; York University; National Science Foundation","keywords":"Property testing; Monotone polygon; Monotonic function; Mathematics; Combinatorics; Context (archaeology); Omega; Domain (mathematical analysis); Hypercube; Partially ordered set; Discrete mathematics; Boolean function; Function (biology); Mathematical analysis; Physics","score_opus":0.006081717006494044,"score_gpt":0.22978444834867517,"score_spread":0.22370273134218113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942259633","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.51271886,0.000039643655,0.48544186,0.00014113465,0.00026945907,0.00007301553,9.931803e-8,0.00019216472,0.0011237677],"genre_scores_gemma":[0.9059152,6.379507e-7,0.09365368,0.00022466552,0.00007378549,3.896058e-7,4.752016e-7,0.000009232298,0.000121909914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978985,0.0005020011,0.0004105151,0.00043466914,0.0003494567,0.0004048529],"domain_scores_gemma":[0.99762106,0.001041548,0.00031130848,0.00085118087,0.00009135706,0.000083534185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028633755,0.00017350912,0.00035204383,0.0001458255,0.00013072893,0.00007447047,0.0016934671,0.000043415912,0.000010479603],"category_scores_gemma":[0.000106384636,0.00015697861,0.00012304164,0.00044196198,0.000059319194,0.00033471602,0.00072379695,0.00027470948,0.000027658483],"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.000014275227,0.000051526018,0.014231306,0.000047619134,0.000023875064,0.0000040512546,0.005450391,0.028364481,0.003706849,0.696437,0.0000025870552,0.25166604],"study_design_scores_gemma":[0.0008421378,0.00028563564,0.044279385,0.00013092687,0.000004330605,0.00003786316,0.00028021896,0.86443937,0.0059032263,0.08344388,0.00006091296,0.0002920867],"about_ca_topic_score_codex":0.0000171658,"about_ca_topic_score_gemma":1.4201284e-7,"teacher_disagreement_score":0.8360749,"about_ca_system_score_codex":0.00001204653,"about_ca_system_score_gemma":0.000036796322,"threshold_uncertainty_score":0.64014024},"labels":[],"label_agreement":null},{"id":"W2962825398","doi":"10.4086/toc.2015.v011a016","title":"","year":2015,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Monotone polygon; Combinatorics; Mathematics; Bounded function; Function (biology); Quadratic equation; Discrete mathematics; Mathematical analysis","score_opus":0.02375489289472492,"score_gpt":0.25114493347704003,"score_spread":0.2273900405823151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962825398","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.49054527,0.00013603576,0.5080619,0.0002789263,0.00033357815,0.00008063352,3.1786524e-7,0.00033094216,0.00023242978],"genre_scores_gemma":[0.7768318,5.133751e-7,0.22271495,0.00026302866,0.00016645165,6.937603e-7,6.1251023e-7,0.000013421803,0.000008541797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966281,0.0007341326,0.0007019128,0.0006031996,0.0006698263,0.0006628343],"domain_scores_gemma":[0.9967455,0.0010100605,0.00044860842,0.0010776324,0.00034343055,0.00037472433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005078183,0.00030118975,0.00051649427,0.0002542122,0.00022511318,0.00012914812,0.0026285553,0.00007299872,4.944966e-7],"category_scores_gemma":[0.00042433667,0.00026679458,0.00016486281,0.00089102396,0.00020776888,0.0003779797,0.0015139568,0.0003255919,0.000003522927],"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.000040975137,0.00012756312,0.0011075007,0.000026987052,0.000041541043,0.00003141678,0.026914066,0.2055632,0.00082519255,0.4797151,0.000027518041,0.28557894],"study_design_scores_gemma":[0.00090659497,0.0003236465,0.0029336205,0.0000899057,0.000005924475,0.00013006793,0.0004286836,0.73514736,0.004885744,0.2548149,0.000045058445,0.00028847216],"about_ca_topic_score_codex":0.00002157833,"about_ca_topic_score_gemma":6.4151124e-7,"teacher_disagreement_score":0.52958417,"about_ca_system_score_codex":0.00003419414,"about_ca_system_score_gemma":0.00017962694,"threshold_uncertainty_score":0.9999784},"labels":[],"label_agreement":null},{"id":"W2964263868","doi":"10.4086/toc.2017.v013a020","title":"","year":2017,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Approximation algorithm; Bottleneck; Omega; Cardinality (data modeling); Upper and lower bounds; Hardness of approximation; Discrete mathematics; Mathematical analysis; Physics; Computer science","score_opus":0.039146009935173795,"score_gpt":0.2882293159106371,"score_spread":0.2490833059754633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964263868","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.44068518,0.00004423339,0.5569849,0.00036710818,0.00038802993,0.00007362053,5.4144795e-7,0.00013938131,0.0013169915],"genre_scores_gemma":[0.83658195,0.0000027043482,0.16315824,0.00012224741,0.00011158415,8.760542e-7,2.391954e-7,0.0000071369577,0.000015024637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997852,0.00026625142,0.00049645104,0.0004948903,0.00039698763,0.0004933674],"domain_scores_gemma":[0.99517715,0.000800454,0.00081439246,0.002920229,0.00016499874,0.00012278737],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0031689166,0.00021243587,0.00040860116,0.00014463402,0.0021511025,0.0005187141,0.0070241704,0.00005447683,0.0000027562899],"category_scores_gemma":[0.00046345592,0.00020924436,0.00020450454,0.00014271906,0.0006863706,0.0011452155,0.0030632794,0.00022905764,0.0000025097634],"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.0000111647605,0.00005249522,0.002082599,0.000017426848,0.000023548973,0.000010372716,0.0023005563,0.00026246405,0.0006856754,0.73432165,0.0000027841934,0.26022926],"study_design_scores_gemma":[0.00060152594,0.00010585914,0.13220106,0.00012067754,0.0000061608357,0.00003222588,0.00013058749,0.12834236,0.010064512,0.7281151,0.000028540888,0.00025143535],"about_ca_topic_score_codex":0.00004122144,"about_ca_topic_score_gemma":0.0000036292736,"teacher_disagreement_score":0.3958968,"about_ca_system_score_codex":0.000013252061,"about_ca_system_score_gemma":0.000046127443,"threshold_uncertainty_score":0.99914795},"labels":[],"label_agreement":null},{"id":"W2981993210","doi":"10.4086/toc.2019.v015a005","title":"","year":2019,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"PSPACE; Mathematics; Discrete mathematics; Hamiltonian (control theory); Connection (principal bundle); Quantum computer; Hamiltonian path; Combinatorics; Quantum; Computer science; Computational complexity theory; Quantum mechanics; Physics; Graph; Algorithm","score_opus":0.006912052154871736,"score_gpt":0.2191981759038802,"score_spread":0.21228612374900846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981993210","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.52540636,0.0000720271,0.47326076,0.00015541307,0.00038273496,0.00014694908,3.2840407e-7,0.00027407738,0.00030136268],"genre_scores_gemma":[0.8776354,9.5216365e-7,0.12190748,0.00031518383,0.00009587883,5.74133e-7,6.536499e-7,0.000016526465,0.000027353863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687976,0.00051369565,0.0006822733,0.0007174657,0.00052319426,0.0006836027],"domain_scores_gemma":[0.9963283,0.0015762772,0.00046769023,0.001335346,0.00015354255,0.00013886268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002831849,0.00030676415,0.0005725811,0.00025697207,0.00020571976,0.0001131972,0.0026838318,0.00007632651,0.000005903553],"category_scores_gemma":[0.00009027054,0.00027322068,0.00022793701,0.00079264666,0.00011560264,0.00035497927,0.0013930588,0.00036479125,0.000016331078],"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.000028933353,0.000097049815,0.0052355975,0.00008383758,0.00004935233,0.000009845543,0.009390108,0.15901835,0.00959094,0.57952213,0.0000033031513,0.23697054],"study_design_scores_gemma":[0.00080448325,0.00032149733,0.02222017,0.00018767912,0.000005057954,0.00007614139,0.00018294083,0.85543114,0.0102192275,0.110172704,0.000029874642,0.00034906063],"about_ca_topic_score_codex":0.000010733843,"about_ca_topic_score_gemma":2.6321902e-7,"teacher_disagreement_score":0.6964128,"about_ca_system_score_codex":0.000020217318,"about_ca_system_score_gemma":0.000072822935,"threshold_uncertainty_score":0.999972},"labels":[],"label_agreement":null},{"id":"W3090085778","doi":"10.4086/toc.2020.v016a005","title":"","year":2020,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Achievement Rewards for College Scientists Foundation; Center for Long-Term Cybersecurity, University of California Berkeley; National Science Foundation","keywords":"Mathematics; Combinatorics; Degree (music); Hyperplane; Inverse; Product (mathematics); Discrete mathematics; Geometry; Physics","score_opus":0.026835770313589143,"score_gpt":0.2276405655685452,"score_spread":0.20080479525495606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090085778","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.45083606,0.00007829149,0.54720587,0.0009509284,0.00007781632,0.00007238035,3.3294117e-7,0.00035441422,0.00042394467],"genre_scores_gemma":[0.93869925,0.0000016716874,0.05894615,0.0022277443,0.0001130233,8.6737356e-7,3.6969308e-7,0.000010061484,8.8667935e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975623,0.00064487115,0.00052904966,0.0005179854,0.00032598464,0.00041984697],"domain_scores_gemma":[0.99758804,0.001151456,0.00030744428,0.00060748233,0.000106784,0.00023879712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020153613,0.00021571144,0.00039289414,0.000117757554,0.00025107726,0.0000867828,0.0024785134,0.00004845512,0.0000053279186],"category_scores_gemma":[0.00025991516,0.00021263529,0.00024045612,0.0011981366,0.00019750423,0.0004777522,0.0010019485,0.00022232956,0.0000043197833],"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.00008080096,0.00003908099,0.00088497094,0.00003856987,0.000034875255,0.000008367764,0.017044438,0.0016804248,0.009081002,0.87258273,0.0000069360963,0.098517776],"study_design_scores_gemma":[0.0011026493,0.00078067125,0.0070302445,0.000103436316,0.000020691767,0.000022568274,0.0010630332,0.13635692,0.047285676,0.80561763,0.00010874826,0.00050772756],"about_ca_topic_score_codex":0.0000013788665,"about_ca_topic_score_gemma":9.676861e-8,"teacher_disagreement_score":0.4882597,"about_ca_system_score_codex":0.000006178719,"about_ca_system_score_gemma":0.00003489755,"threshold_uncertainty_score":0.86710155},"labels":[],"label_agreement":null},{"id":"W3104119396","doi":"10.4086/toc.2005.v001a005","title":"","year":2005,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":90,"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; Canadian Institute for Advanced Research","keywords":"Mathematics; Quantum Fourier transform; Bounded function; Qubit; Logarithm; Constant (computer programming); Discrete mathematics; Quantum algorithm; Quantum; Polynomial; Quantum gate; Mathematical analysis; Computer science; Quantum mechanics; Physics","score_opus":0.009385687952812326,"score_gpt":0.2337069938772732,"score_spread":0.22432130592446087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104119396","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.4938823,0.00014683614,0.50445807,0.00077222363,0.0001360688,0.00008140418,3.5022546e-7,0.0003469806,0.00017577995],"genre_scores_gemma":[0.6826904,0.0000014748299,0.31651554,0.00046615378,0.00030245245,6.591369e-7,4.2530553e-7,0.000012516914,0.00001039075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682254,0.0005012828,0.00079420203,0.00064656377,0.0005053988,0.00072999747],"domain_scores_gemma":[0.99683005,0.0012948407,0.0004568062,0.0010776125,0.00015978048,0.00018091795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029942526,0.00031938558,0.0004970244,0.00026844686,0.00040478617,0.00012191932,0.0026497692,0.00007473755,0.0000028099357],"category_scores_gemma":[0.00014608786,0.00028894143,0.0002218209,0.00073531555,0.00019189733,0.0004724647,0.0012107481,0.00036749925,0.0000055716678],"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.000011911835,0.0000880843,0.00024365715,0.000016448032,0.000023946177,0.000004998654,0.007839154,0.18582164,0.002050123,0.26444933,0.000006075826,0.5394446],"study_design_scores_gemma":[0.0006606753,0.00016655456,0.0067933784,0.00011135672,0.000006709543,0.00011137002,0.000102534956,0.9140917,0.017536279,0.059925996,0.00015446267,0.0003389846],"about_ca_topic_score_codex":0.000007491425,"about_ca_topic_score_gemma":0.0000013421078,"teacher_disagreement_score":0.72827005,"about_ca_system_score_codex":0.000030838553,"about_ca_system_score_gemma":0.000068883455,"threshold_uncertainty_score":0.99995625},"labels":[],"label_agreement":null},{"id":"W3202012722","doi":"10.4086/toc.2021.v017a009","title":"","year":2021,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Leibniz-Gemeinschaft; Simons Institute for the Theory of Computing, University of California Berkeley; Banff International Research Station for Mathematical Innovation and Discovery; Mathematisches Forschungsinstitut Oberwolfach; Johns Hopkins University; National Science Foundation","keywords":"Combinatorics; Mathematics; Bounded function; Eigenvalues and eigenvectors; Vertex (graph theory); Omega; Binary logarithm; Discrete mathematics; Random graph; Graph","score_opus":0.02864492533377073,"score_gpt":0.3065202544915342,"score_spread":0.2778753291577635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202012722","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.44784576,0.00031286277,0.55060154,0.00022906711,0.0001205284,0.00007025663,5.0169086e-7,0.00017071172,0.00064876303],"genre_scores_gemma":[0.80368066,0.000007315504,0.1959623,0.00023152595,0.000046743327,0.0000016413638,0.0000010567165,0.00001402277,0.000054728873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995554,0.0016176013,0.00063183345,0.00073602766,0.0006883417,0.00077222654],"domain_scores_gemma":[0.9939845,0.0031900264,0.0002730997,0.0016894675,0.0006666546,0.00019621498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041577416,0.00022978676,0.0004713247,0.00023158394,0.00034923,0.00011185446,0.0023820882,0.00006395461,0.000009392432],"category_scores_gemma":[0.0009927249,0.00023815488,0.00020859583,0.0018299887,0.0003524154,0.0007511166,0.002300099,0.00035851847,0.000005170542],"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.000031465977,0.000100773956,0.0011155617,0.000037226135,0.000038704242,0.0001088632,0.0030099037,0.003987648,0.042745378,0.85828966,0.0000019382499,0.09053286],"study_design_scores_gemma":[0.0005827637,0.00008284944,0.006193934,0.00008599747,0.0000041939484,0.0001449486,0.0006723196,0.024129888,0.2199514,0.74790436,0.000023123343,0.00022423915],"about_ca_topic_score_codex":0.0000017895702,"about_ca_topic_score_gemma":0.0000011588717,"teacher_disagreement_score":0.3558349,"about_ca_system_score_codex":0.000034074674,"about_ca_system_score_gemma":0.00020802757,"threshold_uncertainty_score":0.97116745},"labels":[],"label_agreement":null},{"id":"W4237043730","doi":"10.4086/toc.2016.v012a013","title":"","year":2016,"lang":"en","type":"article","venue":"Theory of Computing","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Indian Institute of Technology Delhi; Carnegie Mellon University; Uniwersytet Warszawski; University of California, Los Angeles; Microsoft Research; University of Waterloo; Johns Hopkins University; California Institute of Technology; University of Washington; Massachusetts Institute of Technology; University of Pennsylvania; University of California Merced; Princeton University; Northwestern University","keywords":"Computer science; Mathematics","score_opus":0.01940343232928668,"score_gpt":0.25920121306384136,"score_spread":0.23979778073455468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237043730","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.8531477,0.00005116818,0.1448556,0.000114948656,0.000102547216,0.00014130397,0.000007520012,0.00044715012,0.001132039],"genre_scores_gemma":[0.9959755,5.469806e-7,0.0036945194,0.00006043732,0.00014888043,8.321799e-7,4.1740245e-7,0.000080082034,0.000038816925],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99698526,0.0010001631,0.00064906967,0.0003514381,0.0003967116,0.0006173538],"domain_scores_gemma":[0.99467236,0.003828495,0.00054302614,0.00063510897,0.00019641849,0.00012460488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006188652,0.00022251431,0.00042322118,0.0002038208,0.00015931994,0.000011130933,0.0006239703,0.00005056085,0.00004238184],"category_scores_gemma":[0.0010690434,0.00014173861,0.00014647504,0.00033808275,0.0006068886,0.0002513405,0.00033720344,0.0000814009,0.0002347039],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00037945443,0.00006505408,0.012875192,0.000014994537,0.000050689636,0.000004014461,0.0024310758,0.00019294479,0.5871901,0.27663726,0.000013130918,0.1201461],"study_design_scores_gemma":[0.0034809518,0.00021204987,0.15206364,0.000845855,0.000041688454,0.00004483787,0.0009223162,0.00055005366,0.4557489,0.3856028,0.000045339937,0.00044158928],"about_ca_topic_score_codex":0.000005324948,"about_ca_topic_score_gemma":0.0000010483121,"teacher_disagreement_score":0.14282775,"about_ca_system_score_codex":0.000064386724,"about_ca_system_score_gemma":0.00003717542,"threshold_uncertainty_score":0.5779933},"labels":[],"label_agreement":null},{"id":"W4285140607","doi":"10.4086/toc.2022.v018a011","title":"","year":2022,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"QuantERA; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Quantum phase estimation algorithm; Quantum computer; Span (engineering); Bounded function; Upper and lower bounds; Monotone polygon; Mathematics; Function (biology); Quantum algorithm; Logarithm; Discrete mathematics; Quantum; Quantum error correction; Mathematical analysis; Quantum mechanics","score_opus":0.009913898574620694,"score_gpt":0.22427593235993795,"score_spread":0.21436203378531726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285140607","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.5089544,0.00011735241,0.48973918,0.0003336504,0.00036123928,0.000102325976,0.0000015386499,0.00029336748,0.00009694968],"genre_scores_gemma":[0.9075083,4.972258e-7,0.0918052,0.0005543466,0.00009434019,0.000004815241,0.0000015353155,0.000017107634,0.000013865825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571276,0.0014445921,0.00068562606,0.00067041913,0.00082268054,0.0006639296],"domain_scores_gemma":[0.996784,0.0014039566,0.00052790786,0.0010691506,0.000088398396,0.00012660117],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004838035,0.0002632325,0.00045359888,0.00032746358,0.0015702937,0.00007836512,0.003717666,0.000025482044,0.000010459785],"category_scores_gemma":[0.000094454306,0.00027011696,0.0002264794,0.0012578012,0.00013912965,0.00019534829,0.005215824,0.0006285315,6.972823e-7],"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.00002536797,0.00012668363,0.00039437786,0.00001601652,0.000028861847,0.000026916834,0.012688394,0.46163464,0.0017381216,0.34554502,0.000009713724,0.17776589],"study_design_scores_gemma":[0.000618002,0.0004572922,0.004351058,0.000021434349,0.000005933466,0.00026707354,0.00068976893,0.8308975,0.002212883,0.16004129,0.00012944333,0.00030832583],"about_ca_topic_score_codex":0.000017075623,"about_ca_topic_score_gemma":2.3680099e-7,"teacher_disagreement_score":0.3985539,"about_ca_system_score_codex":0.00005159619,"about_ca_system_score_gemma":0.00010633762,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W4285230523","doi":"10.4086/toc.2022.v018a019","title":"","year":2022,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Rank (graph theory); Communication complexity; Combinatorics; Context (archaeology); Sign (mathematics); Dimension (graph theory); Discrete mathematics; Boolean function; Connection (principal bundle); Matrix (chemical analysis); VC dimension; Computational complexity theory; Omega; Algorithm","score_opus":0.021959954705695197,"score_gpt":0.2398138414644886,"score_spread":0.21785388675879339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285230523","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.4379793,0.00011011704,0.56061745,0.00023809214,0.00038389798,0.000094884526,0.0000018630942,0.00021826684,0.0003560911],"genre_scores_gemma":[0.898899,8.0480487e-7,0.10055998,0.0004584671,0.000050550407,0.000005980109,0.0000012931647,0.000008691906,0.0000151885115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667406,0.0011007816,0.0005514801,0.00049386657,0.00069810724,0.00048171458],"domain_scores_gemma":[0.9972322,0.0012705118,0.00036370067,0.00096464745,0.0000796626,0.00008927779],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004447948,0.00018185549,0.0003435264,0.00029779703,0.0014063907,0.00006275986,0.0036215624,0.000017810802,0.00002598205],"category_scores_gemma":[0.0000734505,0.00020654683,0.00020115118,0.0012965543,0.00019060053,0.00032009286,0.0048919525,0.0004097637,7.3529407e-7],"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.000022703496,0.00013981886,0.00040153804,0.000012122936,0.000024854462,0.000014897109,0.007850339,0.023731228,0.0008103521,0.83459896,0.000010499063,0.13238269],"study_design_scores_gemma":[0.000578666,0.00033636775,0.005529802,0.000014721894,0.0000055517216,0.00013160058,0.0014884174,0.28632343,0.0024020525,0.7027217,0.00020062599,0.0002670817],"about_ca_topic_score_codex":0.000017453347,"about_ca_topic_score_gemma":5.143619e-7,"teacher_disagreement_score":0.46091974,"about_ca_system_score_codex":0.000045291905,"about_ca_system_score_gemma":0.00007011027,"threshold_uncertainty_score":0.99989367},"labels":[],"label_agreement":null},{"id":"W4402242858","doi":"10.4086/toc.2024.v020a003","title":"","year":2024,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Institute for Quantum Information and Matter, California Institute of Technology; Simons Institute for the Theory of Computing, University of California Berkeley; Multidisciplinary University Research Initiative; Canadian Institute for Advanced Research; Centre National de la Recherche Scientifique; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Gordon and Betty Moore Foundation; National Science Foundation","keywords":"Verifiable secret sharing; Quantum computer; Computation; Computer science; Quantum; Theoretical computer science; Scheme (mathematics); Mathematics; Algorithm; Quantum mechanics; Physics; Programming language","score_opus":0.009970453124143758,"score_gpt":0.244478803283203,"score_spread":0.23450835015905924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402242858","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.460563,0.0010048134,0.5361586,0.00044370934,0.0006644566,0.00007947725,7.012512e-7,0.0009279157,0.00015730184],"genre_scores_gemma":[0.8766198,0.000003907633,0.1228938,0.00017177017,0.00026953724,0.0000010037678,7.337886e-7,0.00002140328,0.00001805196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701387,0.00044921998,0.00066257844,0.0007740043,0.0004735485,0.00062675506],"domain_scores_gemma":[0.9964746,0.0023034934,0.00014208462,0.00084264134,0.000095114134,0.00014205922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032871605,0.0003076864,0.00042063193,0.00040317257,0.00028051852,0.00039565013,0.002054865,0.00007224324,0.0000023601604],"category_scores_gemma":[0.000108708744,0.00026013696,0.00026826074,0.001284318,0.0001857366,0.00043511792,0.0010852139,0.00045477302,0.0000061965584],"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.000005435421,0.000027442968,0.000045468125,0.00011629814,0.000045666733,0.0000592476,0.008957499,0.033661913,0.0022350007,0.53532845,0.0000101690275,0.4195074],"study_design_scores_gemma":[0.00014843873,0.00013623189,0.0012657444,0.00047777902,0.000008622805,0.00017552881,0.00008399295,0.7627841,0.0057592466,0.2288103,0.000109486806,0.00024048807],"about_ca_topic_score_codex":0.000009600818,"about_ca_topic_score_gemma":3.4376765e-7,"teacher_disagreement_score":0.7291222,"about_ca_system_score_codex":0.000025487267,"about_ca_system_score_gemma":0.00011812249,"threshold_uncertainty_score":0.9999851},"labels":[],"label_agreement":null},{"id":"W4413895517","doi":"10.4086/toc.2025.v021a004","title":"","year":2025,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Vetenskapsrådet; Kungliga Tekniska Högskolan; University of Toronto; European Commission","keywords":"Computer science; Mathematics","score_opus":0.014534446798497138,"score_gpt":0.26385536255630854,"score_spread":0.2493209157578114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413895517","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.3189511,0.00019728558,0.6772302,0.00045754976,0.0004339764,0.0001033909,3.8952038e-7,0.0002604452,0.0023656795],"genre_scores_gemma":[0.8356873,0.00000275796,0.1636869,0.00054604124,0.000030825577,0.0000013321676,3.6290984e-7,0.0000037033392,0.000040772225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977979,0.0004281968,0.0005971521,0.00047086415,0.00027309894,0.00043279954],"domain_scores_gemma":[0.99671763,0.0018071845,0.00022093816,0.0010205981,0.00017098025,0.00006263734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002577281,0.00019743449,0.0003946456,0.00042040533,0.00040387528,0.00010392549,0.002703312,0.00005517966,0.0000020172747],"category_scores_gemma":[0.00019790723,0.00019950057,0.00018777946,0.0015578568,0.0002960672,0.0003676634,0.0015643567,0.00022588503,0.0000010196806],"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.000013083404,0.00006855776,0.00069112226,0.000038048598,0.000037073525,0.0000031132915,0.001578327,0.0011093424,0.0007339016,0.7564198,0.00001051703,0.23929715],"study_design_scores_gemma":[0.00050227327,0.000059070684,0.017755859,0.00020514856,0.000008313325,0.000007759683,0.00024764377,0.15653813,0.013104661,0.8113358,0.00006875827,0.00016657461],"about_ca_topic_score_codex":0.000014091676,"about_ca_topic_score_gemma":0.000001523702,"teacher_disagreement_score":0.5167362,"about_ca_system_score_codex":0.00002231743,"about_ca_system_score_gemma":0.00009189606,"threshold_uncertainty_score":0.81353974},"labels":[],"label_agreement":null},{"id":"W7548172","doi":"10.4086/toc.2010.v006a009","title":"","year":2010,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"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; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Communication complexity; Combinatorics; Mathematics; Nondeterministic algorithm; Function (biology); Logarithm; Discrete mathematics; Upper and lower bounds; Binary logarithm","score_opus":0.014675079421145891,"score_gpt":0.2465031238987778,"score_spread":0.2318280444776319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7548172","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.49764723,0.000015894382,0.5007268,0.00016682532,0.00063221384,0.00006945472,4.3543912e-7,0.00022160274,0.00051953964],"genre_scores_gemma":[0.70831895,6.118554e-7,0.29137644,0.00016743096,0.00012231375,8.752845e-7,3.8841938e-7,0.0000068611007,0.00000611102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977991,0.00025307326,0.0005547248,0.0004850421,0.00040288825,0.000505178],"domain_scores_gemma":[0.99659616,0.0014983821,0.00031623314,0.0012587716,0.00018330755,0.00014715816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033208078,0.00021693642,0.00035796067,0.00023756415,0.00040289952,0.000120140474,0.0030671617,0.000079231824,0.000008583661],"category_scores_gemma":[0.00025719783,0.00021218999,0.00018875973,0.0007521986,0.0004360728,0.0005437253,0.0012123376,0.00058773166,0.0000029768944],"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.000008156063,0.000076301054,0.0007716707,0.0000132014575,0.00001531558,0.000005192231,0.0028719748,0.0002065585,0.02185524,0.77627575,0.0000026077737,0.197898],"study_design_scores_gemma":[0.0004900583,0.00010584892,0.025603825,0.000037112644,0.0000054417424,0.00008606546,0.00015685687,0.14756085,0.036367558,0.78923017,0.00007171615,0.0002844845],"about_ca_topic_score_codex":0.000015600688,"about_ca_topic_score_gemma":0.000007949772,"teacher_disagreement_score":0.21067174,"about_ca_system_score_codex":0.000005750886,"about_ca_system_score_gemma":0.000056438406,"threshold_uncertainty_score":0.8652857},"labels":[],"label_agreement":null}]}