{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":755,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":755,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"84c791073ed1","filters":{"topic":"Complexity and Algorithms in Graphs"}},"results":[{"id":"W2026036943","doi":"10.1007/s00037-004-0182-6","title":"Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds","year":2004,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":384,"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":"Mathematics; Polynomial; Arithmetic circuit complexity; Combinatorics; Nondeterministic algorithm; Discrete mathematics; Bounded function; Identity (music); Degree (music); Upper and lower bounds; Arithmetic; Arbitrary-precision arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.05471051344573013,"gpt":0.2880086850664225,"spread":0.2332981716206923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006420803,0.0003296811,0.000402633,0.0002684023,0.001035046,0.0008355961,0.001586326,0.0000882833,0.00005390993],"category_scores_gemma":[0.0001541225,0.0003623221,0.0002817445,0.0008629819,0.0003925197,0.001857955,0.0006682646,0.0003897944,0.0001280687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002959656,"about_ca_system_score_gemma":0.0004415357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002594743,"about_ca_topic_score_gemma":0.000248667,"domain_scores_codex":[0.9970379,0.0001355182,0.0005687674,0.0007825448,0.0009016008,0.0005736828],"domain_scores_gemma":[0.9983326,0.000326275,0.0002134126,0.0005777249,0.0003169045,0.0002330866],"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.0000453432,0.0004069624,0.0007183254,0.00003632054,0.00007025687,0.00006193924,0.0007050977,0.04093824,0.0001459951,0.9510143,0.000335784,0.005521367],"study_design_scores_gemma":[0.00314183,0.0000997575,0.03452035,0.00005506076,0.00001245829,0.0001286986,0.00001474195,0.08973329,0.00007094455,0.8711692,0.0005741602,0.0004794933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1038046,0.0001099379,0.8906953,0.001142936,0.001165124,0.0003394833,0.00001898069,0.000485013,0.002238702],"genre_scores_gemma":[0.8217263,0.000001422394,0.17721,0.0006852092,0.0002864938,0.00001853,0.00002821028,0.00001733624,0.00002651182],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7179217,"threshold_uncertainty_score":0.9998829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158764863","doi":"10.1098/rspa.2005.1546","title":"Quantum computing, postselection, and probabilistic polynomial-time","year":2005,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":319,"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":"Corollary; Postselection; Complexity class; Probabilistic logic; Class (philosophy); Generalization; Axiom; Mathematical proof; Quantum computer; Simple (philosophy); Intersection (aeronautics); Time complexity; Mathematics; Discrete mathematics; Polynomial; Quantum; Computation; Computer science; Algorithm; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.007382453605906405,"gpt":0.2061353419719982,"spread":0.1987528883660918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003077265,0.0001243964,0.0001903377,0.00001823798,0.000272307,0.0001637002,0.0004799211,0.00003106356,0.000001641692],"category_scores_gemma":[0.0001015573,0.00008074072,0.0000995667,0.0003682133,0.0004391152,0.0002259984,0.0003645021,0.0001327032,0.00000202772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001295622,"about_ca_system_score_gemma":0.00001219237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003248778,"about_ca_topic_score_gemma":3.192674e-8,"domain_scores_codex":[0.9990919,0.000002941341,0.0001579047,0.0002598961,0.0002590584,0.0002282708],"domain_scores_gemma":[0.9996027,0.0001496061,0.00006276702,0.00006204074,0.00004910076,0.00007381652],"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.00000237522,0.000290171,0.0001664277,0.0004885157,0.00004074193,5.956091e-8,0.005022636,0.003628354,0.007203337,0.9778962,0.001049293,0.004211878],"study_design_scores_gemma":[0.00006803747,0.00006217595,0.001108877,0.00006754471,0.000008330442,0.000006511405,0.00002884246,0.9513376,0.0006732549,0.04647502,0.00005521933,0.000108585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9868341,0.00006420531,0.01071887,0.001632446,0.00004185958,0.0001329811,7.618925e-7,0.0001184645,0.0004563029],"genre_scores_gemma":[0.9625931,0.000002014579,0.03721175,0.0000376341,0.00009901563,0.000003099525,2.633413e-8,0.000003994079,0.0000493603],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9477093,"threshold_uncertainty_score":0.3292511,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976584101","doi":"10.1145/2432622.2432628","title":"Steiner Tree Approximation via Iterative Randomized Rounding","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":280,"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":"Office of Naval Research; European Research Council; Division of Computing and Communication Foundations; Alexander von Humboldt-Stiftung; Ministerstwo Edukacji i Nauki; Fundacja na rzecz Nauki Polskiej; École Polytechnique Fédérale de Lausanne","keywords":"Steiner tree problem; Rounding; Mathematics; Combinatorics; Linear programming relaxation; Approximation algorithm; Randomized rounding; Tree (set theory); Sequence (biology); k-minimum spanning tree; Relaxation (psychology); Discrete mathematics; Minimum spanning tree; Iterative method; Mathematical optimization; Tree structure; K-ary tree; Computer science; Linear programming; Binary tree","retraction":null,"screen_n_in":null,"score":{"opus":0.01898129140375479,"gpt":0.2430249264847187,"spread":0.2240436350809639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552676,0.00007714068,0.0002413067,0.00009078709,0.0001264342,0.0002647497,0.002272824,0.00002433229,0.00002674883],"category_scores_gemma":[0.0007493601,0.0000405387,0.0002449658,0.0002337111,0.00005706665,0.000978619,0.0005068376,0.0001904717,0.00001424801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000369657,"about_ca_system_score_gemma":0.00002541047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001121029,"about_ca_topic_score_gemma":0.000001442388,"domain_scores_codex":[0.9989119,0.0002526517,0.0003451133,0.00007721304,0.0003002092,0.0001128691],"domain_scores_gemma":[0.998292,0.0004261185,0.0004243063,0.0006329257,0.0001818218,0.00004278783],"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.003056344,0.0007519087,0.0009667171,0.00008483158,0.001140727,0.00003747071,0.02403723,0.001981576,0.03161206,0.2380371,0.04390084,0.6543933],"study_design_scores_gemma":[0.02075386,0.00006653215,0.001394195,0.00009009647,0.00002788249,0.0001840824,0.00005825272,0.1912337,0.002881408,0.7826443,0.0005344231,0.0001313323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0793126,0.0001603008,0.905296,0.01250324,0.001381807,0.0002699126,1.8943e-7,0.00001749785,0.001058417],"genre_scores_gemma":[0.7514967,0.00001062635,0.2472713,0.0004447531,0.0003059731,0.000007410525,1.002266e-7,0.000004994547,0.0004580977],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6721841,"threshold_uncertainty_score":0.422351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1554407673","doi":"10.1109/sffcs.1999.814580","title":"Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":228,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Transitive closure; Amortized analysis; Combinatorics; Binary logarithm; Integer (computer science); Algorithm; Mathematics; Shortest path problem; Closure (psychology); Discrete mathematics; Data structure; Time complexity; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02292567693488149,"gpt":0.2702413490047282,"spread":0.2473156720698468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006629151,0.0002347253,0.0002723416,0.0002523496,0.0001525292,0.0001549405,0.0003979654,0.00009757341,0.00001314982],"category_scores_gemma":[0.00004751659,0.0002251132,0.0001231852,0.0005525256,0.0001183125,0.0004046407,0.00006348892,0.0002039654,0.000001888927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003741567,"about_ca_system_score_gemma":0.00007116394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000042197,"about_ca_topic_score_gemma":0.0004331252,"domain_scores_codex":[0.9982388,0.00009592699,0.0003124361,0.0006233291,0.0002039726,0.0005255493],"domain_scores_gemma":[0.9991014,0.0003172081,0.00004953484,0.00033204,0.00006582355,0.0001339737],"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.00002209592,0.0002730351,0.004668377,0.00003058894,0.00008971506,0.0001128486,0.004980342,0.0002572278,0.000277383,0.8594585,0.000127568,0.1297023],"study_design_scores_gemma":[0.002541634,0.0007393328,0.01795827,0.000091392,0.00002785396,0.0001684924,0.002239022,0.7124237,0.0004958863,0.2583556,0.003959706,0.0009991144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02877818,0.0002795683,0.9669082,0.0007433578,0.0002399657,0.0005015156,0.00001886579,0.0001654678,0.002364852],"genre_scores_gemma":[0.8058921,0.00004934439,0.1934645,0.0004258634,0.00001324132,0.00005788565,0.000007145117,0.00001334385,0.00007654362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7771139,"threshold_uncertainty_score":0.9179848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125401464","doi":"10.1287/mnsc.49.9.1268.16570","title":"A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems","year":2003,"lang":"en","type":"article","venue":"Management Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":205,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Mathematics; Integer programming; Mathematical optimization; Separable space; Linear programming; Piecewise linear function; Minification; Duality (order theory); Linear programming relaxation; Piecewise; Branch and price; Lagrangian relaxation; Relaxation (psychology); Regular polygon; Envelope (radar); Convex optimization; Strong duality; Function (biology); Applied mathematics; Discrete mathematics; Optimization problem; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.06693519417062954,"gpt":0.3225695888185658,"spread":0.2556343946479362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001101407,0.000149022,0.0002125511,0.0003380722,0.0003422745,0.0002036252,0.00135677,0.00002896253,0.000004691969],"category_scores_gemma":[0.00005235514,0.000141869,0.00007670421,0.00177187,0.0003447951,0.000902725,0.0003132528,0.00007154603,0.000005079595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004981656,"about_ca_system_score_gemma":0.00005133018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006737624,"about_ca_topic_score_gemma":0.000006251613,"domain_scores_codex":[0.9979295,0.00003590271,0.0003905418,0.0005958653,0.0005957953,0.0004523791],"domain_scores_gemma":[0.9988565,0.00006149553,0.0001984975,0.0005825211,0.0002031451,0.00009786531],"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.000004431092,0.000397269,0.0007459875,0.0001729574,0.00001593033,0.000001233415,0.0009993281,0.07182594,0.00007926323,0.8167278,0.0003517877,0.1086781],"study_design_scores_gemma":[0.0003750293,0.0001135848,0.0001130692,0.00005782977,0.00001075781,0.000001204854,0.0001864375,0.964763,0.002096918,0.01756447,0.01453721,0.0001804273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009358082,0.00005594781,0.9930423,0.0001431199,0.0004522394,0.001221575,0.000002002629,0.0001012235,0.004045725],"genre_scores_gemma":[0.5320796,0.000006678216,0.4675307,0.00004693522,0.00001016797,0.0001372198,0.000001915215,0.000005624112,0.0001812216],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8929371,"threshold_uncertainty_score":0.578525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024091095","doi":"10.1016/s0022-0000(02)00025-9","title":"Uniform constant-depth threshold circuits for division and iterated multiplication","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University; Clay Mathematics Institute; National Science Foundation","keywords":"Modulo; Mathematics; Division (mathematics); Iterated function; Constant (computer programming); Natural number; Discrete mathematics; Electronic circuit; Integer (computer science); Multiplication (music); Boolean circuit; Arithmetic; Combinatorics; Computer science; Boolean function; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05525673498615786,"gpt":0.2671099806480158,"spread":0.211853245661858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008914873,0.0001046333,0.0002256893,0.0002161639,0.0003881367,0.0005581173,0.0004990753,0.00003552662,9.472484e-7],"category_scores_gemma":[0.000008669896,0.00007362403,0.00005629994,0.0003437554,0.0001642057,0.000810154,0.0001109072,0.00007633182,7.189815e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001573697,"about_ca_system_score_gemma":0.00002157783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001804469,"about_ca_topic_score_gemma":0.000001224665,"domain_scores_codex":[0.9988495,0.00004002357,0.0003998831,0.000222881,0.0003117988,0.000175911],"domain_scores_gemma":[0.9990744,0.0002037423,0.0002828408,0.0001274508,0.0001988549,0.0001127005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007158492,0.0001287031,0.006900843,0.0002247276,0.00005094271,0.00002503931,0.003475251,0.0005426259,0.0004960784,0.2820128,0.00131459,0.7048212],"study_design_scores_gemma":[0.0005702378,0.000491962,0.003392911,0.0002155383,0.000006033307,0.0005443707,0.0001126809,0.9912161,0.00008304785,0.002688256,0.0005562807,0.0001225872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08157626,0.001168761,0.9152676,0.0004500789,0.0006190644,0.0001663752,0.000002374035,0.00003130347,0.000718196],"genre_scores_gemma":[0.9584338,0.00005508608,0.0413131,0.00007408614,0.0001083978,0.000001584766,1.405819e-7,0.000002229017,0.00001155464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9906735,"threshold_uncertainty_score":0.5381938,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977673587","doi":"10.1007/s00220-014-2260-1","title":"A Combinatorial Approach to Nonlocality and Contextuality","year":2015,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"Agence Nationale de la Recherche","keywords":"Kochen–Specker theorem; Quantum nonlocality; Quantum; Formalism (music); Graph; Probabilistic logic; Diagrammatic reasoning; Qubit; Hierarchy","retraction":null,"screen_n_in":null,"score":{"opus":0.1682497022073137,"gpt":0.3497480707735672,"spread":0.1814983685662535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009176554,0.0001084487,0.0002284387,0.00004178385,0.0001058061,0.0001166445,0.001843177,0.00004437551,6.11803e-7],"category_scores_gemma":[0.0003155097,0.0001051327,0.0000351796,0.0005732935,0.0002607978,0.0002310389,0.001798709,0.0002391259,0.00003211153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004986039,"about_ca_system_score_gemma":0.00005202505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001862119,"about_ca_topic_score_gemma":0.000002660384,"domain_scores_codex":[0.9988575,0.0002301394,0.0002803668,0.0002329082,0.0002261229,0.0001729499],"domain_scores_gemma":[0.9970926,0.0004061803,0.00004574422,0.002170478,0.0001085127,0.0001765062],"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.000001842615,0.0006267675,0.00005216797,0.00001489727,0.000004143797,1.642438e-7,0.002191252,0.00001030307,0.000003210403,0.9907854,0.000138562,0.006171342],"study_design_scores_gemma":[0.0002828064,0.00002105115,0.000144504,0.0000169575,0.000002244238,0.000002495858,0.000147537,0.2159245,0.000009709459,0.7826664,0.0006782942,0.0001035628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001999596,0.00006499858,0.9549099,0.001201225,0.00007183064,0.0002789985,0.000003265528,0.00008906273,0.04138108],"genre_scores_gemma":[0.6056491,0.000003988049,0.3940628,0.0001941315,0.00002209831,0.00005170511,0.0000030337,0.000004499545,0.000008696162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6036495,"threshold_uncertainty_score":0.4287187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110504071","doi":"10.1613/jair.1815","title":"Dynamic Local Search for the Maximum Clique Problem","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Clique problem; Vertex (graph theory); Benchmark (surveying); Clique; Mathematics; Generalization; Mathematical optimization; Computer science; Algorithm; Combinatorics; Graph; Chordal graph","retraction":null,"screen_n_in":null,"score":{"opus":0.1249041833922344,"gpt":0.4055584359057617,"spread":0.2806542525135273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007878719,0.0001306616,0.00021896,0.0004856575,0.0006953015,0.0005404452,0.002524714,0.00009008148,0.00003243525],"category_scores_gemma":[0.0001409181,0.00008793006,0.0002500847,0.001338662,0.0006735318,0.00042846,0.000359891,0.001048112,0.00004464494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001617535,"about_ca_system_score_gemma":0.0004880032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002441328,"about_ca_topic_score_gemma":0.0002348562,"domain_scores_codex":[0.9965515,0.0003304983,0.0007889267,0.0002756492,0.001325693,0.000727761],"domain_scores_gemma":[0.9954527,0.002152234,0.0001518298,0.0004697648,0.001644518,0.0001289705],"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.00007634742,0.0001923622,0.00001572672,0.00002262247,0.00002184925,0.00003178425,0.0002881316,0.0103134,0.001038029,0.4180681,0.0006457413,0.5692859],"study_design_scores_gemma":[0.00003458874,0.0004752713,0.00006508361,0.00004140222,0.000003771293,0.00008445493,0.0006368437,0.3995648,0.01434222,0.581023,0.003634352,0.00009412937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003079841,0.0005467168,0.9878349,0.007297743,0.0003977502,0.0004122189,0.000003149366,0.00001987925,0.0004078431],"genre_scores_gemma":[0.9197697,0.000174871,0.07928893,0.00005652166,0.0004811092,0.00002405114,7.530057e-7,0.0000161402,0.0001879011],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9166899,"threshold_uncertainty_score":0.5347767,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030970869","doi":"10.1145/1597036.1597045","title":"A better approximation ratio for the vertex cover problem","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Vertex cover; Cover (algebra); Relaxation (psychology); Vertex (graph theory); Maximum cut; Approximation algorithm; Set cover problem; Set (abstract data type); Discrete mathematics; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.0276875545897699,"gpt":0.2638624229823917,"spread":0.2361748683926218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000268682,0.0001836164,0.0001490141,0.0001204858,0.0006577545,0.000258477,0.001163748,0.00007491212,0.000044136],"category_scores_gemma":[0.00001915108,0.0001379814,0.0001863773,0.0004946274,0.0000572707,0.0005533231,0.00001044934,0.0002366999,0.00006175894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004406222,"about_ca_system_score_gemma":0.0000435985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009477433,"about_ca_topic_score_gemma":0.000003349043,"domain_scores_codex":[0.9987016,0.00004200711,0.0002491428,0.0003929851,0.0003106185,0.0003036371],"domain_scores_gemma":[0.9983894,0.0004084414,0.00006639312,0.0009729752,0.00009874684,0.00006402734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001182331,0.0001771736,5.679812e-7,0.000005964715,0.00003461677,0.00000100949,0.0004102856,0.0017345,0.0001191803,0.01291586,0.0008326843,0.9837564],"study_design_scores_gemma":[0.0009597231,0.0004527008,0.0006075534,0.00002800166,0.00003823356,0.00002328988,0.00003206939,0.8072985,0.003479594,0.1705465,0.0162154,0.0003183467],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008011792,0.00005426934,0.9811441,0.01697808,0.0005024229,0.0007054021,0.0000183926,0.0002224741,0.0002947644],"genre_scores_gemma":[0.09922127,0.0000485861,0.8943051,0.005196336,0.0001573444,0.0003308286,0.000009242757,0.00001749187,0.0007137958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.983438,"threshold_uncertainty_score":0.5626717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116123253","doi":"10.1109/ccc.2007.26","title":"Quantum t-designs: t-wise Independence in the Quantum World","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE Conference on Computational Complexity/Proceedings","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":132,"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; Mitacs","keywords":"Quantum; Independence (probability theory); Computer science; Quantum mechanics; Physics; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1215451911829818,"gpt":0.3188840678925373,"spread":0.1973388767095555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004222621,0.0008981071,0.0007810392,0.001685728,0.001011985,0.002049642,0.004925264,0.0002633807,0.00008202729],"category_scores_gemma":[0.0002673633,0.0007947434,0.000284259,0.004550585,0.0007881865,0.002334796,0.0005090627,0.001886994,0.0001737574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000324756,"about_ca_system_score_gemma":0.0002887473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001171876,"about_ca_topic_score_gemma":0.00008792189,"domain_scores_codex":[0.9922984,0.00003566898,0.00140818,0.001812414,0.002847677,0.001597652],"domain_scores_gemma":[0.9957798,0.0007595666,0.0007377664,0.0003402934,0.001970143,0.0004124166],"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.0001197322,0.0004529644,0.002187975,0.00009581679,0.0000303469,0.00002798378,0.00346615,0.00008395856,0.0006101929,0.9869838,0.003429094,0.002511998],"study_design_scores_gemma":[0.0009670277,0.0004490517,0.02974029,0.0003125081,0.0000157257,0.0001695268,0.001383504,0.264187,0.0005257826,0.700121,0.001193885,0.000934647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6469117,0.0001570849,0.2497816,0.01471051,0.002116102,0.002776479,0.00004165952,0.001647998,0.08185682],"genre_scores_gemma":[0.9662745,0.00001567326,0.03024494,0.002753929,0.0004243907,0.0001058453,0.00001247463,0.00004973114,0.000118492],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3193628,"threshold_uncertainty_score":0.9994503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115404728","doi":"10.1137/s0097539704443057","title":"A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Environment and Climate Change Canada","keywords":"Hypergraph; Combinatorics; Vertex cover; Mathematics; Cover (algebra); Vertex (graph theory); Hardness of approximation; Constant (computer programming); Combinatorial proof; Discrete mathematics; Code (set theory); Approximation algorithm; Graph; Computer science; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.01418656009218223,"gpt":0.2435712217290283,"spread":0.2293846616368461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000795874,0.0001485932,0.0002693866,0.000140856,0.0003825576,0.0002375645,0.000824835,0.00004063757,0.00001882173],"category_scores_gemma":[0.00007640564,0.00009993884,0.0001626922,0.0003454465,0.0001157707,0.0002501691,0.0002712994,0.0004158285,0.00001183896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002123993,"about_ca_system_score_gemma":0.00007559163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001493027,"about_ca_topic_score_gemma":0.000002262634,"domain_scores_codex":[0.998602,0.000147807,0.000385473,0.0002156125,0.0003831175,0.0002660073],"domain_scores_gemma":[0.9987816,0.0004243081,0.0002586841,0.0003030712,0.00009092391,0.0001413725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008969784,0.0001002807,0.0004089158,0.00001449836,0.0001004106,0.00001848774,0.00281376,0.008232299,0.0001718517,0.09154362,0.003742405,0.8927638],"study_design_scores_gemma":[0.004414647,0.0001601363,0.006297261,0.0002292112,0.0000143183,0.0005089557,0.00006848777,0.9590788,0.0005810185,0.012765,0.01562415,0.0002579709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1417131,0.00126804,0.8469383,0.006034161,0.001825886,0.0001897839,0.000001351684,0.00008344001,0.001945971],"genre_scores_gemma":[0.9210244,0.00005518919,0.07773907,0.0007216384,0.0003526474,2.843746e-7,9.590089e-8,0.000007383566,0.00009923877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9508466,"threshold_uncertainty_score":0.4075387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086467753","doi":"10.1109/focs.2011.86","title":"Information Equals Amortized Communication","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Computer science; Theoretical computer science; Generalization; Pointer (user interface); Function (biology); Discrete mathematics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05390152484316293,"gpt":0.2720959378801884,"spread":0.2181944130370254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004659601,0.0001687384,0.0002095534,0.0001973266,0.000125936,0.0003908972,0.002729862,0.0001719791,0.0001165215],"category_scores_gemma":[0.00003910668,0.0001599359,0.0001242282,0.0001757533,0.00005863587,0.001027037,0.004130815,0.0004397461,0.0002622087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003121014,"about_ca_system_score_gemma":0.00008987241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003767522,"about_ca_topic_score_gemma":0.00001866318,"domain_scores_codex":[0.9988807,0.0001045013,0.000429936,0.0001695353,0.0002432757,0.0001720053],"domain_scores_gemma":[0.9973623,0.00006600197,0.0002973177,0.002044081,0.0001682431,0.00006208724],"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.000002655869,0.00004116719,0.00003168974,0.00004836122,0.00002924228,3.404465e-7,0.002856506,0.00006327207,0.000003049966,0.8901312,0.003824789,0.1029677],"study_design_scores_gemma":[0.0002550284,0.00002370304,0.001353834,0.00008810007,0.00001021391,0.000004417876,0.00005762763,0.07575826,0.0005106397,0.9069941,0.01451266,0.0004313925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008993297,0.0001411334,0.9115782,0.0003746566,0.0005549006,0.0002705326,0.000004971136,0.0005282698,0.08564799],"genre_scores_gemma":[0.3160688,0.0003927629,0.6817726,0.001092769,0.00004647524,0.0001079688,0.0001490315,0.000008169464,0.0003614203],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3151695,"threshold_uncertainty_score":0.6521997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1519655831","doi":"10.1007/11523468_84","title":"A Better Approximation Ratio for the Vertex Cover Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Cover (algebra); Combinatorics; Vertex cover; Mathematics; Relaxation (psychology); Vertex (graph theory); Binary logarithm; Approximation algorithm; Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02102852362307598,"gpt":0.2414040172628108,"spread":0.2203754936397349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001000996,0.0004666145,0.0003928866,0.0004334112,0.0005929256,0.0009209684,0.003741557,0.0002383069,0.0000344756],"category_scores_gemma":[0.00005893829,0.0003439991,0.0002132786,0.0005095604,0.0006741732,0.0007866772,0.0009303074,0.0006462434,0.00004903507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002055628,"about_ca_system_score_gemma":0.0003591109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008582902,"about_ca_topic_score_gemma":0.00003986694,"domain_scores_codex":[0.9967317,0.00002682899,0.0005032895,0.001243726,0.0008840444,0.0006104329],"domain_scores_gemma":[0.9968575,0.001125052,0.0002733263,0.001388126,0.0002621821,0.00009382511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004706895,0.00002208614,0.000003852768,0.00003098115,0.00001536607,0.000003928993,0.0005508894,0.02010213,0.00002802292,0.112565,0.0002503845,0.8664227],"study_design_scores_gemma":[0.000222512,0.00007996363,0.00002620957,0.0001088405,0.000008824654,0.00002294653,6.845559e-8,0.6735702,0.0002746866,0.3079307,0.01741406,0.0003409768],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000004992663,0.0004143413,0.9896368,0.005186647,0.001455832,0.001157255,0.00001014691,0.0001398344,0.001994165],"genre_scores_gemma":[0.00907398,0.00004289255,0.9828745,0.005857762,0.001095978,0.0001023892,0.00001127696,0.00003796741,0.0009032214],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8660817,"threshold_uncertainty_score":0.9999012,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1563601717","doi":"10.1016/s0927-0507(05)12007-6","title":"Submodular Function Minimization","year":2005,"lang":"en","type":"book-chapter","venue":"Handbooks in operations research and management science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Fleischer; Submodular set function; Minification; Function (biology); Computer science; Mathematics; Mathematical optimization; Algorithm; Philosophy; Linguistics; German","retraction":null,"screen_n_in":null,"score":{"opus":0.07223204777223924,"gpt":0.322284523411189,"spread":0.2500524756389497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001656354,0.0001927828,0.0001656799,0.001958589,0.001075667,0.001065728,0.001203141,0.00008957137,0.00007668558],"category_scores_gemma":[0.00003021432,0.0001932405,0.00003252769,0.0005829847,0.001014688,0.001283334,0.001209129,0.0004036719,0.0000718566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001726814,"about_ca_system_score_gemma":0.0001402487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002007298,"about_ca_topic_score_gemma":0.0003443414,"domain_scores_codex":[0.9970117,0.00003678866,0.0003001569,0.000927929,0.001225717,0.0004977366],"domain_scores_gemma":[0.9987176,0.00004448147,0.00002723422,0.000769629,0.0002887778,0.0001522959],"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.000003786473,0.00002647219,0.000002805336,0.00002254937,0.000006867978,0.00001281402,0.000104342,0.0005137087,0.00002401156,0.9274311,0.0003776733,0.07147388],"study_design_scores_gemma":[0.0008419596,0.0004623305,0.0004714186,0.0006191402,0.00001323902,0.00001627369,0.00007318243,0.3042048,0.0001767141,0.3695442,0.3228089,0.0007678372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00008319406,0.0009862653,0.3300653,0.0008693506,0.0003786045,0.001173896,0.000005385867,0.0001013051,0.6663367],"genre_scores_gemma":[0.01669659,0.01020406,0.09499426,0.0004030644,0.0002926257,0.0002484764,0.00003307158,0.00003599648,0.8770918],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5578868,"threshold_uncertainty_score":0.9999713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134875769","doi":"10.1137/s009753979833920x","title":"Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph factorization; Spanning tree; Matching (statistics); Connectivity; Strongly connected component; Undirected graph; Factor-critical graph; Minimum spanning tree; Line graph; Degree (music); Minimum degree spanning tree; Graph; Graph power","retraction":null,"screen_n_in":null,"score":{"opus":0.01281695513791297,"gpt":0.241961675845559,"spread":0.229144720707646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001636367,0.0003994983,0.0004762037,0.0003030262,0.001617889,0.001022478,0.001673802,0.0001094133,0.0001969748],"category_scores_gemma":[0.0001312361,0.0003822527,0.000336904,0.001139807,0.00007941019,0.0006906153,0.0002560054,0.001323089,0.0001012411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008120844,"about_ca_system_score_gemma":0.00007141558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001658448,"about_ca_topic_score_gemma":0.000001437908,"domain_scores_codex":[0.996392,0.0003170835,0.000978716,0.0006235789,0.0007621436,0.0009264688],"domain_scores_gemma":[0.9974301,0.00108563,0.0004569923,0.0005731224,0.0001408579,0.000313255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003946189,0.0002493087,0.0004978272,0.00004783687,0.0001234353,0.0004534766,0.00541791,0.02081664,0.001811999,0.01544235,0.0004518763,0.9546479],"study_design_scores_gemma":[0.001695634,0.0004563457,0.0032649,0.001031216,0.00002308648,0.003502776,0.0003100953,0.896792,0.00112903,0.0877336,0.002892839,0.001168484],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4556739,0.0001898024,0.5347059,0.0006438525,0.001098573,0.0001398162,9.155126e-7,0.000441583,0.007105657],"genre_scores_gemma":[0.7538295,0.00001558204,0.2442344,0.001104935,0.0006951928,0.000001370797,9.57411e-7,0.0000296071,0.00008850313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9534794,"threshold_uncertainty_score":0.9998629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023627355","doi":"10.1145/1993636.1993741","title":"Learning submodular functions","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":101,"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":"Submodular set function; Matroid; Multiplicative function; Upper and lower bounds; Monotone polygon; Learnability; Mathematics; Function (biology); Distribution (mathematics); Product (mathematics); Discrete mathematics; Sample (material); Combinatorics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0434839937141398,"gpt":0.2117194603011296,"spread":0.1682354665869898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009945031,0.00004905573,0.00004623933,0.00005582121,0.0001528828,0.00003739127,0.00036577,0.00001850679,0.0003711951],"category_scores_gemma":[0.00001103527,0.00004388169,0.00004204365,0.00024925,0.00002594539,0.000248246,0.0001427475,0.00009890612,0.0003084944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000487834,"about_ca_system_score_gemma":0.00001011294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005834879,"about_ca_topic_score_gemma":0.000007456502,"domain_scores_codex":[0.999529,0.00002229194,0.0000680673,0.0001612374,0.0000860549,0.0001333339],"domain_scores_gemma":[0.999648,0.00001560603,0.00001553545,0.0002465652,0.00002802058,0.0000462145],"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.000001301195,0.00007804277,0.003352445,0.000002449576,0.00001469353,0.00001187047,0.001317453,0.00002465977,0.000117246,0.8146374,0.001362782,0.1790797],"study_design_scores_gemma":[0.000720475,0.0007863865,0.09986646,0.00001969176,0.00001606742,0.0001262036,0.0006584317,0.3488508,0.006999791,0.3121895,0.2287319,0.001034347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0062995,0.00001899236,0.8752069,0.00007526124,0.0002766633,0.00002491085,9.491008e-8,0.0003391727,0.1177585],"genre_scores_gemma":[0.8361534,0.000004405972,0.1580246,0.0001474408,0.00003675722,0.000004956705,5.68503e-7,0.000003421857,0.005624411],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.829854,"threshold_uncertainty_score":0.4064327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010996873","doi":"10.5555/1109557.1109577","title":"Combination can be hard: approximability of the unique coverage problem","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Hardness of approximation; Combinatorics; Approximation algorithm; Mathematics; Bipartite graph; Matching (statistics); Binary logarithm; Set (abstract data type); Discrete mathematics; Logarithm; Maximization; Time complexity; Computer science; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01183958534583239,"gpt":0.2252779971216926,"spread":0.2134384117758601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005575101,0.000283273,0.0003039611,0.0001199934,0.0003157083,0.0001491132,0.001549909,0.0001153863,0.00001111961],"category_scores_gemma":[0.00002120245,0.0002112693,0.0002537498,0.0008332045,0.0003039313,0.0003126982,0.0004432723,0.000321604,0.000003696739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001223978,"about_ca_system_score_gemma":0.0001283265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007782922,"about_ca_topic_score_gemma":0.00008228325,"domain_scores_codex":[0.9974603,0.0002784406,0.000498274,0.0006326795,0.0007245122,0.000405785],"domain_scores_gemma":[0.9980025,0.0001483516,0.0002766286,0.001320032,0.0001745497,0.00007790491],"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.00002296414,0.0009012559,0.002186992,0.0001268126,0.00005174511,0.000007855712,0.0008022469,0.002087749,0.006419525,0.9731246,0.001718886,0.01254943],"study_design_scores_gemma":[0.002715252,0.0009443537,0.05467756,0.0002287768,0.00005277305,0.00004114033,0.000067512,0.1918368,0.1164421,0.620891,0.01083533,0.001267367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.136882,0.0001973264,0.7234284,0.05232142,0.003209949,0.004341499,0.0005597383,0.00100805,0.07805165],"genre_scores_gemma":[0.9699648,0.00001761869,0.0282504,0.0004970201,0.0001092831,0.00008601729,0.00003761558,0.00002551186,0.001011731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8330828,"threshold_uncertainty_score":0.861531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020899710","doi":"10.1145/1328911.1328924","title":"Faster approximation schemes for fractional multicommodity flow problems","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Multi-commodity flow problem; Flow (mathematics); Fleischer; Representation (politics); Combinatorics; Upper and lower bounds; Flow network; Time complexity; Discrete mathematics; Tree (set theory); Maximum flow problem; Theory of computation; Approximation algorithm; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.06449367461059989,"gpt":0.2738331663970109,"spread":0.209339491786411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002110669,0.0002455548,0.0002261678,0.0002433786,0.0009310372,0.0001041785,0.0009308822,0.0001257916,0.00007264115],"category_scores_gemma":[0.00004065672,0.0002435027,0.0002447859,0.0004559227,0.000130385,0.0009133316,0.0000249062,0.0003360181,0.00007228446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007276419,"about_ca_system_score_gemma":0.00007503731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002522875,"about_ca_topic_score_gemma":0.00001001916,"domain_scores_codex":[0.9982343,0.00005308317,0.0003381735,0.0005632106,0.0004395169,0.0003717493],"domain_scores_gemma":[0.9983252,0.0003520867,0.00009576539,0.0009077545,0.0001900041,0.0001292062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003499877,0.001222675,0.00003131268,0.00005804034,0.0001280906,0.000006643192,0.001068328,0.01304607,0.0002318504,0.004023817,0.0006103008,0.9795378],"study_design_scores_gemma":[0.001197206,0.0002062799,0.0004206264,0.00002667481,0.00001541013,0.00009806198,0.00002329364,0.952027,0.003679164,0.02198182,0.01994409,0.0003803408],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007411924,0.00003693163,0.9953984,0.001692955,0.0009318265,0.000581712,0.00007408127,0.0003730425,0.0001698774],"genre_scores_gemma":[0.0805874,0.00003813702,0.9180632,0.0003408534,0.0001577446,0.0003856645,0.00002564167,0.00002179541,0.0003795619],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9791575,"threshold_uncertainty_score":0.9929754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156206152","doi":"10.1109/icde.2013.6544815","title":"Scalable maximum clique computation using MapReduce","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":86,"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; Amazon Web Services","keywords":"Scalability; Computer science; Clique; Computation; Parallel computing; Graph partition; Key (lock); Fault tolerance; Graph; Theoretical computer science; Algorithm; Distributed computing; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03448348328105771,"gpt":0.268198908797724,"spread":0.2337154255166662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001192714,0.00009486467,0.00009838025,0.00009044196,0.0001488175,0.0003042718,0.0004547235,0.00004042946,0.0001713735],"category_scores_gemma":[0.000008383498,0.00008748268,0.00004724216,0.0003718578,0.00004166695,0.000819208,0.0002283767,0.00008813038,0.000286351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000265501,"about_ca_system_score_gemma":0.00003597257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000432753,"about_ca_topic_score_gemma":0.000003351153,"domain_scores_codex":[0.9991297,0.00004120788,0.0001641571,0.0002648737,0.0001650549,0.000235025],"domain_scores_gemma":[0.9994524,0.00004989919,0.00004311845,0.0002718365,0.0001023802,0.00008032719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002592509,0.0002838784,0.001093331,0.00005048397,0.00004117311,0.00001286065,0.0006850219,0.007750695,0.00690362,0.3898509,0.01450489,0.5788205],"study_design_scores_gemma":[0.0001045507,0.00002089448,0.001221126,0.000009716412,0.000001264924,0.00001540332,0.00001985692,0.815767,0.001359567,0.1807242,0.000628032,0.0001284294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03908844,0.00002027384,0.9482925,0.0007617023,0.0003578532,0.0001551386,3.678471e-7,0.0002392903,0.01108445],"genre_scores_gemma":[0.3913371,0.000002096737,0.6077281,0.0004918493,0.00005020784,0.000007106538,0.00000121984,0.000005219144,0.00037712],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8080163,"threshold_uncertainty_score":0.3680558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082030917","doi":"10.1287/ijoc.13.3.210.12632","title":"Fast Heuristics for the Maximum Feasible Subsystem Problem","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Mathematical optimization; Cardinality (data modeling); Computer science; Set (abstract data type); Linear programming; Mathematics; Algorithm; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.03735851513923256,"gpt":0.2758705309087951,"spread":0.2385120157695625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001276326,0.0002034212,0.0002200436,0.0001692086,0.00134324,0.001039935,0.001592379,0.00005815029,0.000005837921],"category_scores_gemma":[0.00008317745,0.000127091,0.0002162887,0.0005340611,0.00005406937,0.000453427,0.0002699071,0.0005200314,0.00003258222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007282432,"about_ca_system_score_gemma":0.00009814614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000664011,"about_ca_topic_score_gemma":0.000004280385,"domain_scores_codex":[0.9981299,0.00003195104,0.000590672,0.0002111869,0.000482143,0.0005541563],"domain_scores_gemma":[0.9982029,0.0005657402,0.0003890624,0.0004264934,0.0002646321,0.0001512191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002944668,0.00008942838,0.0007334592,0.00003287898,0.00009850973,0.0000749122,0.00116527,0.02364417,0.00001423136,0.1136307,0.005762297,0.8547246],"study_design_scores_gemma":[0.0008650203,0.0003648088,0.0006813024,0.0001513511,0.0000134356,0.002140356,0.0001872752,0.8733663,0.0000590584,0.02315369,0.09872011,0.0002972807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005328475,0.0002005245,0.9869441,0.001545119,0.001953136,0.0003228505,0.000002121888,0.0001266739,0.00357703],"genre_scores_gemma":[0.8245104,0.00009156752,0.1709392,0.001779814,0.002268012,0.000009815321,0.000002108697,0.00002786841,0.0003712128],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8544273,"threshold_uncertainty_score":0.9999971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1531964914","doi":"10.5555/2095116.2095241","title":"Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":82,"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":"Set cover problem; Mathematics; Approximation algorithm; Covering problems; Cover (algebra); Combinatorics; Set (abstract data type); Sampling (signal processing); Matching (statistics); Binary logarithm; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03678905663808665,"gpt":0.2687750987619836,"spread":0.2319860421238969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005422659,0.0002003535,0.0002181461,0.0004048901,0.0002629039,0.0002216688,0.0005477627,0.00009422353,0.00008767231],"category_scores_gemma":[0.00004016755,0.0001723678,0.00006871037,0.001414681,0.00008966434,0.001204102,0.0004975629,0.0002267718,0.00008349154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004460589,"about_ca_system_score_gemma":0.00002825458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002594351,"about_ca_topic_score_gemma":0.0000160057,"domain_scores_codex":[0.9984969,0.0000386832,0.0002586082,0.0003412071,0.0002708843,0.0005936674],"domain_scores_gemma":[0.9988452,0.0002250559,0.00008274933,0.0004890666,0.00008921795,0.0002687699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003200038,0.001002702,0.02540887,0.0001817092,0.0002291615,0.00001182714,0.004949743,0.000009085245,0.004193929,0.2918848,0.001993812,0.6701024],"study_design_scores_gemma":[0.002958526,0.0007449312,0.05698523,0.00005596679,0.00006475569,0.0004811495,0.0002969626,0.781005,0.007485669,0.08268398,0.06492465,0.002313169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07807399,0.000359338,0.9181355,0.000206021,0.0006391632,0.0001845285,0.000008485594,0.0002582333,0.002134797],"genre_scores_gemma":[0.7497811,0.00004700492,0.2493604,0.00032787,0.0001378483,0.00000745685,0.000006524027,0.00001065068,0.0003211309],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7809959,"threshold_uncertainty_score":0.7028955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005509629","doi":"10.1007/s10107-002-0370-6","title":"Approximating disjoint-path problems using packing integer programs","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Disjoint sets; Mathematics; Bin packing problem; Combinatorics; Integer (computer science); Path (computing); Approximation algorithm; Packing problems; Vertex (graph theory); Integer programming; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Bin; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.05865507247347649,"gpt":0.2737072331314133,"spread":0.2150521606579368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008101675,0.000344285,0.0004293181,0.0001417875,0.0004303191,0.0009362872,0.001012553,0.0001116295,0.00001264274],"category_scores_gemma":[0.0001986574,0.0002912682,0.0002304566,0.0009247177,0.0002191977,0.000752129,0.0006624851,0.0004358251,0.00005707399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001336682,"about_ca_system_score_gemma":0.0000697381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002992531,"about_ca_topic_score_gemma":0.00000441148,"domain_scores_codex":[0.9970406,0.00005979292,0.0007368347,0.0006489364,0.0006231989,0.0008905872],"domain_scores_gemma":[0.9986075,0.0001013361,0.0002392914,0.0007216014,0.0001048663,0.0002254464],"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.000001552446,0.000633675,0.0001253857,0.0004318662,0.00003690584,0.00003527872,0.003495879,0.0004330224,0.0002560095,0.6153402,0.000002029669,0.3792082],"study_design_scores_gemma":[0.0004969479,0.0001593604,0.000007923297,0.001177838,0.00002141257,0.0002311736,0.0006156147,0.3379313,0.0004482233,0.6577611,0.0005955417,0.0005535701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01337527,0.0001029375,0.9833881,0.000392808,0.0001608065,0.0008411355,4.43202e-7,0.0008422073,0.0008963377],"genre_scores_gemma":[0.3314866,8.05484e-7,0.6682701,0.00005586886,0.00006552057,0.00008125153,0.000002331494,0.00002613095,0.00001141342],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3786546,"threshold_uncertainty_score":0.9999539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982713256","doi":"10.1016/j.disopt.2010.08.001","title":"The minimum spanning tree problem with conflict constraints and its variations","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Time complexity; k-minimum spanning tree; Clique; Steiner tree problem; Bounded function; Spanning tree; Graph; Minimum spanning tree; Heuristic; Discrete mathematics; Mathematical optimization; Tree structure; K-ary tree; Binary tree","retraction":null,"screen_n_in":null,"score":{"opus":0.01236291145485941,"gpt":0.2336600920583558,"spread":0.2212971806034964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002046362,0.0001010384,0.00007731058,0.00004758408,0.0005363298,0.000382949,0.0003111552,0.00004227783,0.00001468648],"category_scores_gemma":[0.00004249289,0.00006896999,0.00001936673,0.0002715356,0.0001627801,0.0004047397,0.00009345962,0.0001490525,0.000002393177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004621429,"about_ca_system_score_gemma":0.00004623387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005133616,"about_ca_topic_score_gemma":0.00002627683,"domain_scores_codex":[0.9992623,0.00003375835,0.0001389482,0.0002335985,0.0001564085,0.0001749926],"domain_scores_gemma":[0.9993632,0.0001234921,0.00008947663,0.0002463799,0.0001125983,0.00006483585],"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.00001010129,0.00002517217,0.0003425946,0.000009005592,0.00003693014,0.000003704293,0.001607748,0.01803707,0.0004528281,0.9492612,0.00008114103,0.03013249],"study_design_scores_gemma":[0.0002955045,0.00004828156,0.0008016586,0.00001384304,0.000008495686,0.00002481898,0.00004821374,0.9959275,0.0001317824,0.001753001,0.0008190952,0.0001278344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001592169,0.0000426987,0.9897717,0.001648249,0.0001610871,0.0002411111,0.000005158003,0.00009464808,0.006443175],"genre_scores_gemma":[0.5328751,0.00004044624,0.4666281,0.0001009801,0.00005606125,0.00003381513,0.00001610333,0.00001065485,0.0002387359],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9778904,"threshold_uncertainty_score":0.4125069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125240990","doi":"10.1023/b:joco.0000038911.67280.3f","title":"On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":75,"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":"Technische Universiteit Delft; Universiteit Utrecht; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Semidefinite programming; Approximation algorithm; Bounded function; Graph; Relaxation (psychology); Discrete mathematics; Maximum cut; Algorithm; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01223000613380427,"gpt":0.2180044899597861,"spread":0.2057744838259818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007405863,0.0001500163,0.0001892092,0.0002643182,0.0003158328,0.0002578866,0.000417974,0.00007445179,0.000008681693],"category_scores_gemma":[0.0001110314,0.0001079057,0.0001032709,0.0005085142,0.0000631202,0.0004146468,0.00005449668,0.000313337,0.000001587555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008135234,"about_ca_system_score_gemma":0.00008703222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003408626,"about_ca_topic_score_gemma":1.693262e-7,"domain_scores_codex":[0.9986359,0.0001149206,0.0003484301,0.0001803495,0.0005512044,0.0001691243],"domain_scores_gemma":[0.9988024,0.0002504275,0.0003741907,0.0002532913,0.0002345111,0.00008523315],"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.00009995332,0.0001801337,0.000008193223,0.000005166678,0.00001746854,0.000008809575,0.00007919567,0.6068959,0.00001334354,0.3912695,0.0001012103,0.001321088],"study_design_scores_gemma":[0.0025679,0.001525757,0.0001142006,0.0001162904,0.00002124119,0.00002655003,0.00001767848,0.625653,0.0005722026,0.3690809,0.0001501003,0.0001542325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004961327,0.0000280071,0.9879391,0.002431826,0.003960817,0.0001697029,9.486333e-7,0.00004058622,0.0004676918],"genre_scores_gemma":[0.8414066,0.0000601955,0.1568731,0.001128836,0.0004894048,0.000008544741,0.000002304495,0.0000217099,0.000009262853],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8364453,"threshold_uncertainty_score":0.4400265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167508847","doi":"10.1287/moor.26.4.796.10012","title":"When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":71,"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":"National Science Foundation","keywords":"Constraint (computer-aided design); Mathematics; Lift (data mining); Integer programming; Mathematical optimization; Integer (computer science); Mathematical economics; Computer science; Geometry; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.08849708786235158,"gpt":0.3650675527512243,"spread":0.2765704648888727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002118496,0.0000900999,0.0001543805,0.0002903421,0.0004061974,0.0003223072,0.001068167,0.00004280078,0.00004357453],"category_scores_gemma":[0.0009811684,0.00005543032,0.00004285206,0.0009547812,0.0003380658,0.0002812234,0.0004339143,0.0003291659,0.00001716597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003603493,"about_ca_system_score_gemma":0.0002386024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001736547,"about_ca_topic_score_gemma":0.0007086226,"domain_scores_codex":[0.9983402,0.0001939504,0.0003582724,0.0002190634,0.0005806836,0.0003078404],"domain_scores_gemma":[0.9979738,0.0009296383,0.00003095677,0.000532992,0.00048638,0.00004623285],"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.000002922846,0.0003569889,0.0004193033,0.000088237,0.00001753915,0.00001922019,0.01760557,0.00132198,0.001348403,0.9730621,0.0001128124,0.005644945],"study_design_scores_gemma":[0.0003999732,0.0001157682,0.001165964,0.0005520443,0.000003970756,0.0001152273,0.007175933,0.6273577,0.006007119,0.3566633,0.0002091795,0.000233904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5485546,0.0002259236,0.4207138,0.01392463,0.0001320531,0.001451298,0.00002340873,0.00008287226,0.01489138],"genre_scores_gemma":[0.8881479,0.00005054568,0.111283,0.00005402903,0.00003273906,0.00008332812,0.000002476687,0.000007178231,0.0003388174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6260357,"threshold_uncertainty_score":0.3124183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087012565","doi":"10.2178/jsl/1203350791","title":"Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i>","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Hierarchy; Polynomial hierarchy; Mathematics; Combinatorics; Time complexity; P versus NP problem; Polynomial; Discrete mathematics; Computational complexity theory; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02375080234186978,"gpt":0.2625584848825566,"spread":0.2388076825406868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265295,0.0001176747,0.0003785963,0.0001228577,0.00007516644,0.00002182429,0.00169911,0.0000639901,0.0000102943],"category_scores_gemma":[0.0002129622,0.00006933483,0.0003093198,0.0007311548,0.0007005649,0.0002485157,0.0002298081,0.0002843374,9.838288e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002464086,"about_ca_system_score_gemma":0.00022393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003526374,"about_ca_topic_score_gemma":0.000009283523,"domain_scores_codex":[0.9980303,0.0001274348,0.0008904738,0.0001406935,0.0005821366,0.0002289657],"domain_scores_gemma":[0.9976628,0.0003542131,0.001020099,0.000492253,0.0003913346,0.00007927986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001492047,0.001536658,0.0637657,0.0003378191,0.0002427583,0.00008995833,0.004382393,0.0002134574,0.19006,0.6483621,0.001775268,0.08908466],"study_design_scores_gemma":[0.001006448,0.0007950436,0.04791941,0.0002222854,0.00005128641,0.0008736583,0.000297579,0.000225465,0.4777196,0.4670812,0.003522963,0.0002850569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8483843,0.002847986,0.1315804,0.00505474,0.002324266,0.0003447335,0.000009663257,0.00003433465,0.009419691],"genre_scores_gemma":[0.9792139,0.00003357126,0.02016135,0.0004775358,0.0000887865,4.581732e-7,4.79037e-8,0.000003109114,0.00002125616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2876596,"threshold_uncertainty_score":0.3157397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004012902","doi":"10.1145/780542.780629","title":"A new multilayered PCP and the hardness of hypergraph vertex cover","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":68,"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; Cover (algebra); Vertex (graph theory); Vertex cover; Edge cover; Computer science; Combinatorics; Mathematics; Algorithm; Theoretical computer science; Engineering; Approximation algorithm; Graph; Mechanical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01256467607444679,"gpt":0.2133160636748331,"spread":0.2007513876003863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002285168,0.00008330748,0.0001469963,0.00004759748,0.00008382282,0.00006353814,0.0004293012,0.00002713932,0.00008354842],"category_scores_gemma":[0.00005190882,0.0000514494,0.00006965679,0.0003122126,0.0001345666,0.0001594736,0.0001128623,0.00006612064,0.000009608031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003087927,"about_ca_system_score_gemma":0.00004432427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001476177,"about_ca_topic_score_gemma":0.00001297584,"domain_scores_codex":[0.9993045,0.00007084749,0.0001382745,0.0001882035,0.0001628861,0.0001352459],"domain_scores_gemma":[0.9993096,0.0001557897,0.00003980799,0.0003964955,0.00003734374,0.00006095475],"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.000009822302,0.00002668429,0.0003165975,0.000005776435,0.00002233363,0.000001132913,0.0005224083,0.00001451422,0.0001001813,0.9738667,0.003268861,0.02184499],"study_design_scores_gemma":[0.01387888,0.0002094877,0.01843581,0.00006921612,0.00004020129,0.0001211587,0.0003067761,0.2789227,0.01369592,0.5377581,0.1357245,0.0008373598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01561815,0.0005922648,0.9585854,0.0011013,0.0007556942,0.0002404704,0.00000178431,0.00008841887,0.02301655],"genre_scores_gemma":[0.9019493,0.00004867494,0.09549946,0.0004803888,0.00001139071,0.000003842408,1.330514e-7,0.000004075061,0.002002734],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8863311,"threshold_uncertainty_score":0.2098045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W153015188","doi":"10.4086/toc.2006.v002a004","title":"","year":2006,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Rank (graph theory); Combinatorics; Mathematics; Pigeonhole principle; Discrete mathematics; Upper and lower bounds","retraction":null,"screen_n_in":null,"score":{"opus":0.01345998444829758,"gpt":0.2270239102562561,"spread":0.2135639258079585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002234987,0.0002212435,0.0003763126,0.0002458715,0.0003749601,0.0001124768,0.002147899,0.00005282154,0.000003005213],"category_scores_gemma":[0.00005583499,0.0002218756,0.0001981546,0.0008799383,0.000300404,0.0004862027,0.0008898583,0.0001923725,0.000002186516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001905085,"about_ca_system_score_gemma":0.00003922258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000924897,"about_ca_topic_score_gemma":0.000005493649,"domain_scores_codex":[0.9975355,0.0003764076,0.0006661053,0.0004726818,0.0004261897,0.0005231453],"domain_scores_gemma":[0.9973971,0.001160265,0.0003474664,0.0008771244,0.000150513,0.00006755713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000990234,0.0001183371,0.001230758,0.0000190441,0.00001241193,0.000009049694,0.0008789822,0.005524941,0.002028469,0.9128605,0.00001213982,0.07729544],"study_design_scores_gemma":[0.0004686467,0.00008695853,0.03968773,0.00005901033,0.000005042979,0.00003943812,0.0000946626,0.1439071,0.01418129,0.8011931,0.00003994316,0.0002370598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4417699,0.000111532,0.5563591,0.0001317033,0.0001873853,0.00007305925,5.444197e-7,0.0002548266,0.001112016],"genre_scores_gemma":[0.7879429,7.411631e-7,0.2117769,0.0001121251,0.0001411697,9.220727e-7,0.000001072282,0.000007392309,0.00001675516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.346173,"threshold_uncertainty_score":0.9047822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994612875","doi":"10.1006/jagm.2002.1221","title":"Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Háskóli Íslands; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Rectangle; Approximation algorithm; Combinatorics; Mathematics; Constant (computer programming); Space (punctuation); Algorithm; Discrete mathematics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04323806333478964,"gpt":0.2569635155234735,"spread":0.2137254521886838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002795875,0.0001990976,0.0003397874,0.0001309909,0.0009014231,0.0006142355,0.0007431805,0.00006729265,0.00001765332],"category_scores_gemma":[0.0002049498,0.0001113029,0.0002089756,0.0005322928,0.0003272132,0.0008849648,0.0001421426,0.0004368998,0.000002564677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005816306,"about_ca_system_score_gemma":0.00006302611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001619814,"about_ca_topic_score_gemma":0.00000669317,"domain_scores_codex":[0.9978724,0.0002144795,0.0007813481,0.0002640128,0.000526422,0.000341305],"domain_scores_gemma":[0.9970217,0.001329271,0.0007055541,0.0003466402,0.0005015933,0.00009519776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001171942,0.0002294961,0.00004408547,0.00008254737,0.0003308785,0.00002101446,0.01049564,0.001811537,0.0001906154,0.1714045,0.004454114,0.8108184],"study_design_scores_gemma":[0.002888644,0.0002918095,0.00002512654,0.0001110419,0.00006169373,0.0005239366,0.0005263662,0.9180301,0.0005061555,0.06944918,0.007405109,0.0001808138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003372891,0.003244258,0.98474,0.009290598,0.0006362885,0.0008930271,0.000006999462,0.00005238313,0.0007991136],"genre_scores_gemma":[0.03486161,0.001198206,0.9621176,0.0004852504,0.0009080879,0.0001313186,0.0000018152,0.00002780662,0.0002682727],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9162186,"threshold_uncertainty_score":0.6933109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964276725","doi":"10.1007/s00453-011-9526-1","title":"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Approximation algorithm; Theory of computation; Facility location problem; Mathematics; Linear programming relaxation; Relaxation (psychology); Dual (grammatical number); Exponential function; Integer (computer science); Algorithm; Mathematical optimization; Function (biology); Combinatorics; Linear programming; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03518398958303515,"gpt":0.2237815915891898,"spread":0.1885976020061547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000690638,0.0002670158,0.0002302138,0.0001067724,0.0005528424,0.000190219,0.0009933156,0.00008496291,0.00002133302],"category_scores_gemma":[0.00002822983,0.0001807702,0.0001057223,0.000651082,0.0002640274,0.0007632399,0.0002055229,0.0002111821,0.00002560478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005733658,"about_ca_system_score_gemma":0.0001441685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001496305,"about_ca_topic_score_gemma":0.00002084171,"domain_scores_codex":[0.9980443,0.00008293424,0.0003476155,0.000616629,0.0004469774,0.0004616073],"domain_scores_gemma":[0.9982314,0.0001707017,0.0001835248,0.0008713101,0.0004482163,0.00009489096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002475733,0.0002131201,0.00003705046,0.0000509795,0.00009751095,0.000004164252,0.003409035,0.00004961311,0.00002505147,0.0433861,0.0002602071,0.9524424],"study_design_scores_gemma":[0.001002374,0.0005497313,0.00198796,0.00003675807,0.00005845368,0.0000929055,0.000399273,0.9365055,0.004818774,0.04891004,0.005110931,0.0005273167],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004401905,0.0001862132,0.9965393,0.0006001898,0.0002172929,0.001249254,0.00003988004,0.000275993,0.0004516738],"genre_scores_gemma":[0.05691547,0.00001065716,0.9419915,0.0001684386,0.0001342151,0.0005571464,0.00003617326,0.00001614118,0.0001702634],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9519151,"threshold_uncertainty_score":0.7371595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149565746","doi":"10.1145/1824777.1824786","title":"On distributing symmetric streaming computations","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computation; Sublinear function; Communication complexity; Theoretical computer science; Computational complexity theory; Class (philosophy); Streaming algorithm; Algorithm; Distributed computing; Mathematics; Upper and lower bounds; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02021759233371228,"gpt":0.2677943535910513,"spread":0.247576761257339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002676258,0.0002527517,0.0002058333,0.0005424386,0.0008931226,0.0002745519,0.001427606,0.0001177096,0.0000899077],"category_scores_gemma":[0.0001404934,0.0002533412,0.0001873156,0.001838637,0.0001042545,0.0003721471,0.00003672136,0.0009291332,0.0001752159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005038094,"about_ca_system_score_gemma":0.00005977823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006379855,"about_ca_topic_score_gemma":0.00003453886,"domain_scores_codex":[0.9981273,0.00005700069,0.0003136286,0.0005903529,0.0004627022,0.0004489548],"domain_scores_gemma":[0.9973236,0.00103693,0.00009064242,0.001243805,0.0001128192,0.0001922362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003494106,0.0004110802,0.0000117466,0.000006049146,0.00003541625,0.00001546556,0.0001607348,0.002152817,0.0001605376,0.07713312,0.00005951312,0.9198501],"study_design_scores_gemma":[0.001743063,0.0007690585,0.007406932,0.0001001893,0.00005536721,0.0001682045,0.0001593521,0.7894169,0.009301541,0.1850619,0.004566499,0.001251027],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0130211,0.0000111632,0.9818127,0.001302686,0.001941838,0.0001835438,0.00006513024,0.0005058553,0.001156013],"genre_scores_gemma":[0.7140565,0.000006974004,0.2854233,0.0002605732,0.00008961293,0.00002844358,0.00001044823,0.00001615759,0.0001079411],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.918599,"threshold_uncertainty_score":0.9999919,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009786555","doi":"10.1109/focs.2012.55","title":"A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Matroid; Submodular set function; Greedy algorithm; Monotone polygon; Mathematics; Rounding; Function (biology); Combinatorics; Constraint (computer-aided design); Mathematical optimization; Approximation algorithm; Algorithm; Discrete mathematics; Combinatorial optimization; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01981169866179729,"gpt":0.2545320422452528,"spread":0.2347203435834555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000484269,0.0001647768,0.0001911805,0.0001565611,0.0001879533,0.0001601047,0.0005954255,0.00006923003,0.00005621074],"category_scores_gemma":[0.00004440757,0.000154243,0.0001191675,0.0004622023,0.00004705379,0.0004973261,0.0002060812,0.00008141641,0.00006069441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005081471,"about_ca_system_score_gemma":0.00005011089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002480297,"about_ca_topic_score_gemma":0.00000301697,"domain_scores_codex":[0.9986137,0.00004859232,0.0002323122,0.0003157478,0.000264316,0.0005253524],"domain_scores_gemma":[0.9990174,0.000112312,0.00005208201,0.0004326769,0.0001302138,0.0002553235],"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.000006503682,0.000179579,0.0001393414,0.000009340079,0.00002228147,0.000001576609,0.0004125242,0.00001719462,0.0001479424,0.8206581,0.002700902,0.1757047],"study_design_scores_gemma":[0.003689614,0.0008135448,0.002207545,0.00004100688,0.00003793946,0.0001390911,0.0001400202,0.6412547,0.01632137,0.1911978,0.142777,0.001380434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001180748,0.00004202871,0.9932595,0.000714822,0.002749745,0.0005768317,0.00001583901,0.000264419,0.001196084],"genre_scores_gemma":[0.1211408,0.000002640804,0.8774132,0.0006229521,0.0005210954,0.00009956475,0.00001233306,0.00001363239,0.0001737541],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6412374,"threshold_uncertainty_score":0.6289847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060363698","doi":"10.1145/1290672.1290685","title":"Approximation algorithms and hardness results for cycle packing problems","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Approximation algorithm; Combinatorics; Disjoint sets; Mathematics; Upper and lower bounds; Packing problems; Undirected graph; Binary logarithm; Log-log plot; Discrete mathematics; Graph; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04104861257864342,"gpt":0.285998406091064,"spread":0.2449497935124205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001316249,0.0003098816,0.0002877707,0.0003981741,0.0007552701,0.0002952195,0.0009178074,0.0001658746,0.000005417784],"category_scores_gemma":[0.00008346747,0.0003102758,0.0001635946,0.0007938261,0.0001368287,0.0008086751,0.00004149706,0.0003338484,0.00001339886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007730688,"about_ca_system_score_gemma":0.00004510627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006241995,"about_ca_topic_score_gemma":0.00005176052,"domain_scores_codex":[0.9974738,0.00004977693,0.0005738949,0.0008388397,0.0004409746,0.0006227055],"domain_scores_gemma":[0.9978585,0.0005454886,0.0001631616,0.00102226,0.0001929747,0.0002176626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004532666,0.0002423927,0.000004352084,0.00004769152,0.00004842033,0.000006179594,0.001203396,0.0006203487,0.000187122,0.003169294,0.00007039793,0.9943551],"study_design_scores_gemma":[0.005206062,0.0009456826,0.001712646,0.0002126173,0.00006878476,0.0001683318,0.000482281,0.8287604,0.01516481,0.127676,0.01835316,0.001249263],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001134635,0.0001120168,0.9942755,0.00153194,0.001220518,0.0007794464,0.00008857498,0.000444863,0.0004125472],"genre_scores_gemma":[0.09082012,0.00008712043,0.9080113,0.000306431,0.000209454,0.0001605436,0.00002515347,0.00003768861,0.0003422432],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9931058,"threshold_uncertainty_score":0.9999349,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003104918","doi":"10.1007/s00037-001-8195-x","title":"Communication complexity towards lower bounds on circuit depth","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Boolean function; Circuit complexity; Communication complexity; Upper and lower bounds; Omega; Mathematics; Binary logarithm; Bounded function; Function (biology); Discrete mathematics; Boolean circuit; Conjecture; Combinatorics; Characterization (materials science); Electronic circuit; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1246287817561772,"gpt":0.3159649090989075,"spread":0.1913361273427303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007217328,0.0004495102,0.0004735442,0.000345653,0.001232133,0.0005725051,0.002814988,0.0001293053,0.0003337088],"category_scores_gemma":[0.00009977603,0.0004808657,0.0002972925,0.001268943,0.0008910557,0.0007547776,0.0008608489,0.0006096874,0.0004271218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002545106,"about_ca_system_score_gemma":0.0002272249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002004641,"about_ca_topic_score_gemma":0.0001634976,"domain_scores_codex":[0.9962165,0.000408708,0.000669967,0.0009075195,0.001146125,0.0006511618],"domain_scores_gemma":[0.9968551,0.0004643177,0.0002786195,0.001603411,0.0004940961,0.0003044437],"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.00004270853,0.0006428002,0.0008195138,0.00001333632,0.00005067148,0.00002951287,0.0002915214,0.004361331,0.000007041414,0.9629222,0.002366434,0.02845296],"study_design_scores_gemma":[0.0006396559,0.0001828208,0.1259772,0.00003774135,0.000007147258,0.0001007718,0.00001450597,0.1948216,0.00001556448,0.6665706,0.01120031,0.0004321259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06267783,0.000181777,0.8619535,0.004733219,0.0008990005,0.0004649397,0.00004731732,0.0009271543,0.06811523],"genre_scores_gemma":[0.8867108,0.0000180495,0.110293,0.002355319,0.0001667368,0.00003213519,0.00019547,0.00002607075,0.0002024704],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8240329,"threshold_uncertainty_score":0.9997643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912359042","doi":"10.1145/1806689.1806768","title":"QIP = PSPACE","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"Centre for Quantum Technologies; National Research Foundation Singapore; National Science Foundation","keywords":"PSPACE; Mathematics; Multiplicative function; Class (philosophy); Mathematical proof; Computational complexity theory; Discrete mathematics; Computer science; Combinatorics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.00786021869120312,"gpt":0.2268176467357108,"spread":0.2189574280445077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009766872,0.0000463413,0.00004319237,0.00003778193,0.00007089319,0.00009337898,0.000640346,0.00002522673,0.0001925586],"category_scores_gemma":[0.00001462754,0.00003857276,0.00003185926,0.0001914832,0.00003392793,0.0001946377,0.0001735891,0.0001387004,0.000208499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001567185,"about_ca_system_score_gemma":0.00001465253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002430973,"about_ca_topic_score_gemma":0.00006691684,"domain_scores_codex":[0.9995616,0.00000651054,0.00005179014,0.0001512378,0.0001027177,0.0001261506],"domain_scores_gemma":[0.9994531,0.00003464219,0.00001185436,0.0004220243,0.00002296232,0.00005545682],"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":[1.391294e-7,0.00001419269,0.0001424304,6.072922e-7,0.000001318959,0.000002304101,0.00006415937,5.24559e-7,0.001577394,0.954803,0.002943323,0.04045062],"study_design_scores_gemma":[0.0003038427,0.00005818312,0.009021865,0.000003408451,0.000001832077,0.00007423072,0.00002116667,0.1080975,0.01616861,0.4361458,0.4297277,0.0003758169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01498056,0.000007854725,0.8692542,0.003517705,0.001193527,0.00003959462,2.78744e-7,0.0003452355,0.110661],"genre_scores_gemma":[0.4976727,0.000001418768,0.4984115,0.0006909397,0.0001031737,0.000002721457,2.209532e-7,0.000002617015,0.003114656],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5186571,"threshold_uncertainty_score":0.2679902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117946984","doi":"10.5555/1109557.1109614","title":"All-pairs shortest paths for unweighted undirected graphs in o(mn) time","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":57,"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; Undirected graph; Mathematics; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01560847232180834,"gpt":0.2342218529718607,"spread":0.2186133806500523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003408077,0.0001911675,0.000227078,0.0003217665,0.0001062161,0.0001349212,0.0007954757,0.00008518482,0.00008231095],"category_scores_gemma":[0.0000211237,0.0001781225,0.0001345901,0.001117818,0.0000646485,0.0003199856,0.0001477475,0.0001157109,0.000056645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003846786,"about_ca_system_score_gemma":0.00004297143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003294788,"about_ca_topic_score_gemma":0.0005455383,"domain_scores_codex":[0.9984124,0.00006533333,0.0003355916,0.0004966218,0.0002266161,0.000463444],"domain_scores_gemma":[0.9990553,0.0002504637,0.00005612401,0.0004803989,0.0000817253,0.00007603754],"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.00001683456,0.0007945734,0.003491906,0.00001840112,0.00004925536,0.00005751691,0.000244208,0.0001876974,0.001959175,0.9197896,0.03086262,0.04252823],"study_design_scores_gemma":[0.00141962,0.000201632,0.04634897,0.00003800733,0.00001381206,0.00001998151,0.0000171576,0.5061801,0.003698402,0.4144643,0.02682955,0.0007684978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1000686,0.0002915787,0.839956,0.002849222,0.001005623,0.00157703,0.00005811148,0.002392442,0.05180134],"genre_scores_gemma":[0.7168825,0.0000115498,0.2784999,0.0008380298,0.0001360374,0.0001315133,0.0001380193,0.00003271954,0.003329665],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6168139,"threshold_uncertainty_score":0.7263626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145866065","doi":"10.1007/s00453-012-9740-5","title":"Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Cover (algebra); Bounded function; Tree (set theory); Approximation algorithm; Theory of computation; Upper and lower bounds; Discrete mathematics; Graph; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02354457203300562,"gpt":0.239021698037697,"spread":0.2154771260046914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005021424,0.0003907013,0.0003710169,0.0001432198,0.0006601274,0.0009549259,0.001283341,0.0001652953,0.00008031005],"category_scores_gemma":[0.00009075242,0.000261767,0.000202853,0.0005123771,0.0003150094,0.001194612,0.0004459006,0.0002816292,0.0001313369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006761979,"about_ca_system_score_gemma":0.0001011256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002621451,"about_ca_topic_score_gemma":0.00002214433,"domain_scores_codex":[0.9974835,0.00007951632,0.0004995798,0.0008207642,0.0004243887,0.0006922612],"domain_scores_gemma":[0.9975781,0.0007496623,0.0002310237,0.0009879546,0.0002676265,0.000185669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001139218,0.0001408887,0.00002029575,0.00005772498,0.0001329267,0.000001733166,0.0007339786,0.00002709396,0.0009500377,0.01432289,0.007635618,0.9759654],"study_design_scores_gemma":[0.001366268,0.000253162,0.00100775,0.00002342238,0.00003871504,0.00003456274,0.00005105123,0.8953127,0.001365671,0.06091336,0.03919886,0.000434469],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00122635,0.0005090857,0.9886507,0.005037098,0.0008219147,0.002366208,0.00003631702,0.0002658553,0.00108643],"genre_scores_gemma":[0.0646098,0.0001975699,0.9203507,0.002433082,0.001098115,0.002548042,0.0000726058,0.0001110577,0.008578989],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9755309,"threshold_uncertainty_score":0.9999834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075025003","doi":"10.1007/bf02984830","title":"What this country needs is an 18c piece","year":2003,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":56,"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":"Computer science; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.06498037748851589,"gpt":0.3063643580093941,"spread":0.2413839805208782,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009382433,0.0002096707,0.0002244309,0.00008851249,0.0002881529,0.0007795167,0.001774348,0.00008698714,0.00310877],"category_scores_gemma":[0.0001245112,0.0001331412,0.0001105269,0.0008388064,0.0003216681,0.0009756844,0.0002181624,0.0003061656,0.001278033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002824594,"about_ca_system_score_gemma":0.00004956071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001078856,"about_ca_topic_score_gemma":0.000003042907,"domain_scores_codex":[0.9982727,0.0001541605,0.0003485082,0.0003130979,0.0005017665,0.0004097703],"domain_scores_gemma":[0.9979571,0.0004571455,0.00007193588,0.001270818,0.00009273559,0.0001502759],"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.000001860025,0.0001229841,0.00000391552,0.00001751306,0.000018129,0.0000031808,0.008752669,0.00000788489,0.00002252342,0.9754148,0.001793245,0.01384132],"study_design_scores_gemma":[0.00004429048,0.00008283915,0.000004220545,0.00006949349,0.00001363799,0.00007185892,0.001594314,0.06097539,0.005567549,0.9073864,0.02394849,0.0002415046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004719733,0.0006496984,0.961764,0.002160859,0.001044344,0.0002762142,0.000002399898,0.0002334759,0.02914932],"genre_scores_gemma":[0.7321124,0.0014526,0.2194087,0.02319212,0.0005822309,0.0001838136,0.000004947485,0.0001118401,0.02295135],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7423552,"threshold_uncertainty_score":0.9994996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994932713","doi":"10.1007/s10479-008-0481-4","title":"A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"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":"Direktion für Entwicklung und Zusammenarbeit","keywords":"Mathematics; Semidefinite programming; Rounding; Partition (number theory); Combinatorics; Hyperplane; Disjoint sets; Algorithm; Graph partition; Maximum cut; Partition problem; Branch and cut; Integer programming; Graph; Computer science; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.2635310348025377,"gpt":0.4164277997338451,"spread":0.1528967649313074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001570034,0.00009129822,0.00012072,0.0002531313,0.001231958,0.0001950754,0.000518542,0.00004361048,0.00001257267],"category_scores_gemma":[0.0002160909,0.00006807773,0.00007936538,0.0007803746,0.0003335291,0.0002964442,0.0001257256,0.000215989,0.000008513151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008076656,"about_ca_system_score_gemma":0.0001781466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009648847,"about_ca_topic_score_gemma":0.00004360321,"domain_scores_codex":[0.9984079,0.0001695961,0.0002351929,0.0002954118,0.0005387861,0.0003531069],"domain_scores_gemma":[0.9977934,0.0008982052,0.00002312028,0.0004575788,0.0007529793,0.00007470979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005667381,0.000813117,0.0001345275,0.00009810632,0.00006794909,0.00001030088,0.002769313,0.01167904,0.00069147,0.184471,0.01029149,0.7889171],"study_design_scores_gemma":[0.000315803,0.0006057968,0.000485766,0.00005555167,0.000002149302,0.00001016689,0.00004439236,0.9744681,0.004618851,0.005433945,0.01385271,0.0001068362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009432294,0.0003707122,0.9674453,0.02045089,0.00008082551,0.001454611,0.00003738709,0.00006633398,0.0006616978],"genre_scores_gemma":[0.7092479,0.0003615828,0.2878402,0.0007837821,0.0001500324,0.0009945646,0.00002509938,0.0000163999,0.0005804499],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.962789,"threshold_uncertainty_score":0.9475346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083246371","doi":"10.1007/s10107-013-0703-7","title":"New approaches to multi-objective optimization","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Mathematics; Mathematical optimization; Matching (statistics); Spanning tree; Bipartite graph; Approximation algorithm; Rounding; Combinatorics; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.1149013214391176,"gpt":0.2635967916886539,"spread":0.1486954702495363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001815285,0.0001411834,0.0001690726,0.00009690101,0.000126202,0.0004740547,0.0005880952,0.00005048281,0.0001198565],"category_scores_gemma":[0.000111527,0.0001205149,0.00007050097,0.0005239461,0.00003125459,0.0004388316,0.0003193713,0.0001156022,0.0004457767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002776543,"about_ca_system_score_gemma":0.00002505289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002905111,"about_ca_topic_score_gemma":0.000001650806,"domain_scores_codex":[0.9988368,0.00003393738,0.0002243918,0.0003399907,0.0002308841,0.000333992],"domain_scores_gemma":[0.999185,0.0001041407,0.00004386644,0.0003868657,0.00003409522,0.0002460339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.256861e-7,0.000184162,0.0000167615,0.00003468061,0.00001644966,0.000001825938,0.002600784,0.002400974,0.000008788343,0.3470771,0.0001996316,0.647458],"study_design_scores_gemma":[0.0001725707,0.00006731327,0.00006936483,0.00003565731,0.000004470322,0.00001047936,0.0001306835,0.8930049,0.0001879271,0.105657,0.000453249,0.0002064075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002006663,0.00001797225,0.9956871,0.001567013,0.00007340178,0.0006999707,1.587347e-7,0.0003254557,0.001428213],"genre_scores_gemma":[0.02076829,2.650541e-7,0.9785606,0.0001098955,0.00005132093,0.0001295791,9.28056e-7,0.00001080305,0.0003683681],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.890604,"threshold_uncertainty_score":0.5729707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976459503","doi":"10.1007/s00493-006-0016-z","title":"Network Design Via Iterative Rounding Of Setpair Relaxations","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Rounding; Mathematics; Combinatorics; Linear programming relaxation; Vertex (graph theory); Omega; Approximation algorithm; Discrete mathematics; Relaxation (psychology); Linear programming; Integer (computer science); Network planning and design; Vertex connectivity; Undirected graph; Graph; Mathematical optimization; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02367530720691067,"gpt":0.2316478668460641,"spread":0.2079725596391535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002897901,0.0001172474,0.0001749007,0.0000930883,0.0002741073,0.00007838882,0.0006060371,0.00004907018,0.000009325518],"category_scores_gemma":[0.00002888054,0.0001181419,0.00007021687,0.00107727,0.00006006178,0.0003257194,0.0001737944,0.0001296919,0.00001416229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006817431,"about_ca_system_score_gemma":0.0000453693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003763041,"about_ca_topic_score_gemma":0.000001395704,"domain_scores_codex":[0.9988832,0.0001320351,0.000265245,0.000248146,0.0002189627,0.0002524278],"domain_scores_gemma":[0.9988989,0.0003572599,0.0001589307,0.0004212453,0.0001189532,0.00004472723],"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.000002211102,0.0001277732,0.0006677266,0.000005700066,0.00001072249,0.000006174886,0.0001857278,0.002847337,0.00008642695,0.9864533,0.007499187,0.002107737],"study_design_scores_gemma":[0.0002604678,0.0001582088,0.002639405,0.00002601967,0.000006304192,0.000008220586,0.000005599462,0.07740851,0.0006690451,0.9153274,0.003321305,0.0001695408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009395464,0.0003247337,0.9940106,0.0002690574,0.0007191065,0.0001416428,9.517996e-7,0.0001491694,0.003445172],"genre_scores_gemma":[0.8399587,0.000003987783,0.1596082,0.00005401278,0.00007833574,0.00001598445,0.000002852886,0.000006914194,0.0002710375],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8390192,"threshold_uncertainty_score":0.4817685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134600856","doi":"10.1016/j.jcss.2011.12.002","title":"The complexity of weighted and unweighted #CSP","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Class (philosophy); Computational complexity theory; Computation; Mathematical optimization; Discrete mathematics; Combinatorics; Computer science; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06998880825289108,"gpt":0.2476934294203101,"spread":0.1777046211674191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624255,0.0001071695,0.0002835305,0.0001606123,0.0004875592,0.0002087013,0.001067532,0.00002946275,0.000001557585],"category_scores_gemma":[0.000006525381,0.00005873369,0.00007442314,0.0004322946,0.001319049,0.0004623455,0.0002780269,0.0001118117,4.852596e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008483938,"about_ca_system_score_gemma":0.00006551736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002565678,"about_ca_topic_score_gemma":0.000005397894,"domain_scores_codex":[0.9985103,0.0001719912,0.0005348865,0.0001726564,0.0004251914,0.0001849908],"domain_scores_gemma":[0.9988021,0.0002201501,0.0004662655,0.0001905055,0.0002122834,0.0001087046],"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.00001496467,0.00004706591,0.003090277,0.00005327205,0.00004627033,0.00001921217,0.002343113,0.000002564232,0.00003925392,0.94407,0.0002256827,0.05004833],"study_design_scores_gemma":[0.001618673,0.003027538,0.1506758,0.0007894281,0.00005427603,0.004090908,0.001787402,0.5705549,0.001459744,0.2627757,0.002591123,0.0005745119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2812831,0.003341076,0.7086527,0.0006639359,0.002063767,0.0001619774,0.000002326057,0.00004110277,0.003790042],"genre_scores_gemma":[0.8867603,0.00007681348,0.1130387,0.00002906383,0.00008612761,4.010978e-7,2.683356e-8,0.000001706049,0.000006869781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6812943,"threshold_uncertainty_score":0.4860091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2263246245","doi":"","title":"Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky","year":2021,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":53,"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":"Satisfiability; Randomized algorithm; Deterministic algorithm; Combinatorics; Mathematics; Matching (statistics); Discrete mathematics; Running time; Variable (mathematics); Key (lock); Binary logarithm; Algorithm; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01209712053241457,"gpt":0.2434263904676279,"spread":0.2313292699352133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003186986,0.0004251079,0.0007450036,0.0006933844,0.0004092774,0.0001563956,0.001263732,0.0004061168,0.00001538901],"category_scores_gemma":[0.0005561495,0.0004370371,0.0002055359,0.001664166,0.001077587,0.000613711,0.001188265,0.0006164668,0.00001034177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006278638,"about_ca_system_score_gemma":0.0003450597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001999705,"about_ca_topic_score_gemma":0.0001043265,"domain_scores_codex":[0.997224,0.00006591661,0.0006078679,0.0009736989,0.0004775971,0.0006509359],"domain_scores_gemma":[0.9977738,0.0001366783,0.0002990424,0.001352642,0.00026991,0.0001679742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001267566,0.000654673,0.02207685,0.0003970826,0.0006731519,0.002420024,0.00102944,0.0001624724,0.01964171,0.5670281,0.001608316,0.3841814],"study_design_scores_gemma":[0.02652567,0.001301,0.03360122,0.002028381,0.0006546432,0.005883599,0.0008816096,0.04720593,0.1663778,0.1632961,0.546537,0.005707081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7009823,0.00689441,0.26346,0.02137798,0.003024063,0.0007210069,0.0001101027,0.001575907,0.001854211],"genre_scores_gemma":[0.8167018,0.0002933443,0.1823321,0.0003680888,0.00007628105,0.00004120175,0.00001492156,0.00002683022,0.0001455231],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5449287,"threshold_uncertainty_score":0.9998081,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4242064191","doi":"10.1002/rsa.20279","title":"Asymptotic random graph intuition for the biased connectivity game","year":2009,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":52,"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":"Combinatorics; Intuition; Random graph; Mathematics; Graph; Discrete mathematics; Mathematical economics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.01809614125711018,"gpt":0.2568782022790673,"spread":0.2387820610219571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006321229,0.0002780558,0.0004216545,0.0001324291,0.0006233584,0.0004114176,0.0006176395,0.00009585376,0.00001427201],"category_scores_gemma":[0.0001606038,0.0001798569,0.0002671211,0.0003834847,0.000176299,0.000323125,0.00008428195,0.0002241585,0.00000103759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000159503,"about_ca_system_score_gemma":0.00003243368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003383459,"about_ca_topic_score_gemma":0.000009245192,"domain_scores_codex":[0.9983403,0.00013071,0.00030414,0.0005213115,0.0002926285,0.0004108812],"domain_scores_gemma":[0.9976753,0.001472348,0.0001342843,0.0004974511,0.0001001974,0.0001204375],"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.0004756553,0.00006254184,0.00002474514,0.00002460477,0.0001072533,0.000007843279,0.0006014458,0.0005572425,0.0003771866,0.1957343,0.0005721282,0.801455],"study_design_scores_gemma":[0.01621167,0.000348394,0.007123653,0.00002751436,0.00006053401,0.00009018394,0.000041754,0.2744448,0.001000991,0.6969969,0.003264534,0.0003890509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01162088,0.001485464,0.9827552,0.002099814,0.0008065208,0.0009147148,0.00003019033,0.0001721641,0.000115081],"genre_scores_gemma":[0.9752729,0.0002613171,0.02304308,0.0009316319,0.0003908574,0.00005273072,0.00001082418,0.00001046218,0.0000262072],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.963652,"threshold_uncertainty_score":0.7334351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136811867","doi":"10.1016/s0166-218x(01)00266-9","title":"Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":51,"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":"Mathematics; Semidefinite programming; Polytope; Relaxation (psychology); Maximum cut; Intersection (aeronautics); Lagrangian relaxation; Flexibility (engineering); Combinatorics; Metric (unit); Constraint (computer-aided design); Set (abstract data type); Relaxation technique; Feasible region; Regular polygon; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03249075521729931,"gpt":0.2356156697719298,"spread":0.2031249145546305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003803505,0.0002200506,0.0002327579,0.0000775123,0.0005988064,0.0002672415,0.001048411,0.00007135259,0.0001171153],"category_scores_gemma":[0.00005411865,0.0001607303,0.0001435713,0.0004334984,0.00009421452,0.0001718306,0.0002781072,0.0002011095,0.00007760745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002172608,"about_ca_system_score_gemma":0.00001372847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002083187,"about_ca_topic_score_gemma":0.00001540571,"domain_scores_codex":[0.9985418,0.00001358459,0.0004415024,0.0003445611,0.0002756238,0.0003829352],"domain_scores_gemma":[0.9976311,0.001092624,0.0002681217,0.0008719118,0.0000609216,0.00007532629],"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.00000153977,0.00009960788,0.000002022408,0.0001357894,0.0000637069,9.189293e-7,0.005906743,0.0001600979,0.0003972108,0.9640932,0.00153508,0.02760405],"study_design_scores_gemma":[0.0003663596,0.00003135755,0.00000843104,0.0000357588,0.0000325717,0.00001301223,0.0003336195,0.5764612,0.0007081677,0.4133924,0.008358352,0.0002587448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008453712,0.0001247253,0.973694,0.0008868697,0.0001061706,0.0008399551,0.00002885107,0.0002500431,0.02322401],"genre_scores_gemma":[0.1196402,0.00002774968,0.8784306,0.0003623544,0.0001109117,0.0005051718,0.00001104572,0.00003708993,0.0008749413],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5763011,"threshold_uncertainty_score":0.6554391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4232943531","doi":"10.1145/1109557.1109644","title":"Oblivious string embeddings and edit distance approximations","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":49,"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":"Edit distance; Embedding; Combinatorics; String (physics); Distortion (music); Approximation algorithm; Discrete mathematics; Mathematics; Algorithm; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.006974374443870286,"gpt":0.2227324276354105,"spread":0.2157580531915402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005444703,0.0005557214,0.0005299973,0.0003005002,0.000757683,0.0004911797,0.00294614,0.0001586857,0.000005893668],"category_scores_gemma":[0.0001123284,0.0004495749,0.0003383676,0.001193181,0.0004382588,0.001571499,0.001827227,0.0005363292,0.00001220074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001152112,"about_ca_system_score_gemma":0.00004967035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000105183,"about_ca_topic_score_gemma":0.000005520781,"domain_scores_codex":[0.9962016,0.00003323377,0.0007886583,0.001025339,0.001115894,0.0008352345],"domain_scores_gemma":[0.9978788,0.0001578043,0.0006277444,0.0006908718,0.0004311498,0.0002136272],"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.0001128594,0.002160055,0.009607502,0.001051372,0.0004710163,0.00001860715,0.009404365,0.0005947599,0.00442465,0.8579901,0.05301607,0.06114862],"study_design_scores_gemma":[0.007379677,0.002101461,0.03394243,0.003267061,0.000512538,0.0005242334,0.005181706,0.2861042,0.05994083,0.47963,0.1155989,0.005817014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5430543,0.003060088,0.3515787,0.05194069,0.005739221,0.007557295,0.002989768,0.003262237,0.03081764],"genre_scores_gemma":[0.8841506,0.000137678,0.1114032,0.0004204896,0.0009662409,0.0001511844,0.00004145127,0.00008808266,0.002641052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3783601,"threshold_uncertainty_score":0.9997956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135050820","doi":"10.1109/infcomw.2011.5928889","title":"Egalitarian stable matching for VM migration in cloud computing","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Server; Cloud computing; Computer science; Matching (statistics); Virtual machine; Distributed computing; Rank (graph theory); Outcome (game theory); Work (physics); Mathematical optimization; Theoretical computer science; Computer network; Operating system; Mathematical economics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05727396206257437,"gpt":0.2652118144166776,"spread":0.2079378523541032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000475716,0.00008194052,0.0001069103,0.0001014101,0.0001274769,0.00008626321,0.00045508,0.00003316131,0.00002239375],"category_scores_gemma":[0.00001436301,0.00007879543,0.00004762637,0.0002624222,0.00001672998,0.0004020613,0.0001387104,0.00007843132,0.000008636285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002257461,"about_ca_system_score_gemma":0.00002520527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002010601,"about_ca_topic_score_gemma":0.001525622,"domain_scores_codex":[0.999171,0.00003363207,0.0002064679,0.0002484429,0.00009840452,0.0002420429],"domain_scores_gemma":[0.9995474,0.00008569435,0.00004387699,0.0002483839,0.00003564254,0.0000390138],"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.000004944134,0.00007385318,0.001073383,0.0000154686,0.000005443354,0.00000252684,0.006862164,0.0001450456,0.00009511457,0.9733795,0.0003935708,0.01794901],"study_design_scores_gemma":[0.0004487602,0.00008389483,0.00593554,0.00003567155,0.000002263708,0.000005964639,0.0004373022,0.5155278,0.001700877,0.4732893,0.002285157,0.0002474287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0431397,0.00002007907,0.9498421,0.0002734963,0.0004565134,0.0001634893,0.000001135316,0.0001226833,0.005980818],"genre_scores_gemma":[0.5620806,9.567128e-7,0.4375738,0.0001647493,0.00005123975,0.000004805162,0.000001673591,0.000003531162,0.0001186506],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5189409,"threshold_uncertainty_score":0.3213184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109533535","doi":"10.1109/sfcs.2001.959928","title":"Tight approximation results for general covering integer programs","year":2001,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Linear programming relaxation; Rounding; Multiplicative function; Approximation algorithm; Mathematics; Upper and lower bounds; Integer (computer science); Randomized rounding; Discrete mathematics; Cover (algebra); Binary logarithm; Multiplicity (mathematics); Linear programming; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04364182730979306,"gpt":0.270655222080916,"spread":0.227013394771123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000219468,0.00008485893,0.00008423375,0.00005970407,0.000112527,0.0001885935,0.0004202333,0.00003394536,0.000005728497],"category_scores_gemma":[0.00002055196,0.00007130919,0.00006556684,0.0002793934,0.00002478911,0.0003894057,0.0001154021,0.00005433716,0.00001454609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001990067,"about_ca_system_score_gemma":0.00001576595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002885285,"about_ca_topic_score_gemma":0.00002217872,"domain_scores_codex":[0.9991813,0.00001371197,0.000181046,0.0002712058,0.0001368043,0.000215931],"domain_scores_gemma":[0.9995081,0.00004013842,0.0000449791,0.0003055301,0.00005207355,0.00004912921],"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.00002507918,0.0001002164,0.0001025697,0.00001177314,0.0000114972,0.000003399066,0.0004155812,0.0001045019,0.0001048762,0.6461326,0.001706015,0.3512819],"study_design_scores_gemma":[0.000682162,0.0001326113,0.0004930237,0.00001508241,0.000002283956,0.00001654324,0.00001168204,0.818126,0.001178446,0.08174228,0.09741353,0.0001863668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00705148,0.0000140743,0.9776914,0.000963674,0.0003145363,0.0002763744,0.00000164014,0.0002563227,0.0134305],"genre_scores_gemma":[0.149547,0.000007723786,0.8467845,0.0003204066,0.0002276789,0.00008276651,0.00002649312,0.000007130986,0.00299631],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8180215,"threshold_uncertainty_score":0.2907905,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2185716868","doi":"10.4086/toc.2012.v008a012","title":"","year":2012,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Predicate (mathematical logic); Constraint satisfaction problem; Pairwise independence; Discrete mathematics; Hierarchy; Pairwise comparison; Semidefinite programming; Random variable; Omega; Mathematical optimization; Multivariate random variable; Sum of normally distributed random variables; Probabilistic logic; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03077153895836308,"gpt":0.2621209887200663,"spread":0.2313494497617032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004401643,0.0002137957,0.0003624918,0.0002147283,0.0003476932,0.00006226054,0.001984305,0.00005371006,0.000005176398],"category_scores_gemma":[0.0001481218,0.0002075311,0.0001836848,0.0007710279,0.0002485085,0.001157687,0.001212742,0.00022045,0.000004676066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001944056,"about_ca_system_score_gemma":0.00002665162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009107299,"about_ca_topic_score_gemma":3.17208e-7,"domain_scores_codex":[0.9974366,0.00051027,0.0005368615,0.0002972402,0.0004073928,0.0008116148],"domain_scores_gemma":[0.9970782,0.001394025,0.0003089841,0.0008952204,0.0001075479,0.0002160008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008655316,0.0001492975,0.00529656,0.00002042463,0.00002452134,0.000001106271,0.009489251,0.0002801434,0.000967373,0.8290283,0.000004625688,0.1547297],"study_design_scores_gemma":[0.0008901054,0.0001877955,0.1439636,0.0001455156,0.00001849266,0.0001389476,0.0009780123,0.09245867,0.03266948,0.7277459,0.0001678265,0.0006356607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4510259,0.0002848426,0.547343,0.00008320751,0.0004432563,0.00006919655,3.58567e-7,0.0001958568,0.0005544663],"genre_scores_gemma":[0.7849762,0.000002010071,0.214584,0.0002176002,0.0002050198,0.000001031222,4.398199e-7,0.000007512942,0.00000616632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3339503,"threshold_uncertainty_score":0.8462874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971426115","doi":"10.1145/1146381.1146410","title":"Oracle size","year":2006,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"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; Institut national de recherche en informatique et en automatique (INRIA); Université du Québec en Outaouais","keywords":"Oracle; Computer science; Dissemination; Node (physics); Broadcast communication network; Task (project management); Communication complexity; Computer network; Measure (data warehouse); Network topology; Telecommunications network; Time complexity; Distributed computing; Theoretical computer science; Data mining; Algorithm; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02255457743138917,"gpt":0.2547799527737883,"spread":0.2322253753423992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001568358,0.0001840472,0.0002005831,0.00006699791,0.00008293943,0.0003603955,0.001916835,0.0001463874,0.0001226941],"category_scores_gemma":[0.00002313607,0.0001717961,0.0001570514,0.000190445,0.00004633142,0.000115066,0.003299679,0.0004043133,0.0001228005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002670054,"about_ca_system_score_gemma":0.00008877777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004503732,"about_ca_topic_score_gemma":0.00004562046,"domain_scores_codex":[0.9987081,0.00003600627,0.0002079642,0.0005490079,0.0002634994,0.0002354752],"domain_scores_gemma":[0.9985154,0.0001323574,0.00007889513,0.001153188,0.00006173656,0.00005839408],"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.000001498976,0.0002263962,0.0003716161,0.00009019389,0.00004360158,0.0000678285,0.0001620018,0.0007732525,0.00001897912,0.6586197,0.09243869,0.2471863],"study_design_scores_gemma":[0.0001459641,0.00002150759,0.006436787,0.0000426956,0.000006160962,0.00001074948,0.000002617656,0.1695262,0.0003805213,0.7745832,0.04830205,0.0005416159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008155626,0.0001704093,0.8564914,0.001250577,0.0011758,0.000125668,0.000005914231,0.0006455956,0.1393191],"genre_scores_gemma":[0.04485397,0.00001580325,0.9425737,0.0006565331,0.0003198959,0.00002419058,0.000008303196,0.00001296347,0.01153464],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2466446,"threshold_uncertainty_score":0.7005643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}