{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":236,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":236,"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":"e398ba414c6d","filters":{"venue":"Computational Geometry"}},"results":[{"id":"W3138447845","doi":"10.1016/s0925-7721(02)00093-7","title":"Computing contour trees in all dimensions","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":460,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"University of North Carolina at Chapel Hill; Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Simple (philosophy); Computer science; Contour line; Algorithm; Mathematics; Artificial intelligence; Cartography; Geography","authors":[{"name":"Hamish Carr","is_ca":true},{"name":"Jack Snoeyink","is_ca":false},{"name":"Ulrike Axen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04481388461551654,"gpt":0.2730690683067274,"spread":0.2282551836912108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008292071,0.0006596583,0.001279406,0.001932447,0.001004916,0.003467733,0.001455477,0.0009760904,0.005385449],"category_scores_gemma":[0.007557273,0.0007632446,0.0006203008,0.003191063,0.00106095,0.005400366,0.002495886,0.001386037,0.001388451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006156068,"about_ca_system_score_gemma":0.0007756648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001860953,"about_ca_topic_score_gemma":0.003060068,"domain_scores_codex":[0.9993332,0.0001015511,0.00007052905,0.000144642,0.0002575826,0.00009243809],"domain_scores_gemma":[0.9970059,0.001330577,0.0002256686,0.0008000748,0.0004556919,0.0001821127],"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.0004666905,0.0001224834,0.005357102,0.0004508989,0.00009372753,0.0002478052,0.000632905,0.2121231,0.0107364,0.2951135,0.01223017,0.4624252],"study_design_scores_gemma":[0.00003364111,0.00006022469,0.0007096301,0.0000402727,0.00003600415,0.0001224226,0.0001247135,0.6350014,0.005699695,0.3487515,0.009400516,0.00002007338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08574105,0.0008702689,0.9049456,0.0003525676,0.00009984215,0.00005441053,0.000554489,0.001701182,0.005680603],"genre_scores_gemma":[0.3707682,0.0009743756,0.6217643,0.00009092058,0.00008809056,0.0000799154,0.001396578,0.0004871991,0.004350392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005385449,"threshold_uncertainty_score":0.01801616,"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":"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":"W2010585683","doi":"10.1016/j.comgeo.2006.05.009","title":"Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":100,"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":"National Science Foundation","keywords":"Contour line; Scalar field; Scalar (mathematics); Tree (set theory); Visualization; Computational topology; Computer science; Topology (electrical circuits); Computer vision; Artificial intelligence; Computer graphics (images); Geometry; Mathematics; Geography; Cartography; Mathematical analysis; Combinatorics","authors":[{"name":"Hamish Carr","is_ca":false},{"name":"Jack Snoeyink","is_ca":false},{"name":"Michiel van de Panne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03224609841312839,"gpt":0.2959241551014609,"spread":0.2636780566883325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009499214,0.0008743448,0.001119538,0.002014212,0.0006499327,0.004061497,0.001339203,0.0008258231,0.006217632],"category_scores_gemma":[0.005513053,0.0006302122,0.0008327489,0.002220552,0.0009742086,0.003788748,0.003059988,0.001684294,0.001466023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004426427,"about_ca_system_score_gemma":0.0006858138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0012852,"about_ca_topic_score_gemma":0.001423512,"domain_scores_codex":[0.9994839,0.0001109438,0.00003897668,0.00005715868,0.0002632249,0.00004575416],"domain_scores_gemma":[0.9981961,0.0006931979,0.00009561583,0.0006294009,0.0002704929,0.0001152208],"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.0005910633,0.0001470901,0.001910162,0.0004242586,0.00006924695,0.0006829637,0.001638458,0.1189599,0.053087,0.2143753,0.01544032,0.5926742],"study_design_scores_gemma":[0.00005420463,0.00008579629,0.0005244639,0.00006261965,0.00003373965,0.0003893992,0.0002605012,0.7982465,0.02664341,0.1470658,0.02655501,0.00007851313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02197468,0.0001536005,0.9717678,0.0001924917,0.00006067316,0.00004456984,0.0002295954,0.003191429,0.00238512],"genre_scores_gemma":[0.3703381,0.0007687918,0.6227004,0.0001262805,0.00006929877,0.0001002481,0.0007619787,0.002582905,0.002551995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006217632,"threshold_uncertainty_score":0.02080005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2196668152","doi":"10.1016/s0925-7721(99)00056-5","title":"Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"STRIPS; Polyhedron; Silhouette; Folding (DSP implementation); Geometry; Computer science; Planar; Constructive; Topology (electrical circuits); Algorithm; Mathematics; Computer graphics (images); Combinatorics; Computer vision; Structural engineering; Engineering; Process (computing)","authors":[{"name":"Erik D. Demaine","is_ca":true},{"name":"Martin L. Demaine","is_ca":true},{"name":"Joseph S. B. Mitchell","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01035372215173801,"gpt":0.2256887576563461,"spread":0.2153350355046081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007117582,0.0009536412,0.001191608,0.000907842,0.0005906294,0.001523862,0.001362019,0.0011933,0.002298363],"category_scores_gemma":[0.004516125,0.0007879362,0.0009693164,0.001369485,0.002021239,0.002568717,0.002820343,0.002480822,0.0008831948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003270345,"about_ca_system_score_gemma":0.0003263713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008721926,"about_ca_topic_score_gemma":0.000861625,"domain_scores_codex":[0.9995697,0.0001364549,0.00002267567,0.00006415916,0.0001770914,0.00002997287],"domain_scores_gemma":[0.998403,0.001023345,0.00007352239,0.0003204489,0.0001202174,0.00005940464],"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.0001603845,0.0001573839,0.000810396,0.0002834497,0.00007688088,0.0001163737,0.0006166008,0.4767311,0.007504138,0.3040496,0.004142634,0.2053512],"study_design_scores_gemma":[0.00001893132,0.00003778096,0.0001236967,0.00001886365,0.00001405537,0.00002249063,0.00003583735,0.8821747,0.002304088,0.1122696,0.002961983,0.00001808349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05127318,0.0008806785,0.941425,0.0002015612,0.00009651426,0.00003095904,0.00006642741,0.0006453799,0.005380254],"genre_scores_gemma":[0.4326014,0.002151155,0.5563729,0.0002580392,0.0001847904,0.0002164726,0.0004489693,0.001545842,0.006220372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002298363,"threshold_uncertainty_score":0.007688761,"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":"W2953304270","doi":"10.1016/j.comgeo.2004.07.003","title":"Planar minimally rigid graphs and pseudo-triangulations","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":94,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Ministerio de Ciencia y Tecnología; McGill University; National Institutes of Health; National Science Foundation","keywords":"Planar graph; Embedding; Combinatorics; Mathematical proof; Planar; Generalization; Rigidity (electromagnetism); Mathematics; Statement (logic); Plane (geometry); Book embedding; Discrete mathematics; Computer science; Graph; Chordal graph; 1-planar graph; Geometry; Physics; Artificial intelligence; Computer graphics (images); Mathematical analysis","authors":[{"name":"Ruth Haas","is_ca":false},{"name":"David Orden","is_ca":false},{"name":"Günter Rote","is_ca":false},{"name":"Francisco Santos","is_ca":false},{"name":"Brigitte Servatius","is_ca":false},{"name":"Herman Servatius","is_ca":false},{"name":"Diane L. Souvaine","is_ca":false},{"name":"Ileana Streinu","is_ca":false},{"name":"Walter Whiteley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006361768937535068,"gpt":0.2021205744744413,"spread":0.1957588055369062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003663642,0.000730511,0.000539273,0.001647207,0.0008941959,0.001402012,0.001354747,0.001184749,0.007033595],"category_scores_gemma":[0.003278114,0.0006368152,0.0006841727,0.001377932,0.002076543,0.002399761,0.001760663,0.001752257,0.001033585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004752797,"about_ca_system_score_gemma":0.0003143981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008376565,"about_ca_topic_score_gemma":0.00124853,"domain_scores_codex":[0.9995463,0.0001768041,0.00001628015,0.00009685208,0.0001271707,0.00003654994],"domain_scores_gemma":[0.9989486,0.0004576251,0.0001904109,0.000181774,0.0001475106,0.00007400905],"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.00003021305,0.00001208108,0.0001565785,0.00005788407,0.00001059852,0.00005898955,0.0001202938,0.02104155,0.001142141,0.957203,0.001721745,0.01844502],"study_design_scores_gemma":[0.000005801389,0.000009545173,0.0001464043,0.000009343028,0.000004820592,0.00007673022,0.00005998423,0.02624174,0.0003028823,0.9697483,0.00338641,0.000007887963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07981372,0.001339694,0.884056,0.001010601,0.0001870677,0.00005879766,0.0003801495,0.0002983313,0.03285568],"genre_scores_gemma":[0.7217486,0.002807769,0.243253,0.00063789,0.0003776776,0.0002254205,0.001042747,0.0003948206,0.02951213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007033595,"threshold_uncertainty_score":0.02352971,"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":"W2006707333","doi":"10.1016/s0925-7721(02)00102-5","title":"Fast approximations for sums of distances, clustering and the Fermat–Weber problem","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","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":"Carleton University","funders":"","keywords":"Fermat's Last Theorem; Mathematics; Cluster analysis; Dimension (graph theory); Combinatorics; Randomized algorithm; Euclidean geometry; Preprocessor; Constant (computer programming); Set (abstract data type); Point (geometry); Approximation algorithm; Discrete mathematics; Algorithm; Computer science; Geometry; Statistics; Artificial intelligence","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01932622633743269,"gpt":0.2275792836494696,"spread":0.2082530573120369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003812445,0.001479074,0.002328821,0.002892112,0.001678145,0.003146112,0.003832527,0.002629686,0.005599998],"category_scores_gemma":[0.02762563,0.001155459,0.001297749,0.004120417,0.002512891,0.008760001,0.004670608,0.003613587,0.001563891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002607667,"about_ca_system_score_gemma":0.001527305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003924944,"about_ca_topic_score_gemma":0.004779537,"domain_scores_codex":[0.9980763,0.0006129551,0.0001180685,0.0003185029,0.000706484,0.0001676533],"domain_scores_gemma":[0.993288,0.004614235,0.0004265078,0.0007953144,0.0005520589,0.0003238881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004566909,0.000103336,0.0009899592,0.0004093577,0.0001071361,0.0001381025,0.0003952593,0.3209707,0.002026311,0.5017212,0.01153163,0.1611503],"study_design_scores_gemma":[0.00002228931,0.00002195927,0.0001487852,0.00002504964,0.00001291413,0.00007934944,0.00005668772,0.6866023,0.0006340368,0.3097719,0.002605094,0.00001965093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02343458,0.001230844,0.97049,0.0006486406,0.0002259115,0.00004253721,0.0001317387,0.0004425636,0.003353079],"genre_scores_gemma":[0.2204327,0.001142642,0.7671581,0.0002286797,0.0002843875,0.000188348,0.0007160047,0.000544909,0.009304246],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005599998,"threshold_uncertainty_score":0.0201624,"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":"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":"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":"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":"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":"W1987886060","doi":"10.1016/j.comgeo.2006.09.002","title":"Drawings of planar graphs with few slopes and segments","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Planar graph; Outerplanar graph; Planar; Plane (geometry); 1-planar graph; Graph; Graph drawing","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.005476708649105324,"gpt":0.2015230887419834,"spread":0.1960463800928781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001602856,0.001097769,0.0005221298,0.001109217,0.0006643346,0.001356658,0.001189274,0.001031533,0.01383393],"category_scores_gemma":[0.002044591,0.0008767992,0.0005380866,0.001554228,0.0006426625,0.00121399,0.0009909548,0.001669816,0.002642084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004627776,"about_ca_system_score_gemma":0.0003366585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001488573,"about_ca_topic_score_gemma":0.003468679,"domain_scores_codex":[0.9996531,0.00009553166,0.00001530236,0.00007637898,0.0001200517,0.00003967481],"domain_scores_gemma":[0.9992779,0.0002364842,0.00009833679,0.0001566459,0.0001393086,0.00009136907],"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.0002701631,0.0001585103,0.001892196,0.0006443753,0.00008018271,0.001345936,0.00083134,0.1490409,0.03931593,0.5256096,0.03376259,0.2470483],"study_design_scores_gemma":[0.0001425889,0.0001720733,0.002484397,0.0001822509,0.00009968113,0.00139325,0.0006045479,0.2560724,0.01752048,0.6164549,0.1047831,0.00009032456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1121606,0.0005662036,0.8283756,0.0005561922,0.0001754909,0.000298014,0.00184764,0.001641042,0.05437927],"genre_scores_gemma":[0.4789583,0.001675234,0.4814793,0.0002282361,0.00008553461,0.0002800272,0.004293476,0.000850107,0.03214978],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01383393,"threshold_uncertainty_score":0.04627913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005387480","doi":"10.1016/j.comgeo.2004.04.002","title":"Curve-constrained drawings of planar graphs","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Embedding; Book embedding; Planar graph; Combinatorics; Planar; Planar straight-line graph; Mathematics; Bent molecular geometry; Graph; Graph embedding; Jordan curve theorem; Point (geometry); Discrete mathematics; Computer science; Geometry; 1-planar graph; Computer graphics (images); Line graph; Artificial intelligence","authors":[{"name":"Emilio Di Giacomo","is_ca":false},{"name":"Walter Didimo","is_ca":false},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Stephen Wismath","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01268555903446319,"gpt":0.2415623381176972,"spread":0.228876779083234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002815593,0.0009008239,0.0006852527,0.001603162,0.0005943932,0.001556706,0.001507282,0.001206341,0.01445527],"category_scores_gemma":[0.003180607,0.0007906755,0.0004738968,0.002781363,0.00081057,0.001842918,0.001653133,0.001449081,0.001922044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000651665,"about_ca_system_score_gemma":0.0005668054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002901898,"about_ca_topic_score_gemma":0.005659289,"domain_scores_codex":[0.9994143,0.0001113895,0.000023801,0.00008832913,0.0003093285,0.00005280554],"domain_scores_gemma":[0.999029,0.0003128948,0.0001176865,0.0002164989,0.0002416515,0.00008224593],"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.000127692,0.00008646402,0.0008203867,0.0003168064,0.00003425007,0.0003733328,0.0003946389,0.2958301,0.0190813,0.3928304,0.01715343,0.2729514],"study_design_scores_gemma":[0.00005327979,0.00006034328,0.0005246684,0.00008786748,0.00002488835,0.0003003063,0.0001969241,0.609946,0.009621862,0.3321019,0.04704312,0.00003892471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04837444,0.0003383032,0.9256039,0.0002362593,0.00006668412,0.0001606503,0.0007142334,0.0007580701,0.02374758],"genre_scores_gemma":[0.4118928,0.001715822,0.559305,0.0001183667,0.0000693123,0.0002675638,0.00267965,0.0007995632,0.02315181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01445527,"threshold_uncertainty_score":0.04835778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138849026","doi":"10.1016/j.comgeo.2008.12.005","title":"Compatible geometric matchings","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Conjecture; Perfect power; Matching (statistics); Disjoint union (topology); Sequence (biology); Trivially perfect graph; Vertex (graph theory); Perfect graph theorem; Discrete mathematics; Graph; Chordal graph; Line graph","authors":[{"name":"Oswin Aichholzer","is_ca":false},{"name":"Sergey Bereg","is_ca":false},{"name":"Adrian Dumitrescu","is_ca":false},{"name":"Alfredo Garcı́a","is_ca":false},{"name":"Clemens Huemer","is_ca":false},{"name":"Ferrán Hurtado","is_ca":false},{"name":"Mikio Kanō","is_ca":false},{"name":"Alberto Márquez","is_ca":false},{"name":"David Rappaport","is_ca":true},{"name":"Shakhar Smorodinsky","is_ca":false},{"name":"Diane L. Souvaine","is_ca":false},{"name":"Jorge Urrutia","is_ca":false},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01294248792834839,"gpt":0.2517698411812386,"spread":0.2388273532528902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000846978,0.0008636799,0.0009530071,0.002420272,0.00125167,0.002366372,0.00172606,0.001634778,0.03256202],"category_scores_gemma":[0.005486529,0.0005638578,0.001117811,0.00209486,0.00111576,0.003673207,0.004096337,0.001865237,0.00914796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006177688,"about_ca_system_score_gemma":0.000720804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004640241,"about_ca_topic_score_gemma":0.0004853447,"domain_scores_codex":[0.9982315,0.0002326852,0.0000990683,0.0005092011,0.0007046759,0.0002227927],"domain_scores_gemma":[0.9985923,0.0002190477,0.0001083783,0.0006473784,0.0003186572,0.0001142207],"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.0002757851,0.0001481974,0.0007386482,0.0001592564,0.00004282241,0.0003375275,0.0002278994,0.008722265,0.01618266,0.7089222,0.01628827,0.2479543],"study_design_scores_gemma":[0.0000663855,0.0001705923,0.0006569282,0.00006336022,0.00005922867,0.00085811,0.0002709852,0.05718276,0.02547463,0.8297468,0.08540216,0.00004798067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05172949,0.0004355785,0.8265084,0.000498338,0.0005983108,0.000379027,0.001014532,0.0020209,0.1168154],"genre_scores_gemma":[0.5667262,0.0007824338,0.3342124,0.0005635425,0.0002695133,0.0004283299,0.003349094,0.001629139,0.09203947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03256202,"threshold_uncertainty_score":0.1089308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110762325","doi":"10.1016/j.comgeo.2014.11.001","title":"Flip distance between two triangulations of a point set is NP-complete","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":50,"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":"Polygon (computer graphics); Combinatorics; Regular polygon; Mathematics; Convex polygon; Set (abstract data type); Plane (geometry); Point (geometry); Polygon covering; Discrete mathematics; Computer science; Geometry","authors":[{"name":"Anna Lubiw","is_ca":true},{"name":"Vinayak Pathak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03363412871043522,"gpt":0.2903187787358435,"spread":0.2566846500254083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001540709,0.001077016,0.002604175,0.001223255,0.001941551,0.00263486,0.003832904,0.003683473,0.01743211],"category_scores_gemma":[0.01334421,0.001269568,0.002081617,0.002213427,0.002286226,0.006483915,0.003745404,0.003146996,0.001382009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002666442,"about_ca_system_score_gemma":0.001869929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006053128,"about_ca_topic_score_gemma":0.008098355,"domain_scores_codex":[0.9981055,0.0003586977,0.0001422952,0.0005757784,0.0005797389,0.000238029],"domain_scores_gemma":[0.9867123,0.01089202,0.0006881719,0.000608476,0.0006104246,0.0004884726],"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.001482101,0.0006853427,0.00616865,0.002219331,0.0004266756,0.0009979004,0.0008295579,0.631151,0.0058908,0.06858162,0.03274251,0.2488245],"study_design_scores_gemma":[0.0004710931,0.0003573737,0.001561122,0.0001683551,0.0001394722,0.0006026942,0.0009231898,0.7750835,0.004009473,0.2070444,0.009584288,0.00005497968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3508817,0.002384614,0.5953739,0.008418076,0.0004771867,0.001245421,0.008142972,0.002515629,0.03056046],"genre_scores_gemma":[0.681581,0.0007577014,0.2921748,0.0008202998,0.0001750776,0.000776495,0.007676748,0.0005430708,0.01549483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01743211,"threshold_uncertainty_score":0.05831629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031858761","doi":"10.1016/s0925-7721(02)00173-6","title":"Algorithms for bivariate medians and a Fermat–Torricelli problem for lines","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"McGill University","keywords":"Bivariate analysis; Combinatorics; Fermat's Last Theorem; Mathematics; Point (geometry); Median; Algorithm; Set (abstract data type); Statistics; Computer science; Geometry","authors":[{"name":"Greg Aloupis","is_ca":true},{"name":"Stefan Langerman","is_ca":true},{"name":"Michael Soss","is_ca":false},{"name":"Godfried Toussaint","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1488754176423898,"gpt":0.4326504212733606,"spread":0.2837750036309707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00312879,0.001756571,0.002251149,0.002985645,0.001815186,0.004011004,0.004022237,0.003001863,0.01222028],"category_scores_gemma":[0.01907664,0.001342727,0.002677465,0.003311936,0.002833466,0.008705469,0.004984336,0.005340423,0.002631046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001877459,"about_ca_system_score_gemma":0.001784863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002615679,"about_ca_topic_score_gemma":0.003486628,"domain_scores_codex":[0.9986537,0.0004365164,0.00009563012,0.0003645604,0.0003057789,0.000143866],"domain_scores_gemma":[0.9926791,0.004803007,0.0006548479,0.0008781578,0.0006150939,0.0003697166],"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.0002951933,0.000142188,0.001636444,0.0004145587,0.0001000263,0.00009180838,0.0005332693,0.1853601,0.001847828,0.5309744,0.01783766,0.2607666],"study_design_scores_gemma":[0.00005292118,0.00005050988,0.0002476319,0.00004836945,0.00002930632,0.00007812633,0.0001438478,0.436369,0.0009532992,0.5566611,0.005329359,0.00003654901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01054249,0.0002722939,0.9854408,0.0003747646,0.00006114167,0.00004336056,0.0001148449,0.0004490546,0.002701163],"genre_scores_gemma":[0.1085483,0.0005928616,0.8817778,0.0001801511,0.000249419,0.0002307456,0.000935132,0.0006167173,0.006868897],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01222028,"threshold_uncertainty_score":0.04088098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007853611","doi":"10.1016/j.comgeo.2006.03.003","title":"Computing homotopic shortest paths efficiently","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":48,"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":"Disjoint sets; Randomized algorithm; Mathematics; Deterministic algorithm; Combinatorics; Floyd–Warshall algorithm; Point (geometry); Plane (geometry); Running time; Shortest path problem; Algorithm; Discrete mathematics; Computer science; K shortest path routing; Geometry; Graph","authors":[{"name":"Alon Efrat","is_ca":false},{"name":"Stephen Kobourov","is_ca":false},{"name":"Anna Lubiw","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008324284205473856,"gpt":0.2260742693166069,"spread":0.217749985111133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004120437,0.0009151502,0.001372086,0.001828408,0.0009576128,0.001810755,0.001525642,0.0007406708,0.01590632],"category_scores_gemma":[0.003030335,0.0005464934,0.0007415087,0.003014886,0.0005882333,0.003632856,0.002440417,0.001181318,0.002347326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009719942,"about_ca_system_score_gemma":0.001302001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00359292,"about_ca_topic_score_gemma":0.007664877,"domain_scores_codex":[0.9993535,0.00006979225,0.00004417588,0.000186286,0.000242242,0.0001040709],"domain_scores_gemma":[0.9989881,0.0004252638,0.00006526391,0.0003192009,0.000134507,0.00006766798],"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.0007890098,0.0003036529,0.002318437,0.0004979083,0.0001418601,0.0004152216,0.0004558895,0.2853689,0.01752044,0.1046818,0.02090561,0.5666012],"study_design_scores_gemma":[0.0001079128,0.0001305046,0.0009773792,0.00003715684,0.00005627723,0.0002457819,0.0004165431,0.766458,0.01072985,0.2102156,0.01060006,0.00002485317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1734537,0.000388098,0.8025702,0.0004358157,0.0001336226,0.00020708,0.00137776,0.003746601,0.0176871],"genre_scores_gemma":[0.4353046,0.0004140315,0.5495431,0.00008912803,0.00005298135,0.00014378,0.003189372,0.0006463335,0.01061663],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01590632,"threshold_uncertainty_score":0.05321187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005968133","doi":"10.1016/s0925-7721(01)00066-9","title":"Optimizing area and aspect ratio in straight-line orthogonal tree drawings","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":47,"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":"Constant (computer programming); Line (geometry); Aspect ratio (aeronautics); Grid; Tree (set theory); Binary tree; Line drawings; Computer science; Mathematics; Combinatorics; Integer (computer science); Line segment; Binary number; Algorithm; Geometry; Engineering drawing; Arithmetic","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Michael T. Goodrich","is_ca":false},{"name":"S. Rao Kosaraju","is_ca":false},{"name":"Roberto Tamassia","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03119771041744589,"gpt":0.2709510206003549,"spread":0.239753310182909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006321492,0.0008232237,0.0009761517,0.001043115,0.0002854581,0.001102834,0.0008726997,0.00064078,0.00330421],"category_scores_gemma":[0.004171672,0.0006314387,0.0004477634,0.001411783,0.0003845557,0.001626561,0.0008178591,0.0005464835,0.0006767175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006726063,"about_ca_system_score_gemma":0.0005088392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001492579,"about_ca_topic_score_gemma":0.002906285,"domain_scores_codex":[0.9993883,0.0001918242,0.00002720657,0.00007820638,0.0002334682,0.00008090753],"domain_scores_gemma":[0.9986938,0.0008095608,0.0001474423,0.0001160026,0.0001711715,0.0000620884],"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.0003804407,0.0001790882,0.001698361,0.0001771213,0.00003399344,0.00009786776,0.0001432099,0.5842208,0.02917963,0.02454301,0.003723693,0.3556228],"study_design_scores_gemma":[0.00003257129,0.0001276859,0.0004094124,0.000006653289,0.00001476323,0.00007735535,0.00003323505,0.9820898,0.008024305,0.008027156,0.001147358,0.000009757967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1543498,0.0004552217,0.8343974,0.0001315596,0.00003024922,0.00008087193,0.0001395726,0.001285669,0.009129657],"genre_scores_gemma":[0.563124,0.0003753119,0.4323631,0.00004785975,0.00003541877,0.00009415794,0.0002060249,0.0007322042,0.003021916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00330421,"threshold_uncertainty_score":0.01105368,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144614313","doi":"10.1016/j.comgeo.2014.12.005","title":"Geometric red–blue set cover for unit squares and related problems","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":47,"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":"Cover (algebra); Set cover problem; Set (abstract data type); Mathematics; Square (algebra); Point (geometry); Combinatorics; Algorithm; Unit (ring theory); Computer science; Geometry","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Nan Hu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02210877508890676,"gpt":0.2567454458011689,"spread":0.2346366707122622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007675641,0.0009290011,0.00143699,0.00115016,0.001274828,0.001745889,0.002065263,0.001980595,0.009623294],"category_scores_gemma":[0.005239985,0.0007198341,0.0008421924,0.001543862,0.001837262,0.002365534,0.003027998,0.00243262,0.00102408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001225071,"about_ca_system_score_gemma":0.0005618854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003178304,"about_ca_topic_score_gemma":0.002205268,"domain_scores_codex":[0.9991075,0.000294027,0.00002611139,0.0001439185,0.0003172708,0.0001111727],"domain_scores_gemma":[0.9980329,0.001346453,0.0001227036,0.0002431775,0.000124264,0.0001306157],"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.0002925574,0.0001204471,0.0007947743,0.0004083578,0.00006543551,0.0002158191,0.0002839347,0.2681777,0.003232704,0.5996701,0.0244319,0.1023061],"study_design_scores_gemma":[0.00002934452,0.00004712935,0.0003487266,0.00004262308,0.0000152424,0.0001750704,0.00009932815,0.4997717,0.001321674,0.4893131,0.008815963,0.00002023501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1156918,0.002467163,0.8295687,0.00229997,0.0003900973,0.0001399108,0.0006248731,0.0005464058,0.04827117],"genre_scores_gemma":[0.6503979,0.001939596,0.2984241,0.0006710894,0.0005143478,0.0003188035,0.001468258,0.0007585397,0.04550736],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009623294,"threshold_uncertainty_score":0.03219312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144232842","doi":"10.1016/j.comgeo.2004.05.005","title":"The one-round Voronoi game replayed","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Voronoi diagram; Computer science; Computer graphics (images); Mathematics; Geometry","authors":[{"name":"Sándor P. Fekete","is_ca":false},{"name":"Henk Meijer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03454856844161137,"gpt":0.2907720741755746,"spread":0.2562235057339632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119275,0.000635521,0.0014485,0.0004809546,0.001240221,0.001603125,0.002453412,0.00217094,0.01080116],"category_scores_gemma":[0.01117947,0.0003756169,0.0007803686,0.0004699355,0.001488854,0.002567674,0.003065711,0.001467971,0.001288244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000947364,"about_ca_system_score_gemma":0.001530032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004681276,"about_ca_topic_score_gemma":0.003641685,"domain_scores_codex":[0.998327,0.0006404045,0.00007395101,0.0002888126,0.0003790408,0.0002908486],"domain_scores_gemma":[0.9965121,0.00171221,0.0001787245,0.0007915765,0.0004130356,0.0003924283],"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.004094829,0.0002257869,0.00175265,0.0003470932,0.0002339368,0.001204632,0.0009595731,0.4432998,0.01079346,0.4545053,0.01140558,0.07117741],"study_design_scores_gemma":[0.0001465663,0.0002139904,0.0002472711,0.00002590841,0.00002889013,0.0002388374,0.0002155429,0.8365908,0.002827647,0.1547335,0.004685907,0.00004523987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3206542,0.0003294584,0.620661,0.001294386,0.0005470805,0.0003159656,0.000791129,0.001127838,0.05427906],"genre_scores_gemma":[0.9259664,0.00008194881,0.05985608,0.0001233271,0.00002784046,0.000114505,0.0003263298,0.0001303498,0.01337317],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01080116,"threshold_uncertainty_score":0.03613353,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078707782","doi":"10.1016/j.comgeo.2004.02.002","title":"Expected time analysis for Delaunay point location","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Delaunay triangulation; Simple (philosophy); Tree (set theory); Point (geometry); Jump; Mathematics; Point location; Combinatorics; k-d tree; Random walk; Computer science; Algorithm; Statistics; Geometry; Tree traversal","authors":[{"name":"Luc Devroye","is_ca":true},{"name":"Christophe Lemaire","is_ca":true},{"name":"Jean-Michel Moreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01292080864408373,"gpt":0.2507494054875701,"spread":0.2378285968434864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005395015,0.001824068,0.001592,0.002575724,0.001107593,0.002784315,0.004002148,0.001278074,0.01151248],"category_scores_gemma":[0.0373389,0.0009717275,0.001469239,0.002384118,0.001994299,0.004085188,0.003527493,0.002306839,0.001118176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003756038,"about_ca_system_score_gemma":0.00268477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005187505,"about_ca_topic_score_gemma":0.004534086,"domain_scores_codex":[0.9953138,0.001221452,0.0001721037,0.0006062087,0.00184058,0.0008457309],"domain_scores_gemma":[0.9641979,0.02844241,0.001626395,0.001512999,0.003126622,0.001093618],"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.0007105108,0.00009667918,0.002607644,0.000367029,0.00008859285,0.0001867223,0.000267676,0.8371055,0.002807918,0.1070106,0.004380013,0.04437114],"study_design_scores_gemma":[0.00001105042,0.00004791308,0.0002098479,0.00001727208,0.0000267259,0.00005853433,0.00003989251,0.9772882,0.000895706,0.02078614,0.0006096463,0.000009061562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02537573,0.0006997694,0.9670358,0.0005152054,0.00007736395,0.00008511951,0.0002245453,0.000423621,0.005562855],"genre_scores_gemma":[0.7508737,0.001427984,0.2299553,0.0003771739,0.000480148,0.0004073546,0.001066684,0.001062899,0.01434868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01151248,"threshold_uncertainty_score":0.03851312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138168865","doi":"10.1016/j.comgeo.2014.08.006","title":"Weighted straight skeletons in the plane","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":46,"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":"Polygon (computer graphics); Skeleton (computer programming); Regular polygon; Combinatorics; Mathematics; Ambiguity; Convex polygon; Point (geometry); Planar; Computer science; Topology (electrical circuits); Geometry; Computer graphics (images)","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Martin Held","is_ca":false},{"name":"Stefan Huber","is_ca":false},{"name":"Dominik Kaaser","is_ca":false},{"name":"Peter Palfrader","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01044361098578388,"gpt":0.2366490555385792,"spread":0.2262054445527953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002333364,0.0005610013,0.0003246639,0.00131951,0.0007259391,0.001009894,0.0007359827,0.0005698937,0.005926264],"category_scores_gemma":[0.001139899,0.0004460041,0.0006092202,0.001246106,0.001342166,0.001901511,0.001336254,0.0007189939,0.001317064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004109022,"about_ca_system_score_gemma":0.0002482616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009477442,"about_ca_topic_score_gemma":0.001344702,"domain_scores_codex":[0.9997222,0.00003884672,0.00001763104,0.00007075285,0.0001084897,0.00004212036],"domain_scores_gemma":[0.999527,0.00011532,0.0001132376,0.0001081301,0.00009177405,0.00004463072],"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.00007333309,0.00005154675,0.00112501,0.0001296032,0.00002598978,0.0006214227,0.0004029591,0.09441821,0.02202556,0.7973378,0.001744394,0.08204422],"study_design_scores_gemma":[0.00002412199,0.0001331062,0.001373822,0.00006824564,0.00003357184,0.001064793,0.000406596,0.2539932,0.01739721,0.6872032,0.0382617,0.00004038711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1051163,0.0001648248,0.8794031,0.00006991394,0.00002623534,0.00007272784,0.0001708507,0.0003572317,0.01461889],"genre_scores_gemma":[0.5229553,0.000768055,0.4594285,0.00005480795,0.00004354848,0.0001260202,0.0006871105,0.0003947434,0.01554192],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005926264,"threshold_uncertainty_score":0.01982528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2341114440","doi":"10.1016/j.comgeo.2016.04.002","title":"Approximation algorithms for the unit disk cover problem in 2D and 3D","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Unit disk; Simple (philosophy); Set cover problem; Unit (ring theory); Plane (geometry); Set (abstract data type); Unit disk graph; Approximation algorithm; Combinatorics; Algorithm; Mathematics; Computer science; Geometry","authors":[{"name":"Ahmad Biniaz","is_ca":true},{"name":"Paul Liu","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02719346927443032,"gpt":0.2694651527910792,"spread":0.2422716835166489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001197717,0.001188339,0.001835923,0.001671216,0.0008219449,0.002114276,0.003019194,0.002297374,0.006599981],"category_scores_gemma":[0.008220984,0.000820247,0.001207344,0.002636644,0.0009888413,0.003428014,0.003123935,0.002355102,0.001272611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00168073,"about_ca_system_score_gemma":0.001203354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007162412,"about_ca_topic_score_gemma":0.008259832,"domain_scores_codex":[0.9991523,0.0002197362,0.00004923994,0.000123008,0.0003261408,0.0001296518],"domain_scores_gemma":[0.9966107,0.002332918,0.0001860511,0.0003743692,0.0003109379,0.0001849906],"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.000334052,0.0001880116,0.00116644,0.0003067812,0.00007339379,0.00009830284,0.000270804,0.7345852,0.001466004,0.07509034,0.01209259,0.1743281],"study_design_scores_gemma":[0.00001570208,0.00001116677,0.00005646319,0.000009223949,0.00000535971,0.00002137906,0.00002832322,0.9795243,0.0001998324,0.01923686,0.0008876162,0.000003903949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01923033,0.0009520209,0.9738816,0.0004136776,0.0001116233,0.00006367992,0.0001685746,0.0005956565,0.004582801],"genre_scores_gemma":[0.2730391,0.001079257,0.7169905,0.0002363365,0.0002039529,0.00029357,0.001056358,0.000621123,0.006479834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007162412,"threshold_uncertainty_score":0.02207917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005353392","doi":"10.1016/j.comgeo.2008.11.004","title":"Not being (super)thin or solid is hard: A study of grid Hamiltonicity","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Shahrekord University of Medical Sciences; Academy of Finland; National Science Foundation","keywords":"Hamiltonian path; Combinatorics; Bipartite graph; Mathematics; Planar graph; Hamiltonian (control theory); Hamiltonian path problem; Grid; Discrete mathematics; Regular polygon; Square tiling; Graph; Mathematical optimization; Geometry","authors":[{"name":"Esther M. Arkin","is_ca":false},{"name":"Sándor P. Fekete","is_ca":false},{"name":"Kamrul Islam","is_ca":true},{"name":"Henk Meijer","is_ca":true},{"name":"Joseph S. B. Mitchell","is_ca":false},{"name":"Yurai Núñez-Rodríguez","is_ca":true},{"name":"Valentin Polishchuk","is_ca":false},{"name":"David Rappaport","is_ca":true},{"name":"Henry Xiao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06011746541677555,"gpt":0.336238186652695,"spread":0.2761207212359195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005654726,0.0002638655,0.0007132302,0.0006655774,0.001707021,0.001432402,0.001522046,0.001162327,0.007391803],"category_scores_gemma":[0.007298572,0.000485989,0.0006230022,0.0009036724,0.003053055,0.00250713,0.001831881,0.001549118,0.0002542417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008768331,"about_ca_system_score_gemma":0.001063838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006638553,"about_ca_topic_score_gemma":0.006320809,"domain_scores_codex":[0.999667,0.0001072273,0.00001145522,0.00005122029,0.000065573,0.00009747045],"domain_scores_gemma":[0.9942588,0.00372144,0.0005591785,0.0005908291,0.0002888513,0.0005809476],"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.0001118702,0.00004099385,0.00168373,0.00006747048,0.00002571522,0.0002714941,0.0004902077,0.03732656,0.0006824497,0.950672,0.002941211,0.005686213],"study_design_scores_gemma":[0.00006268042,0.00003409426,0.0009407436,0.00002152943,0.00001728283,0.0001415635,0.0006245627,0.1248642,0.0003164333,0.8709207,0.002041987,0.00001416975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8567235,0.0004149652,0.09003159,0.002811094,0.0001154128,0.00006739746,0.0002124191,0.000161869,0.04946174],"genre_scores_gemma":[0.9831526,0.0002124045,0.01088335,0.0001553486,0.00003810967,0.00003740997,0.0001011925,0.00007578058,0.005343799],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007391803,"threshold_uncertainty_score":0.02472806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022093184","doi":"10.1016/j.comgeo.2009.01.007","title":"A (slightly) faster algorithm for Klee's measure problem","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":44,"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":"Measure (data warehouse); Computer science; Algorithm; Mathematics; Data mining","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01586173538029706,"gpt":0.2540035963032679,"spread":0.2381418609229708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001680872,0.001934592,0.001739759,0.002479435,0.001321528,0.003070209,0.00358697,0.002836109,0.04770912],"category_scores_gemma":[0.007235229,0.0007370924,0.002421196,0.002454961,0.001352716,0.004841452,0.004853478,0.005210616,0.01702537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001285268,"about_ca_system_score_gemma":0.002076268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003443054,"about_ca_topic_score_gemma":0.005088255,"domain_scores_codex":[0.9976729,0.0003629485,0.0001543426,0.0005657707,0.001018696,0.000225422],"domain_scores_gemma":[0.9977561,0.0006987054,0.00007283869,0.0008038956,0.0005110719,0.0001574513],"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.0004028265,0.00039439,0.0005590468,0.0005861163,0.0001948834,0.0001961939,0.0002998811,0.02347347,0.01844048,0.2214231,0.04838059,0.6856491],"study_design_scores_gemma":[0.0006735299,0.0002819417,0.001157547,0.0001265506,0.000175362,0.000727353,0.0002388317,0.3581685,0.01813455,0.4996206,0.120537,0.0001582312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00368464,0.0002744112,0.980145,0.001027447,0.0007861145,0.0001712312,0.0002290291,0.002287684,0.01139444],"genre_scores_gemma":[0.04802918,0.0001782475,0.9288619,0.0006584433,0.0003020446,0.0003660978,0.0007682039,0.001321028,0.01951487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04770912,"threshold_uncertainty_score":0.1596029,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099217816","doi":"10.1016/j.comgeo.2003.07.005","title":"On simplifying dot maps","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":44,"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":"Heuristics; Mathematics; Set (abstract data type); Combinatorics; Distribution (mathematics); Point (geometry); Approximation algorithm; Simple (philosophy); Unit (ring theory); Algorithm; Discrete mathematics; Mathematical optimization; Computer science; Geometry; Mathematical analysis","authors":[{"name":"Mark de Berg","is_ca":false},{"name":"Prosenjit Bose","is_ca":true},{"name":"Otfried Cheong","is_ca":false},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02031281627873043,"gpt":0.2606426524941045,"spread":0.2403298362153741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000704595,0.001006365,0.001191932,0.001980873,0.001575775,0.001845941,0.001042629,0.0009103353,0.01714117],"category_scores_gemma":[0.005752973,0.0006135383,0.0009931201,0.001861843,0.001794511,0.004528341,0.004739283,0.002777404,0.00447072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000809509,"about_ca_system_score_gemma":0.0004358811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002065284,"about_ca_topic_score_gemma":0.001974312,"domain_scores_codex":[0.9992525,0.0001992473,0.00003457601,0.0001421167,0.0002871797,0.0000843778],"domain_scores_gemma":[0.9985083,0.0006451182,0.0000710671,0.0004503355,0.0002326557,0.00009249683],"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.0000658565,0.00003024651,0.0002140674,0.00006555047,0.00001640294,0.00009131993,0.0003131653,0.01068856,0.001897364,0.9134173,0.008714204,0.06448587],"study_design_scores_gemma":[0.00001282535,0.0000249096,0.0001399978,0.0000201848,0.00001764314,0.0001045326,0.00006869146,0.04660035,0.00188492,0.9231081,0.0280067,0.00001120766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04387821,0.0008263972,0.8672988,0.0009028547,0.0004062641,0.00008068546,0.0002808338,0.001083783,0.0852422],"genre_scores_gemma":[0.5241206,0.002208611,0.3369683,0.0008201806,0.0005611258,0.0002369285,0.00110442,0.00291816,0.1310617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01714117,"threshold_uncertainty_score":0.05734289,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998148652","doi":"10.1016/j.comgeo.2006.08.002","title":"Graph drawings with few slopes","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; 1-planar graph; Discrete mathematics; Upper and lower bounds; Bipartite graph; Pathwidth; Bounded function; Outerplanar graph; Graph; Line graph","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"Matthew Suderman","is_ca":true},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005608382165783317,"gpt":0.2025744214310622,"spread":0.1969660392652789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002501371,0.0009294155,0.0006681188,0.001207215,0.0009801936,0.001812323,0.001052011,0.001403299,0.02763323],"category_scores_gemma":[0.003055008,0.0008937182,0.000581974,0.001234937,0.0008282477,0.002244625,0.001466257,0.002505665,0.008849568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004394513,"about_ca_system_score_gemma":0.0003907828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006194247,"about_ca_topic_score_gemma":0.001595683,"domain_scores_codex":[0.9994591,0.0001310997,0.00002279912,0.0001282186,0.0002013834,0.00005748722],"domain_scores_gemma":[0.998813,0.000313938,0.0001071225,0.0004234133,0.0002094267,0.000133027],"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.0002575258,0.0001231841,0.0009214783,0.0003435436,0.00004333373,0.0007023846,0.0004314827,0.03558248,0.02518386,0.7090645,0.03155189,0.1957943],"study_design_scores_gemma":[0.00008182496,0.0001018487,0.0008065581,0.00008317251,0.00004458578,0.0008261956,0.0002705124,0.1097395,0.01037591,0.8017564,0.0758711,0.0000423754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08506206,0.0005198298,0.8002219,0.0009940679,0.0003066257,0.0002145388,0.001146996,0.002323705,0.1092103],"genre_scores_gemma":[0.4913237,0.001020339,0.4189303,0.0004291223,0.0001595425,0.0002990698,0.002404897,0.001557334,0.08387576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02763323,"threshold_uncertainty_score":0.09244233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099361645","doi":"10.1016/j.comgeo.2008.11.003","title":"Linear reconfiguration of cube-style modular robots","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Ministerio de Economía y Competitividad; Fonds De La Recherche Scientifique - FNRS; Departament d'Universitats, Recerca i Societat de la Informació; McGill University; National Science Foundation","keywords":"Self-reconfiguring modular robot; Control reconfiguration; Robot; Modular design; Robotics; Computer science; Automation; Cube (algebra); Bounding overwatch; Algorithm; Artificial intelligence; Mobile robot; Embedded system; Engineering; Robot control; Mathematics; Combinatorics; Programming language","authors":[{"name":"Greg Aloupis","is_ca":false},{"name":"Sébastien Collette","is_ca":false},{"name":"Mirela Damian","is_ca":false},{"name":"Erik D. Demaine","is_ca":false},{"name":"Robin Flatland","is_ca":false},{"name":"Stefan Langerman","is_ca":false},{"name":"Joseph O’Rourke","is_ca":false},{"name":"Suneeta Ramaswami","is_ca":false},{"name":"Vera Sacristán","is_ca":false},{"name":"Stefanie Wuhrer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02481905386439451,"gpt":0.2268131136262867,"spread":0.2019940597618922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001266167,0.00032355,0.0002637619,0.0002803815,0.0002509567,0.0004063727,0.0004152065,0.000221897,0.002216405],"category_scores_gemma":[0.0004153678,0.0001793004,0.000299676,0.0002980369,0.000427873,0.0005314,0.0006519892,0.0002733117,0.0004474911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002449623,"about_ca_system_score_gemma":0.0001986543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000605301,"about_ca_topic_score_gemma":0.0009864127,"domain_scores_codex":[0.9999006,0.00002363029,0.000004130972,0.00002097043,0.00002986038,0.00002076525],"domain_scores_gemma":[0.9998478,0.00003249914,0.00003323261,0.00003396251,0.00002630317,0.000026203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003178892,0.00008240619,0.001408104,0.0001288755,0.00004904606,0.000463156,0.0002684207,0.6714808,0.09980378,0.0686343,0.004343394,0.1530198],"study_design_scores_gemma":[0.00004155367,0.0002409369,0.001410508,0.00001237884,0.00001721138,0.0002788363,0.0001240106,0.918058,0.02003242,0.05299684,0.006758613,0.00002865278],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5253129,0.0004156731,0.4344411,0.0003073648,0.0001155847,0.00005682185,0.0001621423,0.001018377,0.03816997],"genre_scores_gemma":[0.9450956,0.0001670691,0.04988447,0.00006014615,0.00002018274,0.00003897188,0.0001221734,0.00007199505,0.004539378],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002216405,"threshold_uncertainty_score":0.007414579,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993585122","doi":"10.1016/j.comgeo.2010.09.009","title":"Almost all Delaunay triangulations have stretch factor greater than <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>π</mml:mi><mml:mo stretchy=\"false\">/</mml:mo><mml:mn>2</mml:mn></mml:math>","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"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","funders":"","keywords":"Mathematics; Delaunay triangulation; Combinatorics; Euclidean geometry; General position; Position (finance); Regular polygon; Geometry","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Luc Devroye","is_ca":true},{"name":"Maarten Löffler","is_ca":false},{"name":"Jack Snoeyink","is_ca":false},{"name":"Vishal Verma","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02276252827696297,"gpt":0.2540179107705189,"spread":0.231255382493556,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009100452,0.000969788,0.001221728,0.001111359,0.0009335998,0.001591298,0.000971498,0.00117501,0.03156899],"category_scores_gemma":[0.007968951,0.0007178105,0.0008632458,0.0018024,0.0007689338,0.002243816,0.002489683,0.0008567566,0.01469953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000379794,"about_ca_system_score_gemma":0.0004945868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00120337,"about_ca_topic_score_gemma":0.00198771,"domain_scores_codex":[0.9984409,0.0002172521,0.0001219879,0.0002616642,0.0007627411,0.0001954971],"domain_scores_gemma":[0.9967346,0.001048958,0.0002612048,0.001149007,0.000710224,0.00009604185],"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.000367639,0.00007848476,0.004234158,0.001301442,0.0001052991,0.0004952203,0.0009253565,0.03418557,0.03307036,0.06182763,0.06215197,0.801257],"study_design_scores_gemma":[0.0001205921,0.0002318575,0.007108985,0.000514573,0.00008672785,0.003127856,0.001440904,0.1400769,0.08047251,0.1420641,0.6245839,0.00017106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03547546,0.001614559,0.8950151,0.000744014,0.0003804915,0.0002181508,0.003219959,0.007975995,0.0553563],"genre_scores_gemma":[0.3293227,0.001993648,0.6179292,0.0003540469,0.0001902862,0.0004562304,0.01062118,0.003608753,0.03552409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03156899,"threshold_uncertainty_score":0.1056088,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2382079786","doi":"10.1016/j.comgeo.2016.05.001","title":"An algorithm for the maximum weight independent set problem on outerstring graphs","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Intersection graph; Independent set; Indifference graph; Chordal graph; Split graph; Block graph; Maximal independent set; Circle graph; Discrete mathematics; Time complexity; 1-planar graph; Pathwidth; Cograph; Graph; Line graph","authors":[{"name":"Julian Keil","is_ca":true},{"name":"Joseph S. B. Mitchell","is_ca":false},{"name":"Dinabandhu Pradhan","is_ca":false},{"name":"Martin Vatshelle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02095456718722194,"gpt":0.2671733349264159,"spread":0.246218767739194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009672582,0.001592226,0.001651577,0.002063489,0.001286577,0.00188538,0.003672769,0.001778841,0.01351045],"category_scores_gemma":[0.004343982,0.0009447982,0.001631093,0.002894775,0.0008587774,0.003160076,0.004701316,0.002577421,0.003521574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189,"about_ca_system_score_gemma":0.001767318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002687728,"about_ca_topic_score_gemma":0.004715045,"domain_scores_codex":[0.9992304,0.0001652065,0.00004155872,0.00016247,0.0002701642,0.0001302424],"domain_scores_gemma":[0.998349,0.0007939039,0.00009665767,0.000344079,0.0002957346,0.0001206786],"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.0004785435,0.0004264541,0.0009051124,0.0004788492,0.0001185052,0.0001958454,0.0002968329,0.2625783,0.007420895,0.0928735,0.02248214,0.6117451],"study_design_scores_gemma":[0.0001624878,0.00009224177,0.0002510152,0.00004309043,0.0000412528,0.00008739557,0.00007306792,0.8742419,0.002966073,0.1148453,0.007174506,0.00002168999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009690318,0.0001251968,0.981311,0.0002861324,0.00008855771,0.0001655361,0.00021536,0.00135902,0.006758848],"genre_scores_gemma":[0.061032,0.0001465996,0.9304994,0.0001366881,0.00006757463,0.0003503128,0.000962369,0.0005051123,0.006299887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01351045,"threshold_uncertainty_score":0.04519689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008735761","doi":"10.1016/j.comgeo.2010.09.008","title":"Fréchet distance with speed limits","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"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":"Traverse; Tree traversal; Range (aeronautics); Generalization; Mathematics; Speedup; Point (geometry); Algorithm; Geometry; Computational geometry; Computer science; Combinatorics; Mathematical analysis; Geodesy","authors":[{"name":"Anil Maheshwari","is_ca":true},{"name":"Jörg-Rüdiger Sack","is_ca":true},{"name":"Kaveh Shahbaz","is_ca":true},{"name":"Hamid Zarrabi-Zadeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01103595368404402,"gpt":0.2384858806729487,"spread":0.2274499269889046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003003742,0.001903472,0.001529179,0.003596568,0.001619141,0.003093128,0.002673648,0.002931737,0.009667505],"category_scores_gemma":[0.02294232,0.0009499232,0.001019926,0.001991535,0.003840947,0.01021429,0.006876153,0.005407141,0.00181708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001880187,"about_ca_system_score_gemma":0.001080197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001565336,"about_ca_topic_score_gemma":0.0009450264,"domain_scores_codex":[0.9977435,0.0006002867,0.0001177117,0.0003866339,0.0008959707,0.0002558492],"domain_scores_gemma":[0.9901626,0.005525419,0.0005731547,0.001295373,0.001733825,0.0007095499],"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.00005967025,0.00002217466,0.0001736599,0.00007805033,0.00001416762,0.00004885356,0.00008687064,0.01353538,0.0008427612,0.9650183,0.002648107,0.01747186],"study_design_scores_gemma":[0.00001099708,0.00004301743,0.0001293923,0.00002666892,0.00001417708,0.0001545098,0.00002972733,0.1046871,0.001121028,0.885386,0.00837212,0.00002513392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03988159,0.003759135,0.8988008,0.003054768,0.0008562245,0.00005998871,0.0001814137,0.0005202754,0.05288571],"genre_scores_gemma":[0.7059444,0.00366787,0.1947016,0.0009980825,0.001425326,0.0003381682,0.0004143505,0.001446613,0.09106363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009667505,"threshold_uncertainty_score":0.03234106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2761681115","doi":"10.1016/j.comgeo.2011.11.008","title":"Graphs that admit right angle crossing drawings","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Graph; Geometry; Crossing number (knot theory); Graph drawing; Computer science; Materials science; Artificial intelligence; Knot (papermaking)","authors":[{"name":"Karin Arikushi","is_ca":true},{"name":"Radoslav Fulek","is_ca":false},{"name":"Balázs Keszegh","is_ca":false},{"name":"Filip Morić","is_ca":false},{"name":"Csaba D. Tóth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03701374454722391,"gpt":0.2503230123144594,"spread":0.2133092677672355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003955056,0.0009085689,0.0007425323,0.001422354,0.001207627,0.002747051,0.001104131,0.001461193,0.0148576],"category_scores_gemma":[0.003750874,0.001008496,0.0006940832,0.002086562,0.0009961032,0.003775505,0.001772585,0.002601315,0.002400303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006243509,"about_ca_system_score_gemma":0.0003353185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007553668,"about_ca_topic_score_gemma":0.001286863,"domain_scores_codex":[0.9992294,0.000116536,0.00003491498,0.0001927193,0.0002940404,0.0001324471],"domain_scores_gemma":[0.9979106,0.0008142734,0.000275585,0.0004296052,0.0003239674,0.0002460105],"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.0001565949,0.0001048602,0.001106298,0.0001927824,0.00002833476,0.0007640459,0.0005080026,0.0181756,0.008544215,0.9015184,0.01210452,0.0567963],"study_design_scores_gemma":[0.00005352943,0.00004826333,0.0008444003,0.00007706811,0.00004318971,0.001001935,0.0004035184,0.04485242,0.006273244,0.9129594,0.03341027,0.00003274536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2380854,0.0007245402,0.6216379,0.00123352,0.0003984548,0.0002739132,0.00138005,0.001879354,0.1343869],"genre_scores_gemma":[0.7490029,0.000907336,0.1966598,0.0004784175,0.0001297728,0.0001733165,0.002930663,0.0009335044,0.04878434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0148576,"threshold_uncertainty_score":0.0497036,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114400222","doi":"10.1016/j.comgeo.2006.03.006","title":"Space-efficient geometric divide-and-conquer algorithms","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"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":"Divide and conquer algorithms; Space (punctuation); Computer science; Algorithm; Theoretical computer science","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Pat Morin","is_ca":true},{"name":"Jason Morrison","is_ca":true},{"name":"Michiel Smid","is_ca":true},{"name":"Jan Vahrenhold","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01069521619191783,"gpt":0.2322228324399271,"spread":0.2215276162480093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448606,0.001724175,0.001693088,0.001626105,0.001385925,0.002006389,0.002844377,0.001659709,0.0143541],"category_scores_gemma":[0.004083869,0.0006785001,0.0009117759,0.003072881,0.001176035,0.003294794,0.002950794,0.001998625,0.003383944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001137023,"about_ca_system_score_gemma":0.001668709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003399293,"about_ca_topic_score_gemma":0.008226421,"domain_scores_codex":[0.9988674,0.0001730148,0.00005757028,0.0002155256,0.0005043482,0.0001821427],"domain_scores_gemma":[0.9984378,0.0006650134,0.00009059806,0.0004062225,0.0003247643,0.00007556754],"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.0005496498,0.0003160149,0.000635227,0.0002687331,0.00006383201,0.00007857321,0.0001875841,0.1751167,0.00866678,0.0585765,0.02719512,0.7283453],"study_design_scores_gemma":[0.000194181,0.00009119363,0.0001970754,0.0000174419,0.00003636455,0.00009324732,0.0001144091,0.9153014,0.006394485,0.06777414,0.009768704,0.00001720191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01289218,0.0007297622,0.972419,0.0005620132,0.000113401,0.0001140963,0.0001877528,0.003016743,0.009965058],"genre_scores_gemma":[0.1221636,0.0004381613,0.8672822,0.0002063307,0.0001109738,0.0002193984,0.0008385356,0.0005372311,0.008203567],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0143541,"threshold_uncertainty_score":0.04801929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061541114","doi":"10.1016/s0925-7721(03)00027-0","title":"Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"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; Carleton University","funders":"","keywords":"Combinatorics; Quadrilateral; Planar graph; Vertex (graph theory); Mathematics; Diagonal; Monochromatic color; Graph; Vertex cover; Plane (geometry); Time complexity; Algorithm; Geometry; Physics","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"David Kirkpatrick","is_ca":true},{"name":"Zaiqing Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02691526093557751,"gpt":0.2724761922961346,"spread":0.2455609313605571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001876426,0.002191363,0.001824141,0.001666357,0.001664984,0.002523982,0.003894912,0.002212022,0.012011],"category_scores_gemma":[0.00880221,0.001460581,0.001956813,0.002261864,0.00228295,0.006025604,0.004030083,0.002842546,0.001910682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00232126,"about_ca_system_score_gemma":0.002670099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005689574,"about_ca_topic_score_gemma":0.01167654,"domain_scores_codex":[0.9981301,0.0003755711,0.0001185453,0.0004288075,0.0004884353,0.0004585451],"domain_scores_gemma":[0.99471,0.003114584,0.0003230078,0.001236152,0.000394908,0.0002213877],"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.0008309725,0.0003214268,0.001171538,0.0004256734,0.00008525159,0.0001262463,0.0003041097,0.6563628,0.004817795,0.06020742,0.01516679,0.26018],"study_design_scores_gemma":[0.00007572306,0.0000546442,0.0001133484,0.00002030564,0.00003067069,0.00005272521,0.000124315,0.8959647,0.002814214,0.09885154,0.001883946,0.00001391946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04034933,0.0006011623,0.9474444,0.0005867399,0.000131546,0.0001504661,0.0002807029,0.003367746,0.007087947],"genre_scores_gemma":[0.2521197,0.0003624974,0.74002,0.0001873789,0.00008625658,0.0001815574,0.001164649,0.001015387,0.004862601],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.012011,"threshold_uncertainty_score":0.04018074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1658042064","doi":"10.1016/j.comgeo.2016.05.005","title":"Analysis of farthest point sampling for approximating geodesics in a graph","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"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; Geodesic; Vertex (graph theory); Mathematics; Distance; Shortest path problem; Path graph; Bounded function; Computation; Graph; Discrete mathematics; Graph power; Algorithm; Geometry; Line graph; Mathematical analysis","authors":[{"name":"Pegah Kamousi","is_ca":false},{"name":"Sylvain Lazard","is_ca":false},{"name":"Anil Maheshwari","is_ca":true},{"name":"Stefanie Wuhrer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03545272358260807,"gpt":0.2890276890335498,"spread":0.2535749654509417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003478961,0.001261049,0.001492124,0.002561467,0.0007452978,0.001510212,0.002311958,0.001942424,0.003064766],"category_scores_gemma":[0.02394414,0.0007997913,0.001128381,0.001539659,0.001625211,0.001956825,0.002124287,0.001655955,0.0003803986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002285183,"about_ca_system_score_gemma":0.001398921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00860944,"about_ca_topic_score_gemma":0.007370467,"domain_scores_codex":[0.9986889,0.0005118826,0.0000501972,0.0001569645,0.0004878575,0.0001041848],"domain_scores_gemma":[0.9869121,0.0104044,0.0004904612,0.0005869468,0.001106213,0.0004997829],"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.000282847,0.0001035457,0.002588453,0.0001938564,0.0000621391,0.0001154816,0.0001740942,0.8759928,0.003948049,0.08078224,0.001437381,0.03431914],"study_design_scores_gemma":[0.000003829813,0.00001250494,0.00008008463,0.000005391701,0.000003275485,0.00001252713,0.000008085692,0.9947723,0.000219231,0.004755771,0.0001241026,0.000002943221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05279711,0.0004943283,0.9439732,0.000249636,0.00004824488,0.0000746255,0.0001032276,0.0002462399,0.002013324],"genre_scores_gemma":[0.6835535,0.0007771405,0.3096632,0.0002135232,0.0001672319,0.0002073858,0.0008871813,0.0004850842,0.004045668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00860944,"threshold_uncertainty_score":0.0183987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054932997","doi":"10.1016/j.comgeo.2004.11.003","title":"Computing straight-line 3D grid drawings of graphs in linear volume","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Grid; Volume (thermodynamics); Computer science; Constant (computer programming); Line (geometry); Queue; Focus (optics); Relevance (law); Graph drawing; Line segment; Mathematics; Theoretical computer science; Geometry; Graph; Artificial intelligence","authors":[{"name":"Emilio Di Giacomo","is_ca":false},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Henk Meijer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01432391065317591,"gpt":0.2790448373949305,"spread":0.2647209267417546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003713973,0.001348066,0.001408606,0.001605915,0.0006209739,0.002329745,0.001824288,0.001223948,0.01441163],"category_scores_gemma":[0.004670087,0.001024169,0.001035556,0.002473013,0.000660388,0.00237825,0.00159083,0.001264367,0.003358208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008662546,"about_ca_system_score_gemma":0.0008216324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007641212,"about_ca_topic_score_gemma":0.01814114,"domain_scores_codex":[0.999419,0.0001246938,0.00003730006,0.0001365444,0.0001931218,0.00008944492],"domain_scores_gemma":[0.9981847,0.001000313,0.0001464364,0.0002800153,0.0002693433,0.0001190372],"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.0006867443,0.0002245888,0.004637685,0.0006492163,0.0001478925,0.0005058458,0.0005497068,0.6137915,0.01032483,0.0304533,0.02067173,0.3173571],"study_design_scores_gemma":[0.00007277176,0.00007338072,0.0005082379,0.0000233741,0.00001964812,0.00008665513,0.0001983605,0.9586337,0.003450667,0.03392926,0.002987029,0.00001696095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1759157,0.000388645,0.8033105,0.0004546521,0.0000834957,0.0002229246,0.002576246,0.007799604,0.009248062],"genre_scores_gemma":[0.4491439,0.000418344,0.5403194,0.0001166786,0.00003173176,0.0001533808,0.004319406,0.001090946,0.004406256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01441163,"threshold_uncertainty_score":0.04821169,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090529709","doi":"10.1016/s0925-7721(02)00111-6","title":"An efficient algorithm for enumeration of triangulations","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":32,"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":"Enumeration; Triangulation; Combinatorics; Position (finance); Mathematics; Tree (set theory); Plane (geometry); Point set triangulation; Algorithm; General position; Discrete mathematics; Computer science; Delaunay triangulation; Geometry","authors":[{"name":"Sergei Bespamyatnikh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02577581437185564,"gpt":0.2746994516280392,"spread":0.2489236372561835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001150317,0.00191397,0.002133207,0.003300968,0.00197646,0.002987572,0.003383542,0.001779053,0.01816083],"category_scores_gemma":[0.009587322,0.001327858,0.00194216,0.005270846,0.001237684,0.003995025,0.005215393,0.003112522,0.007897153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141486,"about_ca_system_score_gemma":0.00221369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002827166,"about_ca_topic_score_gemma":0.00493428,"domain_scores_codex":[0.9981107,0.0003721521,0.000165985,0.0002891951,0.0008086407,0.0002534167],"domain_scores_gemma":[0.9962773,0.001607113,0.0001537523,0.000906106,0.0009066834,0.0001490128],"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.0003080179,0.0001438571,0.0006088276,0.0004959637,0.00006775947,0.0001783164,0.0002938426,0.04789572,0.008375629,0.1062706,0.03154214,0.8038194],"study_design_scores_gemma":[0.0002476415,0.0001451245,0.0005235838,0.0001755381,0.00009813699,0.0005962306,0.0002566545,0.5774638,0.009743664,0.3580231,0.05264207,0.00008449585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002234161,0.0001625247,0.9919466,0.0001298004,0.00007118605,0.00009351404,0.0002136962,0.001798263,0.003350222],"genre_scores_gemma":[0.02545339,0.0002140723,0.9681415,0.00007551536,0.00003691298,0.0002472122,0.001267953,0.0005883731,0.003975162],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01816083,"threshold_uncertainty_score":0.060754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085756291","doi":"10.1016/j.comgeo.2012.03.001","title":"Absolute approximation of Tukey depth: Theory and experiments","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":32,"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":"Monte Carlo method; Generalization; Algorithm; Mathematics; Applied mathematics; Mathematical analysis; Statistics","authors":[{"name":"Dan Chen","is_ca":true},{"name":"Pat Morin","is_ca":true},{"name":"Uli Wagner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1291732036448525,"gpt":0.4355757829917782,"spread":0.3064025793469257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01685857,0.001114648,0.001484636,0.001021076,0.001260563,0.002770058,0.002626535,0.001467471,0.01096998],"category_scores_gemma":[0.1386029,0.0007538433,0.001022377,0.001541312,0.002871493,0.008688614,0.003502496,0.003302008,0.001216806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001910852,"about_ca_system_score_gemma":0.002883309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003428291,"about_ca_topic_score_gemma":0.002393254,"domain_scores_codex":[0.987651,0.007939589,0.0003525746,0.001615348,0.00198138,0.0004600435],"domain_scores_gemma":[0.85533,0.1174731,0.003790938,0.01612118,0.005319557,0.001965278],"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.03264351,0.002350159,0.01673548,0.001367044,0.0006823816,0.00007358431,0.002732583,0.1046794,0.01869867,0.2216104,0.01023595,0.5881909],"study_design_scores_gemma":[0.001411065,0.006170576,0.009126083,0.0002308343,0.0004114374,0.0003281024,0.001145394,0.7302149,0.0227061,0.2198759,0.008179719,0.0001998648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.235877,0.001464636,0.7534589,0.0004764154,0.0003835619,0.0002889435,0.0003318461,0.001069947,0.006648566],"genre_scores_gemma":[0.6580848,0.0005027517,0.336769,0.0002381701,0.0001171114,0.0002938841,0.0004925614,0.0005761208,0.002925606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01685857,"threshold_uncertainty_score":0.08915776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013115769","doi":"10.1016/j.comgeo.2007.05.006","title":"Encompassing colored planar straight line graphs","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Planar graph; Vertex (graph theory); Connected component; Colored; Mathematics; Planar; Graph; Enhanced Data Rates for GSM Evolution; Spanning tree; Matching (statistics); Computer science; Artificial intelligence; Computer graphics (images)","authors":[{"name":"Ferrán Hurtado","is_ca":false},{"name":"Mikio Kanō","is_ca":false},{"name":"David Rappaport","is_ca":true},{"name":"Csaba D. Tóth","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01876496356272188,"gpt":0.2701962851754623,"spread":0.2514313216127404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003894004,0.0009114745,0.0006277598,0.001391732,0.000773449,0.001805175,0.001867901,0.001141057,0.008480137],"category_scores_gemma":[0.002657424,0.0008182575,0.0007159089,0.001619356,0.000855707,0.002635831,0.002841089,0.001266235,0.001881769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007936523,"about_ca_system_score_gemma":0.0004321531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002147148,"about_ca_topic_score_gemma":0.002578506,"domain_scores_codex":[0.9993331,0.0001215812,0.00002769228,0.0001891203,0.0002229278,0.0001057047],"domain_scores_gemma":[0.9985164,0.0004635932,0.0001559949,0.0003563242,0.0003674059,0.0001401815],"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.0003365519,0.000163601,0.002535457,0.0002942526,0.00007111722,0.0009827762,0.0007215811,0.2726651,0.03937436,0.5219389,0.0077672,0.1531491],"study_design_scores_gemma":[0.00004086007,0.0001204112,0.0008961168,0.00006364557,0.0000509147,0.0005267587,0.0003847078,0.5954083,0.02125302,0.3600934,0.02112532,0.00003658122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09001806,0.0001246646,0.8895184,0.000135985,0.00005260379,0.00009823765,0.0002910813,0.001047273,0.01871361],"genre_scores_gemma":[0.6031765,0.0002813069,0.3693677,0.0001697515,0.00003101057,0.0001419753,0.001232369,0.0007050973,0.02489413],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008480137,"threshold_uncertainty_score":0.02836889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2757769355","doi":"10.1016/j.comgeo.2015.07.003","title":"Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"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":"Delaunay triangulation; Mathematics; Combinatorics; Equilateral triangle; Dual graph; Boundary (topology); Discrete mathematics; Graph; Geometry; Line graph; Mathematical analysis","authors":[{"name":"Ahmad Biniaz","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03251423969451171,"gpt":0.2544543962164035,"spread":0.2219401565218918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006033013,0.0004533665,0.0006338179,0.00171673,0.001151048,0.002446491,0.001783073,0.00123683,0.01016039],"category_scores_gemma":[0.008183369,0.0005180207,0.0006449976,0.001670588,0.001661962,0.003569147,0.001616451,0.00195746,0.001099271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001245755,"about_ca_system_score_gemma":0.0005622161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002277202,"about_ca_topic_score_gemma":0.003522971,"domain_scores_codex":[0.9993758,0.00009702292,0.00002789957,0.000136933,0.0002811738,0.00008133099],"domain_scores_gemma":[0.9936734,0.003331321,0.0007107249,0.0008575338,0.0009685692,0.0004584319],"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.00005988452,0.00007011688,0.001167236,0.0001081074,0.00001298968,0.0001185183,0.0003981095,0.03913325,0.00220614,0.9246536,0.00336512,0.02870693],"study_design_scores_gemma":[0.00001388188,0.00003190858,0.0005149916,0.00002071278,0.00001198991,0.0002608599,0.0001998822,0.1745869,0.001513451,0.8171629,0.005665603,0.00001682706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1503524,0.0004562901,0.812034,0.0009485452,0.0001140128,0.0000917828,0.0004077662,0.0004121033,0.03518302],"genre_scores_gemma":[0.790356,0.00100172,0.1868602,0.0004893012,0.0002027821,0.0001417793,0.0008843592,0.0004423258,0.01962156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01016039,"threshold_uncertainty_score":0.03398991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038474686","doi":"10.1016/j.comgeo.2008.06.006","title":"The projection median of a set of points","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"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 Manitoba","funders":"","keywords":"Multiset; Mathematics; Projection (relational algebra); Euclidean geometry; Combinatorics; Euclidean distance; Point (geometry); Position (finance); Set (abstract data type); Euclidean distance matrix; Stability (learning theory); Degree (music); Euclidean space; Geometry; Algorithm; Computer science; Physics","authors":[{"name":"Stéphane Durocher","is_ca":true},{"name":"David Kirkpatrick","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02799781736876987,"gpt":0.2614873178029804,"spread":0.2334895004342105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00145665,0.0007938902,0.001726475,0.002267705,0.00078535,0.002802175,0.001086515,0.001564423,0.005546497],"category_scores_gemma":[0.007372662,0.0005483075,0.001197641,0.002049041,0.001345998,0.002712988,0.002880687,0.001698186,0.00199907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006173992,"about_ca_system_score_gemma":0.001338453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009116477,"about_ca_topic_score_gemma":0.0008531506,"domain_scores_codex":[0.998171,0.0002793865,0.00009735364,0.0004951198,0.0008405236,0.0001166449],"domain_scores_gemma":[0.9981964,0.0005373589,0.0001594386,0.0003162987,0.0006179589,0.0001725538],"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.001129593,0.0001969372,0.005845343,0.0005416685,0.0002833392,0.0003897171,0.000486405,0.1607061,0.05023095,0.1110029,0.009439981,0.6597471],"study_design_scores_gemma":[0.00009522163,0.0008404518,0.004158001,0.0001878407,0.00009380599,0.0008409505,0.0004442573,0.778788,0.03545653,0.1519776,0.02700773,0.0001096001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02933404,0.0003013567,0.9655991,0.0002586998,0.0001295465,0.00009196137,0.0003777807,0.0007595458,0.003148038],"genre_scores_gemma":[0.305233,0.0008231144,0.6826633,0.0001779416,0.0002241684,0.0004809174,0.002105579,0.0003882439,0.007903763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005546497,"threshold_uncertainty_score":0.01855493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083269131","doi":"10.1016/j.comgeo.2011.04.002","title":"Reconstructing orthogonal polyhedra from putative vertex sets","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"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":"Polyhedron; Vertex (graph theory); Combinatorics; Regular polygon; Set (abstract data type); Convex polytope; Dual polyhedron; Mathematics; Focus (optics); Convex set; Computer science; Geometry; Convex optimization; Physics; Graph","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Burkay Genç","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04177866569141622,"gpt":0.2480936186266364,"spread":0.2063149529352202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008760814,0.001048684,0.001486043,0.002146856,0.0007516955,0.002200709,0.002168246,0.002194852,0.003175305],"category_scores_gemma":[0.00680846,0.001602838,0.001258832,0.001894882,0.001432686,0.001683492,0.002612832,0.002546135,0.001357734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005814224,"about_ca_system_score_gemma":0.001415689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00247807,"about_ca_topic_score_gemma":0.004265165,"domain_scores_codex":[0.9991432,0.0001541606,0.00004311607,0.0001550109,0.0004193096,0.00008513965],"domain_scores_gemma":[0.9978028,0.0009481615,0.0001991682,0.0005051337,0.0004263652,0.0001184754],"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.0006044883,0.0002148513,0.004426592,0.0005056052,0.0000958078,0.0005802788,0.0004724477,0.581605,0.03236167,0.1039711,0.005467934,0.2696941],"study_design_scores_gemma":[0.00002176399,0.00002917759,0.0002130601,0.00002575331,0.000009981638,0.0001047596,0.00009832338,0.9697433,0.003575186,0.02500445,0.001158745,0.0000154616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04204892,0.00009682035,0.9548972,0.0001082894,0.00004311132,0.00009457363,0.0003143034,0.0006626624,0.001734048],"genre_scores_gemma":[0.3183644,0.000206737,0.6783488,0.00006183849,0.00002628396,0.0001414266,0.001074987,0.0003571459,0.001418309],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003175305,"threshold_uncertainty_score":0.0106225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097923493","doi":"10.1016/s0925-7721(02)00126-8","title":"Tight degree bounds for pseudo-triangulations of points","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"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":"Degree (music); Triangulation; Combinatorics; Point set triangulation; Vertex (graph theory); Mathematics; Pitteway triangulation; General position; Face (sociological concept); Position (finance); Set (abstract data type); Point (geometry); Minimum-weight triangulation; Delaunay triangulation; Computer science; Geometry; Bowyer–Watson algorithm; Physics; Graph","authors":[{"name":"Lutz Kettner","is_ca":false},{"name":"David Kirkpatrick","is_ca":true},{"name":"Andrea Mantler","is_ca":false},{"name":"Jack Snoeyink","is_ca":false},{"name":"Bettina Speckmann","is_ca":false},{"name":"Fumihiko Takeuchi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0390161392047745,"gpt":0.2814012461207045,"spread":0.24238510691593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004463125,0.002345674,0.002149212,0.003228277,0.00212488,0.005623329,0.005527917,0.002630316,0.01171009],"category_scores_gemma":[0.0421221,0.001873538,0.00169368,0.003210475,0.004484251,0.01255849,0.0138461,0.00578827,0.002745154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002074786,"about_ca_system_score_gemma":0.001147528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001920369,"about_ca_topic_score_gemma":0.004026892,"domain_scores_codex":[0.9923844,0.001839771,0.0004338787,0.001034078,0.003096785,0.001210942],"domain_scores_gemma":[0.9674758,0.019093,0.001692371,0.006975294,0.003090319,0.001673173],"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.001608755,0.0001905952,0.003510619,0.0007797005,0.0001105664,0.0002490345,0.001123296,0.2919911,0.009597778,0.5828341,0.009278641,0.09872579],"study_design_scores_gemma":[0.00007507679,0.0001548351,0.0007584288,0.0001189616,0.00005389158,0.0002116527,0.0002759031,0.4279647,0.006865452,0.5571174,0.006353226,0.00005050079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07025102,0.001598825,0.907425,0.001127765,0.000217466,0.0001282666,0.0005847068,0.0007890908,0.01787786],"genre_scores_gemma":[0.7186635,0.002104276,0.2613108,0.0006384671,0.000357505,0.0003158857,0.001588767,0.001456005,0.01356475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01171009,"threshold_uncertainty_score":0.03917414,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012691739","doi":"10.1016/j.comgeo.2014.02.004","title":"A note on the unsolvability of the weighted region shortest path problem","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"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":"Mathematics; Shortest path problem; Combinatorics; Subdivision; Euclidean shortest path; Euclidean geometry; Integer (computer science); Path (computing); Algebraic number; Rational number; Computation; Discrete mathematics; K shortest path routing; Algorithm; Computer science; Geometry; Mathematical analysis","authors":[{"name":"Jean-Lou De Carufel","is_ca":true},{"name":"Carsten Grimm","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Megan Owen","is_ca":false},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01533708331655553,"gpt":0.2321104643680753,"spread":0.2167733810515197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006926089,0.001847743,0.002571652,0.002114258,0.002776198,0.003915034,0.006257327,0.003337197,0.0132768],"category_scores_gemma":[0.05847879,0.001390761,0.003865128,0.003743115,0.007807569,0.01476178,0.008329757,0.01721479,0.002025852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001661475,"about_ca_system_score_gemma":0.001969945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004211877,"about_ca_topic_score_gemma":0.002228139,"domain_scores_codex":[0.9943125,0.002271631,0.0003242541,0.001284016,0.001432527,0.0003749498],"domain_scores_gemma":[0.9504348,0.04235332,0.0009713034,0.003626256,0.001914859,0.0006994138],"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.0003402289,0.0001010583,0.000537367,0.0007623757,0.0001100045,0.0004055953,0.0004944986,0.09888848,0.002384908,0.8098644,0.02103616,0.06507491],"study_design_scores_gemma":[0.00003881017,0.00005069979,0.0001321205,0.00009977086,0.00003355743,0.0001015991,0.00006130534,0.1168308,0.0008806934,0.8684462,0.01328362,0.00004090759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0147928,0.003956808,0.9348606,0.00878236,0.001735434,0.0001149552,0.0004574166,0.0003309987,0.03496858],"genre_scores_gemma":[0.3108331,0.015528,0.6226791,0.004164635,0.005808912,0.0008580853,0.001653094,0.002031235,0.03644394],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0132768,"threshold_uncertainty_score":0.04441535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053814689","doi":"10.1016/s0925-7721(01)00036-0","title":"Polygons cuttable by a circular saw","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"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":"Circular saw; Polygon (computer graphics); Regular polygon; Mathematics; Geometry; Rest (music); Projection (relational algebra); Combinatorics; Computer science; Algorithm; Physics; Acoustics; Telecommunications","authors":[{"name":"Erik D. Demaine","is_ca":true},{"name":"Martin L. Demaine","is_ca":true},{"name":"Craig S. Kaplan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01129061046856932,"gpt":0.2387709060715044,"spread":0.2274802956029351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002091896,0.0004569503,0.0006886806,0.0006284731,0.0007331134,0.001190435,0.0008341852,0.0008171051,0.008020442],"category_scores_gemma":[0.0008659522,0.0006753712,0.0007251803,0.0007184463,0.0009202544,0.0008872612,0.001780721,0.0008648711,0.001102877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003451068,"about_ca_system_score_gemma":0.0003890123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009253417,"about_ca_topic_score_gemma":0.0008841753,"domain_scores_codex":[0.9997,0.00003225265,0.00001693693,0.00007532992,0.0001127419,0.00006289353],"domain_scores_gemma":[0.9995335,0.0001936735,0.00004424671,0.0001329194,0.00004216506,0.00005353429],"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.002094486,0.0002742938,0.002452465,0.0004439793,0.0001225393,0.003790501,0.0009597547,0.2984805,0.1700641,0.2922069,0.008589693,0.2205208],"study_design_scores_gemma":[0.00025655,0.0006287367,0.00164001,0.00008358822,0.00008211012,0.001430433,0.0006009838,0.776203,0.05706353,0.1267752,0.0351653,0.00007035243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2517566,0.0001885628,0.7017416,0.0002012452,0.0002101917,0.0001412565,0.0003508624,0.0008728098,0.04453688],"genre_scores_gemma":[0.6977044,0.0002808358,0.284299,0.00006249714,0.00004712685,0.00009467977,0.000577699,0.0003007491,0.01663295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008020442,"threshold_uncertainty_score":0.02683103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116417064","doi":"10.1016/j.comgeo.2007.01.003","title":"Computational geometric aspects of rhythm, melody, and voice-leading","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Rhythm; Music theory; Computer science; Musicology; Field (mathematics); Perception; Computer music; Computational model; Music perception; Mathematics; Algorithm; Psychology; Musical; Visual arts; Pure mathematics; Aesthetics; Art","authors":[{"name":"Godfried Toussaint","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01525589801349942,"gpt":0.2559532247066676,"spread":0.2406973266931682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003932137,0.0004024927,0.0004789486,0.000987943,0.0009808391,0.002417306,0.0009932918,0.0005472205,0.01004344],"category_scores_gemma":[0.003699645,0.0003167816,0.0006753795,0.0008119522,0.002953394,0.002896737,0.001636296,0.0009796092,0.000541622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005685108,"about_ca_system_score_gemma":0.0004573238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002389405,"about_ca_topic_score_gemma":0.00304077,"domain_scores_codex":[0.9997209,0.0001028997,0.00001043173,0.00005574747,0.00006055637,0.00004938844],"domain_scores_gemma":[0.9989673,0.000578291,0.0001239132,0.0001166771,0.0001141313,0.00009966566],"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.00006402562,0.00001177018,0.001073984,0.00003074193,0.00001055332,0.00005324388,0.0003665182,0.01891395,0.0007334041,0.9659058,0.0006918474,0.01214426],"study_design_scores_gemma":[0.000009106556,0.00002254443,0.0006846538,0.000009827248,0.000009007701,0.00005542986,0.0003264438,0.05697164,0.0003975125,0.9388176,0.002686394,0.000009972223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5008013,0.001388344,0.4054202,0.001584567,0.0001403267,0.00003176814,0.0002938402,0.0002124741,0.09012708],"genre_scores_gemma":[0.9745106,0.0003319469,0.0193406,0.0000413883,0.0001038993,0.00001348659,0.0001674898,0.00005094165,0.005439695],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01004344,"threshold_uncertainty_score":0.03359866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976756638","doi":"10.1016/j.comgeo.2006.05.005","title":"On the stabbing number of a random Delaunay triangulation","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":27,"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","funders":"","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Bowyer–Watson algorithm; Point set triangulation; Computer science; Triangulation; Combinatorics; Mathematics; Geometry","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Luc Devroye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01239512327578408,"gpt":0.2490602957111751,"spread":0.236665172435391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00536351,0.0008120721,0.001740715,0.003413358,0.002288962,0.002642392,0.002640244,0.002598249,0.008973887],"category_scores_gemma":[0.05394539,0.001076428,0.0008200677,0.002138604,0.004353362,0.005033689,0.003386776,0.003051678,0.001184445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002129597,"about_ca_system_score_gemma":0.00150699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003165415,"about_ca_topic_score_gemma":0.002824781,"domain_scores_codex":[0.9969099,0.001304822,0.0001391375,0.0003926732,0.0009493063,0.0003041504],"domain_scores_gemma":[0.963805,0.02762535,0.001783974,0.002457523,0.002321182,0.002006977],"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.0006472009,0.00008078943,0.002078371,0.0002101304,0.00003726515,0.0001082998,0.0003244629,0.261442,0.003963973,0.6796364,0.006197381,0.04527375],"study_design_scores_gemma":[0.00004541713,0.00008898349,0.0004726394,0.00006316365,0.00001860193,0.00007585683,0.00008352404,0.773378,0.001236527,0.2221782,0.002325199,0.00003388466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2060735,0.002019268,0.7450256,0.002547263,0.0005814586,0.0002236901,0.0003335786,0.0008093382,0.0423863],"genre_scores_gemma":[0.7859122,0.001121094,0.1966991,0.0004700794,0.0002621904,0.0004078788,0.0004714159,0.0006321011,0.01402395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008973887,"threshold_uncertainty_score":0.03002065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}