{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Andrew M. Childs","is_ca":false},{"name":"Robin Kothari","is_ca":false},{"name":"Rolando D. Somma","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00229976,0.0008910546,0.001038502,0.000714667,0.001257717,0.001643568,0.00186307,0.001376987,0.008865991],"category_scores_gemma":[0.01034827,0.0006362743,0.0009983134,0.001022385,0.001716172,0.003895241,0.00382122,0.003790415,0.002123765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001706336,"about_ca_system_score_gemma":0.002478143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002638388,"about_ca_topic_score_gemma":0.005626935,"domain_scores_codex":[0.9978562,0.0005824885,0.0001622737,0.0002773065,0.0008339479,0.0002877951],"domain_scores_gemma":[0.9957781,0.002543739,0.0002085152,0.0008212889,0.0005388895,0.0001093631],"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.0004253042,0.0001667747,0.0007267463,0.0002346589,0.000100829,0.0001405035,0.0005418847,0.1403512,0.009205927,0.6715792,0.009747969,0.1667789],"study_design_scores_gemma":[0.0001317059,0.00004939824,0.0001130191,0.00002133723,0.00001836706,0.00003835639,0.00002857776,0.7810301,0.004172349,0.210408,0.003959351,0.00002931142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01317471,0.000240321,0.9784163,0.0007732678,0.0001048923,0.0001255414,0.00007466581,0.00098608,0.006104161],"genre_scores_gemma":[0.2134531,0.0002576047,0.77722,0.000394838,0.0001419636,0.0004099977,0.0002292246,0.0002998066,0.007593431],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008865991,"threshold_uncertainty_score":0.02965969,"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","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true},{"name":"Peter Jeavons","is_ca":false},{"name":"Andrei Krokhin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003063805,0.0005230657,0.001136877,0.002715432,0.001306909,0.005754228,0.001535034,0.001359365,0.003210224],"category_scores_gemma":[0.01814604,0.0004819205,0.00218611,0.002914454,0.004282611,0.01424702,0.002615558,0.002513337,0.000199937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00355043,"about_ca_system_score_gemma":0.001958695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003037826,"about_ca_topic_score_gemma":0.002203082,"domain_scores_codex":[0.9951031,0.001627573,0.0004783265,0.0008359481,0.001453992,0.0005010705],"domain_scores_gemma":[0.9799168,0.01498477,0.00194793,0.001814139,0.0007426206,0.0005938133],"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.0001640978,0.0002081812,0.006120481,0.0002824438,0.0001399634,0.0001689506,0.0007973919,0.09934875,0.00362557,0.8571529,0.000922517,0.03106886],"study_design_scores_gemma":[0.00002611031,0.00003447731,0.001115681,0.0000284648,0.00002746185,0.0000763849,0.000184582,0.1414628,0.001729107,0.8542411,0.001044649,0.00002915837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6176532,0.000811878,0.3680657,0.002157834,0.00002278249,0.0002406819,0.0007635567,0.0003160127,0.009968425],"genre_scores_gemma":[0.9341984,0.0006652772,0.06228119,0.0001477758,0.00009548265,0.0002252707,0.0009185704,0.00004565911,0.001422341],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005754228,"threshold_uncertainty_score":0.02576023,"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)","authors":[{"name":"Irit Dinur","is_ca":false},{"name":"Venkatesan Guruswami","is_ca":false},{"name":"Subhash Khot","is_ca":false},{"name":"Oded Regev","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001820087,0.0005239265,0.0009393329,0.001206568,0.001425262,0.003143008,0.002303002,0.001524575,0.006289759],"category_scores_gemma":[0.01662952,0.0009467838,0.00148973,0.001657746,0.00254118,0.009352597,0.005460059,0.003825418,0.0006529469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002711235,"about_ca_system_score_gemma":0.002153759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003363526,"about_ca_topic_score_gemma":0.003055898,"domain_scores_codex":[0.9961893,0.0006205583,0.0001986168,0.0009937007,0.001399134,0.0005987295],"domain_scores_gemma":[0.9862385,0.007534175,0.001345482,0.003265189,0.0009943921,0.0006222909],"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.00120546,0.000289639,0.008078534,0.0008257068,0.0002172603,0.0008644548,0.0007667934,0.1840987,0.03292281,0.6143765,0.01203282,0.1443212],"study_design_scores_gemma":[0.0001426292,0.000216201,0.002381001,0.0001209071,0.0001228765,0.0009913022,0.0001328629,0.5431622,0.0201774,0.4232664,0.00916701,0.0001193782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.207773,0.0009128733,0.7666709,0.004090214,0.0001076346,0.0001954789,0.001514985,0.001656332,0.01707857],"genre_scores_gemma":[0.8306049,0.0005940212,0.1628971,0.0006095628,0.0001773886,0.0001775573,0.0008883076,0.0001863296,0.003864762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006289759,"threshold_uncertainty_score":0.02104133,"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","authors":[{"name":"Joseph Cheriyan","is_ca":true},{"name":"Ramakrishna Thurimella","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005632612,0.0008089303,0.0008137709,0.001143854,0.0004850902,0.0006702959,0.001735219,0.001115839,0.003166605],"category_scores_gemma":[0.003367677,0.0005987929,0.0009347826,0.002065916,0.0006381542,0.001989104,0.0009102178,0.000609205,0.000697212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001214118,"about_ca_system_score_gemma":0.00124168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006139442,"about_ca_topic_score_gemma":0.007372767,"domain_scores_codex":[0.9994699,0.0001234171,0.00002485965,0.0001473055,0.0001074061,0.0001270486],"domain_scores_gemma":[0.9987923,0.0006750468,0.0001779894,0.000172791,0.0001025153,0.00007929614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003179778,0.000166613,0.002218571,0.0002391765,0.00006960978,0.0002556791,0.000125265,0.8513169,0.008531609,0.01900963,0.007163382,0.1105857],"study_design_scores_gemma":[0.00003461869,0.00004008599,0.0003590115,0.00001242532,0.00001265271,0.00009053579,0.00005482639,0.9785783,0.002133833,0.01760536,0.00107175,0.000006639117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1532371,0.0003918282,0.8361926,0.0004075152,0.00004074414,0.0002525224,0.0005661656,0.002027443,0.006884024],"genre_scores_gemma":[0.4596653,0.000184277,0.5355815,0.0001218639,0.00002421033,0.0001768097,0.00128204,0.0002804186,0.002683553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006139442,"threshold_uncertainty_score":0.01220739,"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","authors":[{"name":"Paul Beame","is_ca":false},{"name":"Richard M. Karp","is_ca":false},{"name":"Toniann Pitassi","is_ca":false},{"name":"Michael Saks","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012765,0.001243154,0.001845995,0.002612568,0.001715577,0.00424498,0.00534784,0.00291092,0.006684665],"category_scores_gemma":[0.08314525,0.001120962,0.002596946,0.003007903,0.004111991,0.008675055,0.003747622,0.003183863,0.001450398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004381455,"about_ca_system_score_gemma":0.003659958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002651485,"about_ca_topic_score_gemma":0.002898542,"domain_scores_codex":[0.9822687,0.006978582,0.001012667,0.003174532,0.004884012,0.001681518],"domain_scores_gemma":[0.901414,0.07960596,0.004047791,0.01181191,0.002378569,0.0007418272],"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.001955009,0.0005684898,0.006228774,0.0009315158,0.0004751428,0.0003288478,0.0008816493,0.2295157,0.02331573,0.4576891,0.007182367,0.2709277],"study_design_scores_gemma":[0.0003044179,0.0002484125,0.000863625,0.00009219063,0.0001603338,0.0003095231,0.0001245288,0.7073575,0.0344134,0.2520943,0.003957056,0.00007477027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1501866,0.001977166,0.8200033,0.002739765,0.00009993261,0.0004930202,0.0004128915,0.002687637,0.02139957],"genre_scores_gemma":[0.599511,0.000793856,0.3930417,0.0006773879,0.00009044449,0.0005366975,0.0005335561,0.0006508604,0.004164502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.012765,"threshold_uncertainty_score":0.06750852,"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","authors":[{"name":"Chris Whidden","is_ca":true},{"name":"Robert G. Beiko","is_ca":true},{"name":"Norbert Zeh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003449192,0.001440223,0.00134685,0.002231144,0.001343484,0.002264736,0.004481702,0.002132661,0.007955971],"category_scores_gemma":[0.02161546,0.000904817,0.001955253,0.003252338,0.001679388,0.006258122,0.004026926,0.004140554,0.002446294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00196984,"about_ca_system_score_gemma":0.002243994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002243985,"about_ca_topic_score_gemma":0.003378063,"domain_scores_codex":[0.9964778,0.0009745214,0.0002962599,0.0007481384,0.001094799,0.0004085096],"domain_scores_gemma":[0.9874009,0.007865638,0.0005078462,0.002417635,0.001523702,0.0002842341],"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.0005187576,0.0002869699,0.001762796,0.0004159566,0.0001235063,0.0001418081,0.0003424543,0.4180397,0.006671879,0.1425615,0.01025361,0.4188812],"study_design_scores_gemma":[0.00008700204,0.00005632422,0.0001825208,0.00004378018,0.00002582691,0.000095168,0.00005097095,0.7842909,0.003469377,0.2082249,0.003441327,0.00003183002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005575408,0.0002421293,0.9910566,0.00009414648,0.00003177236,0.00005882817,0.0001413449,0.001507745,0.001292143],"genre_scores_gemma":[0.1295553,0.0001960378,0.8668643,0.0001230099,0.00006305506,0.0003286824,0.0008812427,0.0006740404,0.001314269],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007955971,"threshold_uncertainty_score":0.02661538,"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","authors":[{"name":"Xiaotie Deng","is_ca":false},{"name":"Guojun Li","is_ca":false},{"name":"Zimao Li","is_ca":false},{"name":"Bin Ma","is_ca":true},{"name":"Lusheng Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004740989,0.0006103357,0.0009405992,0.0004586127,0.0002870185,0.00107579,0.0009062725,0.001195346,0.006569096],"category_scores_gemma":[0.001118192,0.0003396139,0.0007942497,0.0005481275,0.0007471047,0.0008242025,0.0006917485,0.001260225,0.001584497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009858129,"about_ca_system_score_gemma":0.0009586233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007062632,"about_ca_topic_score_gemma":0.001259599,"domain_scores_codex":[0.9996498,0.00009551367,0.00001856718,0.0001021789,0.00007239155,0.00006161082],"domain_scores_gemma":[0.9997353,0.00008125634,0.00006316607,0.00004193366,0.00003925318,0.00003913966],"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.00253756,0.0006854165,0.002244267,0.002344323,0.0004558639,0.00127198,0.0001322726,0.150045,0.2238507,0.3166331,0.01277446,0.2870251],"study_design_scores_gemma":[0.002060352,0.005237822,0.001708255,0.0004780833,0.0008326411,0.001672591,0.0001607441,0.2759228,0.2064287,0.2551624,0.2501166,0.0002190122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2720774,0.03671516,0.5508201,0.01010152,0.002236317,0.001193703,0.003433307,0.002735774,0.1206868],"genre_scores_gemma":[0.7914025,0.01424738,0.1585514,0.002646418,0.0001620501,0.0008443637,0.001174509,0.0001600182,0.03081135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006569096,"threshold_uncertainty_score":0.02197582,"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","authors":[{"name":"Petra Berenbrink","is_ca":true},{"name":"Tom Friedetzky","is_ca":false},{"name":"Leslie Ann Goldberg","is_ca":false},{"name":"Paul W. Goldberg","is_ca":false},{"name":"Zengjian Hu","is_ca":true},{"name":"Russell Martin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001388031,0.0005203918,0.0007459917,0.0003904823,0.0008664742,0.001376963,0.001932647,0.0008189108,0.003743517],"category_scores_gemma":[0.004234329,0.0003236725,0.0003181184,0.0004364521,0.001053229,0.002003245,0.002034165,0.0006266276,0.0006186727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001017413,"about_ca_system_score_gemma":0.0008201747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001004836,"about_ca_topic_score_gemma":0.0009908519,"domain_scores_codex":[0.9989336,0.0002865924,0.0000479517,0.0002549562,0.0002974482,0.0001793571],"domain_scores_gemma":[0.9982452,0.0006265228,0.0002895056,0.0004139864,0.0002344466,0.0001903565],"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.0008706241,0.0001846967,0.001676763,0.000186061,0.0001199391,0.000467348,0.0005125047,0.6957894,0.02240853,0.2085415,0.005409209,0.06383342],"study_design_scores_gemma":[0.00005252363,0.0000629151,0.0001749446,0.000006502677,0.00001109945,0.00009048703,0.00004280346,0.9533351,0.001933689,0.04148679,0.00279134,0.00001193958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08155029,0.0002650155,0.9045224,0.0006570722,0.0001135616,0.0001394989,0.00009109412,0.0007430756,0.01191798],"genre_scores_gemma":[0.9521438,0.0001327953,0.04102444,0.0001291439,0.00006044862,0.0001456994,0.00006898019,0.00004571538,0.006248832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003743517,"threshold_uncertainty_score":0.01252335,"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","authors":[{"name":"David Doty","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001336071,0.0005433544,0.0007616644,0.0006241894,0.0007164481,0.001303927,0.001445843,0.001043125,0.005157925],"category_scores_gemma":[0.009025958,0.000689814,0.001093516,0.0005291876,0.002339781,0.001975667,0.001902349,0.001489927,0.0007643109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001499204,"about_ca_system_score_gemma":0.0008608371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001137567,"about_ca_topic_score_gemma":0.001260513,"domain_scores_codex":[0.9984862,0.0004159795,0.00008130231,0.0003600027,0.0004915465,0.0001649668],"domain_scores_gemma":[0.9954299,0.002397916,0.0005094697,0.001189544,0.0002795431,0.0001936358],"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.0001621577,0.00004402041,0.0006165855,0.0001204702,0.00002329767,0.0001169822,0.000136093,0.4536971,0.01105479,0.5136839,0.001212685,0.01913199],"study_design_scores_gemma":[0.00003487991,0.00006472247,0.0001095507,0.00001601879,0.000009565238,0.00006045647,0.00001485626,0.8387038,0.005269399,0.1536043,0.002093337,0.00001914428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08559157,0.0001821022,0.9043148,0.0003548431,0.00006826697,0.00006622243,0.00008584575,0.0008370389,0.008499382],"genre_scores_gemma":[0.7462302,0.0002474636,0.239808,0.0003777538,0.0000486069,0.0004588129,0.0002650867,0.0004514733,0.01211253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005157925,"threshold_uncertainty_score":0.01725495,"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","authors":[{"name":"Massimo Lauria","is_ca":false},{"name":"Jakob Nordstr”öm","is_ca":false},{"name":"Noga Ron‐Zewi","is_ca":false},{"name":"Neil Thapen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004116582,0.001471601,0.00176562,0.00256935,0.003221375,0.007658117,0.00375454,0.002046124,0.01821668],"category_scores_gemma":[0.028257,0.0009585388,0.004355104,0.003340796,0.006491833,0.02184156,0.008527018,0.01116402,0.002280165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006206783,"about_ca_system_score_gemma":0.00311206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004269661,"about_ca_topic_score_gemma":0.003117236,"domain_scores_codex":[0.9873325,0.002389636,0.0006399046,0.002668917,0.004733777,0.002235312],"domain_scores_gemma":[0.9532098,0.0369413,0.001458735,0.004659473,0.002644832,0.001085866],"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.0001622682,0.00006229991,0.0009331152,0.0004133343,0.00006558342,0.0001357002,0.0006916807,0.009641955,0.001985863,0.9583592,0.007244242,0.0203048],"study_design_scores_gemma":[0.00003401198,0.0000369742,0.0004632821,0.00005076846,0.00005999869,0.0001314664,0.00008427445,0.03049352,0.001520352,0.9564933,0.01060455,0.00002750487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1465148,0.008963033,0.676444,0.01926684,0.0008420949,0.0003647553,0.002493935,0.002726265,0.1423843],"genre_scores_gemma":[0.8182555,0.004917121,0.1452169,0.003187191,0.001950743,0.0006399446,0.002013058,0.00136448,0.02245508],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01821668,"threshold_uncertainty_score":0.0609408,"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","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"Kaave Hosseini","is_ca":true},{"name":"Shachar Lovett","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002316997,0.0007434198,0.00107658,0.001496482,0.002252049,0.004731822,0.002190665,0.002552325,0.01096439],"category_scores_gemma":[0.01114474,0.001044895,0.001386906,0.001495316,0.003119675,0.01004496,0.005525108,0.004575523,0.002175184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002692099,"about_ca_system_score_gemma":0.002137491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005648438,"about_ca_topic_score_gemma":0.0005726489,"domain_scores_codex":[0.9961464,0.001035072,0.0002704077,0.0008053989,0.001138898,0.0006037831],"domain_scores_gemma":[0.9892673,0.005868522,0.001118896,0.002201718,0.0009947405,0.0005487779],"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.000065623,0.00003207969,0.0001449805,0.00004119079,0.000009520862,0.00006484753,0.0001865308,0.004054985,0.0009863239,0.9885098,0.0009802985,0.004923836],"study_design_scores_gemma":[0.00003022542,0.00002778914,0.00008041208,0.00001649528,0.00001262409,0.00005222518,0.00003469134,0.02872266,0.001218112,0.9672624,0.002527675,0.00001472677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1574094,0.0005844047,0.77714,0.003975159,0.0002217515,0.0005157467,0.001293269,0.001246886,0.0576134],"genre_scores_gemma":[0.8605996,0.000683459,0.1041467,0.000833749,0.0003030383,0.00112051,0.001334264,0.0004060496,0.03057256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01096439,"threshold_uncertainty_score":0.03667957,"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)","authors":[{"name":"Timothy M. Chan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007925063,0.0009168224,0.0009179198,0.001567359,0.0008829003,0.001578563,0.002267733,0.001322295,0.009314627],"category_scores_gemma":[0.009555043,0.0007063585,0.0009405324,0.003337778,0.001563464,0.006250123,0.004300505,0.001735119,0.001227128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001177129,"about_ca_system_score_gemma":0.0008443169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00170734,"about_ca_topic_score_gemma":0.002071771,"domain_scores_codex":[0.9985687,0.0003315006,0.00006895976,0.0004225917,0.0004597749,0.0001485954],"domain_scores_gemma":[0.9950827,0.002661079,0.0003873917,0.001317626,0.0004153507,0.0001358245],"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.0003670877,0.0001633924,0.003259654,0.0007008968,0.00007319445,0.0003924651,0.0004390352,0.2524747,0.01046912,0.3731921,0.03016942,0.328299],"study_design_scores_gemma":[0.00007318158,0.000128832,0.000699868,0.00005204175,0.00004250389,0.00055176,0.0001598355,0.5624282,0.006795624,0.3961542,0.03287843,0.00003542774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04267306,0.0008980338,0.9375343,0.00236674,0.0001267137,0.0002251311,0.0007927977,0.001804192,0.01357892],"genre_scores_gemma":[0.4899031,0.00127427,0.4957373,0.0007452141,0.0004803995,0.0006413403,0.002672112,0.0005784868,0.007967795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009314627,"threshold_uncertainty_score":0.03116053,"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","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Mihai Ptraşcu","is_ca":false},{"name":"Liam Roditty","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264891,0.0009686208,0.001034501,0.002155607,0.001631288,0.004889411,0.002302832,0.001733366,0.01147826],"category_scores_gemma":[0.01286043,0.0007532961,0.001059794,0.004374309,0.004889007,0.0227888,0.005247151,0.003522585,0.001712671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002314511,"about_ca_system_score_gemma":0.0006738642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002442686,"about_ca_topic_score_gemma":0.001753615,"domain_scores_codex":[0.9977991,0.0006200495,0.000109395,0.0006487311,0.0006359249,0.0001868216],"domain_scores_gemma":[0.9931312,0.00343341,0.0005263296,0.002098374,0.0004939851,0.0003165822],"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.00006309243,0.00002394828,0.0006955308,0.0001708572,0.00002516548,0.00008750867,0.0003576544,0.02129074,0.0009012154,0.902044,0.01259327,0.0617469],"study_design_scores_gemma":[0.000009764,0.00002877137,0.0003582966,0.00004383615,0.00001427625,0.0002379595,0.0001719569,0.03605102,0.0009024873,0.9197417,0.04241853,0.00002148892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04405372,0.01076379,0.8854778,0.01529175,0.0006884729,0.0001510993,0.001190405,0.002014231,0.04036874],"genre_scores_gemma":[0.5435597,0.01581335,0.4135932,0.002173023,0.001978334,0.0004152186,0.002865807,0.00118164,0.01841976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01147826,"threshold_uncertainty_score":0.03839856,"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","authors":[{"name":"Pu Gao","is_ca":false},{"name":"Nicholas Wormald","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001997313,0.0007345045,0.0009555685,0.001278978,0.0008098723,0.001126835,0.002785411,0.001055818,0.004262428],"category_scores_gemma":[0.01237997,0.0007757077,0.001157774,0.000921644,0.001728871,0.002254507,0.002579535,0.00178758,0.001100445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001278571,"about_ca_system_score_gemma":0.001236176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00171541,"about_ca_topic_score_gemma":0.002677398,"domain_scores_codex":[0.9981546,0.0006310419,0.00008423663,0.0005273853,0.0004078749,0.0001948149],"domain_scores_gemma":[0.9935893,0.003130263,0.0002852837,0.00211644,0.0006154559,0.0002632806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005341545,0.0001905205,0.003560222,0.0002683999,0.00009116982,0.0003068733,0.0003115061,0.4312136,0.01417063,0.4239553,0.01026858,0.1151289],"study_design_scores_gemma":[0.00004737899,0.0000351446,0.0001456018,0.000009991701,0.0000108264,0.000072355,0.00001444144,0.9247677,0.003595947,0.06947245,0.001814077,0.00001400604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01892233,0.00008696406,0.977371,0.0001419317,0.00003762197,0.0001122028,0.0001531289,0.001059419,0.002115546],"genre_scores_gemma":[0.4048966,0.0001789696,0.5874658,0.0004337519,0.00009353503,0.0007470314,0.00123818,0.0006540145,0.004292123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004262428,"threshold_uncertainty_score":0.01425922,"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","authors":[{"name":"Andrew M. Childs","is_ca":true},{"name":"Robin Kothari","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002637904,0.0006418545,0.001738177,0.0009752208,0.001610676,0.003374288,0.00292992,0.001791263,0.006519342],"category_scores_gemma":[0.02119683,0.000610227,0.001625798,0.001939957,0.002651479,0.009228634,0.003037374,0.003210663,0.0004962561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003161257,"about_ca_system_score_gemma":0.002408905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003390336,"about_ca_topic_score_gemma":0.003149214,"domain_scores_codex":[0.9961979,0.0009321015,0.0001896157,0.000851468,0.0009664309,0.0008624251],"domain_scores_gemma":[0.9633814,0.02906673,0.001647247,0.004126821,0.0009744458,0.0008033987],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002866623,0.0007113712,0.009119654,0.0008539615,0.0003118558,0.0004805618,0.0009553094,0.4459418,0.03021943,0.4063373,0.01431877,0.08788344],"study_design_scores_gemma":[0.00009873712,0.00008934987,0.0008977951,0.00001608366,0.00005556713,0.0001698792,0.0001354223,0.7098543,0.005019478,0.2822795,0.001354997,0.00002892831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5206147,0.0008327825,0.4548161,0.004973812,0.0001156643,0.0003963701,0.002184413,0.0016501,0.01441597],"genre_scores_gemma":[0.9454917,0.0003619976,0.05004472,0.0003394215,0.0001058102,0.0001756094,0.001178284,0.0002334546,0.002068944],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006519342,"threshold_uncertainty_score":0.02293658,"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","authors":[{"name":"Gonzalo Navarro","is_ca":false},{"name":"Yakov Nekrich","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008279581,0.001183005,0.002416801,0.002515289,0.001440242,0.002955682,0.004031243,0.001942966,0.01118102],"category_scores_gemma":[0.00666286,0.0007977696,0.001325869,0.006237847,0.001129389,0.005704484,0.003524112,0.001074625,0.01052179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00205427,"about_ca_system_score_gemma":0.003656464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005104262,"about_ca_topic_score_gemma":0.01084121,"domain_scores_codex":[0.9972344,0.0004503166,0.0003538548,0.0006487589,0.0007992956,0.0005132531],"domain_scores_gemma":[0.9974782,0.000675727,0.0002186496,0.00114661,0.0003534091,0.000127404],"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.001481051,0.0005192343,0.001564439,0.0009905099,0.0001451284,0.0002689969,0.0003738076,0.04566884,0.03795458,0.02711043,0.06880992,0.8151129],"study_design_scores_gemma":[0.0008470632,0.0006193835,0.002214639,0.0001163491,0.0003032741,0.00181567,0.0006256372,0.7516649,0.04832724,0.1593085,0.03394513,0.000212189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09880214,0.006681086,0.83731,0.002045394,0.000582475,0.0004807012,0.00652739,0.02485352,0.0227173],"genre_scores_gemma":[0.301198,0.001240232,0.6716886,0.000605672,0.0004271424,0.0003329786,0.009778399,0.001039488,0.01368939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01118102,"threshold_uncertainty_score":0.03740424,"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","authors":[{"name":"Hervé Brönnimann","is_ca":false},{"name":"Olivier Devillers","is_ca":false},{"name":"Vida Dujmović","is_ca":false},{"name":"Hazel Everett","is_ca":false},{"name":"Marc Glisse","is_ca":false},{"name":"Xavier Goaoc","is_ca":false},{"name":"Sylvain Lazard","is_ca":false},{"name":"Hyeon-Suk Na","is_ca":false},{"name":"Sue Whitesides","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003339219,0.0006506159,0.0009386207,0.001279568,0.001147653,0.002707544,0.001889279,0.001091182,0.004545745],"category_scores_gemma":[0.004121044,0.0009468871,0.001476573,0.002178374,0.001511117,0.004044714,0.00202385,0.001522993,0.0004971294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001023138,"about_ca_system_score_gemma":0.0005010024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004846794,"about_ca_topic_score_gemma":0.005453473,"domain_scores_codex":[0.9987732,0.0001802507,0.00007994993,0.0003075091,0.0004048735,0.0002543252],"domain_scores_gemma":[0.9970893,0.001347296,0.0005089528,0.0006249519,0.000215837,0.0002136037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001224281,0.0004482985,0.02012176,0.0008017331,0.000268802,0.001433097,0.001954278,0.5936573,0.05307011,0.1667525,0.006483456,0.1537843],"study_design_scores_gemma":[0.00007105953,0.0001275351,0.004340559,0.00005279387,0.00004697017,0.0004340045,0.0006337464,0.8950104,0.01957421,0.07582018,0.003842179,0.00004642614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5927062,0.0002230905,0.3994292,0.000287207,0.00001511646,0.0001367601,0.001350716,0.001235935,0.004615654],"genre_scores_gemma":[0.7292253,0.0002173009,0.263747,0.00005230578,0.00001627663,0.0001015392,0.004600195,0.00026366,0.001776388],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004846794,"threshold_uncertainty_score":0.01520705,"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","authors":[{"name":"Peter Bürgisser","is_ca":false},{"name":"Felipe Cucker","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009790722,0.0007369586,0.0007124137,0.002491046,0.001424333,0.00525387,0.001642301,0.0009561085,0.005935541],"category_scores_gemma":[0.005141343,0.000373401,0.001475703,0.002871377,0.003553855,0.008290591,0.002481361,0.00346055,0.0005638263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004729273,"about_ca_system_score_gemma":0.0009563294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0010256,"about_ca_topic_score_gemma":0.0007942099,"domain_scores_codex":[0.9984238,0.0001959402,0.0001106787,0.0003615273,0.0006333642,0.0002747793],"domain_scores_gemma":[0.9948387,0.002538666,0.0006936411,0.0009806276,0.0005423116,0.0004060298],"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.00003839201,0.00003520295,0.0007988144,0.00005931471,0.000007775138,0.00002379512,0.0001778716,0.004128172,0.001161387,0.9831215,0.0008309089,0.009616951],"study_design_scores_gemma":[0.00001173197,0.00002573721,0.0008948093,0.00002465584,0.00001360548,0.00009860138,0.0000949296,0.0530652,0.003837056,0.937092,0.004817506,0.00002411443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4190437,0.001025143,0.5236399,0.002139302,0.0001265942,0.000184068,0.0009988266,0.0005700539,0.05227245],"genre_scores_gemma":[0.9305844,0.0003581787,0.05964604,0.0002485783,0.0002245637,0.000258665,0.0007468959,0.00009926983,0.007833388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005935541,"threshold_uncertainty_score":0.03431344,"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","authors":[{"name":"Timothy M. Chan","is_ca":false},{"name":"Yakov Nekrich","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008891192,0.0009012393,0.001381212,0.001550301,0.0008174637,0.001787698,0.004032367,0.001502615,0.007887103],"category_scores_gemma":[0.005760623,0.001025973,0.001175334,0.002338094,0.001557231,0.004100597,0.005809289,0.002836309,0.004711077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00130566,"about_ca_system_score_gemma":0.001971732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004233654,"about_ca_topic_score_gemma":0.005605157,"domain_scores_codex":[0.9983279,0.0002153626,0.0001110734,0.0003657119,0.000828105,0.0001519363],"domain_scores_gemma":[0.9979742,0.0005307717,0.0001383867,0.0008694997,0.0003788457,0.0001083278],"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.000617408,0.0002845035,0.001710058,0.0004480091,0.0000912301,0.0001019558,0.0003716768,0.2280152,0.02003614,0.1782299,0.02299111,0.5471028],"study_design_scores_gemma":[0.0001159215,0.00007937819,0.0001895708,0.00002654554,0.00001736227,0.00007852212,0.00007212497,0.8960789,0.005087357,0.08413285,0.01408852,0.00003284032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004431198,0.0001176272,0.9917425,0.0001809943,0.00003376165,0.00003866077,0.0002126304,0.001932834,0.001309702],"genre_scores_gemma":[0.06491042,0.000151813,0.9304887,0.0001449032,0.00005518422,0.0002160092,0.0009780304,0.0005694896,0.002485462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007887103,"threshold_uncertainty_score":0.02638495,"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","authors":[{"name":"Mark McCann","is_ca":false},{"name":"Nicholas Pippenger","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001301231,0.0003750349,0.0004767801,0.001294282,0.0007582407,0.002087839,0.0006860044,0.0008584461,0.004160454],"category_scores_gemma":[0.00678826,0.0002680825,0.000591321,0.001075145,0.002165556,0.003972192,0.001969313,0.0016085,0.0007472297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001446654,"about_ca_system_score_gemma":0.0006446437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006837831,"about_ca_topic_score_gemma":0.0005500742,"domain_scores_codex":[0.9989451,0.0002991493,0.00008129105,0.0002095006,0.0003736615,0.00009126654],"domain_scores_gemma":[0.9979795,0.001178467,0.0001949849,0.0002798771,0.0002490345,0.0001181823],"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.00001203569,0.000007000618,0.0002323313,0.00002509099,0.000006819094,0.00002135383,0.0001000389,0.01925725,0.0004985593,0.9560563,0.0006374425,0.02314595],"study_design_scores_gemma":[0.00001115677,0.00001306473,0.0001231693,0.00001267218,0.000003623614,0.00005170368,0.00002645068,0.1836288,0.0006222705,0.8091263,0.006370844,0.000009962406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04354197,0.001364687,0.9321972,0.0009507447,0.0001666429,0.00007556609,0.00008878567,0.0002804308,0.02133395],"genre_scores_gemma":[0.62673,0.00180462,0.3533168,0.0003277958,0.0004388994,0.0002871859,0.0002657513,0.0001694112,0.01665949],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004160454,"threshold_uncertainty_score":0.01391816,"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","authors":[{"name":"Alessandro Chiesa","is_ca":false},{"name":"Tom Gur","is_ca":false},{"name":"Igor Shinkar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001563631,0.001351495,0.001496932,0.0007275715,0.0009172431,0.002149764,0.002645972,0.001605721,0.00408992],"category_scores_gemma":[0.01595453,0.0006040306,0.001108144,0.001829102,0.002287071,0.004109935,0.003935632,0.004401632,0.001744505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002742323,"about_ca_system_score_gemma":0.004473605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004835597,"about_ca_topic_score_gemma":0.005797877,"domain_scores_codex":[0.9957746,0.0006898616,0.0002679534,0.0008632647,0.001615348,0.000789049],"domain_scores_gemma":[0.9848995,0.007076781,0.001218637,0.004414642,0.001902304,0.0004881705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001942152,0.0003214199,0.002577741,0.0008453699,0.0001318296,0.0005460323,0.001042345,0.4719072,0.04521083,0.3532591,0.01541872,0.1067973],"study_design_scores_gemma":[0.000273482,0.0004231335,0.0004673967,0.0001051782,0.00007965363,0.0004505517,0.000163718,0.7779727,0.02287198,0.1890453,0.008026944,0.000119922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1604757,0.001755287,0.8142276,0.002021327,0.0001924906,0.0005352085,0.002159212,0.00289872,0.01573442],"genre_scores_gemma":[0.6613343,0.001052005,0.3219821,0.00114717,0.0001710509,0.0007508646,0.00269825,0.0005881055,0.01027612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004835597,"threshold_uncertainty_score":0.01989704,"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","authors":[{"name":"Lap Chi Lau","is_ca":false},{"name":"Hong Zhou","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02254958,0.002465859,0.002133354,0.002283611,0.000898547,0.002639905,0.004230788,0.002222145,0.009631278],"category_scores_gemma":[0.04098099,0.001568296,0.002092044,0.002170081,0.003927259,0.003165514,0.003610096,0.004870099,0.001630865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003069919,"about_ca_system_score_gemma":0.003548749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001058342,"about_ca_topic_score_gemma":0.00105722,"domain_scores_codex":[0.9835083,0.01225367,0.0005446033,0.001622556,0.001657595,0.0004133044],"domain_scores_gemma":[0.9670959,0.02558031,0.002058833,0.003402702,0.001359053,0.0005032789],"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.0001626974,0.0001425607,0.0003276312,0.000280567,0.0001257964,0.0000835637,0.0001085213,0.3567905,0.002276733,0.5876908,0.001488018,0.05052262],"study_design_scores_gemma":[0.0001731478,0.0002947316,0.0001025208,0.00007038204,0.00005010487,0.00005686447,0.00002897711,0.6208755,0.001485295,0.3691227,0.007707526,0.00003224126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002715962,0.00005127264,0.9986456,0.00005749074,0.00001110939,0.00006842212,0.00001761188,0.0000715316,0.0008054189],"genre_scores_gemma":[0.04623117,0.0002213871,0.9495111,0.0002602398,0.00006248061,0.001870199,0.00008850549,0.0001186019,0.001636362],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02254958,"threshold_uncertainty_score":0.1192549,"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","authors":[{"name":"Vijay Bhattiprolu","is_ca":true},{"name":"Mrinal K. Ghosh","is_ca":false},{"name":"Venkatesan Guruswami","is_ca":false},{"name":"Euiwoong Lee","is_ca":false},{"name":"Madhur Tulsiani","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004160213,0.002084447,0.001823672,0.001057286,0.001168576,0.004769187,0.003411282,0.003051091,0.0065402],"category_scores_gemma":[0.02940404,0.0006571618,0.001375106,0.00196046,0.003605415,0.007245073,0.003431131,0.00510782,0.00211855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002291859,"about_ca_system_score_gemma":0.002134882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001817432,"about_ca_topic_score_gemma":0.001523477,"domain_scores_codex":[0.9946786,0.001966302,0.00023268,0.001299924,0.001121613,0.0007009217],"domain_scores_gemma":[0.9720044,0.02224715,0.001808231,0.001480895,0.00156407,0.0008952679],"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.001319012,0.0005809544,0.002790845,0.001348547,0.000259856,0.0003349877,0.0006707001,0.2295961,0.004077408,0.6140524,0.04128568,0.1036836],"study_design_scores_gemma":[0.0001037614,0.0001619204,0.0002146177,0.00007571704,0.00003144596,0.0001834938,0.000127915,0.4369791,0.002735192,0.5564162,0.002938817,0.00003184022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.268516,0.006836442,0.6663095,0.01285404,0.0009994693,0.0002838914,0.002594655,0.002481051,0.03912494],"genre_scores_gemma":[0.8167973,0.00190942,0.1568065,0.002151808,0.001304819,0.0004867377,0.003402153,0.0007209141,0.01642041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0065402,"threshold_uncertainty_score":0.02200156,"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","authors":[{"name":"Nicholas J. A. Harvey","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002601706,0.001392282,0.001366529,0.001986297,0.002022164,0.00521943,0.004403596,0.002284169,0.01260582],"category_scores_gemma":[0.01558068,0.0008309532,0.002128229,0.004436395,0.003335326,0.01465491,0.005701094,0.005853811,0.003255917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002845425,"about_ca_system_score_gemma":0.002555684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001188722,"about_ca_topic_score_gemma":0.001780525,"domain_scores_codex":[0.9936231,0.001797487,0.0004685923,0.00144213,0.002165708,0.0005029688],"domain_scores_gemma":[0.9904492,0.005180854,0.0008457548,0.002413563,0.0007797063,0.0003308333],"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.00009948654,0.0002383101,0.000290811,0.0004428412,0.00006046785,0.00003879391,0.0001844362,0.02181992,0.001541637,0.8285425,0.007486299,0.1392544],"study_design_scores_gemma":[0.00007520257,0.0000482628,0.0001034299,0.00004051639,0.00002901984,0.000131076,0.00008792524,0.1033316,0.001602662,0.8769279,0.01759239,0.00003007938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006312417,0.000989981,0.9745786,0.001778998,0.0001840567,0.0001944401,0.0001708902,0.0007764049,0.0150143],"genre_scores_gemma":[0.1309593,0.002230383,0.8549404,0.0007920614,0.0007959444,0.0006363788,0.000983419,0.0003532871,0.008308799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01260582,"threshold_uncertainty_score":0.04217064,"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","authors":[{"name":"Maria Chudnovsky","is_ca":false},{"name":"Sophie Spirkl","is_ca":true},{"name":"Mingxian Zhong","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004018402,0.0005514217,0.0005869446,0.0006061699,0.00127928,0.001153858,0.001203951,0.0004965367,0.00759371],"category_scores_gemma":[0.001184112,0.0005403435,0.0006947847,0.0009622983,0.0008396956,0.002571107,0.001761856,0.001701388,0.001204402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001002543,"about_ca_system_score_gemma":0.000584439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001342575,"about_ca_topic_score_gemma":0.00286941,"domain_scores_codex":[0.9995116,0.00007340775,0.0000221912,0.0001549551,0.00009755461,0.0001403287],"domain_scores_gemma":[0.9985623,0.0005248152,0.0002138717,0.000394765,0.0001381791,0.0001659926],"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.001477322,0.0004875445,0.01077516,0.001114953,0.0001445417,0.001294878,0.0009049381,0.06185989,0.08664287,0.486944,0.05598139,0.2923725],"study_design_scores_gemma":[0.00008934075,0.0002226241,0.004455786,0.00007775083,0.00008916073,0.001261309,0.0003642658,0.08960989,0.06614546,0.7531266,0.08447861,0.00007922478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5072616,0.0007149943,0.4334722,0.002217349,0.0002340969,0.000280651,0.002410244,0.002139517,0.05126934],"genre_scores_gemma":[0.6607971,0.0005191792,0.296409,0.0007001156,0.0001203776,0.0001797613,0.004715343,0.0007487249,0.03581044],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00759371,"threshold_uncertainty_score":0.0254035,"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","authors":[{"name":"Sergio Cabello","is_ca":false},{"name":"Bojan Mohar","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119127,0.001200248,0.001411475,0.0009152422,0.001520028,0.003724716,0.002756028,0.002525947,0.007593976],"category_scores_gemma":[0.011874,0.001496397,0.002078803,0.001877356,0.0031583,0.009729946,0.00394185,0.006701498,0.001150829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001426356,"about_ca_system_score_gemma":0.001152771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001287036,"about_ca_topic_score_gemma":0.001873087,"domain_scores_codex":[0.9978549,0.0003826412,0.000118033,0.0008226055,0.000473358,0.000348504],"domain_scores_gemma":[0.9809994,0.01435288,0.001291581,0.002179082,0.0006302303,0.000546944],"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.001250339,0.0006425494,0.007276692,0.001713863,0.0002441998,0.001381965,0.0008652089,0.3788846,0.02645474,0.4116366,0.02991775,0.1397315],"study_design_scores_gemma":[0.0001536454,0.0001510904,0.001733275,0.00009973938,0.0001462634,0.001243296,0.0003749638,0.2044404,0.01333213,0.764908,0.01333807,0.00007914149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4953814,0.001202197,0.4453893,0.01012257,0.00029791,0.0002048302,0.001883349,0.001996172,0.04352232],"genre_scores_gemma":[0.8100084,0.001871037,0.173485,0.001132605,0.0003308014,0.0001865521,0.003231297,0.000498127,0.009256202],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007593976,"threshold_uncertainty_score":0.02540445,"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","authors":[{"name":"Felipe Cucker","is_ca":true},{"name":"Dima Grigoriev","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001242324,0.0006264222,0.001603737,0.0005697811,0.002447446,0.004042909,0.002187574,0.001773961,0.01016408],"category_scores_gemma":[0.01485484,0.0008378509,0.001058832,0.000767045,0.003187475,0.008442449,0.003865858,0.004722424,0.001480268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008447857,"about_ca_system_score_gemma":0.0006746025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004060806,"about_ca_topic_score_gemma":0.0007258069,"domain_scores_codex":[0.9980673,0.0003878846,0.0001068079,0.0006402312,0.000459043,0.0003387672],"domain_scores_gemma":[0.9800051,0.0154122,0.001205479,0.001601125,0.0008894997,0.0008864924],"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.00117671,0.0004239648,0.006392154,0.001741097,0.0002893231,0.001123807,0.001186513,0.02526706,0.01755058,0.8396181,0.02689252,0.07833812],"study_design_scores_gemma":[0.00008491971,0.00009045839,0.0009884977,0.00005954154,0.00005461312,0.0006962515,0.0005913142,0.03411468,0.006539025,0.9453931,0.01135876,0.00002873384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5803302,0.001372804,0.3186113,0.01432251,0.0005173804,0.0002445113,0.00185562,0.001065196,0.08168045],"genre_scores_gemma":[0.9179618,0.0006503258,0.06056814,0.002276183,0.0004036255,0.000386085,0.002138031,0.0002420773,0.01537369],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01016408,"threshold_uncertainty_score":0.03400224,"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","authors":[{"name":"Dan Alistarh","is_ca":false},{"name":"James Aspnes","is_ca":false},{"name":"Faith Ellen","is_ca":true},{"name":"Rati Gelashvili","is_ca":false},{"name":"Leqi Zhu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03777941,0.001118518,0.001337079,0.001846216,0.002759582,0.006436178,0.004049806,0.004891151,0.007123425],"category_scores_gemma":[0.1514205,0.001708934,0.002182655,0.00126498,0.01370952,0.03081848,0.00942908,0.00892132,0.003058121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001802282,"about_ca_system_score_gemma":0.002423685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004986005,"about_ca_topic_score_gemma":0.0002647609,"domain_scores_codex":[0.9622871,0.01933707,0.002283643,0.003924287,0.009802197,0.002365739],"domain_scores_gemma":[0.7606702,0.1887509,0.007008441,0.02824485,0.01311759,0.002207986],"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.00008750879,0.00003468265,0.0005601313,0.0003156047,0.00004652267,0.0003587137,0.0008382339,0.004822691,0.0006132994,0.9657509,0.004524637,0.0220471],"study_design_scores_gemma":[0.00004517311,0.00002622322,0.00005309592,0.00009210622,0.00001364714,0.0002814325,0.0000811911,0.00672414,0.001039186,0.9795088,0.01210649,0.00002848777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03774154,0.006124096,0.8882785,0.02845831,0.001415968,0.0002135385,0.0002230714,0.002126112,0.03541883],"genre_scores_gemma":[0.7555327,0.004357979,0.2234615,0.005576314,0.001354776,0.0005495739,0.0003341437,0.001058222,0.007774689],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03777941,"threshold_uncertainty_score":0.199799,"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","authors":[{"name":"Kaspars Balodis","is_ca":false},{"name":"Shalev Ben-David","is_ca":true},{"name":"Mika Göös","is_ca":false},{"name":"Siddhartha Jain","is_ca":false},{"name":"Robin Kothari","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002167038,0.0008625527,0.0009562132,0.001309969,0.001803351,0.002964803,0.00251769,0.001572167,0.009655081],"category_scores_gemma":[0.0125632,0.0006836382,0.001768962,0.001811308,0.003163907,0.012699,0.004225542,0.005075205,0.001280375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003101939,"about_ca_system_score_gemma":0.001882048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00548437,"about_ca_topic_score_gemma":0.007577416,"domain_scores_codex":[0.9970944,0.0005484389,0.0001848338,0.000792002,0.0008255192,0.0005547911],"domain_scores_gemma":[0.9938898,0.00361356,0.0003570093,0.00118627,0.0006326244,0.0003207486],"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.0003703185,0.0001418011,0.0008832301,0.0002061571,0.00003570035,0.0002566639,0.0003003642,0.01684026,0.004529745,0.9255131,0.00697278,0.04394986],"study_design_scores_gemma":[0.00004960799,0.00004305949,0.0001970914,0.00002492447,0.00002932054,0.0001104431,0.0001007944,0.05033617,0.003294366,0.9388625,0.006923087,0.00002863614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1988812,0.001042774,0.7199123,0.009120461,0.0006827874,0.00017787,0.0008208747,0.001867213,0.06749447],"genre_scores_gemma":[0.7301064,0.0006981817,0.2389783,0.002225055,0.0004188001,0.0002214396,0.0007487282,0.0006048866,0.02599831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009655081,"threshold_uncertainty_score":0.03229946,"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","authors":[{"name":"Shalev Ben-David","is_ca":true},{"name":"Andrew M. Childs","is_ca":false},{"name":"András Gilyén","is_ca":false},{"name":"William Kretschmer","is_ca":false},{"name":"Supartha Podder","is_ca":false},{"name":"Daochen Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002537318,0.0006085293,0.0009641887,0.0006175284,0.001067859,0.002553439,0.001355103,0.001491539,0.008250561],"category_scores_gemma":[0.01351079,0.0005126975,0.001109336,0.0008143069,0.003623274,0.009169119,0.00209789,0.00298697,0.0007220384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001886796,"about_ca_system_score_gemma":0.001644535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009900536,"about_ca_topic_score_gemma":0.00104763,"domain_scores_codex":[0.9980173,0.0004893013,0.00007596845,0.0003908504,0.0005593205,0.000467169],"domain_scores_gemma":[0.9869319,0.00704269,0.0006938652,0.004538334,0.0004029675,0.0003902694],"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.0003984169,0.0001833766,0.001985126,0.0001519564,0.00003922312,0.0001333955,0.0001916656,0.04712149,0.01033219,0.9172089,0.00346939,0.01878486],"study_design_scores_gemma":[0.00005973705,0.00008283091,0.000645474,0.00001423775,0.00002072106,0.0001106724,0.00006691285,0.1148676,0.006094649,0.8758157,0.002201336,0.00002026034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6901619,0.0007196783,0.2623648,0.005426019,0.0001695123,0.0002028597,0.0006366664,0.001360821,0.03895769],"genre_scores_gemma":[0.9705138,0.0002044267,0.02649286,0.0002635778,0.00006759175,0.00007978074,0.0001846865,0.0001891648,0.002004103],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008250561,"threshold_uncertainty_score":0.02760088,"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","authors":[{"name":"Hernàn González-Aguilar","is_ca":false},{"name":"David Orden","is_ca":false},{"name":"Pablo Pérez-Lantero","is_ca":false},{"name":"David Rappaport","is_ca":false},{"name":"Carlos Seara","is_ca":false},{"name":"Javier Tejel","is_ca":false},{"name":"Jorge Urrutia","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000576673,0.0009080064,0.0008636412,0.000982138,0.0005199969,0.001269959,0.001097511,0.0005670827,0.007254943],"category_scores_gemma":[0.003380524,0.0005935732,0.0008550998,0.00140614,0.0006676475,0.002328808,0.001701995,0.00107933,0.001103325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000633305,"about_ca_system_score_gemma":0.0004614946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001345474,"about_ca_topic_score_gemma":0.001934109,"domain_scores_codex":[0.9992682,0.0001633341,0.00005134302,0.0001985751,0.0002244142,0.00009410003],"domain_scores_gemma":[0.9990227,0.000441834,0.0001065586,0.0002428221,0.0001220533,0.00006396757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005566749,0.000122836,0.002632393,0.0005381521,0.00008535128,0.0003597761,0.0004809756,0.3701314,0.01358406,0.2829782,0.0163021,0.3122281],"study_design_scores_gemma":[0.00008866197,0.0001116885,0.00119849,0.00008388888,0.00002679522,0.0002959113,0.0002092035,0.7603098,0.008722357,0.2001317,0.02879609,0.00002536059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1068017,0.0008082006,0.8572748,0.0007088232,0.00009318701,0.0002228114,0.001397802,0.000800119,0.03189253],"genre_scores_gemma":[0.3736022,0.0007756485,0.604943,0.0001541904,0.00009079312,0.0002862953,0.002961306,0.0002905219,0.0168961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007254943,"threshold_uncertainty_score":0.02427018,"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","authors":[{"name":"Lap Chi Lau","is_ca":true},{"name":"Hong Zhou","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002002808,0.001210538,0.0007725503,0.001055412,0.0008843977,0.001972455,0.001663061,0.001261608,0.007159538],"category_scores_gemma":[0.007471513,0.0006683325,0.001071747,0.001195561,0.001995082,0.00296644,0.002047194,0.003258583,0.001301327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001597842,"about_ca_system_score_gemma":0.001311695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001006335,"about_ca_topic_score_gemma":0.001390706,"domain_scores_codex":[0.9978256,0.0009911377,0.00008346434,0.0003268092,0.0006480134,0.0001249023],"domain_scores_gemma":[0.9969987,0.001711667,0.0001858368,0.0005968423,0.0004021239,0.0001048714],"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.0000365707,0.00005554494,0.0001518248,0.0001338009,0.0000286888,0.00004417508,0.00008134655,0.3324035,0.002216013,0.6109193,0.002437618,0.05149168],"study_design_scores_gemma":[0.00001272367,0.00004307046,0.00003469705,0.00003126914,0.000009910845,0.00005170944,0.00002610851,0.6576362,0.001124113,0.3328156,0.008203065,0.00001157856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008688851,0.0001166172,0.9949471,0.0001763817,0.00003406004,0.00001799283,0.00001751783,0.00005380785,0.003767545],"genre_scores_gemma":[0.1736429,0.001092894,0.8169023,0.0005174836,0.0002184901,0.0003053543,0.0001261883,0.0001536256,0.007040726],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007159538,"threshold_uncertainty_score":0.02395099,"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","authors":[{"name":"Rahul Jain","is_ca":false},{"name":"Srijita Kundu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003056772,0.001898553,0.002135792,0.002659594,0.002296282,0.004186764,0.002943894,0.002638018,0.0126646],"category_scores_gemma":[0.01108379,0.0009413083,0.002679823,0.00281585,0.00650988,0.01491987,0.005754648,0.008587418,0.002581616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002308345,"about_ca_system_score_gemma":0.001422977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009654532,"about_ca_topic_score_gemma":0.000744431,"domain_scores_codex":[0.9980464,0.0005446812,0.00009356876,0.000422051,0.0007039515,0.0001894138],"domain_scores_gemma":[0.9907534,0.006670202,0.0003030852,0.0009474652,0.001027764,0.0002981002],"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.00001072972,0.00001318962,0.00004734643,0.00003770203,0.000005930443,0.00001884159,0.00004232566,0.00115063,0.0002154449,0.9923847,0.001882788,0.004190424],"study_design_scores_gemma":[0.00000514697,0.000008918264,0.00003260648,0.000007735572,0.000004058953,0.00003661565,0.000005979604,0.008796557,0.000151013,0.9891104,0.001832246,0.000008655806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02049558,0.003847202,0.8747925,0.005828776,0.001021227,0.00009192696,0.0003547516,0.0002460997,0.09332199],"genre_scores_gemma":[0.6684186,0.008034166,0.2501213,0.003734111,0.007049774,0.0007473003,0.0007526653,0.0007715194,0.06037063],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0126646,"threshold_uncertainty_score":0.04236728,"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","authors":[{"name":"Sébastien Bubeck","is_ca":false},{"name":"Dan Mikulincer","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001459726,0.0008877326,0.001153196,0.0007395599,0.001327623,0.00166559,0.001705498,0.002658822,0.008057935],"category_scores_gemma":[0.00871332,0.0007318608,0.001065213,0.0006139278,0.00199966,0.004154298,0.002571409,0.002511137,0.001993188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001117554,"about_ca_system_score_gemma":0.001632027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003208218,"about_ca_topic_score_gemma":0.001771969,"domain_scores_codex":[0.9992542,0.0001738716,0.00003924571,0.0001885338,0.0001666845,0.0001775974],"domain_scores_gemma":[0.9976674,0.001436824,0.0001686267,0.000325881,0.0002123221,0.0001889654],"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.0009548159,0.0004025338,0.004066353,0.0006099724,0.0001660173,0.0007153588,0.0007933792,0.3266312,0.0125577,0.4190567,0.03194681,0.2020991],"study_design_scores_gemma":[0.00008057283,0.0001468339,0.0002362742,0.00005530596,0.00002689173,0.0002105699,0.0001148655,0.8397905,0.004143529,0.147719,0.007435645,0.00003999222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07398745,0.0009144036,0.904855,0.004495981,0.0003031709,0.0002268714,0.0003753671,0.003033718,0.01180808],"genre_scores_gemma":[0.530827,0.0005539666,0.4517328,0.001527885,0.000138394,0.0003248303,0.0006926425,0.0006393845,0.01356309],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008057935,"threshold_uncertainty_score":0.02695644,"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","authors":[{"name":"Sébastien Bouchard","is_ca":true},{"name":"Yoann Dieudonné","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001766372,0.0004828856,0.0006906652,0.0004019983,0.002363406,0.002599895,0.0009938986,0.003842301,0.02954566],"category_scores_gemma":[0.01097568,0.0005603312,0.000461451,0.0005254774,0.00337937,0.01058887,0.002658278,0.003712854,0.01101323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005869527,"about_ca_system_score_gemma":0.0005364799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001184934,"about_ca_topic_score_gemma":0.001702496,"domain_scores_codex":[0.998771,0.0005504197,0.00004027951,0.0002958464,0.0001632419,0.0001792038],"domain_scores_gemma":[0.9953066,0.00264403,0.0003636345,0.00052072,0.00043043,0.0007345318],"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.0006963936,0.0002727556,0.005980588,0.001130225,0.0001012969,0.001120459,0.007717462,0.001886592,0.005264759,0.5554923,0.2665524,0.1537848],"study_design_scores_gemma":[0.00007748051,0.0001564597,0.003122856,0.000332109,0.00005488226,0.001767564,0.01180027,0.007029647,0.00178457,0.6693459,0.3044071,0.0001211782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.09047997,0.008439689,0.141959,0.4551433,0.00573894,0.0001525264,0.001055719,0.00125563,0.2957753],"genre_scores_gemma":[0.6848326,0.005316182,0.05620365,0.03208538,0.002330519,0.0002668564,0.00100316,0.0006141231,0.2173476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02954566,"threshold_uncertainty_score":0.09884012,"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","authors":[{"name":"Nikhil Kumar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001199872,0.0008318441,0.001298665,0.001762955,0.001227063,0.0016156,0.002025534,0.001271856,0.01045575],"category_scores_gemma":[0.007957996,0.0003877642,0.001440265,0.001567018,0.001609149,0.004354007,0.004144051,0.002532633,0.001822754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007745702,"about_ca_system_score_gemma":0.0008967684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002206284,"about_ca_topic_score_gemma":0.002453971,"domain_scores_codex":[0.9991845,0.0001749411,0.00003746663,0.0001820657,0.0003017503,0.0001192176],"domain_scores_gemma":[0.9982743,0.0007877952,0.0001072816,0.0003647755,0.0003465131,0.0001193734],"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.0001493426,0.00008148168,0.001083422,0.0002834951,0.00006970089,0.0002429849,0.0002537838,0.02647422,0.005407229,0.8866138,0.01195166,0.06738881],"study_design_scores_gemma":[0.00002821196,0.00006796156,0.0009670396,0.00004436883,0.00004495712,0.0002971353,0.00009082266,0.2824399,0.002096297,0.6954868,0.01839758,0.00003891049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04380096,0.001979332,0.8724708,0.002263139,0.001388613,0.0001096146,0.0004104051,0.0003318143,0.07724529],"genre_scores_gemma":[0.665766,0.002896351,0.2648249,0.001843356,0.001500365,0.0002794981,0.0008447096,0.0008152705,0.06122957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01045575,"threshold_uncertainty_score":0.03497797,"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","authors":[{"name":"Tsz Chiu Kwok","is_ca":false},{"name":"Lap Chi Lau","is_ca":true},{"name":"Kam Chuen Tung","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004020444,0.002384928,0.001785495,0.004375524,0.001436907,0.003562692,0.0041361,0.002795789,0.01778377],"category_scores_gemma":[0.02038225,0.0009351698,0.001889248,0.003136523,0.004469154,0.0101551,0.003826415,0.008127026,0.002746069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002499392,"about_ca_system_score_gemma":0.001037701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002233363,"about_ca_topic_score_gemma":0.002746326,"domain_scores_codex":[0.9979006,0.0007849862,0.00008680118,0.0003917372,0.00049583,0.0003399548],"domain_scores_gemma":[0.9893187,0.007877364,0.0004802854,0.0008679371,0.001019163,0.0004366243],"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.00005784649,0.00003550203,0.0001227866,0.0001039253,0.00002263938,0.00008338541,0.0001557551,0.01056825,0.001729764,0.9713591,0.003757597,0.0120034],"study_design_scores_gemma":[0.00001018311,0.0000102423,0.0001207719,0.00003747577,0.00001310354,0.00004947481,0.00004829766,0.08932681,0.0006004105,0.907384,0.002374707,0.0000245468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03200041,0.002498612,0.8885701,0.002710722,0.0007989369,0.00009015503,0.000416751,0.000223349,0.07269105],"genre_scores_gemma":[0.6278129,0.005507498,0.2610164,0.002641449,0.00163679,0.0006669009,0.0008040472,0.001540963,0.09837319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01778377,"threshold_uncertainty_score":0.05949259,"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","authors":[{"name":"Andreǐ A. Bulatov","is_ca":true},{"name":"Amirhossein Kazeminia","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00206758,0.001054339,0.001636177,0.00373102,0.002279033,0.007017684,0.003806685,0.00257518,0.00939039],"category_scores_gemma":[0.01885419,0.0007051572,0.001580697,0.003832454,0.003487017,0.0138784,0.002834188,0.004263841,0.0006699395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004273046,"about_ca_system_score_gemma":0.00186544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001847123,"about_ca_topic_score_gemma":0.001654169,"domain_scores_codex":[0.9970843,0.0006413494,0.0001452504,0.0008022921,0.0008054909,0.0005212522],"domain_scores_gemma":[0.9734141,0.01990915,0.00201005,0.002209959,0.0009647143,0.001492021],"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.0006319965,0.0004177339,0.009334278,0.0003554861,0.00008368833,0.0002345707,0.0008287365,0.02171833,0.00515931,0.8991276,0.01204711,0.05006125],"study_design_scores_gemma":[0.00005914997,0.0000651688,0.002057016,0.00003476929,0.00005543055,0.0002870763,0.0001574819,0.1067077,0.002209228,0.8860381,0.002293029,0.00003581084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7869602,0.00112198,0.1656968,0.006889598,0.0003293897,0.0002083798,0.001394241,0.001106152,0.03629322],"genre_scores_gemma":[0.9540845,0.0005008312,0.03327757,0.0004733413,0.0008383305,0.000136732,0.001688576,0.0002783133,0.008721873],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00939039,"threshold_uncertainty_score":0.03141397,"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":"","authors":[{"name":"Eric Blais","is_ca":true},{"name":"Cameron Seth","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003685346,0.001459752,0.001477879,0.002051994,0.001081477,0.001954865,0.003973463,0.002147921,0.008308535],"category_scores_gemma":[0.03181094,0.0009272299,0.002870176,0.0017467,0.002607218,0.0112334,0.005135307,0.002737411,0.001663528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008920783,"about_ca_system_score_gemma":0.002543168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0031076,"about_ca_topic_score_gemma":0.002917203,"domain_scores_codex":[0.9920819,0.002412141,0.0004800705,0.001958386,0.002219684,0.0008478562],"domain_scores_gemma":[0.9574347,0.01999444,0.0024498,0.01612212,0.002838433,0.001160496],"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.006259054,0.002522769,0.09929316,0.001285834,0.000962704,0.00172068,0.0008604106,0.1718523,0.06316832,0.2099381,0.04720383,0.3949329],"study_design_scores_gemma":[0.0003626464,0.001036285,0.005278906,0.0001145568,0.0002071146,0.0007070042,0.0007162181,0.7456812,0.04023356,0.1980081,0.007553286,0.0001011533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3289305,0.0002097022,0.6474687,0.001097398,0.0003087146,0.0003769825,0.002411816,0.00879916,0.01039697],"genre_scores_gemma":[0.7719459,0.0001078344,0.2204002,0.0002294328,0.0000829902,0.0003866301,0.003075639,0.001533081,0.002238305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008308535,"threshold_uncertainty_score":0.02779478,"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","authors":[{"name":"Andy Drucker","is_ca":false},{"name":"Amit Sahai","is_ca":false},{"name":"Mohit Singh","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006102966,0.003368483,0.00653841,0.004575749,0.004239872,0.01513761,0.003481769,0.004122275,0.3948813],"category_scores_gemma":[0.01900585,0.001501747,0.00254633,0.00564998,0.002266722,0.009025447,0.005452516,0.01027619,0.2651089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005524374,"about_ca_system_score_gemma":0.005430983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001860246,"about_ca_topic_score_gemma":0.003552342,"domain_scores_codex":[0.9907198,0.001797099,0.0008390245,0.002121501,0.003626545,0.0008959548],"domain_scores_gemma":[0.9815812,0.004074976,0.0009386564,0.002418381,0.00732914,0.003657669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004216293,0.00002869865,0.0001065969,0.0001617206,0.00001831666,0.00002686372,0.00001622292,0.00006633002,0.0001233196,0.001993522,0.9810501,0.01636616],"study_design_scores_gemma":[0.00004756006,0.00005970184,0.0004832212,0.0003196449,0.00002652567,0.00009952437,0.00004220199,0.0005994765,0.000127319,0.003309451,0.9948567,0.00002856658],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.00152032,0.02617709,0.01651763,0.04802402,0.7316623,0.0008819553,0.009189693,0.004438039,0.161589],"genre_scores_gemma":[0.008602785,0.0372043,0.007000912,0.02479575,0.3844043,0.001348536,0.01711609,0.005042832,0.5144845],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.3948813,"threshold_uncertainty_score":0.8631283,"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","authors":[{"name":"Joshua A. Grochow","is_ca":false},{"name":"Youming Qiao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002347345,0.0017617,0.001922654,0.00188409,0.002087648,0.003983299,0.004405863,0.002255427,0.01824338],"category_scores_gemma":[0.011727,0.0009268885,0.002557764,0.003109251,0.002259932,0.01764035,0.006870119,0.004047712,0.00408488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002763197,"about_ca_system_score_gemma":0.003567036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003616252,"about_ca_topic_score_gemma":0.005235811,"domain_scores_codex":[0.9960415,0.0007919871,0.0003044914,0.001321687,0.0007938075,0.0007466329],"domain_scores_gemma":[0.9914069,0.004742746,0.0004429972,0.002537886,0.000544105,0.0003253616],"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.0009119787,0.0007433641,0.004191107,0.0008877423,0.0001987803,0.0003377489,0.001893248,0.04018023,0.007405236,0.3647198,0.04340035,0.5351304],"study_design_scores_gemma":[0.0003335152,0.0001653606,0.0005786648,0.00007169519,0.00009092539,0.0002610955,0.0006096631,0.1747592,0.007084513,0.7959918,0.01998975,0.00006364327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08446305,0.001526224,0.8709211,0.0030983,0.0002933268,0.0005994398,0.001335919,0.0154527,0.02231008],"genre_scores_gemma":[0.4298316,0.0006151314,0.5487812,0.0007232058,0.0003054524,0.0006482073,0.005348601,0.002050238,0.01169654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01824338,"threshold_uncertainty_score":0.06103015,"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","authors":[{"name":"Faith Ellen","is_ca":true},{"name":"Rati Gelashvili","is_ca":false},{"name":"Leqi Zhu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008654919,0.002809273,0.002958194,0.003873212,0.00254775,0.006287402,0.007585611,0.003879706,0.01136228],"category_scores_gemma":[0.05898573,0.002365247,0.006055225,0.003432031,0.007998903,0.01980404,0.01370784,0.01346606,0.001724021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003145513,"about_ca_system_score_gemma":0.002667133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002060714,"about_ca_topic_score_gemma":0.002686562,"domain_scores_codex":[0.9857013,0.005736205,0.0007370745,0.001710293,0.005014528,0.001100595],"domain_scores_gemma":[0.9155422,0.0624142,0.002538882,0.01269715,0.004979995,0.001827598],"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.0002065844,0.00008952884,0.0006881256,0.0001959825,0.0001432674,0.0001629006,0.0003571534,0.05602551,0.001831577,0.9136015,0.004043922,0.02265396],"study_design_scores_gemma":[0.00002914964,0.00003704772,0.00007531933,0.00003221679,0.00005120168,0.00005254312,0.00003649732,0.1859357,0.001273497,0.8093473,0.00309957,0.00002988881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005948267,0.0002527077,0.9839797,0.00105855,0.0001491348,0.00007032734,0.000118807,0.0004668672,0.007955677],"genre_scores_gemma":[0.5428224,0.001421452,0.4310017,0.002096004,0.001754601,0.0007967729,0.0007466665,0.001340595,0.01801987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01136228,"threshold_uncertainty_score":0.04577214,"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","authors":[{"name":"Zachary Friggstad","is_ca":true},{"name":"Kamyar Khodamoradi","is_ca":true},{"name":"Mohammad R. Salavatipour","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00514006,0.00411941,0.003480199,0.003423261,0.003594494,0.0108627,0.01153312,0.005091299,0.03828036],"category_scores_gemma":[0.03737422,0.002038192,0.003692809,0.007146679,0.004213593,0.01662463,0.007509323,0.009172278,0.006556437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007616015,"about_ca_system_score_gemma":0.007833195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005680264,"about_ca_topic_score_gemma":0.0150474,"domain_scores_codex":[0.9931167,0.001530926,0.0003402503,0.001866427,0.001576849,0.001568842],"domain_scores_gemma":[0.965248,0.02356062,0.002208001,0.005030678,0.002205673,0.001746962],"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.002696066,0.001534787,0.003728815,0.001642763,0.0003874399,0.0002292911,0.0006624875,0.3244841,0.004455024,0.4223743,0.09880476,0.1390003],"study_design_scores_gemma":[0.0001825773,0.0001312182,0.0006048867,0.0001081732,0.00010768,0.0001440126,0.0001822014,0.5907785,0.002194232,0.4020477,0.003466079,0.00005265412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1616374,0.005721701,0.7044347,0.01396305,0.001474941,0.0007839609,0.007108552,0.005515757,0.09935988],"genre_scores_gemma":[0.6063517,0.001815641,0.3498165,0.002142584,0.001255666,0.0008134715,0.009270215,0.003520181,0.02501394],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03828036,"threshold_uncertainty_score":0.1280606,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}