{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":34,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":34,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"e86205b3fe25","filters":{"venue":"Theory of Computing"}},"results":[{"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"John Watrous","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06200837786253834,"gpt":0.3889094610674776,"spread":0.3269010832049393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001272702,0.0008818018,0.000529317,0.0007284196,0.0007870402,0.002545336,0.0009444882,0.0007206138,0.008133202],"category_scores_gemma":[0.007941908,0.0002899805,0.0006527895,0.0007275735,0.003520018,0.003568235,0.001864679,0.002379941,0.001896515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007861861,"about_ca_system_score_gemma":0.001002745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009155615,"about_ca_topic_score_gemma":0.001160707,"domain_scores_codex":[0.998769,0.000419473,0.00006056943,0.0002396708,0.0004137366,0.00009750853],"domain_scores_gemma":[0.9976135,0.001034575,0.0002368352,0.0003754507,0.0005797842,0.0001599348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009258077,0.000009326987,0.00003841837,0.00002100188,0.000003248397,0.0000183032,0.00003921262,0.002677544,0.0003893588,0.9890939,0.001253955,0.006446507],"study_design_scores_gemma":[0.000002845868,0.00001111535,0.00003861198,0.00001177698,0.00000213178,0.0000467616,0.00002528486,0.03712454,0.000485423,0.9599034,0.002340213,0.000007980285],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0177581,0.0003790722,0.9194877,0.0007668212,0.0002905264,0.00004226902,0.0002531722,0.0002424318,0.06077987],"genre_scores_gemma":[0.7090273,0.001284511,0.2537674,0.0007804355,0.0005348281,0.0003325615,0.0006959154,0.0004416851,0.0331353],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9918668,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; 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","authors":[{"name":"Peter Høyer","is_ca":true},{"name":"Robert Špalek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009385687952812326,"gpt":0.2337069938772732,"spread":0.2243213059244609,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004969387,0.0005787811,0.000406049,0.0004685457,0.001159441,0.001732349,0.001029224,0.0008246668,0.01070268],"category_scores_gemma":[0.003059932,0.0002516336,0.0004552605,0.0003655151,0.00186903,0.00331393,0.002280095,0.001711976,0.002648777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007122087,"about_ca_system_score_gemma":0.000771965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009594195,"about_ca_topic_score_gemma":0.001265997,"domain_scores_codex":[0.9992914,0.0001002036,0.00002446669,0.0001501148,0.0002898566,0.0001439689],"domain_scores_gemma":[0.9987701,0.0004191981,0.00007053233,0.0004120847,0.0002220412,0.0001061562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005308817,0.00004135362,0.000235037,0.00005355635,0.000009506771,0.0001477124,0.00007090823,0.009758691,0.006398271,0.9480973,0.00870904,0.02642549],"study_design_scores_gemma":[0.00002171563,0.00005554453,0.0001674337,0.00003891344,0.00002032484,0.000416766,0.00003618956,0.1743668,0.02420822,0.7439809,0.05665844,0.00002875411],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.04755698,0.0007950392,0.7299275,0.002827237,0.0009540903,0.0001043257,0.0003380504,0.001749654,0.2157471],"genre_scores_gemma":[0.7783599,0.001010199,0.1692548,0.001516294,0.000278802,0.0001674602,0.0003551558,0.0004385255,0.04861877],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9892973,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Joshua Buresh-Oppenheim","is_ca":false},{"name":"Nicola Galesi","is_ca":false},{"name":"Shlomo Hoory","is_ca":false},{"name":"Avner Magen","is_ca":false},{"name":"Toniann Pitassi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01345998444829758,"gpt":0.2270239102562561,"spread":0.2135639258079585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005596844,0.001836037,0.001432892,0.003537187,0.00223362,0.005970677,0.005680564,0.001759304,0.02218941],"category_scores_gemma":[0.03118616,0.001713729,0.003218145,0.003109014,0.003664308,0.014451,0.00796172,0.01071878,0.006573033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002919429,"about_ca_system_score_gemma":0.003229585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00205155,"about_ca_topic_score_gemma":0.003370554,"domain_scores_codex":[0.9892608,0.002264631,0.0006502735,0.002243808,0.004795102,0.0007854523],"domain_scores_gemma":[0.9682459,0.01506994,0.001772448,0.01094378,0.003124559,0.0008434561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000219306,0.0002508543,0.0009133919,0.0007596196,0.0002120881,0.0001925633,0.0004658435,0.02268814,0.01185467,0.7164364,0.02048516,0.2255219],"study_design_scores_gemma":[0.00009254463,0.0001620496,0.0005323514,0.0001165368,0.0002427618,0.0005592254,0.0001503852,0.1521418,0.02812943,0.7431599,0.07459775,0.0001153527],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.003111896,0.000247058,0.9795999,0.001068456,0.0001655252,0.0001886745,0.0003021993,0.001819151,0.0134971],"genre_scores_gemma":[0.1101963,0.0006039436,0.8739066,0.001368336,0.0005500661,0.0005712123,0.001206242,0.001357274,0.01023991],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9778106,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Anne Broadbent","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01533380202698224,"gpt":0.2533487615405014,"spread":0.2380149595135192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00430755,0.0009278578,0.001280684,0.001588052,0.002601872,0.004304243,0.004532246,0.003368858,0.0223012],"category_scores_gemma":[0.01865353,0.0007471844,0.002896397,0.001191389,0.006474919,0.009860814,0.009978514,0.007387085,0.007859625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001583012,"about_ca_system_score_gemma":0.002761172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005223142,"about_ca_topic_score_gemma":0.000567181,"domain_scores_codex":[0.9947278,0.001259763,0.0002374448,0.0008499236,0.002255101,0.0006701045],"domain_scores_gemma":[0.9888425,0.004299856,0.000464067,0.004642432,0.001199861,0.0005512885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003059432,0.00004169216,0.0001041914,0.0001073349,0.0000178677,0.0000778359,0.00009254885,0.002420619,0.001990513,0.9825522,0.004126952,0.008437544],"study_design_scores_gemma":[0.00002571423,0.00006363812,0.00005952937,0.00004841924,0.00003019372,0.0001715142,0.00003905055,0.02769208,0.00513884,0.9335904,0.03310964,0.00003103374],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.004281405,0.0002849257,0.9592662,0.005179086,0.000759659,0.000143208,0.0002085601,0.0007855489,0.02909125],"genre_scores_gemma":[0.3199825,0.001036091,0.6454457,0.004681141,0.001499993,0.0008837416,0.0009232924,0.001056811,0.0244907],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9776988,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Michael Alekhnovich","is_ca":false},{"name":"Jan Johannsen","is_ca":false},{"name":"Toniann Pitassi","is_ca":false},{"name":"Alasdair Urquhart","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06560666522432046,"gpt":0.3598275821368961,"spread":0.2942209169125757,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003982663,0.0007214462,0.0008175288,0.001214548,0.002272652,0.003868347,0.002558399,0.0015645,0.019975],"category_scores_gemma":[0.01676809,0.0008439244,0.001851612,0.001276884,0.004797049,0.01578397,0.009397906,0.008241463,0.006005187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001548254,"about_ca_system_score_gemma":0.001445443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007265522,"about_ca_topic_score_gemma":0.0008785404,"domain_scores_codex":[0.9936941,0.001446775,0.0004217775,0.001348319,0.002231733,0.0008571403],"domain_scores_gemma":[0.9848161,0.007916022,0.0006252854,0.004080923,0.001834728,0.0007269868],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007809792,0.00004464193,0.0002210034,0.0003004236,0.00002843771,0.0001437017,0.000305652,0.0004432431,0.001264615,0.9575432,0.01018515,0.02944184],"study_design_scores_gemma":[0.00003952263,0.00005050593,0.0004752292,0.0001178558,0.00005405582,0.0008038459,0.0001764519,0.00374409,0.006471724,0.9190385,0.06896462,0.00006366665],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.008229984,0.001662988,0.9182463,0.006619082,0.00192104,0.00008257586,0.0004071358,0.001220412,0.06161046],"genre_scores_gemma":[0.5169293,0.004672829,0.406501,0.01008692,0.00292405,0.0002991366,0.00194086,0.002066183,0.05457974],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.980025,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Daniel Gottesman","is_ca":false},{"name":"Sandy Irani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008336922265740671,"gpt":0.2165675538369913,"spread":0.2082306315712506,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001825998,0.001129981,0.00131471,0.0007597053,0.002017311,0.003052971,0.003035748,0.002585889,0.01484949],"category_scores_gemma":[0.02009652,0.0005728313,0.001782184,0.001637934,0.003757949,0.009503459,0.00354919,0.005217761,0.001236749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002243717,"about_ca_system_score_gemma":0.001512807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002147189,"about_ca_topic_score_gemma":0.002048623,"domain_scores_codex":[0.9968092,0.0009588971,0.0001228263,0.0009643274,0.0005632081,0.000581486],"domain_scores_gemma":[0.9774849,0.0185258,0.001188045,0.001765609,0.0005118997,0.0005237293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007785574,0.0005251145,0.003763042,0.0009818162,0.0001859222,0.0004178178,0.0005226078,0.2647919,0.003733872,0.6391656,0.02355891,0.06157484],"study_design_scores_gemma":[0.00007775103,0.0001001986,0.0006326804,0.0000315826,0.0000275181,0.00016979,0.0001519214,0.2853555,0.001795806,0.7063183,0.005315288,0.00002363492],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.3224505,0.001988885,0.5948597,0.01331197,0.0004209177,0.0004420262,0.002684026,0.0009188563,0.06292303],"genre_scores_gemma":[0.8308144,0.001147618,0.1489185,0.001400158,0.0007707925,0.0005159263,0.002838118,0.0004250369,0.0131695],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9851505,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Siavosh Benabbas","is_ca":false},{"name":"Konstantinos Georgiou","is_ca":false},{"name":"Avner Magen","is_ca":false},{"name":"Madhur Tulsiani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03077153895836308,"gpt":0.2621209887200663,"spread":0.2313494497617032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001196095,0.0009930037,0.001232896,0.0004979769,0.001031296,0.001787702,0.001972131,0.00173414,0.01256013],"category_scores_gemma":[0.007977965,0.000386306,0.001226923,0.001367335,0.001261341,0.003755424,0.001823925,0.002059396,0.00107287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001646173,"about_ca_system_score_gemma":0.001313385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004974602,"about_ca_topic_score_gemma":0.005014201,"domain_scores_codex":[0.9984899,0.0004122643,0.00005390877,0.0005013078,0.0002667852,0.0002758325],"domain_scores_gemma":[0.9964857,0.002406619,0.000247447,0.0003427881,0.0002745877,0.0002427702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000409631,0.0001956336,0.001932725,0.0004384945,0.0001356435,0.0003656932,0.0001602616,0.6021985,0.001657654,0.3143403,0.01746082,0.06070461],"study_design_scores_gemma":[0.00004216989,0.00009514158,0.0002940453,0.0000294363,0.00003042718,0.0001759718,0.00009945605,0.6967682,0.0009548281,0.2914641,0.01003172,0.00001449922],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.07224768,0.001630128,0.895448,0.004657326,0.0003701384,0.0001250983,0.001186675,0.0006467418,0.0236882],"genre_scores_gemma":[0.6794428,0.001385835,0.299348,0.001374485,0.0004069988,0.0001973373,0.001891492,0.0003055184,0.01564757],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9874399,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ben W. Reichardt","is_ca":true},{"name":"Robert Špalek","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01318818891469431,"gpt":0.2415988830653368,"spread":0.2284106941506425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005064602,0.0007380687,0.0007081497,0.0006356645,0.001052799,0.001543729,0.001576541,0.001029609,0.01510312],"category_scores_gemma":[0.001868023,0.0003492424,0.0009182268,0.0008222395,0.0006116314,0.002156152,0.001792671,0.001203469,0.004075134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008662063,"about_ca_system_score_gemma":0.001127388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001397932,"about_ca_topic_score_gemma":0.0036104,"domain_scores_codex":[0.9993131,0.0001029914,0.00006181127,0.0001502317,0.0002657895,0.0001060623],"domain_scores_gemma":[0.9994385,0.0001156689,0.00002791426,0.0001927631,0.0001940796,0.00003107362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002056172,0.0001930586,0.0007897621,0.0004528851,0.000118598,0.0002386448,0.0001654065,0.03066832,0.01553357,0.3048331,0.02988044,0.6169206],"study_design_scores_gemma":[0.0001479031,0.0001821243,0.0005241345,0.0001054038,0.0001733325,0.0006363278,0.0001009152,0.3314308,0.03285158,0.5538535,0.07989693,0.00009715814],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.006773241,0.0003025591,0.979154,0.0005227006,0.0002174084,0.0001277583,0.0002109634,0.001933308,0.01075813],"genre_scores_gemma":[0.1161917,0.0003218457,0.8728735,0.0003145296,0.00009403189,0.0001642418,0.0005502516,0.0003643925,0.009125485],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9848969,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Per Austrin","is_ca":false},{"name":"Mark Braverman","is_ca":false},{"name":"Eden Chlamtáč","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1123244387416019,"gpt":0.3821212525641821,"spread":0.2697968138225803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003640967,0.001386434,0.002117411,0.001805068,0.001794927,0.002916178,0.002290832,0.001802422,0.01776705],"category_scores_gemma":[0.0216184,0.0007011994,0.001648923,0.002674383,0.002251486,0.005484459,0.004094166,0.003241967,0.006228868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002007194,"about_ca_system_score_gemma":0.001936168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002357183,"about_ca_topic_score_gemma":0.003285213,"domain_scores_codex":[0.9964948,0.001083725,0.0001499245,0.0009702745,0.001029484,0.0002718302],"domain_scores_gemma":[0.988,0.007863526,0.0004341059,0.001980192,0.00133509,0.0003870688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003674956,0.0002415981,0.002657421,0.0007776517,0.0001538435,0.0001421064,0.000292474,0.03574368,0.001334104,0.7499138,0.02546403,0.1829117],"study_design_scores_gemma":[0.00004842927,0.0001307932,0.0008174653,0.000125439,0.00008600636,0.0003356487,0.0001426935,0.1377277,0.001770811,0.7979766,0.06078614,0.0000523868],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.01587338,0.005789984,0.9128296,0.003361249,0.0006960977,0.000253804,0.000653812,0.0003699527,0.06017219],"genre_scores_gemma":[0.3812424,0.01037865,0.5477578,0.004487498,0.00137251,0.0006592261,0.002819741,0.0004659698,0.0508162],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9822329,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.009077966139590523,"gpt":0.2355652722517748,"spread":0.2264873061121843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005335054,0.0009793694,0.00107921,0.001002255,0.004751378,0.004572592,0.005340652,0.02077623,0.02356864],"category_scores_gemma":[0.02761027,0.0005075918,0.001715614,0.0008986669,0.006179519,0.006173235,0.002434431,0.0273315,0.01809995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004963276,"about_ca_system_score_gemma":0.003089867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02787404,"about_ca_topic_score_gemma":0.02784327,"domain_scores_codex":[0.9932026,0.001325399,0.0006314415,0.001359158,0.002617929,0.0008635048],"domain_scores_gemma":[0.9852834,0.006027828,0.0007387292,0.000903904,0.006338418,0.0007077928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002922089,0.00001258292,0.0001214403,0.00007839764,0.00001277181,0.00009080928,0.0002074971,0.00007040881,0.0001202475,0.03530501,0.9608184,0.003133276],"study_design_scores_gemma":[0.00001964119,0.0000187886,0.0006651226,0.0001313622,0.00001409797,0.0001103115,0.0002305483,0.0002044503,0.0003376173,0.01634477,0.9818798,0.00004336147],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"other","genre_scores_codex":[0.0004064527,0.001964486,0.001730336,0.8942265,0.08202422,0.00003007769,0.0003378878,0.0002628533,0.01901717],"genre_scores_gemma":[0.005320363,0.0008810238,0.001089094,0.9260446,0.0402461,0.00006537208,0.00006667936,0.0001476625,0.02613899],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9764314,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Aleksandrs Belovs","is_ca":false},{"name":"Eric Blais","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02375489289472492,"gpt":0.25114493347704,"spread":0.2273900405823151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000790567,0.0005021986,0.0005367448,0.0003359517,0.0009648188,0.001399467,0.001815248,0.001137318,0.01598935],"category_scores_gemma":[0.003173962,0.0002919743,0.0007867215,0.0003680228,0.001214753,0.003042039,0.001504939,0.002067806,0.008327375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001015043,"about_ca_system_score_gemma":0.001494916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001621907,"about_ca_topic_score_gemma":0.00282638,"domain_scores_codex":[0.998853,0.0002505597,0.00005375974,0.0003170278,0.0003939414,0.0001318365],"domain_scores_gemma":[0.9986027,0.0003403325,0.0000567852,0.0006667761,0.0002569506,0.00007656836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001658255,0.0001965205,0.0008734073,0.0002642813,0.00006047945,0.0001202791,0.0001038933,0.04265797,0.01485942,0.7497296,0.03277477,0.1581936],"study_design_scores_gemma":[0.00007180683,0.0002331445,0.0004838443,0.00006064117,0.00006275401,0.0004756353,0.00005336078,0.5160539,0.02426021,0.313029,0.1451346,0.00008109256],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.008614389,0.0007698737,0.9586211,0.002390127,0.001296283,0.0001022364,0.0001386084,0.001102057,0.02696519],"genre_scores_gemma":[0.197643,0.001297499,0.7561473,0.002137121,0.0009578995,0.0001709825,0.0005019379,0.0004845869,0.04065976],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9840106,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Andris Ambainis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007055393626629365,"gpt":0.2291734788798008,"spread":0.2221180852531715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009290084,0.003112134,0.002697266,0.004683887,0.003519483,0.00680222,0.008874845,0.00429852,0.01927902],"category_scores_gemma":[0.02968765,0.001633155,0.004651773,0.003490339,0.007963351,0.02069587,0.01152284,0.016115,0.007124019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003247257,"about_ca_system_score_gemma":0.003181567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001134048,"about_ca_topic_score_gemma":0.00131158,"domain_scores_codex":[0.9854828,0.003108942,0.0006038871,0.002678699,0.006781849,0.001343912],"domain_scores_gemma":[0.9714603,0.01598689,0.001072515,0.007606739,0.002795045,0.001078619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001196806,0.0001159065,0.0002372088,0.0002610686,0.0001101946,0.00008517906,0.0001217932,0.007278064,0.003924705,0.9496362,0.009395768,0.02871437],"study_design_scores_gemma":[0.0000513442,0.0001247998,0.0001458768,0.00005740635,0.00008987724,0.0002321062,0.00003429188,0.1201153,0.007375319,0.8509781,0.02071214,0.00008345281],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.001920822,0.000360598,0.9846614,0.00148558,0.0004753672,0.0000903097,0.0001289458,0.0005086079,0.0103684],"genre_scores_gemma":[0.2291246,0.002277983,0.730602,0.004363639,0.003904575,0.001650811,0.0009054327,0.001529119,0.02564186],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.980721,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Salman Beigi","is_ca":false},{"name":"Peter W. Shor","is_ca":false},{"name":"John Watrous","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03739569460194093,"gpt":0.2301184610652776,"spread":0.1927227664633367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001469009,0.0004673231,0.0004589973,0.0003967236,0.001743724,0.002660434,0.002415919,0.001425031,0.01410867],"category_scores_gemma":[0.005885821,0.0002631229,0.0007503458,0.0005573603,0.002896908,0.005306333,0.001987826,0.001672217,0.002433894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001426202,"about_ca_system_score_gemma":0.00132293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001334401,"about_ca_topic_score_gemma":0.001277119,"domain_scores_codex":[0.9972799,0.0007182938,0.0001146147,0.0006295846,0.0008424701,0.0004151704],"domain_scores_gemma":[0.9953464,0.002010356,0.0003150613,0.001560505,0.0005221616,0.0002455633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000155847,0.00005173455,0.0004080223,0.00008246794,0.00002115394,0.0001015647,0.000193553,0.008186602,0.002295205,0.9645675,0.001905151,0.02203121],"study_design_scores_gemma":[0.00009122016,0.0002367411,0.000526231,0.00006295106,0.0000625005,0.000609101,0.0002384587,0.1187618,0.01457526,0.7730895,0.09165469,0.00009156303],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.04523376,0.001076867,0.8484801,0.00152671,0.0003301635,0.0001964271,0.0002544822,0.0006639904,0.1022375],"genre_scores_gemma":[0.8106606,0.0008605566,0.159964,0.0005641768,0.0002012559,0.0001797003,0.0003447435,0.0001914794,0.02703352],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9858913,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02375489289472492,"gpt":0.25114493347704,"spread":0.2273900405823151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005519373,0.0007929277,0.0009283269,0.001754112,0.002603366,0.006141555,0.003320019,0.002546753,0.009381487],"category_scores_gemma":[0.02688275,0.0006825491,0.002099344,0.001661078,0.009770811,0.01719269,0.007603512,0.007724602,0.001288304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002935954,"about_ca_system_score_gemma":0.002177228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000879955,"about_ca_topic_score_gemma":0.000851798,"domain_scores_codex":[0.9930499,0.001979352,0.0004187659,0.001893285,0.001983674,0.0006750239],"domain_scores_gemma":[0.955071,0.02961763,0.0031472,0.008341485,0.002569712,0.001253008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002220288,0.00003151531,0.0002826967,0.00006129531,0.000009109795,0.00003380986,0.0001180807,0.003193974,0.00048225,0.989722,0.001118521,0.004924589],"study_design_scores_gemma":[0.000007145683,0.00001926533,0.000161074,0.00001585759,0.000007159667,0.00008247366,0.00003734032,0.02455714,0.0008906352,0.971027,0.003180249,0.00001475066],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0230933,0.0003030853,0.9525658,0.003976525,0.0001506655,0.0001247898,0.0003900507,0.0002068688,0.01918892],"genre_scores_gemma":[0.7131395,0.0006371958,0.2704186,0.002042532,0.0008489639,0.0004906042,0.0009069468,0.0002677604,0.011248],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9906185,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Cedric Yen-Yu Lin","is_ca":false},{"name":"Han-Hsuan Lin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009925032442266456,"gpt":0.2265594615263934,"spread":0.216634429084127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005322043,0.000958806,0.001751635,0.001509569,0.002774163,0.004457594,0.003549094,0.003148264,0.01210118],"category_scores_gemma":[0.029938,0.0006441615,0.001778557,0.002294759,0.005927725,0.01567264,0.005344336,0.006159892,0.001906914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004537964,"about_ca_system_score_gemma":0.003215154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004031899,"about_ca_topic_score_gemma":0.00237021,"domain_scores_codex":[0.9927665,0.002358818,0.0002706015,0.00148751,0.002178508,0.0009379108],"domain_scores_gemma":[0.9751634,0.01613993,0.001137117,0.004545616,0.002155278,0.0008586185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003757276,0.00002780686,0.000274647,0.00003583721,0.00001549964,0.00002954339,0.00008935134,0.00616566,0.0005830475,0.9818456,0.003286742,0.007608692],"study_design_scores_gemma":[0.00001793235,0.00003843248,0.0001762567,0.00001361374,0.00001190719,0.00007703598,0.00005000084,0.07287943,0.0008829473,0.9199967,0.005836365,0.00001951705],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.02724903,0.0007584311,0.932869,0.006330095,0.000297403,0.00019288,0.0004313542,0.0003259925,0.03154577],"genre_scores_gemma":[0.755672,0.001291989,0.2194362,0.002988987,0.00083288,0.0006053347,0.0008742954,0.0003580835,0.01794029],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9878988,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Paul Beame","is_ca":false},{"name":"Matei David","is_ca":true},{"name":"Toniann Pitassi","is_ca":true},{"name":"Philipp Woelfel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01467507942114589,"gpt":0.2465031238987778,"spread":0.2318280444776319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002517617,0.0008678582,0.0009994769,0.0006741973,0.002566863,0.003134274,0.003220668,0.003066893,0.009567602],"category_scores_gemma":[0.01499049,0.000451579,0.001705172,0.0008748732,0.002839462,0.01219049,0.004803854,0.005763254,0.001953002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002310166,"about_ca_system_score_gemma":0.002037832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001249637,"about_ca_topic_score_gemma":0.001218822,"domain_scores_codex":[0.9972705,0.000746134,0.0000805359,0.000734265,0.0005831393,0.0005854166],"domain_scores_gemma":[0.9916906,0.004223601,0.0006475391,0.002582764,0.000452398,0.0004031439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001075697,0.0001205404,0.0006724625,0.0001768073,0.00003159805,0.0001064962,0.000243325,0.02440135,0.002030212,0.9153723,0.0100677,0.04666961],"study_design_scores_gemma":[0.00002621385,0.00006270555,0.0002828387,0.00004268243,0.00002468588,0.0001871772,0.0001260404,0.147467,0.004560771,0.8301309,0.01705915,0.00002977333],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.03452132,0.0003442312,0.9306086,0.006261153,0.0002594144,0.0001644878,0.0002047255,0.0005511955,0.02708496],"genre_scores_gemma":[0.6041505,0.000712117,0.3572952,0.002051259,0.0005598532,0.0004311886,0.0006282029,0.0003746713,0.03379696],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9904324,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Daniel Dadush","is_ca":false},{"name":"Shashwat Garg","is_ca":false},{"name":"Shachar Lovett","is_ca":false},{"name":"Aleksandar Nikolov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07994249218843967,"gpt":0.3770214135503005,"spread":0.2970789213618608,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002826544,0.0007942118,0.001062608,0.001644201,0.001604907,0.002637155,0.001382052,0.001110353,0.01947267],"category_scores_gemma":[0.01103087,0.0005335924,0.00101998,0.001612498,0.003040961,0.005117413,0.003588915,0.002830529,0.0108959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008302053,"about_ca_system_score_gemma":0.0009764861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007065978,"about_ca_topic_score_gemma":0.0008516098,"domain_scores_codex":[0.9977311,0.0004593635,0.0001131852,0.0006894192,0.0008170645,0.0001897163],"domain_scores_gemma":[0.9963251,0.001504965,0.0003338545,0.0009111051,0.0006873613,0.0002375978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005346504,0.00002864797,0.0003914659,0.0000760956,0.00002048558,0.00003684926,0.00008495969,0.00285334,0.001612176,0.9113656,0.01254894,0.07092801],"study_design_scores_gemma":[0.00001319447,0.0000368389,0.0003992385,0.0000289557,0.00000995221,0.0001879536,0.00003257309,0.0210285,0.001984789,0.9451964,0.03105925,0.00002229543],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.004481478,0.0005203261,0.9654899,0.001087085,0.0003373051,0.00007507261,0.0003196039,0.000360141,0.02732905],"genre_scores_gemma":[0.233712,0.002185398,0.6770481,0.003761556,0.001504175,0.0008938692,0.002247757,0.00132825,0.07731879],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9805273,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Nathaniel Bryans","is_ca":false},{"name":"Ehsan Chiniforooshan","is_ca":false},{"name":"David Doty","is_ca":false},{"name":"Lila Kari","is_ca":false},{"name":"Shinnosuke Seki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01080034766990897,"gpt":0.2211525095681928,"spread":0.2103521618982838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001603154,0.0004155138,0.0007154142,0.0004998923,0.001347809,0.001559733,0.001892229,0.001117724,0.003725207],"category_scores_gemma":[0.00701827,0.0003793003,0.0008913684,0.0005788107,0.002110196,0.005485605,0.002181839,0.001802975,0.0004751477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00134824,"about_ca_system_score_gemma":0.001022501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001908205,"about_ca_topic_score_gemma":0.002962002,"domain_scores_codex":[0.9990922,0.0001974819,0.00004131116,0.0003029186,0.0001759072,0.0001902007],"domain_scores_gemma":[0.9954482,0.002468667,0.0003983835,0.001149154,0.0002507774,0.0002848362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001530641,0.0001006016,0.002021838,0.0001277578,0.00002534155,0.0002273323,0.0003311448,0.1102975,0.006762468,0.8525842,0.001614955,0.02575374],"study_design_scores_gemma":[0.00003295023,0.0001847002,0.0004154583,0.00002105644,0.00003634605,0.0001967409,0.0001087254,0.4701128,0.007075984,0.5134491,0.008341202,0.00002487257],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.2791412,0.0006385782,0.6980894,0.001876279,0.0001459007,0.00008430913,0.000130552,0.0001699935,0.01972375],"genre_scores_gemma":[0.8657845,0.0004247489,0.1237446,0.0003269515,0.00006841496,0.000149778,0.0001117145,0.00007492353,0.009314368],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9962748,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Andrew M. Childs","is_ca":false},{"name":"David Gosset","is_ca":false},{"name":"Zak Webb","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03082622424416082,"gpt":0.2666117261598526,"spread":0.2357855019156918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002259446,0.0003264239,0.0003531276,0.0004302744,0.0006734687,0.0009075921,0.000756399,0.0006104265,0.006757569],"category_scores_gemma":[0.0005917264,0.0001191367,0.0003794413,0.0004679187,0.0009928992,0.001447028,0.0007184521,0.0008383112,0.001331399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005879256,"about_ca_system_score_gemma":0.0004452505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002387625,"about_ca_topic_score_gemma":0.003012053,"domain_scores_codex":[0.9997861,0.00006248141,0.000006851603,0.00004650048,0.00005753982,0.00004059415],"domain_scores_gemma":[0.9998191,0.00004429432,0.00002456151,0.00005935125,0.00003008248,0.0000227191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001722967,0.00001743476,0.0002123653,0.00002624376,0.000007415259,0.00005183525,0.00006115506,0.004591865,0.00191008,0.9863892,0.002674034,0.004041089],"study_design_scores_gemma":[0.00001407513,0.00004047737,0.0005231135,0.00001939989,0.00001103403,0.0001688883,0.00007886797,0.07832794,0.001919322,0.8791583,0.03971877,0.00001979045],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.165417,0.002788753,0.6399513,0.004473804,0.0006017542,0.0001404971,0.001811434,0.0007729072,0.1840425],"genre_scores_gemma":[0.9016982,0.001190183,0.06459172,0.0007272622,0.0002828273,0.000108479,0.0008139776,0.0001167015,0.03047079],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9932424,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Yuval Dagan","is_ca":false},{"name":"Hamed Hatami","is_ca":false},{"name":"Yaqiao Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02517525167577186,"gpt":0.2648571671221354,"spread":0.2396819154463635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001871323,0.000982641,0.001160904,0.0006944113,0.002419899,0.004694895,0.003711718,0.004124366,0.01429957],"category_scores_gemma":[0.01162249,0.0003592054,0.001192874,0.001183782,0.002890375,0.008333949,0.003391832,0.00419278,0.003793632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001234127,"about_ca_system_score_gemma":0.001501756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001626705,"about_ca_topic_score_gemma":0.001238056,"domain_scores_codex":[0.9969657,0.0009412651,0.0001091108,0.0006967598,0.0006530486,0.0006340471],"domain_scores_gemma":[0.9939935,0.002212349,0.0005538529,0.002284354,0.0005959928,0.0003600208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000454571,0.00004101079,0.0001864482,0.00005833456,0.00001759542,0.0001418634,0.00005304888,0.01090088,0.0004277136,0.9812229,0.003404752,0.003499854],"study_design_scores_gemma":[0.00002641397,0.00003132653,0.00009440532,0.0000207744,0.00002128862,0.0001725396,0.00006879736,0.07014886,0.0006779742,0.9206572,0.008055325,0.0000251174],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.051937,0.001119081,0.7944673,0.01109136,0.001517967,0.0002187699,0.0008383755,0.0003187321,0.1384914],"genre_scores_gemma":[0.8803824,0.001708902,0.07534329,0.001794501,0.0008482632,0.0002558302,0.0003411084,0.0001313897,0.03919436],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9857004,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Stacey Jeffery","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009913898574620694,"gpt":0.224275932359938,"spread":0.2143620337853173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001145369,0.0007509539,0.0007178071,0.000915537,0.001351921,0.003257374,0.001288616,0.001109519,0.01552807],"category_scores_gemma":[0.01282868,0.0003252677,0.0005955972,0.001064186,0.002930756,0.009497872,0.00256851,0.003652735,0.003662529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001218805,"about_ca_system_score_gemma":0.0009051618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005105114,"about_ca_topic_score_gemma":0.000530682,"domain_scores_codex":[0.9985247,0.0002436068,0.00005557096,0.0003115999,0.0006872488,0.0001772301],"domain_scores_gemma":[0.9926937,0.00435112,0.0003712687,0.001714418,0.0006326282,0.0002369251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000491503,0.00002791498,0.0002198486,0.00009559872,0.000007722357,0.000021899,0.00005624838,0.004763447,0.001892608,0.9715357,0.003791417,0.01753835],"study_design_scores_gemma":[0.000006416164,0.00003644814,0.000142116,0.00003023444,0.00000657179,0.000060468,0.00002739312,0.02719116,0.002632995,0.9562343,0.01362163,0.00001033168],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.08700056,0.007268326,0.6712763,0.01469545,0.001700007,0.0001557193,0.0008604069,0.001538455,0.2155047],"genre_scores_gemma":[0.8132365,0.006034507,0.1424997,0.001589632,0.00224749,0.0002997528,0.0008170257,0.0007786855,0.03249671],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9844719,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Clément L. Canonne","is_ca":false},{"name":"Elena Grigorescu","is_ca":false},{"name":"Siyao Guo","is_ca":false},{"name":"Akash Kumar","is_ca":false},{"name":"Karl Wimmer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006081717006494044,"gpt":0.2297844483486752,"spread":0.2237027313421811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004558755,0.0004259386,0.0004286469,0.0008379391,0.0006834036,0.001443805,0.0004704713,0.0005233453,0.005470157],"category_scores_gemma":[0.00236952,0.0001685796,0.0003933203,0.0006022003,0.00148016,0.003082251,0.0009254894,0.0006717293,0.001244204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005879581,"about_ca_system_score_gemma":0.0004326142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004358603,"about_ca_topic_score_gemma":0.0006109087,"domain_scores_codex":[0.9993435,0.0001188429,0.00004671609,0.0002416379,0.0001233085,0.0001260674],"domain_scores_gemma":[0.9989495,0.0003995187,0.0001368698,0.0001396569,0.000244612,0.0001299126],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005293453,0.0001528567,0.003762605,0.0004059411,0.00005108463,0.0003923648,0.0005387774,0.004371218,0.02813658,0.8309367,0.007224247,0.1234984],"study_design_scores_gemma":[0.00005277666,0.0002603706,0.003184659,0.00009465687,0.00005011631,0.002892264,0.0004016823,0.0345528,0.02080158,0.8880929,0.0495213,0.00009503216],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.4115191,0.001540082,0.5082458,0.001537835,0.0006149705,0.0001440928,0.001876007,0.001073629,0.07344842],"genre_scores_gemma":[0.9139144,0.0006053034,0.07104676,0.0003829567,0.0002190878,0.0001458982,0.0009482522,0.0001332333,0.01260408],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9945298,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Environment and Climate Change Canada; National Science Foundation","keywords":"Computer science; Mathematics; Combinatorics","authors":[{"name":"Anup Rao","is_ca":false},{"name":"Makrand Sinha","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01450825915178787,"gpt":0.2493023280208831,"spread":0.2347940688690953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003701138,0.0005500524,0.0004249502,0.001149174,0.001490507,0.001673844,0.0008966151,0.001395011,0.02261138],"category_scores_gemma":[0.002315381,0.000175034,0.0007533438,0.0009828368,0.0013034,0.002364193,0.001514872,0.001741504,0.00474576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001216614,"about_ca_system_score_gemma":0.0004979009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001638362,"about_ca_topic_score_gemma":0.001589906,"domain_scores_codex":[0.9994853,0.00009393063,0.00001978702,0.0000895479,0.0001615371,0.0001498779],"domain_scores_gemma":[0.9990989,0.0004330597,0.00007466978,0.0001616215,0.0001361542,0.00009568534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000102638,0.00004039954,0.0002896112,0.0001541456,0.00001405351,0.0004848211,0.00007774482,0.003493104,0.00376262,0.9505333,0.01789104,0.02315648],"study_design_scores_gemma":[0.00002740456,0.00004407373,0.0004684691,0.00004344137,0.00002240358,0.0011051,0.0000754986,0.02805885,0.005509861,0.8865793,0.07803175,0.00003379918],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.05015436,0.001981832,0.5684106,0.01034493,0.0008200154,0.0001922114,0.002121671,0.002048959,0.3639254],"genre_scores_gemma":[0.7166579,0.001968786,0.20936,0.003184052,0.0003152543,0.0003404235,0.001377078,0.000660513,0.06613596],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9773886,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"F. Bruce Shepherd","is_ca":false},{"name":"Adrian Vetta","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0391460099351738,"gpt":0.2882293159106371,"spread":0.2490833059754633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001883392,0.0009041043,0.0008425491,0.0006009457,0.001254154,0.002095855,0.001912328,0.001409557,0.009241736],"category_scores_gemma":[0.008018523,0.0004071712,0.001138192,0.001235594,0.001173472,0.004148416,0.001769622,0.002023789,0.001438769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001547001,"about_ca_system_score_gemma":0.001722197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001941609,"about_ca_topic_score_gemma":0.002348917,"domain_scores_codex":[0.9989001,0.000304109,0.00004961777,0.0003830414,0.0001678508,0.0001952506],"domain_scores_gemma":[0.9955778,0.002786733,0.0004035502,0.0005340382,0.0004056867,0.0002922852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002981617,0.0002837713,0.00166088,0.0006199569,0.0001134841,0.0003053762,0.0004107578,0.4920823,0.006071967,0.3442131,0.01688971,0.1370505],"study_design_scores_gemma":[0.00002261086,0.00009809804,0.0004626924,0.00003889015,0.00003420311,0.0002482373,0.0002593494,0.691061,0.005837542,0.2909517,0.01096812,0.00001765264],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.05679001,0.0004619364,0.9141019,0.001966084,0.0001192955,0.0002679721,0.0007088224,0.0005771394,0.0250068],"genre_scores_gemma":[0.6439959,0.001151514,0.3319261,0.00054207,0.0003031511,0.0003732087,0.001655524,0.0003101781,0.01974239],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9907582,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ryan O’Donnell","is_ca":false},{"name":"Tselil Schramm","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02864492533377073,"gpt":0.3065202544915342,"spread":0.2778753291577635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000392042,0.0003414646,0.000283465,0.0004019275,0.0005384145,0.0006609594,0.0005663526,0.0005716308,0.007603022],"category_scores_gemma":[0.003289787,0.000147488,0.0002400052,0.0003367077,0.000683487,0.00112424,0.0006677398,0.0007570436,0.00200625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000617143,"about_ca_system_score_gemma":0.0004811979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001210164,"about_ca_topic_score_gemma":0.002061276,"domain_scores_codex":[0.9996607,0.00008244899,0.000006481078,0.0001036301,0.00006825243,0.00007846523],"domain_scores_gemma":[0.9987148,0.0005924096,0.0001233566,0.0003298561,0.0001337381,0.0001058686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003285011,0.0001945653,0.005437164,0.0002291335,0.00006635204,0.0004788979,0.0001490265,0.04373947,0.01867789,0.8288433,0.03868388,0.06317179],"study_design_scores_gemma":[0.00006352633,0.0001626358,0.003041086,0.00004158545,0.00002850488,0.0006370381,0.0001203673,0.2536261,0.008440333,0.6719913,0.06181004,0.00003742388],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.2703469,0.001314473,0.5924855,0.01136177,0.0005472507,0.0003585301,0.004815175,0.002093496,0.1166769],"genre_scores_gemma":[0.8870776,0.0005943105,0.09591947,0.001208077,0.000113574,0.0001955885,0.001675067,0.0001312921,0.01308499],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.992397,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ashwin Nayak","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02331642237344679,"gpt":0.2248634183962579,"spread":0.2015469960228111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001127378,0.0006884548,0.0005337684,0.000557065,0.001344086,0.002107561,0.001843652,0.001406877,0.01417069],"category_scores_gemma":[0.003473578,0.000361108,0.0009453843,0.000641087,0.001882427,0.003588999,0.00289952,0.002425232,0.004956106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007449051,"about_ca_system_score_gemma":0.00142818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008092769,"about_ca_topic_score_gemma":0.001790972,"domain_scores_codex":[0.9989003,0.0002506819,0.00007920872,0.0002810808,0.000300843,0.0001880051],"domain_scores_gemma":[0.9990189,0.00037305,0.00005652444,0.0003652374,0.0001264952,0.0000597205],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005894322,0.0000700105,0.0001839761,0.00009501771,0.00002138262,0.00009132684,0.00010747,0.01426815,0.004170348,0.9100934,0.007402338,0.06343766],"study_design_scores_gemma":[0.00003333155,0.00006235432,0.00007544074,0.00004129453,0.00002875964,0.0002379543,0.00006545748,0.1247361,0.00884657,0.8291411,0.03670076,0.00003094488],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.003484672,0.00008713985,0.9801137,0.0005444511,0.0001867552,0.00005357156,0.0000454259,0.0003232535,0.01516098],"genre_scores_gemma":[0.1056543,0.0003017864,0.8785393,0.0006297342,0.0001114941,0.0002146312,0.0002165296,0.0002958348,0.01403632],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9858293,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Andrea Coladangelo","is_ca":false},{"name":"Alex B. Grilo","is_ca":false},{"name":"Stacey Jeffery","is_ca":false},{"name":"Thomas Vidick","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009970453124143758,"gpt":0.244478803283203,"spread":0.2345083501590592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001729341,0.000727663,0.0008871678,0.0009670085,0.001785461,0.00377823,0.002229463,0.002752326,0.0374499],"category_scores_gemma":[0.008857304,0.0004180514,0.0008250622,0.001040962,0.002788999,0.006344318,0.00387437,0.003021495,0.01676673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001536025,"about_ca_system_score_gemma":0.001960436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001301328,"about_ca_topic_score_gemma":0.001148977,"domain_scores_codex":[0.9967865,0.0005622974,0.0002015389,0.001133181,0.0009919716,0.0003246077],"domain_scores_gemma":[0.9952359,0.00128053,0.0003618369,0.001970556,0.0008651587,0.0002861064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002202519,0.00007906715,0.001221594,0.0004486441,0.0000555747,0.0002621381,0.0002800557,0.008524514,0.008555111,0.7958098,0.03364179,0.1509014],"study_design_scores_gemma":[0.00004290822,0.0001364346,0.001219886,0.0001720772,0.00004518753,0.0007449132,0.000238477,0.04795764,0.01375967,0.6764113,0.2591857,0.00008581018],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.02941995,0.006217262,0.7422082,0.01087274,0.00257611,0.0002960607,0.001937479,0.003039943,0.2034323],"genre_scores_gemma":[0.5853554,0.006389903,0.234484,0.004006926,0.002100245,0.0004764143,0.005510285,0.001024997,0.1606519],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9625501,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Kaave Hosseini","is_ca":false},{"name":"Hamed Hatami","is_ca":false},{"name":"Shachar Lovett","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0219599547056952,"gpt":0.2398138414644886,"spread":0.2178538867587934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002176636,0.0006391747,0.0007652919,0.001166882,0.001424036,0.003476208,0.001141565,0.001551609,0.006631205],"category_scores_gemma":[0.01724405,0.0003409515,0.00062906,0.001579815,0.005830777,0.009161768,0.003905929,0.004423991,0.001364316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001140734,"about_ca_system_score_gemma":0.001388494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000367853,"about_ca_topic_score_gemma":0.0003920141,"domain_scores_codex":[0.9956701,0.001159099,0.0002757096,0.0006894499,0.001704341,0.0005013655],"domain_scores_gemma":[0.9832886,0.008541809,0.001858084,0.003079623,0.00209459,0.001137347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009703802,0.0000328752,0.000565916,0.00006246023,0.000006953309,0.00005233092,0.0001511095,0.001774136,0.001699067,0.975921,0.00313796,0.01649916],"study_design_scores_gemma":[0.00001487387,0.00007000348,0.0004646238,0.0000266159,0.000007900546,0.0002955636,0.00009111899,0.01116159,0.002414439,0.9751136,0.01030573,0.00003380024],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.1448111,0.002732001,0.7377622,0.01632595,0.0008552168,0.0001574203,0.001310707,0.0006190424,0.0954264],"genre_scores_gemma":[0.9019286,0.00132317,0.08376203,0.001463481,0.001008009,0.0001903601,0.0007688195,0.0001671006,0.009388415],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9933688,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Alessandro Chiesa","is_ca":false},{"name":"Peter Manohar","is_ca":false},{"name":"Igor Shinkar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02683577031358914,"gpt":0.2276405655685452,"spread":0.2008047952549561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003719253,0.001103116,0.001637717,0.001543826,0.001182014,0.002024209,0.001966343,0.001484918,0.009303106],"category_scores_gemma":[0.05535461,0.0003896756,0.0009442276,0.001962571,0.002794104,0.005795365,0.00349249,0.002011524,0.002237997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001106867,"about_ca_system_score_gemma":0.0009276983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009540947,"about_ca_topic_score_gemma":0.001395756,"domain_scores_codex":[0.9945552,0.002101514,0.0002373031,0.001016756,0.001437771,0.0006513103],"domain_scores_gemma":[0.9382183,0.04637594,0.003056096,0.008994353,0.002153773,0.001201439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00311414,0.0006093492,0.1036005,0.0009654877,0.0003587672,0.0008161669,0.0005580346,0.04957528,0.01415519,0.5527824,0.02031375,0.253151],"study_design_scores_gemma":[0.0002755719,0.0009243383,0.02483291,0.0002020575,0.0001581479,0.002170954,0.0006970398,0.1979505,0.02543818,0.7283334,0.01884552,0.0001714564],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.506964,0.001683446,0.4320515,0.003238578,0.0002899721,0.0003777729,0.003801307,0.00152735,0.05006608],"genre_scores_gemma":[0.9745612,0.0003112825,0.01902903,0.0005450422,0.0001854761,0.0001239095,0.001214376,0.0001327876,0.003897032],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9906969,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ben Rossman","is_ca":false},{"name":"Srikanth Srinivasan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01417735764664866,"gpt":0.2334054208585872,"spread":0.2192280632119386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000717752,0.0008418402,0.0006543127,0.0007193725,0.000931588,0.001797799,0.001798905,0.001120368,0.03572525],"category_scores_gemma":[0.004213087,0.0004914948,0.001416566,0.0006957518,0.0009919986,0.004112415,0.003969533,0.002387936,0.009774507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001352915,"about_ca_system_score_gemma":0.001258298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001153847,"about_ca_topic_score_gemma":0.00187148,"domain_scores_codex":[0.9987231,0.0001885729,0.00008542578,0.0003200586,0.0004314012,0.0002514299],"domain_scores_gemma":[0.9980732,0.0004362893,0.0001048674,0.0008235148,0.0004259868,0.0001361403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002418608,0.0002331863,0.001063404,0.000453142,0.00007242979,0.0001611732,0.0001341183,0.007170455,0.02131961,0.6538161,0.06907737,0.2462573],"study_design_scores_gemma":[0.00008016347,0.0002702273,0.001162373,0.0001252077,0.0001457126,0.0009892847,0.00006802937,0.05393237,0.03428317,0.4932652,0.4156003,0.0000779739],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0189293,0.001505209,0.8263083,0.005812629,0.002469755,0.0002934415,0.001411779,0.004961138,0.1383086],"genre_scores_gemma":[0.3558193,0.002248975,0.5481995,0.008008023,0.001471522,0.0005637371,0.003789825,0.00151206,0.07838699],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9642748,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Thomas Watson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06171816415099145,"gpt":0.2740674192927928,"spread":0.2123492551418013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004214255,0.0008098874,0.001608788,0.0008130539,0.001793526,0.003061524,0.003282808,0.002940618,0.01198498],"category_scores_gemma":[0.02978705,0.000737865,0.002137144,0.001517758,0.002924262,0.008624562,0.003613717,0.004388428,0.001580519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002635604,"about_ca_system_score_gemma":0.002668645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002636027,"about_ca_topic_score_gemma":0.002847404,"domain_scores_codex":[0.9952829,0.001643351,0.0002142639,0.001597838,0.0007631694,0.0004984364],"domain_scores_gemma":[0.9676994,0.02493623,0.001600421,0.003396508,0.001365253,0.001002215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009000506,0.0002988754,0.005546907,0.0006284397,0.0001824321,0.0004563699,0.0005164944,0.1264599,0.00272327,0.7388518,0.02077548,0.10266],"study_design_scores_gemma":[0.00006433839,0.0001532661,0.0006879367,0.00004372726,0.00005498287,0.0003024649,0.0001638453,0.2029746,0.002896293,0.7851096,0.007513676,0.00003516538],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.058041,0.0005752665,0.9187752,0.007732842,0.0001780333,0.0002141527,0.001968925,0.0006865732,0.01182787],"genre_scores_gemma":[0.699451,0.0008415455,0.2760013,0.002938812,0.0007678408,0.0005203583,0.003531485,0.0004936766,0.01545392],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.988015,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Vetenskapsrådet; Kungliga Tekniska Högskolan; University of Toronto; European Commission","keywords":"Computer science; Mathematics","authors":[{"name":"Massimo Lauria","is_ca":false},{"name":"Mladen Mikša","is_ca":false},{"name":"Jakob Nordstr”öm","is_ca":false},{"name":"Marc Vinyals","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01453444679849714,"gpt":0.2638553625563085,"spread":0.2493209157578114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005443566,0.0008115171,0.001226711,0.002709455,0.00121257,0.004844235,0.002355044,0.001865287,0.0265795],"category_scores_gemma":[0.02707345,0.000894273,0.001162341,0.003597147,0.004069604,0.01171113,0.003709838,0.004473643,0.009776991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005372879,"about_ca_system_score_gemma":0.002078925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001427964,"about_ca_topic_score_gemma":0.001271777,"domain_scores_codex":[0.9928411,0.001374128,0.0004595594,0.002833353,0.002220921,0.0002708661],"domain_scores_gemma":[0.9632211,0.02468542,0.001611788,0.004704538,0.00474272,0.001034419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001690181,0.00004819585,0.0009704491,0.001167803,0.00005338422,0.00006073544,0.0002369836,0.0024206,0.001205907,0.7507728,0.03564925,0.2072447],"study_design_scores_gemma":[0.00002223388,0.00006489613,0.00103014,0.0004146945,0.00004037282,0.0004763465,0.0001565503,0.006644723,0.00184829,0.4965838,0.4926761,0.0000419112],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.01666987,0.220516,0.5050302,0.05247817,0.006223456,0.0001645166,0.002421878,0.001838881,0.1946571],"genre_scores_gemma":[0.3095758,0.1952838,0.3371334,0.02013297,0.01550121,0.0004489161,0.006293248,0.002071158,0.1135594],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9734205,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Zhengfeng Ji","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006912052154871736,"gpt":0.2191981759038802,"spread":0.2122861237490085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001538683,0.0006194028,0.0006098127,0.0004112759,0.001720642,0.002149108,0.00380056,0.001506388,0.02502219],"category_scores_gemma":[0.005097061,0.0004975729,0.0008129873,0.0005593616,0.003470676,0.005217279,0.004783825,0.002959481,0.004277705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001119792,"about_ca_system_score_gemma":0.001578433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001207761,"about_ca_topic_score_gemma":0.001891803,"domain_scores_codex":[0.9980945,0.0005192393,0.00008288835,0.0004830415,0.0005097049,0.0003105846],"domain_scores_gemma":[0.9959096,0.001620105,0.0002641623,0.00157162,0.0003015847,0.0003329708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002573011,0.0001529159,0.0004923252,0.0001975477,0.00004506746,0.0002130858,0.0003874495,0.009845437,0.01098209,0.9514888,0.003339928,0.02259801],"study_design_scores_gemma":[0.0001327691,0.0002395966,0.000404101,0.00006009588,0.00009583981,0.0003480019,0.0002349952,0.1936659,0.04920086,0.7137782,0.04170994,0.0001296628],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.02679537,0.0001669274,0.9349105,0.001481684,0.0001814296,0.0003342152,0.0003968334,0.001262234,0.0344707],"genre_scores_gemma":[0.68188,0.000293216,0.2933049,0.0005237334,0.0001078625,0.0006511965,0.0004860586,0.0003331639,0.02241985],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9749778,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Nicole Megow","is_ca":false},{"name":"Mary Wootters","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01940343232928668,"gpt":0.2592012130638414,"spread":0.2397977807345547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001292957,0.0005815213,0.001061057,0.00210729,0.003552436,0.005500688,0.00150543,0.001579126,0.02886408],"category_scores_gemma":[0.007434366,0.0004308186,0.0008979889,0.002020218,0.004832138,0.008558205,0.003157186,0.003232096,0.005545802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001368628,"about_ca_system_score_gemma":0.001370726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007085594,"about_ca_topic_score_gemma":0.0006753558,"domain_scores_codex":[0.9976451,0.0006710431,0.000110512,0.0006801012,0.0006532064,0.0002401154],"domain_scores_gemma":[0.997072,0.001136622,0.0001202366,0.0008096177,0.0005980195,0.0002634594],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001328371,0.00000501203,0.00008148533,0.00001850823,0.000003700838,0.00001752326,0.00007306193,0.00006984489,0.0001853856,0.9856512,0.003811543,0.01006942],"study_design_scores_gemma":[0.00001125984,0.00001103112,0.0001279391,0.00001663064,0.000007713746,0.0001128038,0.00006825067,0.001407423,0.0005334495,0.9675599,0.03013429,0.000009349348],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.03349064,0.003360847,0.4275889,0.01435142,0.002911629,0.0001829162,0.000857193,0.0007709261,0.5164855],"genre_scores_gemma":[0.6853359,0.002449995,0.07503947,0.003638052,0.003157749,0.0004008983,0.0008753603,0.0009714568,0.2281312],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9711359,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}