{"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031118956,0.00024705796,0.9795999,0.001068456,0.00016552523,0.00018867446,0.00030219927,0.0018191513,0.013497099],"genre_scores_gemma":[0.110196345,0.0006039436,0.8739066,0.0013683358,0.00055006606,0.0005712123,0.0012062422,0.0013572742,0.010239906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9892608,0.0022646312,0.0006502735,0.0022438075,0.0047951024,0.00078545226],"domain_scores_gemma":[0.96824586,0.015069944,0.0017724477,0.010943781,0.0031245593,0.0008434561],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0055968445,0.0018360373,0.001432892,0.003537187,0.0022336196,0.0059706774,0.005680564,0.0017593037,0.022189407],"category_scores_gemma":[0.03118616,0.0017137293,0.0032181449,0.0031090144,0.0036643075,0.014450997,0.00796172,0.010718778,0.006573033],"study_design_candidate":"not_applicable","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.00021930602,0.00025085433,0.0009133919,0.0007596196,0.00021208811,0.00019256334,0.00046584354,0.022688145,0.011854667,0.71643645,0.020485157,0.2255219],"study_design_scores_gemma":[0.00009254463,0.00016204956,0.00053235143,0.000116536845,0.00024276185,0.0005592254,0.00015038518,0.1521418,0.028129432,0.7431599,0.07459775,0.00011535273],"about_ca_topic_score_codex":0.0020515497,"about_ca_topic_score_gemma":0.003370554,"teacher_disagreement_score":0.9778106,"about_ca_system_score_codex":0.0029194287,"about_ca_system_score_gemma":0.003229585,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045233764,0.0010768675,0.8484801,0.0015267099,0.00033016346,0.00019642706,0.0002544822,0.00066399045,0.102237545],"genre_scores_gemma":[0.8106606,0.00086055655,0.15996395,0.0005641768,0.00020125593,0.00017970029,0.0003447435,0.00019147941,0.027033525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972799,0.00071829377,0.00011461467,0.0006295846,0.0008424701,0.00041517036],"domain_scores_gemma":[0.99534637,0.0020103557,0.0003150613,0.0015605049,0.0005221616,0.0002455633],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014690085,0.00046732315,0.00045899733,0.00039672357,0.0017437241,0.0026604342,0.0024159187,0.0014250306,0.014108665],"category_scores_gemma":[0.005885821,0.0002631229,0.0007503458,0.0005573603,0.0028969077,0.005306333,0.0019878263,0.0016722167,0.0024338935],"study_design_candidate":"not_applicable","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.00015584698,0.000051734547,0.00040802232,0.00008246794,0.000021153943,0.00010156469,0.000193553,0.008186602,0.0022952054,0.9645675,0.001905151,0.022031209],"study_design_scores_gemma":[0.00009122016,0.00023674114,0.00052623096,0.00006295106,0.0000625005,0.00060910103,0.00023845871,0.118761785,0.014575255,0.7730895,0.09165469,0.00009156303],"about_ca_topic_score_codex":0.0013344014,"about_ca_topic_score_gemma":0.0012771192,"teacher_disagreement_score":0.98589134,"about_ca_system_score_codex":0.0014262024,"about_ca_system_score_gemma":0.0013229297,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16541696,0.0027887526,0.63995135,0.0044738045,0.0006017542,0.00014049707,0.0018114338,0.00077290717,0.18404248],"genre_scores_gemma":[0.9016982,0.001190183,0.06459172,0.00072726223,0.00028282727,0.000108479006,0.00081397756,0.00011670152,0.03047079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997861,0.00006248141,0.0000068516033,0.000046500478,0.00005753982,0.000040594154],"domain_scores_gemma":[0.9998191,0.000044294316,0.000024561507,0.000059351252,0.000030082485,0.000022719103],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022594459,0.00032642393,0.00035312757,0.00043027438,0.0006734687,0.0009075921,0.000756399,0.00061042653,0.0067575686],"category_scores_gemma":[0.0005917264,0.000119136675,0.00037944134,0.00046791867,0.0009928992,0.0014470277,0.0007184521,0.0008383112,0.0013313986],"study_design_candidate":"not_applicable","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.000017229668,0.000017434759,0.00021236525,0.000026243759,0.0000074152586,0.000051835246,0.00006115506,0.004591865,0.0019100801,0.9863892,0.0026740339,0.004041089],"study_design_scores_gemma":[0.00001407513,0.000040477367,0.0005231135,0.000019399891,0.00001103403,0.00016888828,0.00007886797,0.07832794,0.0019193224,0.8791583,0.039718773,0.000019790446],"about_ca_topic_score_codex":0.002387625,"about_ca_topic_score_gemma":0.0030120527,"teacher_disagreement_score":0.99324244,"about_ca_system_score_codex":0.0005879256,"about_ca_system_score_gemma":0.00044525045,"threshold_uncertainty_score":0},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040645275,0.0019644857,0.0017303358,0.8942265,0.082024224,0.00003007769,0.00033788776,0.00026285328,0.019017175],"genre_scores_gemma":[0.0053203627,0.0008810238,0.0010890942,0.92604464,0.040246103,0.00006537208,0.000066679364,0.00014766246,0.026138987],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99320257,0.0013253994,0.00063144154,0.0013591582,0.0026179291,0.0008635048],"domain_scores_gemma":[0.9852834,0.0060278284,0.0007387292,0.00090390403,0.006338418,0.0007077928],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005335054,0.0009793694,0.0010792104,0.0010022551,0.004751378,0.004572592,0.0053406516,0.02077623,0.023568636],"category_scores_gemma":[0.027610267,0.0005075918,0.001715614,0.00089866685,0.0061795195,0.006173235,0.0024344306,0.027331501,0.018099947],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002922089,0.000012582919,0.000121440266,0.000078397636,0.000012771811,0.000090809284,0.00020749714,0.00007040881,0.000120247474,0.035305012,0.96081835,0.0031332762],"study_design_scores_gemma":[0.000019641187,0.000018788603,0.00066512264,0.00013136219,0.0000140979655,0.00011031149,0.00023054828,0.0002044503,0.00033761727,0.016344767,0.98187983,0.000043361473],"about_ca_topic_score_codex":0.027874043,"about_ca_topic_score_gemma":0.02784327,"teacher_disagreement_score":0.97643137,"about_ca_system_score_codex":0.0049632764,"about_ca_system_score_gemma":0.0030898668,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0230933,0.00030308525,0.95256585,0.0039765253,0.00015066552,0.00012478979,0.00039005067,0.00020686879,0.019188924],"genre_scores_gemma":[0.7131395,0.00063719583,0.27041858,0.0020425317,0.0008489639,0.0004906042,0.0009069468,0.00026776042,0.011248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99304986,0.0019793517,0.0004187659,0.001893285,0.0019836745,0.0006750239],"domain_scores_gemma":[0.955071,0.029617628,0.0031471997,0.008341485,0.0025697122,0.0012530085],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0055193733,0.00079292775,0.00092832686,0.0017541117,0.0026033663,0.0061415546,0.0033200195,0.002546753,0.009381487],"category_scores_gemma":[0.02688275,0.0006825491,0.0020993443,0.0016610784,0.009770811,0.017192688,0.007603512,0.007724602,0.0012883039],"study_design_candidate":"not_applicable","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.000022202885,0.00003151531,0.00028269668,0.00006129531,0.000009109795,0.00003380986,0.00011808073,0.0031939743,0.00048224998,0.98972195,0.0011185211,0.0049245893],"study_design_scores_gemma":[0.0000071456834,0.000019265326,0.000161074,0.000015857595,0.0000071596673,0.00008247366,0.000037340324,0.024557142,0.00089063525,0.971027,0.0031802494,0.000014750656],"about_ca_topic_score_codex":0.000879955,"about_ca_topic_score_gemma":0.00085179805,"teacher_disagreement_score":0.9906185,"about_ca_system_score_codex":0.0029359537,"about_ca_system_score_gemma":0.0021772285,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019208222,0.000360598,0.9846614,0.00148558,0.00047536724,0.000090309695,0.00012894585,0.0005086079,0.010368401],"genre_scores_gemma":[0.22912458,0.0022779831,0.730602,0.004363639,0.0039045746,0.0016508107,0.00090543274,0.0015291189,0.025641862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9854828,0.0031089417,0.00060388714,0.0026786993,0.0067818486,0.0013439123],"domain_scores_gemma":[0.9714603,0.015986888,0.0010725149,0.007606739,0.0027950448,0.001078619],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009290084,0.0031121343,0.0026972664,0.004683887,0.0035194827,0.0068022204,0.008874845,0.0042985203,0.019279016],"category_scores_gemma":[0.029687654,0.0016331552,0.004651773,0.0034903386,0.007963351,0.020695869,0.011522843,0.016114997,0.007124019],"study_design_candidate":"not_applicable","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.000119680575,0.00011590651,0.00023720883,0.0002610686,0.00011019458,0.00008517906,0.000121793186,0.0072780643,0.003924705,0.94963616,0.009395768,0.028714374],"study_design_scores_gemma":[0.000051344203,0.0001247998,0.00014587682,0.00005740635,0.00008987724,0.00023210625,0.00003429188,0.12011531,0.0073753195,0.85097814,0.020712145,0.00008345281],"about_ca_topic_score_codex":0.0011340484,"about_ca_topic_score_gemma":0.0013115797,"teacher_disagreement_score":0.980721,"about_ca_system_score_codex":0.0032472569,"about_ca_system_score_gemma":0.0031815672,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017758105,0.0003790722,0.9194877,0.0007668212,0.0002905264,0.000042269025,0.00025317215,0.00024243182,0.060779873],"genre_scores_gemma":[0.70902735,0.0012845107,0.25376737,0.0007804355,0.00053482805,0.0003325615,0.00069591537,0.00044168514,0.0331353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998769,0.000419473,0.000060569433,0.00023967079,0.0004137366,0.000097508535],"domain_scores_gemma":[0.99761355,0.001034575,0.00023683523,0.00037545068,0.0005797842,0.00015993485],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012727021,0.0008818018,0.000529317,0.00072841963,0.0007870402,0.0025453363,0.00094448816,0.0007206138,0.008133202],"category_scores_gemma":[0.007941908,0.00028998053,0.0006527895,0.0007275735,0.0035200182,0.0035682349,0.0018646786,0.002379941,0.0018965147],"study_design_candidate":"not_applicable","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.000009258077,0.000009326987,0.00003841837,0.00002100188,0.000003248397,0.0000183032,0.000039212624,0.0026775443,0.00038935884,0.9890939,0.0012539546,0.006446507],"study_design_scores_gemma":[0.000002845868,0.000011115352,0.000038611983,0.000011776978,0.0000021317799,0.000046761605,0.000025284859,0.037124537,0.00048542296,0.95990336,0.002340213,0.000007980285],"about_ca_topic_score_codex":0.00091556145,"about_ca_topic_score_gemma":0.0011607065,"teacher_disagreement_score":0.9918668,"about_ca_system_score_codex":0.0007861861,"about_ca_system_score_gemma":0.0010027445,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034846717,0.00008713985,0.9801137,0.0005444511,0.00018675518,0.00005357156,0.000045425895,0.00032325354,0.015160982],"genre_scores_gemma":[0.10565429,0.00030178638,0.8785393,0.00062973425,0.000111494126,0.00021463117,0.0002165296,0.00029583476,0.014036319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989003,0.00025068194,0.00007920872,0.0002810808,0.00030084304,0.00018800513],"domain_scores_gemma":[0.9990189,0.00037304996,0.00005652444,0.00036523739,0.00012649524,0.000059720503],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011273775,0.00068845483,0.0005337684,0.000557065,0.0013440864,0.0021075606,0.0018436523,0.0014068774,0.014170688],"category_scores_gemma":[0.0034735783,0.00036110796,0.0009453843,0.000641087,0.0018824269,0.0035889987,0.0028995203,0.0024252315,0.0049561057],"study_design_candidate":"not_applicable","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.000058943224,0.0000700105,0.00018397611,0.000095017705,0.000021382622,0.00009132684,0.00010747004,0.014268147,0.004170348,0.91009337,0.0074023376,0.063437656],"study_design_scores_gemma":[0.00003333155,0.00006235432,0.000075440745,0.000041294534,0.000028759638,0.00023795431,0.000065457476,0.124736086,0.00884657,0.82914114,0.036700755,0.000030944877],"about_ca_topic_score_codex":0.0008092769,"about_ca_topic_score_gemma":0.0017909724,"teacher_disagreement_score":0.9858293,"about_ca_system_score_codex":0.0007449051,"about_ca_system_score_gemma":0.0014281805,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072247684,0.0016301285,0.895448,0.0046573263,0.00037013835,0.00012509832,0.0011866746,0.00064674177,0.0236882],"genre_scores_gemma":[0.6794428,0.001385835,0.29934797,0.0013744852,0.00040699885,0.00019733734,0.0018914924,0.00030551836,0.015647572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848986,0.0004122643,0.00005390877,0.0005013078,0.0002667852,0.00027583254],"domain_scores_gemma":[0.9964857,0.0024066188,0.00024744697,0.00034278815,0.00027458774,0.00024277018],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011960947,0.0009930037,0.0012328962,0.0004979769,0.0010312962,0.0017877019,0.0019721312,0.0017341403,0.012560133],"category_scores_gemma":[0.007977965,0.00038630603,0.001226923,0.0013673349,0.0012613408,0.0037554244,0.0018239253,0.0020593961,0.0010728703],"study_design_candidate":"not_applicable","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.000409631,0.00019563362,0.0019327248,0.0004384945,0.00013564347,0.00036569324,0.00016026158,0.60219854,0.0016576543,0.31434026,0.017460823,0.060704608],"study_design_scores_gemma":[0.000042169886,0.00009514158,0.00029404534,0.000029436296,0.000030427176,0.00017597183,0.00009945605,0.69676816,0.0009548281,0.29146412,0.010031719,0.000014499219],"about_ca_topic_score_codex":0.0049746023,"about_ca_topic_score_gemma":0.0050142007,"teacher_disagreement_score":0.9874399,"about_ca_system_score_codex":0.0016461727,"about_ca_system_score_gemma":0.0013133849,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042814054,0.00028492566,0.95926625,0.005179086,0.00075965904,0.00014320803,0.00020856007,0.00078554894,0.02909125],"genre_scores_gemma":[0.3199825,0.0010360907,0.6454457,0.0046811407,0.0014999934,0.0008837416,0.00092329236,0.0010568113,0.024490703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947278,0.0012597629,0.0002374448,0.00084992364,0.0022551008,0.00067010446],"domain_scores_gemma":[0.9888425,0.004299856,0.00046406698,0.004642432,0.0011998609,0.0005512885],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0043075504,0.0009278578,0.0012806839,0.0015880519,0.002601872,0.004304243,0.0045322464,0.003368858,0.022301203],"category_scores_gemma":[0.018653529,0.00074718444,0.002896397,0.0011913888,0.0064749187,0.009860814,0.009978514,0.007387085,0.007859625],"study_design_candidate":"not_applicable","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.000030594318,0.000041692165,0.0001041914,0.00010733488,0.000017867698,0.000077835895,0.00009254885,0.0024206187,0.0019905132,0.9825522,0.004126952,0.008437544],"study_design_scores_gemma":[0.000025714233,0.00006363812,0.00005952937,0.000048419242,0.00003019372,0.00017151416,0.000039050552,0.027692081,0.0051388396,0.93359035,0.033109643,0.00003103374],"about_ca_topic_score_codex":0.00052231416,"about_ca_topic_score_gemma":0.00056718104,"teacher_disagreement_score":0.9776988,"about_ca_system_score_codex":0.0015830118,"about_ca_system_score_gemma":0.002761172,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058040995,0.0005752665,0.9187752,0.0077328417,0.00017803327,0.00021415274,0.0019689251,0.0006865732,0.011827875],"genre_scores_gemma":[0.69945097,0.0008415455,0.2760013,0.0029388124,0.00076784083,0.0005203583,0.0035314853,0.0004936766,0.015453919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99528295,0.0016433509,0.00021426387,0.0015978375,0.00076316943,0.00049843645],"domain_scores_gemma":[0.9676994,0.02493623,0.0016004213,0.003396508,0.0013652525,0.0010022151],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004214255,0.0008098874,0.001608788,0.00081305386,0.0017935263,0.0030615244,0.0032828082,0.0029406182,0.011984975],"category_scores_gemma":[0.02978705,0.00073786505,0.0021371443,0.0015177578,0.0029242618,0.008624562,0.003613717,0.0043884283,0.0015805191],"study_design_candidate":"not_applicable","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.0009000506,0.00029887544,0.0055469074,0.00062843965,0.00018243206,0.00045636995,0.00051649445,0.12645991,0.00272327,0.7388518,0.020775478,0.102660045],"study_design_scores_gemma":[0.00006433839,0.00015326611,0.00068793667,0.000043727265,0.000054982866,0.0003024649,0.00016384525,0.20297459,0.0028962926,0.7851096,0.0075136763,0.00003516538],"about_ca_topic_score_codex":0.0026360268,"about_ca_topic_score_gemma":0.0028474038,"teacher_disagreement_score":0.988015,"about_ca_system_score_codex":0.0026356045,"about_ca_system_score_gemma":0.0026686455,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01587338,0.005789984,0.9128296,0.0033612486,0.0006960977,0.00025380397,0.00065381196,0.00036995267,0.060172185],"genre_scores_gemma":[0.38124242,0.010378652,0.5477578,0.004487498,0.00137251,0.0006592261,0.0028197414,0.00046596982,0.050816204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964948,0.0010837255,0.00014992447,0.0009702745,0.0010294842,0.0002718302],"domain_scores_gemma":[0.988,0.007863526,0.00043410592,0.0019801923,0.0013350901,0.00038706884],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003640967,0.0013864343,0.0021174105,0.0018050685,0.0017949269,0.0029161784,0.002290832,0.0018024225,0.017767046],"category_scores_gemma":[0.021618398,0.0007011994,0.0016489233,0.0026743829,0.0022514863,0.0054844585,0.004094166,0.003241967,0.006228868],"study_design_candidate":"not_applicable","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.00036749558,0.00024159814,0.0026574214,0.00077765173,0.00015384353,0.0001421064,0.00029247403,0.035743676,0.0013341038,0.7499138,0.025464034,0.1829117],"study_design_scores_gemma":[0.000048429265,0.00013079318,0.0008174653,0.00012543901,0.00008600636,0.0003356487,0.00014269355,0.13772766,0.0017708112,0.79797655,0.06078614,0.0000523868],"about_ca_topic_score_codex":0.0023571835,"about_ca_topic_score_gemma":0.0032852134,"teacher_disagreement_score":0.9822329,"about_ca_system_score_codex":0.0020071943,"about_ca_system_score_gemma":0.0019361684,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32245055,0.0019888848,0.59485966,0.013311972,0.00042091767,0.00044202624,0.0026840256,0.0009188563,0.06292303],"genre_scores_gemma":[0.83081436,0.001147618,0.14891851,0.0014001578,0.00077079254,0.0005159263,0.0028381182,0.00042503685,0.0131695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968092,0.00095889706,0.00012282634,0.0009643274,0.0005632081,0.000581486],"domain_scores_gemma":[0.9774849,0.018525798,0.001188045,0.0017656094,0.0005118997,0.0005237293],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018259977,0.0011299805,0.0013147095,0.0007597053,0.002017311,0.003052971,0.0030357477,0.002585889,0.014849489],"category_scores_gemma":[0.020096518,0.00057283125,0.0017821838,0.0016379341,0.0037579495,0.009503459,0.0035491905,0.0052177613,0.0012367495],"study_design_candidate":"not_applicable","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.00077855744,0.0005251145,0.003763042,0.0009818162,0.00018592218,0.00041781776,0.00052260776,0.2647919,0.0037338715,0.6391656,0.023558915,0.06157484],"study_design_scores_gemma":[0.00007775103,0.000100198566,0.0006326804,0.000031582596,0.000027518105,0.00016979002,0.00015192137,0.28535548,0.0017958062,0.70631826,0.0053152875,0.000023634922],"about_ca_topic_score_codex":0.0021471893,"about_ca_topic_score_gemma":0.002048623,"teacher_disagreement_score":0.9851505,"about_ca_system_score_codex":0.0022437174,"about_ca_system_score_gemma":0.0015128065,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067732413,0.00030255906,0.979154,0.0005227006,0.00021740844,0.00012775834,0.00021096338,0.0019333083,0.010758128],"genre_scores_gemma":[0.1161917,0.0003218457,0.87287354,0.0003145296,0.000094031886,0.0001642418,0.0005502516,0.00036439247,0.009125485],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993131,0.00010299142,0.00006181127,0.00015023169,0.00026578954,0.000106062274],"domain_scores_gemma":[0.99943846,0.00011566894,0.000027914257,0.00019276308,0.00019407959,0.000031073618],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005064602,0.00073806866,0.0007081497,0.0006356645,0.0010527992,0.0015437294,0.0015765406,0.0010296092,0.015103119],"category_scores_gemma":[0.001868023,0.00034924244,0.00091822684,0.0008222395,0.00061163143,0.0021561524,0.0017926712,0.0012034688,0.0040751337],"study_design_candidate":"not_applicable","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.00020561721,0.00019305859,0.00078976207,0.00045288514,0.00011859798,0.00023864482,0.00016540647,0.030668316,0.015533574,0.30483308,0.02988044,0.6169206],"study_design_scores_gemma":[0.00014790312,0.00018212426,0.00052413455,0.00010540382,0.00017333248,0.00063632784,0.000100915226,0.33143076,0.03285158,0.55385345,0.07989693,0.00009715814],"about_ca_topic_score_codex":0.0013979318,"about_ca_topic_score_gemma":0.0036103996,"teacher_disagreement_score":0.9848969,"about_ca_system_score_codex":0.0008662063,"about_ca_system_score_gemma":0.0011273882,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05015436,0.0019818323,0.5684106,0.010344927,0.00082001544,0.00019221139,0.0021216709,0.002048959,0.3639254],"genre_scores_gemma":[0.71665794,0.001968786,0.20936002,0.0031840522,0.00031525426,0.0003404235,0.0013770778,0.000660513,0.06613596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948525,0.000093930634,0.00001978702,0.0000895479,0.00016153707,0.00014987787],"domain_scores_gemma":[0.9990989,0.00043305967,0.00007466978,0.00016162147,0.00013615421,0.00009568534],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037011376,0.00055005244,0.0004249502,0.0011491741,0.0014905072,0.001673844,0.0008966151,0.0013950114,0.022611378],"category_scores_gemma":[0.0023153806,0.000175034,0.0007533438,0.0009828368,0.0013034001,0.0023641933,0.0015148722,0.0017415042,0.0047457605],"study_design_candidate":"not_applicable","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.00010263804,0.00004039954,0.0002896112,0.00015414557,0.0000140535085,0.0004848211,0.00007774482,0.0034931044,0.00376262,0.9505333,0.017891042,0.023156475],"study_design_scores_gemma":[0.000027404558,0.000044073735,0.00046846905,0.000043441367,0.00002240358,0.0011050996,0.000075498596,0.028058851,0.0055098613,0.88657933,0.07803175,0.000033799177],"about_ca_topic_score_codex":0.0016383623,"about_ca_topic_score_gemma":0.0015899062,"teacher_disagreement_score":0.9773886,"about_ca_system_score_codex":0.0012166139,"about_ca_system_score_gemma":0.00049790094,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051937,0.0011190813,0.79446733,0.011091365,0.0015179672,0.00021876986,0.0008383755,0.00031873214,0.13849138],"genre_scores_gemma":[0.88038236,0.0017089023,0.07534329,0.0017945012,0.0008482632,0.00025583018,0.0003411084,0.00013138965,0.03919436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969657,0.00094126514,0.0001091108,0.0006967598,0.00065304857,0.00063404714],"domain_scores_gemma":[0.99399346,0.0022123493,0.00055385294,0.0022843536,0.00059599284,0.00036002076],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018713234,0.000982641,0.0011609044,0.00069441134,0.0024198995,0.004694895,0.0037117184,0.004124366,0.014299567],"category_scores_gemma":[0.011622494,0.00035920544,0.0011928736,0.0011837825,0.0028903752,0.008333949,0.0033918316,0.0041927802,0.003793632],"study_design_candidate":"not_applicable","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.000045457098,0.000041010786,0.00018644822,0.000058334565,0.000017595425,0.00014186342,0.000053048876,0.01090088,0.00042771362,0.9812229,0.0034047517,0.0034998537],"study_design_scores_gemma":[0.000026413965,0.000031326526,0.00009440532,0.0000207744,0.00002128862,0.00017253959,0.00006879736,0.070148855,0.0006779742,0.92065716,0.008055325,0.000025117399],"about_ca_topic_score_codex":0.0016267046,"about_ca_topic_score_gemma":0.0012380559,"teacher_disagreement_score":0.9857004,"about_ca_system_score_codex":0.001234127,"about_ca_system_score_gemma":0.0015017563,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004481478,0.0005203261,0.9654899,0.0010870855,0.00033730507,0.00007507261,0.0003196039,0.000360141,0.02732905],"genre_scores_gemma":[0.23371202,0.0021853982,0.67704815,0.0037615555,0.0015041746,0.0008938692,0.002247757,0.0013282499,0.07731879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99773115,0.00045936345,0.00011318524,0.00068941916,0.0008170645,0.00018971635],"domain_scores_gemma":[0.9963251,0.0015049647,0.00033385452,0.00091110513,0.0006873613,0.0002375978],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002826544,0.0007942118,0.001062608,0.0016442013,0.0016049065,0.0026371554,0.0013820515,0.0011103526,0.019472674],"category_scores_gemma":[0.01103087,0.00053359236,0.0010199798,0.0016124984,0.0030409605,0.005117413,0.0035889153,0.002830529,0.010895898],"study_design_candidate":"not_applicable","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.000053465035,0.000028647972,0.00039146587,0.000076095595,0.000020485579,0.00003684926,0.00008495969,0.00285334,0.0016121756,0.91136557,0.012548939,0.07092801],"study_design_scores_gemma":[0.0000131944735,0.0000368389,0.00039923852,0.000028955696,0.00000995221,0.00018795357,0.00003257309,0.021028504,0.0019847888,0.94519645,0.031059247,0.000022295433],"about_ca_topic_score_codex":0.0007065978,"about_ca_topic_score_gemma":0.0008516098,"teacher_disagreement_score":0.98052734,"about_ca_system_score_codex":0.0008302053,"about_ca_system_score_gemma":0.00097648613,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02724903,0.0007584311,0.932869,0.006330095,0.000297403,0.00019288003,0.00043135416,0.00032599253,0.031545773],"genre_scores_gemma":[0.755672,0.0012919892,0.21943615,0.0029889867,0.00083288003,0.0006053347,0.00087429537,0.00035808352,0.01794029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9927665,0.0023588184,0.0002706015,0.0014875102,0.0021785079,0.0009379108],"domain_scores_gemma":[0.9751634,0.016139934,0.0011371169,0.0045456165,0.0021552783,0.00085861847],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0053220433,0.00095880596,0.0017516346,0.0015095688,0.0027741627,0.004457594,0.0035490943,0.0031482636,0.012101184],"category_scores_gemma":[0.029938,0.00064416154,0.0017785566,0.002294759,0.0059277248,0.015672635,0.005344336,0.006159892,0.001906914],"study_design_candidate":"not_applicable","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.000037572765,0.000027806856,0.000274647,0.00003583721,0.000015499638,0.00002954339,0.000089351335,0.00616566,0.00058304745,0.9818456,0.0032867417,0.007608692],"study_design_scores_gemma":[0.000017932347,0.000038432478,0.00017625674,0.000013613735,0.000011907189,0.00007703598,0.000050000835,0.07287943,0.0008829473,0.9199967,0.0058363653,0.000019517054],"about_ca_topic_score_codex":0.0040318994,"about_ca_topic_score_gemma":0.00237021,"teacher_disagreement_score":0.9878988,"about_ca_system_score_codex":0.0045379642,"about_ca_system_score_gemma":0.0032151542,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018929295,0.0015052086,0.82630825,0.0058126287,0.0024697545,0.00029344152,0.0014117792,0.0049611377,0.13830855],"genre_scores_gemma":[0.35581934,0.002248975,0.54819953,0.008008023,0.0014715221,0.00056373706,0.0037898247,0.0015120596,0.07838699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987231,0.0001885729,0.00008542578,0.00032005858,0.00043140116,0.00025142994],"domain_scores_gemma":[0.9980732,0.00043628932,0.00010486743,0.00082351477,0.00042598683,0.00013614033],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000717752,0.00084184017,0.00065431267,0.00071937253,0.000931588,0.001797799,0.001798905,0.0011203677,0.035725255],"category_scores_gemma":[0.004213087,0.00049149484,0.001416566,0.0006957518,0.0009919986,0.0041124146,0.0039695334,0.0023879362,0.009774507],"study_design_candidate":"not_applicable","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.00024186082,0.00023318629,0.0010634036,0.00045314195,0.00007242979,0.00016117322,0.00013411825,0.0071704546,0.021319611,0.6538161,0.06907737,0.24625726],"study_design_scores_gemma":[0.00008016347,0.00027022735,0.0011623725,0.00012520766,0.00014571263,0.0009892847,0.000068029374,0.053932365,0.03428317,0.49326524,0.41560027,0.0000779739],"about_ca_topic_score_codex":0.001153847,"about_ca_topic_score_gemma":0.0018714801,"teacher_disagreement_score":0.96427476,"about_ca_system_score_codex":0.0013529146,"about_ca_system_score_gemma":0.0012582977,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27914125,0.0006385782,0.69808936,0.0018762792,0.0001459007,0.000084309126,0.00013055203,0.00016999351,0.019723745],"genre_scores_gemma":[0.8657845,0.00042474887,0.12374464,0.00032695153,0.000068414956,0.00014977799,0.000111714544,0.00007492353,0.0093143685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990922,0.00019748187,0.000041311156,0.0003029186,0.00017590722,0.00019020068],"domain_scores_gemma":[0.9954482,0.0024686672,0.00039838353,0.0011491542,0.00025077738,0.00028483625],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001603154,0.00041551376,0.0007154142,0.0004998923,0.0013478087,0.0015597326,0.0018922293,0.001117724,0.0037252074],"category_scores_gemma":[0.00701827,0.00037930033,0.00089136837,0.0005788107,0.0021101958,0.0054856054,0.002181839,0.001802975,0.00047514765],"study_design_candidate":"not_applicable","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.00015306406,0.00010060161,0.0020218384,0.00012775778,0.000025341546,0.00022733233,0.00033114484,0.11029746,0.006762468,0.85258424,0.0016149551,0.025753736],"study_design_scores_gemma":[0.000032950233,0.00018470024,0.00041545826,0.000021056438,0.000036346053,0.00019674086,0.00010872536,0.47011283,0.007075984,0.51344913,0.008341202,0.000024872568],"about_ca_topic_score_codex":0.0019082051,"about_ca_topic_score_gemma":0.002962002,"teacher_disagreement_score":0.99627477,"about_ca_system_score_codex":0.0013482396,"about_ca_system_score_gemma":0.0010225007,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008229984,0.0016629883,0.9182463,0.006619082,0.0019210405,0.00008257586,0.0004071358,0.0012204119,0.06161046],"genre_scores_gemma":[0.5169293,0.0046728286,0.406501,0.010086916,0.0029240504,0.00029913662,0.0019408598,0.0020661834,0.054579742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936941,0.0014467754,0.00042177754,0.0013483185,0.002231733,0.0008571403],"domain_scores_gemma":[0.9848161,0.007916022,0.00062528544,0.004080923,0.0018347277,0.0007269868],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003982663,0.0007214462,0.0008175288,0.0012145482,0.0022726518,0.0038683473,0.0025583995,0.0015644998,0.019975005],"category_scores_gemma":[0.01676809,0.00084392435,0.0018516118,0.0012768843,0.0047970493,0.01578397,0.009397906,0.0082414625,0.0060051866],"study_design_candidate":"not_applicable","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.00007809792,0.000044641925,0.00022100336,0.00030042356,0.000028437713,0.00014370173,0.000305652,0.00044324313,0.0012646145,0.9575432,0.010185147,0.029441843],"study_design_scores_gemma":[0.00003952263,0.000050505932,0.00047522917,0.0001178558,0.000054055818,0.00080384593,0.0001764519,0.0037440895,0.006471724,0.9190385,0.068964615,0.00006366665],"about_ca_topic_score_codex":0.0007265522,"about_ca_topic_score_gemma":0.0008785404,"teacher_disagreement_score":0.980025,"about_ca_system_score_codex":0.0015482538,"about_ca_system_score_gemma":0.0014454431,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4115191,0.0015400818,0.50824577,0.0015378349,0.0006149705,0.00014409285,0.001876007,0.0010736288,0.07344842],"genre_scores_gemma":[0.9139144,0.0006053034,0.07104676,0.00038295667,0.00021908781,0.00014589816,0.0009482522,0.0001332333,0.01260408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934345,0.0001188429,0.00004671609,0.00024163786,0.00012330855,0.0001260674],"domain_scores_gemma":[0.99894947,0.00039951873,0.00013686976,0.00013965688,0.00024461205,0.00012991259],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004558755,0.00042593858,0.0004286469,0.0008379391,0.00068340363,0.0014438047,0.0004704713,0.00052334525,0.0054701567],"category_scores_gemma":[0.00236952,0.0001685796,0.00039332034,0.0006022003,0.0014801599,0.0030822514,0.0009254894,0.0006717293,0.0012442038],"study_design_candidate":"not_applicable","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.0005293453,0.00015285666,0.0037626051,0.0004059411,0.000051084633,0.00039236477,0.0005387774,0.004371218,0.028136576,0.8309367,0.007224247,0.123498395],"study_design_scores_gemma":[0.000052776657,0.00026037058,0.0031846587,0.00009465687,0.000050116312,0.0028922644,0.00040168234,0.034552798,0.02080158,0.8880929,0.049521305,0.000095032156],"about_ca_topic_score_codex":0.00043586027,"about_ca_topic_score_gemma":0.0006109087,"teacher_disagreement_score":0.99452984,"about_ca_system_score_codex":0.0005879581,"about_ca_system_score_gemma":0.00043261418,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008614389,0.0007698737,0.95862114,0.0023901274,0.0012962826,0.00010223637,0.00013860839,0.0011020572,0.02696519],"genre_scores_gemma":[0.197643,0.0012974986,0.75614727,0.0021371213,0.0009578995,0.0001709825,0.0005019379,0.00048458693,0.040659755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885297,0.00025055968,0.000053759744,0.00031702782,0.00039394145,0.0001318365],"domain_scores_gemma":[0.9986027,0.0003403325,0.000056785197,0.0006667761,0.0002569506,0.00007656836],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000790567,0.0005021986,0.00053674483,0.0003359517,0.00096481876,0.001399467,0.001815248,0.0011373184,0.01598935],"category_scores_gemma":[0.0031739618,0.0002919743,0.00078672153,0.00036802277,0.0012147526,0.0030420392,0.0015049386,0.0020678057,0.008327375],"study_design_candidate":"not_applicable","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.00016582554,0.00019652047,0.0008734073,0.0002642813,0.000060479448,0.00012027912,0.00010389327,0.042657968,0.014859421,0.74972963,0.03277477,0.15819356],"study_design_scores_gemma":[0.000071806826,0.00023314454,0.00048384425,0.000060641174,0.000062754014,0.00047563526,0.000053360778,0.51605386,0.024260214,0.31302902,0.14513464,0.000081092556],"about_ca_topic_score_codex":0.0016219073,"about_ca_topic_score_gemma":0.0028263798,"teacher_disagreement_score":0.98401064,"about_ca_system_score_codex":0.0010150432,"about_ca_system_score_gemma":0.0014949156,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056790005,0.0004619364,0.9141019,0.0019660844,0.0001192955,0.00026797212,0.0007088224,0.00057713944,0.025006805],"genre_scores_gemma":[0.6439959,0.0011515142,0.33192608,0.00054207,0.0003031511,0.00037320875,0.0016555235,0.00031017812,0.01974239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890006,0.00030410895,0.000049617774,0.00038304142,0.00016785077,0.00019525064],"domain_scores_gemma":[0.9955778,0.002786733,0.00040355016,0.00053403823,0.00040568673,0.00029228517],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001883392,0.00090410426,0.00084254914,0.0006009457,0.0012541536,0.0020958548,0.001912328,0.0014095568,0.0092417365],"category_scores_gemma":[0.0080185225,0.00040717117,0.0011381919,0.0012355937,0.0011734718,0.004148416,0.0017696215,0.0020237889,0.0014387688],"study_design_candidate":"not_applicable","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.00029816167,0.00028377134,0.0016608798,0.00061995693,0.00011348407,0.00030537622,0.00041075778,0.49208233,0.006071967,0.34421313,0.016889708,0.13705046],"study_design_scores_gemma":[0.00002261086,0.00009809804,0.00046269238,0.000038890154,0.000034203105,0.00024823725,0.00025934944,0.69106096,0.0058375415,0.29095167,0.0109681245,0.000017652637],"about_ca_topic_score_codex":0.0019416091,"about_ca_topic_score_gemma":0.0023489168,"teacher_disagreement_score":0.99075824,"about_ca_system_score_codex":0.0015470012,"about_ca_system_score_gemma":0.0017221966,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026795372,0.00016692745,0.93491054,0.0014816842,0.00018142957,0.0003342152,0.0003968334,0.0012622337,0.034470703],"genre_scores_gemma":[0.68188,0.00029321597,0.29330486,0.00052373344,0.000107862455,0.0006511965,0.0004860586,0.00033316392,0.02241985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980945,0.00051923934,0.00008288835,0.0004830415,0.0005097049,0.00031058464],"domain_scores_gemma":[0.9959096,0.0016201049,0.00026416229,0.0015716199,0.0003015847,0.00033297078],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015386832,0.0006194028,0.00060981273,0.00041127586,0.0017206421,0.0021491076,0.00380056,0.0015063881,0.025022192],"category_scores_gemma":[0.005097061,0.0004975729,0.00081298733,0.0005593616,0.0034706758,0.005217279,0.0047838255,0.002959481,0.0042777047],"study_design_candidate":"not_applicable","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.00025730112,0.00015291588,0.00049232517,0.00019754769,0.000045067463,0.00021308583,0.0003874495,0.0098454375,0.010982086,0.9514888,0.0033399276,0.022598006],"study_design_scores_gemma":[0.0001327691,0.00023959664,0.00040410095,0.000060095877,0.00009583981,0.00034800186,0.00023499515,0.1936659,0.049200855,0.7137782,0.041709945,0.00012966283],"about_ca_topic_score_codex":0.0012077615,"about_ca_topic_score_gemma":0.0018918026,"teacher_disagreement_score":0.9749778,"about_ca_system_score_codex":0.0011197915,"about_ca_system_score_gemma":0.0015784333,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.506964,0.0016834458,0.4320515,0.0032385779,0.00028997206,0.00037777293,0.003801307,0.0015273499,0.050066084],"genre_scores_gemma":[0.97456115,0.00031128246,0.019029032,0.0005450422,0.0001854761,0.0001239095,0.0012143763,0.00013278762,0.0038970322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99455523,0.002101514,0.0002373031,0.0010167562,0.0014377707,0.0006513103],"domain_scores_gemma":[0.9382183,0.04637594,0.003056096,0.008994353,0.0021537733,0.0012014386],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0037192535,0.0011031164,0.0016377174,0.0015438263,0.0011820135,0.002024209,0.0019663433,0.0014849183,0.009303106],"category_scores_gemma":[0.055354606,0.00038967555,0.0009442276,0.001962571,0.0027941042,0.005795365,0.0034924902,0.002011524,0.0022379968],"study_design_candidate":"not_applicable","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.00311414,0.0006093492,0.10360051,0.0009654877,0.00035876717,0.00081616687,0.0005580346,0.049575284,0.014155193,0.55278236,0.02031375,0.25315097],"study_design_scores_gemma":[0.00027557192,0.0009243383,0.024832912,0.00020205755,0.00015814792,0.0021709544,0.00069703977,0.19795047,0.025438184,0.72833335,0.018845525,0.00017145638],"about_ca_topic_score_codex":0.0009540947,"about_ca_topic_score_gemma":0.0013957561,"teacher_disagreement_score":0.9906969,"about_ca_system_score_codex":0.0011068665,"about_ca_system_score_gemma":0.00092769833,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047556978,0.00079503923,0.72992754,0.0028272374,0.00095409027,0.000104325685,0.0003380504,0.0017496536,0.21574715],"genre_scores_gemma":[0.77835995,0.0010101988,0.1692548,0.0015162935,0.00027880198,0.00016746018,0.00035515582,0.0004385255,0.04861877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992914,0.00010020358,0.000024466694,0.00015011484,0.0002898566,0.00014396891],"domain_scores_gemma":[0.99877006,0.00041919813,0.00007053233,0.00041208474,0.00022204116,0.00010615619],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049693865,0.0005787811,0.00040604902,0.0004685457,0.0011594406,0.0017323493,0.0010292243,0.0008246668,0.010702675],"category_scores_gemma":[0.0030599325,0.00025163358,0.00045526054,0.0003655151,0.0018690297,0.0033139295,0.0022800951,0.0017119756,0.0026487769],"study_design_candidate":"not_applicable","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.000053088166,0.000041353618,0.00023503705,0.000053556352,0.000009506771,0.00014771245,0.00007090823,0.009758691,0.006398271,0.94809735,0.0087090405,0.026425486],"study_design_scores_gemma":[0.000021715632,0.000055544533,0.00016743367,0.00003891344,0.000020324836,0.000416766,0.00003618956,0.17436685,0.024208222,0.7439809,0.05665844,0.000028754112],"about_ca_topic_score_codex":0.0009594195,"about_ca_topic_score_gemma":0.001265997,"teacher_disagreement_score":0.98929733,"about_ca_system_score_codex":0.00071220874,"about_ca_system_score_gemma":0.00077196496,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27034688,0.0013144731,0.5924855,0.0113617685,0.0005472507,0.0003585301,0.0048151747,0.0020934965,0.11667692],"genre_scores_gemma":[0.8870776,0.0005943105,0.095919475,0.0012080774,0.00011357401,0.00019558848,0.0016750674,0.0001312921,0.013084993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966073,0.00008244899,0.000006481078,0.00010363012,0.00006825243,0.00007846523],"domain_scores_gemma":[0.9987148,0.00059240963,0.00012335656,0.00032985615,0.00013373814,0.00010586856],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039204195,0.0003414646,0.00028346496,0.00040192754,0.00053841446,0.0006609594,0.0005663526,0.0005716308,0.0076030223],"category_scores_gemma":[0.0032897869,0.00014748801,0.00024000519,0.00033670766,0.00068348704,0.00112424,0.0006677398,0.0007570436,0.0020062497],"study_design_candidate":"not_applicable","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.00032850108,0.0001945653,0.005437164,0.0002291335,0.00006635204,0.0004788979,0.00014902653,0.04373947,0.01867789,0.8288433,0.038683876,0.06317179],"study_design_scores_gemma":[0.00006352633,0.00016263577,0.0030410858,0.00004158545,0.000028504879,0.0006370381,0.00012036729,0.25362614,0.008440333,0.67199135,0.061810035,0.000037423884],"about_ca_topic_score_codex":0.001210164,"about_ca_topic_score_gemma":0.0020612755,"teacher_disagreement_score":0.99239695,"about_ca_system_score_codex":0.000617143,"about_ca_system_score_gemma":0.00048119793,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033490635,0.0033608472,0.42758894,0.014351421,0.0029116292,0.00018291622,0.00085719296,0.00077092607,0.51648545],"genre_scores_gemma":[0.6853359,0.0024499951,0.07503947,0.003638052,0.0031577486,0.00040089834,0.0008753603,0.0009714568,0.22813118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976451,0.00067104306,0.000110512025,0.00068010116,0.00065320637,0.0002401154],"domain_scores_gemma":[0.997072,0.0011366222,0.00012023656,0.00080961775,0.0005980195,0.0002634594],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012929572,0.0005815213,0.0010610572,0.0021072899,0.0035524364,0.005500688,0.0015054295,0.0015791256,0.028864076],"category_scores_gemma":[0.007434366,0.00043081865,0.0008979889,0.0020202182,0.004832138,0.008558205,0.0031571863,0.0032320959,0.0055458024],"study_design_candidate":"not_applicable","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.000013283707,0.00000501203,0.00008148533,0.000018508232,0.000003700838,0.00001752326,0.00007306193,0.000069844886,0.00018538555,0.9856512,0.0038115433,0.01006942],"study_design_scores_gemma":[0.000011259842,0.000011031121,0.00012793914,0.000016630638,0.000007713746,0.00011280376,0.00006825067,0.0014074233,0.00053344946,0.96755993,0.030134289,0.000009349348],"about_ca_topic_score_codex":0.0007085594,"about_ca_topic_score_gemma":0.0006753558,"teacher_disagreement_score":0.9711359,"about_ca_system_score_codex":0.001368628,"about_ca_system_score_gemma":0.0013707262,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08700056,0.007268326,0.67127633,0.01469545,0.0017000068,0.00015571927,0.0008604069,0.0015384551,0.21550472],"genre_scores_gemma":[0.81323653,0.0060345074,0.14249973,0.0015896322,0.0022474905,0.00029975284,0.00081702566,0.0007786855,0.032496706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985247,0.00024360682,0.00005557096,0.00031159987,0.00068724883,0.0001772301],"domain_scores_gemma":[0.99269366,0.0043511195,0.00037126875,0.0017144176,0.00063262816,0.00023692513],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011453693,0.00075095386,0.0007178071,0.000915537,0.0013519215,0.0032573736,0.0012886163,0.0011095189,0.01552807],"category_scores_gemma":[0.012828675,0.0003252677,0.0005955972,0.0010641863,0.002930756,0.009497872,0.0025685104,0.0036527347,0.0036625287],"study_design_candidate":"not_applicable","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.000049150298,0.000027914975,0.00021984863,0.00009559872,0.000007722357,0.000021898995,0.000056248384,0.004763447,0.0018926085,0.97153574,0.0037914165,0.017538346],"study_design_scores_gemma":[0.0000064161636,0.000036448142,0.000142116,0.000030234443,0.00000657179,0.000060467995,0.000027393116,0.027191164,0.0026329951,0.9562343,0.013621632,0.0000103316825],"about_ca_topic_score_codex":0.0005105114,"about_ca_topic_score_gemma":0.000530682,"teacher_disagreement_score":0.9844719,"about_ca_system_score_codex":0.001218805,"about_ca_system_score_gemma":0.00090516184,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14481111,0.002732001,0.73776215,0.016325945,0.0008552168,0.00015742029,0.0013107072,0.00061904243,0.0954264],"genre_scores_gemma":[0.9019286,0.0013231703,0.083762035,0.0014634809,0.0010080087,0.00019036006,0.00076881953,0.00016710057,0.009388415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956701,0.0011590993,0.00027570958,0.0006894499,0.001704341,0.0005013655],"domain_scores_gemma":[0.9832886,0.008541809,0.0018580843,0.0030796234,0.0020945903,0.001137347],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021766361,0.00063917466,0.0007652919,0.0011668819,0.0014240355,0.003476208,0.001141565,0.001551609,0.006631205],"category_scores_gemma":[0.017244054,0.00034095146,0.00062906,0.001579815,0.005830777,0.009161768,0.0039059287,0.004423991,0.0013643157],"study_design_candidate":"not_applicable","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.00009703802,0.000032875203,0.000565916,0.00006246023,0.000006953309,0.000052330917,0.00015110946,0.0017741357,0.0016990666,0.975921,0.00313796,0.01649916],"study_design_scores_gemma":[0.000014873873,0.00007000348,0.00046462376,0.000026615899,0.000007900546,0.0002955636,0.00009111899,0.011161589,0.0024144386,0.97511363,0.010305725,0.000033800243],"about_ca_topic_score_codex":0.00036785298,"about_ca_topic_score_gemma":0.00039201413,"teacher_disagreement_score":0.9933688,"about_ca_system_score_codex":0.0011407341,"about_ca_system_score_gemma":0.0013884943,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029419946,0.0062172622,0.7422082,0.010872744,0.0025761102,0.00029606072,0.0019374788,0.0030399433,0.20343228],"genre_scores_gemma":[0.5853554,0.0063899034,0.23448405,0.004006926,0.002100245,0.00047641428,0.005510285,0.001024997,0.16065189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967865,0.0005622974,0.00020153886,0.0011331812,0.0009919716,0.00032460768],"domain_scores_gemma":[0.99523586,0.0012805302,0.0003618369,0.0019705563,0.0008651587,0.0002861064],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001729341,0.00072766305,0.0008871678,0.0009670085,0.0017854611,0.0037782302,0.0022294628,0.002752326,0.037449904],"category_scores_gemma":[0.008857304,0.00041805138,0.00082506216,0.0010409624,0.0027889991,0.006344318,0.0038743697,0.0030214952,0.01676673],"study_design_candidate":"not_applicable","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.00022025187,0.000079067155,0.0012215944,0.0004486441,0.0000555747,0.00026213814,0.00028005568,0.008524514,0.0085551115,0.7958098,0.033641785,0.15090144],"study_design_scores_gemma":[0.00004290822,0.00013643462,0.0012198861,0.00017207721,0.000045187535,0.0007449132,0.00023847703,0.047957644,0.013759673,0.6764113,0.2591857,0.000085810185],"about_ca_topic_score_codex":0.0013013281,"about_ca_topic_score_gemma":0.0011489771,"teacher_disagreement_score":0.9625501,"about_ca_system_score_codex":0.0015360249,"about_ca_system_score_gemma":0.001960436,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016669868,0.22051595,0.5050302,0.05247817,0.0062234565,0.00016451663,0.0024218776,0.001838881,0.19465709],"genre_scores_gemma":[0.30957577,0.19528379,0.33713344,0.020132972,0.015501208,0.0004489161,0.006293248,0.0020711578,0.11355942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9928411,0.001374128,0.0004595594,0.0028333527,0.0022209208,0.0002708661],"domain_scores_gemma":[0.96322113,0.02468542,0.0016117884,0.004704538,0.00474272,0.001034419],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0054435665,0.0008115171,0.0012267114,0.002709455,0.0012125699,0.004844235,0.0023550438,0.0018652874,0.0265795],"category_scores_gemma":[0.027073447,0.00089427305,0.0011623407,0.003597147,0.0040696044,0.011711131,0.0037098376,0.0044736434,0.009776991],"study_design_candidate":"not_applicable","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.00016901811,0.000048195845,0.0009704491,0.0011678032,0.000053384225,0.00006073544,0.0002369836,0.0024205996,0.0012059067,0.7507728,0.035649247,0.20724474],"study_design_scores_gemma":[0.000022233879,0.00006489613,0.0010301397,0.00041469446,0.000040372815,0.00047634653,0.00015655032,0.0066447235,0.0018482895,0.4965838,0.49267608,0.0000419112],"about_ca_topic_score_codex":0.0014279642,"about_ca_topic_score_gemma":0.001271777,"teacher_disagreement_score":0.9734205,"about_ca_system_score_codex":0.005372879,"about_ca_system_score_gemma":0.0020789248,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034521315,0.00034423123,0.9306086,0.0062611527,0.00025941437,0.0001644878,0.00020472554,0.0005511955,0.027084956],"genre_scores_gemma":[0.6041505,0.000712117,0.3572952,0.002051259,0.00055985316,0.00043118864,0.0006282029,0.00037467128,0.03379696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972705,0.00074613397,0.0000805359,0.000734265,0.0005831393,0.00058541656],"domain_scores_gemma":[0.99169064,0.004223601,0.0006475391,0.002582764,0.000452398,0.00040314393],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025176168,0.0008678582,0.0009994769,0.0006741973,0.002566863,0.003134274,0.0032206683,0.0030668934,0.009567602],"category_scores_gemma":[0.014990486,0.00045157896,0.0017051721,0.0008748732,0.0028394621,0.012190486,0.0048038536,0.0057632537,0.0019530023],"study_design_candidate":"not_applicable","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.000107569664,0.00012054036,0.00067246245,0.00017680727,0.00003159805,0.00010649616,0.00024332502,0.024401352,0.0020302117,0.9153723,0.010067697,0.046669614],"study_design_scores_gemma":[0.000026213853,0.00006270555,0.00028283868,0.00004268243,0.00002468588,0.00018717724,0.00012604041,0.14746703,0.004560771,0.8301309,0.017059145,0.000029773331],"about_ca_topic_score_codex":0.0012496368,"about_ca_topic_score_gemma":0.0012188223,"teacher_disagreement_score":0.9904324,"about_ca_system_score_codex":0.0023101664,"about_ca_system_score_gemma":0.0020378316,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null}]}