{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1616,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1616,"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":"197df429970c","filters":{"topic":"Computational Geometry and Mesh Generation"}},"results":[{"id":"W1505970908","doi":"10.1017/cbo9780511546884","title":"Geometric Spanner Networks","year":2007,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":520,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Computer science; Decomposition; Point (geometry); Theoretical computer science; Geometric shape; Geometric networks; Algorithm; Mathematics; Complex network; Distributed computing; Geometry; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01796123038179233,"gpt":0.2007498698452768,"spread":0.1827886394634844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002775226,0.0003274484,0.0003150583,0.0009392023,0.0002382911,0.0001489854,0.001265951,0.0004040856,0.00000193474],"category_scores_gemma":[0.00001577042,0.0003995179,0.0002081585,0.000190725,0.00008713522,0.0002428973,0.0007227634,0.000508502,0.00002660719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003632904,"about_ca_system_score_gemma":0.0003313389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002619768,"about_ca_topic_score_gemma":8.87628e-7,"domain_scores_codex":[0.9981757,0.00006342414,0.0002205077,0.0006775812,0.0004623575,0.0004004406],"domain_scores_gemma":[0.9983684,0.0001952429,0.0002337125,0.0006777354,0.000300898,0.0002240287],"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.00001259453,0.00001364971,6.813051e-7,0.00002265298,0.00005872696,0.0002076603,0.00001035999,0.00223002,0.000002125095,0.661584,0.318688,0.01716952],"study_design_scores_gemma":[0.0003300634,0.00004766431,0.00004782304,0.00003962007,0.0000485597,0.00002715379,0.000001769233,0.02188077,0.00008090874,0.00001710684,0.9770425,0.0004360509],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000007284632,0.0002411574,0.4792909,0.000007600549,0.0005564367,0.0001525132,0.0000120647,0.0001444197,0.5195876],"genre_scores_gemma":[0.0003707587,0.00005864686,0.00326833,0.0001959915,0.0005485523,5.340448e-7,0.0001184381,0.00002145431,0.9954173],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6615669,"threshold_uncertainty_score":0.9998457,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1535557537","doi":"10.1016/s0925-7721(00)00015-8","title":"Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":267,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Approximation algorithm; Simple (philosophy); Algorithm; Position (finance); Point (geometry); Path (computing); Shortest path problem; Mathematics; Grid; Lawn; Plane (geometry); Computer science; Combinatorics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01073107369151876,"gpt":0.2229154518957093,"spread":0.2121843782041906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008006129,0.0002091155,0.000236247,0.0001732799,0.0004278869,0.0001559773,0.000416215,0.00007649889,0.00005374561],"category_scores_gemma":[0.00005047496,0.0001572309,0.00005198323,0.0007408163,0.0001116529,0.0003906974,0.0001070765,0.0001694689,0.000003605368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000823138,"about_ca_system_score_gemma":0.0003262298,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01994209,"about_ca_topic_score_gemma":0.00531924,"domain_scores_codex":[0.9980267,0.0001369033,0.0004650413,0.0004548299,0.0006227595,0.0002937627],"domain_scores_gemma":[0.9985436,0.0007777294,0.0001504215,0.0002155606,0.0002335549,0.0000791245],"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.0002673906,0.0004571906,0.00198703,0.0006644446,0.0002134217,0.00002843747,0.008232858,0.6569878,0.0004121258,0.02830811,0.0271227,0.2753185],"study_design_scores_gemma":[0.001310912,0.0002582126,0.01527988,0.00009740097,0.00003228318,0.00007616312,0.0002373317,0.9587266,0.000174713,0.009070592,0.01442337,0.0003125644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7447552,0.002963393,0.242508,0.006138516,0.0004641109,0.002379939,0.0001218201,0.00006388448,0.0006051099],"genre_scores_gemma":[0.9613938,0.00005079719,0.03669863,0.001056548,0.0001046367,0.00007570223,0.0002732448,0.00001478945,0.0003318897],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3017388,"threshold_uncertainty_score":0.9865842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2809944305","doi":"10.1145/3197517.3201353","title":"Tetrahedral meshing in the wild","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":251,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Robustness (evolution); Computer science; Computation; T-vertices; Algorithm; Enhanced Data Rates for GSM Evolution; Polygon mesh; Geometry processing; Tetrahedron; Mesh generation; Mathematics; Computer vision; Geometry; Computer graphics (images); Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.02849007427651232,"gpt":0.2749468525037155,"spread":0.2464567782272032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003785407,0.00007999953,0.00005814524,0.0002669265,0.0002988173,0.0001177336,0.0007724855,0.0000455944,0.00001318931],"category_scores_gemma":[0.0000288468,0.00006228027,0.00005624142,0.001471353,0.0000567938,0.0003488223,0.000006288377,0.000212144,0.00002792201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001321528,"about_ca_system_score_gemma":0.00003605465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001742417,"about_ca_topic_score_gemma":0.0001551633,"domain_scores_codex":[0.9991612,0.00008440782,0.0001369236,0.0002052233,0.0002643049,0.0001479826],"domain_scores_gemma":[0.9991455,0.000243723,0.00002553143,0.0004979083,0.00005881419,0.00002850353],"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.00003736123,0.0007916072,0.0007838191,0.00001637694,0.00005800175,0.00002279676,0.00911734,0.009607717,0.0006684157,0.4109477,0.002161412,0.5657875],"study_design_scores_gemma":[0.002170498,0.001504567,0.07625695,0.0001138642,0.00005318057,0.0002220168,0.0006005091,0.3348073,0.01107845,0.4876467,0.08436183,0.001184095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03562092,0.00002454387,0.9568834,0.006364985,0.0004249784,0.00009286813,0.00000190188,0.00005939861,0.0005269611],"genre_scores_gemma":[0.9800375,0.0000199049,0.01720289,0.002596744,0.0000830119,0.00001483621,0.000001949975,0.000003566043,0.00003966077],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9444165,"threshold_uncertainty_score":0.2539715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2211252052","doi":"10.1111/j.1467-8659.2010.01655.x","title":"Spectral Mesh Processing","year":2010,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":211,"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":"Geometry processing; Computer science; Laplacian smoothing; Smoothing; Eigenvalues and eigenvectors; Theoretical computer science; Curse of dimensionality; Computer graphics; Laplace operator; Graphics; Graph; Polygon mesh; Algorithm; Mesh generation; Artificial intelligence; Computer graphics (images); Mathematics; Computer vision; Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.01068426185611632,"gpt":0.2397886427989236,"spread":0.2291043809428073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002292613,0.0001509963,0.0001237951,0.0002635019,0.000284606,0.0003685196,0.0007279096,0.00008298886,0.00001029034],"category_scores_gemma":[0.000009452223,0.0001473985,0.00009569918,0.0008185296,0.00005414151,0.0006475966,0.0002410951,0.0003266336,0.00003301479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008012468,"about_ca_system_score_gemma":0.00009454196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003370535,"about_ca_topic_score_gemma":0.00002589199,"domain_scores_codex":[0.9987358,0.00002366958,0.0002107005,0.000400612,0.0002925449,0.0003366309],"domain_scores_gemma":[0.9992105,0.00004545149,0.00007836851,0.0003885583,0.0001516375,0.000125535],"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.000001834308,0.0000584329,0.0008472834,0.000008836732,0.000008959417,0.000008622832,0.0001289619,0.0002786344,0.00095775,0.8548966,0.003553031,0.139251],"study_design_scores_gemma":[0.0002579733,0.00007987382,0.007059438,0.00000917304,0.00000393737,0.00008731899,0.000002752952,0.896167,0.001822506,0.06525252,0.02898848,0.0002690753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03885917,0.00005835697,0.9561173,0.001879504,0.001975595,0.0001099061,9.923637e-7,0.0002834736,0.0007157267],"genre_scores_gemma":[0.8294553,0.000004513352,0.168616,0.00133042,0.0004913768,0.000007519332,0.000009995137,0.000009182602,0.00007568528],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8958883,"threshold_uncertainty_score":0.6010737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2288450576","doi":"10.1007/978-3-0348-8438-9_9","title":"A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm","year":2000,"lang":"en","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Polyhedron; Enumeration; Convex hull; Vertex (graph theory); Combinatorics; Mathematics; Regular polygon; Lexicographical order; Degeneracy (biology); Integer points in convex polyhedra; Extreme point; Algorithm; Bounded function; Convex polytope; Convex set; Computer science; Integer programming; Convex optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02007553758135663,"gpt":0.2567447613605174,"spread":0.2366692237791607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004029766,0.0002767383,0.0002678391,0.000242314,0.0002085844,0.000103968,0.0006534306,0.000167393,0.0003963564],"category_scores_gemma":[0.000007816519,0.0002368262,0.0002252885,0.00009223521,0.00006192837,0.0001805173,0.0001842778,0.0002559264,0.00009317062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009577667,"about_ca_system_score_gemma":0.0005336365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006953839,"about_ca_topic_score_gemma":0.00003329863,"domain_scores_codex":[0.9979063,0.0001067529,0.0005403658,0.0004935313,0.000743369,0.0002096639],"domain_scores_gemma":[0.9985485,0.00009012556,0.00027264,0.0007505122,0.0002622542,0.00007593918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009836614,0.00001576469,0.000004629303,0.00004902041,0.00006825058,0.00000566853,0.0005354267,0.0001943485,0.0005013563,0.1786169,0.004473926,0.8155249],"study_design_scores_gemma":[0.002765133,0.0004420931,0.0009438941,0.0007312544,0.0002690801,0.00007698213,0.00005358861,0.05471137,0.03059846,0.09061718,0.8171486,0.001642426],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.001145249,0.0007521022,0.5187917,0.001639427,0.002689696,0.004352214,0.0004104993,0.0004090226,0.4698101],"genre_scores_gemma":[0.04255508,0.0003354928,0.08035664,0.00395504,0.001269872,0.0001557871,0.0005524958,0.0002030272,0.8706166],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8138825,"threshold_uncertainty_score":0.9657492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069358561","doi":"10.1007/s00454-004-1152-0","title":"Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries","year":2005,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":168,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Carleton University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Combinatorics; Boundary (topology); Algorithm; Nearest neighbour; Set (abstract data type); Point (geometry); Decision boundary; Decision rule; Line segment; k-nearest neighbors algorithm; Computer science; Artificial intelligence; Geometry; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02113207701903566,"gpt":0.2978808491474306,"spread":0.2767487721283949,"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.0007349778,0.0003756218,0.000383797,0.0006476085,0.001202427,0.001185694,0.0006890995,0.0001351043,0.00002523886],"category_scores_gemma":[0.000364691,0.0003854494,0.0002699844,0.001326767,0.0001630705,0.001111816,0.0003636889,0.0002326487,0.0001490486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001775573,"about_ca_system_score_gemma":0.0004108295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001476349,"about_ca_topic_score_gemma":0.00000884742,"domain_scores_codex":[0.9967406,0.00009567892,0.0007077952,0.0009085795,0.0009594123,0.0005879146],"domain_scores_gemma":[0.9966626,0.001562178,0.0002854456,0.0003751437,0.0008723807,0.0002422714],"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.00004515409,0.00009357716,0.0001442458,0.00001780029,0.00006751285,0.000006709519,0.0005765758,0.5445561,0.00003713194,0.09562431,0.003024769,0.3558061],"study_design_scores_gemma":[0.001078121,0.0001606112,0.01492084,0.00004197899,0.00001802893,0.00006201548,0.0000634746,0.9188315,0.0003516004,0.02869147,0.03529747,0.0004828926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05060617,0.0003053048,0.9446812,0.001994276,0.001056706,0.0004883299,0.00007947844,0.0002894758,0.0004990509],"genre_scores_gemma":[0.5559466,0.000003079674,0.4420235,0.0008931374,0.0006455305,0.00001557804,0.0002458802,0.00001969942,0.0002070832],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5053404,"threshold_uncertainty_score":0.9998598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102022978","doi":"10.1016/j.jsc.2003.08.007","title":"From the zonotope construction to the Minkowski addition of convex polytopes","year":2004,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":false,"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":"Polytope; Mathematics; Parallelizable manifold; Hyperplane; Minkowski addition; Bounded function; Combinatorics; Generalization; Time complexity; Polynomial; Regular polygon; Discrete mathematics; Algorithm; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01052282682822787,"gpt":0.2417820425937021,"spread":0.2312592157654742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005012451,0.00009855616,0.000174487,0.0001447237,0.000161211,0.000117788,0.0004636812,0.00003855961,0.00001648425],"category_scores_gemma":[0.0001196595,0.00006205236,0.0001016312,0.0006222078,0.00005103624,0.0004270564,0.00006783862,0.0001409569,0.00001723042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006395901,"about_ca_system_score_gemma":0.0002055081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008506827,"about_ca_topic_score_gemma":0.00001745159,"domain_scores_codex":[0.9986458,0.0001175465,0.000531134,0.0001344837,0.0004652905,0.0001057845],"domain_scores_gemma":[0.9983857,0.0003357052,0.0005299406,0.0001714448,0.0005166485,0.00006059813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006981457,0.0001413232,0.0001975325,0.0000100152,0.0001269069,0.000006863781,0.008986178,0.6326296,0.006721882,0.06186029,0.008738778,0.2805108],"study_design_scores_gemma":[0.006382829,0.00212446,0.208436,0.0007587942,0.000273269,0.001396627,0.004447607,0.1485104,0.05632034,0.531154,0.03924824,0.0009473123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2571355,0.0001424213,0.7327576,0.008820618,0.000903911,0.0001445287,0.000009837122,0.00001103329,0.00007449502],"genre_scores_gemma":[0.9425408,0.00001548408,0.05596454,0.0006774763,0.0007744072,0.000003356468,0.0000132926,0.000004458792,0.000006136213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6854053,"threshold_uncertainty_score":0.2530422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077735330","doi":"10.1007/s00454-012-9417-5","title":"Approximation Algorithms for Maximum Independent Set of Pseudo-Disks","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":131,"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; Rounding; Approximation algorithm; Set (abstract data type); Independent set; Combinatorics; Algorithm; Plane (geometry); Relaxation (psychology); Linear programming relaxation; Set packing; Discrete mathematics; Linear programming; Computer science; Geometry; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.03693149263006409,"gpt":0.3046274523030603,"spread":0.2676959596729963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001038925,0.0002331537,0.0002806418,0.0005396499,0.0001975361,0.0001034493,0.000517706,0.0001112439,0.00003792627],"category_scores_gemma":[0.0001453927,0.00023558,0.0001918711,0.001100891,0.00005392835,0.001120839,0.0001951099,0.0001295771,0.00003471844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007647603,"about_ca_system_score_gemma":0.0001261033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000891499,"about_ca_topic_score_gemma":6.169718e-7,"domain_scores_codex":[0.9976764,0.000102697,0.0005874357,0.0004107709,0.0007944247,0.0004282869],"domain_scores_gemma":[0.9981891,0.0005259772,0.0003382232,0.0003035757,0.0004559947,0.0001871441],"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.00007590061,0.0004461532,0.004295509,0.0002627284,0.0002353414,0.000001771295,0.001919606,0.3486917,0.001306191,0.4543125,0.002180538,0.186272],"study_design_scores_gemma":[0.001134962,0.0001715369,0.03629968,0.00002929716,0.00003353482,0.00004202946,0.0001214662,0.8761309,0.002953716,0.08027712,0.002338829,0.0004669389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05725806,0.0002911488,0.9401873,0.0003775134,0.0007908574,0.0004706956,0.00009903681,0.00009737421,0.0004280181],"genre_scores_gemma":[0.7133355,0.000003499264,0.2854778,0.0001383448,0.0003473692,0.00006132437,0.0005363715,0.00001400361,0.00008585753],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6560774,"threshold_uncertainty_score":0.9606672,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144337080","doi":"10.1007/s00454-012-9420-x","title":"An Incidence Theorem in Higher Dimensions","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":120,"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":"Isaac Newton Institute for Mathematical Sciences","keywords":"Mathematics; Combinatorics; Bounded function; Dimension (graph theory); Polynomial; Degree (music); Incidence (geometry); Discrete mathematics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02467572079097737,"gpt":0.2908872514977361,"spread":0.2662115307067587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007189911,0.0002154935,0.0002001972,0.0006131857,0.0001931158,0.0001561622,0.0006226037,0.00008623544,0.0001689181],"category_scores_gemma":[0.00006283366,0.0002101482,0.00007746338,0.001918622,0.00005969597,0.002136133,0.0002031376,0.0002082181,0.0001802385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009368606,"about_ca_system_score_gemma":0.0001017898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000187633,"about_ca_topic_score_gemma":0.000003683744,"domain_scores_codex":[0.9978286,0.0001922859,0.0003984374,0.0004487013,0.0006469956,0.0004849913],"domain_scores_gemma":[0.9986809,0.0003714593,0.0001192589,0.0003944326,0.0001582522,0.0002756805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001269551,0.0003006261,0.02269609,0.000009287957,0.00001755637,0.000009015037,0.00063442,0.2508693,0.0004092331,0.7108425,0.0002980095,0.01390128],"study_design_scores_gemma":[0.0004855723,0.00009400368,0.6631436,0.00002460611,0.000007258678,0.00003571104,0.00005292406,0.2729877,0.0002357686,0.06062058,0.00186059,0.0004516921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4103708,0.000463619,0.5856595,0.0006138544,0.0008714023,0.0001685702,0.000008556426,0.0001526596,0.001691083],"genre_scores_gemma":[0.9272645,0.000005319422,0.07120722,0.0009290761,0.0002956853,0.00002274218,0.0001257324,0.00001371233,0.0001360912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6502219,"threshold_uncertainty_score":0.8569596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148852797","doi":"10.1145/2185520.2185592","title":"Efficient geometrically exact continuous collision detection","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":117,"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":"Collision detection; Computer science; Solver; Rounding; Algorithm; Collision; Curvature; Nonlinear system; Degenerate energy levels; Mathematics; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01838371075775478,"gpt":0.2499640130641955,"spread":0.2315803023064407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004723225,0.0001539866,0.00013525,0.0008305187,0.0004238556,0.00009964783,0.0004317928,0.0001103174,0.00002532485],"category_scores_gemma":[0.00009642287,0.0001495327,0.0001367602,0.002923316,0.00003152518,0.0002743441,0.00001447515,0.0002456347,0.00008208022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006375014,"about_ca_system_score_gemma":0.00003480949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001361884,"about_ca_topic_score_gemma":0.000006054368,"domain_scores_codex":[0.9985649,0.00009083326,0.0002492383,0.0002911056,0.0004814289,0.0003225115],"domain_scores_gemma":[0.9986266,0.0003830404,0.00007932156,0.0005656851,0.0001665849,0.0001787059],"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.00006842187,0.001916834,0.0002920435,0.00002194046,0.00009555548,0.000004851455,0.0006837236,0.2405689,0.00556127,0.01674939,0.0002448146,0.7337923],"study_design_scores_gemma":[0.002973329,0.001852596,0.06439358,0.00007330195,0.0001645628,0.0002650718,0.000135459,0.7322654,0.1410964,0.009389528,0.04558022,0.001810508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1468633,0.0001287774,0.8509634,0.0003842706,0.001139422,0.0001737139,0.000004412466,0.000185214,0.0001575744],"genre_scores_gemma":[0.9789725,0.00003875001,0.02038231,0.0003828216,0.00009285808,0.00003041479,0.000003771995,0.000009969242,0.000086584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8321093,"threshold_uncertainty_score":0.6097766,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051690202","doi":"10.5555/982792.982853","title":"An optimal randomized algorithm for maximum Tukey depth","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":117,"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":"Mathematics; Randomized algorithm; Dimension (graph theory); Algorithm; Point (geometry); Linear programming; Set (abstract data type); Combinatorics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01177073521394966,"gpt":0.2737123337367909,"spread":0.2619415985228413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001016713,0.0003289055,0.0004627979,0.0002569601,0.0003224251,0.0003784203,0.0007339581,0.0001203943,0.00001123436],"category_scores_gemma":[0.00004714889,0.0002864459,0.0003058336,0.0004553773,0.00009251535,0.0008593638,0.00009456021,0.0001509559,0.00005675669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001106983,"about_ca_system_score_gemma":0.0001868132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002616938,"about_ca_topic_score_gemma":0.000003375875,"domain_scores_codex":[0.9975237,0.0001826716,0.0004643488,0.0008142947,0.000521707,0.0004932464],"domain_scores_gemma":[0.9984729,0.0002632545,0.0001613856,0.0006256927,0.0002117171,0.0002650411],"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.002537957,0.0005535025,0.000001649452,0.00002593074,0.0001874518,0.00003609341,0.001169953,0.3387401,0.002652328,0.1133443,0.000370774,0.5403799],"study_design_scores_gemma":[0.04569648,0.0006866664,0.0000236734,0.00002376771,0.00003462098,0.00003330891,0.00002444792,0.9060016,0.01518344,0.03037797,0.001439736,0.000474337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00108825,0.0001315955,0.9926645,0.002429705,0.001153694,0.001064812,0.00003810847,0.0003008523,0.001128533],"genre_scores_gemma":[0.07526518,0.00004748116,0.922106,0.0008488852,0.000771932,0.0003843209,0.0002251058,0.00003844121,0.000312606],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5672614,"threshold_uncertainty_score":0.9999588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085525401","doi":"10.1016/s0010-4485(00)00146-9","title":"Generation of a finite element MESH from stereolithography (STL) files","year":2002,"lang":"en","type":"article","venue":"Computer-Aided Design","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Trois-Rivières; Polytechnique Montréal","funders":"","keywords":"Delaunay triangulation; Finite element method; Mesh generation; Polygon mesh; Volume mesh; Boundary (topology); Surface triangulation; Parametric surface; Triangulation; Algorithm; Representation (politics); Boundary representation; Computer science; Parametric statistics; Geometry; Smoothing; Mathematics; Constrained Delaunay triangulation; Mathematical analysis; Computer vision; Structural engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1090474075237399,"gpt":0.2547190985165342,"spread":0.1456716909927943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003255805,0.0002202528,0.0002697973,0.0003437369,0.0001552575,0.0001840952,0.0006182466,0.00007611198,0.0001496616],"category_scores_gemma":[0.00002818233,0.0002221682,0.000138041,0.0007621783,0.00003993957,0.0004869176,0.000175769,0.0000976513,0.00006457722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002976625,"about_ca_system_score_gemma":0.00003618802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001712375,"about_ca_topic_score_gemma":0.000002649182,"domain_scores_codex":[0.9979203,0.0003005779,0.0005386899,0.0005402955,0.0004424581,0.000257652],"domain_scores_gemma":[0.9983954,0.0004575599,0.0002398018,0.0005798406,0.0002141799,0.0001132247],"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.0000219076,0.0006636027,0.0003398198,0.00003466152,0.000224401,0.00003094011,0.002347618,0.2459537,0.01258057,0.0310496,0.05320575,0.6535475],"study_design_scores_gemma":[0.0005247649,0.0002825841,0.001301082,0.00002644038,0.00001423755,0.000004712826,0.000004344497,0.9786663,0.0132246,0.003658789,0.002054852,0.0002372783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01408392,0.0005350115,0.9837939,0.000251928,0.0007208681,0.0003128777,0.00001602147,0.0001370129,0.0001484916],"genre_scores_gemma":[0.4754552,0.00004442876,0.5235692,0.0003669584,0.0004068376,0.00002425123,0.00004774706,0.000009142355,0.00007625039],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7327126,"threshold_uncertainty_score":0.9059758,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047577363","doi":"10.1145/1250790.1250848","title":"Computing crossing number in linear time","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":109,"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":"Crossing number (knot theory); Computer science; Time complexity; Algorithm; Parallel computing; Engineering; Intersection (aeronautics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01375873065860642,"gpt":0.2962379455782537,"spread":0.2824792149196473,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006257682,0.0000536521,0.00006040292,0.00008432459,0.0001043292,0.0001329536,0.0001658851,0.00002786015,0.00004958823],"category_scores_gemma":[0.00002442053,0.00005265165,0.00002028847,0.0005445975,0.00001484557,0.000245314,0.00008701037,0.00006253042,0.0003623243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002719378,"about_ca_system_score_gemma":0.00004305003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001691156,"about_ca_topic_score_gemma":0.0000114451,"domain_scores_codex":[0.9993271,0.0000161978,0.0001774438,0.0001704575,0.000137802,0.0001709748],"domain_scores_gemma":[0.9996595,0.0001171331,0.00002944765,0.0001088771,0.0000449191,0.00004010481],"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.00001825881,0.0002928683,0.02914744,0.00001816905,0.00001430402,0.0001189337,0.00306564,0.09153207,0.01215592,0.1404181,0.002799732,0.7204186],"study_design_scores_gemma":[0.0002298212,0.000010273,0.02854973,0.00000919551,4.391299e-7,0.0000249159,0.000007417709,0.9602753,0.004159799,0.001629987,0.004985076,0.0001180766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2542887,0.000007501857,0.7343901,0.0001009786,0.0001678582,0.00003095244,5.355291e-8,0.00006795206,0.01094584],"genre_scores_gemma":[0.7512025,1.017996e-7,0.2471639,0.0004679506,0.0001052025,1.584021e-7,0.000001499133,0.000002211672,0.001056466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8687432,"threshold_uncertainty_score":0.4657067,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049284557","doi":"10.1016/s0925-7721(01)00069-4","title":"On embedding an outer-planar graph in a point set","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Embedding; Mathematics; Time complexity; Planar graph; Disjoint sets; Vertex (graph theory); Line segment; Regular polygon; General position; Graph; Discrete mathematics; Algorithm; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0317632476759565,"gpt":0.2793271361155888,"spread":0.2475638884396323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003940936,0.0002108221,0.0002010704,0.001242567,0.0001690039,0.0002137022,0.0005560276,0.0000798598,0.0001573392],"category_scores_gemma":[0.00009264563,0.0002249522,0.00008075256,0.001942072,0.00003150174,0.0008214343,0.0000782042,0.0002212736,0.0003085804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009090303,"about_ca_system_score_gemma":0.00003432786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009315338,"about_ca_topic_score_gemma":0.000005757589,"domain_scores_codex":[0.9979531,0.0001289804,0.0003940048,0.0005994712,0.0005975986,0.0003269018],"domain_scores_gemma":[0.998843,0.0004221232,0.0001102676,0.0003314949,0.0001300624,0.0001631043],"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.000009249118,0.0003068015,0.00041782,0.00001133571,0.00001604229,0.00006928652,0.0006517469,0.8290046,0.00003846808,0.1379289,0.003228442,0.0283173],"study_design_scores_gemma":[0.0006092576,0.0002085904,0.009273011,0.00002526112,0.000002497333,0.00006446323,0.00002808211,0.8827949,0.00004492256,0.1060928,0.0005760191,0.0002801978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2626858,0.0001503034,0.7342976,0.0008641746,0.0004501132,0.0001599295,0.00001275162,0.0001590267,0.001220278],"genre_scores_gemma":[0.9347706,0.000006470198,0.06330179,0.001502135,0.0001235585,0.00001710085,0.0001019208,0.00001256277,0.000163852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6720848,"threshold_uncertainty_score":0.9173286,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2799803339","doi":"10.1002/jgt.21630","title":"Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity Testing","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Research Canada; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","funders":"","keywords":"Planarity testing; Combinatorics; Mathematics; Planar graph; Planar; Outerplanar graph; Book embedding; Graph; Planar straight-line graph; Discrete mathematics; Enhanced Data Rates for GSM Evolution; 1-planar graph; Pathwidth; Line graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03773873636701931,"gpt":0.2706385605727584,"spread":0.2328998242057391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008542916,0.00004617882,0.0001023951,0.0001875346,0.0001145288,0.00001787778,0.0001297401,0.00002344121,0.00000271456],"category_scores_gemma":[0.0003142182,0.00003909744,0.00006410651,0.0002594093,0.00003963412,0.0004249364,0.00003076448,0.00006156968,2.171403e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006704391,"about_ca_system_score_gemma":0.00004923046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.679949e-7,"about_ca_topic_score_gemma":2.895889e-7,"domain_scores_codex":[0.9994648,0.00005788072,0.0002187834,0.00005201717,0.0001122383,0.00009435836],"domain_scores_gemma":[0.9987882,0.0006116323,0.0002293805,0.00006653318,0.000231266,0.0000729233],"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.00009783405,0.0002432849,0.01680957,0.00007548551,0.0001238905,0.000001964863,0.001606782,0.000776921,0.01948908,0.8717525,0.001109181,0.08791354],"study_design_scores_gemma":[0.001898412,0.0008988437,0.3313382,0.0001802873,0.0001938867,0.001408303,0.0009629801,0.007850714,0.02012137,0.6310739,0.00368165,0.0003915043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4389106,0.0005499132,0.5595706,0.0001461832,0.0006654885,0.00003922836,0.000003473457,0.000004236668,0.0001102399],"genre_scores_gemma":[0.8887986,0.000008835479,0.1109879,0.00003629525,0.0001426296,9.380003e-7,5.466287e-7,0.000001968335,0.00002230659],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.449888,"threshold_uncertainty_score":0.1594348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2945154147","doi":"10.1002/nla.559","title":"Distance‐two interpolation for parallel algebraic multigrid","year":2007,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":103,"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":"Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Multigrid method; Scalability; Interpolation (computer graphics); Parallel computing; Convergence (economics); Computer science; Mathematics; Algorithm; Computational science; Partial differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.01267897775696264,"gpt":0.2831024832464812,"spread":0.2704235054895186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002863577,0.0001595212,0.0001460855,0.0001218798,0.0002650243,0.00007593315,0.0004091002,0.00004985603,0.00001144947],"category_scores_gemma":[0.00003632034,0.0001408147,0.00007079913,0.0008615214,0.00004654997,0.0002332129,0.00005818829,0.0001111041,0.00006062531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003923979,"about_ca_system_score_gemma":0.00007194395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008648601,"about_ca_topic_score_gemma":0.00001755472,"domain_scores_codex":[0.9986317,0.00002011985,0.0003218886,0.0004724356,0.000259705,0.0002942121],"domain_scores_gemma":[0.9987648,0.0002792467,0.0001357905,0.0004143321,0.0002376588,0.0001682141],"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.0001183196,0.0003076294,0.0006893945,0.00002046286,0.0000439732,0.000001273144,0.0001824801,0.01144566,0.001163038,0.853386,0.0008712664,0.1317705],"study_design_scores_gemma":[0.001469993,0.0002835989,0.00569259,0.00001341764,0.00002380699,0.00002292134,0.00002819663,0.8068739,0.001674093,0.02068299,0.1627712,0.000463342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00102146,0.00007874627,0.9964535,0.0008213416,0.0000869726,0.000890103,0.000008910748,0.0001979663,0.0004409669],"genre_scores_gemma":[0.3980796,0.000002426749,0.6004215,0.0004429102,0.0003332352,0.000392397,0.0001264595,0.00001315893,0.0001882999],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8327031,"threshold_uncertainty_score":0.5742258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017232301","doi":"10.1145/1230040.1230069","title":"Comparing interest management algorithms for massively multiplayer games","year":2006,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":103,"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":"Computer science; Massively parallel; Distributed computing; Visibility; Algorithm; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.05807698449448591,"gpt":0.2795179095012167,"spread":0.2214409250067308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001047269,0.00008016863,0.0000786642,0.0001091278,0.00008982384,0.0001447065,0.0002620051,0.00001831912,0.00000866061],"category_scores_gemma":[0.000003688875,0.00007338322,0.00004602625,0.0001691912,0.000008851888,0.0002324407,0.0001223797,0.00002719061,0.00002930199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002500936,"about_ca_system_score_gemma":0.000007974211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001522258,"about_ca_topic_score_gemma":0.00002447919,"domain_scores_codex":[0.9993339,0.00001110477,0.0001568627,0.0002421298,0.000107976,0.0001480727],"domain_scores_gemma":[0.9996696,0.00005475613,0.00004059943,0.0001429533,0.00006359749,0.00002852339],"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.000007288093,0.0001152877,0.0005439945,0.00002492154,0.00002663089,0.000005665641,0.00004285431,0.02718295,0.0005821508,0.8505343,0.01528791,0.105646],"study_design_scores_gemma":[0.0005831469,0.00003218889,0.01375195,0.000008965995,0.000004659437,0.000004547142,0.00001579831,0.9382024,0.004587326,0.0116087,0.03105308,0.0001472446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01226137,0.00003191844,0.9790305,0.0004560022,0.0003320517,0.0002103008,0.000001000362,0.0001139878,0.007562873],"genre_scores_gemma":[0.6202176,9.652276e-7,0.3763141,0.0001206163,0.00009638644,0.00002989693,0.00001255444,0.000002912411,0.003204992],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9110194,"threshold_uncertainty_score":0.2992481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030083434","doi":"10.1016/s0012-365x(03)00287-5","title":"Generalized cover-free families","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Cover (algebra); Generalization; Mathematics; Set (abstract data type); Combinatorics; Set cover problem; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01802210635800287,"gpt":0.2506576086366595,"spread":0.2326355022786567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002520184,0.0001181589,0.0001381992,0.00008393375,0.0001119811,0.0001447896,0.0004818964,0.00003659913,0.00004668858],"category_scores_gemma":[0.0002324752,0.0001031789,0.00006689468,0.0003472708,0.00002258392,0.0002522054,0.0001058267,0.00005394868,0.0001394739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001900988,"about_ca_system_score_gemma":0.00005083229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001478383,"about_ca_topic_score_gemma":0.000001059796,"domain_scores_codex":[0.9990729,0.00004953296,0.0002215958,0.0001973035,0.0002871155,0.0001715372],"domain_scores_gemma":[0.9991059,0.00009987775,0.00007740426,0.0005852098,0.00006915357,0.00006241183],"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":[5.911749e-7,0.00003497771,0.00001081841,0.00002086344,0.0000117487,0.000001777997,0.00058421,0.001917536,0.0004735744,0.9916904,0.004423429,0.0008300663],"study_design_scores_gemma":[0.0009625249,0.00006984621,0.00008389835,0.00002717248,0.00001837926,0.00005238354,0.0001470449,0.2687305,0.01703398,0.6428007,0.06962553,0.0004479869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01613078,0.0001174709,0.9420903,0.0002027614,0.0002635291,0.0001176661,0.00000413063,0.0001116604,0.04096169],"genre_scores_gemma":[0.2187395,0.00003214916,0.7779049,0.000376055,0.00005663705,0.0000208989,0.00001156019,0.00001274521,0.002845539],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3488896,"threshold_uncertainty_score":0.4207513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098355410","doi":"10.1142/s0218195902000748","title":"APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Annulus (botany); Mathematics; Combinatorics; Cylinder; Dimension (graph theory); Upper and lower bounds; Running time; Point (geometry); Simple (philosophy); RADIUS; Set (abstract data type); Approximation algorithm; Geometry; Mathematical analysis; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02034885522583841,"gpt":0.2588979367072863,"spread":0.2385490814814479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008095333,0.000239076,0.0002654166,0.0006959634,0.0004128119,0.000600424,0.001440907,0.0000804876,0.00008752519],"category_scores_gemma":[0.0001688025,0.0002013958,0.0001787397,0.001040453,0.00015114,0.0007662894,0.0002289953,0.0003502967,0.00003809543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001115644,"about_ca_system_score_gemma":0.0001124983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004120121,"about_ca_topic_score_gemma":0.000001366274,"domain_scores_codex":[0.9969758,0.0001215963,0.001041571,0.0003767475,0.001232514,0.0002517255],"domain_scores_gemma":[0.9959829,0.001218865,0.00090234,0.0002789564,0.001442982,0.0001739503],"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.00002322337,0.0005108888,0.001413712,0.00002701635,0.0004080459,0.00002621177,0.0008692846,0.1293278,0.0005467873,0.09936512,0.001989493,0.7654924],"study_design_scores_gemma":[0.002367997,0.000284774,0.01182621,0.0001224416,0.00009956628,0.002662722,0.0002339163,0.6560636,0.0006937225,0.2537228,0.07115419,0.0007681505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01069547,0.002066489,0.9804131,0.004709309,0.0005452913,0.0003570601,0.00001806468,0.00004757661,0.001147675],"genre_scores_gemma":[0.7307082,0.0001628859,0.2670048,0.0009861945,0.0008852676,0.00006089681,0.00002500208,0.0000152726,0.0001515493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7647243,"threshold_uncertainty_score":0.8212683,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2218835040","doi":"10.1016/j.comgeo.2005.10.002","title":"Faster core-set constructions and data-stream algorithms in fixed dimensions","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":95,"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; Dimension (graph theory); Cylinder; RADIUS; Constant (computer programming); Annulus (botany); Set (abstract data type); Core (optical fiber); Algorithm; Fixed point; Space (punctuation); Geometry; Combinatorics; Discrete mathematics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05293009317713095,"gpt":0.3119878267126572,"spread":0.2590577335355262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003528403,0.0001782187,0.0001939047,0.0006185721,0.0002047213,0.0001648915,0.0005488716,0.00007425792,0.0000524754],"category_scores_gemma":[0.000104484,0.0001875357,0.00003318575,0.001262482,0.00009678354,0.0009780825,0.0005814008,0.0001865654,0.00008744856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005656618,"about_ca_system_score_gemma":0.0001473215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001382113,"about_ca_topic_score_gemma":0.00002314172,"domain_scores_codex":[0.9982368,0.00005783042,0.0004041823,0.0006526543,0.000390889,0.0002575879],"domain_scores_gemma":[0.998675,0.000456589,0.0001039854,0.0004651807,0.0001574652,0.0001417567],"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.00001463252,0.0003173271,0.009051899,0.00002288484,0.00007062944,0.00002533944,0.0005556559,0.5106943,0.0001921663,0.09941574,0.007546513,0.3720929],"study_design_scores_gemma":[0.0007161441,0.00003735191,0.03921047,0.00001764337,0.00000794101,0.0001668411,0.00004478721,0.9398227,0.00004100757,0.01035088,0.009338612,0.000245649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2452228,0.0005745543,0.7510892,0.00174399,0.0004617609,0.0002139289,0.0001167685,0.0001229545,0.0004540806],"genre_scores_gemma":[0.6993304,0.00001896953,0.29926,0.0005812285,0.0001821773,0.0000101075,0.0004598638,0.000007923828,0.0001494122],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4541076,"threshold_uncertainty_score":0.7647483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089645963","doi":"10.1016/j.comgeo.2008.04.001","title":"Flips in planar graphs","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Planar graph; Book embedding; Embedding; Combinatorics; Planar straight-line graph; 1-planar graph; Pathwidth; Outerplanar graph; Perspective (graphical); Computer science; Line graph; Mathematics; Graph; Discrete mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02379017878520906,"gpt":0.240610032298463,"spread":0.216819853513254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002569694,0.0001535865,0.0001726394,0.0009414827,0.0001991911,0.00005380092,0.000494225,0.00006586757,0.00003408162],"category_scores_gemma":[0.00007227118,0.0001668504,0.0000759717,0.002430052,0.00005545657,0.0005266971,0.00009072852,0.0001669299,0.0001936407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005993452,"about_ca_system_score_gemma":0.000174498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001281826,"about_ca_topic_score_gemma":0.000004008792,"domain_scores_codex":[0.9983729,0.00006868546,0.0003467623,0.0004236303,0.0005207077,0.0002673672],"domain_scores_gemma":[0.9991383,0.0002977097,0.00008199902,0.0002286066,0.0001451428,0.0001082219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001600798,0.0002942792,0.01725026,0.0000173331,0.00002845586,0.000194673,0.0005670196,0.4791096,0.000145534,0.4793279,0.005625219,0.01742375],"study_design_scores_gemma":[0.001035055,0.00009307599,0.4498663,0.00001822314,0.000002637072,0.0004009601,0.00001637897,0.3873247,0.0001769618,0.155838,0.004800023,0.0004276682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3384956,0.0003296349,0.6578926,0.0005653022,0.0004122763,0.0001219403,0.000004499288,0.0001365044,0.002041597],"genre_scores_gemma":[0.9026082,0.00001896694,0.09627854,0.0006772454,0.00008022547,0.00001386154,0.00006699926,0.000007717325,0.0002482179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5641127,"threshold_uncertainty_score":0.6803961,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967421215","doi":"10.1016/j.jcta.2006.08.002","title":"On the maximum number of edges in quasi-planar graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":90,"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; Combinatorics; Planar graph; Planar; Simple (philosophy); Upper and lower bounds; Pairwise comparison; Book embedding; Multiple edges; Matching (statistics); Graph; Discrete mathematics; 1-planar graph; Line graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.007860445494885649,"gpt":0.2300400927524089,"spread":0.2221796472575232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001251451,0.000091095,0.0001883042,0.0001435547,0.0000665702,0.00005562294,0.0004579721,0.00004368752,0.00003251622],"category_scores_gemma":[0.0001467781,0.00006201771,0.00009775014,0.0004797738,0.0000608427,0.0003605999,0.00003338783,0.0001651396,0.000004235519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002591724,"about_ca_system_score_gemma":0.00008702296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000761163,"about_ca_topic_score_gemma":0.000002376321,"domain_scores_codex":[0.99874,0.0002802979,0.0004224417,0.00008781514,0.0003547025,0.000114699],"domain_scores_gemma":[0.9986471,0.0006197542,0.0003381178,0.0001706107,0.0001966214,0.00002779768],"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.0001956679,0.000186172,0.00020529,0.000004432591,0.00001284082,0.00001148691,0.0001473028,0.0004427074,0.0003453191,0.9958749,0.001066701,0.001507162],"study_design_scores_gemma":[0.0005207344,0.0003256677,0.0011655,0.00003022548,0.000004434642,0.00005706823,0.00005766544,0.00007645039,0.004515385,0.9910859,0.002094828,0.00006614425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9473681,0.0001915346,0.03794742,0.002069772,0.005914647,0.0001340462,0.000002383251,0.00001515934,0.006356908],"genre_scores_gemma":[0.9985843,0.00001274762,0.0009724721,0.00008179379,0.0002422905,0.000001563672,6.92696e-7,0.000004174241,0.00009995959],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05121618,"threshold_uncertainty_score":0.2529009,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786889022","doi":"10.1007/s00453-005-1168-8","title":"Constructing Plane Spanners of Bounded Degree and Low Weight","year":2005,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Bounded function; Degree (music); Combinatorics; Mathematics; Plane (geometry); Theory of computation; Spanner; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Binary logarithm; Spanning tree; Point (geometry); Tree (set theory); Discrete mathematics; Geometry; Algorithm; Computer science; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01287707065722272,"gpt":0.2251614993913839,"spread":0.2122844287341611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001119111,0.000067667,0.00009652803,0.00008345611,0.00006107245,0.00004170998,0.000156809,0.00003106908,0.00001175889],"category_scores_gemma":[0.00002023129,0.00006637978,0.00002039816,0.0001908742,0.00004944436,0.0002350592,0.000071063,0.0000535377,0.000008949119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001856205,"about_ca_system_score_gemma":0.00004626284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000826963,"about_ca_topic_score_gemma":0.000008133055,"domain_scores_codex":[0.9993854,0.00002050265,0.0001567109,0.0001787951,0.000142861,0.0001157101],"domain_scores_gemma":[0.9996082,0.0000858317,0.00006886258,0.0001296262,0.00005660929,0.00005090715],"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.000002991749,0.00002312756,0.000204413,0.000009372109,0.00001635296,0.000003046627,0.0001707311,0.0001887821,0.00100393,0.05952656,0.0003387563,0.9385119],"study_design_scores_gemma":[0.001218603,0.0001358205,0.003376977,0.00004520955,0.00001660648,0.0003078603,0.00008976031,0.8647024,0.1078585,0.01036354,0.01149055,0.0003941852],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2539089,0.000300061,0.7404502,0.001715212,0.000345356,0.0001027849,0.00000715969,0.00007187593,0.003098435],"genre_scores_gemma":[0.6990108,0.000007544495,0.3005969,0.0001038542,0.0001606255,0.000001645427,0.000007669005,0.000002770735,0.0001082162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9381177,"threshold_uncertainty_score":0.2706889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061274508","doi":"10.1007/s4540010065","title":"Generalizing Ham Sandwich Cuts to Equitable Subdivisions","year":2000,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":85,"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":"Mathematics; Combinatorics; Subdivision; Disjoint sets; Plane (geometry); Generalization; Regular polygon; General position; Cutting-plane method; Discrete mathematics; Geometry; Algorithm; Mathematical analysis; Integer programming","retraction":null,"screen_n_in":null,"score":{"opus":0.01543526335105674,"gpt":0.2780546105862947,"spread":0.262619347235238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005717736,0.0003081118,0.0002906633,0.0006434997,0.0007018498,0.0005059381,0.0009080007,0.00009029847,0.0009549916],"category_scores_gemma":[0.00007920709,0.0003175152,0.0001620453,0.002823028,0.00003837011,0.0009054299,0.0003821457,0.0001926563,0.001327337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009952211,"about_ca_system_score_gemma":0.0001872142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004071218,"about_ca_topic_score_gemma":0.000005956685,"domain_scores_codex":[0.996807,0.000113912,0.0005319182,0.0008324338,0.0009601374,0.000754619],"domain_scores_gemma":[0.9984506,0.0002869803,0.00009096247,0.000487458,0.0002878735,0.0003960878],"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.00001778499,0.00009594368,0.0004307463,0.0000112354,0.00004364006,0.00001469516,0.0003258327,0.8327644,0.0003778479,0.05687309,0.01091945,0.09812533],"study_design_scores_gemma":[0.00113145,0.0003118295,0.04924025,0.00007276644,0.00002748204,0.0001080684,0.00004607561,0.808436,0.0007778331,0.04394246,0.09476218,0.001143596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1870465,0.0003005449,0.8018219,0.001950582,0.0004448138,0.0002856787,0.00003338266,0.0002750593,0.007841528],"genre_scores_gemma":[0.8244002,0.0000138658,0.1682724,0.002737567,0.0003253194,0.00004074526,0.0002402542,0.00002378278,0.003945918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6373537,"threshold_uncertainty_score":0.9999583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006095056","doi":"10.1016/j.comgeo.2013.04.002","title":"On plane geometric spanners: A survey and open problems","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Spanner; Enhanced Data Rates for GSM Evolution; Graph; Mathematics; Plane (geometry); Path (computing); Discrete mathematics; Computer science; Geometry; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03540804549230224,"gpt":0.2662650854645597,"spread":0.2308570399722574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007609783,0.0002326584,0.0002645939,0.001006598,0.0002715999,0.001142357,0.001044322,0.0000833847,0.0001734191],"category_scores_gemma":[0.0003752983,0.0002222036,0.00004180737,0.002947249,0.00005346983,0.001189178,0.0006797103,0.0001851603,0.0005829494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005611323,"about_ca_system_score_gemma":0.0001269257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000225384,"about_ca_topic_score_gemma":0.00000981319,"domain_scores_codex":[0.9978756,0.0001686654,0.0003748988,0.0006770325,0.0005757142,0.0003281058],"domain_scores_gemma":[0.9974014,0.00148598,0.000159335,0.0003252591,0.0004017384,0.000226309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00003774224,0.0006988095,0.01654714,0.00007678517,0.0001649288,0.00001433409,0.0002691579,0.5677757,0.0001000167,0.1658781,0.05513448,0.1933028],"study_design_scores_gemma":[0.00105443,0.0003751086,0.6445335,0.00002997811,0.000003685662,0.00005723823,0.00001146657,0.247763,0.0000529086,0.1042723,0.001371361,0.0004750603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.293777,0.0003348247,0.7016726,0.0009998312,0.0004112179,0.0007857981,0.0000270426,0.0001340165,0.001857622],"genre_scores_gemma":[0.9551761,0.0000124275,0.04237799,0.001307856,0.00007436715,0.00007747089,0.0002740451,0.00001477189,0.0006849787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.661399,"threshold_uncertainty_score":0.9998946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3023768696","doi":"10.1016/b978-044482537-7/50012-7","title":"Polygon Decomposition","year":2000,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decomposition; Polygon (computer graphics); Computer science; Chemistry; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01166797002094292,"gpt":0.2437992810659866,"spread":0.2321313110450437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001306969,0.0002850419,0.0002509388,0.0002577887,0.000152946,0.000159055,0.0005073968,0.0002038456,0.0002460012],"category_scores_gemma":[0.000002451263,0.0002998306,0.0001737559,0.00002762376,0.00003250155,0.0001420237,0.0001179432,0.0002476202,0.0007998289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007133862,"about_ca_system_score_gemma":0.0001191293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.99102e-7,"about_ca_topic_score_gemma":0.000003236833,"domain_scores_codex":[0.9985774,0.00002402653,0.0003282623,0.0005035048,0.0003692244,0.0001975442],"domain_scores_gemma":[0.9991078,0.00004684196,0.0001434145,0.0005121643,0.00008070513,0.000109024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000035664,0.000005003787,7.992278e-8,0.000007995534,0.00002110814,0.00001416293,0.00006102522,0.0000602467,0.00004176897,0.1033245,0.0002173818,0.8962432],"study_design_scores_gemma":[0.0001253597,0.00005421994,0.000009516188,0.00008493681,0.00001868811,0.00004853206,1.965971e-7,0.001094988,0.0001971696,0.109217,0.8888338,0.0003156502],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00002381882,0.0007005885,0.007038594,0.0001557611,0.0005403121,0.0002403557,0.000008250102,0.0001736286,0.9911187],"genre_scores_gemma":[0.001418067,0.00007501802,0.009713884,0.0007550583,0.0005083731,0.00001396436,0.00007236996,0.00002891923,0.9874144],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8959275,"threshold_uncertainty_score":0.9999782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004826883","doi":"10.1016/s0925-7721(01)00070-0","title":"Efficient visibility queries in simple polygons","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","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":"University of Waterloo; Carleton University","funders":"","keywords":"Visibility polygon; Simple polygon; Visibility; Polygon (computer graphics); Rectilinear polygon; Point in polygon; Combinatorics; Star-shaped polygon; Polygon covering; Vertex (graph theory); Representation (politics); Mathematics; Line segment; Point (geometry); Preprocessor; Computer science; Regular polygon; Artificial intelligence; Geometry; Graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02082431976738206,"gpt":0.2527533371724667,"spread":0.2319290174050846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003894924,0.0001732584,0.0001904556,0.0006431672,0.0001752585,0.0001471475,0.0004605469,0.00006636647,0.0002407263],"category_scores_gemma":[0.0001817862,0.00018515,0.00008445505,0.002321129,0.00005973735,0.0002369906,0.0002055252,0.0001663502,0.0002589685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001161815,"about_ca_system_score_gemma":0.00005926906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001777072,"about_ca_topic_score_gemma":0.00000783322,"domain_scores_codex":[0.9980943,0.0001024298,0.0004227118,0.0005317263,0.0005290977,0.0003196961],"domain_scores_gemma":[0.9988626,0.0004263711,0.00009482326,0.0003272529,0.0001693322,0.0001196818],"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.00000366022,0.0002798352,0.002951051,0.00001172276,0.000008903925,0.00001138626,0.0003054854,0.9142763,0.00004852664,0.05706196,0.001078181,0.02396297],"study_design_scores_gemma":[0.0003805868,0.00004397176,0.07878365,0.000007277701,0.000001830398,0.00001993012,0.00001796165,0.8976396,0.00006823062,0.02143754,0.00139833,0.0002010532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3986208,0.0004142172,0.5982456,0.0008327318,0.0002784161,0.0001497222,0.00000813831,0.0001289257,0.00132142],"genre_scores_gemma":[0.9584708,0.000003756536,0.04070631,0.0004937429,0.00008663422,0.00001650663,0.00003198962,0.000007927475,0.0001822778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.55985,"threshold_uncertainty_score":0.7550197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037537665","doi":"10.1145/363647.363652","title":"Dynamic planar convex hull operations in near-logarithmic amortized time","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":81,"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":"Convex hull; Amortized analysis; Combinatorics; Binary logarithm; Logarithm; Mathematics; Regular polygon; Tangent; Constant (computer programming); Planar; Set (abstract data type); Time complexity; Computational geometry; Hull; Data structure; Discrete mathematics; Computer science; Algorithm; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01096369959703388,"gpt":0.2529968227406693,"spread":0.2420331231436354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004319128,0.00006231634,0.0001213881,0.0001131593,0.0001201848,0.0001319226,0.001412334,0.00003082841,0.00003606012],"category_scores_gemma":[0.0003426506,0.00004358725,0.00007278801,0.0004771765,0.00002398732,0.0003705171,0.0001922864,0.0001702003,0.00004133901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006333552,"about_ca_system_score_gemma":0.0001740244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009641689,"about_ca_topic_score_gemma":0.00003499245,"domain_scores_codex":[0.9991579,0.00009486722,0.0003035704,0.00008937676,0.0002447159,0.0001095457],"domain_scores_gemma":[0.9992017,0.00008527985,0.000124973,0.000430386,0.0001143654,0.00004331243],"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.0001503266,0.0005719457,0.007414882,0.00001328667,0.0001436182,0.0002984294,0.002437162,0.8645586,0.06216513,0.008178102,0.01823115,0.03583735],"study_design_scores_gemma":[0.001304615,0.000131213,0.06978435,0.00004634535,0.00001402939,0.0009298539,0.00001730937,0.8982294,0.0005903175,0.02166256,0.007139625,0.0001504395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9145103,0.0001331577,0.06740082,0.01703977,0.0005993637,0.00009792042,0.000001024257,0.00001152814,0.0002061051],"genre_scores_gemma":[0.9319379,0.00002827385,0.06587866,0.0008527808,0.00008705327,0.00000159,0.000001473381,0.000004309121,0.001207913],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06236947,"threshold_uncertainty_score":0.2624492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967720527","doi":"10.1145/2601097.2601164","title":"Computing layouts with deformable templates","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"King Abdullah University of Science and Technology; National Science Foundation","keywords":"Template; Computer science; Domain (mathematical analysis); Set (abstract data type); Class (philosophy); Algorithm; Theoretical computer science; Computer graphics (images); Artificial intelligence; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0138497956981409,"gpt":0.2283532581461146,"spread":0.2145034624479737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002316162,0.0001182033,0.0001004181,0.0002387333,0.0004114836,0.000115729,0.0004284695,0.00004788421,0.000006416873],"category_scores_gemma":[0.00001168369,0.00009978346,0.00005156562,0.0008629267,0.00003177075,0.0003651068,0.000008902835,0.0001692608,0.00002785071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001360592,"about_ca_system_score_gemma":0.00003567357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001338774,"about_ca_topic_score_gemma":0.00003334121,"domain_scores_codex":[0.9991121,0.00004515918,0.0001482373,0.0002550394,0.0002511378,0.000188353],"domain_scores_gemma":[0.9990883,0.0002213162,0.0000518213,0.0004621368,0.000103437,0.00007293831],"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.0000367024,0.0002982587,0.0006576774,0.00003543478,0.00009686453,0.000004808299,0.0007705831,0.6068221,0.0003051753,0.1221659,0.0002750847,0.2685314],"study_design_scores_gemma":[0.0008534438,0.0005956682,0.003611661,0.0000523074,0.00002474685,0.00008473129,0.0000276756,0.9517127,0.006242533,0.02509526,0.0112826,0.000416716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03562681,0.00001364366,0.962301,0.001099503,0.0002068313,0.00008233046,0.000001598668,0.0001924272,0.0004758884],"genre_scores_gemma":[0.9069284,0.000009686712,0.09220728,0.0007302487,0.00003394113,0.000005540025,0.000004939282,0.00000709174,0.00007290595],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8713015,"threshold_uncertainty_score":0.4069051,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017440808","doi":"10.1007/s00453-001-0014-x","title":"A One-Step Crust and Skeleton Extraction Algorithm","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":80,"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; Université Laval","funders":"","keywords":"Voronoi diagram; Skeleton (computer programming); Algorithm; Vertex (graph theory); Computer science; Crust; Topology (electrical circuits); Combinatorics; Mathematics; Geology; Geometry; Theoretical computer science; Graph; Geophysics","retraction":null,"screen_n_in":null,"score":{"opus":0.01591968665295741,"gpt":0.2586402464377212,"spread":0.2427205597847638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000177543,0.0001127574,0.0001149804,0.0001474265,0.0001742541,0.0001595949,0.0002086434,0.0000648767,0.00002883],"category_scores_gemma":[0.00002134471,0.0001259993,0.00003694196,0.0004607251,0.00002676203,0.0006046005,0.00009864508,0.000117177,0.00007038559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003538219,"about_ca_system_score_gemma":0.00004268644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003941803,"about_ca_topic_score_gemma":0.000005004019,"domain_scores_codex":[0.9989396,0.00004396546,0.0001816102,0.0003669022,0.0002586147,0.0002092542],"domain_scores_gemma":[0.9994122,0.00008332985,0.0000653859,0.0002347506,0.00009537812,0.0001089783],"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.000002168624,0.00005620467,0.00001918078,0.000002602777,0.000010954,0.00001205316,0.00005674234,0.00007349928,0.0006078306,0.005148272,0.0004581813,0.9935523],"study_design_scores_gemma":[0.0005306557,0.0001421458,0.007109091,0.00001457463,0.00001279158,0.000278943,0.000020128,0.882218,0.002514835,0.006888985,0.09996653,0.000303326],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008277969,0.0002589516,0.9877921,0.001342098,0.0004110251,0.0001237698,0.000001999015,0.0001474717,0.001644649],"genre_scores_gemma":[0.1524191,0.0001994368,0.8444971,0.0006781601,0.0007164988,0.00002805005,0.00002461732,0.00001403107,0.001422983],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.993249,"threshold_uncertainty_score":0.5138102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156308991","doi":"10.46298/dmtcs.346","title":"Stacks, Queues and Tracks: Layouts of Graph Subdivisions","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":78,"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; Ministerio de Economía y Competitividad","keywords":"Combinatorics; Subdivision; Vertex (graph theory); Queue; Mathematics; Bounded function; Graph; Discrete mathematics; Planar graph; Computer science; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.01169885412521341,"gpt":0.267115975801654,"spread":0.2554171216764406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000940285,0.0001836064,0.0002550301,0.0002819202,0.0002870877,0.0003257326,0.001107715,0.00004596684,0.00002572078],"category_scores_gemma":[0.0001184175,0.0001466538,0.00007447212,0.001039153,0.001328642,0.0007826084,0.0006292932,0.0001218876,0.00001528472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001991035,"about_ca_system_score_gemma":0.00009617172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001302197,"about_ca_topic_score_gemma":0.000001171561,"domain_scores_codex":[0.997902,0.00005860818,0.0004446252,0.0005031329,0.000744554,0.0003470191],"domain_scores_gemma":[0.9984488,0.0003751672,0.000136696,0.0005603219,0.0002548356,0.0002241607],"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.000001806271,0.00008768157,0.00001601695,0.00002299674,0.000005718937,0.000001229722,0.001847593,0.0008591644,0.0009020118,0.9779512,0.00003280392,0.01827175],"study_design_scores_gemma":[0.0001456311,0.0001086726,0.0002836942,0.0000424071,0.000007504294,0.00002324798,0.00003834966,0.713289,0.004891853,0.2809325,0.000073349,0.0001637442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08440734,0.000137934,0.9128895,0.0008481061,0.000135374,0.000157644,0.000005066432,0.00008383332,0.001335177],"genre_scores_gemma":[0.6177095,0.00001176912,0.3821017,0.0001101949,0.00004982468,0.000003225096,0.000001368253,0.000004576496,0.000007841006],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7124299,"threshold_uncertainty_score":0.5980369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152434295","doi":"10.1007/3-540-45995-2_42","title":"On the Spanning Ratio of Gabriel Graphs and β-skeletons","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":77,"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; McGill University; Carleton University","funders":"","keywords":"Combinatorics; Spanning tree; Spanner; Minimum spanning tree; Mathematics; Euclidean geometry; Delaunay triangulation; Euclidean minimum spanning tree; Minimum degree spanning tree; Graph; Discrete mathematics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01968377711523045,"gpt":0.2320756318609418,"spread":0.2123918547457114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801559,0.0002681271,0.0002617147,0.0005833593,0.0002685417,0.0002415018,0.001149792,0.000122852,0.0000242334],"category_scores_gemma":[0.0001173635,0.0002012297,0.00007542964,0.0006188717,0.0004596521,0.000261637,0.0004461648,0.0004088413,0.00000908254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004661134,"about_ca_system_score_gemma":0.000147039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000621397,"about_ca_topic_score_gemma":0.000006459486,"domain_scores_codex":[0.9979722,0.00003468322,0.0003365522,0.0007256638,0.0006693985,0.0002614349],"domain_scores_gemma":[0.9978399,0.001032101,0.0002165284,0.0006649505,0.0001730527,0.00007343994],"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.000002175635,0.0000177373,0.00001291972,0.00001365507,0.000009941249,0.000008858551,0.0005543005,0.06997497,0.0002323881,0.6881397,0.00009517505,0.2409381],"study_design_scores_gemma":[0.0001125149,0.0001551114,0.0002310756,0.0001617247,0.000005473642,0.00002731382,1.157109e-7,0.5738688,0.001457466,0.4233108,0.00042446,0.0002451297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001017821,0.0003425701,0.9932287,0.001503204,0.0005811454,0.0002379594,0.000002552686,0.00004309294,0.003043003],"genre_scores_gemma":[0.8451791,0.000110063,0.1508639,0.002650054,0.0002147144,0.00001021808,0.00000467426,0.00002277245,0.0009445128],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8441613,"threshold_uncertainty_score":0.8205909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990570114","doi":"10.1111/j.1467-8659.2008.01288.x","title":"Motorcycle Graphs: Canonical Quad Mesh Partitioning","year":2008,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":76,"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":"Polygon mesh; Quadrilateral; Computer science; Volume mesh; T-vertices; Graph; Mathematics; Mesh generation; Algorithm; Theoretical computer science; Computer graphics (images); Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.02217438734518685,"gpt":0.2382703697498122,"spread":0.2160959824046254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002286955,0.0002013039,0.0002039645,0.0003361151,0.0006458607,0.000144687,0.0006878587,0.00009826732,0.00001197003],"category_scores_gemma":[0.00001238369,0.0002089362,0.000191774,0.001127567,0.0001113675,0.0006531923,0.0003074302,0.0002214442,0.00005546988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002942802,"about_ca_system_score_gemma":0.0001486647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003720466,"about_ca_topic_score_gemma":0.00003156556,"domain_scores_codex":[0.9981243,0.00009001535,0.0003567995,0.0005269287,0.0004508012,0.0004511259],"domain_scores_gemma":[0.9988684,0.0001278043,0.0001050455,0.0005138143,0.0001887636,0.0001961645],"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.000005814024,0.000137339,0.007345057,0.000008794957,0.00004264059,0.0000576679,0.0003014635,0.002923843,0.00007939272,0.9603597,0.01893446,0.009803833],"study_design_scores_gemma":[0.0007532618,0.0002873357,0.03268941,0.00003042627,0.000009847436,0.0003415177,0.000008301178,0.8717963,0.0007611426,0.06173272,0.03101569,0.0005740491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07810605,0.0002116944,0.9183025,0.001241314,0.001224697,0.0001542748,0.000003148256,0.0003191694,0.0004371322],"genre_scores_gemma":[0.9438329,0.00007737064,0.05366106,0.002023916,0.0002311672,0.00002647598,0.00002941644,0.00001313643,0.0001045152],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.898627,"threshold_uncertainty_score":0.8520172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1561451935","doi":"10.1016/j.comgeo.2011.05.006","title":"A survey of geodesic paths on 3D surfaces","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geodesic; Mathematics; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06421114022435775,"gpt":0.2657591208987997,"spread":0.2015479806744419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007739206,0.0001748499,0.0002269912,0.0005116011,0.0001123019,0.000045776,0.0005970815,0.00006835964,0.0001059672],"category_scores_gemma":[0.0002193716,0.0001737102,0.00007238908,0.001734148,0.00006370212,0.000322994,0.0001461477,0.0001200293,0.0001384345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000325009,"about_ca_system_score_gemma":0.0001833228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001080611,"about_ca_topic_score_gemma":0.000009210929,"domain_scores_codex":[0.9981655,0.0001821004,0.000418632,0.0004203783,0.0005900612,0.0002233288],"domain_scores_gemma":[0.9981096,0.0007017403,0.0002154358,0.0003219804,0.0005488347,0.0001024025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0001222057,0.001231393,0.03871638,0.0000748397,0.0001783231,0.00002482587,0.001239208,0.6354148,0.000216289,0.1704112,0.002568116,0.1498025],"study_design_scores_gemma":[0.0003111997,0.0002224613,0.7293915,0.00001682065,0.000004440385,0.000007165796,0.000005858077,0.2582165,0.0006568339,0.01083893,0.0001305703,0.0001977945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3629781,0.0002013947,0.6336931,0.00003885034,0.0004359757,0.000127305,0.00002887553,0.00008478149,0.002411622],"genre_scores_gemma":[0.9138489,0.000005354954,0.0856568,0.0002314829,0.00003243209,0.000006682549,0.00008910737,0.000009402608,0.0001197846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6906751,"threshold_uncertainty_score":0.7083696,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3103264504","doi":"","title":"Drawings of planar graphs with few slopes and segments","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University","keywords":"Planar graph; Outerplanar graph; Combinatorics; Planar; Plane (geometry); Mathematics; 1-planar graph; Graph drawing; Book embedding; Pathwidth; Graph; Geometry; Chordal graph; Computer science; Line graph; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.006289727804461909,"gpt":0.2053432522212252,"spread":0.1990535244167633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006323285,0.0000417106,0.00005054504,0.0000686413,0.00003798212,0.00003090426,0.00009301666,0.000010929,0.000008606233],"category_scores_gemma":[0.000002322991,0.00003121732,0.000008482476,0.0001901124,0.00001513812,0.0002646039,0.00002396459,0.00001800458,0.000003728897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003640979,"about_ca_system_score_gemma":0.00001696699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008695111,"about_ca_topic_score_gemma":0.00001345251,"domain_scores_codex":[0.999625,0.000008202851,0.00007383352,0.0001147704,0.0001192902,0.00005892391],"domain_scores_gemma":[0.9998085,0.00002130633,0.00002735233,0.00007745765,0.00003526259,0.00003010144],"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.00002186855,0.0001324633,0.006989917,0.00002879144,0.00005387502,0.000004095363,0.001329966,0.004436534,0.005478549,0.542842,0.003015217,0.4356667],"study_design_scores_gemma":[0.006535845,0.002235738,0.2529508,0.0002029609,0.00006747664,0.0003386374,0.0002675848,0.2903054,0.2628637,0.06000029,0.1224941,0.001737485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.273912,0.00008431439,0.7220441,0.000774117,0.00002672503,0.00005562358,5.162784e-7,0.00003108825,0.003071507],"genre_scores_gemma":[0.7558343,0.000007513461,0.2434036,0.0002859318,0.00001423772,0.000001400309,0.0000015197,0.000001248338,0.0004501655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4828417,"threshold_uncertainty_score":0.1273005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980197133","doi":"10.1145/335305.335339","title":"Approximation algorithms for geometric shortest path problems","year":2000,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":74,"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":"Citation; Computer science; Bulgarian; Algorithm; Library science; Shortest path problem; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02778989724429457,"gpt":0.2526524067234931,"spread":0.2248625094791985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002724498,0.00008777815,0.00008459618,0.0001967804,0.0001275384,0.0001518923,0.0002626387,0.0000376467,0.0001410238],"category_scores_gemma":[0.00002356622,0.00007864895,0.00004979625,0.001100506,0.000008348258,0.0005069061,0.00002352331,0.00003684747,0.00008626746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002387156,"about_ca_system_score_gemma":0.00003921985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006400498,"about_ca_topic_score_gemma":0.000001448477,"domain_scores_codex":[0.9991198,0.00001633069,0.0001910743,0.0002876037,0.000210887,0.0001742808],"domain_scores_gemma":[0.9995098,0.00009030705,0.00003465462,0.0001949515,0.0001119021,0.00005836815],"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.000001964925,0.00008447304,0.00002919022,0.000008410138,0.000006775805,3.619635e-7,0.0000792401,0.03309431,0.0001432222,0.02402973,0.002246545,0.9402758],"study_design_scores_gemma":[0.000275484,0.0001157528,0.001029832,0.000004088181,0.000003221827,0.000009211375,0.00000293707,0.9601372,0.001057771,0.009803869,0.0274218,0.0001387829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004473089,0.00008435079,0.9893809,0.0004149503,0.0001496269,0.0004005902,0.000003086735,0.0001689694,0.004924449],"genre_scores_gemma":[0.4141366,0.00002650828,0.5784563,0.0004216773,0.0002243905,0.0001631436,0.00008454628,0.000008505633,0.006478346],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.940137,"threshold_uncertainty_score":0.3207211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124937241","doi":"10.1016/j.comgeo.2012.04.001","title":"Exact algorithms and APX-hardness results for geometric packing and covering problems","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":72,"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":"Packing problems; Mathematics; Combinatorics; Set packing; Monotone polygon; Cover (algebra); Unit square; Rectangle; Set (abstract data type); Polygon (computer graphics); Vertex cover; Algorithm; Plane (geometry); Set cover problem; Approximation algorithm; Square (algebra); Polyhedron; Vertex (graph theory); Geometry; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.03282671474468887,"gpt":0.2742536335580374,"spread":0.2414269188133486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001019166,0.0002151585,0.0002299643,0.0007847627,0.0003563299,0.0003038391,0.0002256338,0.00008425541,0.000003382846],"category_scores_gemma":[0.0003446234,0.000221715,0.00005588562,0.001515316,0.00005431104,0.001142644,0.0002646214,0.0001226785,0.000009107913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005488857,"about_ca_system_score_gemma":0.00006137416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006215826,"about_ca_topic_score_gemma":3.852273e-7,"domain_scores_codex":[0.9982004,0.000051966,0.0004011487,0.0004998164,0.0004197319,0.0004269096],"domain_scores_gemma":[0.9981867,0.0009509098,0.0001824167,0.0001836927,0.0002559487,0.0002403173],"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.00007802766,0.0003828145,0.009525032,0.0004434232,0.0001881256,0.000004764055,0.001757886,0.1787159,0.0003930629,0.07147086,0.00326906,0.733771],"study_design_scores_gemma":[0.00286607,0.0002648312,0.1575934,0.00007821234,0.00003471432,0.0002197192,0.00006668681,0.7905697,0.0004935617,0.01851025,0.02851107,0.0007918082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08522014,0.002760087,0.9101627,0.0004043975,0.0007452713,0.0003669103,0.00004075808,0.0001103302,0.0001893689],"genre_scores_gemma":[0.8374514,0.00005311635,0.161575,0.0002232829,0.0003734224,0.00004073932,0.0001182579,0.00001423325,0.0001505254],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7522312,"threshold_uncertainty_score":0.9041274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050666081","doi":"10.1145/369836.571192","title":"Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf","year":2000,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Computer science; Intuition; Algorithm; Presentation (obstetrics); Context (archaeology); Computational geometry; Artificial intelligence; Cognitive science","retraction":null,"screen_n_in":null,"score":{"opus":0.009808366371430902,"gpt":0.2592474286857505,"spread":0.2494390623143196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004637305,0.000197988,0.0002877536,0.0001351694,0.0001770929,0.0001040702,0.0004809977,0.00007451091,0.00028842],"category_scores_gemma":[0.0001146337,0.0002043865,0.00005862973,0.0007181487,0.00008017516,0.0004999367,0.0002100549,0.0001356612,0.0000199094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003966995,"about_ca_system_score_gemma":0.0001358351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005599533,"about_ca_topic_score_gemma":0.000003172529,"domain_scores_codex":[0.9983881,0.0001250305,0.0004310691,0.000473843,0.0003318622,0.0002501615],"domain_scores_gemma":[0.9985727,0.0004789681,0.0001611459,0.0004750873,0.0001251796,0.0001869002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001277186,0.0001173992,0.000745006,0.0005482108,0.00005224493,0.000002481567,0.00007017872,0.0005608074,0.0003710411,0.00343665,0.07386138,0.9202218],"study_design_scores_gemma":[0.001341631,0.0002064122,0.01581488,0.0008291021,0.00008671176,0.0002032442,0.00001932253,0.02822199,0.0006671468,0.04114448,0.9106827,0.0007823217],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03587414,0.09512503,0.8570107,0.006907393,0.0001628219,0.001596307,0.0002154615,0.0001851969,0.002922978],"genre_scores_gemma":[0.1046449,0.1310234,0.741229,0.0175783,0.000702826,0.0003811067,0.001090467,0.00008031897,0.003269634],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9194395,"threshold_uncertainty_score":0.8334639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148125855","doi":"10.1016/s0925-7721(02)00091-3","title":"Ununfoldable polyhedra with convex faces","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":70,"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; University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Combinatorics; Polygon (computer graphics); Mathematics; Integer points in convex polyhedra; Convex set; Geometry; Computer science; Algorithm; Convex optimization; Linear programming","retraction":null,"screen_n_in":null,"score":{"opus":0.01689624797118267,"gpt":0.2073866342601344,"spread":0.1904903862889518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001643879,0.000200336,0.0001912792,0.0003719754,0.000257732,0.0002455106,0.000521614,0.000061773,0.0006958646],"category_scores_gemma":[0.00003868496,0.0001813133,0.0000597912,0.001926202,0.00006758456,0.0007654993,0.0001595374,0.0001386835,0.0009162936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000532291,"about_ca_system_score_gemma":0.00004918596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007564393,"about_ca_topic_score_gemma":0.000001566974,"domain_scores_codex":[0.998246,0.00005143458,0.0002657351,0.0004790049,0.0006549572,0.0003029275],"domain_scores_gemma":[0.998962,0.0002553164,0.0001201027,0.0002921059,0.0002160863,0.0001544258],"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.00001184412,0.0002739155,0.002756629,0.00002424302,0.00008938272,0.00004165584,0.0003562704,0.7768496,0.0001206681,0.1227678,0.0237023,0.07300577],"study_design_scores_gemma":[0.0009055333,0.000236626,0.01430422,0.00001887201,0.0000117952,0.0001730843,0.00001999567,0.9376878,0.0004355215,0.01922693,0.02649515,0.0004844874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0501572,0.0005197992,0.9399686,0.001775689,0.0002854428,0.0001641284,0.000005846389,0.0002621275,0.006861143],"genre_scores_gemma":[0.8625239,0.000009353226,0.1341128,0.001095052,0.0001152279,0.00001600311,0.00002963547,0.0000126586,0.002085392],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8123666,"threshold_uncertainty_score":0.9998616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137498124","doi":"10.1006/jagm.2000.1132","title":"Efficient Algorithms for Petersen's Matching Theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Carleton University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Algorithm; Planar graph; Discrete mathematics; Graph algorithms; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02189423848872213,"gpt":0.2809147616313767,"spread":0.2590205231426546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009394324,0.000124759,0.0001998103,0.0002616922,0.0001555481,0.0001644622,0.0004388571,0.00004526262,0.00001128937],"category_scores_gemma":[0.00005953081,0.000102486,0.0001962055,0.0003870031,0.00002106226,0.0002563613,0.00006682112,0.0001429057,0.000009473863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006341947,"about_ca_system_score_gemma":0.0001120583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002082536,"about_ca_topic_score_gemma":3.847944e-7,"domain_scores_codex":[0.9986444,0.00005212073,0.0004438589,0.0001787183,0.000449665,0.0002312753],"domain_scores_gemma":[0.9987185,0.0002258097,0.0003360417,0.0001707815,0.0004210463,0.0001278209],"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.00007553714,0.0003625984,0.00002722448,0.00002230393,0.000123549,0.0001782988,0.001787364,0.3513112,0.003272425,0.04746327,0.001693009,0.5936832],"study_design_scores_gemma":[0.001169854,0.0004405018,0.0006613691,0.00004263046,0.00002151333,0.001283424,0.0001243449,0.948006,0.001198061,0.03418802,0.01264864,0.0002156842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03921706,0.0002254088,0.9568641,0.001690489,0.001594943,0.000118683,0.000002199258,0.00002671662,0.0002604171],"genre_scores_gemma":[0.3059763,0.00003339555,0.6919147,0.0004046193,0.001309101,0.000004827707,0.000002451188,0.00001271884,0.0003418901],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5966948,"threshold_uncertainty_score":0.4179258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109083408","doi":"10.1142/s0218195902000803","title":"ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","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 Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; Simple polygon; Simple (philosophy); Decomposition; Regular polygon; Convex polygon; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01666600020750904,"gpt":0.2948917396336267,"spread":0.2782257394261177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005607545,0.00016291,0.0002337537,0.0006562556,0.0002249456,0.0001784421,0.001294066,0.00006065159,0.0002463222],"category_scores_gemma":[0.0001481013,0.0001369211,0.0002645249,0.0007684001,0.00009379523,0.0004295115,0.00009248865,0.0001678012,0.00008544827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001055449,"about_ca_system_score_gemma":0.0001166015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001601866,"about_ca_topic_score_gemma":3.481354e-7,"domain_scores_codex":[0.9977319,0.00007857298,0.0008149077,0.0002369202,0.0009706588,0.0001670474],"domain_scores_gemma":[0.9944474,0.002325256,0.0008120943,0.0002412458,0.002077721,0.00009626452],"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.00006337706,0.0007599218,0.00005592541,0.0000154536,0.0003837796,0.000003055708,0.0001650147,0.2134324,0.001731528,0.7081432,0.01633288,0.05891353],"study_design_scores_gemma":[0.001465059,0.000463837,0.001403276,0.00004885957,0.00005374891,0.0002320455,0.00003058647,0.3730728,0.003166693,0.5532678,0.06648555,0.0003097704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01575254,0.0002626515,0.9758973,0.006392042,0.000317101,0.0004934784,0.0000905209,0.00002750754,0.0007668269],"genre_scores_gemma":[0.9495421,0.00002506858,0.04812949,0.001289469,0.0005682984,0.0001140101,0.00009678868,0.00001433149,0.0002204596],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9337896,"threshold_uncertainty_score":0.5583482,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1547671143","doi":"10.5555/1496770.1496791","title":"Optimal halfspace range reporting in three dimensions","year":2009,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":68,"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":"Range (aeronautics); Binary logarithm; Partition (number theory); Half-space; Mathematics; Space (punctuation); Time complexity; Data structure; Computational geometry; Combinatorics; Discrete mathematics; Computer science; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03413526231537922,"gpt":0.2870540704052711,"spread":0.2529188080898919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003992541,0.00005878996,0.00008251717,0.0001124138,0.00006264387,0.00005924043,0.0001490095,0.00002483024,0.00001268235],"category_scores_gemma":[0.000135818,0.00005323129,0.00003160373,0.0004747823,0.000005002189,0.0002956039,0.00004726379,0.00006342788,0.00002135215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001861172,"about_ca_system_score_gemma":0.00003964174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001852217,"about_ca_topic_score_gemma":0.00005263395,"domain_scores_codex":[0.9991595,0.00001602988,0.0003227761,0.0002110083,0.0001525427,0.0001381405],"domain_scores_gemma":[0.9995415,0.00004023515,0.0001375605,0.0001920039,0.00004628333,0.00004238295],"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.0000107271,0.0002402939,0.00737497,0.000004249041,0.000007445714,0.0001906757,0.0007423154,0.2807013,0.007313656,0.5642609,0.002143313,0.1370102],"study_design_scores_gemma":[0.0003416319,0.00009274206,0.1693988,0.00001330372,0.000001698654,0.00006007352,0.00001393872,0.8078038,0.002036922,0.01914697,0.0009077154,0.0001824003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3232431,0.00006089509,0.669863,0.002693759,0.00009744651,0.00006295796,6.273399e-8,0.00007475138,0.00390399],"genre_scores_gemma":[0.7983983,0.000001723911,0.2007983,0.0004273178,0.00003489337,0.000001955788,0.000001143135,0.000001177662,0.000335195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5451139,"threshold_uncertainty_score":0.2170709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025130628","doi":"10.1007/s00453-001-0027-5","title":"Approximating Shortest Paths on Weighted Polyhedral Surfaces","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Shortest path problem; Combinatorics; Dijkstra's algorithm; Mathematics; Regular polygon; Bounded function; Theory of computation; Context (archaeology); Domain (mathematical analysis); Euclidean shortest path; Computational geometry; Face (sociological concept); Discrete mathematics; K shortest path routing; Graph; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01470809025050108,"gpt":0.2418008765560288,"spread":0.2270927863055277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002020088,0.0001285959,0.0001194218,0.0001190009,0.0001840768,0.0001471703,0.0003805835,0.00004686312,0.00003047524],"category_scores_gemma":[0.00003032604,0.0001187975,0.00004851003,0.0005901164,0.00001928392,0.0003272128,0.00008878561,0.0001094877,0.0001399937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003046344,"about_ca_system_score_gemma":0.00004486302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001375942,"about_ca_topic_score_gemma":0.000002177118,"domain_scores_codex":[0.9988396,0.00004978744,0.0002184217,0.0003431015,0.0003070074,0.0002421248],"domain_scores_gemma":[0.9993606,0.0001318134,0.00007051326,0.0002784132,0.00007424351,0.00008447018],"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.0000105021,0.0002448843,0.0005697681,0.000005673657,0.00003126905,0.00006696973,0.0004147253,0.004946692,0.002364915,0.06359894,0.001473904,0.9262717],"study_design_scores_gemma":[0.0002325364,0.0001289572,0.003095668,0.00001344324,0.00000371982,0.00005196036,0.00001468964,0.9795106,0.004414323,0.006335245,0.005985868,0.0002129916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2137263,0.00009866416,0.7788544,0.001411851,0.0005336082,0.0001459949,0.000003041048,0.0002581388,0.004967917],"genre_scores_gemma":[0.8422137,0.000009084931,0.1564809,0.0004811617,0.0002686781,0.00001109028,0.00002147794,0.000008156997,0.0005057123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9745639,"threshold_uncertainty_score":0.4844421,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1552370277","doi":"10.1109/cvpr.1992.223166","title":"Multi-resolution surface modeling from multiple range views","year":2003,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Triangulation; Venn diagram; Range (aeronautics); Set (abstract data type); Resolution (logic); Computer science; Viewpoints; Surface (topology); Diagram; Artificial intelligence; Process (computing); Algorithm; Theoretical computer science; Computer vision; Mathematics; Programming language; Engineering; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.07983369893389004,"gpt":0.2758711205664076,"spread":0.1960374216325176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002653371,0.00009702236,0.00009659534,0.00004585654,0.000131276,0.00009003453,0.0002106426,0.00004393105,0.00005614754],"category_scores_gemma":[0.0000832696,0.00009044664,0.00004803068,0.0002813409,0.000006566166,0.0004199424,0.00004596009,0.00006257893,0.0001520827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000310488,"about_ca_system_score_gemma":0.00004225223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001445267,"about_ca_topic_score_gemma":0.0001182815,"domain_scores_codex":[0.9990515,0.0001027416,0.000190683,0.0003106403,0.0001850572,0.0001593453],"domain_scores_gemma":[0.9994668,0.00008653766,0.00003718396,0.000254763,0.00008827075,0.0000663788],"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.000002104392,0.0000605129,0.0003812641,0.000001616533,0.000006391075,0.000001075077,0.0002044617,0.9846725,0.004663675,0.007247672,0.0003324188,0.002426293],"study_design_scores_gemma":[0.0004613905,0.000009418272,0.0003075628,0.000003668118,0.000002239307,0.000001538867,0.00001204798,0.9919904,0.002006368,0.001055538,0.004028892,0.0001208989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08178523,0.0004694073,0.9161886,0.0001206086,0.0003786743,0.0001192182,0.000001995451,0.0001223504,0.0008139117],"genre_scores_gemma":[0.5150786,0.000009211089,0.4843155,0.0001522023,0.00002451738,0.000002982939,0.000008106907,0.000002964218,0.0004059302],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4332934,"threshold_uncertainty_score":0.3688307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2624483937","doi":"10.1145/1706591.1706596","title":"A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries","year":2010,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","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 Waterloo","funders":"","keywords":"Combinatorics; Convex hull; Amortized analysis; Mathematics; Regular polygon; Euclidean geometry; Set (abstract data type); Data structure; Point (geometry); k-nearest neighbors algorithm; Computational geometry; Plane (geometry); Extreme point; Discrete mathematics; Algorithm; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01828957927246067,"gpt":0.2856817733615128,"spread":0.2673921940890522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002551927,0.00005115158,0.00008396037,0.00004000547,0.0001148595,0.0001468141,0.002035632,0.00003051489,0.000007868714],"category_scores_gemma":[0.0008625677,0.0000315701,0.00002953064,0.0001069448,0.00003350797,0.0004696629,0.0007423902,0.0001546121,5.529747e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005706662,"about_ca_system_score_gemma":0.0001039798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000143511,"about_ca_topic_score_gemma":0.00003391606,"domain_scores_codex":[0.9995185,0.00002068532,0.0001502979,0.00009642963,0.0001439098,0.00007015379],"domain_scores_gemma":[0.9986727,0.0001657456,0.0001802517,0.0008098229,0.0001321448,0.00003935381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002143439,0.0001652382,0.005571071,0.0001340341,0.0003087397,0.00002041904,0.002460431,0.004964085,0.4413306,0.1251946,0.04962249,0.370014],"study_design_scores_gemma":[0.001730828,0.0003259829,0.1117994,0.00005455023,0.00007368864,0.001337937,0.00006734934,0.3666494,0.009373588,0.3944958,0.1137689,0.0003224633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8325286,0.0001714429,0.147606,0.01726277,0.002263975,0.0001172977,0.00002715604,0.000007497341,0.00001521896],"genre_scores_gemma":[0.8374127,0.000007431706,0.1619522,0.0003507477,0.0001858542,3.725272e-7,0.000003104757,0.000002857416,0.00008474027],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.431957,"threshold_uncertainty_score":0.3782745,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2922321031","doi":"10.1007/s00453-007-9151-1","title":"On the Parameterized Complexity of Layered Graph Drawing","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; McGill University","funders":"","keywords":"Combinatorics; Parameterized complexity; Pathwidth; Mathematics; Graph drawing; Theory of computation; Bounded function; Crossing number (knot theory); Graph; Time complexity; Span (engineering); Discrete mathematics; Line graph; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04315325250689598,"gpt":0.271161155714278,"spread":0.228007903207382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005868179,0.00007482795,0.00009911849,0.00009763554,0.0001232051,0.00003896849,0.000392602,0.00002744754,0.0000181354],"category_scores_gemma":[0.00007340616,0.0000544924,0.00006494367,0.0005055318,0.00007658071,0.00009663656,0.00007471882,0.00008143512,0.00001651288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001227288,"about_ca_system_score_gemma":0.00002391841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001349949,"about_ca_topic_score_gemma":0.000002669577,"domain_scores_codex":[0.9991708,0.0000562878,0.0001982943,0.0001740565,0.0002494008,0.0001511447],"domain_scores_gemma":[0.9989838,0.0005233147,0.00008389589,0.0002926007,0.0000768118,0.00003958117],"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.00002317693,0.0001061656,0.00001950034,0.000005122355,0.00003228444,0.000005994876,0.0003451988,0.0009023477,0.01186909,0.8940792,0.000640408,0.09197149],"study_design_scores_gemma":[0.0008445407,0.000330979,0.01403881,0.00003181519,0.0000102067,0.00002337161,0.00005206952,0.2272481,0.2097444,0.5452475,0.002097171,0.0003310184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1661845,0.00001733053,0.8315791,0.0008639134,0.0002110769,0.00009831414,0.000002046857,0.00003966796,0.001003992],"genre_scores_gemma":[0.9102584,0.000001014724,0.0891921,0.0004537008,0.00005037215,0.000002828112,0.000003783628,0.000002974066,0.00003488683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7440738,"threshold_uncertainty_score":0.2222136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4220743987","doi":"10.1145/3508372","title":"A Large-Scale Comparison of Tetrahedral and Hexahedral Elements for Solving Elliptic PDEs with the Finite Element Method","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Advanced Micro Devices; National Science Foundation","keywords":"Hexahedron; Finite element method; Tetrahedron; Benchmark (surveying); Solver; Mesh generation; Computer science; Polygon mesh; Applied mathematics; Basis (linear algebra); Partial differential equation; Computational science; Algorithm; Mathematical optimization; Mathematics; Geometry; Mathematical analysis; Structural engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02812835744345332,"gpt":0.3040957189750049,"spread":0.2759673615315515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006107094,0.0001105003,0.0001416917,0.0001991667,0.0008472208,0.00005402451,0.0004015991,0.00002074102,0.00001704325],"category_scores_gemma":[0.00001121778,0.00008804388,0.0000737204,0.0006891764,0.00003393813,0.0001497167,0.00002998126,0.0001877062,2.768685e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002089273,"about_ca_system_score_gemma":0.00004807011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005492512,"about_ca_topic_score_gemma":0.00008691445,"domain_scores_codex":[0.998848,0.00009606104,0.000242082,0.0002600361,0.0003620594,0.0001918162],"domain_scores_gemma":[0.9988182,0.0006098871,0.0001157566,0.0003315331,0.00008416639,0.00004049649],"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.0002627354,0.001901805,0.002855965,0.0001193916,0.0003844421,0.000001828248,0.01369157,0.8360256,0.001789756,0.04432972,0.0005322238,0.09810495],"study_design_scores_gemma":[0.001139369,0.001303717,0.001245677,0.00001131187,0.00007794621,0.000009144009,0.001649852,0.9755523,0.004436405,0.005817697,0.008556801,0.0001998216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03896874,0.0001072158,0.9587716,0.00159426,0.0001355415,0.0003369579,0.00004595651,0.00003033437,0.000009324461],"genre_scores_gemma":[0.7911402,0.00001070853,0.2083063,0.0003154659,0.00001316638,0.0001505354,0.00001248979,0.00000659906,0.00004459149],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7521715,"threshold_uncertainty_score":0.6516224,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980802338","doi":"10.1007/s00366-006-0015-0","title":"A comparison of two optimization methods for mesh quality improvement","year":2006,"lang":"en","type":"article","venue":"Engineering With Computers","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Sandia National Laboratories; Advanced Scientific Computing Research; Office of Science; University of British Columbia","keywords":"Polygon mesh; Mathematics; Vertex (graph theory); Coordinate descent; Metric (unit); Mathematical optimization; Tetrahedron; Algorithm; Series (stratigraphy); Harmonic mean; Block (permutation group theory); Computer science; Combinatorics; Geometry; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02058823211752977,"gpt":0.349728479559934,"spread":0.3291402474424042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003917665,0.0001210738,0.0002097076,0.0001395762,0.00004813937,0.00005662509,0.0002383569,0.00002436431,0.000001061728],"category_scores_gemma":[0.00001999024,0.0001151509,0.00005199961,0.0003638963,0.00001029866,0.0001856951,0.00005390217,0.00004794582,2.873566e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004052692,"about_ca_system_score_gemma":0.00003357464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001970741,"about_ca_topic_score_gemma":0.000001329807,"domain_scores_codex":[0.9990778,0.0000319547,0.0003343938,0.0002406939,0.0001593357,0.0001558401],"domain_scores_gemma":[0.9991462,0.0003183441,0.0001421034,0.0002101895,0.0001461414,0.00003706163],"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.000005699255,0.00004990214,0.00007737864,0.00003622764,0.00001746951,1.169656e-7,0.00007299566,0.9280365,0.003581211,0.0417107,0.00010594,0.02630587],"study_design_scores_gemma":[0.0005796749,0.0001747522,0.000531009,0.00002022772,0.000006979105,0.000001392938,0.000002746439,0.9764751,0.02122566,0.0002491657,0.0005909099,0.0001424323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005493736,0.00006474314,0.9934382,0.00009558442,0.0004872019,0.0002598207,0.000001626819,0.0001286489,0.00003046375],"genre_scores_gemma":[0.2734982,3.258358e-7,0.7263519,0.00001983166,0.0000665394,0.00002242509,0.00001810935,0.000006552389,0.00001614668],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2680044,"threshold_uncertainty_score":0.4695717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027276065","doi":"10.1145/2766905","title":"Practical hex-mesh optimization via edge-cone rectification","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon mesh; Hexahedron; Mathematical optimization; Volume mesh; Computer science; Solver; Algorithm; Robustness (evolution); Mathematics; Finite element method; Mesh generation; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.06507108894805766,"gpt":0.3049460440448377,"spread":0.23987495509678,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004874253,0.0001487784,0.000120727,0.0003895101,0.0002630436,0.0001563575,0.0003844277,0.000123791,0.00002002297],"category_scores_gemma":[0.000183491,0.0001578534,0.00008024557,0.00153832,0.00004645096,0.0009359598,0.00001172954,0.0002672033,0.00007696784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006996533,"about_ca_system_score_gemma":0.0001957764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001078087,"about_ca_topic_score_gemma":0.00001575397,"domain_scores_codex":[0.9985158,0.0001439942,0.000277336,0.0004138356,0.0004588283,0.0001902242],"domain_scores_gemma":[0.9982995,0.0002502043,0.0001029749,0.0007226505,0.0004387673,0.0001858713],"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.0001135145,0.001254608,0.00004355716,0.00001972826,0.000114742,0.0000129417,0.0009926818,0.7629683,0.001395838,0.06521016,0.006221651,0.1616523],"study_design_scores_gemma":[0.001030781,0.0004893063,0.0003506744,0.00001833229,0.00005450656,0.0001476149,0.00006950158,0.9463523,0.01354181,0.02804955,0.009410503,0.0004851349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008757308,0.00003039456,0.9885585,0.008619885,0.001047847,0.0002072612,0.000003087782,0.0002548367,0.0004024215],"genre_scores_gemma":[0.5462233,0.00007097265,0.4524503,0.0008334529,0.0001003997,0.00005293526,0.00003762242,0.00001380074,0.0002172251],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5453476,"threshold_uncertainty_score":0.6437073,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161871333","doi":"","title":"Guaranteed Voronoi Diagrams of Uncertain Sites","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":61,"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":"Voronoi diagram; Weighted Voronoi diagram; Power diagram; Generalization; Centroidal Voronoi tessellation; Point (geometry); Set (abstract data type); Diagram; Computer science; Computational geometry; Bowyer–Watson algorithm; Point location; Plane (geometry); Mathematics; Combinatorics; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0370004252898863,"gpt":0.2485818909923994,"spread":0.2115814657025131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009276692,0.000051672,0.00007683848,0.00006588922,0.00006029138,0.00001190926,0.0002251146,0.00001917211,0.00003722879],"category_scores_gemma":[0.00002713993,0.000043952,0.00003807816,0.000345379,0.00002605349,0.0001644767,0.00005243512,0.00002565898,0.00003117012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007875864,"about_ca_system_score_gemma":0.00004412802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002514512,"about_ca_topic_score_gemma":0.000008306394,"domain_scores_codex":[0.9994588,0.00002259723,0.0001365069,0.0001376473,0.0001576782,0.00008674322],"domain_scores_gemma":[0.9996204,0.0000741073,0.00003901056,0.0001662332,0.00007176082,0.00002853399],"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.00001825437,0.000397132,0.01846994,0.00003159176,0.00005137479,0.00003339051,0.002654011,0.03745658,0.03676705,0.7938696,0.01340563,0.09684552],"study_design_scores_gemma":[0.0008131599,0.0002837795,0.05675325,0.00001172383,0.000005766588,0.0001152304,0.00003760054,0.8217188,0.09644523,0.01374683,0.009695686,0.0003730032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2892373,0.00008554333,0.7072675,0.0002283212,0.00008752628,0.00004571094,5.137194e-7,0.00005046643,0.002997125],"genre_scores_gemma":[0.9443441,0.000009601917,0.05449237,0.0002122883,0.00003727806,0.000002605838,0.000004399167,0.000001618457,0.0008957585],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7842622,"threshold_uncertainty_score":0.179231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}