{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Giri Narasimhan","is_ca":false},{"name":"Michiel Smid","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004856284,0.001124595,0.0007847658,0.001768418,0.001237215,0.002996532,0.001325176,0.0009430153,0.02268323],"category_scores_gemma":[0.001950728,0.0006492717,0.0008532262,0.003011045,0.001667246,0.006278792,0.002334353,0.002098591,0.007282025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116379,"about_ca_system_score_gemma":0.0005939748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006787585,"about_ca_topic_score_gemma":0.0008757443,"domain_scores_codex":[0.9993557,0.00009252882,0.00002675719,0.0001899575,0.0002782208,0.00005685605],"domain_scores_gemma":[0.9995079,0.0001768907,0.00003679487,0.0001271695,0.0001058619,0.00004539378],"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.00001334716,0.000008162119,0.00006928704,0.00008920633,0.00001002375,0.00004442349,0.00008783395,0.00592209,0.000815245,0.9121815,0.01901141,0.06174742],"study_design_scores_gemma":[0.000004618018,0.0000257537,0.0001430564,0.00007238705,0.00001055632,0.0002889998,0.0001020066,0.0194624,0.001236397,0.7653739,0.2132656,0.0000143735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00911655,0.004973828,0.7372578,0.001294029,0.001239597,0.0001357795,0.0007795481,0.000863147,0.2443398],"genre_scores_gemma":[0.1506031,0.01494456,0.5171019,0.00115442,0.001173683,0.0005403144,0.003524007,0.00139993,0.309558],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.02268323,"threshold_uncertainty_score":0.07588297,"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","authors":[{"name":"Esther M. Arkin","is_ca":false},{"name":"Sándor P. Fekete","is_ca":false},{"name":"Joseph S. B. Mitchell","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002067191,0.001447675,0.002369168,0.002154156,0.001500829,0.002352227,0.0038438,0.002328796,0.01441962],"category_scores_gemma":[0.01237984,0.001055748,0.001805668,0.003892786,0.001543995,0.005201508,0.003847603,0.003892258,0.003224441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002121689,"about_ca_system_score_gemma":0.001846069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009453599,"about_ca_topic_score_gemma":0.01641037,"domain_scores_codex":[0.9985572,0.000319191,0.00008902379,0.0003521958,0.0004395604,0.0002427698],"domain_scores_gemma":[0.9963101,0.002062227,0.0002210627,0.0008645922,0.0003527038,0.0001892888],"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.0006218466,0.000384454,0.002148493,0.000431437,0.0001353592,0.0001523815,0.0004998994,0.3030508,0.001937393,0.1937753,0.04248073,0.4543819],"study_design_scores_gemma":[0.00005735703,0.00004025235,0.0001279725,0.0000288225,0.00001644225,0.00005753728,0.00006314865,0.8918232,0.0005558235,0.1019507,0.005266295,0.00001251201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01102178,0.000665251,0.9821358,0.0005231028,0.0001674435,0.0001254666,0.0002211003,0.0009484818,0.004191536],"genre_scores_gemma":[0.1547486,0.0006035796,0.8312834,0.0002770115,0.0001948248,0.0003392244,0.001581311,0.0006622384,0.01030977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01441962,"threshold_uncertainty_score":0.0482384,"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","authors":[{"name":"Yixin Hu","is_ca":false},{"name":"Qingnan Zhou","is_ca":false},{"name":"Xifeng Gao","is_ca":false},{"name":"Alec Jacobson","is_ca":true},{"name":"Denis Zorin","is_ca":false},{"name":"Daniele Panozzo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009847423,0.0005651644,0.0009535426,0.0008484987,0.000625217,0.001617681,0.002356309,0.001354543,0.005594072],"category_scores_gemma":[0.003124814,0.0006800765,0.001346139,0.00075026,0.001862499,0.002327988,0.002586405,0.002240475,0.002021509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004914164,"about_ca_system_score_gemma":0.0006713879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001086272,"about_ca_topic_score_gemma":0.001029134,"domain_scores_codex":[0.9990128,0.0001565237,0.00006666432,0.0001654846,0.0005184846,0.0000799499],"domain_scores_gemma":[0.9988899,0.0002990327,0.00005708434,0.0005098004,0.0002040934,0.0000402263],"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.0001182444,0.00004157757,0.0006917862,0.0002341907,0.00007340484,0.0002620287,0.0004932698,0.476703,0.04218614,0.3036432,0.008364665,0.1671885],"study_design_scores_gemma":[0.00001591222,0.00002915859,0.00009619708,0.00003724244,0.00001297765,0.0001232912,0.00006617918,0.8774613,0.009806723,0.08647998,0.02584513,0.00002588457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002197471,0.00004391159,0.9955227,0.00006806559,0.00004504717,0.00001715675,0.00004048768,0.0005058092,0.001559405],"genre_scores_gemma":[0.1375031,0.0002784541,0.8558792,0.0001699338,0.00005718242,0.0001895091,0.0003639208,0.001025869,0.004532836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005594072,"threshold_uncertainty_score":0.01871407,"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","authors":[{"name":"Hao Zhang","is_ca":true},{"name":"Oliver van Kaick","is_ca":true},{"name":"Ramsay Dyer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007251398,0.000823139,0.0009114901,0.002366939,0.0007856963,0.002708996,0.001322727,0.001250529,0.02118656],"category_scores_gemma":[0.003227058,0.0004579179,0.001062638,0.001938158,0.001248388,0.002651706,0.002365717,0.001317997,0.006101034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005516551,"about_ca_system_score_gemma":0.000555552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007812376,"about_ca_topic_score_gemma":0.0007854474,"domain_scores_codex":[0.9992616,0.0001265343,0.00004889328,0.0001663903,0.0003259507,0.00007071836],"domain_scores_gemma":[0.998637,0.000376726,0.00009453786,0.0004102497,0.0004154472,0.00006598118],"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.000228641,0.00007942996,0.001073647,0.0005440232,0.00008723758,0.0002931244,0.0003694546,0.1046131,0.03024136,0.2742061,0.02365071,0.5646132],"study_design_scores_gemma":[0.00002620582,0.00006964368,0.0007521962,0.00008846836,0.0000285384,0.0003566744,0.0002348499,0.6985442,0.01517997,0.233888,0.0507875,0.00004367231],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004700746,0.0004014994,0.984988,0.0002526727,0.0001739039,0.00005703315,0.0002128932,0.0007650575,0.008448152],"genre_scores_gemma":[0.2242965,0.001593281,0.7483475,0.0005235936,0.0004909488,0.0002051656,0.001671176,0.0009936003,0.02187833],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02118656,"threshold_uncertainty_score":0.07087612,"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","authors":[{"name":"David Avis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009914307,0.0008545101,0.001075479,0.001077822,0.0006581575,0.002195084,0.003697861,0.001139178,0.03084511],"category_scores_gemma":[0.004034969,0.0007855716,0.001033125,0.001629616,0.0005735619,0.00245225,0.001598546,0.002077408,0.01567773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009219368,"about_ca_system_score_gemma":0.001789431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003914645,"about_ca_topic_score_gemma":0.004164407,"domain_scores_codex":[0.9979134,0.0002774827,0.0002092249,0.0003674026,0.0009913469,0.0002411748],"domain_scores_gemma":[0.9978357,0.0003610039,0.00005589764,0.0008096729,0.0008753695,0.00006235975],"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.0004959575,0.0002429382,0.0006738367,0.0002406971,0.00005272459,0.0002137646,0.0001736022,0.0375494,0.02481226,0.04123851,0.02978815,0.864518],"study_design_scores_gemma":[0.0003762187,0.0002860567,0.0007713352,0.00009555646,0.000074205,0.0007325406,0.00009514617,0.6808746,0.04915537,0.02630453,0.2410904,0.0001440785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003427546,0.0001573773,0.9791662,0.0001270586,0.0001653877,0.0001135121,0.0002482549,0.009192276,0.007402385],"genre_scores_gemma":[0.03425157,0.0001888584,0.9501419,0.0001860536,0.00005863806,0.0001496928,0.001284632,0.001597232,0.01214139],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03084511,"threshold_uncertainty_score":0.1031871,"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","authors":[{"name":"David Avis","is_ca":true},{"name":"Erik D. Demaine","is_ca":false},{"name":"Jeff Erickson","is_ca":false},{"name":"John Iacono","is_ca":false},{"name":"Stefan Langerman","is_ca":false},{"name":"Pat Morin","is_ca":true},{"name":"Godfried Toussaint","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00482629,0.001228619,0.002216626,0.001912105,0.001456076,0.002933954,0.003945647,0.002496717,0.006467793],"category_scores_gemma":[0.02609133,0.001011947,0.001021929,0.002036292,0.001371673,0.003007807,0.004072119,0.003074788,0.001606115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001881532,"about_ca_system_score_gemma":0.001879364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003977254,"about_ca_topic_score_gemma":0.004708797,"domain_scores_codex":[0.9961483,0.001129212,0.0003262533,0.0005813779,0.001565832,0.0002489666],"domain_scores_gemma":[0.9866394,0.009012174,0.0005362732,0.001389252,0.002187992,0.0002348067],"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.0006126647,0.0002231292,0.001369416,0.0002439335,0.00009033246,0.00009443065,0.0002395411,0.4753016,0.004222755,0.041286,0.004565534,0.4717507],"study_design_scores_gemma":[0.0000213441,0.0000290125,0.0001229186,0.00001399053,0.0000118996,0.00002592018,0.0000183578,0.9759057,0.002617449,0.02060439,0.0006186398,0.00001029732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006086241,0.0001392936,0.9920345,0.0000663906,0.00003913838,0.00005425427,0.00006011784,0.000744778,0.00077529],"genre_scores_gemma":[0.2171212,0.0001496074,0.7786116,0.000186187,0.00007193751,0.0002715776,0.0005829132,0.0004271852,0.002577822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006467793,"threshold_uncertainty_score":0.0255242,"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","authors":[{"name":"Komei Fukuda","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003873502,0.0005295219,0.0006035431,0.001257717,0.0009690279,0.001849103,0.001061497,0.0005451618,0.007639201],"category_scores_gemma":[0.002047438,0.0004582727,0.0006264687,0.001091628,0.002093369,0.002804249,0.003676814,0.002392243,0.0007759975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000731441,"about_ca_system_score_gemma":0.0005855726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001594998,"about_ca_topic_score_gemma":0.001918517,"domain_scores_codex":[0.9996737,0.00008199886,0.00001693972,0.00006019143,0.0001236532,0.00004350248],"domain_scores_gemma":[0.9996219,0.0001254194,0.00004609743,0.00007141576,0.00007328832,0.00006186976],"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.00002430131,0.000007910395,0.0001231694,0.00003719592,0.000004718236,0.00004214367,0.00009272373,0.007360604,0.001168229,0.976588,0.00118683,0.01336417],"study_design_scores_gemma":[0.00001218151,0.0000227779,0.0002342455,0.0000205384,0.000008690567,0.0001148476,0.0001037524,0.03751817,0.001223739,0.9446403,0.01608276,0.00001799998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1056553,0.0009788373,0.8045323,0.001148086,0.0004338323,0.00007307932,0.0002469616,0.000333713,0.08659793],"genre_scores_gemma":[0.7541411,0.001910875,0.2074114,0.0004937787,0.0003666848,0.0001173151,0.0004707303,0.0005551676,0.03453297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007639201,"threshold_uncertainty_score":0.02555567,"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","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Sariel Har-Peled","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003918263,0.00241582,0.003267406,0.002900626,0.001439438,0.003886797,0.00747471,0.003210488,0.009539285],"category_scores_gemma":[0.02948612,0.001959443,0.002628915,0.005033333,0.002161455,0.007089947,0.006274132,0.005702548,0.002185082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003433702,"about_ca_system_score_gemma":0.002329979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00285183,"about_ca_topic_score_gemma":0.003351307,"domain_scores_codex":[0.9969904,0.001261808,0.0001586173,0.000443564,0.0008731766,0.0002723231],"domain_scores_gemma":[0.9862794,0.009956959,0.0004989268,0.001725174,0.001018567,0.0005209208],"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.00054613,0.0002319761,0.0007613712,0.000590838,0.000160456,0.00008249648,0.0003074505,0.6392685,0.0009997018,0.2323533,0.01312521,0.1115726],"study_design_scores_gemma":[0.00005198746,0.00002733205,0.00008143929,0.00003297875,0.00002153771,0.00003335725,0.00003476977,0.8704271,0.0003745443,0.1274778,0.001425179,0.00001198293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00784892,0.0008000635,0.9852704,0.0004734094,0.0001435991,0.0001058277,0.0002587551,0.0004639469,0.004635078],"genre_scores_gemma":[0.1892964,0.001205308,0.7994962,0.0003424931,0.0003349085,0.0006854766,0.001321295,0.0006345683,0.006683321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009539285,"threshold_uncertainty_score":0.03191203,"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","authors":[{"name":"József Solymosi","is_ca":true},{"name":"Terence Tao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001428984,0.0008636062,0.0009246005,0.002585793,0.001791995,0.00353585,0.0017117,0.001262542,0.01281703],"category_scores_gemma":[0.00583178,0.000660693,0.001532737,0.001841357,0.003128448,0.007502091,0.003838678,0.005347594,0.002036317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001319026,"about_ca_system_score_gemma":0.0007253534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001599775,"about_ca_topic_score_gemma":0.001020109,"domain_scores_codex":[0.9989746,0.0002105252,0.00006083543,0.0001718244,0.0004284432,0.0001538242],"domain_scores_gemma":[0.9976476,0.001167512,0.0002134091,0.0003138966,0.0004418734,0.0002157711],"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.000007123166,0.000009398348,0.0001186576,0.0000204252,0.000003264263,0.00002166388,0.00006074123,0.0006260453,0.0002302231,0.9939202,0.001381538,0.003600732],"study_design_scores_gemma":[0.000007469557,0.000009138653,0.0001575341,0.00001440347,0.00000627076,0.00007851015,0.00003584571,0.009465591,0.0003520427,0.9840735,0.005791232,0.000008586543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05830489,0.002387879,0.7380784,0.003501591,0.00179619,0.00006185411,0.0003826386,0.0003908964,0.1950956],"genre_scores_gemma":[0.7555721,0.004723688,0.1321094,0.001575081,0.003124609,0.0002202006,0.0008160244,0.0008417022,0.1010172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01281703,"threshold_uncertainty_score":0.0428772,"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","authors":[{"name":"Tyson Brochu","is_ca":true},{"name":"Essex Edwards","is_ca":true},{"name":"Robert Bridson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007835813,0.0005369057,0.0007195289,0.0005449581,0.0004229812,0.001098675,0.001420413,0.0007375571,0.003207617],"category_scores_gemma":[0.004976279,0.0003508998,0.0004030293,0.0003873474,0.001055983,0.001078534,0.002278581,0.000852224,0.0006216754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005720458,"about_ca_system_score_gemma":0.000937107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001352921,"about_ca_topic_score_gemma":0.001407049,"domain_scores_codex":[0.998957,0.000146107,0.00004653074,0.0001112075,0.0006293043,0.0001098572],"domain_scores_gemma":[0.9982773,0.0007035119,0.0001492342,0.0005204192,0.000279998,0.00006952309],"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.0003681811,0.0001085376,0.005236513,0.00025291,0.00004138817,0.0003383671,0.0005035079,0.6920832,0.05700079,0.0831112,0.002832175,0.1581231],"study_design_scores_gemma":[0.00001559967,0.00004682086,0.0002133383,0.000008387053,0.000004072904,0.00007284849,0.00003871382,0.979923,0.01076366,0.007109394,0.001791036,0.00001328125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05517216,0.00006150595,0.9390229,0.00006411932,0.00003300507,0.00004996605,0.00006936397,0.001697659,0.003829346],"genre_scores_gemma":[0.6365059,0.00007309067,0.3609991,0.00005266497,0.00001170244,0.00005943845,0.0001982207,0.0004131378,0.001686704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003207617,"threshold_uncertainty_score":0.01073056,"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","authors":[{"name":"Timothy M. Chan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001098375,0.0009024892,0.001295595,0.001134575,0.0009891631,0.001372909,0.002183771,0.001208058,0.01050391],"category_scores_gemma":[0.005861625,0.0006640418,0.001091342,0.001411494,0.001124074,0.003676987,0.00308703,0.00169062,0.002704907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001387749,"about_ca_system_score_gemma":0.00244402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002530303,"about_ca_topic_score_gemma":0.004918119,"domain_scores_codex":[0.9980977,0.0003930273,0.0001403875,0.0004971093,0.0005779173,0.0002938393],"domain_scores_gemma":[0.9982442,0.0005949091,0.0001963987,0.0005207813,0.0003149905,0.000128803],"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.001701006,0.0003020338,0.001885584,0.0003939364,0.0001085732,0.000117171,0.0002878233,0.1292579,0.04301792,0.1082081,0.01522908,0.6994908],"study_design_scores_gemma":[0.0004964494,0.0005137196,0.0008105342,0.00004280892,0.00004943807,0.0002501805,0.0001527888,0.8244243,0.03122215,0.1293303,0.01259836,0.0001089178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01015646,0.0001339465,0.9858969,0.0001761782,0.00006013162,0.0000922865,0.0001508473,0.00167913,0.001654131],"genre_scores_gemma":[0.0896927,0.0000870134,0.9074702,0.0001156722,0.00004996426,0.0001745833,0.0003781576,0.0002727879,0.001758925],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01050391,"threshold_uncertainty_score":0.03513908,"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","authors":[{"name":"Éric Béchet","is_ca":true},{"name":"Jean-Christophe Cuillière","is_ca":true},{"name":"F. Trochu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000326438,0.0006495224,0.0005850359,0.00103265,0.0003960089,0.0006323857,0.0008939395,0.0008282488,0.01361611],"category_scores_gemma":[0.001084564,0.0005784533,0.0005682333,0.0005630801,0.000380718,0.0003832832,0.0006337838,0.0007255407,0.00391901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004406424,"about_ca_system_score_gemma":0.0008464887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001518678,"about_ca_topic_score_gemma":0.001610135,"domain_scores_codex":[0.9997467,0.00001722593,0.00001308378,0.00003031779,0.000165549,0.00002701235],"domain_scores_gemma":[0.9995315,0.0001486763,0.00002692348,0.00009642495,0.0001768323,0.00001970726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000364814,0.0002411844,0.002089351,0.0007921268,0.00005733369,0.0007859613,0.0007366424,0.3103384,0.3150707,0.02918025,0.03643397,0.3039092],"study_design_scores_gemma":[0.00008055235,0.0001414326,0.001091336,0.00004353645,0.00002667077,0.0003667236,0.0001695165,0.7819682,0.1777482,0.005002222,0.03330365,0.00005791839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02894273,0.00004115739,0.9522387,0.0001232635,0.0001320147,0.0003731379,0.001918284,0.006232121,0.009998479],"genre_scores_gemma":[0.2059528,0.0001015031,0.779232,0.00008545725,0.00001909976,0.0006420682,0.003553288,0.00173201,0.008681796],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01361611,"threshold_uncertainty_score":0.04555047,"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)","authors":[{"name":"Ken‐ichi Kawarabayashi","is_ca":false},{"name":"Buce Reed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008522276,0.001568859,0.001554152,0.001179715,0.001189853,0.003772272,0.002559147,0.001533405,0.01364817],"category_scores_gemma":[0.008629056,0.0007270485,0.001500184,0.002668136,0.001130645,0.006984323,0.001747481,0.001889664,0.00460222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002389511,"about_ca_system_score_gemma":0.002545394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004139645,"about_ca_topic_score_gemma":0.007312771,"domain_scores_codex":[0.9969205,0.0002750664,0.0001962585,0.001269156,0.0007467901,0.0005923178],"domain_scores_gemma":[0.9936566,0.003099103,0.000661296,0.00160743,0.0006989516,0.0002765492],"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.003257614,0.0007185547,0.01206373,0.00127936,0.0004965425,0.000704744,0.000605769,0.2589249,0.05230397,0.04970573,0.05153686,0.5684022],"study_design_scores_gemma":[0.0004040677,0.0003048019,0.002979723,0.00006275737,0.0002224303,0.0007978751,0.0003008363,0.7601665,0.02809992,0.1925819,0.01398627,0.00009290971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2261572,0.001280919,0.7164426,0.002003172,0.000271284,0.0002228178,0.002262005,0.02430985,0.02705013],"genre_scores_gemma":[0.5834731,0.0004652573,0.400804,0.0004885439,0.0001431832,0.000188039,0.005796954,0.001253412,0.007387476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01364817,"threshold_uncertainty_score":0.04565769,"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","authors":[{"name":"Prosenjit Bose","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005461159,0.001374187,0.0009697349,0.001406171,0.0008207654,0.001293566,0.001537718,0.001407232,0.005501724],"category_scores_gemma":[0.004742305,0.0007210311,0.0006492538,0.001820056,0.001930852,0.00457029,0.004559307,0.00190401,0.001136039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005546792,"about_ca_system_score_gemma":0.0002821997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002422694,"about_ca_topic_score_gemma":0.003148353,"domain_scores_codex":[0.999581,0.0001177814,0.00002000424,0.00009383891,0.000143857,0.00004351065],"domain_scores_gemma":[0.9986607,0.0006803116,0.0001098007,0.0003022177,0.0001751327,0.00007187842],"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.0002745302,0.0001106036,0.00112847,0.0003762899,0.00004067584,0.0002289852,0.0008885062,0.2771932,0.01180836,0.4756732,0.009095644,0.2231813],"study_design_scores_gemma":[0.00002607353,0.0001045092,0.0004025998,0.00006980533,0.00003295758,0.000146786,0.0003104028,0.5290332,0.004283497,0.453285,0.01227581,0.00002953997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03931862,0.0002111264,0.9514198,0.0003982448,0.00009634989,0.00007663258,0.0001732384,0.000358387,0.007947642],"genre_scores_gemma":[0.3019404,0.001426982,0.6734865,0.0003035964,0.0001350748,0.000175889,0.001287468,0.0008150417,0.020429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005501724,"threshold_uncertainty_score":0.01840508,"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","authors":[{"name":"Vladimir P. Korzhik","is_ca":true},{"name":"Bojan Mohar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308969,0.0007896044,0.001350741,0.001127278,0.002254012,0.003208624,0.002492501,0.002389577,0.006757508],"category_scores_gemma":[0.01419161,0.001175516,0.002149832,0.0009451651,0.004905962,0.006260898,0.004867295,0.004006623,0.0004342561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002007233,"about_ca_system_score_gemma":0.001051969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001922353,"about_ca_topic_score_gemma":0.00141444,"domain_scores_codex":[0.9971219,0.0005444559,0.0002022753,0.0007036704,0.0008207099,0.0006069884],"domain_scores_gemma":[0.9749713,0.0190591,0.001861464,0.001789724,0.0008552187,0.001463247],"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.001870086,0.0008889185,0.01994791,0.001351305,0.0002558716,0.002437531,0.003216367,0.1074616,0.02398427,0.7805066,0.01273615,0.04534345],"study_design_scores_gemma":[0.0001886974,0.0001690564,0.003560879,0.00006591566,0.00008414886,0.0009130437,0.0006339103,0.07745346,0.007153325,0.9050658,0.00462339,0.00008824513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8818331,0.0003613826,0.09224804,0.004290613,0.00008649854,0.0001238323,0.001109982,0.0009374435,0.01900918],"genre_scores_gemma":[0.9838777,0.0001666716,0.01193084,0.000262776,0.00008190187,0.00009440639,0.001108237,0.0001088548,0.002368637],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006757508,"threshold_uncertainty_score":0.02260607,"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","authors":[{"name":"Hans De Sterck","is_ca":true},{"name":"Robert D. Falgout","is_ca":false},{"name":"J. Nolting","is_ca":false},{"name":"Ulrike Meier Yang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008586241,0.0003969353,0.0005640209,0.0005028038,0.0004938332,0.0004466985,0.0006748035,0.0004220653,0.002461852],"category_scores_gemma":[0.002643206,0.000165244,0.0004999928,0.0006564116,0.0006880672,0.0004860728,0.001428195,0.0008989122,0.0006234097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005884783,"about_ca_system_score_gemma":0.0008107052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002228372,"about_ca_topic_score_gemma":0.001922943,"domain_scores_codex":[0.9994656,0.0001887027,0.00002420986,0.00004599731,0.0002384234,0.00003711855],"domain_scores_gemma":[0.9990205,0.0004417348,0.00006407335,0.0001972584,0.0002282819,0.0000482061],"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.0002635749,0.00009238787,0.001753047,0.0002082891,0.0000405627,0.0001171095,0.0001412503,0.7059779,0.01333715,0.1158181,0.003958226,0.1582925],"study_design_scores_gemma":[0.00001444523,0.0000150397,0.0001085763,0.000004628211,0.000001914588,0.00001426796,0.000007154639,0.985797,0.001714805,0.01004984,0.002267548,0.000004725952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04037754,0.0003869912,0.9492922,0.0002452377,0.0001313176,0.00007553785,0.0000941469,0.0009767869,0.008420177],"genre_scores_gemma":[0.4368639,0.0002348672,0.5583903,0.00008028819,0.00005183232,0.0001637229,0.000306358,0.0003380551,0.003570633],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002461852,"threshold_uncertainty_score":0.008235693,"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","authors":[{"name":"Jean-sebastien Boulanger","is_ca":true},{"name":"Jörg Kienzle","is_ca":true},{"name":"Clark Verbrugge","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002747129,0.0006956699,0.0007510029,0.001128942,0.0005192237,0.001123673,0.001602579,0.001087571,0.001053086],"category_scores_gemma":[0.01145757,0.000270401,0.0004865213,0.0007513196,0.0005684729,0.002085702,0.001090656,0.0007973737,0.000239841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001115985,"about_ca_system_score_gemma":0.0006967265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003721143,"about_ca_topic_score_gemma":0.002573336,"domain_scores_codex":[0.9986947,0.0004533144,0.0001204173,0.0002051628,0.0003760833,0.0001503161],"domain_scores_gemma":[0.9926903,0.005160504,0.0003145131,0.000850205,0.0006952064,0.0002892172],"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.001831097,0.0007560269,0.005567301,0.0001889656,0.0001707395,0.00005922248,0.0002319997,0.740279,0.00777269,0.0134629,0.002092153,0.227588],"study_design_scores_gemma":[0.00005968373,0.0001916737,0.0007538848,0.000004169476,0.00001346818,0.00002275238,0.00006051802,0.9925558,0.002792278,0.003132283,0.0004048864,0.000008600636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6403646,0.0008719456,0.3484738,0.0004384477,0.0001646504,0.0004418313,0.0001663664,0.001630689,0.007447698],"genre_scores_gemma":[0.8653333,0.0002122372,0.1329479,0.00005964018,0.00002795249,0.0001167059,0.0002715052,0.0000890934,0.0009414694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003721143,"threshold_uncertainty_score":0.01452839,"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","authors":[{"name":"D. R. Stinson","is_ca":true},{"name":"R. Wei","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000644605,0.0006475056,0.0007578076,0.001849897,0.001453276,0.001547577,0.0008170775,0.0008530599,0.009441488],"category_scores_gemma":[0.002440079,0.0004212326,0.0007348753,0.0009919944,0.001565845,0.002993445,0.002680482,0.001780526,0.0007432983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009572222,"about_ca_system_score_gemma":0.0003713247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005567083,"about_ca_topic_score_gemma":0.0005516504,"domain_scores_codex":[0.9994304,0.00009841203,0.00001833841,0.0001054037,0.0002497993,0.00009758111],"domain_scores_gemma":[0.9990076,0.0003475137,0.0001090297,0.0001871134,0.0001691871,0.00017949],"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.00003464711,0.00001099188,0.0002258968,0.00003256062,0.00001180032,0.00009379841,0.0001377184,0.002972675,0.0009642873,0.9862632,0.001678418,0.007574066],"study_design_scores_gemma":[0.00001719647,0.00002170918,0.000409368,0.00001613537,0.00001390158,0.000283249,0.00009385152,0.01620017,0.0008523349,0.9739455,0.008135732,0.00001084093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4377727,0.001737176,0.3699645,0.002025846,0.0003051415,0.00008633759,0.0006496399,0.0004754763,0.1869833],"genre_scores_gemma":[0.9283039,0.001166053,0.02250065,0.0003441328,0.0002751145,0.0001087477,0.0006745446,0.0002139892,0.04641291],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009441488,"threshold_uncertainty_score":0.03158492,"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","authors":[{"name":"Timothy M. Chan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001856673,0.001240801,0.001411448,0.001304743,0.0003448953,0.0009785206,0.001743064,0.001270045,0.001130709],"category_scores_gemma":[0.01278781,0.0007020025,0.0008109973,0.001144617,0.0009180536,0.003035671,0.001965496,0.00107387,0.0004909685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007810505,"about_ca_system_score_gemma":0.0007188435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001718797,"about_ca_topic_score_gemma":0.00148756,"domain_scores_codex":[0.9991958,0.000190249,0.00005403607,0.0001688206,0.0002995539,0.00009147804],"domain_scores_gemma":[0.9958522,0.002802695,0.0004567436,0.000369945,0.0003297606,0.0001886142],"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.0006591577,0.0001061111,0.004461686,0.0003616319,0.00005338106,0.0001540605,0.0002528541,0.7960715,0.01069506,0.06681596,0.003956124,0.1164125],"study_design_scores_gemma":[0.00003148179,0.00004557388,0.0004141324,0.00001588518,0.000009704118,0.00006754017,0.00002546688,0.9736719,0.002913492,0.02198331,0.0008083284,0.00001329245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06262825,0.000712636,0.9337693,0.0002174599,0.00003382404,0.00003179308,0.0001178003,0.0005716485,0.001917252],"genre_scores_gemma":[0.3267605,0.000633307,0.6700357,0.00005301276,0.00009005134,0.0001358988,0.0004316977,0.0003213822,0.001538507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001856673,"threshold_uncertainty_score":0.00981915,"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","authors":[{"name":"Timothy M. Chan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002075091,0.001907161,0.002531727,0.002157695,0.001823557,0.00341023,0.004306168,0.001631797,0.01961836],"category_scores_gemma":[0.0139012,0.001284427,0.002171781,0.003658522,0.001485461,0.006609173,0.005828872,0.00424604,0.006341881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001524072,"about_ca_system_score_gemma":0.00249406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002899435,"about_ca_topic_score_gemma":0.005631504,"domain_scores_codex":[0.9978231,0.000357975,0.0001475331,0.0002920997,0.001080624,0.0002987185],"domain_scores_gemma":[0.99269,0.002480314,0.000249138,0.003043442,0.001222914,0.0003141671],"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.001601832,0.0004627057,0.002107771,0.0007180512,0.000165077,0.000202098,0.000669554,0.1040352,0.01468998,0.1817426,0.05117115,0.6424339],"study_design_scores_gemma":[0.0002991635,0.0001281583,0.0004029384,0.00005939687,0.00006747463,0.000139271,0.0001699563,0.7546143,0.01596308,0.2161905,0.01191802,0.00004775491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01665962,0.000365939,0.9699807,0.0004116165,0.0003017847,0.0001586399,0.0003002804,0.005412214,0.006409352],"genre_scores_gemma":[0.1143182,0.0003048884,0.8745077,0.0002697323,0.0001776362,0.0005128729,0.001410354,0.002147146,0.006351484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01961836,"threshold_uncertainty_score":0.06562996,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Ferrán Hurtado","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000350659,0.0004390822,0.0005820259,0.001765836,0.001034621,0.001251278,0.0008767028,0.001083108,0.01144161],"category_scores_gemma":[0.003098279,0.0005217283,0.000512602,0.001136762,0.001490369,0.002064741,0.001821591,0.001463161,0.001160143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005577471,"about_ca_system_score_gemma":0.0003381009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001525929,"about_ca_topic_score_gemma":0.001791456,"domain_scores_codex":[0.9997382,0.00005627561,0.00001271007,0.00005300881,0.00009093729,0.00004886797],"domain_scores_gemma":[0.999118,0.000395957,0.0001203259,0.0001275755,0.0001340276,0.0001042039],"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.00008818522,0.00004131865,0.0007792451,0.0001265223,0.00001564777,0.0002004101,0.0002953802,0.03572593,0.0022277,0.8853899,0.006259599,0.06885019],"study_design_scores_gemma":[0.00001972171,0.00002306938,0.0002994931,0.00002860786,0.00001322801,0.0001267294,0.0001608584,0.05670374,0.0009743802,0.9354432,0.006195757,0.00001132746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3956875,0.001943019,0.5126998,0.001366347,0.0004825248,0.0002210283,0.0006603407,0.0009593058,0.08598005],"genre_scores_gemma":[0.8853454,0.001291276,0.06749813,0.0003331159,0.0001665061,0.0001357878,0.0006797749,0.000382369,0.0441675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01144161,"threshold_uncertainty_score":0.03827602,"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","authors":[{"name":"Eyal Ackerman","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002961802,0.001196728,0.001712221,0.002649663,0.001768817,0.003497493,0.003604519,0.002767288,0.009374524],"category_scores_gemma":[0.02458485,0.00165148,0.001055755,0.00231667,0.003487666,0.01024763,0.002878957,0.002774013,0.0006754501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001596889,"about_ca_system_score_gemma":0.0006127715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008997297,"about_ca_topic_score_gemma":0.001759095,"domain_scores_codex":[0.9985878,0.0005880651,0.00008624289,0.0002794554,0.0002400438,0.0002184309],"domain_scores_gemma":[0.9625803,0.03137622,0.001949672,0.00156144,0.001025089,0.00150731],"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.001431124,0.0002556778,0.005881459,0.001206149,0.000155267,0.0003659037,0.0008183516,0.1941504,0.01480193,0.6875861,0.01256378,0.08078387],"study_design_scores_gemma":[0.0001122187,0.0001381743,0.001893171,0.0001512961,0.00007805262,0.0002729069,0.0003678942,0.2249952,0.003044816,0.7656209,0.003280341,0.00004494778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5614416,0.003814077,0.3874651,0.006788676,0.0004289515,0.0001815442,0.001369424,0.0005881273,0.0379224],"genre_scores_gemma":[0.8480338,0.002912715,0.1361016,0.0007879668,0.000460127,0.0002210634,0.001020943,0.0005274127,0.009934493],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009374524,"threshold_uncertainty_score":0.03136092,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Joachim Gudmundsson","is_ca":false},{"name":"Michiel Smid","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003577723,0.0007544067,0.0008484405,0.0011525,0.0004888041,0.00104667,0.0009885827,0.000914087,0.007074174],"category_scores_gemma":[0.002430937,0.0006300447,0.0005524476,0.0009747443,0.0008359737,0.001622935,0.003100615,0.0015169,0.00152419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003251288,"about_ca_system_score_gemma":0.0002556033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004115479,"about_ca_topic_score_gemma":0.0008770344,"domain_scores_codex":[0.9996042,0.00007777829,0.00002136379,0.00007716,0.0001471029,0.00007248752],"domain_scores_gemma":[0.9991437,0.0003553198,0.0001061763,0.0001873101,0.00009840172,0.0001091268],"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.0005820174,0.0003570061,0.003652593,0.0003869476,0.0001137081,0.0005995822,0.0007629861,0.1484041,0.05380041,0.5588897,0.01019729,0.2222536],"study_design_scores_gemma":[0.0001169233,0.0003584725,0.001054097,0.00008082019,0.00005780875,0.0003911705,0.0004516862,0.3515497,0.0284647,0.6018904,0.01554594,0.00003834976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3912882,0.0002567755,0.5844516,0.0002370276,0.0001076209,0.0001327194,0.0003438506,0.0006366186,0.02254569],"genre_scores_gemma":[0.677891,0.0003970048,0.3011047,0.0001624251,0.00005730548,0.0001664093,0.0008980583,0.0004777258,0.01884533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007074174,"threshold_uncertainty_score":0.02366549,"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","authors":[{"name":"Sergei Bespamyatnikh","is_ca":true},{"name":"David Kirkpatrick","is_ca":true},{"name":"Jack Snoeyink","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000842782,0.0007580257,0.0006974818,0.001165915,0.0004755312,0.001366802,0.001070596,0.001026458,0.007265294],"category_scores_gemma":[0.004619248,0.0006419845,0.0007169467,0.0006793089,0.00109423,0.001508512,0.003105883,0.001783388,0.001193956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004278804,"about_ca_system_score_gemma":0.0002735291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007962855,"about_ca_topic_score_gemma":0.001779093,"domain_scores_codex":[0.9994779,0.000141886,0.00002668503,0.00009992881,0.0001937994,0.00005971405],"domain_scores_gemma":[0.9988884,0.0003950214,0.00006104248,0.0004358481,0.000173013,0.00004658669],"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.0002196151,0.0001106044,0.0009492364,0.0001468436,0.00005918103,0.0002471567,0.000388211,0.2568709,0.02380072,0.4915071,0.003839602,0.2218608],"study_design_scores_gemma":[0.00002068055,0.00005427936,0.0002281064,0.00003057017,0.00002310151,0.0001711056,0.00008421372,0.7223194,0.008790364,0.2579315,0.01033098,0.00001575407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01603288,0.00008481458,0.9756739,0.00004504769,0.00006007261,0.0000290083,0.00003348659,0.0002720545,0.007768771],"genre_scores_gemma":[0.4182613,0.0002790549,0.5651984,0.0002083513,0.00009993421,0.0001115982,0.0002565345,0.0007881791,0.01479663],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007265294,"threshold_uncertainty_score":0.02430487,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Michiel Smid","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001687075,0.001690723,0.002986131,0.003300081,0.001264033,0.004484015,0.003489703,0.002495346,0.01101335],"category_scores_gemma":[0.005097008,0.001385475,0.001497159,0.00808763,0.002754973,0.0115146,0.004107024,0.003432231,0.004383833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008671803,"about_ca_system_score_gemma":0.0008939613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009387231,"about_ca_topic_score_gemma":0.001092609,"domain_scores_codex":[0.9984763,0.0003339124,0.0001130686,0.0004625739,0.0004769329,0.0001372123],"domain_scores_gemma":[0.9968295,0.001974169,0.0001846165,0.000543697,0.000335517,0.0001325207],"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.00009499455,0.0002364109,0.001767864,0.002412223,0.0000870546,0.0001517265,0.0003618606,0.04015447,0.001298679,0.4413831,0.01760296,0.4944486],"study_design_scores_gemma":[0.00002557881,0.0001420785,0.0007747308,0.0007542059,0.00005745723,0.0006799022,0.0004340734,0.08986273,0.001480306,0.7986647,0.1070694,0.00005489586],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.02475542,0.1188537,0.7986555,0.002836107,0.0009445161,0.0001360846,0.0005414285,0.0006402479,0.05263698],"genre_scores_gemma":[0.1890892,0.2887554,0.484303,0.001869151,0.005326555,0.0002797632,0.002889625,0.000932511,0.02655474],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.01101335,"threshold_uncertainty_score":0.03684336,"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","authors":[{"name":"Julian Keil","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001183568,0.0009893997,0.0007141512,0.00132864,0.0004983221,0.001793275,0.0007732582,0.000463523,0.1504903],"category_scores_gemma":[0.0003858616,0.0005084921,0.0006579373,0.001391214,0.0003450777,0.001210959,0.001329071,0.001034391,0.07717285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003475175,"about_ca_system_score_gemma":0.0004143296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001225717,"about_ca_topic_score_gemma":0.001877961,"domain_scores_codex":[0.9997864,0.00001348033,0.000008310526,0.0000495244,0.000122352,0.00001986761],"domain_scores_gemma":[0.9999019,0.00001161212,0.000004013875,0.00003503932,0.00003561409,0.00001173978],"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.00003604207,0.00003598817,0.0001082234,0.0001896615,0.00001212664,0.0001010589,0.00008516513,0.00483634,0.008295469,0.08199003,0.1406156,0.7636943],"study_design_scores_gemma":[0.0000163754,0.00002819717,0.0003745102,0.00009193359,0.00001867402,0.0004967845,0.00007902062,0.02068434,0.005593967,0.05662528,0.9159773,0.00001353958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.003156925,0.001839663,0.3137431,0.0003111017,0.0008255237,0.0001158162,0.001553658,0.004514841,0.6739395],"genre_scores_gemma":[0.03657219,0.003927351,0.2153724,0.0002418483,0.000322368,0.0001659619,0.007764091,0.002933828,0.7327],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1504903,"threshold_uncertainty_score":0.5034401,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Anna Lubiw","is_ca":true},{"name":"J. Ian Munro","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008533758,0.0008977499,0.002124616,0.001140855,0.001165916,0.003558522,0.002124076,0.001512892,0.005741336],"category_scores_gemma":[0.009026458,0.00100541,0.001160037,0.003010455,0.001285299,0.00738627,0.004648083,0.001468848,0.001218595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007622397,"about_ca_system_score_gemma":0.0007698261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002338617,"about_ca_topic_score_gemma":0.003559306,"domain_scores_codex":[0.9978039,0.0003220762,0.0001802191,0.0003661551,0.0009702939,0.0003574344],"domain_scores_gemma":[0.9945164,0.003148444,0.0003604561,0.001396162,0.0003555391,0.0002229695],"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.003109429,0.0005594424,0.006040948,0.001408308,0.0002138104,0.001559862,0.002162348,0.1448386,0.05896715,0.2028557,0.04184946,0.5364349],"study_design_scores_gemma":[0.0003615465,0.0002561835,0.001289235,0.00008582658,0.00009150939,0.0006147632,0.0008437886,0.578571,0.02867281,0.3667406,0.02241361,0.00005917888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2494609,0.001435549,0.7248862,0.0008908078,0.0001878908,0.0003450878,0.001731157,0.005979586,0.01508298],"genre_scores_gemma":[0.7140118,0.0006986576,0.2743769,0.0001638131,0.0001016921,0.000121074,0.003647594,0.001200178,0.005678205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005741336,"threshold_uncertainty_score":0.01920664,"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","authors":[{"name":"Timothy M. Chan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009830114,0.00193961,0.002018114,0.001391309,0.001459262,0.003379012,0.005087808,0.001771309,0.01977351],"category_scores_gemma":[0.005807155,0.001036207,0.001657487,0.004666917,0.0015948,0.01345036,0.005276066,0.002624405,0.006185221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002308747,"about_ca_system_score_gemma":0.001783356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005937607,"about_ca_topic_score_gemma":0.01006124,"domain_scores_codex":[0.9964818,0.0003656994,0.0002472097,0.0006797874,0.001534842,0.0006906064],"domain_scores_gemma":[0.9938663,0.001916995,0.0004351718,0.003126733,0.0004044976,0.0002503058],"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.003964763,0.0007249655,0.003173765,0.0009472134,0.0002748621,0.0005076692,0.0008632924,0.1451444,0.05096832,0.06766508,0.06606752,0.659698],"study_design_scores_gemma":[0.001162312,0.000502896,0.001703206,0.00009367649,0.000287154,0.001021313,0.0006533336,0.6829229,0.06184665,0.2027449,0.04691023,0.0001514207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09474459,0.001989265,0.837627,0.003806828,0.0002850405,0.0004578991,0.00381929,0.03307312,0.02419699],"genre_scores_gemma":[0.440813,0.001088911,0.5254131,0.0006821676,0.0002571942,0.0005703285,0.007798114,0.002976398,0.02040084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01977351,"threshold_uncertainty_score":0.066149,"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","authors":[{"name":"Chi‐Han Peng","is_ca":false},{"name":"Yong‐Liang Yang","is_ca":true},{"name":"Peter Wonka","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006406787,0.001185935,0.001297511,0.001404998,0.0004803632,0.00184233,0.001862644,0.001931887,0.004805876],"category_scores_gemma":[0.004537264,0.001383349,0.001468899,0.001401621,0.001138261,0.002357096,0.002287142,0.001642591,0.001860549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008623037,"about_ca_system_score_gemma":0.0007550364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002389259,"about_ca_topic_score_gemma":0.003773608,"domain_scores_codex":[0.9992468,0.000107351,0.00005484471,0.0002506736,0.0002742186,0.00006613055],"domain_scores_gemma":[0.9986884,0.0005521559,0.0001468534,0.0003796955,0.0001390816,0.0000938263],"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.00005381951,0.00002525112,0.0005082961,0.0001114493,0.00003568482,0.0001794769,0.0001065195,0.8886838,0.006473751,0.02241569,0.002266793,0.0791396],"study_design_scores_gemma":[0.00001003224,0.00001666945,0.00007175827,0.00001058193,0.000005798742,0.00005474404,0.00002769759,0.9731023,0.002806934,0.02146274,0.002418827,0.0000118653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006581885,0.00008404813,0.9915162,0.0000487653,0.00003146237,0.00002812356,0.0001241101,0.0007662547,0.0008192023],"genre_scores_gemma":[0.143264,0.0002865052,0.850903,0.00009490624,0.00004779254,0.0001383881,0.0009096263,0.0007257333,0.003630041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004805876,"threshold_uncertainty_score":0.01607722,"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","authors":[{"name":"C. M. Gold","is_ca":true},{"name":"Jack Snoeyink","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006117258,0.00122436,0.001621045,0.001832347,0.0009954756,0.001128893,0.002546455,0.001707333,0.01494998],"category_scores_gemma":[0.00175383,0.0009125711,0.001457645,0.001590068,0.000672681,0.001896795,0.003663475,0.001431528,0.005985057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003624695,"about_ca_system_score_gemma":0.001454462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001999548,"about_ca_topic_score_gemma":0.003847766,"domain_scores_codex":[0.9992943,0.00004924703,0.00005273338,0.0002025097,0.0003451606,0.00005606729],"domain_scores_gemma":[0.9991828,0.0001390918,0.00003847279,0.0003104643,0.000266327,0.00006287322],"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.0001238108,0.00009406047,0.0006351268,0.0001690794,0.00008348409,0.0001199815,0.00007155225,0.03536963,0.02502813,0.008150987,0.007321644,0.9228325],"study_design_scores_gemma":[0.00009631416,0.0001637925,0.001159843,0.0000389829,0.0001173281,0.0006509914,0.00007795193,0.9206171,0.03386972,0.02351614,0.01962617,0.00006562057],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002975499,0.0000729333,0.9931028,0.0000322162,0.00003185682,0.00005307661,0.00007257764,0.002516582,0.001142408],"genre_scores_gemma":[0.03013778,0.0000805903,0.9651287,0.00004730819,0.00001738823,0.00006328248,0.0004666941,0.0003560038,0.003702315],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01494998,"threshold_uncertainty_score":0.05001265,"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","authors":[{"name":"Vida Dujmović","is_ca":false},{"name":"David R. Wood","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004332809,0.0005003046,0.0004310883,0.000724116,0.0006886196,0.001646126,0.001020315,0.0004535522,0.005283499],"category_scores_gemma":[0.002373649,0.0006550052,0.000614781,0.001273691,0.001175532,0.002852761,0.001120799,0.0007207968,0.001021359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001039866,"about_ca_system_score_gemma":0.0007787083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003771655,"about_ca_topic_score_gemma":0.007016784,"domain_scores_codex":[0.9994295,0.0001153936,0.0000491983,0.0001417663,0.000175635,0.0000884349],"domain_scores_gemma":[0.998386,0.0004452613,0.0002523974,0.0005651205,0.0002222061,0.00012891],"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.001247952,0.0002021005,0.004699069,0.0005028597,0.00008865271,0.0003220433,0.001659743,0.1779811,0.05689144,0.3361533,0.01310425,0.4071475],"study_design_scores_gemma":[0.000204038,0.0006143892,0.00577981,0.0001330068,0.0001395648,0.0009616051,0.0008814747,0.4426692,0.04206534,0.4093064,0.09708644,0.0001587149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1687288,0.0009700374,0.8103549,0.0003411662,0.00009721021,0.0001686037,0.0008065322,0.003833518,0.01469929],"genre_scores_gemma":[0.4688771,0.0009459436,0.5103415,0.000137896,0.00007138828,0.0002068967,0.001406498,0.0009675581,0.01704534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005283499,"threshold_uncertainty_score":0.0176751,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Luc Devroye","is_ca":true},{"name":"William Evans","is_ca":true},{"name":"David Kirkpatrick","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00143276,0.001395973,0.0012324,0.006587708,0.001166132,0.002657329,0.001905326,0.00123732,0.009790682],"category_scores_gemma":[0.010048,0.0008953242,0.0007453507,0.004140296,0.002467977,0.004848257,0.001726539,0.002270239,0.001450924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001172347,"about_ca_system_score_gemma":0.0002591172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001406188,"about_ca_topic_score_gemma":0.001094896,"domain_scores_codex":[0.9992759,0.0002169429,0.00004035583,0.0001606305,0.0002174167,0.00008883014],"domain_scores_gemma":[0.9959031,0.002760638,0.0004623164,0.0001963889,0.0003529254,0.0003246576],"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.0001226429,0.00004379162,0.001107291,0.0002159342,0.00003347743,0.0001172743,0.0004410548,0.01092977,0.002983953,0.9282259,0.005559569,0.05021926],"study_design_scores_gemma":[0.00001861904,0.00004628986,0.001544729,0.00008622291,0.00004490514,0.0004244401,0.0002803572,0.03392655,0.001178652,0.9560844,0.006337125,0.00002775777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5599381,0.01675416,0.1902406,0.002694697,0.0005361824,0.0001080185,0.0009134079,0.0006200416,0.2281948],"genre_scores_gemma":[0.913047,0.01046694,0.05057519,0.0005157256,0.0009007182,0.0001349137,0.0009609557,0.0005729822,0.02282561],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009790682,"threshold_uncertainty_score":0.03275311,"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","authors":[{"name":"David Eppstein","is_ca":false},{"name":"Michael T. Goodrich","is_ca":false},{"name":"Ethan Kim","is_ca":true},{"name":"Rasmus Tamstorf","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002704766,0.0003826791,0.0004174962,0.0007875313,0.0005792017,0.0008516569,0.001017789,0.0004645523,0.005270354],"category_scores_gemma":[0.001114856,0.000332991,0.0004270013,0.0008813555,0.0006144488,0.001147093,0.002136769,0.0005054653,0.0009035716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000695422,"about_ca_system_score_gemma":0.0007179477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004567169,"about_ca_topic_score_gemma":0.007125088,"domain_scores_codex":[0.9996275,0.00006206874,0.00001927846,0.00009868568,0.0001285124,0.00006404402],"domain_scores_gemma":[0.999544,0.00008595332,0.00003598319,0.0001712039,0.0001126126,0.00005021959],"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.0003876788,0.0001152001,0.00333774,0.0003204091,0.00006417625,0.0004011912,0.0006631514,0.2721666,0.02248691,0.1842674,0.04116607,0.4746235],"study_design_scores_gemma":[0.00007063215,0.000076738,0.0009946676,0.00004964225,0.00002311617,0.0003001978,0.0003896124,0.8124985,0.01245278,0.1318602,0.04125599,0.00002790636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1029088,0.0003741393,0.8806047,0.0003935411,0.00007640988,0.0002433044,0.0006156068,0.001886916,0.01289657],"genre_scores_gemma":[0.476375,0.0002700131,0.5122521,0.000214978,0.00002367022,0.0001828839,0.002199187,0.0005516321,0.007930412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005270354,"threshold_uncertainty_score":0.01763111,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Chang Shu","is_ca":true},{"name":"Stefanie Wuhrer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008846742,0.001186614,0.001660198,0.004050173,0.001015521,0.002849762,0.002096873,0.001749028,0.007163548],"category_scores_gemma":[0.003161712,0.00135869,0.00126462,0.007559545,0.001276702,0.00463613,0.002498413,0.002135596,0.003075105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001256511,"about_ca_system_score_gemma":0.001168937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001981756,"about_ca_topic_score_gemma":0.002174009,"domain_scores_codex":[0.9992051,0.0001591431,0.00007495569,0.0001667113,0.0003575343,0.0000366614],"domain_scores_gemma":[0.9991633,0.0003884374,0.0000512164,0.000142944,0.0002009191,0.00005318685],"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.0000435903,0.0000535506,0.0007598127,0.001896246,0.00005030782,0.00009432698,0.0002669899,0.05106993,0.00199798,0.3725561,0.01512426,0.5560868],"study_design_scores_gemma":[0.00002632895,0.00009509,0.0005961762,0.0007049594,0.00004017273,0.0005125552,0.0001266642,0.174295,0.002234041,0.5355372,0.2857745,0.00005731202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007404855,0.06691688,0.9018518,0.001082472,0.0004890937,0.0001018503,0.0004873258,0.0007918378,0.02087392],"genre_scores_gemma":[0.070793,0.1679996,0.7412784,0.0004857697,0.0009842069,0.0002770496,0.002026298,0.001157789,0.01499802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007163548,"threshold_uncertainty_score":0.02396446,"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)","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001947433,0.0008149784,0.0004282033,0.0007285922,0.0005474843,0.0009273479,0.0008893658,0.0006940259,0.00758913],"category_scores_gemma":[0.003399517,0.0006357963,0.0004794089,0.001552845,0.0005049201,0.002053515,0.0006735098,0.0009139925,0.00149424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004111918,"about_ca_system_score_gemma":0.000184388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009459669,"about_ca_topic_score_gemma":0.002162726,"domain_scores_codex":[0.9995603,0.0001132246,0.00002360135,0.00008786437,0.0001524907,0.0000625424],"domain_scores_gemma":[0.9979382,0.0008308762,0.0006255782,0.0002784033,0.0002042031,0.0001226212],"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.0003572921,0.0001983984,0.007302594,0.0007165013,0.000149058,0.002107574,0.000727539,0.405596,0.05557917,0.3032717,0.01008089,0.2139132],"study_design_scores_gemma":[0.0001366895,0.0005475701,0.005660288,0.0001266556,0.0001297227,0.003140135,0.0006253652,0.5847743,0.0292828,0.3246792,0.0508155,0.00008174669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4382946,0.001490322,0.5173274,0.0004348514,0.00005898762,0.000178652,0.0006355244,0.0007561793,0.04082347],"genre_scores_gemma":[0.761504,0.002851386,0.2154551,0.0001183277,0.00009818831,0.0001739854,0.00193685,0.0002490608,0.01761297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00758913,"threshold_uncertainty_score":0.02538818,"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","authors":[{"name":"Lyudmil Aleksandrov","is_ca":false},{"name":"Anil Maheshwari","is_ca":true},{"name":"Jörg-Rüdiger Sack","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001789067,0.001879117,0.001470268,0.001528096,0.0008842756,0.001988422,0.003081209,0.002116163,0.00431677],"category_scores_gemma":[0.01139346,0.0006295218,0.001079456,0.003343411,0.001386692,0.004643106,0.0027662,0.002992711,0.00141578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001775402,"about_ca_system_score_gemma":0.00140037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002814928,"about_ca_topic_score_gemma":0.002571871,"domain_scores_codex":[0.9983652,0.000494059,0.00009784108,0.0003005904,0.0004892736,0.0002530774],"domain_scores_gemma":[0.9968645,0.002004119,0.0002235413,0.0004633704,0.000292132,0.0001523467],"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.0002399326,0.000154545,0.0006974224,0.0003121856,0.00009890256,0.00008560683,0.0001741985,0.7157968,0.001044653,0.1211673,0.007678828,0.1525497],"study_design_scores_gemma":[0.00005389559,0.00004701893,0.00007895966,0.00002723695,0.00001913581,0.00006195476,0.00005416151,0.8316089,0.0005592451,0.1636562,0.003823326,0.00000996686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007406607,0.0009519268,0.9879358,0.0003713515,0.00007909502,0.00005219542,0.0001161954,0.0004904681,0.002596388],"genre_scores_gemma":[0.2021255,0.00233021,0.7901056,0.000198261,0.0002389127,0.0002812506,0.001245677,0.0002545478,0.003220118],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00431677,"threshold_uncertainty_score":0.01444107,"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","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Elyot Grant","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003787407,0.003462343,0.004093077,0.002938705,0.003158102,0.007834707,0.00900288,0.004495923,0.0253943],"category_scores_gemma":[0.02564983,0.002366386,0.004289692,0.006942749,0.004556903,0.02042637,0.008745343,0.0126055,0.004031166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004495404,"about_ca_system_score_gemma":0.00339525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003983708,"about_ca_topic_score_gemma":0.003835798,"domain_scores_codex":[0.9948224,0.001143965,0.0003089659,0.001130339,0.00171704,0.0008772558],"domain_scores_gemma":[0.9802342,0.01326622,0.0009883839,0.00388632,0.0008736256,0.0007513497],"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.001734052,0.001150595,0.00313921,0.002073273,0.0002850914,0.0002725951,0.001114096,0.2332284,0.003464956,0.4493818,0.04993907,0.2542168],"study_design_scores_gemma":[0.0001831772,0.0001042139,0.0006714684,0.0000901823,0.00009050746,0.0001975033,0.0002293695,0.2264647,0.001431264,0.7621647,0.008333746,0.0000390826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06663244,0.005786419,0.8558244,0.007021353,0.0006989781,0.0004547839,0.002239794,0.002640861,0.05870095],"genre_scores_gemma":[0.427354,0.005751227,0.5120028,0.002091098,0.002133783,0.001994569,0.00656476,0.002095065,0.04001281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0253943,"threshold_uncertainty_score":0.08495235,"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","authors":[{"name":"Hassan Masum","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001897228,0.00183199,0.002256269,0.004444188,0.001140322,0.004640731,0.001851934,0.001990382,0.02647661],"category_scores_gemma":[0.00479216,0.00137993,0.001395647,0.00766128,0.002485655,0.006354757,0.002041895,0.005584049,0.02942073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002533322,"about_ca_system_score_gemma":0.00347028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00312948,"about_ca_topic_score_gemma":0.003436591,"domain_scores_codex":[0.998472,0.0002199643,0.0001174458,0.0002830454,0.0008137481,0.00009372486],"domain_scores_gemma":[0.9979218,0.0008705949,0.00014356,0.0001124721,0.000788232,0.0001634026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002350867,0.00002419511,0.0001642826,0.002936885,0.00003773339,0.00005871429,0.000175352,0.001547427,0.0002673852,0.04199668,0.6760308,0.276737],"study_design_scores_gemma":[0.000004305541,0.00001774127,0.0003040183,0.001085922,0.000008390635,0.0002253595,0.00005183378,0.0003313,0.00006612025,0.01341855,0.9844686,0.0000177251],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"commentary","genre_scores_codex":[0.0002936714,0.9447398,0.01094311,0.009952157,0.01100272,0.00003960573,0.0004503354,0.0002491938,0.02232933],"genre_scores_gemma":[0.002924379,0.9343678,0.008987641,0.003061677,0.01154446,0.0001106489,0.001014177,0.0003203611,0.03766904],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.02647661,"threshold_uncertainty_score":0.0885731,"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","authors":[{"name":"Marshall Bern","is_ca":false},{"name":"Erik D. Demaine","is_ca":true},{"name":"David Eppstein","is_ca":false},{"name":"Eric Kuo","is_ca":false},{"name":"Andrea Mantler","is_ca":true},{"name":"Jack Snoeyink","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003622047,0.0008724565,0.0008123213,0.0007087229,0.000682916,0.001391492,0.001406353,0.0008044051,0.007092398],"category_scores_gemma":[0.001850505,0.0006726162,0.0005365366,0.0006289242,0.001091344,0.002076136,0.002648799,0.0016364,0.001358102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000397147,"about_ca_system_score_gemma":0.0004129565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001013589,"about_ca_topic_score_gemma":0.00151519,"domain_scores_codex":[0.9995509,0.00008010304,0.00002837272,0.00007496305,0.000207717,0.00005795525],"domain_scores_gemma":[0.9994205,0.0001933497,0.00005719954,0.0001566518,0.0001142474,0.00005801747],"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.0003043133,0.0001324309,0.001442143,0.0003443051,0.00004136788,0.000928982,0.0005193079,0.2771722,0.02129279,0.4401993,0.01020157,0.2474213],"study_design_scores_gemma":[0.00003599845,0.0001108107,0.000711655,0.00007421975,0.00001938416,0.0005504696,0.0003203711,0.6897773,0.01534866,0.2724037,0.02061738,0.00003014747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08922479,0.0003210582,0.8859535,0.0002647659,0.0002252555,0.0001031848,0.0003510645,0.000482363,0.02307393],"genre_scores_gemma":[0.5018272,0.0005823171,0.4699976,0.0001398483,0.000088064,0.0001620907,0.0009312263,0.0006819211,0.02558971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007092398,"threshold_uncertainty_score":0.0237264,"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","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Prosenjit Bose","is_ca":true},{"name":"Erik D. Demaine","is_ca":true},{"name":"Anna Lubiw","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002402597,0.001840167,0.00196634,0.003121999,0.002177669,0.004190126,0.004763394,0.00250589,0.02500105],"category_scores_gemma":[0.01301606,0.001518416,0.002312041,0.004050779,0.001907417,0.01064037,0.007793262,0.004485045,0.005898353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00219885,"about_ca_system_score_gemma":0.001980248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002095994,"about_ca_topic_score_gemma":0.002784924,"domain_scores_codex":[0.9973839,0.0004563719,0.0001709809,0.0006285242,0.001045505,0.0003148154],"domain_scores_gemma":[0.9962823,0.001991806,0.0001694982,0.001002063,0.0004330401,0.0001214075],"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.0003441833,0.0002809137,0.0006326685,0.000338125,0.0001255456,0.000112926,0.0002454687,0.04032287,0.003174034,0.5407573,0.01936178,0.3943043],"study_design_scores_gemma":[0.0001242989,0.00005452181,0.0001913473,0.00003148341,0.00006736353,0.0001018752,0.00009887238,0.2457337,0.00383392,0.7381524,0.01158015,0.00003002538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01094254,0.0003645445,0.9697534,0.0005820723,0.0002044393,0.0001790681,0.0002063931,0.001439559,0.0163279],"genre_scores_gemma":[0.15024,0.0006209345,0.8315092,0.0002861572,0.0002420528,0.0004131692,0.0009670717,0.001026402,0.01469503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02500105,"threshold_uncertainty_score":0.08363682,"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","authors":[{"name":"Mark Keil","is_ca":true},{"name":"Jack Snoeyink","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073558,0.002657979,0.002026265,0.001480063,0.001160215,0.004256525,0.002694675,0.001303077,0.02088587],"category_scores_gemma":[0.01054512,0.00100546,0.001895085,0.002556267,0.001557756,0.007038219,0.003651664,0.002180699,0.004198999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002560883,"about_ca_system_score_gemma":0.002124116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006391433,"about_ca_topic_score_gemma":0.01048567,"domain_scores_codex":[0.996894,0.0005186019,0.0001547068,0.0004801583,0.001072493,0.0008799214],"domain_scores_gemma":[0.9917563,0.00546359,0.0004730847,0.001353178,0.0005330706,0.0004206968],"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.005222025,0.0004087643,0.003118285,0.001849253,0.0002494964,0.0006447813,0.000572039,0.4091238,0.05192753,0.07927399,0.04402348,0.4035866],"study_design_scores_gemma":[0.0003549067,0.0002772154,0.0007898372,0.0001355543,0.0001380939,0.0002659449,0.0001969507,0.89648,0.01344304,0.07703386,0.0108378,0.00004689625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1309427,0.006111367,0.8002225,0.002590013,0.0004325396,0.0003529279,0.001852216,0.009268601,0.04822722],"genre_scores_gemma":[0.501885,0.003053965,0.4679694,0.000809013,0.0003230848,0.0005946669,0.005020917,0.002784707,0.01755927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02088587,"threshold_uncertainty_score":0.06987023,"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","authors":[{"name":"Peyman Afshani","is_ca":true},{"name":"Timothy M. Chan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001782518,0.000602506,0.001121679,0.001067204,0.0006566948,0.002563943,0.00267966,0.001003262,0.005246252],"category_scores_gemma":[0.01159362,0.0004617073,0.0008240612,0.002198047,0.0009524517,0.005237468,0.004553969,0.001331068,0.001110359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000674516,"about_ca_system_score_gemma":0.0008140264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001719465,"about_ca_topic_score_gemma":0.0009535404,"domain_scores_codex":[0.9972615,0.0006349116,0.0002384079,0.0004095667,0.001053947,0.0004017311],"domain_scores_gemma":[0.9926957,0.002676943,0.000781831,0.002851272,0.0007531563,0.000241158],"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.001048463,0.0002210215,0.004027857,0.0005246588,0.0001136418,0.0003559676,0.001418331,0.1866307,0.02984155,0.1745798,0.01714837,0.5840896],"study_design_scores_gemma":[0.0001177894,0.0003468997,0.001565991,0.0000857816,0.00004291733,0.0006015977,0.0007191724,0.821812,0.03139042,0.1298763,0.0133319,0.0001091252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09788179,0.0009538325,0.891229,0.0007288042,0.00009635232,0.00009386109,0.0007254949,0.002483701,0.005806985],"genre_scores_gemma":[0.5046033,0.0006794982,0.4891387,0.0002502229,0.00006781507,0.0001866189,0.001242462,0.0003724628,0.003458994],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005246252,"threshold_uncertainty_score":0.01755047,"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","authors":[{"name":"Mark Lanthier","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Jörg-Rüdiger Sack","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009786889,0.001297727,0.001522243,0.00234676,0.0005548915,0.001428924,0.002264473,0.001498418,0.003810996],"category_scores_gemma":[0.00845504,0.001167599,0.00087349,0.002318639,0.001220763,0.002512687,0.002684996,0.001740732,0.000605507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001222643,"about_ca_system_score_gemma":0.0006037197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00340938,"about_ca_topic_score_gemma":0.004417602,"domain_scores_codex":[0.9991732,0.0002259294,0.00004598249,0.0001449886,0.0003331975,0.00007671124],"domain_scores_gemma":[0.9973772,0.001802709,0.0001838333,0.0002296628,0.0002762574,0.0001303428],"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.0001928167,0.00007483859,0.0008456463,0.0001816019,0.0000470913,0.00008336914,0.0001551646,0.8583431,0.003026154,0.0640232,0.001927938,0.07109897],"study_design_scores_gemma":[0.00001251496,0.00002507787,0.00007640659,0.00001162081,0.000006438797,0.00001748987,0.00002962861,0.9541941,0.0006074852,0.04432814,0.0006868483,0.000004250642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09763142,0.0003074222,0.8983423,0.0001408929,0.00005973483,0.00008650625,0.0001671436,0.000397667,0.002866989],"genre_scores_gemma":[0.4373332,0.0005905274,0.5538583,0.00006372644,0.00004662112,0.0002995261,0.000744506,0.0004661541,0.006597454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003810996,"threshold_uncertainty_score":0.01274908,"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","authors":[{"name":"M. Soucy","is_ca":true},{"name":"Denis Laurendeau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004252446,0.0006966421,0.0008010704,0.001081047,0.0003551567,0.001397137,0.001063322,0.001019257,0.004251536],"category_scores_gemma":[0.00112068,0.0007639555,0.001366213,0.0009945385,0.0003412786,0.001682897,0.001651697,0.001190192,0.001601084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003834042,"about_ca_system_score_gemma":0.0006344839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001420391,"about_ca_topic_score_gemma":0.002001219,"domain_scores_codex":[0.9993006,0.0000779318,0.00002530847,0.0001008616,0.0004481305,0.00004718894],"domain_scores_gemma":[0.9996031,0.00009758969,0.00004082742,0.0001430058,0.00009576385,0.00001962831],"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.0001177698,0.00006348742,0.0009118053,0.0002834251,0.0001080626,0.0005146095,0.0003915697,0.5070143,0.1440208,0.05207078,0.004287166,0.2902162],"study_design_scores_gemma":[0.00001080716,0.00003496556,0.00029856,0.00001950151,0.00002128346,0.0004051234,0.00003949946,0.9625068,0.02073008,0.007556847,0.008347431,0.00002914038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003329577,0.00009742512,0.9948672,0.00005017297,0.00001287031,0.00001431061,0.0000446143,0.0004673639,0.001116493],"genre_scores_gemma":[0.1305124,0.0004098217,0.8650031,0.00004122991,0.0000325125,0.00006632055,0.0003569066,0.0003897335,0.003187939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004251536,"threshold_uncertainty_score":0.0142228,"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","authors":[{"name":"Timothy M. Chan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00156814,0.0009614959,0.00237091,0.001983565,0.002067772,0.002752073,0.005893496,0.001961146,0.007327477],"category_scores_gemma":[0.01094966,0.001249873,0.001596905,0.004760856,0.001860649,0.008079945,0.007836561,0.002894826,0.003411871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001954763,"about_ca_system_score_gemma":0.002578992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002981155,"about_ca_topic_score_gemma":0.003885075,"domain_scores_codex":[0.9965867,0.0004237773,0.000399608,0.0006989636,0.001558619,0.0003323311],"domain_scores_gemma":[0.9925635,0.001673202,0.000643571,0.003894929,0.0008331597,0.0003916226],"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.001798795,0.0008508137,0.003989939,0.0006661648,0.0001758642,0.0004360455,0.0006519273,0.1954479,0.02826419,0.2050124,0.06251624,0.5001898],"study_design_scores_gemma":[0.0003827981,0.0004453953,0.0005447753,0.00006373932,0.00006089019,0.0004295713,0.0001577281,0.8269182,0.01454447,0.1190874,0.03722724,0.0001377119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01360449,0.0004472016,0.975055,0.0008574957,0.0001651625,0.0002302435,0.001720108,0.005632168,0.002288193],"genre_scores_gemma":[0.1924306,0.0003900201,0.7944791,0.0005208132,0.0002344203,0.001137778,0.005799183,0.0007907459,0.004217348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007327477,"threshold_uncertainty_score":0.02451283,"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","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"Michael R. Fellows","is_ca":false},{"name":"Matthew Kitching","is_ca":true},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Catherine McCartin","is_ca":false},{"name":"Naomi Nishimura","is_ca":true},{"name":"Prabhakar Ragde","is_ca":true},{"name":"Frances Rosamond","is_ca":false},{"name":"Sue Whitesides","is_ca":true},{"name":"David R. Wood","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003029772,0.001362853,0.002243217,0.00201307,0.001865592,0.006866141,0.005054753,0.002658034,0.0220753],"category_scores_gemma":[0.03906356,0.00147736,0.002248056,0.004478225,0.003400094,0.01875035,0.006031032,0.005773583,0.002101392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004308614,"about_ca_system_score_gemma":0.002428393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005764497,"about_ca_topic_score_gemma":0.00685404,"domain_scores_codex":[0.9959106,0.001468391,0.0002423565,0.0006630709,0.001281324,0.0004342079],"domain_scores_gemma":[0.9593671,0.03144258,0.001680024,0.005222162,0.001330067,0.0009580845],"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.0005675204,0.0002285264,0.003959327,0.0005154978,0.0001381484,0.0002163054,0.0006643991,0.2736784,0.003350764,0.6001336,0.01679453,0.09975305],"study_design_scores_gemma":[0.0000557678,0.00003025491,0.0004699795,0.00002987946,0.00004248878,0.00007868406,0.00009336249,0.4549308,0.0008238194,0.5404222,0.003001549,0.00002124493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1376696,0.001800895,0.8155966,0.005432308,0.000267098,0.0001997584,0.001584313,0.002105918,0.03534354],"genre_scores_gemma":[0.686157,0.002194277,0.2879673,0.0006789003,0.0004659139,0.00043024,0.00371315,0.001656361,0.01673683],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0220753,"threshold_uncertainty_score":0.0738492,"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","authors":[{"name":"Teseo Schneider","is_ca":true},{"name":"Yixin Hu","is_ca":false},{"name":"Xifeng Gao","is_ca":false},{"name":"Jérémie Dumas","is_ca":false},{"name":"Denis Zorin","is_ca":false},{"name":"Daniele Panozzo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002811256,0.001447941,0.0009681945,0.002949549,0.0008393368,0.001803421,0.00235595,0.001813887,0.004504162],"category_scores_gemma":[0.01167981,0.000566526,0.001268443,0.002869355,0.0009159402,0.002038461,0.001886937,0.001436135,0.002942448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006429799,"about_ca_system_score_gemma":0.0009130486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003696335,"about_ca_topic_score_gemma":0.006559043,"domain_scores_codex":[0.9961659,0.0005833042,0.0003357039,0.0005685039,0.002170784,0.0001757912],"domain_scores_gemma":[0.9945099,0.002814862,0.0001968136,0.001096604,0.0012027,0.0001790903],"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.001433042,0.00120367,0.02364704,0.004725625,0.0005195711,0.0006807888,0.0006606359,0.3408228,0.0183577,0.02011386,0.1692199,0.4186153],"study_design_scores_gemma":[0.0003123224,0.0009505428,0.02878987,0.0006204678,0.0001576839,0.001379907,0.001065097,0.7325622,0.0353371,0.01458604,0.1840611,0.0001776125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5708402,0.02124008,0.2706478,0.002664679,0.002001124,0.0009044366,0.03946837,0.02259487,0.06963843],"genre_scores_gemma":[0.6318319,0.005536104,0.2233184,0.000696062,0.0002596691,0.0006901705,0.1233601,0.005399841,0.008907716],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004504162,"threshold_uncertainty_score":0.01506793,"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","authors":[{"name":"Lori Freitag Diachin","is_ca":false},{"name":"Patrick Knupp","is_ca":false},{"name":"Todd Munson","is_ca":false},{"name":"Suzanne M. Shontz","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003028147,0.001193359,0.002216767,0.00272026,0.0006355094,0.001510472,0.002211568,0.002325376,0.003717708],"category_scores_gemma":[0.0103481,0.0006137596,0.00153719,0.002387908,0.0007221014,0.001781425,0.001518994,0.001469678,0.0008434606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000716836,"about_ca_system_score_gemma":0.001125445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003699607,"about_ca_topic_score_gemma":0.003856671,"domain_scores_codex":[0.9968504,0.0008467721,0.0001761912,0.0002316794,0.001758822,0.0001360336],"domain_scores_gemma":[0.9935546,0.003806083,0.0003207823,0.0007476786,0.001426181,0.0001447894],"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.002039054,0.000755406,0.002319441,0.001412275,0.0005035502,0.00008233185,0.0002512617,0.1958555,0.01857604,0.016244,0.004004999,0.757956],"study_design_scores_gemma":[0.0002468319,0.0005188757,0.002340606,0.00006560596,0.0001335709,0.0001405407,0.00005270672,0.9790226,0.01083618,0.003026431,0.00355054,0.00006544167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03472036,0.005376857,0.9499157,0.0004678123,0.0004126772,0.0002276086,0.0001768538,0.002175956,0.006526209],"genre_scores_gemma":[0.2661415,0.002925493,0.723482,0.0002777489,0.000202634,0.0004228381,0.0004611979,0.001566214,0.004520513],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003717708,"threshold_uncertainty_score":0.01601458,"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","authors":[{"name":"Marco Livesu","is_ca":true},{"name":"Alla Sheffer","is_ca":true},{"name":"Nicholas Vining","is_ca":true},{"name":"Marco Tarini","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009042998,0.0007618868,0.0007209239,0.0003820684,0.0003264215,0.0009007886,0.0009904603,0.0009889934,0.004778841],"category_scores_gemma":[0.002218143,0.0004580607,0.0005524734,0.0003564298,0.0007187599,0.0006741491,0.00126011,0.001235262,0.0009790909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005505974,"about_ca_system_score_gemma":0.0008892827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002248255,"about_ca_topic_score_gemma":0.002866737,"domain_scores_codex":[0.9996723,0.00006184463,0.0000163319,0.00005973005,0.0001498459,0.00003996399],"domain_scores_gemma":[0.9993799,0.0002955873,0.00004467363,0.0001013301,0.0001486291,0.00002976814],"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.00006092215,0.00003451467,0.0006527792,0.0001065535,0.00001246351,0.0001241286,0.0001135704,0.9176831,0.006231701,0.0179259,0.002638605,0.05441583],"study_design_scores_gemma":[0.000006722966,0.00001130712,0.00003567996,0.000006357435,0.000001355049,0.00001849062,0.00001440295,0.9940229,0.001446983,0.00367393,0.0007588712,0.00000300457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01592256,0.00006487172,0.9770299,0.000130279,0.00002287863,0.00005520887,0.00008491367,0.0005926514,0.00609671],"genre_scores_gemma":[0.3039036,0.0001002397,0.689015,0.0001302235,0.00001596578,0.000177799,0.0003146372,0.0005871535,0.005755354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004778841,"threshold_uncertainty_score":0.0159868,"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","authors":[{"name":"William Evans","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001213107,0.0003394951,0.0008573679,0.001249144,0.000743112,0.001804007,0.001542518,0.0009565062,0.002803836],"category_scores_gemma":[0.01318998,0.0004719444,0.000521514,0.00130807,0.001281789,0.003331228,0.002400656,0.000920222,0.000477298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001045601,"about_ca_system_score_gemma":0.0007594646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00239159,"about_ca_topic_score_gemma":0.002018886,"domain_scores_codex":[0.9973575,0.0008624641,0.0001267382,0.0003796261,0.001057816,0.0002158407],"domain_scores_gemma":[0.9938349,0.003784579,0.0007522738,0.0006523784,0.0006756919,0.0003002374],"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.0003067741,0.00003076968,0.003372749,0.0002125954,0.00003781343,0.0003080219,0.0004003069,0.3246806,0.004107184,0.6198746,0.00209808,0.04457061],"study_design_scores_gemma":[0.00005836917,0.00004146105,0.0007483976,0.00003833098,0.00001325098,0.00038191,0.0001498226,0.6063759,0.002853305,0.3754337,0.01387356,0.00003199657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06457274,0.0005912975,0.9302417,0.0001457231,0.00003324511,0.00004655128,0.0004496441,0.0001890518,0.003729985],"genre_scores_gemma":[0.6774125,0.0005623452,0.3178264,0.00006165957,0.00005171343,0.000172374,0.0009488965,0.0001385588,0.002825534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002803836,"threshold_uncertainty_score":0.009379745,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}