{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":43,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":43,"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":"235c14bb6749","filters":{"venue":"SIAM Journal on Computing"}},"results":[{"id":"W2761673598","doi":"10.1137/16m1087072","title":"Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":633,"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; Air Force Office of Scientific Research; Canadian Institute for Advanced Research; Intelligence Advanced Research Projects Activity; National Science Foundation","keywords":"Quantum algorithm; Quantum phase estimation algorithm; Mathematics; Quantum algorithm for linear systems of equations; Algorithm; State (computer science); Operator (biology); Quantum; Series (stratigraphy); Polynomial; Matrix (chemical analysis); Chebyshev filter; State vector; Quantum Fourier transform; Mathematical analysis; Quantum mechanics; Quantum error correction; Physics; Quantum process; Quantum dynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.02425147854645196,"gpt":0.2855787927311494,"spread":0.2613273141846975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00138772,0.0002658388,0.0003967604,0.000217181,0.00188803,0.0007709488,0.001801882,0.00008637684,9.688048e-7],"category_scores_gemma":[0.00031184,0.0001940307,0.0001727616,0.0001308017,0.00006762391,0.0002910534,0.0002823691,0.0005480329,0.000004665429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004950922,"about_ca_system_score_gemma":0.0001854853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002455383,"about_ca_topic_score_gemma":0.00000187193,"domain_scores_codex":[0.9976612,0.0001308251,0.0006107493,0.0004812187,0.0006517334,0.0004643161],"domain_scores_gemma":[0.9963697,0.0008445507,0.001290907,0.000876242,0.0004393928,0.0001792165],"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.00008962093,0.0002582943,0.00006067868,0.00005168689,0.00009981389,0.00005980291,0.0006662953,0.2704697,0.001317334,0.01180929,0.00006575343,0.7150518],"study_design_scores_gemma":[0.001092418,0.00190527,0.0004351087,0.0009037598,0.0000120918,0.0001700199,0.00002792432,0.993282,0.00105623,0.0007171773,0.0001569312,0.0002410771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06978989,0.00006986305,0.9274558,0.0003203795,0.001866552,0.0003483896,0.000006250882,0.0000697194,0.0000731011],"genre_scores_gemma":[0.7544819,0.00000481637,0.2446952,0.00004623278,0.000716649,0.000002981615,0.000001148792,0.00002172663,0.00002939345],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7228123,"threshold_uncertainty_score":0.9994114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026753685","doi":"10.1137/s0097539700376676","title":"Classifying the Complexity of Constraints Using Finite Algebras","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":580,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Constraint satisfaction problem; Universal algebra; Surjective function; Mathematics; Constraint satisfaction; Class (philosophy); Constraint (computer-aided design); Set (abstract data type); Algebra over a field; Algebraic number; Simple (philosophy); Discrete mathematics; Computer science; Pure mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.08292401402696233,"gpt":0.3007412606629095,"spread":0.2178172466359471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007539427,0.0001237056,0.0001691689,0.0001397606,0.000538098,0.0002049718,0.0004608449,0.00004211232,0.00008416779],"category_scores_gemma":[0.0001103997,0.00009359844,0.0001096471,0.0003116641,0.0003228826,0.0002894325,0.0001156947,0.0004191339,0.00001295653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008588102,"about_ca_system_score_gemma":0.0001310553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002339855,"about_ca_topic_score_gemma":0.000002966241,"domain_scores_codex":[0.9986017,0.0001775822,0.0004718151,0.0001678714,0.0003405268,0.0002405407],"domain_scores_gemma":[0.9987704,0.0003158751,0.0004555109,0.0002183227,0.0001515044,0.00008837064],"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.000008367515,0.00006198309,0.001999977,0.000009576363,0.0000476247,0.00001330652,0.001198121,0.3885073,0.001024337,0.09780629,0.00008086906,0.5092422],"study_design_scores_gemma":[0.0003742689,0.00003828253,0.00733885,0.0001123538,0.000006359482,0.0004020287,0.0001089558,0.9888541,0.0005881488,0.001636993,0.0004188393,0.0001208639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06922815,0.0000369744,0.9256728,0.002402202,0.0004879751,0.00007422088,8.332344e-7,0.00004890446,0.002047882],"genre_scores_gemma":[0.8633766,0.000006216606,0.1358414,0.0005378395,0.000225319,1.037089e-7,3.104882e-7,0.000005722174,0.000006574602],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7941484,"threshold_uncertainty_score":0.413867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115404728","doi":"10.1137/s0097539704443057","title":"A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":128,"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","keywords":"Hypergraph; Combinatorics; Vertex cover; Mathematics; Cover (algebra); Vertex (graph theory); Hardness of approximation; Constant (computer programming); Combinatorial proof; Discrete mathematics; Code (set theory); Approximation algorithm; Graph; Computer science; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.01418656009218223,"gpt":0.2435712217290283,"spread":0.2293846616368461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000795874,0.0001485932,0.0002693866,0.000140856,0.0003825576,0.0002375645,0.000824835,0.00004063757,0.00001882173],"category_scores_gemma":[0.00007640564,0.00009993884,0.0001626922,0.0003454465,0.0001157707,0.0002501691,0.0002712994,0.0004158285,0.00001183896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002123993,"about_ca_system_score_gemma":0.00007559163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001493027,"about_ca_topic_score_gemma":0.000002262634,"domain_scores_codex":[0.998602,0.000147807,0.000385473,0.0002156125,0.0003831175,0.0002660073],"domain_scores_gemma":[0.9987816,0.0004243081,0.0002586841,0.0003030712,0.00009092391,0.0001413725],"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.00008969784,0.0001002807,0.0004089158,0.00001449836,0.0001004106,0.00001848774,0.00281376,0.008232299,0.0001718517,0.09154362,0.003742405,0.8927638],"study_design_scores_gemma":[0.004414647,0.0001601363,0.006297261,0.0002292112,0.0000143183,0.0005089557,0.00006848777,0.9590788,0.0005810185,0.012765,0.01562415,0.0002579709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1417131,0.00126804,0.8469383,0.006034161,0.001825886,0.0001897839,0.000001351684,0.00008344001,0.001945971],"genre_scores_gemma":[0.9210244,0.00005518919,0.07773907,0.0007216384,0.0003526474,2.843746e-7,9.590089e-8,0.000007383566,0.00009923877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9508466,"threshold_uncertainty_score":0.4075387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134875769","doi":"10.1137/s009753979833920x","title":"Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph factorization; Spanning tree; Matching (statistics); Connectivity; Strongly connected component; Undirected graph; Factor-critical graph; Minimum spanning tree; Line graph; Degree (music); Minimum degree spanning tree; Graph; Graph power","retraction":null,"screen_n_in":null,"score":{"opus":0.01281695513791297,"gpt":0.241961675845559,"spread":0.229144720707646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001636367,0.0003994983,0.0004762037,0.0003030262,0.001617889,0.001022478,0.001673802,0.0001094133,0.0001969748],"category_scores_gemma":[0.0001312361,0.0003822527,0.000336904,0.001139807,0.00007941019,0.0006906153,0.0002560054,0.001323089,0.0001012411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008120844,"about_ca_system_score_gemma":0.00007141558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001658448,"about_ca_topic_score_gemma":0.000001437908,"domain_scores_codex":[0.996392,0.0003170835,0.000978716,0.0006235789,0.0007621436,0.0009264688],"domain_scores_gemma":[0.9974301,0.00108563,0.0004569923,0.0005731224,0.0001408579,0.000313255],"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.00003946189,0.0002493087,0.0004978272,0.00004783687,0.0001234353,0.0004534766,0.00541791,0.02081664,0.001811999,0.01544235,0.0004518763,0.9546479],"study_design_scores_gemma":[0.001695634,0.0004563457,0.0032649,0.001031216,0.00002308648,0.003502776,0.0003100953,0.896792,0.00112903,0.0877336,0.002892839,0.001168484],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4556739,0.0001898024,0.5347059,0.0006438525,0.001098573,0.0001398162,9.155126e-7,0.000441583,0.007105657],"genre_scores_gemma":[0.7538295,0.00001558204,0.2442344,0.001104935,0.0006951928,0.000001370797,9.57411e-7,0.0000296071,0.00008850313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9534794,"threshold_uncertainty_score":0.9998629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044722214","doi":"10.1137/s0097539700369156","title":"The Efficiency of Resolution and Davis--Putnam Procedures","year":2002,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Pigeonhole principle; Mathematical proof; Resolution (logic); Mathematics; Class (philosophy); True quantified Boolean formula; Combinatorics; Discrete mathematics; Upper and lower bounds; Simple (philosophy); Conjunctive normal form; Binary logarithm; Satisfiability; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01238206213594669,"gpt":0.2277696652962964,"spread":0.2153876031603497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008886337,0.0000923079,0.0001120174,0.00007197296,0.0006418093,0.0002284727,0.0005690077,0.00002788222,0.000003134219],"category_scores_gemma":[0.0001754883,0.00005844015,0.00004899755,0.0002247747,0.00007551815,0.0001533137,0.00015386,0.0002292147,0.000006588543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002044855,"about_ca_system_score_gemma":0.00001979299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001003344,"about_ca_topic_score_gemma":3.361247e-7,"domain_scores_codex":[0.9989191,0.0001031732,0.000291723,0.0001603045,0.0002823675,0.0002433623],"domain_scores_gemma":[0.9990555,0.0003493105,0.0002485718,0.00021397,0.00006506935,0.0000675827],"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.00002267501,0.0002709052,0.0008264873,0.00006487774,0.00004760146,0.00006215707,0.004542011,0.004651112,0.002840043,0.2048143,0.00630003,0.7755578],"study_design_scores_gemma":[0.0003675537,0.0003133189,0.003375367,0.0002544956,0.0000045541,0.000640563,0.0001245207,0.9855584,0.0009643945,0.006467827,0.001780749,0.000148254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7292856,0.005335193,0.2578576,0.002768347,0.0009110674,0.0001435533,5.290106e-7,0.0001199176,0.00357818],"genre_scores_gemma":[0.9956006,0.0001432079,0.003893848,0.0001589593,0.0001517552,2.620022e-7,5.185373e-8,0.000005049134,0.00004623051],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9809073,"threshold_uncertainty_score":0.4936343,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042774332","doi":"10.1137/110845045","title":"Fixed-Parameter Algorithms for Maximum Agreement Forests","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":94,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Genome Atlantic; Killam Trusts","keywords":"Bounded function; Reticulate; Phylogenetic tree; Algorithm; Mathematics; Tree (set theory); Binary number; Binary tree; Combinatorics; Approximation algorithm; Phylogenetic network; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.02056744111870328,"gpt":0.2692337313635615,"spread":0.2486662902448583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000261368,0.0001455574,0.0001409671,0.000035499,0.0002310928,0.00007826419,0.000167925,0.00006261719,0.0000169871],"category_scores_gemma":[0.00007296951,0.0001205973,0.000145009,0.00002950068,0.00002638112,8.670406e-7,0.00009854266,0.0001000177,0.00002136243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001609386,"about_ca_system_score_gemma":0.00002626155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004082832,"about_ca_topic_score_gemma":0.000003312768,"domain_scores_codex":[0.9990839,0.00003311012,0.0002490463,0.0002115114,0.000106658,0.0003157297],"domain_scores_gemma":[0.9994192,0.00005375335,0.0001344837,0.0001543131,0.0001428846,0.00009534472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001440691,0.0003021199,0.02310698,0.00006397104,0.0008386305,0.00001360705,0.0003563118,0.008978197,0.3325633,0.0002484414,0.05134038,0.582044],"study_design_scores_gemma":[0.01014663,0.01146224,0.2663156,0.0003545104,0.0002022122,0.0008467957,0.0009317919,0.0634501,0.202257,0.0285442,0.4125486,0.00294024],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9654605,0.0006316783,0.0320187,0.0004106737,0.0006715386,0.0002760305,0.000004903924,0.000002637169,0.0005232992],"genre_scores_gemma":[0.9803897,0.00004495079,0.01766462,0.0005868531,0.001067469,0.00001044919,0.000006400663,0.000018927,0.000210605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5791037,"threshold_uncertainty_score":0.4917816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964502706","doi":"10.1137/s0097539701397825","title":"Genetic Design of Drugs Without Side-Effects","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"National Natural Science Foundation of China; City University of Hong Kong","keywords":"Computer science; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.01210486562788468,"gpt":0.2458435184468208,"spread":0.2337386528189361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006533883,0.0001430518,0.0001845335,0.00005258993,0.0001258556,0.00002703759,0.0001617531,0.00009340525,0.000009707654],"category_scores_gemma":[0.0002362054,0.000123646,0.0001029921,0.00006230698,0.00002627997,0.000001977013,0.00002670012,0.0001287882,0.000009347069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001099374,"about_ca_system_score_gemma":0.00007901355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.104328e-7,"about_ca_topic_score_gemma":7.644293e-8,"domain_scores_codex":[0.9987241,0.0003965349,0.0002749514,0.000183671,0.000182758,0.0002379592],"domain_scores_gemma":[0.9993315,0.00007792273,0.0002323065,0.0001891638,0.00007369204,0.00009539296],"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.00005599213,0.00005177214,0.0003815409,0.00002394278,0.00005948873,0.00001566542,0.00006895294,0.00594696,0.9612208,0.0002576141,0.0001075923,0.03180968],"study_design_scores_gemma":[0.0005320222,0.0007687291,0.0004139061,0.0001311194,0.000018488,0.0002102991,0.00003726157,0.000428771,0.9948334,0.0009159868,0.001533208,0.0001767945],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6021169,0.0009186295,0.3946829,0.00002106876,0.0003430704,0.0001613845,3.264009e-7,0.000006492738,0.001749273],"genre_scores_gemma":[0.9543791,0.00006692457,0.04503557,0.0001692146,0.0002351437,0.00000147547,3.891641e-7,0.00002322671,0.00008892061],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3522623,"threshold_uncertainty_score":0.5042139,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111071057","doi":"10.1137/060660345","title":"Distributed Selfish Load Balancing","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Computer science; Convergence (economics); Binary logarithm; Martingale (probability theory); Distributed algorithm; Load balancing (electrical power); Resource allocation; Upper and lower bounds; Mathematical optimization; Distributed computing; Mathematics; Combinatorics; Applied mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.05869518664568,"gpt":0.3854828848329976,"spread":0.3267876981873176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01146734,0.0001156064,0.0001977102,0.000144492,0.00066668,0.0003744749,0.0006486035,0.00005171141,0.0001801713],"category_scores_gemma":[0.001969056,0.00008550731,0.0001275629,0.0007748207,0.00004739221,0.0001279597,0.00009207082,0.0004837236,0.0005489864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001247768,"about_ca_system_score_gemma":0.00007700012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001225498,"about_ca_topic_score_gemma":0.000002719828,"domain_scores_codex":[0.9973463,0.0001444624,0.0007409467,0.0002497003,0.001137046,0.0003815711],"domain_scores_gemma":[0.9963131,0.00230734,0.0004296144,0.0003040607,0.0004103301,0.0002355331],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002026836,0.000402688,0.02883987,0.000005819391,0.00007270098,0.0003566934,0.002527308,0.02222434,0.005971815,0.06658234,0.04003746,0.8327763],"study_design_scores_gemma":[0.002308858,0.0004280006,0.2572907,0.0003221094,0.00003811411,0.002326264,0.005135314,0.02804005,0.007882068,0.2849792,0.4102496,0.0009997825],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6218022,0.00003419864,0.3650598,0.0007636981,0.0004770778,0.00004944292,0.000003312869,0.00004545929,0.01176481],"genre_scores_gemma":[0.9962671,0.000001485299,0.002240466,0.0005472607,0.0006938978,1.628889e-7,0.000001067478,0.000007933664,0.0002405626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8317765,"threshold_uncertainty_score":0.7056293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570868738","doi":"10.1137/090779152","title":"Randomized Self-Assembly for Exact Shapes","year":2010,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Tile; Constant (computer programming); Square (algebra); Point (geometry); Block (permutation group theory); Constraint (computer-aided design); Computer science; Square root; Fraction (chemistry); Discrete mathematics; Combinatorics; Mathematics; Algorithm; Geometry; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.008647222573215619,"gpt":0.2927262166789446,"spread":0.284078994105729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001141177,0.000166,0.0003063031,0.00007323656,0.0002695633,0.00008051198,0.0001754395,0.0001400934,0.000001446774],"category_scores_gemma":[0.0003443685,0.0001219077,0.0003641737,0.00006407517,0.00004718651,0.000003503504,0.00004583929,0.0003004638,0.000001732036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001000902,"about_ca_system_score_gemma":0.00004517459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.143088e-7,"about_ca_topic_score_gemma":0.000002665274,"domain_scores_codex":[0.9989536,0.0000889467,0.0003281569,0.000240034,0.0001310833,0.0002581419],"domain_scores_gemma":[0.9991816,0.0001260091,0.0002700847,0.0001464798,0.0001819761,0.00009383653],"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.004738671,0.0001080932,0.000058793,0.00001116898,0.0002302551,0.000007305592,0.00002750773,0.00006986247,0.9663279,0.0003810474,0.001268436,0.02677093],"study_design_scores_gemma":[0.03354928,0.0004834983,0.00006605223,0.00005926554,0.0001163178,0.0003275136,0.00003316038,0.01049226,0.9208254,0.0008983343,0.03272281,0.000426088],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9449683,0.00008649461,0.05317661,0.0003562566,0.0003458702,0.0002205951,0.000002399974,0.00006849288,0.0007749927],"genre_scores_gemma":[0.9374218,0.00006056725,0.06067646,0.000413459,0.001317466,0.000002096872,0.000008556332,0.00002101785,0.00007856698],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0455025,"threshold_uncertainty_score":0.4971251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1944379106","doi":"10.1137/120895950","title":"Space Complexity in Polynomial Calculus","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Vetenskapsrådet; Kungliga Tekniska Högskolan; Akademie Věd České Republiky; Univerzita Karlova v Praze; Grantová Agentura České Republiky; European Commission","keywords":"Pigeonhole principle; Mathematics; Proof complexity; Polynomial; Space (punctuation); Mathematical proof; Calculus (dental); Upper and lower bounds; Linear space; PSPACE; Discrete mathematics; Resolution (logic); Combinatorics; Computational complexity theory; Geometry; Mathematical analysis; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1428878891099822,"gpt":0.3584239022031194,"spread":0.2155360130931371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002713081,0.000136534,0.0002020297,0.0002283456,0.0001580033,0.0002491691,0.0008803729,0.00006040181,0.000003530774],"category_scores_gemma":[0.0003923948,0.0001267643,0.00006191937,0.0004864325,0.00005321023,0.0004136575,0.0002376774,0.0006175648,0.0000730126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003303296,"about_ca_system_score_gemma":0.0001693446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002730287,"about_ca_topic_score_gemma":0.000005031887,"domain_scores_codex":[0.9981178,0.0004044222,0.0004099217,0.0002449012,0.0004435743,0.000379388],"domain_scores_gemma":[0.9989318,0.0001052317,0.0002610301,0.0003309699,0.0001228718,0.0002480852],"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.000198822,0.0005470708,0.006301741,0.00002959206,0.00004018294,0.0005177399,0.009539853,0.06383435,0.001047625,0.551865,0.01061305,0.355465],"study_design_scores_gemma":[0.00118781,0.0003101772,0.01322861,0.0001018095,0.000002085181,0.0005877717,0.0001442656,0.9722822,0.001492308,0.00480707,0.005574762,0.0002810851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.162744,0.00006564785,0.8273875,0.001197231,0.0021681,0.00008334129,2.7709e-7,0.00008255454,0.006271358],"genre_scores_gemma":[0.588158,0.00000141657,0.4112263,0.0002445262,0.0003394547,3.19709e-7,2.095025e-7,0.000006417966,0.00002337592],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9084479,"threshold_uncertainty_score":0.51693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2787163834","doi":"10.1137/17m1136869","title":"Structure of Protocols for XOR Functions","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Boolean function; Combinatorics; Mathematics; Parity (physics); Function (biology); Discrete mathematics; Communication complexity; Binary entropy function; Reduction (mathematics); Entropy (arrow of time); Time complexity; Parity function; Computational complexity theory; Algorithm; Boolean expression; Physics; Principle of maximum entropy; Biology; Genetics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0393946758735956,"gpt":0.3277555133152117,"spread":0.2883608374416161,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000331444,0.0001128447,0.0001759637,0.0001600549,0.0005521851,0.0001579527,0.0007030151,0.00004435701,0.000025889],"category_scores_gemma":[0.00008294788,0.0000938976,0.0001360121,0.0003464056,0.00008124538,0.0001707968,0.0001315476,0.0002508145,0.000005918508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002563016,"about_ca_system_score_gemma":0.0000826426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001027376,"about_ca_topic_score_gemma":0.000001715442,"domain_scores_codex":[0.9988948,0.00005242858,0.0003413529,0.0002002696,0.0002539523,0.000257164],"domain_scores_gemma":[0.9988117,0.00018644,0.000290082,0.0002814259,0.0003435573,0.00008682823],"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.0001298837,0.0003413037,0.0007957769,0.0001262318,0.0001610714,0.00001441946,0.00190116,0.002459063,0.01023876,0.2119216,0.01267798,0.7592328],"study_design_scores_gemma":[0.003502654,0.006471359,0.006191139,0.001136818,0.00002586188,0.0009185168,0.0001571404,0.6265953,0.04143174,0.2076504,0.1051066,0.0008124842],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01727757,0.00001115663,0.97908,0.0003944012,0.001131339,0.001494282,0.000006594305,0.00005592379,0.0005486991],"genre_scores_gemma":[0.757471,3.059781e-7,0.2406986,0.0002567717,0.001491917,0.00001925319,6.423082e-7,0.000009319018,0.00005218533],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7584203,"threshold_uncertainty_score":0.4247017,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040746822","doi":"10.1137/s009753970343912x","title":"Dynamic Subgraph Connectivity with Geometric Applications","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"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":"","keywords":"Omega; Combinatorics; Sublinear function; Mathematics; Exponent; Matrix multiplication; Binary logarithm; Simple (philosophy); Graph; Discrete mathematics; Degeneracy (biology)","retraction":null,"screen_n_in":null,"score":{"opus":0.007030177447079165,"gpt":0.23590775653986,"spread":0.2288775790927808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005447072,0.000152536,0.0001564469,0.0006667955,0.0006224368,0.0003651876,0.0004286911,0.00003996265,0.000006222399],"category_scores_gemma":[0.00002183621,0.000129261,0.0000785704,0.002216013,0.00002741001,0.0003092094,0.00006857098,0.0003144176,0.00003268006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001017448,"about_ca_system_score_gemma":0.0001041502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006560366,"about_ca_topic_score_gemma":0.000007339437,"domain_scores_codex":[0.9985756,0.00008759797,0.0002922684,0.0003145045,0.0004457022,0.0002842706],"domain_scores_gemma":[0.9988307,0.0003343844,0.000259931,0.0002378539,0.0002392903,0.0000978507],"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.00001974727,0.0003913522,0.002740147,0.00001628731,0.0000465654,0.00005549253,0.00005906891,0.6109428,0.0005895425,0.1102651,0.0006894948,0.2741843],"study_design_scores_gemma":[0.001506692,0.0006561902,0.1178112,0.0000870723,0.00002158029,0.001642135,0.00002597044,0.8394488,0.001194473,0.02591621,0.01102208,0.0006676419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.147713,0.0001944495,0.8496128,0.0004510735,0.0002209339,0.000133548,8.290683e-7,0.0001053516,0.001568069],"genre_scores_gemma":[0.9271765,0.000005681789,0.07225835,0.0001827381,0.0002774365,0.000004034542,0.000005279296,0.000009094721,0.00008084696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7794635,"threshold_uncertainty_score":0.5271109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116060765","doi":"10.1137/090751670","title":"Dynamic Connectivity: Connecting to Networks and Geometry","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"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":"","keywords":"Combinatorics; Computer science; Bounded function; Vertex (graph theory); Sublinear function; Geometric networks; Discrete mathematics; Graph; Mathematics; Graph theory","retraction":null,"screen_n_in":null,"score":{"opus":0.02824370125694627,"gpt":0.2587204954265541,"spread":0.2304767941696078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134799,0.0001943479,0.000258225,0.0003623783,0.0007598135,0.0003635973,0.0006711811,0.00006303871,0.0000160282],"category_scores_gemma":[0.0001576879,0.0001852434,0.00009008584,0.0006646701,0.00003680654,0.0002888997,0.0005377204,0.00067449,0.00001338484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005517106,"about_ca_system_score_gemma":0.00002561812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001110322,"about_ca_topic_score_gemma":0.000006145484,"domain_scores_codex":[0.9984063,0.00013323,0.0003293461,0.000394833,0.0002490677,0.0004872442],"domain_scores_gemma":[0.998668,0.0004476015,0.0001970284,0.0002952772,0.00009619886,0.0002958675],"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.0000249172,0.0001265829,0.002476257,0.00001318216,0.00007255151,0.0002492294,0.002450325,0.009833244,0.00006423166,0.04648208,0.0000996025,0.9381078],"study_design_scores_gemma":[0.0004567576,0.0005493275,0.02063604,0.0002249732,0.000007619584,0.001996603,0.0001984425,0.9629035,0.0001039762,0.01205986,0.0004639906,0.0003989229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3557798,0.0001266027,0.6419808,0.000217113,0.0009796217,0.00006423057,2.798736e-7,0.0001018055,0.0007497919],"genre_scores_gemma":[0.8864248,0.000009810909,0.1125847,0.0007875398,0.0001707411,4.4442e-7,1.621207e-7,0.00001310151,0.000008634573],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9530702,"threshold_uncertainty_score":0.7554007,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2750183690","doi":"10.1137/15m1052779","title":"Uniform Generation of Random Regular Graphs","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":26,"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 Waterloo","keywords":"Combinatorics; Mathematics; Random regular graph; Graph; Random graph; Discrete mathematics; Uniform distribution (continuous); Running time; Pathwidth; Line graph; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.09616762111026869,"gpt":0.3523794718951406,"spread":0.256211850784872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007517476,0.00009919053,0.0002482638,0.0000573201,0.0005835535,0.0001215545,0.0002606211,0.00004857673,0.00002141036],"category_scores_gemma":[0.002107613,0.00007740293,0.00008778286,0.00003509436,0.0000341257,0.00007168725,0.00005093578,0.0002181442,0.000003685283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002075031,"about_ca_system_score_gemma":0.0000381276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001368752,"about_ca_topic_score_gemma":0.000001220855,"domain_scores_codex":[0.999019,0.00003052118,0.0003891083,0.0001023114,0.0002896715,0.000169391],"domain_scores_gemma":[0.9985088,0.0003552451,0.0006215576,0.0002448471,0.0001897189,0.00007981453],"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.00006712219,0.00006734675,0.00001855514,0.0000713595,0.0000475945,0.00002893511,0.0001683757,0.0002270797,0.001282506,0.9578345,0.0006462868,0.03954037],"study_design_scores_gemma":[0.001597464,0.0002463249,0.00006937476,0.0003025954,0.0000421715,0.0001084634,0.00004822649,0.1804654,0.003230987,0.8136631,0.0001004077,0.0001255383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09856775,0.00004098937,0.8989312,0.0001693167,0.0005816609,0.00007755577,0.000002659406,0.00001356417,0.001615301],"genre_scores_gemma":[0.9376475,0.0000121256,0.06191418,0.00003713421,0.0003347464,3.594191e-7,6.001795e-7,0.0000126261,0.00004078735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8390797,"threshold_uncertainty_score":0.4488281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103473460","doi":"10.1137/110833026","title":"Quantum Query Complexity of Minor-Closed Graph Properties","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"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":"","keywords":"Minor (academic); Mathematics; Combinatorics; Vertex (graph theory); Upper and lower bounds; Graph; Discrete mathematics; Quantum; Planar graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04791838239550129,"gpt":0.2581324715016704,"spread":0.2102140891061691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392602,0.0002899232,0.0004398166,0.0003178843,0.0005443991,0.0001863434,0.001109301,0.00007814611,0.000007476374],"category_scores_gemma":[0.00009868744,0.0002184653,0.0002685583,0.0005096678,0.0001912062,0.0003337175,0.0003779848,0.0007690401,0.00002185581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004784831,"about_ca_system_score_gemma":0.00009104712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001838437,"about_ca_topic_score_gemma":6.382622e-7,"domain_scores_codex":[0.9972728,0.000335141,0.0006866634,0.0002928835,0.0006344419,0.000778012],"domain_scores_gemma":[0.998287,0.0002044805,0.0005647287,0.0004584461,0.0001805112,0.0003048899],"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.0002019218,0.00293792,0.02417894,0.0005570523,0.0005788146,0.0002116088,0.02620199,0.07533918,0.02091299,0.3346405,0.003642243,0.5105968],"study_design_scores_gemma":[0.00110604,0.0007391336,0.03580104,0.0009199399,0.00002208336,0.001411926,0.0002032021,0.9355087,0.008721785,0.01317015,0.001599161,0.0007968922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7788535,0.000806064,0.2171264,0.0006930563,0.001861854,0.0001051007,0.000001121709,0.0001375759,0.0004153164],"genre_scores_gemma":[0.9574088,0.000009074587,0.04131626,0.0003250365,0.0009040613,4.781934e-7,5.581801e-7,0.00001959326,0.00001610776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8601695,"threshold_uncertainty_score":0.8908756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2587741488","doi":"10.1137/140998949","title":"Time-Optimal Top-$k$ Document Retrieval","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":22,"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":"Fondo Nacional de Desarrollo Científico y Tecnológico","keywords":"Computer science; Information retrieval; Top-down and bottom-up design; Document retrieval; Combinatorics; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01502496113998554,"gpt":0.2869893107850472,"spread":0.2719643496450617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009948451,0.0001797377,0.0002191555,0.00009706301,0.001964486,0.00199953,0.00227727,0.00006293067,0.00005991064],"category_scores_gemma":[0.0001426118,0.0001428826,0.0001205229,0.0000728713,0.00005723616,0.0009900557,0.001131956,0.0005385634,0.0003075216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008000729,"about_ca_system_score_gemma":0.00008334249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003819177,"about_ca_topic_score_gemma":7.932452e-8,"domain_scores_codex":[0.9982023,0.00008488561,0.0003497973,0.0003494098,0.0005892697,0.0004243894],"domain_scores_gemma":[0.9980551,0.0001081809,0.0005166119,0.0009688973,0.0001148718,0.0002363252],"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.0001636835,0.0003006173,0.0007541248,0.00002305601,0.0001311261,0.001467694,0.001262936,0.01397434,0.002431002,0.01815124,0.03031792,0.9310223],"study_design_scores_gemma":[0.001709193,0.0007349038,0.00740367,0.0004919949,0.00001262618,0.001064439,0.00003048252,0.9349095,0.003449104,0.003187352,0.04637111,0.0006356778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2252726,0.0001743937,0.7606338,0.00312803,0.003575612,0.0001372549,0.000002088599,0.000170668,0.006905567],"genre_scores_gemma":[0.8457623,0.00002824172,0.1506812,0.0005414424,0.002146129,2.720512e-7,0.00000177777,0.00001992303,0.0008187784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9303866,"threshold_uncertainty_score":0.9993348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055042442","doi":"10.1137/s0097539705447116","title":"Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Polyhedron; Combinatorics; Tangent; Polytope; Regular polygon; Convex polytope; Mathematics; Line (geometry); Convex set; Connected component; Tangent space; Line segment; Convex hull; Integer points in convex polyhedra; Geometry; Algorithm; Linear programming; Convex optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.02032279949089591,"gpt":0.2772758534224866,"spread":0.2569530539315907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169171,0.0001818558,0.0001901153,0.0003493592,0.0004265783,0.000237674,0.0004465527,0.00005619168,0.0000157446],"category_scores_gemma":[0.000108774,0.0001635322,0.00006795661,0.0004772508,0.00002238099,0.0002414012,0.0003647681,0.0003309054,0.00002770845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006200888,"about_ca_system_score_gemma":0.00008993496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004293262,"about_ca_topic_score_gemma":0.000008578267,"domain_scores_codex":[0.9982019,0.0000506914,0.0004635509,0.0003355983,0.0005877573,0.00036047],"domain_scores_gemma":[0.9987259,0.0003053179,0.0001826554,0.0002288267,0.0002028929,0.0003543984],"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.0002059225,0.0005048725,0.004271883,0.00003736706,0.0001722025,0.0007181959,0.0009460867,0.1333764,0.01177966,0.02870337,0.007648102,0.811636],"study_design_scores_gemma":[0.002849364,0.001713572,0.07951065,0.0004763155,0.00002538778,0.002457146,0.00004181749,0.8696003,0.01612052,0.01727703,0.008962304,0.0009655943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.406796,0.00033653,0.5893268,0.002073908,0.001079124,0.00009359287,0.00000124875,0.00004834328,0.000244458],"genre_scores_gemma":[0.8043618,0.000005022168,0.1899493,0.004116034,0.001463061,4.979536e-7,0.000003191162,0.00001144309,0.00008965184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8106704,"threshold_uncertainty_score":0.6668649,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971650774","doi":"10.1137/s0097539702415950","title":"Counting Complexity Classes for Numeric Computations I: Semilinear Sets","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Betti number; Complexity class; Completeness (order theory); Computation; Mathematics; Class (philosophy); Discrete mathematics; Characterization (materials science); Counting problem; Euler's formula; Euler characteristic; Combinatorics; Model of computation; Transfer (computing); Computational complexity theory; Time complexity; Algorithm; Computer science; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0597100730862779,"gpt":0.3185660829249645,"spread":0.2588560098386866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001438304,0.0002881559,0.000378891,0.000273242,0.00176289,0.0007107912,0.0009069558,0.00007399109,0.00002064294],"category_scores_gemma":[0.000360074,0.0002820814,0.0002812658,0.0007730462,0.0001155037,0.0004047843,0.0001432661,0.0006304801,0.00003025717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001094641,"about_ca_system_score_gemma":0.000198208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004071104,"about_ca_topic_score_gemma":0.000002573242,"domain_scores_codex":[0.997409,0.0002670417,0.0006680468,0.0004698597,0.0005106225,0.000675432],"domain_scores_gemma":[0.9973867,0.001147801,0.0004555037,0.0003751557,0.0004075623,0.0002273011],"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.00002156231,0.0005340662,0.001550956,0.0001081654,0.0001738636,0.00008089042,0.001334654,0.06024648,0.0001625433,0.8104454,0.005740537,0.1196009],"study_design_scores_gemma":[0.00101977,0.0002861941,0.001311199,0.0001746877,0.00001394111,0.0007080268,0.0001513479,0.8758022,0.0002772476,0.09246159,0.02733953,0.0004542248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02868611,0.0001900186,0.9655038,0.000738444,0.002021401,0.0002399626,0.000006727575,0.0002225097,0.002391007],"genre_scores_gemma":[0.533773,0.000009821172,0.4650389,0.0008191519,0.0003051134,0.00000237858,0.000003936898,0.00001993801,0.00002777902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8155558,"threshold_uncertainty_score":0.9999632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2904248248","doi":"10.1137/16m1066506","title":"Towards an Optimal Method for Dynamic Planar Point Location","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planar; Point (geometry); Mathematical optimization; Computer science; Algorithm; Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02372724423878573,"gpt":0.3418822705149188,"spread":0.3181550262761331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001625611,0.0001451318,0.0001557063,0.0002562798,0.00061676,0.0003748626,0.0005169923,0.00005553506,0.000009740704],"category_scores_gemma":[0.0001217421,0.0001348321,0.00007962514,0.0004376119,0.0000213427,0.0005145221,0.000063101,0.0001954473,0.00002255819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001180863,"about_ca_system_score_gemma":0.0001994388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002355375,"about_ca_topic_score_gemma":0.000002442471,"domain_scores_codex":[0.9985204,0.0001682371,0.0003603462,0.0003323879,0.0003296824,0.0002888919],"domain_scores_gemma":[0.9986252,0.000189888,0.0002415125,0.0002211638,0.0005648957,0.0001573765],"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.00006457993,0.0001065612,0.000007411545,0.00001265153,0.00003177387,0.00000797714,0.00104765,0.1847506,0.001294209,0.03644282,0.000741644,0.7754921],"study_design_scores_gemma":[0.0004348304,0.001015623,0.0008102859,0.00004243667,0.000006454563,0.0002987587,0.00004237252,0.9846827,0.002084344,0.008169403,0.002245953,0.0001668456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02124114,0.00005424645,0.9753277,0.001370812,0.001422771,0.0001441378,0.000001339813,0.00008537971,0.0003524731],"genre_scores_gemma":[0.438732,0.00000146411,0.5597173,0.0006125878,0.0008936314,0.000001304505,0.000006577377,0.00000773767,0.0000274084],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7999321,"threshold_uncertainty_score":0.5498292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003085628","doi":"10.1137/s009753970444106x","title":"SRT Division Algorithms as Dynamical Systems","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Division (mathematics); Division algorithm; Ergodic theory; Bernoulli's principle; Mathematics; Dynamical systems theory; Entropy (arrow of time); Algorithm; Computer science; Theoretical computer science; Discrete mathematics; Arithmetic; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03466662451208825,"gpt":0.342072670084368,"spread":0.3074060455722798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001354409,0.0002275451,0.0004251215,0.0001263215,0.0003207753,0.0002921405,0.0003075243,0.0001231168,0.0001198464],"category_scores_gemma":[0.0005682017,0.0001722413,0.0001917349,0.0001332178,0.00003258604,0.0001166221,0.0001109577,0.000702524,0.0003045948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001588163,"about_ca_system_score_gemma":0.00003542129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002342608,"about_ca_topic_score_gemma":5.358033e-7,"domain_scores_codex":[0.9977645,0.0001292008,0.0007849445,0.0002231714,0.0006602132,0.0004379697],"domain_scores_gemma":[0.9979992,0.0009663697,0.0003890839,0.000251697,0.0001226934,0.0002709664],"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.0000354886,0.001039416,0.0001506371,0.0002622559,0.0001736297,0.0002512503,0.0007650722,0.009145493,0.0003341492,0.8069063,0.00279073,0.1781455],"study_design_scores_gemma":[0.0004495448,0.0001785195,0.0001000766,0.0005933991,0.00002035245,0.0006576728,0.0001029121,0.9259877,0.00002500665,0.06891893,0.002722733,0.0002431102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4997543,0.0001327463,0.4783405,0.0009292402,0.0009202856,0.0002459848,0.000002936708,0.0001371002,0.01953692],"genre_scores_gemma":[0.9636979,0.00001111148,0.03426602,0.0001766726,0.001094981,0.000001030564,0.000001534472,0.00004406462,0.0007066748],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9168422,"threshold_uncertainty_score":0.7023797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082318583","doi":"10.1137/20m135515x","title":"Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Code word; Decoding methods; Block (permutation group theory); List decoding; Constant (computer programming); Block code; Upper and lower bounds; Algorithm; Discrete mathematics; Combinatorics; Computer science; Concatenated error correction code","retraction":null,"screen_n_in":null,"score":{"opus":0.02585537324071933,"gpt":0.2439845192761852,"spread":0.2181291460354658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001448118,0.0002890954,0.0004278349,0.0002423976,0.002581159,0.0004698852,0.0009657734,0.00004139037,0.00004178911],"category_scores_gemma":[0.0000544344,0.0002553632,0.0001055548,0.0007093156,0.0002965744,0.0002923195,0.0008964291,0.001500471,0.000006800524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001449345,"about_ca_system_score_gemma":0.0002790435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004602438,"about_ca_topic_score_gemma":0.0000156761,"domain_scores_codex":[0.9970749,0.0004413547,0.0005127992,0.000531221,0.0008339565,0.0006057873],"domain_scores_gemma":[0.9982004,0.0005376993,0.0003960889,0.0004177106,0.0001749418,0.0002732149],"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.001055481,0.002011128,0.0169096,0.0001511014,0.0007661996,0.00450922,0.009192819,0.2441956,0.0006126665,0.4839033,0.007335311,0.2293576],"study_design_scores_gemma":[0.001993008,0.002117955,0.002018434,0.000212989,0.00002130555,0.008428136,0.0007676331,0.9650052,0.0001442985,0.009647093,0.008997208,0.000646729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4670509,0.0007072309,0.5232581,0.002142073,0.001963124,0.0003640076,0.00001865357,0.0003910223,0.004104841],"genre_scores_gemma":[0.9085384,0.00002339852,0.09019168,0.0009275797,0.0002147708,0.00000249563,0.000002168367,0.00002214078,0.00007737217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7208096,"threshold_uncertainty_score":0.9999899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3115467804","doi":"10.1137/20m1386542","title":"A Local Search Framework for Experimental Design","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Mathematical optimization; Local search (optimization); Regret; Randomized rounding; Rounding; Combinatorial search; Combinatorial optimization; Computer science; Mathematics; Beam stack search; Algorithm; Search algorithm; Approximation algorithm; Best-first search; Beam search; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04420174424423241,"gpt":0.3073670412413076,"spread":0.2631652969970752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001083108,0.0001304934,0.0001566662,0.0001261129,0.001551207,0.0003644707,0.0007039541,0.00003840909,0.00005893081],"category_scores_gemma":[0.00003036802,0.0001284919,0.0001439065,0.0004281091,0.00002632873,0.0001145456,0.0003169263,0.00080368,0.00001195891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002494038,"about_ca_system_score_gemma":0.00008764336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001379824,"about_ca_topic_score_gemma":2.198689e-8,"domain_scores_codex":[0.9981867,0.0002737223,0.0002796785,0.0002863331,0.0005350422,0.0004385106],"domain_scores_gemma":[0.9988983,0.0005122875,0.0001312552,0.000210119,0.00007619614,0.000171808],"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.0000684766,0.0001614614,0.000003889701,0.000002098438,0.00002548347,0.00008391874,0.0004134005,0.8360841,0.00008764147,0.03106152,0.002608667,0.1293994],"study_design_scores_gemma":[0.0004779384,0.001153355,0.00001490821,0.00002153986,0.000002001528,0.0006123366,0.0004716002,0.984828,0.001885425,0.004809988,0.005557954,0.0001649336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002422768,0.0001967753,0.9945065,0.0004940529,0.001972904,0.0001717229,0.00000233142,0.0001106628,0.000122259],"genre_scores_gemma":[0.7348295,0.000001485334,0.2640859,0.0006534274,0.0003825636,0.000006068487,8.532093e-7,0.0000122161,0.00002795972],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7324067,"threshold_uncertainty_score":0.9997486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4320487114","doi":"10.1137/18m1233418","title":"Inapproximability of Matrix \\(\\boldsymbol{p \\rightarrow q}\\) Norms","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"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":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Mathematics; Combinatorics; Hardness of approximation; Approximation algorithm; Exponential time hypothesis; Matrix (chemical analysis); Norm (philosophy); Matrix norm; Exponential function; Constant (computer programming); Discrete mathematics; Time complexity; Computer science; Physics; Eigenvalues and eigenvectors; Quantum mechanics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02354846363361499,"gpt":0.2929863234056024,"spread":0.2694378597719874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001872952,0.0001983161,0.0003538172,0.0004350354,0.0004605155,0.0001916255,0.001411171,0.0000741036,0.00002306628],"category_scores_gemma":[0.0001407323,0.0001638028,0.0002573056,0.001610931,0.0001079898,0.0003133975,0.0004903867,0.0006350769,0.00008851058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006102742,"about_ca_system_score_gemma":0.000104102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000763306,"about_ca_topic_score_gemma":0.000001127447,"domain_scores_codex":[0.997647,0.0001656387,0.0006449576,0.0003662232,0.0006722194,0.0005039847],"domain_scores_gemma":[0.9982796,0.000431443,0.0003674882,0.0005547813,0.0001894848,0.0001772555],"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.00007777886,0.0008492279,0.01180127,0.0003148089,0.0002250606,0.0006103705,0.005240085,0.02563768,0.002387557,0.3861063,0.007663649,0.5590862],"study_design_scores_gemma":[0.001345515,0.0007180666,0.03836648,0.0004109604,0.0000133436,0.000531832,0.0002118175,0.7646762,0.003868993,0.1842785,0.004947029,0.0006312769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6731549,0.000132135,0.3190646,0.001786447,0.002884912,0.0001856204,0.000003771091,0.0004630204,0.002324657],"genre_scores_gemma":[0.954082,0.00001791741,0.04532983,0.0001174931,0.0003534322,8.313839e-7,0.000001309653,0.00001291085,0.00008423315],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7390385,"threshold_uncertainty_score":0.6679683,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1551570706","doi":"10.1137/070684008","title":"Algebraic Algorithms for Matching and Matroid Problems","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on 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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Matroid; Mathematics; Combinatorics; Algebraic number; Intersection (aeronautics); Weighted matroid; Matching (statistics); Discrete mathematics; Simple (philosophy); Oriented matroid; Matrix (chemical analysis); Exponent; Rank (graph theory); Matrix multiplication; Graphic matroid; Matroid partitioning","retraction":null,"screen_n_in":null,"score":{"opus":0.02852177057779009,"gpt":0.28192901818277,"spread":0.2534072476049799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009521146,0.0002083952,0.0002574793,0.0002181916,0.0008260222,0.0007316255,0.0006928857,0.00005573423,0.000002975307],"category_scores_gemma":[0.00003626596,0.0001859063,0.0001423235,0.0002772592,0.00003357106,0.0003924906,0.0001370705,0.0004634255,0.000005648654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000410331,"about_ca_system_score_gemma":0.00004137037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001821507,"about_ca_topic_score_gemma":4.584344e-7,"domain_scores_codex":[0.9983427,0.0000675609,0.0004104598,0.0003665967,0.0003200301,0.0004926391],"domain_scores_gemma":[0.9989672,0.0002633978,0.0002376141,0.0002432328,0.00009704772,0.0001914831],"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.000009185699,0.00009841671,0.0000355718,0.0000251586,0.00002763146,0.00003616755,0.001141551,0.002758358,0.0004020197,0.1682562,0.0003848666,0.8268249],"study_design_scores_gemma":[0.001066591,0.0009569234,0.002076807,0.0003271166,0.000009085044,0.001393492,0.00006413714,0.3993758,0.000248174,0.590581,0.003487808,0.0004130621],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04045961,0.000434124,0.9544281,0.003081676,0.0007650788,0.0002018271,0.000001217326,0.0001556267,0.0004727359],"genre_scores_gemma":[0.576987,0.00003132196,0.4207951,0.00142705,0.0007045104,0.000001296762,8.676587e-7,0.00001249547,0.00004024911],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8264118,"threshold_uncertainty_score":0.7581041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392238446","doi":"10.1137/18m1234849","title":"Four-Coloring \\(\\boldsymbol{P_6}\\)-Free Graphs. II. Finding an Excellent Precoloring","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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; National Science Foundation","keywords":"Combinatorics; Mathematics; Graph coloring; Complete coloring; Discrete mathematics; Graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.05692025520573841,"gpt":0.3279586546606393,"spread":0.2710383994549009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003306657,0.0003968971,0.00038337,0.001144305,0.001800741,0.001484502,0.00299204,0.0001208155,0.0000378292],"category_scores_gemma":[0.0002632713,0.0003648375,0.0003048434,0.001491315,0.0000821102,0.00171345,0.001609028,0.001908114,0.00007043378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003505624,"about_ca_system_score_gemma":0.0001866962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003110071,"about_ca_topic_score_gemma":0.000003134277,"domain_scores_codex":[0.9956971,0.000370623,0.0007008656,0.0008939214,0.001098744,0.001238736],"domain_scores_gemma":[0.997331,0.0007918064,0.0002098484,0.0009689109,0.0001670322,0.0005313917],"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.00007799803,0.000281922,0.001244945,0.0001876997,0.0002492809,0.002732517,0.005878231,0.06661492,0.005288827,0.4731804,0.001037612,0.4432256],"study_design_scores_gemma":[0.001382569,0.002268456,0.00259603,0.002174857,0.0000305797,0.002361159,0.0003669219,0.6748782,0.006032082,0.2967406,0.009863332,0.001305221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6488395,0.0009389477,0.3397913,0.001018018,0.004763986,0.0002919195,0.000001700457,0.0007713311,0.003583344],"genre_scores_gemma":[0.9586318,0.00008912842,0.03981702,0.0001404351,0.0009676465,0.000007101293,7.539032e-7,0.00006380527,0.0002823192],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6082633,"threshold_uncertainty_score":0.9998804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004640854","doi":"10.1137/120872310","title":"Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard","year":2013,"lang":"en","type":"preprint","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","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; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS; European Science Foundation","keywords":"Book embedding; Planar graph; Crossing number (knot theory); Planarity testing; Combinatorics; Planar straight-line graph; Planar; Mathematics; 1-planar graph; Graph drawing; Outerplanar graph; Embedding; Polyhedral graph; Pathwidth; Graph; Discrete mathematics; Computer science; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.04051022457043105,"gpt":0.2926810343826916,"spread":0.2521708098122605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001188871,0.0003985334,0.0004939652,0.0004822917,0.001276831,0.004077335,0.0008364615,0.000213051,0.00002719181],"category_scores_gemma":[0.0001474517,0.0004058401,0.0001647607,0.0004266706,0.00005332349,0.0003631625,0.0008702753,0.001435044,0.0001017379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000151407,"about_ca_system_score_gemma":0.0002665838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000281244,"about_ca_topic_score_gemma":0.000003593143,"domain_scores_codex":[0.9970584,0.0002328852,0.000702868,0.0007801403,0.0006993256,0.0005263817],"domain_scores_gemma":[0.9979073,0.0003705203,0.0005345743,0.0004058573,0.0003485469,0.0004332206],"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.00008494218,0.000442457,0.009172551,0.00044357,0.0005283327,0.0002553564,0.007212163,0.2572948,0.002100705,0.09909428,0.02362479,0.599746],"study_design_scores_gemma":[0.001824438,0.0005465937,0.1168185,0.005121585,0.0001044877,0.00258249,0.000160079,0.7186661,0.001525641,0.1266049,0.02309886,0.002946296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.513966,0.0002329386,0.4809519,0.0013121,0.00244903,0.0002352492,0.000007192116,0.0001181773,0.0007274054],"genre_scores_gemma":[0.743589,0.00002107827,0.2536458,0.001285386,0.001309582,0.000004032121,0.00001430521,0.00002378322,0.0001071106],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5967997,"threshold_uncertainty_score":0.9998394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017816090","doi":"10.1137/s0097539700379346","title":"There are No Sparse NP<sub><i>w</i></sub>-Hard Sets","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Context (archaeology); Mathematics; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02927383581484306,"gpt":0.2552256822994979,"spread":0.2259518464846548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001840371,0.0005139273,0.0005956636,0.000304417,0.0008094,0.0009230506,0.00214542,0.0001667938,0.00004723121],"category_scores_gemma":[0.0002785324,0.0004583318,0.0003784256,0.000889188,0.00008998647,0.0005673853,0.0008616439,0.001385693,0.0008553954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003134052,"about_ca_system_score_gemma":0.0001734707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000552019,"about_ca_topic_score_gemma":0.000006180159,"domain_scores_codex":[0.9955182,0.0004942662,0.0008866053,0.0009001956,0.00108873,0.001112015],"domain_scores_gemma":[0.9965817,0.000597282,0.0007400036,0.001016254,0.0005370317,0.0005277165],"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.0001012285,0.001095806,0.0239557,0.00008032061,0.0002087656,0.004824903,0.001317329,0.04973737,0.005160997,0.002588424,0.01519811,0.895731],"study_design_scores_gemma":[0.002991325,0.001374818,0.09049457,0.0008603043,0.00004215779,0.01120416,0.0001720099,0.8355356,0.004997456,0.01631898,0.03387677,0.002131863],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6816612,0.0003892379,0.3067701,0.002565987,0.004032698,0.0002492257,0.000002277798,0.0004730814,0.003856117],"genre_scores_gemma":[0.9558435,0.00009971909,0.03992835,0.00206754,0.001945871,0.000002122038,0.000001314803,0.00004958694,0.00006198818],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8935992,"threshold_uncertainty_score":0.9999226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385404176","doi":"10.1137/20m1375851","title":"Why Extension-Based Proofs Fail","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Intel Corporation; U.S. Department of Energy; Oracle; European Research Council; National Science Foundation","keywords":"Mathematical proof; Impossibility; Computer science; Extension (predicate logic); Iterated function; Theoretical computer science; Mathematics; Gas meter prover; Discrete mathematics; Asynchronous communication; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02448646008733901,"gpt":0.2712011413865315,"spread":0.2467146812991924,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096175,0.0001736389,0.0002360845,0.0002171906,0.0005268104,0.0005384752,0.0008262205,0.00006076537,0.000008602512],"category_scores_gemma":[0.0001126198,0.0001430854,0.0001430704,0.0009983293,0.00002209657,0.0002263955,0.0001356999,0.0004303484,0.000296704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006257764,"about_ca_system_score_gemma":0.000112668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004506285,"about_ca_topic_score_gemma":8.405113e-7,"domain_scores_codex":[0.9979944,0.0001352875,0.0004313715,0.0003544988,0.0005838778,0.0005006188],"domain_scores_gemma":[0.9987045,0.0002216912,0.0002559997,0.0004131283,0.0002070366,0.0001976693],"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.00003783599,0.0002236004,0.001385574,0.0001061747,0.00007615962,0.002533002,0.001135121,0.2672875,0.001799494,0.02308369,0.3364498,0.3658821],"study_design_scores_gemma":[0.0005743488,0.0001520114,0.002912199,0.0004145766,0.000002506257,0.0001802369,0.00004537562,0.9120578,0.0002736453,0.0007598203,0.08238494,0.0002425343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05363124,0.0001342919,0.9340164,0.007173329,0.002876264,0.0001565039,0.000003109572,0.0006036189,0.001405252],"genre_scores_gemma":[0.9908884,0.000003381496,0.00548224,0.00294871,0.0005282141,0.000001597141,0.000002796505,0.00001605897,0.0001285884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9372572,"threshold_uncertainty_score":0.5834852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3170119173","doi":"10.1137/22m1480616","title":"Unambiguous DNFs and Alon–Saks–Seymour","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"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":"European Regional Development Fund","keywords":"Mathematics; Logarithm; Combinatorics; Partition (number theory); Chromatic scale; Graph; Discrete mathematics; Extremal graph theory; Line graph; Voltage graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02501296454953974,"gpt":0.2712859524938219,"spread":0.2462729879442821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009880792,0.0001838101,0.0002256137,0.0003727697,0.0008081887,0.0005865076,0.0007894428,0.00005591127,0.00001012703],"category_scores_gemma":[0.00008454891,0.0001675088,0.0001130641,0.0009074593,0.00005716739,0.0002613595,0.0005199728,0.0005885297,0.0001340094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004238656,"about_ca_system_score_gemma":0.00005399084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007525325,"about_ca_topic_score_gemma":0.00000165365,"domain_scores_codex":[0.9982275,0.0001220814,0.0003413187,0.0003525885,0.000444841,0.0005116813],"domain_scores_gemma":[0.998933,0.000281153,0.0001677218,0.0003064217,0.0000858349,0.0002258861],"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.00001342649,0.0001028148,0.001327535,0.00003791917,0.00008099319,0.001289564,0.002105795,0.005745376,0.0003033695,0.08707394,0.008071805,0.8938475],"study_design_scores_gemma":[0.00120067,0.0005192948,0.0352279,0.000355801,0.00001109552,0.002521378,0.0001883716,0.8527107,0.0003638492,0.09130029,0.01495055,0.000650085],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5786389,0.0005796442,0.4009486,0.008369503,0.004815583,0.0001991075,0.000003175307,0.001126369,0.0053191],"genre_scores_gemma":[0.9738891,0.00007844219,0.02434965,0.0007350097,0.0007062688,6.833994e-7,0.000001010159,0.00001761618,0.0002222273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8931974,"threshold_uncertainty_score":0.6830812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3126461544","doi":"10.1137/23m1573975","title":"Symmetries, Graph Properties, and Quantum Speedups","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Waterloo","funders":"Army Research Office; U.S. Department of Defense; U.S. Department of Energy; Natural Sciences and Engineering Research Council of Canada; Samsung; National Science Foundation","keywords":"Permutation group; Adjacency list; Homogeneous space; Adjacency matrix; Speedup; Quantum algorithm; Mathematics; Combinatorics; Discrete mathematics; Quantum; Permutation (music); Computer science; Graph; Parallel computing; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02288213819992293,"gpt":0.2387494341219067,"spread":0.2158672959219837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001045636,0.0002687471,0.0002646038,0.0005047767,0.0006185208,0.001783692,0.0006833383,0.00007244785,0.00000381195],"category_scores_gemma":[0.000108262,0.0001935874,0.0001347239,0.0009096605,0.00007528649,0.0002799567,0.0003620005,0.001085943,0.00002954501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000517188,"about_ca_system_score_gemma":0.0001464158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007894602,"about_ca_topic_score_gemma":3.960859e-7,"domain_scores_codex":[0.9979252,0.0001463177,0.0004178031,0.0005085262,0.0004755698,0.0005266197],"domain_scores_gemma":[0.9989787,0.0002653128,0.0001108604,0.00028517,0.0001034822,0.0002564698],"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.00001315493,0.00007789156,0.0001367043,0.0001575829,0.0001257352,0.001038452,0.002493718,0.01089726,0.00059623,0.1307866,0.003785774,0.8498909],"study_design_scores_gemma":[0.0002084096,0.0003382292,0.0003758461,0.0009314898,0.000008519703,0.002978131,0.00004053403,0.9665734,0.0003088739,0.0102419,0.01768375,0.0003109559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4114347,0.01326127,0.5611961,0.007042924,0.005190189,0.0001684653,0.000001612604,0.0007643075,0.0009403665],"genre_scores_gemma":[0.9810745,0.000109259,0.01693609,0.0007139805,0.001056881,4.213569e-7,4.215563e-7,0.00002747867,0.00008095935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9556761,"threshold_uncertainty_score":0.9992526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2956823442","doi":"10.1137/19m1303010","title":"Maximum Rectilinear Convex Subsets","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","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":"Agencia Estatal de Investigación; Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; Comisión Nacional de Investigación Científica y Tecnológica; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Ministerio de Ciencia e Innovación; Gobierno de Aragón; Natural Sciences and Engineering Research Council of Canada; European Commission; Universidad de Santiago de Chile","keywords":"Convex hull; Mathematics; Combinatorics; Regular polygon; Convex set; Boundary (topology); Polygon (computer graphics); Convex polygon; Computational geometry; Orthogonal convex hull; Interior point method; Polygon covering; Point (geometry); Time complexity; Plane (geometry); Convex body; Algorithm; Geometry; Convex optimization; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01997149189643241,"gpt":0.2706802176096781,"spread":0.2507087257132458,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006449372,0.0001314978,0.0001701508,0.0001491334,0.0004314585,0.0004584703,0.0003718073,0.00005047398,0.00005541004],"category_scores_gemma":[0.0001809403,0.0001282535,0.000114276,0.0006592541,0.00001407321,0.0002690212,0.0001551927,0.0004070102,0.0001383967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006558293,"about_ca_system_score_gemma":0.0002498365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.211914e-7,"about_ca_topic_score_gemma":7.137744e-7,"domain_scores_codex":[0.9984447,0.000189411,0.0003479966,0.0003041302,0.0004367676,0.0002769403],"domain_scores_gemma":[0.998788,0.0002522151,0.0001738533,0.0002423896,0.000385226,0.0001583262],"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.00002508717,0.0003184666,0.0006680049,0.00002642628,0.0001021675,0.001423823,0.0007425944,0.1243,0.005259817,0.05919002,0.008440485,0.7995031],"study_design_scores_gemma":[0.001409443,0.0003037076,0.00657611,0.0001934361,0.00001332442,0.005676563,0.00007856548,0.8380751,0.03247997,0.02322861,0.09137536,0.0005898228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.113271,0.0004246352,0.8770235,0.002062234,0.00295053,0.00004621042,5.705581e-7,0.00009853308,0.00412275],"genre_scores_gemma":[0.9009507,0.00002967101,0.09544113,0.001929268,0.001169118,4.277197e-7,0.00000486518,0.000010838,0.000463981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7989133,"threshold_uncertainty_score":0.5230027,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3011353849","doi":"10.1137/20m1330762","title":"A Spectral Approach to Network Design","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02452210677922287,"gpt":0.2234367669435653,"spread":0.1989146601643424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008757351,0.0001369023,0.000167457,0.0001275302,0.0004355246,0.00008365234,0.0002788242,0.00002571029,0.00004461846],"category_scores_gemma":[0.000009204793,0.0001395147,0.00007933591,0.000342594,0.000005486496,0.00003942929,0.00006891059,0.0007469532,0.0000143722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001906329,"about_ca_system_score_gemma":0.00001864721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.425691e-7,"about_ca_topic_score_gemma":3.022107e-8,"domain_scores_codex":[0.9988491,0.0001212501,0.0002382473,0.000126894,0.0002567054,0.0004078307],"domain_scores_gemma":[0.9996238,0.00006984617,0.00004215105,0.00011876,0.00001224584,0.0001331527],"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.00001052246,0.00002361682,0.00002599905,0.000004640476,0.00002091065,0.00003420829,0.000249195,0.9579285,0.0003769883,0.0008951983,0.02861437,0.0118159],"study_design_scores_gemma":[0.0003103059,0.000617591,0.0002444311,0.00005565878,0.00001286863,0.001141266,0.0001277359,0.9713926,0.0008955316,0.003166822,0.02158577,0.0004493663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007109428,0.0002162474,0.9788514,0.00006195024,0.0006274653,0.0001716758,8.714255e-7,0.0004725992,0.01248832],"genre_scores_gemma":[0.8401999,0.00000582349,0.1583961,0.0003138771,0.0009968806,0.000006348522,9.684514e-7,0.00004071424,0.00003942252],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8330905,"threshold_uncertainty_score":0.5689245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413132918","doi":"10.1137/23m1549353","title":"A Direct Product Theorem for Quantum Communication Complexity with Applications to Device-Independent Cryptography","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fujitsu Laboratories of America; National Research Foundation Singapore; Innovation, Science and Economic Development Canada","keywords":"Communication complexity; Quantum entanglement; Upper and lower bounds; Discrete mathematics; Quantum; Quantum information science; Mathematics; Quantum cryptography; Direct product; Quantum information; Quantum key distribution; Combinatorics; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.0230217637800299,"gpt":0.2975519321859303,"spread":0.2745301684059004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001368827,0.0002713048,0.0003407445,0.0004662825,0.001492747,0.0005664387,0.001696775,0.00004516477,0.000001480282],"category_scores_gemma":[0.00006846432,0.0002106436,0.000168353,0.001296335,0.000081432,0.0001245744,0.0003835033,0.0005548545,0.000006562373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008469802,"about_ca_system_score_gemma":0.0001695843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008966889,"about_ca_topic_score_gemma":0.000009590807,"domain_scores_codex":[0.9978468,0.000243347,0.0004790602,0.0005643736,0.0003812031,0.0004851746],"domain_scores_gemma":[0.9975707,0.0006002018,0.0003167137,0.0009299919,0.0004022807,0.0001801215],"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.00008117177,0.0003530773,0.0005908781,0.00008032896,0.0001712631,0.000006543884,0.001187465,0.06505274,0.0002395124,0.6524643,0.001067082,0.2787056],"study_design_scores_gemma":[0.001580105,0.0007542077,0.008567466,0.00124837,0.00004934376,0.0002172532,0.0001601053,0.8340887,0.001590974,0.1050232,0.04595364,0.0007666255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02642572,0.0003191567,0.9643668,0.006019969,0.0002946355,0.0008910669,0.000003682136,0.0002428318,0.001436144],"genre_scores_gemma":[0.6810386,0.00000638497,0.3177194,0.0009770162,0.0001962674,0.00002900164,0.000003002215,0.00001514532,0.00001512179],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.769036,"threshold_uncertainty_score":0.9998072,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2999758721","doi":"10.1137/21m1397854","title":"How to Trap a Gradient Flow","year":2024,"lang":"en","type":"preprint","venue":"SIAM Journal on Computing","topic":"Stochastic Gradient Optimization Techniques","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":"Azrieli Foundation; Microsoft Research","keywords":"Dimension (graph theory); Combinatorics; Mathematics; Logarithm; Gradient descent; Omega; Balanced flow; Upper and lower bounds; Function (biology); Polynomial; Domain (mathematical analysis); Binary logarithm; Discrete mathematics; Physics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02750805298991366,"gpt":0.2760007576886304,"spread":0.2484927046987167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00100459,0.0005043485,0.000514071,0.001083688,0.0002957856,0.003297692,0.002274125,0.0002196787,0.000005768808],"category_scores_gemma":[0.000241236,0.0004556618,0.0003909732,0.0007038338,0.00003005042,0.0001185281,0.003055731,0.002337076,0.00006220116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004271264,"about_ca_system_score_gemma":0.0002610373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001996551,"about_ca_topic_score_gemma":5.388684e-7,"domain_scores_codex":[0.9967391,0.0001472973,0.0006233985,0.0009603064,0.0008960532,0.0006338506],"domain_scores_gemma":[0.9977888,0.0001882357,0.0004086689,0.0008402543,0.0003040455,0.000469981],"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.00001566015,0.0001691185,0.00001551262,0.0002233473,0.0001812789,0.0007124736,0.004678656,0.5190504,0.00006118567,0.1124294,0.02776258,0.3347004],"study_design_scores_gemma":[0.0001601639,0.0003680483,0.00004311185,0.002010789,0.0000251484,0.0005354777,0.00003046549,0.9227383,0.000343958,0.07052966,0.00263915,0.000575793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002033802,0.000390039,0.9748621,0.01202919,0.008198528,0.0004718754,0.000005612063,0.0009114595,0.001097383],"genre_scores_gemma":[0.311248,0.00002031339,0.6860756,0.001008876,0.001312611,0.00001402785,0.000003118082,0.00006118089,0.0002562904],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4036879,"threshold_uncertainty_score":0.9999646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2970866601","doi":"10.1137/20m1362899","title":"Want to Gather? No Need to Chatter!","year":2020,"lang":"en","type":"preprint","venue":"SIAM Journal on Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Node (physics); A priori and a posteriori; Computer science; Task (project management); Product (mathematics); Time complexity; Polynomial; Upper and lower bounds; Theoretical computer science; Mathematics; Algorithm; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04709621463748689,"gpt":0.3100520172083028,"spread":0.262955802570816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001029635,0.0003646731,0.0004797946,0.0004335986,0.0003530753,0.001543039,0.00245294,0.0001352319,0.00006703558],"category_scores_gemma":[0.0002496191,0.0003329238,0.0002195464,0.0005508241,0.00001313941,0.000126703,0.003295695,0.001766408,0.001353997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002039335,"about_ca_system_score_gemma":0.0003104614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006843606,"about_ca_topic_score_gemma":7.035558e-7,"domain_scores_codex":[0.9967874,0.0002651309,0.0006829875,0.0007553587,0.0008709016,0.0006382767],"domain_scores_gemma":[0.9974583,0.0001311396,0.0003280769,0.0006330118,0.0004451336,0.001004297],"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.00004229732,0.0001204729,0.00007145655,0.00009776972,0.0000960515,0.0003060087,0.007816114,0.8611285,0.0007173545,0.005758736,0.03375869,0.09008652],"study_design_scores_gemma":[0.0004437161,0.0006528504,0.0002845609,0.001164815,0.000006246534,0.0001019361,0.00005794068,0.95433,0.0002066206,0.002302374,0.03977306,0.0006758589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002540852,0.00002562835,0.932467,0.0561933,0.003226315,0.0004884684,0.000002871424,0.0002225456,0.004832953],"genre_scores_gemma":[0.3765562,0.00003004892,0.5826017,0.03709234,0.003087095,0.00000907137,0.000005052234,0.00007934156,0.0005390557],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3740154,"threshold_uncertainty_score":0.9999123,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407294025","doi":"10.1137/23m1545938","title":"An Approximate Generalization of the Okamura–Seymour Theorem","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Generalization; Mathematics; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01056372524024707,"gpt":0.2735173728158096,"spread":0.2629536475755625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000817143,0.0001054767,0.0001267872,0.0001932252,0.0004310384,0.0002078456,0.000779321,0.00003964696,0.000004695893],"category_scores_gemma":[0.00007035481,0.00007424966,0.0000923059,0.0008366393,0.00003419198,0.000247353,0.0001308913,0.000201385,0.000002154364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004686549,"about_ca_system_score_gemma":0.0001459536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001242053,"about_ca_topic_score_gemma":5.401404e-7,"domain_scores_codex":[0.9986971,0.0002673729,0.0003596217,0.0001901235,0.0003214673,0.0001642936],"domain_scores_gemma":[0.9990203,0.0001065556,0.0002786398,0.0003111946,0.0002346799,0.00004860874],"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.000006324311,0.00007091327,0.0006217501,0.00001085808,0.00001713679,0.000001599122,0.0002380893,0.368713,0.003470985,0.5661362,0.0002755691,0.06043763],"study_design_scores_gemma":[0.0002805874,0.00007132719,0.005127125,0.000102146,0.000006505839,0.00004096633,0.00002384115,0.939963,0.01116902,0.04256634,0.0005590938,0.00009003724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1287439,0.00008410381,0.8670991,0.000777642,0.001224651,0.00008351925,4.396809e-7,0.00003606951,0.001950558],"genre_scores_gemma":[0.9673806,0.000006121378,0.03147172,0.0007834811,0.000236898,5.382487e-7,0.000001489503,0.000004614437,0.0001145385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8386367,"threshold_uncertainty_score":0.3315243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4417317418","doi":"10.1137/22m1534407","title":"Cheeger’s Inequalities for Vertex Expansion and Reweighted Eigenvalues","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; Shanghai University; National Natural Science Foundation of China","keywords":"Eigenvalues and eigenvectors; Vertex (graph theory); Omega; Inequality; Minification; Series expansion","retraction":null,"screen_n_in":null,"score":{"opus":0.09680532953350661,"gpt":0.3964818199507716,"spread":0.299676490417265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008774255,0.0001434504,0.0002931995,0.0001051835,0.0004594584,0.0001248159,0.0001355578,0.00006615133,0.00003288555],"category_scores_gemma":[0.000708416,0.0001122721,0.00009656056,0.0001171107,0.00003978711,0.00005275831,0.00006436396,0.000205698,0.000003380574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004128933,"about_ca_system_score_gemma":0.00004295826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001986172,"about_ca_topic_score_gemma":6.466693e-7,"domain_scores_codex":[0.9988275,0.00007402953,0.0005446366,0.0001609301,0.0001548573,0.000238],"domain_scores_gemma":[0.9971889,0.00222802,0.00019272,0.0001773761,0.0001357549,0.00007725739],"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.0000177837,0.00007818599,0.0000258264,0.0003191176,0.00003957098,0.000001116621,0.0008093404,0.000008311074,0.0002439794,0.9826508,0.00748972,0.008316209],"study_design_scores_gemma":[0.0005632585,0.00009617164,0.00007694418,0.0007631628,0.00003978937,0.00001933417,0.001390258,0.01755889,0.0009889557,0.9736201,0.004728083,0.0001550299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6204576,0.0003194591,0.3677138,0.002641454,0.0003561954,0.0004623699,0.00001092791,0.0001202401,0.007917942],"genre_scores_gemma":[0.9425883,0.0000473381,0.05446113,0.0007630088,0.0002917793,0.00001606154,0.000003655558,0.00002578916,0.001802891],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3221307,"threshold_uncertainty_score":0.4578325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400213152","doi":"10.1137/23m1548633","title":"Complexity Classification of Counting Graph Homomorphisms Modulo a Prime Number","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modulo; Homomorphism; Prime (order theory); Prime number; Combinatorics; Mathematics; Discrete mathematics; Graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0611886896354861,"gpt":0.3424923313504004,"spread":0.2813036417149143,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002128609,0.0001926748,0.0002784541,0.0003889942,0.0003977915,0.000454963,0.001063043,0.00006584518,0.00003167901],"category_scores_gemma":[0.0001248767,0.0001718628,0.0002010834,0.00127393,0.0001976812,0.0005759025,0.0002633061,0.0009004793,0.0000953035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001246998,"about_ca_system_score_gemma":0.0001473171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003316961,"about_ca_topic_score_gemma":5.913738e-7,"domain_scores_codex":[0.9973899,0.0002878322,0.0005927365,0.0004283275,0.0008246728,0.0004765867],"domain_scores_gemma":[0.9982306,0.0005444562,0.0002923766,0.0004618958,0.0003125759,0.0001580638],"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.00002163954,0.0001112141,0.001570118,0.00007939956,0.00007519642,0.0001222294,0.0006179191,0.002064018,0.005980037,0.9061518,0.0002844785,0.08292189],"study_design_scores_gemma":[0.000355735,0.0001664857,0.01104528,0.0006830541,0.00000954031,0.0007884529,0.00008249856,0.6610683,0.002426399,0.3220272,0.001048147,0.0002989129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.197377,0.0002521677,0.7976754,0.0005725964,0.0008112227,0.0001264346,0.000002401736,0.0001858521,0.002996942],"genre_scores_gemma":[0.9496393,0.00001828383,0.04994558,0.00006925992,0.0002498238,0.000001291639,0.000001456811,0.00002251068,0.00005250709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7522623,"threshold_uncertainty_score":0.700836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4417317377","doi":"10.1137/24m1653173","title":"Testing Graph Properties with the Container Method","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"","retraction":null,"screen_n_in":null,"score":{"opus":0.03708113139195662,"gpt":0.2806205290011702,"spread":0.2435393976092136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001438069,0.0001785153,0.000204347,0.0002126055,0.001266473,0.0006629159,0.001175393,0.00003208016,0.000002246738],"category_scores_gemma":[0.0001422279,0.00009541176,0.00009423005,0.001157783,0.00009016559,0.0002013122,0.0002972959,0.0007069971,0.000004124337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003911973,"about_ca_system_score_gemma":0.0001426077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001280389,"about_ca_topic_score_gemma":0.000003245167,"domain_scores_codex":[0.9984442,0.0002863335,0.0002818714,0.0002736187,0.000348984,0.0003650192],"domain_scores_gemma":[0.9983345,0.0007946828,0.0001930778,0.0003559479,0.0002547054,0.00006704187],"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.00004183146,0.0001196987,0.001452919,0.0000386341,0.0001923252,0.0001386976,0.001477724,0.02741287,0.0008873794,0.2132559,0.002173864,0.7528082],"study_design_scores_gemma":[0.001471097,0.0007742381,0.01060429,0.001615234,0.00004371235,0.001436515,0.0007185525,0.9231412,0.002289366,0.04357249,0.01372001,0.0006133277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01472731,0.0003157099,0.9718121,0.006629348,0.0005516643,0.0001258338,1.71055e-7,0.0001369501,0.005700863],"genre_scores_gemma":[0.6925545,0.000002371951,0.3043415,0.00267525,0.0002380782,0.000002113362,8.49965e-8,0.000008603486,0.0001775665],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8957283,"threshold_uncertainty_score":0.9740815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4225101446","doi":"10.1137/22n975482","title":"Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017)","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on 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":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Mathematics; Ninth; Combinatorics; Discrete mathematics; Computer science; Arithmetic; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03321610467084326,"gpt":0.2608543157344119,"spread":0.2276382110635687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005084312,0.0002783452,0.0002995265,0.0002741908,0.003633102,0.0003015012,0.003065688,0.00004996789,0.000119713],"category_scores_gemma":[0.0002957047,0.0001783039,0.0003327384,0.0007565481,0.0001543318,0.000157937,0.00146241,0.002106806,0.00001643085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001900556,"about_ca_system_score_gemma":0.0001198486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005686319,"about_ca_topic_score_gemma":0.000001439143,"domain_scores_codex":[0.995938,0.001334251,0.0006112382,0.0004334077,0.001164281,0.0005188021],"domain_scores_gemma":[0.9946505,0.003438602,0.0007459173,0.0009168353,0.0001517794,0.00009629859],"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.0002063514,0.0005135465,0.0002087633,0.00001386754,0.0001646951,0.0001014398,0.01128149,0.1153735,0.000163251,0.7057207,0.04228344,0.123969],"study_design_scores_gemma":[0.003041402,0.01010365,0.01711484,0.001161935,0.00008722586,0.003197914,0.01492596,0.6172026,0.002405094,0.2135559,0.1153075,0.001895999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6922356,0.0001072366,0.2031963,0.02449082,0.03487524,0.001052454,0.00003631006,0.0003139075,0.04369204],"genre_scores_gemma":[0.985075,0.000008942367,0.002429691,0.002659924,0.009675532,0.000003155664,0.000001327825,0.00002399602,0.0001224375],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5018291,"threshold_uncertainty_score":0.997664,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2407021550","doi":"10.1137/15m1009767","title":"Algorithms for Group Isomorphism via Group Extensions and Cohomology","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Finite Group Theory Research","field":"Mathematics","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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Group (periodic table); Mathematics; Abelian group; Isomorphism (crystallography); Group isomorphism; Extension (predicate logic); Divide and conquer algorithms; Cohomology; Equivalence (formal languages); Quotient group; Combinatorics; Group cohomology; Normal subgroup; Time complexity; Discrete mathematics; Algebra over a field; Cyclic group; Computer science; Pure mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1373638796531967,"gpt":0.4026025739951591,"spread":0.2652386943419625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002936208,0.0002217674,0.0004342716,0.0001792256,0.002263318,0.0003336209,0.0005652076,0.0001429939,0.0000404295],"category_scores_gemma":[0.001790026,0.000189445,0.0001477103,0.00004913368,0.0002683221,0.0001658702,0.0003440702,0.0007772655,0.00002231919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006831233,"about_ca_system_score_gemma":0.00002729127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006201335,"about_ca_topic_score_gemma":0.000004926876,"domain_scores_codex":[0.9980441,0.0002266887,0.0004696185,0.0003211072,0.0003331388,0.0006053671],"domain_scores_gemma":[0.9960416,0.002448652,0.0005288275,0.0005310113,0.0001972698,0.0002526219],"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.0006787009,0.0009648869,0.003169113,0.0003547237,0.0004884604,0.00124312,0.001628098,0.00003890232,0.01063325,0.6329054,0.008170182,0.3397251],"study_design_scores_gemma":[0.004197549,0.001869658,0.01069351,0.0004920663,0.00008210252,0.00457511,0.0002129328,0.07244861,0.0001907067,0.9005853,0.004094675,0.0005577579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6266448,0.0002282152,0.3672752,0.001937756,0.001550019,0.0006355715,0.0000120596,0.00009178751,0.00162457],"genre_scores_gemma":[0.9199875,0.00002972379,0.07834595,0.0002579062,0.001094076,0.000005668425,0.000002781281,0.0000643697,0.0002120251],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3391674,"threshold_uncertainty_score":0.9990356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401249586","doi":"10.1137/20m1322923","title":"Revisionist Simulations: A New Approach to Proving Space Lower Bounds","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; University of Toronto","funders":"","keywords":"Space (punctuation); Computer science; Mathematics; Combinatorics; Theoretical computer science; Algorithm; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02322180740497508,"gpt":0.2927665417462249,"spread":0.2695447343412498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008253347,0.0001934616,0.0002360935,0.0001998206,0.0005381902,0.003412412,0.0007409902,0.00005784565,0.00001019126],"category_scores_gemma":[0.0001381157,0.0001603433,0.0001377179,0.0009518714,0.0000131963,0.0004644685,0.0001952137,0.0005123784,0.0002077716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001667086,"about_ca_system_score_gemma":0.0002848302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009609247,"about_ca_topic_score_gemma":6.123408e-7,"domain_scores_codex":[0.9980416,0.00009022938,0.0004690279,0.0004833523,0.0005156267,0.0004001138],"domain_scores_gemma":[0.9988719,0.0001746786,0.0001261436,0.0003940191,0.0001127479,0.0003205492],"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.00001924152,0.0002011476,0.00008939982,0.0001883487,0.00008846074,0.0003390422,0.002694582,0.3446782,0.0003764924,0.1764383,0.09011738,0.3847694],"study_design_scores_gemma":[0.0001564083,0.00009228366,0.0001044031,0.001114614,0.000004622145,0.0003290397,0.00002574473,0.7650986,0.00001663025,0.0007727261,0.2320765,0.0002084522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003320249,0.0008395307,0.9815212,0.002705772,0.002206413,0.0001950217,0.000002220655,0.0002205376,0.008989077],"genre_scores_gemma":[0.9268153,0.000004297766,0.0697897,0.0004977066,0.001338387,8.2266e-7,0.0000015017,0.00001926955,0.001533017],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9234951,"threshold_uncertainty_score":0.9976221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416902920","doi":"10.1137/24m1635570","title":"Exact Algorithms and Lower Bounds for Stable Instances of Euclidean \\(\\boldsymbol{k}\\)- <scp>means</scp>","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Euclidean geometry; Approximation algorithm; Upper and lower bounds; Time complexity; Euclidean domain; Euclidean distance","retraction":null,"screen_n_in":null,"score":{"opus":0.01877987908988277,"gpt":0.2781844359888292,"spread":0.2594045568989464,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415058,0.0002601204,0.0004632168,0.0004320027,0.0007497635,0.0005447764,0.0009599129,0.00008708688,0.000003149884],"category_scores_gemma":[0.000258743,0.0002385737,0.0002074546,0.0007565129,0.0001434613,0.0004517814,0.0003392523,0.0004738368,0.000001605095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006380572,"about_ca_system_score_gemma":0.0001839374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008829814,"about_ca_topic_score_gemma":0.000005399851,"domain_scores_codex":[0.997793,0.0001115015,0.0006725705,0.0004499104,0.0004143629,0.0005586676],"domain_scores_gemma":[0.9974509,0.001316727,0.0004099295,0.0003765514,0.0002903515,0.0001554656],"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.0000367756,0.0005327894,0.003057844,0.0003173694,0.0003369735,0.00007682512,0.002246107,0.003409453,0.0006315971,0.2648022,0.006982285,0.7175698],"study_design_scores_gemma":[0.003129005,0.001406369,0.007489627,0.001730516,0.00005599486,0.0002172257,0.0008134678,0.7295077,0.00469675,0.1638386,0.08672197,0.0003927409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1250094,0.001277775,0.8653871,0.0004537147,0.002565834,0.0002265386,0.000008366343,0.00009492891,0.004976335],"genre_scores_gemma":[0.7904726,0.0001636096,0.2077392,0.000661843,0.0004392035,0.000003198053,0.000001567985,0.0000206114,0.0004981511],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7260983,"threshold_uncertainty_score":0.9728754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}