{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002183801,0.0001190157,0.0001421536,0.0004092315,0.00008513018,0.0001717898,0.0006404943,0.00003081738,0.00007584593],"category_scores_gemma":[0.0000432064,0.0001214339,0.00004544437,0.0009000767,0.00002952453,0.0005299794,0.0004102468,0.0001180692,0.0003292527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003409707,"about_ca_system_score_gemma":0.000008454937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001505558,"about_ca_topic_score_gemma":0.000005472115,"domain_scores_codex":[0.9987751,0.00004161935,0.0002504945,0.0003462973,0.0003191667,0.0002673184],"domain_scores_gemma":[0.99932,0.0002462297,0.00006861821,0.0002457312,0.00004731237,0.00007208247],"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.000003897768,0.0008228574,0.01497465,0.00002670604,0.0001110886,0.0002819338,0.00118367,0.3001992,0.000058649,0.2780895,0.05567625,0.3485716],"study_design_scores_gemma":[0.0004547244,0.00002395047,0.04074008,0.00001620316,0.000002570825,0.000007598008,0.00002037995,0.9464344,0.000004625564,0.006095005,0.006039745,0.0001607266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06715496,0.0005112275,0.9234913,0.002107088,0.0005319049,0.0001758325,0.000008289673,0.0002456546,0.005773721],"genre_scores_gemma":[0.9149833,0.000009772241,0.08348027,0.0009890697,0.00006904097,0.000002462988,0.00003085957,0.000006405765,0.0004287857],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8478284,"threshold_uncertainty_score":0.4951931,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1535557537","doi":"10.1016/s0925-7721(00)00015-8","title":"Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":267,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Approximation algorithm; Simple (philosophy); Algorithm; Position (finance); Point (geometry); Path (computing); Shortest path problem; Mathematics; Grid; Lawn; Plane (geometry); Computer science; Combinatorics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01073107369151876,"gpt":0.2229154518957093,"spread":0.2121843782041906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008006129,0.0002091155,0.000236247,0.0001732799,0.0004278869,0.0001559773,0.000416215,0.00007649889,0.00005374561],"category_scores_gemma":[0.00005047496,0.0001572309,0.00005198323,0.0007408163,0.0001116529,0.0003906974,0.0001070765,0.0001694689,0.000003605368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000823138,"about_ca_system_score_gemma":0.0003262298,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01994209,"about_ca_topic_score_gemma":0.00531924,"domain_scores_codex":[0.9980267,0.0001369033,0.0004650413,0.0004548299,0.0006227595,0.0002937627],"domain_scores_gemma":[0.9985436,0.0007777294,0.0001504215,0.0002155606,0.0002335549,0.0000791245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002673906,0.0004571906,0.00198703,0.0006644446,0.0002134217,0.00002843747,0.008232858,0.6569878,0.0004121258,0.02830811,0.0271227,0.2753185],"study_design_scores_gemma":[0.001310912,0.0002582126,0.01527988,0.00009740097,0.00003228318,0.00007616312,0.0002373317,0.9587266,0.000174713,0.009070592,0.01442337,0.0003125644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7447552,0.002963393,0.242508,0.006138516,0.0004641109,0.002379939,0.0001218201,0.00006388448,0.0006051099],"genre_scores_gemma":[0.9613938,0.00005079719,0.03669863,0.001056548,0.0001046367,0.00007570223,0.0002732448,0.00001478945,0.0003318897],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3017388,"threshold_uncertainty_score":0.9865842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049284557","doi":"10.1016/s0925-7721(01)00069-4","title":"On embedding an outer-planar graph in a point set","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Embedding; Mathematics; Time complexity; Planar graph; Disjoint sets; Vertex (graph theory); Line segment; Regular polygon; General position; Graph; Discrete mathematics; Algorithm; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0317632476759565,"gpt":0.2793271361155888,"spread":0.2475638884396323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003940936,0.0002108221,0.0002010704,0.001242567,0.0001690039,0.0002137022,0.0005560276,0.0000798598,0.0001573392],"category_scores_gemma":[0.00009264563,0.0002249522,0.00008075256,0.001942072,0.00003150174,0.0008214343,0.0000782042,0.0002212736,0.0003085804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009090303,"about_ca_system_score_gemma":0.00003432786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009315338,"about_ca_topic_score_gemma":0.000005757589,"domain_scores_codex":[0.9979531,0.0001289804,0.0003940048,0.0005994712,0.0005975986,0.0003269018],"domain_scores_gemma":[0.998843,0.0004221232,0.0001102676,0.0003314949,0.0001300624,0.0001631043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009249118,0.0003068015,0.00041782,0.00001133571,0.00001604229,0.00006928652,0.0006517469,0.8290046,0.00003846808,0.1379289,0.003228442,0.0283173],"study_design_scores_gemma":[0.0006092576,0.0002085904,0.009273011,0.00002526112,0.000002497333,0.00006446323,0.00002808211,0.8827949,0.00004492256,0.1060928,0.0005760191,0.0002801978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2626858,0.0001503034,0.7342976,0.0008641746,0.0004501132,0.0001599295,0.00001275162,0.0001590267,0.001220278],"genre_scores_gemma":[0.9347706,0.000006470198,0.06330179,0.001502135,0.0001235585,0.00001710085,0.0001019208,0.00001256277,0.000163852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6720848,"threshold_uncertainty_score":0.9173286,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004091449,0.0001527792,0.0002336428,0.0003221883,0.0004593419,0.0002518276,0.0006575559,0.00007114044,0.00003502986],"category_scores_gemma":[0.0001798673,0.0001041673,0.00007855899,0.001912034,0.0001298861,0.0003829341,0.0002719107,0.0001635506,0.00001640338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002998267,"about_ca_system_score_gemma":0.00003360776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003702351,"about_ca_topic_score_gemma":0.000002103564,"domain_scores_codex":[0.9985864,0.00008757342,0.0002757447,0.0004199801,0.0003163914,0.0003139478],"domain_scores_gemma":[0.998753,0.0006389385,0.0001162801,0.0002869866,0.00009760765,0.0001071755],"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.00002098023,0.0003027459,0.02994794,0.0000207305,0.0001820633,0.00005584378,0.0004340388,0.1908162,0.0004194607,0.4196048,0.001040637,0.3571546],"study_design_scores_gemma":[0.0005773177,0.0001885874,0.2016113,0.00001691169,0.00004946336,0.0001419394,0.0001828487,0.6560779,0.0001174251,0.1384594,0.002181544,0.0003953286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2320369,0.0009498853,0.7635102,0.002817716,0.00009867886,0.00006643628,0.000006600819,0.00007891712,0.0004346211],"genre_scores_gemma":[0.9463594,0.00001710552,0.0519003,0.001541237,0.00006909813,0.000001415338,0.00001202221,0.000003365249,0.00009606854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7143225,"threshold_uncertainty_score":0.4247817,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001175282,0.0001595267,0.0001877962,0.0002067524,0.00006169076,0.00005826232,0.00007654528,0.00006808063,0.0001189377],"category_scores_gemma":[0.00003116509,0.0001785224,0.00002908163,0.0003508011,0.00001952888,0.0002142043,0.00002366264,0.0001154924,0.00003857126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005550035,"about_ca_system_score_gemma":0.00003003752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001119777,"about_ca_topic_score_gemma":0.000003235991,"domain_scores_codex":[0.9990085,0.0000143577,0.000332621,0.0002217357,0.0001826258,0.0002402078],"domain_scores_gemma":[0.9995679,0.0002018467,0.00003188683,0.00007291888,0.00002559859,0.00009991183],"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.00002237344,0.000007673254,0.0001061612,0.00003139236,0.0000148338,0.000009440223,0.0001592779,0.9664261,0.0007798261,0.001834596,0.0004822808,0.03012608],"study_design_scores_gemma":[0.002655808,0.00006186673,0.02418659,0.0001938507,0.00001355999,0.00005415289,0.0001006592,0.8782087,0.0009510346,0.08871499,0.004257911,0.0006008869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9187363,0.0006936545,0.07908503,0.0002036037,0.0002838824,0.0001242057,0.0000419972,0.0002049134,0.0006263975],"genre_scores_gemma":[0.9639146,0.00006880985,0.03540309,0.00012552,0.0001836837,0.000003697125,0.0001235612,0.00002801452,0.0001490033],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08821737,"threshold_uncertainty_score":0.7279932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2218835040","doi":"10.1016/j.comgeo.2005.10.002","title":"Faster core-set constructions and data-stream algorithms in fixed dimensions","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Dimension (graph theory); Cylinder; RADIUS; Constant (computer programming); Annulus (botany); Set (abstract data type); Core (optical fiber); Algorithm; Fixed point; Space (punctuation); Geometry; Combinatorics; Discrete mathematics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05293009317713095,"gpt":0.3119878267126572,"spread":0.2590577335355262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003528403,0.0001782187,0.0001939047,0.0006185721,0.0002047213,0.0001648915,0.0005488716,0.00007425792,0.0000524754],"category_scores_gemma":[0.000104484,0.0001875357,0.00003318575,0.001262482,0.00009678354,0.0009780825,0.0005814008,0.0001865654,0.00008744856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005656618,"about_ca_system_score_gemma":0.0001473215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001382113,"about_ca_topic_score_gemma":0.00002314172,"domain_scores_codex":[0.9982368,0.00005783042,0.0004041823,0.0006526543,0.000390889,0.0002575879],"domain_scores_gemma":[0.998675,0.000456589,0.0001039854,0.0004651807,0.0001574652,0.0001417567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001463252,0.0003173271,0.009051899,0.00002288484,0.00007062944,0.00002533944,0.0005556559,0.5106943,0.0001921663,0.09941574,0.007546513,0.3720929],"study_design_scores_gemma":[0.0007161441,0.00003735191,0.03921047,0.00001764337,0.00000794101,0.0001668411,0.00004478721,0.9398227,0.00004100757,0.01035088,0.009338612,0.000245649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2452228,0.0005745543,0.7510892,0.00174399,0.0004617609,0.0002139289,0.0001167685,0.0001229545,0.0004540806],"genre_scores_gemma":[0.6993304,0.00001896953,0.29926,0.0005812285,0.0001821773,0.0000101075,0.0004598638,0.000007923828,0.0001494122],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4541076,"threshold_uncertainty_score":0.7647483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002939479,0.00008342158,0.00009294858,0.0002147572,0.00007509191,0.00003727676,0.00004497236,0.00003753255,0.00004992202],"category_scores_gemma":[0.00001011176,0.00008080173,0.00003776587,0.0004434531,0.00002469192,0.00009826001,0.000007452546,0.00005118479,0.00001716112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002633462,"about_ca_system_score_gemma":0.00001022765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006208399,"about_ca_topic_score_gemma":0.000003639032,"domain_scores_codex":[0.9995278,0.000004371132,0.0001449112,0.0001067914,0.0001233797,0.00009278332],"domain_scores_gemma":[0.9997906,0.00004184291,0.00002025752,0.00005098788,0.00004502435,0.00005128968],"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.000001623702,0.000004286586,0.001123367,0.000008600807,0.00003651688,0.000001577557,0.00004731343,0.9827936,0.00007751291,0.01436754,0.0001377605,0.001400263],"study_design_scores_gemma":[0.000846625,0.00002712541,0.3290935,0.00001901148,0.00004906376,0.00004966636,0.00005057652,0.4488224,0.0000994719,0.2204926,0.000149211,0.0003007702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9140737,0.0003020968,0.08457652,0.0001384204,0.0001051235,0.00005501263,0.0000180362,0.0001405715,0.0005905121],"genre_scores_gemma":[0.9589441,0.00001682017,0.04079332,0.00004506902,0.00003497543,0.000002457502,0.0001315887,0.000009393765,0.00002231986],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5339713,"threshold_uncertainty_score":0.3294999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089645963","doi":"10.1016/j.comgeo.2008.04.001","title":"Flips in planar graphs","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Planar graph; Book embedding; Embedding; Combinatorics; Planar straight-line graph; 1-planar graph; Pathwidth; Outerplanar graph; Perspective (graphical); Computer science; Line graph; Mathematics; Graph; Discrete mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02379017878520906,"gpt":0.240610032298463,"spread":0.216819853513254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002569694,0.0001535865,0.0001726394,0.0009414827,0.0001991911,0.00005380092,0.000494225,0.00006586757,0.00003408162],"category_scores_gemma":[0.00007227118,0.0001668504,0.0000759717,0.002430052,0.00005545657,0.0005266971,0.00009072852,0.0001669299,0.0001936407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005993452,"about_ca_system_score_gemma":0.000174498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001281826,"about_ca_topic_score_gemma":0.000004008792,"domain_scores_codex":[0.9983729,0.00006868546,0.0003467623,0.0004236303,0.0005207077,0.0002673672],"domain_scores_gemma":[0.9991383,0.0002977097,0.00008199902,0.0002286066,0.0001451428,0.0001082219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001600798,0.0002942792,0.01725026,0.0000173331,0.00002845586,0.000194673,0.0005670196,0.4791096,0.000145534,0.4793279,0.005625219,0.01742375],"study_design_scores_gemma":[0.001035055,0.00009307599,0.4498663,0.00001822314,0.000002637072,0.0004009601,0.00001637897,0.3873247,0.0001769618,0.155838,0.004800023,0.0004276682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3384956,0.0003296349,0.6578926,0.0005653022,0.0004122763,0.0001219403,0.000004499288,0.0001365044,0.002041597],"genre_scores_gemma":[0.9026082,0.00001896694,0.09627854,0.0006772454,0.00008022547,0.00001386154,0.00006699926,0.000007717325,0.0002482179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5641127,"threshold_uncertainty_score":0.6803961,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002240979,0.00007222439,0.0001083682,0.0001022143,0.0001398752,0.0001490404,0.0003742343,0.00001518797,0.00001096382],"category_scores_gemma":[0.00002150118,0.00005333398,0.00003810597,0.0003843162,0.00009836787,0.0004195885,0.0002266164,0.00004041208,0.000006065902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008239372,"about_ca_system_score_gemma":0.000005163811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002250795,"about_ca_topic_score_gemma":0.000001208733,"domain_scores_codex":[0.9993129,0.00001959818,0.0001916952,0.0001736905,0.0001867558,0.0001153967],"domain_scores_gemma":[0.999392,0.0002556007,0.00009318488,0.0001627989,0.00007106513,0.00002531254],"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.00001143167,0.00008566021,0.0002952054,0.0002874528,0.00007685941,9.637745e-7,0.000874025,0.03023381,0.000005990593,0.7811024,0.005988257,0.1810379],"study_design_scores_gemma":[0.0007646283,0.00001312432,0.001104758,0.00001491789,0.000006064617,0.000003507247,0.00003164266,0.9682326,0.000005106459,0.02600032,0.003750272,0.00007310922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001130787,0.0002846087,0.995032,0.001336304,0.00009521665,0.0003027701,0.00003281012,0.00003550233,0.001749998],"genre_scores_gemma":[0.519449,0.00002255314,0.4789459,0.0002419684,0.00006493003,0.0000700042,0.00005956727,0.000007748262,0.001138317],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9379987,"threshold_uncertainty_score":0.2174897,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006095056","doi":"10.1016/j.comgeo.2013.04.002","title":"On plane geometric spanners: A survey and open problems","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Spanner; Enhanced Data Rates for GSM Evolution; Graph; Mathematics; Plane (geometry); Path (computing); Discrete mathematics; Computer science; Geometry; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03540804549230224,"gpt":0.2662650854645597,"spread":0.2308570399722574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007609783,0.0002326584,0.0002645939,0.001006598,0.0002715999,0.001142357,0.001044322,0.0000833847,0.0001734191],"category_scores_gemma":[0.0003752983,0.0002222036,0.00004180737,0.002947249,0.00005346983,0.001189178,0.0006797103,0.0001851603,0.0005829494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005611323,"about_ca_system_score_gemma":0.0001269257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000225384,"about_ca_topic_score_gemma":0.00000981319,"domain_scores_codex":[0.9978756,0.0001686654,0.0003748988,0.0006770325,0.0005757142,0.0003281058],"domain_scores_gemma":[0.9974014,0.00148598,0.000159335,0.0003252591,0.0004017384,0.000226309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00003774224,0.0006988095,0.01654714,0.00007678517,0.0001649288,0.00001433409,0.0002691579,0.5677757,0.0001000167,0.1658781,0.05513448,0.1933028],"study_design_scores_gemma":[0.00105443,0.0003751086,0.6445335,0.00002997811,0.000003685662,0.00005723823,0.00001146657,0.247763,0.0000529086,0.1042723,0.001371361,0.0004750603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.293777,0.0003348247,0.7016726,0.0009998312,0.0004112179,0.0007857981,0.0000270426,0.0001340165,0.001857622],"genre_scores_gemma":[0.9551761,0.0000124275,0.04237799,0.001307856,0.00007436715,0.00007747089,0.0002740451,0.00001477189,0.0006849787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.661399,"threshold_uncertainty_score":0.9998946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004826883","doi":"10.1016/s0925-7721(01)00070-0","title":"Efficient visibility queries in simple polygons","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Visibility polygon; Simple polygon; Visibility; Polygon (computer graphics); Rectilinear polygon; Point in polygon; Combinatorics; Star-shaped polygon; Polygon covering; Vertex (graph theory); Representation (politics); Mathematics; Line segment; Point (geometry); Preprocessor; Computer science; Regular polygon; Artificial intelligence; Geometry; Graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02082431976738206,"gpt":0.2527533371724667,"spread":0.2319290174050846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003894924,0.0001732584,0.0001904556,0.0006431672,0.0001752585,0.0001471475,0.0004605469,0.00006636647,0.0002407263],"category_scores_gemma":[0.0001817862,0.00018515,0.00008445505,0.002321129,0.00005973735,0.0002369906,0.0002055252,0.0001663502,0.0002589685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001161815,"about_ca_system_score_gemma":0.00005926906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001777072,"about_ca_topic_score_gemma":0.00000783322,"domain_scores_codex":[0.9980943,0.0001024298,0.0004227118,0.0005317263,0.0005290977,0.0003196961],"domain_scores_gemma":[0.9988626,0.0004263711,0.00009482326,0.0003272529,0.0001693322,0.0001196818],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000366022,0.0002798352,0.002951051,0.00001172276,0.000008903925,0.00001138626,0.0003054854,0.9142763,0.00004852664,0.05706196,0.001078181,0.02396297],"study_design_scores_gemma":[0.0003805868,0.00004397176,0.07878365,0.000007277701,0.000001830398,0.00001993012,0.00001796165,0.8976396,0.00006823062,0.02143754,0.00139833,0.0002010532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3986208,0.0004142172,0.5982456,0.0008327318,0.0002784161,0.0001497222,0.00000813831,0.0001289257,0.00132142],"genre_scores_gemma":[0.9584708,0.000003756536,0.04070631,0.0004937429,0.00008663422,0.00001650663,0.00003198962,0.000007927475,0.0001822778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.55985,"threshold_uncertainty_score":0.7550197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1561451935","doi":"10.1016/j.comgeo.2011.05.006","title":"A survey of geodesic paths on 3D surfaces","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geodesic; Mathematics; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06421114022435775,"gpt":0.2657591208987997,"spread":0.2015479806744419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007739206,0.0001748499,0.0002269912,0.0005116011,0.0001123019,0.000045776,0.0005970815,0.00006835964,0.0001059672],"category_scores_gemma":[0.0002193716,0.0001737102,0.00007238908,0.001734148,0.00006370212,0.000322994,0.0001461477,0.0001200293,0.0001384345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000325009,"about_ca_system_score_gemma":0.0001833228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001080611,"about_ca_topic_score_gemma":0.000009210929,"domain_scores_codex":[0.9981655,0.0001821004,0.000418632,0.0004203783,0.0005900612,0.0002233288],"domain_scores_gemma":[0.9981096,0.0007017403,0.0002154358,0.0003219804,0.0005488347,0.0001024025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0001222057,0.001231393,0.03871638,0.0000748397,0.0001783231,0.00002482587,0.001239208,0.6354148,0.000216289,0.1704112,0.002568116,0.1498025],"study_design_scores_gemma":[0.0003111997,0.0002224613,0.7293915,0.00001682065,0.000004440385,0.000007165796,0.000005858077,0.2582165,0.0006568339,0.01083893,0.0001305703,0.0001977945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3629781,0.0002013947,0.6336931,0.00003885034,0.0004359757,0.000127305,0.00002887553,0.00008478149,0.002411622],"genre_scores_gemma":[0.9138489,0.000005354954,0.0856568,0.0002314829,0.00003243209,0.000006682549,0.00008910737,0.000009402608,0.0001197846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6906751,"threshold_uncertainty_score":0.7083696,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124937241","doi":"10.1016/j.comgeo.2012.04.001","title":"Exact algorithms and APX-hardness results for geometric packing and covering problems","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Packing problems; Mathematics; Combinatorics; Set packing; Monotone polygon; Cover (algebra); Unit square; Rectangle; Set (abstract data type); Polygon (computer graphics); Vertex cover; Algorithm; Plane (geometry); Set cover problem; Approximation algorithm; Square (algebra); Polyhedron; Vertex (graph theory); Geometry; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.03282671474468887,"gpt":0.2742536335580374,"spread":0.2414269188133486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001019166,0.0002151585,0.0002299643,0.0007847627,0.0003563299,0.0003038391,0.0002256338,0.00008425541,0.000003382846],"category_scores_gemma":[0.0003446234,0.000221715,0.00005588562,0.001515316,0.00005431104,0.001142644,0.0002646214,0.0001226785,0.000009107913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005488857,"about_ca_system_score_gemma":0.00006137416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006215826,"about_ca_topic_score_gemma":3.852273e-7,"domain_scores_codex":[0.9982004,0.000051966,0.0004011487,0.0004998164,0.0004197319,0.0004269096],"domain_scores_gemma":[0.9981867,0.0009509098,0.0001824167,0.0001836927,0.0002559487,0.0002403173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007802766,0.0003828145,0.009525032,0.0004434232,0.0001881256,0.000004764055,0.001757886,0.1787159,0.0003930629,0.07147086,0.00326906,0.733771],"study_design_scores_gemma":[0.00286607,0.0002648312,0.1575934,0.00007821234,0.00003471432,0.0002197192,0.00006668681,0.7905697,0.0004935617,0.01851025,0.02851107,0.0007918082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08522014,0.002760087,0.9101627,0.0004043975,0.0007452713,0.0003669103,0.00004075808,0.0001103302,0.0001893689],"genre_scores_gemma":[0.8374514,0.00005311635,0.161575,0.0002232829,0.0003734224,0.00004073932,0.0001182579,0.00001423325,0.0001505254],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7522312,"threshold_uncertainty_score":0.9041274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148125855","doi":"10.1016/s0925-7721(02)00091-3","title":"Ununfoldable polyhedra with convex faces","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Combinatorics; Polygon (computer graphics); Mathematics; Integer points in convex polyhedra; Convex set; Geometry; Computer science; Algorithm; Convex optimization; Linear programming","retraction":null,"screen_n_in":null,"score":{"opus":0.01689624797118267,"gpt":0.2073866342601344,"spread":0.1904903862889518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001643879,0.000200336,0.0001912792,0.0003719754,0.000257732,0.0002455106,0.000521614,0.000061773,0.0006958646],"category_scores_gemma":[0.00003868496,0.0001813133,0.0000597912,0.001926202,0.00006758456,0.0007654993,0.0001595374,0.0001386835,0.0009162936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000532291,"about_ca_system_score_gemma":0.00004918596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007564393,"about_ca_topic_score_gemma":0.000001566974,"domain_scores_codex":[0.998246,0.00005143458,0.0002657351,0.0004790049,0.0006549572,0.0003029275],"domain_scores_gemma":[0.998962,0.0002553164,0.0001201027,0.0002921059,0.0002160863,0.0001544258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001184412,0.0002739155,0.002756629,0.00002424302,0.00008938272,0.00004165584,0.0003562704,0.7768496,0.0001206681,0.1227678,0.0237023,0.07300577],"study_design_scores_gemma":[0.0009055333,0.000236626,0.01430422,0.00001887201,0.0000117952,0.0001730843,0.00001999567,0.9376878,0.0004355215,0.01922693,0.02649515,0.0004844874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0501572,0.0005197992,0.9399686,0.001775689,0.0002854428,0.0001641284,0.000005846389,0.0002621275,0.006861143],"genre_scores_gemma":[0.8625239,0.000009353226,0.1341128,0.001095052,0.0001152279,0.00001600311,0.00002963547,0.0000126586,0.002085392],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8123666,"threshold_uncertainty_score":0.9998616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001723515,0.000137976,0.0001661867,0.0004447822,0.0001346964,0.00009242797,0.0002328411,0.00004027201,0.000009240033],"category_scores_gemma":[0.00001339643,0.000125342,0.0000366297,0.001105783,0.00007830473,0.0003831905,0.00007103715,0.00007021612,0.000007796825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001758523,"about_ca_system_score_gemma":0.00007888544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003150385,"about_ca_topic_score_gemma":0.0000038788,"domain_scores_codex":[0.9987515,0.0000334845,0.0002683132,0.0003235685,0.0004599459,0.0001631628],"domain_scores_gemma":[0.9992347,0.0002050632,0.0001436118,0.0001417209,0.0002138035,0.00006105784],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00004097704,0.0002787343,0.02817824,0.00009910445,0.00009625404,0.00002228005,0.0002064658,0.2431847,0.0008719036,0.6895898,0.00243951,0.03499204],"study_design_scores_gemma":[0.002074724,0.0004527364,0.5838327,0.00009523203,0.00003296632,0.0001983552,0.00003839556,0.1020217,0.002217518,0.3050678,0.003324434,0.0006435534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3248312,0.0003002425,0.6736969,0.0002279924,0.00008046398,0.00009880437,0.000007627169,0.00005115082,0.0007055946],"genre_scores_gemma":[0.7911255,0.000003936562,0.2084596,0.0001510039,0.00004233559,0.000005510681,0.00006416604,0.000006215702,0.000141674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5556544,"threshold_uncertainty_score":0.5111299,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003235104,0.0001677208,0.0002154691,0.0006723207,0.0001462832,0.00007741983,0.0005440317,0.0000693271,0.00002706817],"category_scores_gemma":[0.0001003773,0.0001774804,0.000131127,0.001877686,0.0001025584,0.0004862894,0.0000895988,0.0001247857,0.00005800655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004991923,"about_ca_system_score_gemma":0.0002990518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001529058,"about_ca_topic_score_gemma":0.000001658481,"domain_scores_codex":[0.998328,0.00004084525,0.0004352125,0.0003827982,0.0005820276,0.0002311579],"domain_scores_gemma":[0.9988628,0.0002489213,0.0001920036,0.000246609,0.0003324979,0.0001171739],"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.000007111112,0.0001289999,0.0005365561,0.00002215558,0.0000383157,0.000008980579,0.0002046832,0.3069117,0.0005457533,0.6825072,0.0002544743,0.008834069],"study_design_scores_gemma":[0.001685084,0.0002175356,0.04344461,0.00005330922,0.00001317177,0.0001154748,0.00003291911,0.03459647,0.002693012,0.915821,0.0009225216,0.0004049019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1548074,0.0001638773,0.8426369,0.0007727756,0.0003569422,0.0001222079,0.00001414805,0.0001161301,0.001009688],"genre_scores_gemma":[0.7750969,0.000003686583,0.2243886,0.0003228955,0.00005511826,0.00000587559,0.00007120673,0.000007015327,0.00004867668],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6202895,"threshold_uncertainty_score":0.7237442,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004302023,0.0002225082,0.0002462634,0.001337818,0.0003132655,0.0003356705,0.0008383445,0.00008018426,0.00007296986],"category_scores_gemma":[0.0001582132,0.0002456245,0.0001287596,0.004500223,0.00003054984,0.0009111742,0.0001334874,0.0002054579,0.0004279417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008651272,"about_ca_system_score_gemma":0.0001398859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004883228,"about_ca_topic_score_gemma":3.079639e-7,"domain_scores_codex":[0.9977415,0.00006649015,0.0004377777,0.0005607918,0.000814702,0.0003787036],"domain_scores_gemma":[0.9984905,0.0004363665,0.0001651237,0.0003697774,0.0003407922,0.0001974002],"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.000009459513,0.0002835577,0.0004067296,0.00001171155,0.00002856419,0.00001851425,0.000133767,0.3354217,0.0002115633,0.306962,0.008693534,0.3478189],"study_design_scores_gemma":[0.0009778185,0.0003439024,0.1794529,0.00002364274,0.00001171383,0.0001493441,0.00001420586,0.5033266,0.0006365158,0.3001572,0.01424475,0.0006613524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06622978,0.0004617673,0.9263818,0.002265337,0.0004754548,0.0001658987,0.000005020496,0.000388547,0.003626367],"genre_scores_gemma":[0.806404,0.000008422849,0.1904207,0.00254052,0.0001778776,0.000005548917,0.00008140146,0.000007727336,0.0003538557],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7401742,"threshold_uncertainty_score":0.9999996,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007001059,0.0002192559,0.0003562661,0.0005876826,0.0002300496,0.0001212359,0.000674534,0.00006544276,0.00008879714],"category_scores_gemma":[0.0002057063,0.0002332194,0.0001733869,0.001939564,0.00008483828,0.0004959236,0.0002053745,0.0001505887,0.0001167144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005737362,"about_ca_system_score_gemma":0.0001232164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000145595,"about_ca_topic_score_gemma":0.000002112157,"domain_scores_codex":[0.9976043,0.0001650705,0.0006647867,0.0005338715,0.0007464002,0.0002855435],"domain_scores_gemma":[0.9974888,0.001086646,0.0003332278,0.000459881,0.0004747401,0.0001567232],"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.00002235889,0.0001592772,0.009071202,0.00006755329,0.0001500152,0.000002615343,0.000914171,0.3509483,0.0003218496,0.533788,0.008083634,0.09647105],"study_design_scores_gemma":[0.001566075,0.0001520716,0.08446227,0.0000355839,0.00002779538,0.00001549932,0.00001483502,0.6935659,0.0004836382,0.1935979,0.02563779,0.0004406652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04935278,0.0001071045,0.9467529,0.001673991,0.0003218362,0.0001942953,0.0001323678,0.0001143325,0.001350378],"genre_scores_gemma":[0.8674642,0.000001422039,0.1310066,0.0007038583,0.0003139677,0.00001195893,0.0002910931,0.00001264103,0.0001942585],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8181115,"threshold_uncertainty_score":0.9510409,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004301146,0.0001339531,0.000233489,0.0001002088,0.0001349425,0.00003069575,0.00005907649,0.00006317005,0.00001327652],"category_scores_gemma":[0.001514846,0.0001199157,0.00005760031,0.0001542978,0.00004644799,0.00006703534,0.00001608875,0.00005851634,0.000001788224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001836671,"about_ca_system_score_gemma":0.00004509428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.171811e-7,"about_ca_topic_score_gemma":4.847954e-7,"domain_scores_codex":[0.9990681,0.00003772473,0.0002847344,0.0002488917,0.0001394343,0.0002210558],"domain_scores_gemma":[0.9948647,0.004618291,0.00009577729,0.00007846142,0.0002403128,0.0001024364],"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.00001997741,0.00008713291,0.00002102474,0.0003375146,0.00004007915,9.226914e-7,0.0001368677,0.002622235,0.00003947769,0.9750844,0.000923245,0.02068711],"study_design_scores_gemma":[0.0007351725,0.00007740997,0.00003583603,0.00002007796,0.00003401708,0.00000838211,0.00003552334,0.1036771,0.00005563853,0.8910545,0.004123769,0.0001426465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001160247,0.000159973,0.9970993,0.0001753854,0.0001643587,0.000693592,0.0002442088,0.0000461724,0.000256774],"genre_scores_gemma":[0.009448184,0.000007259998,0.9896677,0.0001471885,0.0001036407,0.0001929043,0.00004186577,0.00002926881,0.0003619739],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1010549,"threshold_uncertainty_score":0.4890022,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002496057,0.0001462988,0.00013872,0.0003115142,0.0002069983,0.0003751116,0.0008393997,0.00003402507,0.00002536678],"category_scores_gemma":[0.00001945817,0.0001491448,0.00006660479,0.00108018,0.00004403972,0.0004205618,0.0004662196,0.0001045702,0.0002553859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003477187,"about_ca_system_score_gemma":0.0000338093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002574791,"about_ca_topic_score_gemma":0.000001175384,"domain_scores_codex":[0.9985044,0.00002937962,0.0002775588,0.0004262403,0.0004608551,0.0003015749],"domain_scores_gemma":[0.9992679,0.0001681807,0.00009019071,0.0003191735,0.00009741737,0.0000571488],"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.000001638153,0.0003980896,0.01472358,0.00003027387,0.00003294536,0.00009175216,0.00005852698,0.2636639,0.00003012841,0.5670143,0.01557454,0.1383803],"study_design_scores_gemma":[0.0003318039,0.00003421076,0.1513674,0.0000146366,0.000005226773,0.00001405444,0.000007586238,0.8223784,0.00002841578,0.01721735,0.008357731,0.0002432097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06947318,0.0001123781,0.9242555,0.0003105964,0.0005319407,0.0001220614,0.000008995961,0.000278153,0.00490719],"genre_scores_gemma":[0.8793063,6.399004e-7,0.1194939,0.0003043536,0.0002527004,0.000002724661,0.0001492932,0.000008341449,0.0004818241],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.809833,"threshold_uncertainty_score":0.608195,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001860434,0.0001558634,0.0001876645,0.0004095997,0.0001038326,0.0001535653,0.0003096148,0.00005607538,0.00008756527],"category_scores_gemma":[0.0001004336,0.0001551131,0.00004524488,0.0009840269,0.00006350975,0.000830535,0.0001696405,0.0001977225,0.00001589643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004523355,"about_ca_system_score_gemma":0.00002475728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002188426,"about_ca_topic_score_gemma":0.000002743044,"domain_scores_codex":[0.9987274,0.00003199317,0.0002937534,0.0004006657,0.0003110542,0.0002351745],"domain_scores_gemma":[0.9992859,0.000272319,0.00008635694,0.000172868,0.00009722797,0.00008529163],"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.00003210412,0.0005544364,0.007590431,0.00007885202,0.00006582068,0.0004053632,0.001715131,0.05249214,0.001732706,0.2112644,0.002516075,0.7215525],"study_design_scores_gemma":[0.0009169652,0.0002213473,0.02890886,0.00007197593,0.000005564581,0.0001165,0.00002401172,0.8749224,0.001982251,0.09133998,0.001025469,0.0004646654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02408864,0.000946079,0.9715161,0.0006452063,0.0000607877,0.0001216288,0.000003729542,0.000177714,0.002440076],"genre_scores_gemma":[0.6799001,0.00004432362,0.3195546,0.0003037796,0.00004134512,0.000005653888,0.000008199155,0.000007395514,0.0001345794],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8224303,"threshold_uncertainty_score":0.6325328,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000843254,0.000233608,0.0002591234,0.001100564,0.0003542091,0.0002754403,0.0004384109,0.0001256484,0.00004719329],"category_scores_gemma":[0.0004822982,0.0002411414,0.00009762944,0.002689374,0.00006644903,0.0005619393,0.0002058269,0.0001585742,0.00007768774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000420203,"about_ca_system_score_gemma":0.0001013721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004234598,"about_ca_topic_score_gemma":5.637136e-7,"domain_scores_codex":[0.9979499,0.0001103811,0.0004699749,0.0006317575,0.0005000335,0.0003379838],"domain_scores_gemma":[0.9974789,0.001381217,0.0002056752,0.0002849528,0.000473264,0.0001760178],"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.00001167809,0.00009382992,0.001233833,0.0001009136,0.00007351208,0.000001475992,0.0002251404,0.8010125,0.00009943118,0.1360266,0.006099584,0.05502149],"study_design_scores_gemma":[0.00119919,0.0002784742,0.03848129,0.00002667981,0.00001730704,0.00006565678,0.00001178544,0.8231617,0.0001121085,0.100941,0.03534434,0.0003605293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08865814,0.000405057,0.907958,0.001025201,0.0005330982,0.0004045927,0.00002394566,0.000188057,0.0008039456],"genre_scores_gemma":[0.9271157,0.00001263013,0.07057276,0.0005251927,0.0001621362,0.00005272186,0.0003180237,0.00002021497,0.001220613],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8384576,"threshold_uncertainty_score":0.9833462,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004217328,0.0001306102,0.0001187398,0.0001228812,0.0003794095,0.0004163357,0.001166519,0.00005382462,0.00002146485],"category_scores_gemma":[0.0002547331,0.0001076633,0.00008111285,0.0007860448,0.0001763935,0.000419446,0.0002756055,0.0001773473,0.0007692456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001308554,"about_ca_system_score_gemma":0.0001916259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003963579,"about_ca_topic_score_gemma":0.00001423312,"domain_scores_codex":[0.9983687,0.00004473411,0.0003424011,0.0003752711,0.0005505506,0.0003183469],"domain_scores_gemma":[0.9983864,0.0006772617,0.0001213232,0.0005003791,0.0002194973,0.00009514124],"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.000007728339,0.00008553718,0.0001948923,0.000003766628,0.00003342766,0.000009877804,0.0004533992,0.2468864,0.00005114146,0.6795303,0.0005048067,0.07223882],"study_design_scores_gemma":[0.0001871579,0.0001067399,0.01010408,0.00002261081,0.000005707552,0.00003877521,0.00009024702,0.08562648,0.002107553,0.8914374,0.009981452,0.0002918438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07057081,0.0003699577,0.9219786,0.004661618,0.0006820547,0.0001319008,0.000001762319,0.0001840065,0.00141929],"genre_scores_gemma":[0.9458516,0.000009846099,0.05293671,0.0006832218,0.0001653813,0.00001268996,0.000004689751,0.00001000684,0.0003258583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8752808,"threshold_uncertainty_score":0.9887353,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003806997,0.0001931138,0.0002525639,0.001196613,0.000280412,0.0002045495,0.0004817422,0.00008192373,0.00004929606],"category_scores_gemma":[0.0001902711,0.0002079122,0.0002206819,0.005463002,0.00003580434,0.0006062069,0.0001048239,0.00008649336,0.0002012609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001746034,"about_ca_system_score_gemma":0.0002767091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000896225,"about_ca_topic_score_gemma":0.000002944356,"domain_scores_codex":[0.998185,0.00004467678,0.0004243981,0.0005672243,0.0004994447,0.0002792476],"domain_scores_gemma":[0.9981371,0.0003824759,0.000175182,0.0003189497,0.0008491359,0.0001371656],"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.000009820938,0.0001128195,0.0001202242,0.000009719545,0.0002100931,0.000001707559,0.0001415202,0.9157639,0.0001852241,0.07889206,0.0003702494,0.004182726],"study_design_scores_gemma":[0.001137641,0.000135744,0.0231303,0.00001143095,0.0001036806,0.00001848195,0.00001539603,0.8373767,0.0008322429,0.1361286,0.0007460582,0.0003637215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03799352,0.000203175,0.9595335,0.001249819,0.0002397795,0.0003120035,0.00001620614,0.0002425472,0.0002094741],"genre_scores_gemma":[0.7184201,0.000001387207,0.2801628,0.0004879612,0.0001362014,0.00005181035,0.0005217211,0.000009726558,0.0002083395],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6804266,"threshold_uncertainty_score":0.8478413,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007856114,0.0001474754,0.0001417228,0.0004602133,0.0001878532,0.0001960684,0.0008553146,0.00005868037,0.00006156863],"category_scores_gemma":[0.00009406786,0.0001165033,0.00006288842,0.001854434,0.00004105119,0.0003300028,0.00009639748,0.0002007677,0.0001615134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003322321,"about_ca_system_score_gemma":0.00008295704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006839599,"about_ca_topic_score_gemma":0.000007425142,"domain_scores_codex":[0.9982746,0.0002165891,0.0003116523,0.0003590203,0.0005854748,0.000252682],"domain_scores_gemma":[0.9984225,0.001004031,0.00008657896,0.0003095803,0.0001122321,0.00006510306],"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.000004969647,0.0001746023,0.0008077514,0.00001244136,0.00001468284,0.00001091579,0.0003851502,0.1402206,0.00005392627,0.7879309,0.004862676,0.06552139],"study_design_scores_gemma":[0.0006646492,0.0001077837,0.1267775,0.00001417115,0.000004949387,0.00008377097,0.0000244864,0.6896108,0.00007571714,0.147541,0.03482006,0.0002750848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06738982,0.0001107199,0.9222676,0.003044824,0.0003557974,0.000159127,0.000005006449,0.00008838168,0.006578763],"genre_scores_gemma":[0.9404129,0.000002643066,0.05716325,0.001878653,0.0002260836,0.00001851803,0.00011825,0.000006176359,0.0001735585],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.873023,"threshold_uncertainty_score":0.4750867,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005756101,0.0001343149,0.0001256353,0.0003017157,0.0001970761,0.0001417352,0.0003184761,0.00005341143,0.00001646549],"category_scores_gemma":[0.0001194024,0.00008646442,0.00004255364,0.0007817731,0.00006321666,0.0005695742,0.0001378407,0.00006750447,0.00002763755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004690492,"about_ca_system_score_gemma":0.00009538756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004987409,"about_ca_topic_score_gemma":0.000002213661,"domain_scores_codex":[0.998751,0.00005550574,0.0002918695,0.0003666805,0.0003245107,0.0002104415],"domain_scores_gemma":[0.9978256,0.001636982,0.0001076898,0.0001759092,0.0001953389,0.000058534],"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.00002379989,0.0001015841,0.001913094,0.00003856135,0.00003596586,0.000001652641,0.0002495635,0.2207657,0.0001459455,0.1885352,0.0009729422,0.587216],"study_design_scores_gemma":[0.001059968,0.00006905502,0.04338996,0.00003050294,0.000006825057,0.00001758393,0.00001309652,0.8541802,0.00009142508,0.09419864,0.006764076,0.0001787169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01420026,0.0003280697,0.9814801,0.003052945,0.0002261585,0.0004740986,0.00001957353,0.00005471997,0.0001641016],"genre_scores_gemma":[0.7060456,0.00002918375,0.2926302,0.0004340282,0.0001660084,0.0001321169,0.00004159333,0.00001086647,0.0005103906],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6918453,"threshold_uncertainty_score":0.3525917,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000532089,0.0001904606,0.0003380053,0.0006165236,0.0003625603,0.00005051805,0.001182415,0.00005788493,0.0001150961],"category_scores_gemma":[0.0002543364,0.0001714851,0.000100149,0.001968996,0.00017915,0.0005371065,0.0006410045,0.0002986452,0.00007683678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006248787,"about_ca_system_score_gemma":0.00023312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002329692,"about_ca_topic_score_gemma":0.000002895152,"domain_scores_codex":[0.9972449,0.0001644614,0.0004692984,0.0005879225,0.001155288,0.0003781389],"domain_scores_gemma":[0.9979032,0.0008022304,0.0001378766,0.0005707148,0.0004426081,0.0001433718],"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.001057226,0.008970464,0.130418,0.0003184399,0.001075092,0.0009740732,0.04627014,0.6714219,0.003111434,0.1012085,0.01175733,0.02341733],"study_design_scores_gemma":[0.004731615,0.002806961,0.4242566,0.00008188199,0.00002400129,0.0004019928,0.0007960382,0.4732054,0.00669578,0.08510584,0.0008757588,0.001018163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7078462,0.00003970836,0.2911632,0.0001341077,0.0001957099,0.0002605501,0.00001330213,0.00008883811,0.0002583824],"genre_scores_gemma":[0.9512129,0.000007926496,0.04765898,0.0003283748,0.00007356954,0.00001800617,0.00000623571,0.00001542309,0.0006785391],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2938386,"threshold_uncertainty_score":0.6992958,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004727866,0.0002383901,0.000233886,0.0005333967,0.0003027455,0.0002952716,0.0006069815,0.0001017306,0.00002187635],"category_scores_gemma":[0.00005753026,0.0002387615,0.0001654282,0.001372153,0.00002741974,0.0006787892,0.00007958698,0.0001379477,0.00008441864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007381383,"about_ca_system_score_gemma":0.0001969565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001270861,"about_ca_topic_score_gemma":3.463807e-7,"domain_scores_codex":[0.9978867,0.00005918751,0.0004168082,0.000606788,0.000653187,0.0003773965],"domain_scores_gemma":[0.9984536,0.0003077512,0.0001499031,0.0002809917,0.0006441161,0.0001636082],"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.00001015884,0.0001833786,0.00002072832,0.00001232668,0.0000364336,0.000004912124,0.0001397604,0.08944208,0.0001676789,0.1015038,0.006643728,0.801835],"study_design_scores_gemma":[0.001009461,0.0003220368,0.003352631,0.00002500485,0.00001251466,0.0000514107,0.000009511789,0.806448,0.0004108852,0.1715758,0.01640097,0.0003816929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001386974,0.0003623626,0.9929077,0.002602253,0.0004378184,0.0004969651,0.00002104858,0.0002432997,0.001541569],"genre_scores_gemma":[0.2126074,0.000002697063,0.7842053,0.001850398,0.0004135906,0.00004340771,0.0001500623,0.00001186633,0.0007152403],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8014533,"threshold_uncertainty_score":0.9736412,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004318597,0.000189528,0.0001587513,0.0005336457,0.0002924277,0.0002073749,0.000420886,0.00006691676,0.0001089971],"category_scores_gemma":[0.0003109838,0.0001954855,0.00009568877,0.001506545,0.00003048427,0.0003760121,0.00007794853,0.000173152,0.000568083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007599533,"about_ca_system_score_gemma":0.0001530131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001178591,"about_ca_topic_score_gemma":2.960182e-7,"domain_scores_codex":[0.9981704,0.000118107,0.0003023843,0.0004998537,0.0006139947,0.0002952073],"domain_scores_gemma":[0.9985266,0.0007031193,0.0001044109,0.0003119737,0.0002076116,0.000146229],"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.000002993818,0.00007307711,0.000103801,0.00000599777,0.00001373137,0.0000068499,0.000035194,0.3128599,0.00004939706,0.6742677,0.003577648,0.009003719],"study_design_scores_gemma":[0.0009564802,0.0001956097,0.006454943,0.00002470853,0.000007199454,0.0001078367,0.00001778457,0.1184476,0.001072835,0.8398019,0.03237744,0.0005356235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03426778,0.0001676425,0.9504312,0.0004404088,0.000818232,0.0001411334,0.000006481765,0.0001973064,0.01352981],"genre_scores_gemma":[0.8841043,0.000002792732,0.1134988,0.001738865,0.00008875849,0.00001390393,0.00005413041,0.00001176848,0.0004866884],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8498365,"threshold_uncertainty_score":0.7971666,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002283822,0.0002038158,0.0001763232,0.0005893395,0.0002982475,0.0003088168,0.0004910951,0.00005722282,0.0000417635],"category_scores_gemma":[0.00002097031,0.0001845007,0.00007829462,0.002263719,0.00006942,0.0006830987,0.0001207821,0.0001299197,0.0001308433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004671766,"about_ca_system_score_gemma":0.0001549695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000304747,"about_ca_topic_score_gemma":0.000006603448,"domain_scores_codex":[0.9981878,0.00004788149,0.0003035398,0.0004974503,0.0006704483,0.0002928198],"domain_scores_gemma":[0.9989298,0.0002516285,0.0001304309,0.0002540766,0.000341349,0.00009270106],"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.00001224554,0.000145998,0.002467481,0.00001673306,0.00003175629,0.0000256505,0.00005064643,0.6124086,0.0001284336,0.3597712,0.005587764,0.01935355],"study_design_scores_gemma":[0.002176302,0.0003951078,0.2799641,0.00006798791,0.00003234961,0.000382216,0.00002843383,0.2440313,0.001450707,0.428756,0.04147923,0.001236285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08261725,0.0003033072,0.9115639,0.0009181443,0.0002441505,0.0001387836,0.000004972424,0.0002589674,0.003950542],"genre_scores_gemma":[0.748691,0.000002027916,0.2497555,0.0005213252,0.0002221999,0.00001522997,0.0001106431,0.00001191013,0.0006701865],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6660738,"threshold_uncertainty_score":0.7523719,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007013467,0.00009643315,0.0001409804,0.0001565207,0.00005282188,0.000005576814,0.0001033742,0.00005597861,0.0002013316],"category_scores_gemma":[0.00002909629,0.0001026388,0.00005398403,0.0003019256,0.00003923463,0.00009912652,0.00001254536,0.00009015628,0.00009886309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002271982,"about_ca_system_score_gemma":0.00001928654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008120262,"about_ca_topic_score_gemma":5.808226e-7,"domain_scores_codex":[0.9992788,0.00001152517,0.0002577051,0.000122499,0.0002102729,0.0001192],"domain_scores_gemma":[0.9996195,0.00005612404,0.00003697848,0.000120066,0.0001193034,0.00004798045],"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.000002291395,0.00001902304,0.000414119,0.00002758132,0.00002173697,0.000004766491,0.0001098711,0.9938207,0.0007870414,0.0006344378,0.0004847581,0.003673662],"study_design_scores_gemma":[0.0001180872,0.00002746043,0.01671104,0.00001600514,0.000004598225,0.00003344181,0.00001359688,0.9740825,0.007286492,0.0009404275,0.0006225887,0.0001438141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4256242,0.0002747087,0.5724363,0.00001875459,0.0001997217,0.00006303007,0.00000832765,0.00008040179,0.001294522],"genre_scores_gemma":[0.980435,0.00005308322,0.01915961,0.0000282515,0.00008574932,0.000003885401,0.00006355236,0.00001704015,0.0001538502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5548108,"threshold_uncertainty_score":0.4185488,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008343204,0.0005312177,0.0002889267,0.000623508,0.0009580643,0.001046038,0.001212016,0.0007101602,0.001008925],"category_scores_gemma":[0.0005321436,0.0007413338,0.0006433728,0.00119495,0.0003227961,0.00124836,0.0008272646,0.00084541,0.001148631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003250383,"about_ca_system_score_gemma":0.0007459706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002380544,"about_ca_topic_score_gemma":0.0001883603,"domain_scores_codex":[0.9949619,0.0001742568,0.001034176,0.001214902,0.001688867,0.0009259699],"domain_scores_gemma":[0.996301,0.001121589,0.0007705338,0.000905946,0.0003669539,0.000533998],"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.0001319877,0.0002362235,0.0001945711,0.0001071658,0.0004445166,0.0001239303,0.001086517,0.05250164,0.0008030392,0.9303261,0.006020718,0.00802361],"study_design_scores_gemma":[0.001307281,0.0004332155,0.003777497,0.0001198199,0.0001788267,0.0003963154,0.0001640303,0.9533073,0.0237491,0.01186308,0.003859616,0.000843933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.938401,0.0001938902,0.05689917,0.0006881708,0.001922833,0.00009846698,0.0003455406,0.0002537208,0.001197192],"genre_scores_gemma":[0.9717915,0.00003248525,0.02390409,0.001028376,0.001176196,0.000177024,0.001593911,0.0001266949,0.0001697448],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.918463,"threshold_uncertainty_score":0.999991,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006282793,0.0002184484,0.0001594484,0.0004471951,0.0004500395,0.0002447301,0.0009087477,0.00007805012,0.00002811761],"category_scores_gemma":[0.00004066931,0.0001373924,0.0001337861,0.0008436881,0.00005620969,0.0006346052,0.0001300243,0.0001147692,0.00007206236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009028729,"about_ca_system_score_gemma":0.0001286471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003697362,"about_ca_topic_score_gemma":0.000001376586,"domain_scores_codex":[0.9979444,0.00008031024,0.0003465932,0.000602031,0.0006872851,0.0003394127],"domain_scores_gemma":[0.997706,0.001257592,0.0001563863,0.0004149654,0.0003230675,0.0001420171],"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.00001553206,0.0001217055,0.0001683424,0.000007926062,0.00006375227,0.000003653927,0.0001107841,0.07084528,0.0001455411,0.1187274,0.001594365,0.8081957],"study_design_scores_gemma":[0.001658783,0.0004973045,0.01120113,0.00004514771,0.00001891785,0.00004454148,0.00002864887,0.7134241,0.001169329,0.2601899,0.01127589,0.0004462826],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007072503,0.0001054993,0.9888656,0.002250865,0.0008753033,0.0004802694,0.00006429858,0.0001603248,0.0001253997],"genre_scores_gemma":[0.6920705,0.00001366083,0.3058942,0.001078822,0.0004418281,0.0001336565,0.00008917142,0.00002111006,0.0002571052],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8077494,"threshold_uncertainty_score":0.5602698,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002621003,0.00019666,0.0001675804,0.0003398165,0.0002392,0.0002563679,0.0006271511,0.00007604833,0.0000840663],"category_scores_gemma":[0.00008863033,0.0001777245,0.00006090653,0.00158765,0.00008146591,0.0006319557,0.00009747015,0.0003135743,0.0001922823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000260148,"about_ca_system_score_gemma":0.0001943292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003544847,"about_ca_topic_score_gemma":0.00001082645,"domain_scores_codex":[0.9982698,0.00003378684,0.0002607138,0.0005115581,0.0006429612,0.0002811842],"domain_scores_gemma":[0.9986183,0.0003212176,0.0001271307,0.0003753208,0.0003854792,0.0001725399],"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.0000371082,0.0002899033,0.005334241,0.00002763377,0.00006772284,0.00004488251,0.0002173163,0.2831259,0.002599771,0.6494942,0.003398462,0.0553628],"study_design_scores_gemma":[0.001550006,0.0002723677,0.1539348,0.00002959098,0.00001780911,0.000339923,0.00002135636,0.727035,0.002941406,0.07397082,0.03898127,0.0009056183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2161339,0.00006006034,0.7795123,0.0009127236,0.0006193214,0.0001286397,0.000007625263,0.0001904861,0.002434875],"genre_scores_gemma":[0.7868012,0.000001438786,0.2118437,0.0005311139,0.0002359886,0.000006763531,0.00007008819,0.00001142261,0.0004982979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5755234,"threshold_uncertainty_score":0.7247394,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038435,0.0002422441,0.0002124864,0.0007101246,0.0007250913,0.0004800718,0.0007677883,0.00009823676,0.0002946176],"category_scores_gemma":[0.00006251877,0.0002457749,0.0001584089,0.001812714,0.0001374167,0.00115995,0.0002632161,0.000187017,0.0002615318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006011171,"about_ca_system_score_gemma":0.0002289407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000199679,"about_ca_topic_score_gemma":0.000002412188,"domain_scores_codex":[0.9979155,0.00007522382,0.0003551257,0.0006065589,0.0006639772,0.0003836335],"domain_scores_gemma":[0.9987233,0.0002275248,0.0001835218,0.0003575203,0.0003044973,0.0002036342],"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.00005309182,0.0008097666,0.02009496,0.00007780744,0.0002139054,0.0001705068,0.004560038,0.04607085,0.0004410988,0.8135914,0.008668196,0.1052484],"study_design_scores_gemma":[0.001103775,0.0002043063,0.2436864,0.00005328058,0.00002562287,0.0002338814,0.00005678358,0.1742666,0.004435757,0.5638282,0.01118331,0.0009221678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1732981,0.0003548052,0.819488,0.0002004461,0.0008045482,0.0001433532,0.000006926305,0.0002947345,0.005409044],"genre_scores_gemma":[0.8143087,0.000003005619,0.1843515,0.0007592291,0.0001047038,0.00001275397,0.00005219631,0.00001411306,0.000393803],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6410106,"threshold_uncertainty_score":0.9999995,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005040498,0.0002626216,0.0002477404,0.001350776,0.0003442317,0.0003556656,0.0004538803,0.00009733727,0.00005466555],"category_scores_gemma":[0.0001050127,0.0002685748,0.0001026454,0.00338353,0.0000876425,0.0003805252,0.0003425466,0.0001813549,0.0001818175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008991502,"about_ca_system_score_gemma":0.0001269456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004496381,"about_ca_topic_score_gemma":0.000001535582,"domain_scores_codex":[0.9975467,0.00007804287,0.0004560556,0.0006930858,0.000821767,0.0004042937],"domain_scores_gemma":[0.9984379,0.0005826795,0.0001684449,0.0002987562,0.0003535892,0.0001585737],"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.000004019265,0.0001809466,0.001288773,0.00001758921,0.00002520514,0.00001588018,0.00003824883,0.7008623,0.00008856783,0.2483143,0.00381109,0.04535306],"study_design_scores_gemma":[0.0007504395,0.00008105051,0.1336889,0.00001459518,0.00001395969,0.000121354,0.000007781299,0.7830782,0.000453645,0.07068724,0.01062845,0.0004743419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09912542,0.001288248,0.8953767,0.001329885,0.0005895165,0.0001989476,0.00001276321,0.0002347665,0.001843682],"genre_scores_gemma":[0.8711194,0.00000839479,0.1272554,0.0003594447,0.0003841836,0.00002043921,0.000105807,0.00001528448,0.000731534],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7719941,"threshold_uncertainty_score":0.9999766,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000590833,0.00022261,0.000224042,0.0005221373,0.0004937786,0.0002998571,0.0002388164,0.00008554818,0.00001088018],"category_scores_gemma":[0.0001598144,0.0002348501,0.0001051611,0.001056697,0.00006545999,0.0005707626,0.00006406495,0.0001201897,0.00001334976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003807532,"about_ca_system_score_gemma":0.0001118386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007419782,"about_ca_topic_score_gemma":0.000001826627,"domain_scores_codex":[0.9982998,0.00007270851,0.0003465494,0.0005685548,0.0003636389,0.0003487425],"domain_scores_gemma":[0.998457,0.0008152421,0.0001269517,0.0001852268,0.0002490988,0.0001665089],"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.00001518279,0.00009326908,0.001145797,0.00003959312,0.00009404077,0.00008001395,0.0002825684,0.2688007,0.0001202499,0.697609,0.001160104,0.03055948],"study_design_scores_gemma":[0.001095305,0.0001923636,0.004635544,0.00001571517,0.00002188466,0.001840023,0.0001152088,0.817685,0.0003295464,0.1700687,0.003517096,0.0004836138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1963232,0.0007550025,0.8016069,0.0002527062,0.0005093259,0.000235823,0.00002481315,0.0001232847,0.0001688999],"genre_scores_gemma":[0.5686304,0.000004976407,0.4309134,0.0002207182,0.00005483103,0.00001974006,0.00004847479,0.00001036635,0.00009712514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5488843,"threshold_uncertainty_score":0.9576911,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008013098,0.0001368211,0.000313949,0.001836083,0.0000756109,0.00005025211,0.0003685596,0.00005525133,0.00001308966],"category_scores_gemma":[0.0003605361,0.0001149766,0.0002056652,0.004046325,0.00004143718,0.0003771503,0.0001017848,0.00005101824,0.000004630929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006496148,"about_ca_system_score_gemma":0.00009732493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008117649,"about_ca_topic_score_gemma":0.000007830047,"domain_scores_codex":[0.9983483,0.00005285967,0.0006029786,0.0004055749,0.0003573156,0.0002329802],"domain_scores_gemma":[0.9973073,0.001807848,0.0002610382,0.0002244287,0.0003369426,0.0000624612],"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.00001459888,0.0001114379,0.009487882,0.00003299686,0.0002024576,7.951459e-7,0.0002112993,0.7621021,0.0007369814,0.1418344,0.00002506846,0.08523989],"study_design_scores_gemma":[0.0006714666,0.00006299292,0.1165633,0.00004559432,0.00005469587,0.000002908489,0.00001937407,0.7717809,0.0004001823,0.1101056,0.0000935149,0.0001994915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1557273,0.00008437416,0.8433571,0.0003928352,0.000111958,0.0001840273,0.00003112931,0.00004061697,0.00007062915],"genre_scores_gemma":[0.7171232,0.000003138204,0.2826454,0.0001001976,0.00003155994,0.00002032154,0.00004774931,0.000005722079,0.00002275049],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5613958,"threshold_uncertainty_score":0.4688609,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004036553,0.0001705804,0.0002549995,0.0007200969,0.00006115951,0.0001548876,0.0008492308,0.00006700707,0.00001838091],"category_scores_gemma":[0.0001183212,0.0001835973,0.00007653361,0.001677838,0.0001145167,0.001139246,0.0003683381,0.0001998653,0.00003582399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005340769,"about_ca_system_score_gemma":0.0001179424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001022134,"about_ca_topic_score_gemma":0.000001740157,"domain_scores_codex":[0.9982661,0.0000316614,0.0005522616,0.0003983047,0.0004700087,0.0002816359],"domain_scores_gemma":[0.9989836,0.0001840335,0.0002178648,0.000253308,0.0002857616,0.00007541601],"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.00001548682,0.0008666275,0.01216392,0.0001847641,0.00004411056,0.00003945631,0.0008491864,0.3248916,0.000542224,0.03849591,0.003440769,0.618466],"study_design_scores_gemma":[0.0003446771,0.00008194905,0.01617507,0.0001101315,0.000002987429,0.00002655991,0.000006281743,0.9551926,0.00139733,0.0252842,0.001125373,0.0002528395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08868197,0.0002188232,0.9081303,0.0005493361,0.0001672532,0.0001061745,0.000008531182,0.0003191111,0.001818505],"genre_scores_gemma":[0.5465291,0.000001262607,0.4531101,0.0002023373,0.00006083563,0.000001522144,0.00001426657,0.000008210247,0.00007237624],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6303011,"threshold_uncertainty_score":0.748688,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003276735,0.0001286561,0.0001684543,0.0004966729,0.0002123164,0.00009519395,0.0003527757,0.0000611982,0.00007289073],"category_scores_gemma":[0.00007714894,0.0001394903,0.0001050023,0.001121696,0.00003433119,0.0003795154,0.00003912579,0.00005844785,0.00002601514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000390444,"about_ca_system_score_gemma":0.00004974418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002207729,"about_ca_topic_score_gemma":3.492452e-7,"domain_scores_codex":[0.9985738,0.00006374784,0.0004121468,0.0003552555,0.0004176816,0.0001773758],"domain_scores_gemma":[0.9985318,0.0003959785,0.0001800425,0.0002608178,0.000533869,0.00009747222],"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.000002162357,0.0002368699,0.00002393582,0.000008007768,0.00001589034,4.014848e-7,0.0001746963,0.7122287,0.0001875015,0.05197509,0.0004308996,0.2347159],"study_design_scores_gemma":[0.0006431885,0.0001633763,0.002696417,0.000005948194,0.000008620959,0.000008881946,0.00001096788,0.9852158,0.0005910107,0.009692254,0.000814716,0.0001488485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0194625,0.0002305965,0.9789684,0.0002721418,0.0004132801,0.0003276696,0.00004233882,0.00009634783,0.0001866702],"genre_scores_gemma":[0.5457956,0.000001616354,0.4537131,0.00009943367,0.0001329649,0.0000266236,0.0001346611,0.00000637678,0.00008957626],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5263331,"threshold_uncertainty_score":0.5688248,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005839642,0.00008069559,0.0001511553,0.00008060324,0.00004286005,0.000006174349,0.00004570959,0.00003662208,0.0000477025],"category_scores_gemma":[0.0006708685,0.00007279993,0.00002591378,0.0001091536,0.00006759723,0.0001347616,0.00004575453,0.00005354967,0.000004851793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001464286,"about_ca_system_score_gemma":0.000009308303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.488458e-7,"about_ca_topic_score_gemma":4.304415e-8,"domain_scores_codex":[0.9992574,0.00009711765,0.0002198043,0.0001030117,0.0001809603,0.0001417148],"domain_scores_gemma":[0.9979046,0.001768326,0.0001024973,0.00008033446,0.00006823188,0.00007603445],"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.00002175554,0.0001062267,0.000315673,0.0000718618,0.00002324644,2.042644e-7,0.0003894095,0.0002495809,0.00027294,0.9750972,0.00007612689,0.02337578],"study_design_scores_gemma":[0.0002435183,0.00002238071,0.007832021,0.00001789127,0.00001605262,0.000005195333,0.0001139557,0.005337941,0.0007126692,0.9855296,0.0000808213,0.00008795428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1292797,0.0003402113,0.8689364,0.000008639448,0.00007736386,0.0001261266,0.00001404861,0.00001883273,0.001198673],"genre_scores_gemma":[0.5141013,0.000002080389,0.4857615,0.00002577474,0.00002900677,0.000009096399,0.000007095735,0.000007073032,0.00005705593],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3848216,"threshold_uncertainty_score":0.2968695,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008942609,0.0002324989,0.0002277578,0.000957824,0.0003688995,0.0002342473,0.0006458327,0.0001064324,0.00007977401],"category_scores_gemma":[0.00009322875,0.0002430987,0.0001259786,0.002427889,0.0000749315,0.0006014709,0.0001184772,0.0002218744,0.0001316087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000927127,"about_ca_system_score_gemma":0.0001788184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000540794,"about_ca_topic_score_gemma":0.000006650776,"domain_scores_codex":[0.9976202,0.00005791232,0.0005490034,0.0005454241,0.0007822337,0.0004452004],"domain_scores_gemma":[0.9982327,0.0006929352,0.0001907561,0.0002849722,0.0003617958,0.000236893],"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.00004260899,0.0003081101,0.001584923,0.00002923054,0.00008881333,0.00009221723,0.0002975094,0.2341111,0.001441363,0.6482683,0.004681682,0.1090542],"study_design_scores_gemma":[0.001793385,0.0003778867,0.2290077,0.00005203797,0.00002501682,0.000281075,0.00006877361,0.4953956,0.002997519,0.2513912,0.01760823,0.001001582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09951873,0.000285657,0.8952054,0.0006014141,0.000859495,0.0001599994,0.000009662204,0.0002656858,0.003093981],"genre_scores_gemma":[0.7686251,0.000003300426,0.2299882,0.0007203502,0.000239725,0.000004921965,0.0001462885,0.00001136228,0.0002607343],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6691064,"threshold_uncertainty_score":0.9913278,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007221035,0.0002887271,0.0002885273,0.0006313616,0.0002605558,0.0003277227,0.0007905678,0.0001212609,0.0000854206],"category_scores_gemma":[0.000280229,0.0002673156,0.0001408912,0.003132432,0.0002902423,0.0007438145,0.0002424657,0.000225973,0.0002216373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009752039,"about_ca_system_score_gemma":0.0003899994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005095118,"about_ca_topic_score_gemma":0.000001024689,"domain_scores_codex":[0.997127,0.0001903892,0.0005104289,0.0006649046,0.001089185,0.000418073],"domain_scores_gemma":[0.9978055,0.0002411036,0.0001530604,0.0004167767,0.001015652,0.0003679511],"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.00003900181,0.0001485615,0.0002262112,0.00001562377,0.00004559366,0.00001641883,0.00017379,0.1344124,0.00005385092,0.851402,0.006160807,0.007305819],"study_design_scores_gemma":[0.001552909,0.0002052551,0.002883042,0.00003259064,0.000018688,0.00006931869,0.00004199616,0.2396952,0.0003755321,0.7408415,0.0137257,0.0005582662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03264293,0.001658766,0.9586703,0.002674464,0.001399842,0.0002660771,0.00000963693,0.0003380623,0.002339962],"genre_scores_gemma":[0.8700095,0.000007770071,0.1278093,0.001096264,0.0002297016,0.00003971075,0.00008721247,0.00001961958,0.0007010034],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8373665,"threshold_uncertainty_score":0.9999779,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004268125,0.00009471081,0.0001444573,0.0003110998,0.0002410106,0.00001935424,0.0004329035,0.00004224859,0.000009310787],"category_scores_gemma":[0.0002030346,0.00007628532,0.00008527975,0.001486776,0.0001400991,0.0002443499,0.0001152152,0.00008366234,0.00001403582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000252087,"about_ca_system_score_gemma":0.0002509464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001104813,"about_ca_topic_score_gemma":0.000002194405,"domain_scores_codex":[0.9985757,0.00008203856,0.000409311,0.0002049216,0.0005874989,0.0001405567],"domain_scores_gemma":[0.9983037,0.0006629756,0.000254891,0.00022127,0.0005060341,0.00005115723],"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.0001088167,0.0004217837,0.01115136,0.0001465707,0.0002701598,0.00001869054,0.003691168,0.2540157,0.001635894,0.4965234,0.009810898,0.2222056],"study_design_scores_gemma":[0.001136522,0.0003924766,0.1698855,0.00004288416,0.00001442954,0.0002757779,0.0001129577,0.6908232,0.008800701,0.1223396,0.005830947,0.0003449944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2685682,0.0002539703,0.7290977,0.0009197883,0.0004427734,0.0001609664,0.000009143855,0.00003975773,0.0005077029],"genre_scores_gemma":[0.9397646,0.00002671774,0.05987385,0.00006801743,0.00009542771,0.000008579883,0.00002831403,0.000004785848,0.0001296596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6711964,"threshold_uncertainty_score":0.3110825,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003306719,0.0002713848,0.0002634787,0.0005322925,0.0003253019,0.0001639795,0.0007073413,0.0001093297,0.0004172709],"category_scores_gemma":[0.0001711372,0.0002915813,0.0001410954,0.001448915,0.00009415326,0.00100952,0.0002985933,0.0002491402,0.0003968314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007951352,"about_ca_system_score_gemma":0.0002743985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004780607,"about_ca_topic_score_gemma":0.000002727591,"domain_scores_codex":[0.9976117,0.000137344,0.0005187095,0.0007382552,0.0006253816,0.0003686172],"domain_scores_gemma":[0.9981579,0.0006688079,0.0002517422,0.0003236592,0.0003839374,0.0002139959],"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.00008735243,0.0005077222,0.02524299,0.00002895722,0.0004323599,0.0001357369,0.004886304,0.05133546,0.0004996587,0.4395492,0.002152669,0.4751416],"study_design_scores_gemma":[0.000806523,0.0001180736,0.1250923,0.00002982796,0.0000203895,0.0001189156,0.000139312,0.4473706,0.001303262,0.4239177,0.0005107073,0.0005724173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2961356,0.0002206521,0.6979895,0.0001668728,0.001076522,0.0001348543,0.00004879141,0.0002240842,0.00400312],"genre_scores_gemma":[0.6751046,0.000003085686,0.3239838,0.0005062975,0.0001104474,0.00001177381,0.0001948072,0.00001292093,0.00007225422],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4745691,"threshold_uncertainty_score":0.9999536,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005364189,0.0001592301,0.000214166,0.000563701,0.0002281134,0.00009184807,0.0003827871,0.0000765189,0.00006350884],"category_scores_gemma":[0.0003518692,0.0001695318,0.0001562514,0.001500305,0.00005332418,0.0004092583,0.00006000548,0.00007768101,0.00003344925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005110784,"about_ca_system_score_gemma":0.0002932611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001879949,"about_ca_topic_score_gemma":0.000001240146,"domain_scores_codex":[0.9983799,0.00008447772,0.0004664045,0.0003822581,0.0004485415,0.0002384411],"domain_scores_gemma":[0.9979635,0.0008115571,0.0002100366,0.0002843185,0.0006244588,0.0001061415],"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.000008921512,0.0001444576,0.000521819,0.00003149663,0.00004811479,0.000001026877,0.0001120936,0.0887142,0.0001885328,0.8941951,0.002157465,0.01387675],"study_design_scores_gemma":[0.001686851,0.0001918547,0.02304084,0.00002531299,0.0000259557,0.00007343946,0.00002425359,0.3463126,0.002938079,0.6119848,0.01327978,0.0004162312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03834271,0.000204823,0.9581341,0.000457392,0.0006027347,0.0002949933,0.00002687956,0.0000737575,0.001862646],"genre_scores_gemma":[0.5753141,0.000001835365,0.4240226,0.0001513548,0.00006778996,0.00002407577,0.00008018118,0.000008513884,0.0003295841],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5369714,"threshold_uncertainty_score":0.6913306,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008078402,0.000166261,0.0001665757,0.0001597608,0.0003357043,0.00008667102,0.0009505489,0.00006490869,0.00001505826],"category_scores_gemma":[0.0003098442,0.0001004342,0.0001443046,0.001718554,0.0001284563,0.0001779789,0.0002428836,0.0002145053,0.0000307861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005559254,"about_ca_system_score_gemma":0.0001508287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006792012,"about_ca_topic_score_gemma":0.000002194328,"domain_scores_codex":[0.9979602,0.0003162352,0.000391641,0.0004019109,0.0007314875,0.0001985771],"domain_scores_gemma":[0.997058,0.001640386,0.0002469032,0.0006173779,0.0003777766,0.00005955549],"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.0000142756,0.0002183485,0.002041255,0.00001939559,0.00002365367,7.968511e-7,0.0002562477,0.2725166,0.0001317287,0.6862564,0.002658754,0.03586256],"study_design_scores_gemma":[0.0002735353,0.0001328569,0.08136027,0.00004566587,0.000008703559,0.00001687674,0.000007099947,0.7114539,0.0007072083,0.2015052,0.004320555,0.0001681092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1263873,0.00003201233,0.8650262,0.005913426,0.0003999733,0.000335898,0.000004706033,0.00006656525,0.001833858],"genre_scores_gemma":[0.9773375,0.000001534503,0.02106225,0.00128951,0.0001354588,0.00002054279,0.00001483807,0.000007929288,0.0001303844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8509502,"threshold_uncertainty_score":0.4095586,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133362,0.0002072784,0.0001941667,0.0004472575,0.0003250435,0.0002719397,0.0006624908,0.00008432352,0.0001798338],"category_scores_gemma":[0.00008136859,0.0002272791,0.0001121039,0.002297291,0.00004682046,0.0007361058,0.0001935073,0.0001643441,0.0004345592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008622147,"about_ca_system_score_gemma":0.0001652016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001739976,"about_ca_topic_score_gemma":8.32475e-7,"domain_scores_codex":[0.9979689,0.00007403529,0.0003505258,0.0005533149,0.0006676562,0.0003856374],"domain_scores_gemma":[0.9988144,0.0002609875,0.000115758,0.0003472614,0.0002610289,0.0002005645],"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.00002582634,0.0007530666,0.005433383,0.00004046138,0.0001816249,0.00009752669,0.0003036667,0.5173308,0.003107168,0.2251996,0.1356374,0.1118894],"study_design_scores_gemma":[0.001109237,0.0001400424,0.01337851,0.00002106106,0.00001720722,0.0004172279,0.00002750647,0.665841,0.0007042871,0.07961089,0.2380063,0.0007267654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05252519,0.001238225,0.9401175,0.001749266,0.0004994865,0.0001506045,0.00001488676,0.0002630331,0.003441749],"genre_scores_gemma":[0.9290631,0.00003225527,0.0663484,0.001932619,0.0002137248,0.00002314965,0.0002477069,0.00001711787,0.002121928],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8765379,"threshold_uncertainty_score":0.9268172,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002783223,0.0001583991,0.0002896235,0.0009446514,0.0002230804,0.0000571489,0.0003769571,0.00009330166,0.00001237741],"category_scores_gemma":[0.0001828061,0.0001590599,0.00006132809,0.00202164,0.0001509629,0.0002831977,0.000188138,0.0001725783,0.00003164081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003374431,"about_ca_system_score_gemma":0.00007112497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002904441,"about_ca_topic_score_gemma":6.352152e-7,"domain_scores_codex":[0.9986015,0.00003387024,0.0003318365,0.0003808345,0.0004144655,0.000237492],"domain_scores_gemma":[0.9987796,0.0005677978,0.0001608263,0.0001958643,0.0002265005,0.00006943318],"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.000006516785,0.0001241064,0.002304997,0.0000286024,0.00007442487,0.00001907869,0.0004125783,0.0299637,0.00002472672,0.9033331,0.001470724,0.06223739],"study_design_scores_gemma":[0.0005616719,0.0001989061,0.3045212,0.00002719062,0.00001107119,0.0001435369,0.00003906136,0.07529344,0.00006060515,0.6180177,0.000876975,0.0002486015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2235906,0.001410076,0.7678225,0.001677058,0.0002098152,0.0001099905,0.000006314731,0.0001903381,0.004983348],"genre_scores_gemma":[0.917292,0.00001425812,0.0820801,0.0004884069,0.00004495229,0.000002512001,0.000009490914,0.000004271684,0.00006397955],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6937014,"threshold_uncertainty_score":0.6486275,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006130221,0.0001369631,0.000166281,0.000249226,0.0002060812,0.0001003213,0.0003817889,0.00005050443,0.000119793],"category_scores_gemma":[0.0001771962,0.0001067317,0.0001169831,0.001362054,0.00004794434,0.000259116,0.00007980049,0.0001107699,0.00009695394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004341208,"about_ca_system_score_gemma":0.00009678071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001750104,"about_ca_topic_score_gemma":0.000001339148,"domain_scores_codex":[0.9983569,0.0001383199,0.0004173127,0.0002801872,0.0006369508,0.000170327],"domain_scores_gemma":[0.9973557,0.001845892,0.0002182492,0.0002484722,0.000294882,0.00003681386],"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.00002247584,0.00007374326,0.0003455873,0.000005276218,0.00001421029,0.000001257219,0.00003736082,0.4341389,0.0001301247,0.5584856,0.001783768,0.0049617],"study_design_scores_gemma":[0.001224959,0.00004287951,0.02329106,0.00002122208,0.000008509338,0.00002000041,0.000009823004,0.501005,0.001102176,0.4723989,0.0007067116,0.0001687972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2690709,0.00006389506,0.7271343,0.0008152403,0.0002396323,0.0001655845,0.000005847283,0.00005474242,0.002449848],"genre_scores_gemma":[0.968529,0.000001161761,0.03060664,0.0003314542,0.0001504384,0.00001547873,0.00006681023,0.000007835392,0.0002911718],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6994581,"threshold_uncertainty_score":0.4352391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}