{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002586117,0.0001740565,0.0004063231,0.000189124,0.0001911092,0.000019971,0.0004539578,0.00005830068,0.00002341109],"category_scores_gemma":[0.002367985,0.0001672352,0.00009906424,0.0004741068,0.0001488887,0.00018585,0.0001098117,0.0002352595,0.000001496408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003842685,"about_ca_system_score_gemma":0.00003534556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.303733e-7,"about_ca_topic_score_gemma":1.656518e-7,"domain_scores_codex":[0.9977635,0.0004100126,0.0006338414,0.0002552506,0.0004916137,0.0004457709],"domain_scores_gemma":[0.9960346,0.002733673,0.0003329938,0.0004684133,0.0003214676,0.0001088068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001203119,0.0002119797,0.00007097495,0.00004024189,0.00002192388,0.000006616761,0.003529433,0.02830519,0.002516919,0.8173894,0.00001131916,0.1477758],"study_design_scores_gemma":[0.0007650985,0.0001896271,0.00127055,0.00009173111,0.000009682896,0.00001478288,0.0008345613,0.0684809,0.01222209,0.9159558,0.000003560387,0.00016165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3823706,0.00002886765,0.6161327,0.0001589128,0.00002345745,0.0001803825,6.121637e-7,0.0001513214,0.0009531329],"genre_scores_gemma":[0.6156945,0.000002514289,0.3840981,0.00008792955,0.0000486284,4.652337e-7,8.092049e-7,0.0000128072,0.00005426327],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2333239,"threshold_uncertainty_score":0.6819655,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002994253,0.0003193856,0.0004970244,0.0002684469,0.0004047862,0.0001219193,0.002649769,0.00007473755,0.000002809936],"category_scores_gemma":[0.0001460879,0.0002889414,0.0002218209,0.0007353156,0.0001918973,0.0004724647,0.001210748,0.0003674992,0.000005571668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003083855,"about_ca_system_score_gemma":0.00006888346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007491425,"about_ca_topic_score_gemma":0.000001342108,"domain_scores_codex":[0.9968225,0.0005012828,0.000794202,0.0006465638,0.0005053988,0.0007299975],"domain_scores_gemma":[0.99683,0.001294841,0.0004568062,0.001077613,0.0001597805,0.000180918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001191183,0.0000880843,0.0002436572,0.00001644803,0.00002394618,0.000004998654,0.007839154,0.1858216,0.002050123,0.2644493,0.000006075826,0.5394446],"study_design_scores_gemma":[0.0006606753,0.0001665546,0.006793378,0.0001113567,0.000006709543,0.00011137,0.000102535,0.9140917,0.01753628,0.059926,0.0001544627,0.0003389846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4938823,0.0001468361,0.5044581,0.0007722236,0.0001360688,0.00008140418,3.502255e-7,0.0003469806,0.0001757799],"genre_scores_gemma":[0.6826904,0.00000147483,0.3165155,0.0004661538,0.0003024524,6.591369e-7,4.253055e-7,0.00001251691,0.00001039075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7282701,"threshold_uncertainty_score":0.9999563,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002234987,0.0002212435,0.0003763126,0.0002458715,0.0003749601,0.0001124768,0.002147899,0.00005282154,0.000003005213],"category_scores_gemma":[0.00005583499,0.0002218756,0.0001981546,0.0008799383,0.000300404,0.0004862027,0.0008898583,0.0001923725,0.000002186516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001905085,"about_ca_system_score_gemma":0.00003922258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000924897,"about_ca_topic_score_gemma":0.000005493649,"domain_scores_codex":[0.9975355,0.0003764076,0.0006661053,0.0004726818,0.0004261897,0.0005231453],"domain_scores_gemma":[0.9973971,0.001160265,0.0003474664,0.0008771244,0.000150513,0.00006755713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000990234,0.0001183371,0.001230758,0.0000190441,0.00001241193,0.000009049694,0.0008789822,0.005524941,0.002028469,0.9128605,0.00001213982,0.07729544],"study_design_scores_gemma":[0.0004686467,0.00008695853,0.03968773,0.00005901033,0.000005042979,0.00003943812,0.0000946626,0.1439071,0.01418129,0.8011931,0.00003994316,0.0002370598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4417699,0.000111532,0.5563591,0.0001317033,0.0001873853,0.00007305925,5.444197e-7,0.0002548266,0.001112016],"genre_scores_gemma":[0.7879429,7.411631e-7,0.2117769,0.0001121251,0.0001411697,9.220727e-7,0.000001072282,0.000007392309,0.00001675516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.346173,"threshold_uncertainty_score":0.9047822,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002863002,0.0001709273,0.0002787914,0.0002038053,0.0003870803,0.000091591,0.002234714,0.00005183803,0.000006111606],"category_scores_gemma":[0.0001477031,0.0001627168,0.0001327778,0.0009446339,0.0005979726,0.0007130589,0.00114191,0.0001401352,0.000005643034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000780298,"about_ca_system_score_gemma":0.00003690498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001601058,"about_ca_topic_score_gemma":0.000004398711,"domain_scores_codex":[0.9979597,0.0003733689,0.0004556506,0.0004575292,0.000313871,0.0004398271],"domain_scores_gemma":[0.9974715,0.0007503068,0.000272863,0.001153331,0.0002360734,0.0001159025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003291906,0.00007143673,0.001414825,0.0000137851,0.00001991933,0.000002589828,0.009180604,0.00001634139,0.002652853,0.9085931,0.00001714154,0.07798452],"study_design_scores_gemma":[0.0005937858,0.0004353529,0.03256729,0.00008126636,0.000008139657,0.00003202088,0.0003844054,0.03268073,0.04549223,0.8873002,0.0001411916,0.0002834097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4739221,0.00004372312,0.5249979,0.00006430335,0.0002038017,0.00005577295,0.000001199443,0.0001716234,0.0005396024],"genre_scores_gemma":[0.8263651,0.000001371781,0.1731504,0.0002865744,0.0001896266,4.582639e-7,0.000001043677,0.000004932207,4.204392e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3524431,"threshold_uncertainty_score":0.6635398,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007409821,0.000143836,0.0003390479,0.0001026337,0.0001782579,0.00001221664,0.0003524481,0.00005115645,0.00001478205],"category_scores_gemma":[0.0006520988,0.0001302986,0.0001118521,0.0002540876,0.0001292974,0.000041588,0.0001346199,0.0001239794,0.00000184974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001508496,"about_ca_system_score_gemma":0.00001398378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002326729,"about_ca_topic_score_gemma":0.000002740118,"domain_scores_codex":[0.9983458,0.00007280448,0.0008111551,0.0001738552,0.0002546665,0.000341708],"domain_scores_gemma":[0.9931502,0.005647081,0.0004924281,0.0004952428,0.0001305729,0.00008445253],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002071165,0.0001924931,0.0001664177,0.0001571396,0.00002807378,0.000001297985,0.005422901,0.0000205714,0.009481146,0.9738282,0.00006577737,0.01061528],"study_design_scores_gemma":[0.0003075321,0.00003218522,0.001165095,0.0001134689,0.00002921135,0.00001371674,0.002317771,0.001051563,0.04203083,0.9527588,0.00004073879,0.0001390732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5210335,0.000009919438,0.4756133,0.00003036808,0.0000183175,0.0001419117,5.813121e-7,0.00007350621,0.003078564],"genre_scores_gemma":[0.7858804,4.412109e-7,0.2139485,0.00003769402,0.00006939326,0.00000117427,5.477947e-7,0.00001806286,0.00004384882],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2648469,"threshold_uncertainty_score":0.5313423,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001864698,0.0003226424,0.0005065853,0.0002532085,0.0003816414,0.0002317446,0.002712808,0.0000754457,0.00000909774],"category_scores_gemma":[0.0001704675,0.0002766314,0.000205194,0.0007766721,0.0002165649,0.0006136491,0.001373151,0.0003480461,0.00001587391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001818465,"about_ca_system_score_gemma":0.00005557305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007069053,"about_ca_topic_score_gemma":4.013876e-7,"domain_scores_codex":[0.9968123,0.0005563207,0.000763071,0.0006326332,0.0004733551,0.0007622504],"domain_scores_gemma":[0.9964043,0.001534958,0.0004544962,0.001122956,0.0002750637,0.000208183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005787655,0.0001081432,0.001041884,0.00004320243,0.00004430722,0.000006850449,0.009289677,0.04674164,0.007987564,0.3352449,0.00002376671,0.5994623],"study_design_scores_gemma":[0.0003985795,0.000160911,0.03085988,0.00009665648,0.000003913896,0.00006148702,0.0001724818,0.7132522,0.007164719,0.2475422,0.000009306224,0.000277655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5037176,0.00006996833,0.4949541,0.0004247605,0.0001864841,0.0001678902,1.841768e-7,0.0003204673,0.0001585101],"genre_scores_gemma":[0.7853494,9.628442e-7,0.2141033,0.0003966237,0.000119809,0.000003071145,4.813089e-7,0.00001439363,0.00001196121],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6665106,"threshold_uncertainty_score":0.9999686,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004401643,0.0002137957,0.0003624918,0.0002147283,0.0003476932,0.00006226054,0.001984305,0.00005371006,0.000005176398],"category_scores_gemma":[0.0001481218,0.0002075311,0.0001836848,0.0007710279,0.0002485085,0.001157687,0.001212742,0.00022045,0.000004676066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001944056,"about_ca_system_score_gemma":0.00002665162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009107299,"about_ca_topic_score_gemma":3.17208e-7,"domain_scores_codex":[0.9974366,0.00051027,0.0005368615,0.0002972402,0.0004073928,0.0008116148],"domain_scores_gemma":[0.9970782,0.001394025,0.0003089841,0.0008952204,0.0001075479,0.0002160008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008655316,0.0001492975,0.00529656,0.00002042463,0.00002452134,0.000001106271,0.009489251,0.0002801434,0.000967373,0.8290283,0.000004625688,0.1547297],"study_design_scores_gemma":[0.0008901054,0.0001877955,0.1439636,0.0001455156,0.00001849266,0.0001389476,0.0009780123,0.09245867,0.03266948,0.7277459,0.0001678265,0.0006356607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4510259,0.0002848426,0.547343,0.00008320751,0.0004432563,0.00006919655,3.58567e-7,0.0001958568,0.0005544663],"genre_scores_gemma":[0.7849762,0.000002010071,0.214584,0.0002176002,0.0002050198,0.000001031222,4.398199e-7,0.000007512942,0.00000616632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3339503,"threshold_uncertainty_score":0.8462874,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004774335,0.0003087231,0.0004784192,0.0002378449,0.0003931249,0.00007814326,0.002044379,0.00007545322,0.000002146711],"category_scores_gemma":[0.0001917449,0.0002717806,0.000208055,0.0007688453,0.0001794154,0.0006901228,0.00132199,0.000341918,0.000004249749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002258466,"about_ca_system_score_gemma":0.0000411728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008944017,"about_ca_topic_score_gemma":1.464517e-7,"domain_scores_codex":[0.996654,0.0006768659,0.0006683507,0.0004067991,0.0004843127,0.001109646],"domain_scores_gemma":[0.9965953,0.00155083,0.0004452607,0.0009886386,0.0001178218,0.000302192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001520077,0.00021061,0.00784445,0.00004242497,0.00004493826,0.000003322675,0.02416752,0.01799282,0.003212044,0.6284788,0.000006799628,0.317981],"study_design_scores_gemma":[0.0008880173,0.0002425043,0.1024743,0.0001956567,0.00001845632,0.000265419,0.0004441078,0.7712573,0.02756501,0.09586104,0.0001025109,0.0006856632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4996139,0.0003124189,0.4990096,0.0001239672,0.0004315823,0.00007745699,3.157323e-7,0.0002756169,0.0001550797],"genre_scores_gemma":[0.8006791,0.000001270277,0.1986486,0.0002710831,0.0003778992,8.622649e-7,5.452856e-7,0.0000149703,0.000005718887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7532645,"threshold_uncertainty_score":0.9999734,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01325177,0.0001677311,0.0004456278,0.0002471903,0.0003692685,0.0001770824,0.00190022,0.00005529675,0.0006241283],"category_scores_gemma":[0.003643833,0.000122905,0.0001827614,0.001049828,0.0005409225,0.0004722102,0.0004228762,0.000164453,0.0004508717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009635572,"about_ca_system_score_gemma":0.00002863121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001992981,"about_ca_topic_score_gemma":8.369404e-7,"domain_scores_codex":[0.9957396,0.001205915,0.001269533,0.0004709272,0.0009312498,0.0003827479],"domain_scores_gemma":[0.9838649,0.01336969,0.0007196426,0.001194769,0.0006884704,0.0001625484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002056474,0.0000727294,0.003865215,0.000002701296,0.00001194335,2.887519e-7,0.004145347,0.002464962,0.02323275,0.7268167,0.00009737539,0.2392694],"study_design_scores_gemma":[0.0002301629,0.00004458399,0.1002401,0.00001632297,0.000005830012,0.000007814114,0.006867289,0.004883419,0.01233194,0.8751789,0.00007028714,0.0001232948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7590806,0.00002780409,0.235501,0.0005973293,0.00007228821,0.0002719429,0.000001240636,0.00007219295,0.004375568],"genre_scores_gemma":[0.9934006,4.271745e-7,0.005827781,0.0003512388,0.000081768,0.000009904106,6.535825e-7,0.0000103425,0.0003172936],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2391461,"threshold_uncertainty_score":0.6833767,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002644629,0.0003199814,0.0005285808,0.0002703065,0.0003947766,0.0001317683,0.002597813,0.00007456071,0.000001011663],"category_scores_gemma":[0.0001599738,0.000286285,0.0002240855,0.0008931937,0.0001272115,0.0003470083,0.0004930022,0.0003568964,0.000001640818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001919351,"about_ca_system_score_gemma":0.0000609067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004341758,"about_ca_topic_score_gemma":1.714053e-7,"domain_scores_codex":[0.9969364,0.0004843523,0.0007290915,0.0006410704,0.0004934127,0.0007156198],"domain_scores_gemma":[0.997225,0.0009207086,0.0004429537,0.001077659,0.0001571737,0.0001764937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001669868,0.0001012322,0.0001204763,0.000009427778,0.00001377152,0.00001546151,0.00570766,0.04885608,0.004303911,0.4283618,0.000004216323,0.5124893],"study_design_scores_gemma":[0.0005118769,0.0004833289,0.02859583,0.0001159273,0.000005358049,0.00009638612,0.00007299863,0.6068652,0.009866159,0.3530885,0.00001255721,0.0002858646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4902655,0.0001075399,0.5081469,0.0006902018,0.0001438197,0.00008362542,2.315122e-7,0.0003644043,0.0001978651],"genre_scores_gemma":[0.7989855,0.000001438346,0.1999931,0.0008609782,0.0001450102,2.46037e-7,5.104494e-7,0.000007589305,0.000005632227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5580091,"threshold_uncertainty_score":0.9999589,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005078183,0.0003011897,0.0005164943,0.0002542122,0.0002251132,0.0001291481,0.002628555,0.00007299872,4.944966e-7],"category_scores_gemma":[0.0004243367,0.0002667946,0.0001648628,0.000891024,0.0002077689,0.0003779797,0.001513957,0.0003255919,0.000003522927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003419414,"about_ca_system_score_gemma":0.0001796269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002157833,"about_ca_topic_score_gemma":6.415112e-7,"domain_scores_codex":[0.9966281,0.0007341326,0.0007019128,0.0006031996,0.0006698263,0.0006628343],"domain_scores_gemma":[0.9967455,0.001010061,0.0004486084,0.001077632,0.0003434306,0.0003747243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004097514,0.0001275631,0.001107501,0.00002698705,0.00004154104,0.00003141678,0.02691407,0.2055632,0.0008251925,0.4797151,0.00002751804,0.2855789],"study_design_scores_gemma":[0.000906595,0.0003236465,0.00293362,0.0000899057,0.000005924475,0.0001300679,0.0004286836,0.7351474,0.004885744,0.2548149,0.00004505844,0.0002884722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4905453,0.0001360358,0.5080619,0.0002789263,0.0003335782,0.00008063352,3.178652e-7,0.0003309422,0.0002324298],"genre_scores_gemma":[0.7768318,5.133751e-7,0.2227149,0.0002630287,0.0001664516,6.937603e-7,6.125102e-7,0.0000134218,0.000008541797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5295842,"threshold_uncertainty_score":0.9999784,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00361185,0.0003131876,0.0004722897,0.0002626815,0.0004542756,0.0001495768,0.003145332,0.0001103069,0.000003570269],"category_scores_gemma":[0.0003286909,0.0002777976,0.0002136804,0.0007502226,0.0003126393,0.0003283146,0.001321309,0.0008975555,0.000002728866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006746125,"about_ca_system_score_gemma":0.00008644105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001518074,"about_ca_topic_score_gemma":0.000003564715,"domain_scores_codex":[0.9971376,0.0003383186,0.0006904103,0.0006608444,0.0004788673,0.0006939791],"domain_scores_gemma":[0.9960885,0.001664723,0.0004555213,0.001385122,0.0001994913,0.0002066559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001203823,0.00009092058,0.0009805249,0.00002317284,0.00002372435,0.00001288756,0.006215272,0.01120774,0.05727816,0.5917723,0.000003214554,0.3323801],"study_design_scores_gemma":[0.0005455764,0.0001518784,0.02055489,0.00005597787,0.000006118547,0.0001834793,0.00008016779,0.7296237,0.03361008,0.2147958,0.00004911154,0.0003432177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5139982,0.00001927194,0.4844962,0.0002623118,0.0006515784,0.00008294234,4.083239e-7,0.000332226,0.0001568015],"genre_scores_gemma":[0.7255169,3.91011e-7,0.2740263,0.0002082956,0.0002275099,7.361725e-7,4.836789e-7,0.00001372105,0.000005675707],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7184159,"threshold_uncertainty_score":0.9999674,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002513807,0.0001756126,0.0002897516,0.0002052433,0.0002114582,0.00003900771,0.002331513,0.00005194967,0.000008409],"category_scores_gemma":[0.00008592779,0.0001673838,0.0001612153,0.0007044252,0.00023866,0.0007963111,0.001004227,0.0001668896,0.000002402433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005906892,"about_ca_system_score_gemma":0.00002884846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004186566,"about_ca_topic_score_gemma":0.000002480185,"domain_scores_codex":[0.9980654,0.0003682018,0.0004784044,0.0004194195,0.0002587511,0.0004098353],"domain_scores_gemma":[0.9978964,0.0004789644,0.0002926044,0.001099167,0.0001112679,0.0001216443],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003772666,0.0001418882,0.003660944,0.00001913595,0.00002398206,0.000008036403,0.02713306,0.00001329891,0.000714602,0.9149528,0.000003501486,0.05329098],"study_design_scores_gemma":[0.0004325393,0.0001833032,0.08251051,0.00005284655,0.000008578004,0.00002782703,0.0005856549,0.006751155,0.02677409,0.8824239,0.00001317535,0.0002363755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4609686,0.00006734686,0.5373709,0.00001124637,0.0001255312,0.00005993227,0.000001060923,0.0001744574,0.001220899],"genre_scores_gemma":[0.744587,0.000002281398,0.2552563,0.000121993,0.00002630046,6.364801e-7,7.680687e-7,0.000004531559,2.384487e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2836184,"threshold_uncertainty_score":0.6825715,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005078183,0.0003011897,0.0005164943,0.0002542122,0.0002251132,0.0001291481,0.002628555,0.00007299872,4.944966e-7],"category_scores_gemma":[0.0004243367,0.0002667946,0.0001648628,0.000891024,0.0002077689,0.0003779797,0.001513957,0.0003255919,0.000003522927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003419414,"about_ca_system_score_gemma":0.0001796269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002157833,"about_ca_topic_score_gemma":6.415112e-7,"domain_scores_codex":[0.9966281,0.0007341326,0.0007019128,0.0006031996,0.0006698263,0.0006628343],"domain_scores_gemma":[0.9967455,0.001010061,0.0004486084,0.001077632,0.0003434306,0.0003747243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004097514,0.0001275631,0.001107501,0.00002698705,0.00004154104,0.00003141678,0.02691407,0.2055632,0.0008251925,0.4797151,0.00002751804,0.2855789],"study_design_scores_gemma":[0.000906595,0.0003236465,0.00293362,0.0000899057,0.000005924475,0.0001300679,0.0004286836,0.7351474,0.004885744,0.2548149,0.00004505844,0.0002884722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4905453,0.0001360358,0.5080619,0.0002789263,0.0003335782,0.00008063352,3.178652e-7,0.0003309422,0.0002324298],"genre_scores_gemma":[0.7768318,5.133751e-7,0.2227149,0.0002630287,0.0001664516,6.937603e-7,6.125102e-7,0.0000134218,0.000008541797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5295842,"threshold_uncertainty_score":0.9999784,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002908897,0.0003004644,0.0004724652,0.0002451237,0.000304108,0.00006804696,0.002598698,0.00006988713,0.000002991585],"category_scores_gemma":[0.0003134921,0.0001847208,0.0002108696,0.0005915593,0.0002857735,0.0004050883,0.001309306,0.0001587804,0.000004748299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002691379,"about_ca_system_score_gemma":0.00006945133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005562073,"about_ca_topic_score_gemma":4.320983e-7,"domain_scores_codex":[0.9968143,0.0006019229,0.0007062846,0.0006799301,0.0004753229,0.0007222234],"domain_scores_gemma":[0.9950693,0.002953969,0.0004608235,0.001163262,0.000175884,0.0001767658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001777891,0.00005017519,0.0008364149,0.00001475243,0.00002653564,0.00001066189,0.002568818,0.002325465,0.02119504,0.3785842,0.000004321988,0.5943658],"study_design_scores_gemma":[0.002063278,0.0005115743,0.03148229,0.0007563701,0.00001147357,0.0001944857,0.0001011089,0.3041096,0.08283204,0.5771609,0.00008114448,0.0006957167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4874739,0.00005431469,0.5109693,0.0008231807,0.0002164485,0.00007175683,6.845062e-7,0.0003155674,0.00007486089],"genre_scores_gemma":[0.869123,0.000002700517,0.130467,0.0002165935,0.0001545198,9.12192e-7,1.321699e-7,0.00001527301,0.00001991422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5936701,"threshold_uncertainty_score":0.7532696,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003320808,0.0002169364,0.0003579607,0.0002375641,0.0004028995,0.0001201405,0.003067162,0.00007923182,0.000008583661],"category_scores_gemma":[0.0002571978,0.00021219,0.0001887597,0.0007521986,0.0004360728,0.0005437253,0.001212338,0.0005877317,0.000002976894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005750886,"about_ca_system_score_gemma":0.00005643841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001560069,"about_ca_topic_score_gemma":0.000007949772,"domain_scores_codex":[0.9977991,0.0002530733,0.0005547248,0.0004850421,0.0004028883,0.000505178],"domain_scores_gemma":[0.9965962,0.001498382,0.0003162331,0.001258772,0.0001833076,0.0001471582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008156063,0.00007630105,0.0007716707,0.00001320146,0.00001531558,0.000005192231,0.002871975,0.0002065585,0.02185524,0.7762758,0.000002607774,0.197898],"study_design_scores_gemma":[0.0004900583,0.0001058489,0.02560383,0.00003711264,0.000005441742,0.00008606546,0.0001568569,0.1475608,0.03636756,0.7892302,0.00007171615,0.0002844845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4976472,0.00001589438,0.5007268,0.0001668253,0.0006322138,0.00006945472,4.354391e-7,0.0002216027,0.0005195396],"genre_scores_gemma":[0.7083189,6.118554e-7,0.2913764,0.000167431,0.0001223138,8.752845e-7,3.884194e-7,0.000006861101,0.00000611102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2106717,"threshold_uncertainty_score":0.8652857,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003552544,0.0001366817,0.0004635257,0.00005369862,0.00005378663,0.00001215137,0.0002901538,0.0000472365,0.0001344991],"category_scores_gemma":[0.003339501,0.0001143469,0.00008112837,0.0001421877,0.0001135442,0.00004210229,0.000156548,0.0001542034,0.000008508114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001069823,"about_ca_system_score_gemma":0.00001987283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003833209,"about_ca_topic_score_gemma":1.47643e-7,"domain_scores_codex":[0.9981705,0.0005797883,0.0005265269,0.0002090782,0.0002296421,0.0002844927],"domain_scores_gemma":[0.983771,0.01538189,0.0002821136,0.0003862132,0.0001164222,0.0000623212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005613573,0.00005305067,0.00366554,0.0001780148,0.0000217404,9.384689e-7,0.001717438,0.00003685815,0.005586267,0.9346825,0.000003345423,0.05399811],"study_design_scores_gemma":[0.0004274126,0.0001692575,0.01214723,0.0002048229,0.00001783863,0.000005272935,0.0007863259,0.007738969,0.008590828,0.969771,0.000002919902,0.0001381292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5403888,0.000008697276,0.4566219,0.00001429338,0.00008859847,0.0001124028,0.000001239471,0.00004298984,0.002721179],"genre_scores_gemma":[0.6165235,2.728534e-7,0.3833637,0.0000488935,0.00002589897,3.974578e-7,1.641035e-7,0.000009889483,0.00002730259],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07613474,"threshold_uncertainty_score":0.4662932,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008451181,0.0001310348,0.0002144541,0.00009679584,0.0002127291,0.0001225001,0.00166057,0.00003409405,0.00001256402],"category_scores_gemma":[0.00004496616,0.0001225887,0.00009118926,0.0004639254,0.000112375,0.0005654164,0.0006417201,0.0001008694,0.0000409669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001107105,"about_ca_system_score_gemma":0.00002723184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000395422,"about_ca_topic_score_gemma":3.406802e-7,"domain_scores_codex":[0.998565,0.00016863,0.0004148731,0.0003175468,0.0002148105,0.0003191513],"domain_scores_gemma":[0.9980142,0.0006154338,0.0002242494,0.0009123406,0.0001364357,0.00009739755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[7.059681e-7,0.00005512394,0.0003518294,0.00001137595,0.00001053831,5.57749e-7,0.002232714,0.0005365803,0.04093414,0.7916653,0.00002069478,0.1641805],"study_design_scores_gemma":[0.0003194539,0.00004768635,0.05518264,0.00003566736,0.0000050679,0.00002418962,0.0002985419,0.4188136,0.05172994,0.4732783,0.00004513102,0.0002197833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4820429,0.00003435474,0.5167243,0.0003113939,0.00003526626,0.0001451776,1.269274e-7,0.0002024536,0.0005040131],"genre_scores_gemma":[0.8924173,8.312588e-7,0.1073104,0.0002009818,0.0000311636,0.000008806793,9.579063e-7,0.000006377172,0.00002318963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.418277,"threshold_uncertainty_score":0.4999022,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002911024,0.0001891208,0.0004190946,0.00008108163,0.0001019849,0.00003322411,0.0004047767,0.00002561161,0.00001389827],"category_scores_gemma":[0.00003652086,0.0001800143,0.0001225821,0.0001974066,0.0001414341,0.0001497004,0.000200225,0.000142373,0.0000149218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001794977,"about_ca_system_score_gemma":0.00007906285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001724029,"about_ca_topic_score_gemma":3.494545e-7,"domain_scores_codex":[0.9980761,0.0004619587,0.0005544935,0.0002430086,0.00029125,0.0003732185],"domain_scores_gemma":[0.9983751,0.0004258225,0.0004227006,0.0004108179,0.000189936,0.0001756222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005771018,0.00008655594,0.0838595,0.00001919938,0.00007951158,0.000001122301,0.009033212,0.004082284,0.001235078,0.8890446,0.00004300644,0.01245819],"study_design_scores_gemma":[0.003537654,0.0003131408,0.0172557,0.0003201644,0.00006831875,0.000007734035,0.04082831,0.1075003,0.02010743,0.809167,0.0002178009,0.000676503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8143977,0.0000388894,0.178071,0.00003248067,0.0002907475,0.000155933,0.000002789597,0.00006536471,0.006945073],"genre_scores_gemma":[0.9981769,1.715527e-8,0.001049929,0.00002186293,0.0006714757,0.000002096464,0.000005258979,0.00002319557,0.0000492814],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1837792,"threshold_uncertainty_score":0.7340769,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00291548,0.0002107037,0.0003555226,0.0002429629,0.000551288,0.0001019036,0.002743072,0.00005337318,0.000008792796],"category_scores_gemma":[0.0001703044,0.0002059503,0.0001575802,0.001012028,0.0008683466,0.0005193312,0.001400312,0.0001781237,0.000008133802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000158184,"about_ca_system_score_gemma":0.00005116627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001460185,"about_ca_topic_score_gemma":0.000002960202,"domain_scores_codex":[0.9975611,0.0004243533,0.000561372,0.0005095205,0.0004048977,0.0005387873],"domain_scores_gemma":[0.9971114,0.001028168,0.0003164475,0.001095616,0.0003269618,0.000121412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000184748,0.00006362551,0.0004394774,0.00001241096,0.00002346413,0.000003537868,0.006725213,0.00008038514,0.001739179,0.7826298,0.000008462744,0.2082559],"study_design_scores_gemma":[0.0005029091,0.0004443548,0.01500538,0.0000987941,0.000006084332,0.00004893999,0.0002807065,0.1856836,0.03787972,0.7596957,0.00007924442,0.0002745752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4383483,0.00003949392,0.5597547,0.0001407154,0.0003830173,0.0000699212,3.885794e-7,0.0002358385,0.001027722],"genre_scores_gemma":[0.7589562,9.507604e-7,0.240438,0.000319439,0.000268119,6.410688e-7,2.825101e-7,0.00000700285,0.000009370016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3206079,"threshold_uncertainty_score":0.8398409,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004838035,0.0002632325,0.0004535989,0.0003274636,0.001570294,0.00007836512,0.003717666,0.00002548204,0.00001045978],"category_scores_gemma":[0.00009445431,0.000270117,0.0002264794,0.001257801,0.0001391297,0.0001953483,0.005215824,0.0006285315,6.972823e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005159619,"about_ca_system_score_gemma":0.0001063376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001707562,"about_ca_topic_score_gemma":2.36801e-7,"domain_scores_codex":[0.9957128,0.001444592,0.0006856261,0.0006704191,0.0008226805,0.0006639296],"domain_scores_gemma":[0.996784,0.001403957,0.0005279079,0.001069151,0.0000883984,0.0001266012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002536797,0.0001266836,0.0003943779,0.00001601652,0.00002886185,0.00002691683,0.01268839,0.4616346,0.001738122,0.345545,0.000009713724,0.1777659],"study_design_scores_gemma":[0.000618002,0.0004572922,0.004351058,0.00002143435,0.000005933466,0.0002670735,0.0006897689,0.8308975,0.002212883,0.1600413,0.0001294433,0.0003083258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5089544,0.0001173524,0.4897392,0.0003336504,0.0003612393,0.000102326,0.00000153865,0.0002933675,0.00009694968],"genre_scores_gemma":[0.9075083,4.972258e-7,0.0918052,0.0005543466,0.00009434019,0.000004815241,0.000001535316,0.00001710763,0.00001386583],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3985539,"threshold_uncertainty_score":0.9999751,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002863375,0.0001735091,0.0003520438,0.0001458255,0.0001307289,0.00007447047,0.001693467,0.00004341591,0.0000104796],"category_scores_gemma":[0.0001063846,0.0001569786,0.0001230416,0.000441962,0.00005931919,0.000334716,0.000723797,0.0002747095,0.00002765848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001204653,"about_ca_system_score_gemma":0.00003679632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000171658,"about_ca_topic_score_gemma":1.420128e-7,"domain_scores_codex":[0.9978985,0.0005020011,0.0004105151,0.0004346691,0.0003494567,0.0004048529],"domain_scores_gemma":[0.9976211,0.001041548,0.0003113085,0.0008511809,0.00009135706,0.00008353419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001427523,0.00005152602,0.01423131,0.00004761913,0.00002387506,0.000004051255,0.005450391,0.02836448,0.003706849,0.696437,0.000002587055,0.251666],"study_design_scores_gemma":[0.0008421378,0.0002856356,0.04427939,0.0001309269,0.000004330605,0.00003786316,0.000280219,0.8644394,0.005903226,0.08344388,0.00006091296,0.0002920867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5127189,0.00003964366,0.4854419,0.0001411346,0.0002694591,0.00007301553,9.931803e-8,0.0001921647,0.001123768],"genre_scores_gemma":[0.9059152,6.379507e-7,0.09365368,0.0002246655,0.00007378549,3.896058e-7,4.752016e-7,0.000009232298,0.0001219099],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8360749,"threshold_uncertainty_score":0.6401402,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001282158,0.0001429022,0.0002488403,0.0001356704,0.0001188491,0.00001607862,0.0007085059,0.00006305183,0.0000117496],"category_scores_gemma":[0.0000710895,0.0001605138,0.00005823548,0.000268393,0.0003771977,0.0001351365,0.0002091556,0.0001737822,0.000004308542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002625445,"about_ca_system_score_gemma":0.000007070789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004632805,"about_ca_topic_score_gemma":0.00000303263,"domain_scores_codex":[0.9988936,0.0001710844,0.0004297991,0.0001136151,0.0001453279,0.0002466034],"domain_scores_gemma":[0.9985068,0.0004754695,0.00008567196,0.0007293257,0.0001536488,0.00004910154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005752896,0.00007792855,0.001831984,0.0001970589,0.0001305952,0.000001379427,0.03471163,0.006326866,0.1947011,0.5435378,0.0001280381,0.2182981],"study_design_scores_gemma":[0.00029957,0.0001170275,0.008083776,0.0002259767,0.00001157289,0.00001121831,0.0007683408,0.1466337,0.7545908,0.08871866,0.0002311247,0.0003082577],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6692451,0.0001290376,0.3259402,0.00001860302,0.00006398289,0.0000797684,6.986828e-7,0.001308457,0.003214198],"genre_scores_gemma":[0.9668391,0.00001386958,0.03294847,0.00004849221,0.0001120987,0.000002063138,0.000001437096,0.00003267833,0.000001783088],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5598897,"threshold_uncertainty_score":0.6545564,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003168917,0.0002124359,0.0004086012,0.000144634,0.002151103,0.0005187141,0.00702417,0.00005447683,0.00000275629],"category_scores_gemma":[0.0004634559,0.0002092444,0.0002045045,0.0001427191,0.0006863706,0.001145215,0.003063279,0.0002290576,0.000002509763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001325206,"about_ca_system_score_gemma":0.00004612744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004122144,"about_ca_topic_score_gemma":0.000003629274,"domain_scores_codex":[0.997852,0.0002662514,0.000496451,0.0004948903,0.0003969876,0.0004933674],"domain_scores_gemma":[0.9951771,0.000800454,0.0008143925,0.002920229,0.0001649987,0.0001227874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001116476,0.00005249522,0.002082599,0.00001742685,0.00002354897,0.00001037272,0.002300556,0.000262464,0.0006856754,0.7343217,0.000002784193,0.2602293],"study_design_scores_gemma":[0.0006015259,0.0001058591,0.1322011,0.0001206775,0.000006160836,0.00003222588,0.0001305875,0.1283424,0.01006451,0.7281151,0.00002854089,0.0002514354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4406852,0.00004423339,0.5569849,0.0003671082,0.0003880299,0.00007362053,5.414479e-7,0.0001393813,0.001316992],"genre_scores_gemma":[0.8365819,0.000002704348,0.1631582,0.0001222474,0.0001115842,8.760542e-7,2.391954e-7,0.000007136958,0.00001502464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3958968,"threshold_uncertainty_score":0.999148,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004157742,0.0002297868,0.0004713247,0.0002315839,0.00034923,0.0001118545,0.002382088,0.00006395461,0.000009392432],"category_scores_gemma":[0.0009927249,0.0002381549,0.0002085958,0.001829989,0.0003524154,0.0007511166,0.002300099,0.0003585185,0.000005170542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003407467,"about_ca_system_score_gemma":0.0002080276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000178957,"about_ca_topic_score_gemma":0.000001158872,"domain_scores_codex":[0.995554,0.001617601,0.0006318334,0.0007360277,0.0006883417,0.0007722265],"domain_scores_gemma":[0.9939845,0.003190026,0.0002730997,0.001689467,0.0006666546,0.000196215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003146598,0.000100774,0.001115562,0.00003722613,0.00003870424,0.0001088632,0.003009904,0.003987648,0.04274538,0.8582897,0.00000193825,0.09053286],"study_design_scores_gemma":[0.0005827637,0.00008284944,0.006193934,0.00008599747,0.000004193948,0.0001449486,0.0006723196,0.02412989,0.2199514,0.7479044,0.00002312334,0.0002242391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4478458,0.0003128628,0.5506015,0.0002290671,0.0001205284,0.00007025663,5.016909e-7,0.0001707117,0.000648763],"genre_scores_gemma":[0.8036807,0.000007315504,0.1959623,0.0002315259,0.00004674333,0.000001641364,0.000001056717,0.00001402277,0.00005472887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3558349,"threshold_uncertainty_score":0.9711674,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002793173,0.0003124732,0.0004872321,0.0002702085,0.0003420535,0.00005494975,0.002935171,0.00007515452,0.000004972746],"category_scores_gemma":[0.0001288617,0.0002773084,0.0002163322,0.0007581153,0.0002510367,0.0003498847,0.001342598,0.0003282753,0.000003140761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000140861,"about_ca_system_score_gemma":0.00006158232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003623819,"about_ca_topic_score_gemma":7.594268e-7,"domain_scores_codex":[0.9969856,0.0005563237,0.0007328911,0.0006367366,0.0003987378,0.0006897404],"domain_scores_gemma":[0.9972757,0.0007372362,0.000488305,0.001151152,0.0001685545,0.0001790332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003538677,0.0001712147,0.001615285,0.00003451432,0.00004971213,0.00003092864,0.04779815,0.004153871,0.001517736,0.6457277,0.000002460405,0.2988631],"study_design_scores_gemma":[0.0006127246,0.0004009361,0.04600892,0.0001449243,0.0000107496,0.0001366773,0.0003246133,0.5474607,0.03115196,0.3733261,0.000007847319,0.0004138468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4918884,0.00006582377,0.5067546,0.00003635975,0.0002249101,0.00008158597,2.945853e-7,0.0003266261,0.0006213798],"genre_scores_gemma":[0.6920776,9.832673e-7,0.3076641,0.0001688783,0.00006984307,7.365607e-7,2.576952e-7,0.0000127112,0.000004881927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5433068,"threshold_uncertainty_score":0.9999679,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003287161,0.0003076864,0.0004206319,0.0004031726,0.0002805185,0.0003956501,0.002054865,0.00007224324,0.00000236016],"category_scores_gemma":[0.0001087087,0.000260137,0.0002682607,0.001284318,0.0001857366,0.0004351179,0.001085214,0.000454773,0.000006196558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002548727,"about_ca_system_score_gemma":0.0001181225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009600818,"about_ca_topic_score_gemma":3.437677e-7,"domain_scores_codex":[0.9970139,0.00044922,0.0006625784,0.0007740043,0.0004735485,0.0006267551],"domain_scores_gemma":[0.9964746,0.002303493,0.0001420846,0.0008426413,0.00009511413,0.0001420592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005435421,0.00002744297,0.00004546812,0.0001162981,0.00004566673,0.0000592476,0.008957499,0.03366191,0.002235001,0.5353284,0.00001016903,0.4195074],"study_design_scores_gemma":[0.0001484387,0.0001362319,0.001265744,0.000477779,0.000008622805,0.0001755288,0.00008399295,0.7627841,0.005759247,0.2288103,0.0001094868,0.0002404881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.460563,0.001004813,0.5361586,0.0004437093,0.0006644566,0.00007947725,7.012512e-7,0.0009279157,0.0001573018],"genre_scores_gemma":[0.8766198,0.000003907633,0.1228938,0.0001717702,0.0002695372,0.000001003768,7.337886e-7,0.00002140328,0.00001805196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7291222,"threshold_uncertainty_score":0.9999851,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004447948,0.0001818555,0.0003435264,0.000297797,0.001406391,0.00006275986,0.003621562,0.0000178108,0.00002598205],"category_scores_gemma":[0.0000734505,0.0002065468,0.0002011512,0.001296554,0.0001906005,0.0003200929,0.004891952,0.0004097637,7.352941e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000452919,"about_ca_system_score_gemma":0.00007011027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001745335,"about_ca_topic_score_gemma":5.143619e-7,"domain_scores_codex":[0.9966741,0.001100782,0.0005514801,0.0004938666,0.0006981072,0.0004817146],"domain_scores_gemma":[0.9972322,0.001270512,0.0003637007,0.0009646475,0.0000796626,0.00008927779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000227035,0.0001398189,0.000401538,0.00001212294,0.00002485446,0.00001489711,0.007850339,0.02373123,0.0008103521,0.834599,0.00001049906,0.1323827],"study_design_scores_gemma":[0.000578666,0.0003363678,0.005529802,0.00001472189,0.000005551722,0.0001316006,0.001488417,0.2863234,0.002402053,0.7027217,0.000200626,0.0002670817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4379793,0.000110117,0.5606174,0.0002380921,0.000383898,0.00009488453,0.000001863094,0.0002182668,0.0003560911],"genre_scores_gemma":[0.898899,8.048049e-7,0.10056,0.0004584671,0.00005055041,0.000005980109,0.000001293165,0.000008691906,0.00001518851],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4609197,"threshold_uncertainty_score":0.9998937,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002015361,0.0002157114,0.0003928941,0.0001177576,0.0002510773,0.0000867828,0.002478513,0.00004845512,0.000005327919],"category_scores_gemma":[0.0002599152,0.0002126353,0.0002404561,0.001198137,0.0001975042,0.0004777522,0.001001948,0.0002223296,0.000004319783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006178719,"about_ca_system_score_gemma":0.00003489755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001378867,"about_ca_topic_score_gemma":9.676861e-8,"domain_scores_codex":[0.9975623,0.0006448712,0.0005290497,0.0005179854,0.0003259846,0.000419847],"domain_scores_gemma":[0.997588,0.001151456,0.0003074443,0.0006074823,0.000106784,0.0002387971],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008080096,0.00003908099,0.0008849709,0.00003856987,0.00003487525,0.000008367764,0.01704444,0.001680425,0.009081002,0.8725827,0.000006936096,0.09851778],"study_design_scores_gemma":[0.001102649,0.0007806713,0.007030244,0.0001034363,0.00002069177,0.00002256827,0.001063033,0.1363569,0.04728568,0.8056176,0.0001087483,0.0005077276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4508361,0.00007829149,0.5472059,0.0009509284,0.00007781632,0.00007238035,3.329412e-7,0.0003544142,0.0004239447],"genre_scores_gemma":[0.9386992,0.000001671687,0.05894615,0.002227744,0.0001130233,8.673736e-7,3.696931e-7,0.00001006148,8.866793e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4882597,"threshold_uncertainty_score":0.8671016,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002597369,0.0002124013,0.0004348448,0.0002323256,0.0001807681,0.00009066142,0.002613372,0.00005432859,0.000013992],"category_scores_gemma":[0.00006978578,0.0002086208,0.0002015715,0.000795187,0.0001592648,0.0005884005,0.001279371,0.0002352427,0.00001814206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001742023,"about_ca_system_score_gemma":0.00004767169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001100452,"about_ca_topic_score_gemma":5.655185e-7,"domain_scores_codex":[0.9976003,0.0003863055,0.0005481492,0.0005270924,0.0004405741,0.0004975434],"domain_scores_gemma":[0.9968008,0.001421698,0.0003247612,0.001213927,0.0001405417,0.00009822909],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001654909,0.00006810852,0.003507061,0.00004050619,0.00002693463,0.000003296376,0.003652737,0.002823463,0.002912821,0.8760623,0.000002266392,0.1108839],"study_design_scores_gemma":[0.0008423936,0.0002618485,0.03210676,0.00014601,0.000005224838,0.00004114,0.0004203642,0.2986526,0.01253524,0.6546026,0.00004983277,0.0003359631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5087534,0.0000598589,0.4894192,0.00009737119,0.0003657465,0.0001229297,3.502418e-7,0.0001809153,0.001000255],"genre_scores_gemma":[0.8660485,0.000001523806,0.1336024,0.0002562361,0.00005162003,6.829745e-7,5.348529e-7,0.000008351996,0.00003015649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3572952,"threshold_uncertainty_score":0.8507311,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004707155,0.0002084933,0.0003919576,0.0002297112,0.0001977094,0.0001034338,0.002557541,0.00005191923,0.000001163673],"category_scores_gemma":[0.0003326391,0.0002036438,0.0001448574,0.000896598,0.0002881207,0.000627015,0.001391221,0.0002097297,0.000003850013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002969872,"about_ca_system_score_gemma":0.000118459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002210496,"about_ca_topic_score_gemma":0.000001403109,"domain_scores_codex":[0.9973903,0.0005542217,0.0005641436,0.0004422568,0.0005668857,0.0004822371],"domain_scores_gemma":[0.9972227,0.0009022918,0.0003112035,0.0009766058,0.0003189677,0.0002682947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000227843,0.00008723854,0.0007076499,0.00001252806,0.00002196613,0.00001035977,0.01028565,0.003613397,0.0002361571,0.8537803,0.00001893302,0.1312031],"study_design_scores_gemma":[0.0008256616,0.000229211,0.003593709,0.00006040636,0.000005320105,0.00006144495,0.0008626531,0.2114103,0.005142434,0.7775012,0.00006669906,0.0002410122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4035593,0.0001311777,0.5945212,0.0002016491,0.0003642551,0.00007698518,3.879667e-7,0.0002517801,0.0008932578],"genre_scores_gemma":[0.7603257,8.072084e-7,0.2393551,0.000211418,0.00008960124,8.270486e-7,4.974881e-7,0.000006731977,0.000009231105],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3567664,"threshold_uncertainty_score":0.8304351,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002577281,0.0001974345,0.0003946456,0.0004204053,0.0004038753,0.0001039255,0.002703312,0.00005517966,0.000002017275],"category_scores_gemma":[0.0001979072,0.0001995006,0.0001877795,0.001557857,0.0002960672,0.0003676634,0.001564357,0.000225885,0.000001019681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002231743,"about_ca_system_score_gemma":0.00009189606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001409168,"about_ca_topic_score_gemma":0.000001523702,"domain_scores_codex":[0.9977979,0.0004281968,0.0005971521,0.0004708641,0.0002730989,0.0004327995],"domain_scores_gemma":[0.9967176,0.001807185,0.0002209382,0.001020598,0.0001709802,0.00006263734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000130834,0.00006855776,0.0006911223,0.0000380486,0.00003707353,0.000003113292,0.001578327,0.001109342,0.0007339016,0.7564198,0.00001051703,0.2392972],"study_design_scores_gemma":[0.0005022733,0.00005907068,0.01775586,0.0002051486,0.000008313325,0.000007759683,0.0002476438,0.1565381,0.01310466,0.8113358,0.00006875827,0.0001665746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3189511,0.0001972856,0.6772302,0.0004575498,0.0004339764,0.0001033909,3.895204e-7,0.0002604452,0.002365679],"genre_scores_gemma":[0.8356873,0.00000275796,0.1636869,0.0005460412,0.00003082558,0.000001332168,3.629098e-7,0.000003703339,0.00004077223],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5167362,"threshold_uncertainty_score":0.8135397,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002831849,0.0003067642,0.0005725811,0.0002569721,0.0002057198,0.0001131972,0.002683832,0.00007632651,0.000005903553],"category_scores_gemma":[0.00009027054,0.0002732207,0.000227937,0.0007926467,0.0001156026,0.0003549793,0.001393059,0.0003647913,0.00001633108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002021732,"about_ca_system_score_gemma":0.00007282294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001073384,"about_ca_topic_score_gemma":2.63219e-7,"domain_scores_codex":[0.9968798,0.0005136956,0.0006822733,0.0007174657,0.0005231943,0.0006836027],"domain_scores_gemma":[0.9963283,0.001576277,0.0004676902,0.001335346,0.0001535426,0.0001388627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002893335,0.00009704981,0.005235597,0.00008383758,0.00004935233,0.000009845543,0.009390108,0.1590184,0.00959094,0.5795221,0.000003303151,0.2369705],"study_design_scores_gemma":[0.0008044833,0.0003214973,0.02222017,0.0001876791,0.000005057954,0.00007614139,0.0001829408,0.8554311,0.01021923,0.1101727,0.00002987464,0.0003490606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5254064,0.0000720271,0.4732608,0.0001554131,0.000382735,0.0001469491,3.284041e-7,0.0002740774,0.0003013627],"genre_scores_gemma":[0.8776354,9.521636e-7,0.1219075,0.0003151838,0.00009587883,5.74133e-7,6.536499e-7,0.00001652646,0.00002735386],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6964128,"threshold_uncertainty_score":0.999972,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006188652,0.0002225143,0.0004232212,0.0002038208,0.0001593199,0.00001113093,0.0006239703,0.00005056085,0.00004238184],"category_scores_gemma":[0.001069043,0.0001417386,0.000146475,0.0003380828,0.0006068886,0.0002513405,0.0003372034,0.0000814009,0.0002347039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006438672,"about_ca_system_score_gemma":0.00003717542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005324948,"about_ca_topic_score_gemma":0.000001048312,"domain_scores_codex":[0.9969853,0.001000163,0.0006490697,0.0003514381,0.0003967116,0.0006173538],"domain_scores_gemma":[0.9946724,0.003828495,0.0005430261,0.000635109,0.0001964185,0.0001246049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003794544,0.00006505408,0.01287519,0.00001499454,0.00005068964,0.000004014461,0.002431076,0.0001929448,0.5871901,0.2766373,0.00001313092,0.1201461],"study_design_scores_gemma":[0.003480952,0.0002120499,0.1520636,0.000845855,0.00004168845,0.00004483787,0.0009223162,0.0005500537,0.4557489,0.3856028,0.00004533994,0.0004415893],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8531477,0.00005116818,0.1448556,0.0001149487,0.0001025472,0.000141304,0.000007520012,0.0004471501,0.001132039],"genre_scores_gemma":[0.9959755,5.469806e-7,0.003694519,0.00006043732,0.0001488804,8.321799e-7,4.174024e-7,0.00008008203,0.00003881692],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1428277,"threshold_uncertainty_score":0.5779933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}